0 évaluation0% ont trouvé ce document utile (0 vote)
13 vues2 pages
This document provides an overview of proof by mathematical induction. It defines the axiom of mathematical induction over natural numbers in three forms and explains the parts of the axiom. The normal proof method is outlined as proving the base case, assuming an arbitrary value for n that is greater than or equal to 0, assuming the inductive case, and proving Pn+1. It also notes that induction can start at integers other than 0 by changing the starting point in the inductive theorem.
This document provides an overview of proof by mathematical induction. It defines the axiom of mathematical induction over natural numbers in three forms and explains the parts of the axiom. The normal proof method is outlined as proving the base case, assuming an arbitrary value for n that is greater than or equal to 0, assuming the inductive case, and proving Pn+1. It also notes that induction can start at integers other than 0 by changing the starting point in the inductive theorem.
This document provides an overview of proof by mathematical induction. It defines the axiom of mathematical induction over natural numbers in three forms and explains the parts of the axiom. The normal proof method is outlined as proving the base case, assuming an arbitrary value for n that is greater than or equal to 0, assuming the inductive case, and proving Pn+1. It also notes that induction can start at integers other than 0 by changing the starting point in the inductive theorem.
(n : N |: (i | 0 i < n : Pi ) Pn ) (n : N : Pn ) used to prove Universal Quantification By Induction (2) Theorem: Mathematical Induction Over N . Form 2 (n : N |: (i | 0 i < n : Pi ) Pn ) (n : N : Pn ) used to prove properties of Induction (3) Theorem: Mathematical Induction Over N . Form 3 P0 (n : N |: (i | 0 i n : Pi ) Pn+1 ) (n : N : Pn ) restatement of (1) used for inductive proofs (4) Parts of Mathematical Induction axiom P0 is the base case (n : N |: (i | 0 i n : Pi ) Pn+1 ) (n : N : Pn ) is the inductive case (n : N |: (i | 0 i n : Pi ) Pn+1 ) is the inductive hypothesis (5) Normal Proof Method (1) Prove Base Case. P0 (2) Assume arbitrary n 0 (3) Assume Inductive Case (i | 0 i n : Pi ) (4) Prove Pn+1 (6) Induction starting at other integers Let a sequence of integers start at n0 Then Inductive Theorem is Pn0 (n : n0 n |: (i | n0 i n : Pi ) Pn+1 ) (n : n0 n : Pn )