Methods of Proof

(chapter 3 of the book, except 3.5 and 3.8)

Lecture 4: Sep 20

This Lecture
Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical theorems. Since we will talk about number theory later, we will use examples from elementary number theory to illustrate different proof techniques including: Direct proof Contrapositive Proof by contradiction Proof by cases

Basic Definitions

An integer n is an even number if there exists an integer k such that n = 2k.

An integer n is an odd number if there exists an integer k such that n = 2k+1.

Proving an Implication
Goal: If P, then Q. (P implies Q)

Method 1: Write assume P, then show that Q logically follows.

The sum of two even numbers is even. Proof x = 2m, y = 2n x+y = 2m+2n = 2(m+n)

Direct Proofs
The product of two odd numbers is odd. Proof x = 2m+1, y = 2n+1 xy = (2m+1)(2n+1) = 4mn + 2m + 2n + 1 = 2(2mn+m+n) + 1. If m and n are perfect square, then m+n+2(mn) is a perfect square. Proof m = a2 and n = b2 for some integers a and b Then m + n + 2(mn) = a2 + b2 + 2ab = (a + b)2 So m + n + 2(mn) is a perfect square.

Divisibility
a divides b (a|b):

b = ak for some integer k 5|15 because 15 = 35 n|0 because 0 = n0 1|n because n = 1n n|n because n = n1 A number p > 1 with no positive integer divisors other than 1 and itself is called a prime. Every other number greater than 1 is called composite. 2, 3, 5, 7, 11, and 13 are prime, 4, 6, 8, and 9 are composite.

Simple Divisibility Facts

1. If a | b, then a | bc for all c. 2. If a | b and b | c, then a | c. 3. If a | b and a | c, then a | sb + tc for all s and t. 4. For all c 0, a | b if and only if ca | cb.

Proof of (1) a|b b = ak bc = ack bc = a(ck) a|bc a divides b (a|b): b = ak for some integer k

Simple Divisibility Facts

1. If a | b, then a | bc for all c. 2. If a | b and b | c, then a | c. 3. If a | b and a | c, then a | sb + tc for all s and t. 4. For all c 0, a | b if and only if ca | cb.

Proof of (2) a | b => b = ak1 b | c => c = bk2 => c = ak1k2 => a|c a divides b (a|b):

b = ak for some integer k

Simple Divisibility Facts

1. If a | b, then a | bc for all c. 2. If a | b and b | c, then a | c. 3. If a | b and a | c, then a | sb + tc for all s and t. 4. For all c 0, a | b if and only if ca | cb.

Proof of (3) a | b => b = ak1 a | c => c = ak2 sb + tc = sak1 + tak2 = a(sk1 + tk2) => a|(sb+tc) a divides b (a|b): b = ak for some integer k

This Lecture

Direct proof Contrapositive Proof by contradiction Proof by cases

Proving an Implication
Goal: If P, then Q. (P implies Q)

Method 1: Write assume P, then show that Q logically follows.

Claim:

If r is irrational, then r is irrational. How to begin with?

What if I prove If r is rational, then r is rational, is it equivalent? Yes, this is equivalent, because it is the contrapositive of the statement, so proving if P, then Q is equivalent to proving if not Q, then not P.

Rational Number
R is rational there are integers a and b such that

numerator and b 0. denominator Is 0.281 a rational number? Is 0 a rational number? Yes, 281/1000 Yes, 0/1 Yes

If m and n are non-zero integers, is (m+n)/mn a rational number?

Is the sum of two rational numbers a rational number? Yes, a/b+c/d=(ad+bc)/bd Is x=0.12121212 a rational number? Note that 100x-x=12, and so x=12/99.

Proving the Contrapositive

Goal: If P, then Q. (P implies Q)

Method 2: Prove the contrapositive, i.e. prove not Q implies not P.

Claim: Proof:

If r is irrational, then r is irrational.

We shall prove the contrapositive if r is rational, then r is rational. Since r is rational, r = a/b for some integers a,b. So r = a2/b2. Since a,b are integers, a2,b2 are integers. Therefore, r is rational. Q.E.D.

(Q.E.D.)

"which was to be demonstrated", or quite easily done.

Proving an if and only if

Goal: Prove that two statements P and Q are logically equivalent, that is, one holds if and only if the other holds.

Example: For an integer n, n is even if and only if n2 is even.

