Discrete Structures - CB0246

Mathematical Induction

Andrs Sicard-Ramrez

EAFIT University

Semester 2014-2
 Motivation

Example
Conjecture a formula for the sum of the first positive odd integers.

Discrete Structures - CB0246. Mathematical Induction 2/39

 Motivation

Example
Conjecture a formula for the sum of the first positive odd integers.

Problem
Let () be a propositional function. How can we proof that () is true
for all + ?

Discrete Structures - CB0246. Mathematical Induction 3/39

 Principle of Mathematical Induction

Definition (Principle of mathematical induction)

Let () be a propositional function.
To prove that () is true for all + , we must make two proofs:
Basis step: Prove (1)

Discrete Structures - CB0246. Mathematical Induction 4/39

 Principle of Mathematical Induction

Definition (Principle of mathematical induction)

Let () be a propositional function.
To prove that () is true for all + , we must make two proofs:
Basis step: Prove (1)
Inductive step: Prove () ( + 1) for all +
() is called the inductive hypothesis.

Discrete Structures - CB0246. Mathematical Induction 5/39

 Principle of Mathematical Induction

How mathematical and Recursion works*

314 5 / Induction induction

FIGURE 2 Illustrating How Mathematical Induction Works Using Dom

WAYS TO REMEMBER HOW MATHEMATICAL INDUCTION WORK

*
Fig. 2 of [Rosen 2012, the5.1].
infinite ladder and the rules for reaching steps can help you remember ho
Discrete Structures - CB0246. Mathematical Induction works.
induction Note that statements (1) and (2) for the infinite ladder 6/39
are e
 Principle of Mathematical Induction

Definition (Principle of mathematical induction)

Inference rule version:

(1) ( () ( + 1))
(PMI)
()

or equivalently

