Universal and Existential Quantifiers

Intro to Proofs · Axiom Academy

LESSON Universal and Existential Quantifiers Master the symbols ∀ (for all) and ∃ (there exists) to make precise mathematical statements about entire domains. 1. The Universal Quantifier (∀) The universal quantifier ∀ (an upside-down A, for " All ") makes a claim about every element in a set. For the statement to be true, we must verify that P(x) holds for each and every x in the domain. 2. The Existential Quantifier (∃) The existential quantifier ∃ (a backwards E, for " Exists ") claims that at least one element satisfies the property. The statement is true the moment we can find even a single witness where P(x) holds. When quantifiers are nested, their order is crucial. Swapping them can completely change the meaning — and the truth value — of a statement. "For every x, there exists some y." Each x may have a different y. "There exists one y that works for all x." The same y must work for every x. 4. Negating Quantified Statements Knowing how to negate quantifiers is essential for proof writing. The key insight: negation "flips" the quantifier and negates the inner statement. ¬(∀x P(x)) ≡ ∃x ¬P(x) "Not all have P" means "at least one lacks P." ¬(∃x P(x)) ≡ ∀x ¬P(x) "None exists with P" means "all lack P." You can now read and write the two quantifiers, reason about their order, and negate any quantified statement — the building blocks of every rigorous proof.

This is the written version of the interactive lesson above. See the full Intro to Proofs course.