every single one, versus at least one.
A single claim about one number is easy to judge — but mathematics almost always speaks about whole collections: every prime, some real number, all triangles. Two little words do this heavy lifting. For all — written ∀ — says the property holds for every member of the collection. There exists — written ∃ — says it holds for at least one. They behave like opposites at the breaking point: a for-all claim collapses the instant you find a single counterexample, while a there-exists claim is settled the instant you produce a single witness. And both are always pinned to a domain M — change the collection and the same sentence can flip from true to false.
To say a property p(x) holds for every x in a set M, we write
∀x∈M, p(x) — read "for all x in M, p of x."
The symbol ∀ is an upside-down A (for All). It is a promise about the whole collection: no exceptions allowed. "Every integer is either even or odd" is ∀n∈ℤ, n is even or odd. "Every square is non-negative" is ∀x∈ℝ, x² ≥ 0. The job of M is to say which things we are talking about — leave it out and the claim is ambiguous.
∀x∈M, p(x) is a single statement with one truth value. It is true only when p(x) holds for every x∈M at once — one failure and the whole sentence is false.
To say a property holds for at least one x in M, we write
∃x∈M, p(x) — read "there exists x in M such that p of x."
The symbol ∃ is a backward E (for Exists). It is a far weaker promise: you do not have to check everything — you only have to find one. "Some real number squares to 2" is ∃x∈ℝ, x² = 2, and the single witness √2 settles it as true. "Some natural number is prime and even" is ∃n∈ℕ, n is prime and even — the lone witness n = 2 makes it true. Producing one honest witness is the entire job.
In everyday speech "some" can hint "not all." In mathematics some means exactly at least one — it does not mean "exactly one," and it does not mean "not all." "Some integer is even" is true, and "all integers… " is a different sentence we judge separately.
∀ needs every circle green; ∃ needs just one. The readout names the witness or the counterexample.
Here is the whole asymmetry in one line. A universal has to survive every case, so it is killed by a single counterexample — one x where p(x) fails. An existential only has to succeed once, so it is proved by a single witness — one x where p(x) holds.
| Statement | Made TRUE by | Made FALSE by |
|---|---|---|
| ∀x∈M, p(x) | every x passing | one counterexample |
| ∃x∈M, p(x) | one witness | every x failing |
Is ∀x∈ℕ, x² ≥ x true? Test the small cases: 0²=0 ≥ 0 ✓, 1²=1 ≥ 1 ✓, 2²=4 ≥ 2 ✓, and for any whole number x ≥ 1 we have x² = x·x ≥ x·1 = x, while x = 0 gives 0 ≥ 0. No x∈ℕ breaks it, so the universal is true.
Now is ∃x∈ℝ, x² = −1 true? A real square is never negative, so no real witness exists — every x fails — and the existential is false. (Over the complex numbers it would be true; the domain decides.)
Keep p(x): x² ≥ x. Switch M and the universal can change from false to true.
Translating between English and symbols is mostly about spotting which quantifier the words are using and naming the domain explicitly. "Every… " / "all… " / "each… " / "any… " signal ∀; "some… " / "there is… " / "at least one… " signal ∃. Then fix M, because the very same property can be true over one domain and false over another.
| English | Symbols | Truth |
|---|---|---|
| every natural number x has x² ≥ x | ∀x∈ℕ, x² ≥ x | true |
| every real number x has x² ≥ x | ∀x∈ℝ, x² ≥ x | false (x = ½) |
Over ℕ the claim holds; over ℝ the fraction x = ½ gives ¼ which is less than ½, a clean counterexample. Identical words, opposite truth — that is why "∀x" without a stated M is incomplete. This precision is exactly the habit that makes the definitions in calculus (Stage 36, Limits) unambiguous.
A property carves out a set: P = {x∈M : p(x)}. Then ∀x∈M, p(x) says P fills all of M, and ∃x∈M, p(x) says P is non-empty. The set picture from Stage 19 · Sets is the same idea wearing different clothes.
Each sentence is checked over its stated domain; the verdict is computed, never guessed.
| Symbol | Reads | TRUE when | FALSE when | Settled by |
|---|---|---|---|---|
| ∀x∈M, p(x) | for all x in M, p(x) | every x passes | one x fails | a counterexample |
| ∃x∈M, p(x) | there exists x in M, p(x) | one x passes | every x fails | a witness |
Always name the domain M — change M and the truth can flip. "Some" means at least one, never "exactly one" and never "not all." Next, in 35.4 · Negation, we turn these around: the negation of "all are positive" is "some is not positive," never "all are negative."
Translate to symbols, naming the domain: "every natural number is greater than or equal to 0."
∀n∈ℕ, n ≥ 0. "Every" signals ∀; the domain is ℕ. It is true — no natural number is negative, so there is no counterexample.
True or false, and justify: ∃x∈ℝ, x + 5 = 5.
True. We only need one witness, and x = 0 works: 0 + 5 = 5. One witness settles an existential.
Decide: ∀x∈ℝ, x² > 0. If false, give the counterexample.
False. The counterexample is x = 0, where 0² = 0, which is not greater than 0. A single counterexample kills a universal. (Note: ∀x∈ℝ, x² ≥ 0 is true.)
The same property p(x): x is even. Over M = {2, 4, 6}, is ∀x∈M, p(x) true? Over M = {2, 3, 4}?
Over {2, 4, 6}: true — all three are even. Over {2, 3, 4}: false — the counterexample is x = 3. Same words, different domain, opposite truth.
A student says: "Some primes are even, so not all primes are odd — but some really means there's exactly one such prime." What is right and what is wrong?
The witness x = 2 does make "∃ an even prime" true, and that single witness does disprove "all primes are odd." But "some" only means at least one — it is not a claim of exactly one. (Here there happens to be exactly one even prime, but "some" never asserts that.)
Translate and judge: "there is a real number whose square is less than the number itself."
∃x∈ℝ, x² < x. This is true: the witness x = ½ gives ¼ which is less than ½. One witness is enough.
Six questions to lock it in. Tap the answer you think is right.
This lesson introduces the universal (∀) and existential (∃) quantifiers, the idea that a universal is disproved by one counterexample while an existential is proved by one witness, and the discipline of stating the domain M so a claim has a definite truth value. It strengthens MP3 (construct viable arguments and critique the reasoning of others) and MP6 (attend to precision), and lays the language groundwork that precise definitions across the HSF (Functions) and HSA (Algebra) standards quietly rely on. A good home check: ask your student to give one counterexample that breaks "all squares are even," then one witness that proves "some square is odd."