Lemonmath
Tiếng Việt

Statements (propositions)

Lesson 1.1 · 15 min read · Updated

"Our school team will win on Saturday." "Every prime number is odd." "2+2=52+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)P(x): for example P(x)P(x): "x+1=5x+1=5". Then P(4)P(4) is true and P(0)P(0) is false.

Negation

The negation of a statement PP, written P‾\overline{P}, says the opposite. It is true exactly when PP is false, and false exactly when PP is true.

PP P‾\overline{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⇒QP \Rightarrow Q with PP: "you pass", QQ: "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⇒QP \Rightarrow Q is Q⇒PQ \Rightarrow P. A true implication can have a false converse.

For example, "a triangle has three equal sides ⇔\Leftrightarrow it has three equal angles" is true.

Necessary and sufficient conditions

When P⇒QP \Rightarrow Q is true we say:

  • PP is a sufficient condition for QQ (knowing PP is enough to be sure of QQ);
  • QQ is a necessary condition for PP (if QQ fails, PP cannot hold).

When P⇔QP \Leftrightarrow Q is true, each is a necessary and sufficient condition for the other.

Quantifiers: "for all" and "there exists"

  • ∀\forall means "for all" (for every). The statement ∀x∈X, P(x)\forall x \in X,\ P(x) says that P(x)P(x) holds for every xx in XX.
  • ∃\exists means "there exists" (at least one). The statement ∃x∈X, P(x)\exists x \in X,\ P(x) says that at least one xx in XX makes P(x)P(x) true.

Negating quantifiers

To show "everything has property PP" is wrong you need just one thing without it. To show "something has property PP" is wrong you must show that nothing has it. Hence:

Disproving by a counter-example

To prove that a statement "∀x, P(x)\forall x,\ P(x)" is false, it is enough to give one value of xx for which P(x)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‾\overline{P} has the opposite truth value of PP. P⇒QP \Rightarrow Q is false only when PP is true and QQ is false.
  • P⇔QP \Leftrightarrow Q means P⇒QP \Rightarrow Q and Q⇒PQ \Rightarrow P. If P⇒QP \Rightarrow Q: PP is sufficient for QQ, QQ is necessary for PP.
  • The negation of ∀\forall is ∃\exists and the negation of ∃\exists is ∀\forall, with the property negated.
  • One counter-example disproves a "for all" statement.

Practice

Show solutions
  1. (a) A statement, false (15=4×3+315=4\times 3+3). (b) Not a statement: it depends on xx. (c) Not a statement: it is a request. (d) A statement, true.
  2. (a) "1717 is not a prime number"; the statement is true, the negation false. (b) "5<35<3"; the statement is true, the negation false. (c) "2\sqrt{2} is not rational"; the statement is false, the negation true.
  3. Q⇒PQ \Rightarrow P: "If x2=9x^2=9 then x=3x=3." It is false: x=−3x=-3 gives x2=9x^2=9 but x≠3x\ne 3.
  4. Converse: "If a number is divisible by 55 then it ends in 00." The original is true (10k=5⋅2k10k=5\cdot 2k). The converse is false: 1515 is a counter-example.
  5. (a) "ABCD is a square" ⇒\Rightarrow "ABCD is a rectangle" is true, the converse is false, so sufficient. (b) a=0⇒ab=0a=0 \Rightarrow ab=0 is true; ab=0⇒a=0ab=0 \Rightarrow a=0 is false (take b=0b=0, a=1a=1), so sufficient. (c) xx even ⇒x+1\Rightarrow x+1 odd, and x+1x+1 odd ⇒x\Rightarrow x even, so necessary and sufficient.
  6. (a) True. (b) False. (c) True: n=0n=0 (or n=1n=1) gives n2=nn^2=n. (d) False: n=1n=1 gives 1>11>1, which is wrong.
  7. Negation: "∀x∈R, x2−4x+4≥0\forall x\in\mathbb{R},\ x^2-4x+4\ge 0". Since x2−4x+4=(x−2)2≥0x^2-4x+4=(x-2)^2\ge 0 for all xx, the negation is true and the original is false.
  8. (a) 22 is prime and even. (b) x=−2x=-2: x2=4>1x^2=4>1 but x=−2x=-2 is not greater than 11.
  9. It is false: "⇐\Leftarrow" holds (x=2⇒x2=4x=2\Rightarrow x^2=4) but "⇒\Rightarrow" fails (x=−2x=-2). A true version: "x2=4⇔x=2x^2=4 \Leftrightarrow x=2 or x=−2x=-2", or "x2=4x^2=4 and x>0⇔x=2x>0 \Leftrightarrow x=2".
  10. (⇒\Rightarrow) If n=2kn=2k then n2=4k2=2⋅2k2n^2=4k^2=2\cdot 2k^2 is even. (⇐\Leftarrow) Suppose nn is odd, n=2k+1n=2k+1. Then n2=4k2+4k+1=2(2k2+2k)+1n^2=4k^2+4k+1=2(2k^2+2k)+1 is odd. So if n2n^2 is even, nn cannot be odd, hence nn is even. Both directions hold, so the equivalence is true.