Lesson 2: Statements, negation and quantifiers
Negating quantified statements
SkillNegation and quantifiers
Worked example
Write the negation of each statement, in words or symbols. For (b) and (c), state which is true: the statement or its negation.
(a) Every student in the class owns a phone.
(b)
(c) For all , if is prime then is odd.
Step 1: Negate (a)
"Every student owns a phone" is false as soon as one student does not. Negation: "There is a student in the class who does not own a phone."
Not "no student owns a phone": that is far stronger than the negation.
Step 2: Negate (b)
Swap for and negate the equation: . Since and , no integer squares to 50, so the negation is true.
Step 3: Negate the implication in (c)
The negation of " for all " is "there is an with and not ": such that is prime and is even.
An implication fails only when the hypothesis holds and the conclusion does not.
Step 4: Decide (c)
is prime and even, so the negation is true and the original statement is false.
Answer
(a) Some student in the class does not own a phone (which one is true depends on the class). (b) ; the negation is true. (c) There is a positive integer that is prime and even; the negation is true ().
Try a similar one
A fresh question of the same kind, checked as you answer, with hints and a full solution.
Method
Swap .
Negate the property: becomes , becomes , "" becomes " and not ".
Keep the set the variable comes from.
Watch out for
Negating "if is prime then is odd" as "if is prime then is even". The negation of an implication is not an implication.