The Existential Quantifier (∃)
You'll learn how to express "there exists at least one" statements using mathematical logic notation.
What Does "There Exists" Mean?
In everyday language, we often make claims like "There exists a prime number greater than 100" or "Someone in this room is left-handed." The existential quantifier, symbolized as ∃, formalizes this concept in mathematical logic.
The notation ∃x P(x) reads as "There exists an x such that P(x) is true" or simply "There exists an x where P(x)." This statement is true if we can find at least one element in our domain that makes the predicate P(x) true.
How It Works
Consider the predicate P(x): "x is an even prime number" over the domain of natural numbers.
- ∃x P(x) means "There exists a natural number x that is an even prime."
- This statement is true because x = 2 satisfies it. We only need one example!
Compare this to the universal quantifier from the previous lesson:
- ∀x P(x) would mean "All natural numbers are even primes" — clearly false
- ∃x P(x) just needs one witness: finding 2 is enough
Contrast with Universal Quantification
While ∀ (for all) requires every element to satisfy the condition, ∃ (there exists) only requires at least one. Think of ∀ as a strict teacher demanding perfection from everyone, while ∃ is satisfied if even a single student succeeds.
Common Phrasings
- ∃x P(x): "There exists an x such that P(x)"
- "For some x, P(x)"
- "At least one x satisfies P(x)"
Key Takeaway: The existential quantifier ∃ asserts that at least one element in the domain makes a predicate true; ∃x P(x) is true if you can find even a single witness.