"Our school team will win on Saturday." "Every prime number is odd." "2+2=5." Mathematics, like a good argument, is built from sentences that can be judged: either they are right or they are wrong. This lesson gives you the language for saying exactly what you mean, and for checking whether it is true.
What is a statement?
A sentence like (d), which contains a variable and becomes a statement once the variable is given a value, is called a statement containing variables (in Vietnamese, mệnh đề chứa biến). We write it P(x): for example P(x): "x+1=5". Then P(4) is true and P(0) is false.
Negation
The negation of a statement P, written P, says the opposite. It is true exactly when P is false, and false exactly when P is true.
P
P
true
false
false
true
Implication and equivalence
Think of a promise: "If you pass the exam, I will buy you a phone." We write it P⇒Q with P: "you pass", Q: "I buy you a phone".
The promise is broken only if you pass and get no phone. If you fail, the promise says nothing, so it is not broken.
The converse of P⇒Q is Q⇒P. A true implication can have a false converse.
For example, "a triangle has three equal sides ⇔ it has three equal angles" is true.
Necessary and sufficient conditions
When P⇒Q is true we say:
P is a sufficient condition for Q (knowing P is enough to be sure of Q);
Q is a necessary condition for P (if Q fails, P cannot hold).
When P⇔Q is true, each is a necessary and sufficient condition for the other.
Quantifiers: "for all" and "there exists"
∀ means "for all" (for every). The statement ∀x∈X,P(x) says that P(x) holds for every x in X.
∃ means "there exists" (at least one). The statement ∃x∈X,P(x) says that at least one x in X makes P(x) true.
Negating quantifiers
To show "everything has property P" is wrong you need just one thing without it. To show "something has property P" is wrong you must show that nothing has it. Hence:
Disproving by a counter-example
To prove that a statement "∀x,P(x)" is false, it is enough to give one value of x for which P(x) is false. Such a value is a counter-example. (Examples never prove a "for all" statement, but one counter-example disproves it.)
Key terms
Summary
A statement is a sentence that is true or false, never both; a sentence with a variable becomes a statement when the variable gets a value.
P has the opposite truth value of P. P⇒Q is false only when P is true and Q is false.
P⇔Q means P⇒Q and Q⇒P. If P⇒Q: P is sufficient for Q, Q is necessary for P.
The negation of ∀ is ∃ and the negation of ∃ is ∀, with the property negated.
One counter-example disproves a "for all" statement.
Practice
Show solutions
(a) A statement, false (15=4×3+3). (b) Not a statement: it depends on x. (c) Not a statement: it is a request. (d) A statement, true.
(a) "17 is not a prime number"; the statement is true, the negation false. (b) "5<3"; the statement is true, the negation false. (c) "2 is not rational"; the statement is false, the negation true.
Q⇒P: "If x2=9 then x=3." It is false: x=−3 gives x2=9 but x=3.
Converse: "If a number is divisible by 5 then it ends in 0." The original is true (10k=5⋅2k). The converse is false: 15 is a counter-example.
(a) "ABCD is a square" ⇒ "ABCD is a rectangle" is true, the converse is false, so sufficient. (b) a=0⇒ab=0 is true; ab=0⇒a=0 is false (take b=0, a=1), so sufficient. (c) x even ⇒x+1 odd, and x+1 odd ⇒x even, so necessary and sufficient.
(a) True. (b) False. (c) True: n=0 (or n=1) gives n2=n. (d) False: n=1 gives 1>1, which is wrong.
Negation: "∀x∈R,x2−4x+4≥0". Since x2−4x+4=(x−2)2≥0 for all x, the negation is true and the original is false.
(a) 2 is prime and even. (b) x=−2: x2=4>1 but x=−2 is not greater than 1.
It is false: "⇐" holds (x=2⇒x2=4) but "⇒" fails (x=−2). A true version: "x2=4⇔x=2 or x=−2", or "x2=4 and x>0⇔x=2".
(⇒) If n=2k then n2=4k2=2⋅2k2 is even. (⇐) Suppose n is odd, n=2k+1. Then n2=4k2+4k+1=2(2k2+2k)+1 is odd. So if n2 is even, n cannot be odd, hence n is even. Both directions hold, so the equivalence is true.