universal quantifier

The universal quantifier is the phrase “for all” (symbol ∀), which turns an open sentence about x into a claim that it holds for every element in a specified domain. “For all real x, x^2 ≥ 0” asserts the property x^2 ≥ 0 simultaneously for each real number, infinitely many statements rolled into one. The domain matters: “for all natural n, n ≥ 1” is true over the positive integers but false if 0 is admitted.

To prove a universal statement you must establish the property for an arbitrary, fixed-but-otherwise-unspecified element — you cannot check them one by one when there are infinitely many. The standard move is “let x be an arbitrary real number” and then argue using only properties true of every real number. To disprove a universal statement, by contrast, a single counterexample suffices: one bad x kills “for all x”.

Quantifiers are the heartbeat of analysis. The epsilon–delta definition of a limit reads “for all epsilon > 0, there exists delta > 0, such that for all x with 0 < |x − a| < delta, we have |f(x) − L| < epsilon” — a stack of nested quantifiers whose order is not interchangeable. Reading and manipulating such strings fluently is the single most important language skill in the subject.