[ (1) ( () ( + 1)] () (PMI)

Discrete Structures - CB0246. Mathematical Induction 7/39

 Principle of Mathematical Induction

Methodology for using the principle of mathematical induction

Discrete Structures - CB0246. Mathematical Induction 8/39

 Principle of Mathematical Induction

Methodology for using the principle of mathematical induction

1. State the propositional function ().

Discrete Structures - CB0246. Mathematical Induction 9/39

 Principle of Mathematical Induction

Methodology for using the principle of mathematical induction

1. State the propositional function ().
2. Prove the basis step, i.e. (1).

Discrete Structures - CB0246. Mathematical Induction 10/39

 Principle of Mathematical Induction

Methodology for using the principle of mathematical induction

1. State the propositional function ().
2. Prove the basis step, i.e. (1).
3. Prove the induction step, i.e. ( () ( + 1)).
Remark: In this proof you need to use the inductive hypothesis ().

Discrete Structures - CB0246. Mathematical Induction 11/39

 Principle of Mathematical Induction

Methodology for using the principle of mathematical induction

1. State the propositional function ().
2. Prove the basis step, i.e. (1).
3. Prove the induction step, i.e. ( () ( + 1)).
Remark: In this proof you need to use the inductive hypothesis ().
4. Conclude () by the principle of mathematical induction.

Discrete Structures - CB0246. Mathematical Induction 12/39

 Principle of Mathematical Induction

Example
Prove that the sum of the first odd positive integers is 2 .*
Whiteboard.

*
Historical remark. From 1575, it could be the first property proved using the PMI
(see Gunderson, David S. (2011). Handbook of Mathematical Induction, 1.8).
Discrete Structures - CB0246. Mathematical Induction 13/39
 Principle of Mathematical Induction

Exercise
Prove that if + , then

1 + 2 + 3 + + = ( + 1)/2.

Discrete Structures - CB0246. Mathematical Induction 14/39

 Principle of Mathematical Induction

Exercise (cont.)

Proof.
1. (): 1 + 2 + 3 + + = ( + 1)/2.

Discrete Structures - CB0246. Mathematical Induction 15/39

 Principle of Mathematical Induction

Exercise (cont.)

Proof.
1. (): 1 + 2 + 3 + + = ( + 1)/2.
2. Basis step (1): 1 = 1(1 + 1)/2.

Discrete Structures - CB0246. Mathematical Induction 16/39

 Principle of Mathematical Induction

Exercise (cont.)

Proof.
1. (): 1 + 2 + 3 + + = ( + 1)/2.
2. Basis step (1): 1 = 1(1 + 1)/2.
3. Inductive step:
Inductive hypothesis (): 1 + 2 + 3 + + = ( + 1)/2.
Lets prove ( + 1):

1 + 2 + 3 + + + ( + 1) = ( + 1)/2 + ( + 1) (by IH)

= ( + 1)(/2 + 1) (by arithmetic)
= ( + 1)( + 2)/2 (by arithmetic)

Discrete Structures - CB0246. Mathematical Induction 17/39

 Principle of Mathematical Induction

Exercise (cont.)

Proof.
1. (): 1 + 2 + 3 + + = ( + 1)/2.
2. Basis step (1): 1 = 1(1 + 1)/2.
3. Inductive step:
Inductive hypothesis (): 1 + 2 + 3 + + = ( + 1)/2.
Lets prove ( + 1):

1 + 2 + 3 + + + ( + 1) = ( + 1)/2 + ( + 1) (by IH)

= ( + 1)(/2 + 1) (by arithmetic)
= ( + 1)( + 2)/2 (by arithmetic)

4. () by the principle of induction mathematical.

Discrete Structures - CB0246. Mathematical Induction 18/39

 Principle of Mathematical Induction

Exercise
Prove that if , then

20 + 21 + 22 + + 2 = 2+1 1

Discrete Structures - CB0246. Mathematical Induction 19/39

 Principle of Mathematical Induction

Exercise (cont.)

Proof.
1. (): 20 + 21 + 22 + + 2 = 2+1 1

Discrete Structures - CB0246. Mathematical Induction 20/39

 Principle of Mathematical Induction

Exercise (cont.)

Proof.
1. (): 20 + 21 + 22 + + 2 = 2+1 1
2. Basis step (0): 20 = 1 = 20+1 1.

Discrete Structures - CB0246. Mathematical Induction 21/39

 Principle of Mathematical Induction

Exercise (cont.)

Proof.
1. (): 20 + 21 + 22 + + 2 = 2+1 1
2. Basis step (0): 20 = 1 = 20+1 1.
3. Inductive step:
Inductive hypothesis (): 20 + 21 + 22 + + 2 = 2+1 1
Lets prove ( + 1):

20 + 21 + 22 + + 2 + 2+1 = 2+1 1 + 2+1 (by IH)

= 2(2+1 ) 1 (by arithmetic)
= 2+2 1 (by arithmetic)

Discrete Structures - CB0246. Mathematical Induction 22/39

 Principle of Mathematical Induction

Exercise (cont.)

Proof.
1. (): 20 + 21 + 22 + + 2 = 2+1 1
2. Basis step (0): 20 = 1 = 20+1 1.
3. Inductive step:
Inductive hypothesis (): 20 + 21 + 22 + + 2 = 2+1 1
Lets prove ( + 1):

20 + 21 + 22 + + 2 + 2+1 = 2+1 1 + 2+1 (by IH)

= 2(2+1 ) 1 (by arithmetic)
= 2+2 1 (by arithmetic)

4. () by the principle of induction mathematical.

Discrete Structures - CB0246. Mathematical Induction 23/39

 Strong Induction

Definition (Strong (or course-of-values) induction)

Let () be a propositional function.
To prove that () is true for all + , we must make two proofs:
Basis step: Prove (1)

Discrete Structures - CB0246. Mathematical Induction 24/39

 Strong Induction

Definition (Strong (or course-of-values) induction)

Let () be a propositional function.
To prove that () is true for all + , we must make two proofs:
Basis step: Prove (1)
Inductive step: Prove [ (1) (2) ()] ( + 1) for all
+

Discrete Structures - CB0246. Mathematical Induction 25/39

 Strong Induction

Definition (Strong (or course-of-values) induction)

Let () be a propositional function.
To prove that () is true for all + , we must make two proofs:
Basis step: Prove (1)
Inductive step: Prove [ (1) (2) ()] ( + 1) for all
+
The (strong) inductive hypothesis is given by

() is true for = 1, 2, , .

Discrete Structures - CB0246. Mathematical Induction 26/39

 Strong Induction

Definition (Strong induction)

Inference rule version:

(1) [( (1) (2) ()) ( + 1)]

(strong induction)
()

Discrete Structures - CB0246. Mathematical Induction 27/39

 Strong Induction

Example (A part of the fundamental theorem of arithmetic)

Prove that if is an integer greater than 1, either is prime itself or is the
product of prime numbers.

Discrete Structures - CB0246. Mathematical Induction 28/39

 Strong Induction

Example (cont.)

Proof.
1. (): is prime itself or it is the product of prime numbers.

Discrete Structures - CB0246. Mathematical Induction 29/39

 Strong Induction

Example (cont.)

Proof.
1. (): is prime itself or it is the product of prime numbers.
2. Basis step (2): 2 is a prime number.

Discrete Structures - CB0246. Mathematical Induction 30/39

 Strong Induction

Example (cont.)

Proof.
1. (): is prime itself or it is the product of prime numbers.
2. Basis step (2): 2 is a prime number.
3. Inductive step:
Inductive hypothesis: () is true for = 1, 2, , .

Discrete Structures - CB0246. Mathematical Induction 31/39

 Strong Induction

Example (cont.)

Proof.
1. (): is prime itself or it is the product of prime numbers.
2. Basis step (2): 2 is a prime number.
3. Inductive step:
Inductive hypothesis: () is true for = 1, 2, , .
Lets prove that + 1 satisfies the property:

Discrete Structures - CB0246. Mathematical Induction 32/39

 Strong Induction

Example (cont.)

Proof.
1. (): is prime itself or it is the product of prime numbers.
2. Basis step (2): 2 is a prime number.
3. Inductive step:
Inductive hypothesis: () is true for = 1, 2, , .
Lets prove that + 1 satisfies the property:
3.1 If + 1 is a prime number then it satisfies the property.

Discrete Structures - CB0246. Mathematical Induction 33/39

 Strong Induction

Example (cont.)

Proof.
1. (): is prime itself or it is the product of prime numbers.
2. Basis step (2): 2 is a prime number.
3. Inductive step:
Inductive hypothesis: () is true for = 1, 2, , .
Lets prove that + 1 satisfies the property:
3.1 If + 1 is a prime number then it satisfies the property.
3.2 If + 1 is a composite number:
+ 1 = where 2 < + 1. Since () and () by
the inductive hypothesis, then ( + 1).

Discrete Structures - CB0246. Mathematical Induction 34/39

 Strong Induction

Example (cont.)

Proof.
1. (): is prime itself or it is the product of prime numbers.
2. Basis step (2): 2 is a prime number.
3. Inductive step:
Inductive hypothesis: () is true for = 1, 2, , .
Lets prove that + 1 satisfies the property:
3.1 If + 1 is a prime number then it satisfies the property.
3.2 If + 1 is a composite number:
+ 1 = where 2 < + 1. Since () and () by
the inductive hypothesis, then ( + 1).
4. () is true for all integer greater than 1 by strong induction.

Discrete Structures - CB0246. Mathematical Induction 35/39

 First-Order Peano Arithmetic

Axioms of first-order Peano arithmetic*

. 0
. = =
. 0 + =
. + = ( + )
. 0 = 0
. = + ( )

Giuseppe Peano
(1858 1932)

*
See, for example, Hjek, Petr and Pudlk, Pavel (1998). Metamathematics of
First-Order Arithmetic.
Discrete Structures - CB0246. Mathematical Induction 36/39
 First-Order Peano Arithmetic

Axioms of first-order Peano arithmetic*

. 0
. = =
. 0 + =
. + = ( + )
. 0 = 0
. = + ( )

For all formulae ,

Giuseppe Peano [(0) (. () ( ))] ()

(1858 1932)

*
See, for example, Hjek, Petr and Pudlk, Pavel (1998). Metamathematics of
First-Order Arithmetic.
Discrete Structures - CB0246. Mathematical Induction 37/39
 First-Order Peano Arithmetic

Theorem
The principle of mathematical induction and strong induction are equival-
ent.*

*
See, for example, Gunderson, David S. (2011). Handbook of Mathematical
Induction.
Discrete Structures - CB0246. Mathematical Induction 38/39
 References

Gunderson, David S. (2011). Handbook of Mathematical Induction. Chapman &

Hall.
Hjek, Petr and Pudlk, Pavel (1998). Metamathematics of First-Order
Arithmetic. 2nd printing. Springer.
Rosen, Kenneth H. (2012). Discrete Mathematics and Its Applications. 7th ed.
McGraw-Hill.

Discrete Structures - CB0246. Mathematical Induction 39/39