Week 4 Mathematical Induction Discrete Math Marie Demlov - PowerPoint PPT Presentation

Mathematical Induction Week 4 Mathematical Induction Discrete Math Marie Demlová http://math.feld.cvut.cz/demlova March 12, 2020 M. Demlova: Discrete Math

Mathematical Induction Mathematical Induction Well-ordering. A partial order ⊑ on A is called well-ordering if any non-empty subset M ⊆ has the smallest element. Well-ordering Principle. Let N be the set of all natural numbers. Then the ordinary relation ≤ ”to be smaller or equal to” is a well-ordering. Well-ordering Principle cannot be either proved or disproved. We show later that it is equivalent with the Principle of Mathematical Induction. M. Demlova: Discrete Math

Mathematical Induction Mathematical Induction Weak form. Given a property V ( n ) of natural numbers. Assume that 1. V ( n 0 ) is true; 2. if V ( n ) holds for n ≥ n 0 then V ( n + 1 ) holds as well. Then V ( n ) is true for any n ≥ n 0 . Example 1. Prove, using the mathematical induction, that for any set U with n elements, the set P ( U ) of subsets of U has 2 n . M. Demlova: Discrete Math

Mathematical Induction Mathematical Induction Strong form. Given a property V ( n ) of natural numbers. Assume that 1. V ( n 0 ) is true; 2’. if V ( k ) holds for every n 0 ≤ k < n then V ( n ) holds as well. Then V ( n ) is true for any n ≥ n 0 . Example 2. Prove by strong mathematical induction the following statement: Every natural number n ≥ 2 is a product of one or more primes. Theorem. The weak and the strong mathematical induction are equivalent. M. Demlova: Discrete Math

Mathematical Induction Mathematical Induction Theorem. The well-ordering principle follows from the strong version of mathematical induction. Example 3. Derive a formula for � n i = 0 i 2 . M. Demlova: Discrete Math

Mathematical Induction Mathematical Induction Theorem. The principle of mathematical induction follows from the well-ordering principle. Example 4. Hanoi Towers Structural induction. Mathematical induction is used also for constructing sets. Then proving properties of elements of the set us usually done by mathematical induction which is then called structural induction . M. Demlova: Discrete Math

Mathematical Induction Mathematical Induction Example 5. Let A be a set of binary words defined inductively by: ◮ 0 ∈ A and 1 ∈ A . ◮ If w ∈ A then 0 w 0 ∈ A and 1 w 1 ∈ A . Prove that A consists of all binary words of odd length which are palindromes (i.e. words w that are the same as its reverse). M. Demlova: Discrete Math