Logic and Proof Techniques

Definition

A proposition is a sentence that is either true or false (not both !)
We can combine propositions to obtain a new proposition. In order to do that, we can use logical connectives.

SymbolNameIntuition
¬\negnegationnot
$\wedgeconjunctionand
\veedisjunctionor
\toimplicationif ... then
    \iffequivalenceif and only if
\oplusexclusiveeither
\forallfor allall have to be true
\existsthere existsat least one

Negation of Predicates

  • ¬(xP(x))x¬P(x)\neg(\forall x P(x)) \equiv \exists x \neg P(x)
  • ¬(xP(x))x¬P(x)\neg(\exists x P(x)) \equiv \forall x \neg P(x)

Examples

For each of the following examples, write the expression with the help of quantifiers and logical operators. Determine if the expression is true of false. Indicate the method of proof used and ... prove it!

1. Prove or disprove: The sum of two odd integers is an even integer.

Written as quantifiers: x yZ (I(x)I(y)¬I(x+y))\forall x \ \forall y \in \Z \ (I(x) \wedge I(y) \to \neg I(x+y)), where I(x)I(x) means "x is odd"

Here is a direct proof. An arbitrary odd integer, nn, has the formula n=2k+1n= 2k+1, where kZk \in \Z. Hence if we take 2 odd integers, aa & bb, we get a+b=(2k+1)+(2k+1)=4k+2=2(2k+1)a+b = (2k+1) + (2k+1) = 4k+2 = 2(2k+1) (I know the middle step is useless, but I kept it just for the sake of it). Now we are left with 2(2k+1)2(2k+1) where (2k+1)(2k+1) can be thought as any integer, say xx. So 2x2x is clearly divisible by 22, hence it must be even. This proves that the sum of two odd integers is an even integer.

2. Prove or disprove: The equation below admits a real-numbered solution.

x2+3x+3=0x^2 + 3x + 3 = 0

Written as quantifiers: xR (x2+3x+3=0)\exists x \in \R \ (x^2+3x+3 = 0)

This proof is straightforward. If you use the quadratic formula you'll get roots 3+3i2\frac{-3+3i}{2} and 33i2\frac{-3-3i}{2}. As you can none of the roots belong to R\R. Hence disproving the statement.

3. Prove or disprove: Let x be an integer. If the square of x is an even integer, then x is even.

Written as quantifiers: xZ (P(x2)P(x))\forall x \in \Z \ (P(x^2) \to P(x)) where P(x)P(x) means "x is even."

This can be proved using a proof by contraposition. Here we are trying to prove that ¬P(x)¬P(x2)\neg P(x) \to \neg P(x^2). If xx is not even, then x=2k+1x = 2k+1, where kZk \in \Z. Hence x2x^2 will be 4k2+4k+1=(2k2+2k)+14k^2 +4k+1 = (2k^2+2k) + 1, where the part in the parentheses can be thought of as kZk \in \Z. Hence we have proved that if xx is not even, then its square is also not even, which in turn proves our initial statement.

4. Prove or disprove: Let m and n be two integers. If the product of the two is even, then m is even or n is even.

Written as quantifiers: m nZ(P(mn)P(m)P(n))\forall m \ \forall n \in \Z (P(m \cdot n) \to P(m) \wedge P(n))

Similarly, this can be proved by contraposition. So we are trying to prove ¬(P(m)P(n))¬P(mn)\neg (P(m) \wedge P(n)) \to \neg P(m \cdot n) which can be simplified to ¬P(m)¬P(n)¬P(mn)\neg P(m) \vee \neg P(n) \to \neg P(m \cdot n). Let m=2k+1,n=2x+1m = 2k + 1, n = 2x + 1, where k,xZk,x \in \Z. Thus we get (2k+1)(2x+1)=4kx+2k+2x+1=2(2kx+k+x)+12k+1(2k+1)(2x+1) = 4kx + 2k + 2x + 1 = 2(2kx + k +x) + 1 \equiv 2k+1. Hence we proved that if mm and nn are both odd, then their product is odd as well. This proves the initial statement.

5. Prove or disprove: If x & y are multiples of 3, then 3x+2y is odd.

Written as quantifiers: x yZ(M(x)M(y)I(3x+2y))\forall x \ \forall y \in \Z (M(x) \wedge M(y) \to I(3x+2y)) where M(x)M(x) means "x is a multiple of 3".

This statement is false, because if we take x=0,y=9x = 0, y = 9 then we get 1818 which is not odd.

6. Prove or disprove: The square root of 2 is irrational.

This statement is true. Here is a proof by contradiction. We want to prove that 2\sqrt{2} is not irrational, in other words it is rational. Suppose that 2\sqrt{2} is ratonal, i.e. (2)Q\sqrt(2) \in \mathbb{Q}. If a number is rational, it can be written as a fraction. Hence, that means that 2=mn\sqrt{2} = \frac{m}{n} for some integers m,nm,n not equal to 00 and this fraction is reduced. 2=mnm2=2n2\sqrt{2} = \frac{m}{n} \Rightarrow m^2 = 2n^2. This means m2m^2 is even and we proved in an earlier proof that mm is also even. Therefore, m=2k4k2=2n22k2=n2m=2k \Rightarrow 4k^2 = 2n^2 \Rightarrow 2k^2 = n^2. This means that n2n^2 is also even, and so is nn. Let n=2ln=2l. Hence we get mn=2k2l\frac{m}{n} = \frac{2k}{2l} which is not reduced. Hence we have a contradiction.

7. Prove or disprove: If x is a positive real number, then the root of x is less than x.

Written as quantifiers: xR+(x<x)\forall x \in \R^+ (\sqrt{x} < x).

This statement is false. If we take x=1/41/4=1/21/2>1/4x>xx=1/4 \Rightarrow \sqrt{1/4} = 1/2 \Rightarrow 1/2 > 1/4 \Rightarrow \sqrt{x} > x