Method 1: Prove P implies Q and Q implies P. Method 1: Prove P implies Q and not P implies not Q.

Method 2: Construct a chain of if and only if statement.

Proof the Contrapositive

For an integer n, n is even if and only if n2 is even. Method 1: Prove P implies Q and Q implies P. Statement: If n is even, then n2 is even Proof: n = 2k n2 = 4k2 Statement: If n2 is even, then n is even Proof: n2 = 2k n = (2k) ??

Proof the Contrapositive

For an integer n, n is even if and only if n2 is even. Method 1: Prove P implies Q and not P implies not Q. Statement: If n2 is even, then n is even Contrapositive: If n is odd, then n2 is odd. Proof (the contrapositive): Since n is an odd number, n = 2k+1 for some integer k. So n2 = (2k+1)2 = (2k)2 + 2(2k) + 1 = 2(2k2 + 2k) + 1 So n2 is an odd number.

This Lecture

Direct proof Contrapositive Proof by contradiction Proof by cases

Proof by Contradiction

PpF P
To prove P, you prove that not P would lead to ridiculous result, and so P must be true.

Proof by Contradiction
Theorem:

is irrational.

Proof (by contradiction):

Suppose

was rational.

Choose m, n integers without common prime factors (always possible) such that

m 2! n

Show that m and n are both even, thus having a common factor 2, a contradiction!

Proof by Contradiction
Theorem:

is irrational. Want to prove both m and n are even.

Proof (by contradiction):

m 2! n

so can assume

m ! 2l
2

m 2 ! 4l 2 2n ! 4l
2

2n ! m
2n 2 ! m 2
so m is even.

n 2 ! 2l 2
so n is even.

Infinitude of the Primes

Theorem. There are infinitely many prime numbers. Proof (by contradiction): Assume there are only finitely many primes. Let p1, p2, , pN be all the primes. We will construct a number N so that N is not divisible by any pi. By our assumption, it means that N is not divisible by any prime number. On the other hand, we show that any number must be divided by some prime. It leads to a contradiction, and therefore the assumption must be false. So there must be infinitely many primes.

Divisibility by a Prime
Theorem. Any integer n > 1 is divisible by a prime number. Let n be an integer. If n is a prime number, then we are done. Otherwise, n = ab, both are smaller than n. If a or b is a prime number, then we are done. Otherwise, a = cd, both are smaller than a. If c or d is a prime number, then we are done. Otherwise, repeat this argument, since the numbers are getting smaller and smaller, this will eventually stop and we have found a prime factor of n. Idea of induction.

Infinitude of the Primes

Theorem. There are infinitely many prime numbers. Proof (by contradiction): Let p1, p2, , pN be all the primes. Consider p1p2pN + 1. Claim: if p divides a, then p does not divide a+1. Proof (by contradiction): a = cp for some integer c a+1 = dp for some integer d => 1 = (d-c)p, contradiction because p>=2. So none of p1, p2, , pN can divide p1p2pN + 1, a contradiction.

This Lecture

Direct proof Contrapositive Proof by contradiction Proof by cases

Proof by Cases

e.g. want to prove a nonzero number always has a positive square. x is positive or x is negative if x is positive, then x2 > 0. if x is negative, then x2 > 0. x2 > 0.

The Square of an Odd Integer

Idea 0: find counterexample. 32 = 9 = 8+1, 52 = 25 = 3x8+1 1312 = 17161 = 2145x8 + 1,

Idea 1: prove that n2 1 is divisible by 8. n2 1 = (n-1)(n+1) = ?? Idea 2: consider (2k+1)2 (2k+1)2 = 4k2+4k+1 If k is even, then both k2 and k are even, and so we are done. If k is odd, then both k2 and k are odd, and so k2+k even, also done.

Rational vs Irrational
Question: If a and b are irrational, can ab be rational?? We (only) know that 2 is irrational, what about 22 ? Case 1: 22 is rational Then we are done, a=2, b=2. Case 2: 22 is irrational Then (22)2 = 22 = 2, a rational number So a=22, b= 2 will do. So in either case there are a,b irrational and ab be rational. We dont (need to) know which case is true!

Summary
We have learnt different techniques to prove mathematical statements. Direct proof Contrapositive Proof by contradiction Proof by cases

Next time we will focus on a very important technique, proof by induction.