Lesson 2 of 8 · 15 min
Statements, negation and quantifiers
Recognise statements, write their negations, and read, write and negate statements that use "for all" (∀) and "there exists" (∃).
What you will be able to do
- Recognise a statement as a sentence that is either true or false.
- Write the negation of a statement, including inequalities.
- Read and write statements with the quantifiers and , and decide whether they are true.
- Negate a quantified statement by swapping and and negating the property.
"Every even number greater than 2 is the sum of two primes." Nobody knows whether that sentence is true; it has been checked up to but never proved. Still, it is definitely one or the other. That is what makes it a statement.
Proof works with statements. Before you can prove one, you need to read it precisely: what does it claim, about which numbers, and what would it mean for it to be false?
Definition
Statement
A statement is a sentence that is either true or false (not both).
- "7 is prime" is a true statement. "" is a false statement.
- "Is 7 prime?" is a question, not a statement.
- "" is not yet a statement: it is true or false depending on . It becomes one when is given, or when it is quantified, as below.
Negation. The negation of a statement is "not ", written (some books write ). It is true exactly when is false.
| T | F |
| F | T |
The negation of "" is "", not "": the case must go somewhere. The negation of " is even" is " is odd" when . The negation of "" is "".
What is the negation of the statement ""?
Definition
Quantifiers
- means "for all" (or "for every"). says "for every integer , ".
- means "there exists" (at least one). says "there is a real number with ".
A "for all" statement is true only if the property holds for every element. A "there exists" statement is true as soon as one element works.
The solid curve stays above the -axis, so is true. The dashed curve does not, so is false, and its negation is true (try ).
Worked example
True or false with quantifiers
Decide whether each statement is true or false. Justify your answers.
(a)
(b)
(c)
Step 1: Complete the square in (a)
. Since for every real , .
A "for all" statement needs an argument that covers every at once, not a few test values.
Step 2: Find one example for (b)
gives .
A "there exists" statement is proved by a single example.
Step 3: Notice (c) is the negation of (b)
(c) says the expression is never negative, which is exactly the negation of (b). Since (b) is true, (c) is false; is a counterexample.
Try it yourself first, then check the working one step at a time.
Answer
(a) True, since . (b) True: gives . (c) False: is a counterexample.
Method
For : give a general argument, or one counterexample if it is false.
For : give one example, or a general argument if it is false.
A statement and its negation always have opposite truth values.
Watch out for
Checking in (a) and calling it proved.
Select every true statement.
Key idea
Negating a quantified statement
To negate, swap the quantifier and negate the property:
"Not every student passed" means "some student did not pass". "There is no real with " means "every real has ".
Worked example
Negating quantified statements
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.
Try it yourself first, then check the working one step at a time.
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 ().
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.
Common mistake
The negation of "all" is not "none"
The negation of "all swans are white" is "at least one swan is not white". "No swans are white" is far stronger, and both statements could be false at once. In symbols: the negation of is , not .
Which statement is the negation of ?
Extension: the order of quantifiers matters
Compare two statements about positive integers.
- : "for every there is a bigger ". True: take . Here may depend on .
- : "there is one bigger than every ". False: whichever you pick, is not smaller than it.
The same symbols in a different order make a different claim. Read quantifiers from left to right.
Summary
A statement is a sentence that is either true or false.
The negation is true exactly when is false. The negation of is .
means "for all"; means "there exists at least one".
One failure makes a statement false; one success makes an statement true.
To negate a quantified statement, swap and and negate the property.
Finished the lesson?
Try the 3 quick checks above and the lesson completes itself, or mark it complete now.