'For all' (∀) and 'there exists' (∃) turn an open sentence into a statement over a stated set. The negation swaps them: ∼(∀xP(x))≡∃x∼P(x)
Lesson 3 of 3Show all lessonsHide
Try the code and the simulations beside the lesson.
What you will be able to do
read statements with "for all" and "there exists";
write their negations correctly, in words and in symbols;
disprove a statement with a counterexample;
see why the order of two quantifiers matters.
Two kinds of claim
A teacher says: "Every student in this room has a pencil." A friend says: "Someone in this room has a red pencil." The first claim is about all the students. The second needs only one.
Words like "every" and "some" are quantifiers.
The universal quantifier "for all", "for every", "for each" is written ∀.
The existential quantifier "there exists", "for some", "at least one" is written ∃.
Each one turns an open sentence into a statement. "x2≥0" is an open sentence. "For every real x, x2≥0" is a true statement:
∀x∈R,x2≥0.
"There exists a real x with x2=2" is true too. But over the rational numbers it is false, because 2 is not rational. The set the variable runs over is part of the statement.
How to show each one
To show "for all x, P(x)" is true, you need an argument that covers every x. Checking examples is not enough.
To show it is false, one counterexample is enough: one x with P(x) false.
To show "there exists x with P(x)" is true, one example is enough.
To show it is false, you must show P(x) fails for every x.
Example. "For every prime p, p is odd" is false. The counterexample is p=2.
Negating a quantified statement
What is the negation of "Every student has a pencil"? It is not "Every student has no pencil". It is "Some student has no pencil". One student without a pencil is enough to make the claim false.
∼(∀xP(x))≡∃x∼P(x);
∼(∃xP(x))≡∀x∼P(x).
In words: the negation changes "all" to "some", changes "some" to "all", and negates what follows.
"There is a rational number r with r2=2." Negation: "For every rational number r, r2=2."
"All the lamps are on." Negation: "At least one lamp is not on."
"No square number ends in 7" means "every square number does not end in 7". Its negation is "some square number ends in 7".
Two quantifiers: the order matters
Over the integers, compare these.
∀x∃y(x+y=0): for every x there is a y with x+y=0. True: take y=−x. The y may depend on x.
∃y∀x(x+y=0): one single y works for every x. False: no number cancels every integer at once.
To negate a statement with two quantifiers, swap each one and negate the end:
∼(∀x∃yP)≡∃x∀y∼P.
Practise with new numbers
Try it in Python
On a finite set, Python's all() is "for all" and any() is "there exists". The program tests a few claims about the numbers from 1 to 30 and prints a counterexample when a claim fails.
Common mistakes
Proving a for-all statement by examples. Ten examples do not cover every case. One counterexample does disprove it.
Negating "all" to "none". The negation of "all are on" is "some are not on".
Forgetting the set. A statement can be true over the real numbers and false over the rational numbers.
Swapping the order of two quantifiers. "∀x∃y" and "∃y∀x" are different claims.
Remember these
∀ means for all, ∃ means there exists.
∼∀≡∃∼ and ∼∃≡∀∼.
One counterexample disproves a for-all statement.
The order of different quantifiers matters.
Check yourself
Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.
Write the negation of "Every train today left on time".
Is "for every real x, x2>x" true? If not, give a counterexample.
Write the negation of ∃x∈N,x+3=1, and say which of the two is true.
Over the real numbers, is ∀x∃y(y>x) true? Is ∃y∀x(y>x) true?
Write the negation of "No prime number is even" and give its truth value.
References
NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14, section 14.5 on quantifiers.
OpenStax, Contemporary Mathematics, Chapter 2, section on statements and quantifiers.
Enroll free in Conditionals, Contrapositives and Quantifiers
Every lesson is open to read. Enrolling also lets you:
Mark lessons done and carry on where you stopped.
Take the tests of this lesson and its course.
Count the course towards the certificate for its chapter.