Can someone explain proof by mathematical induction to me?
I can get down to the part where you have to prove the statement for n=k+1 , and then I get confused and everything goes horribly wrong.
I can get down to the part where you have to prove the statement for
1 Answer
Here's the basis...
Explanation:
The 19th century Italian mathematician Giuseppe Peano presented what are known as the Peano postulates, describing a formal basis for arithmetic of Natural numbers.
In a modern formulation, here are Peano's axioms, describing the basic properties of the Natural numbers:
-
0 is a Natural number. -
If
n is a Natural number thenσ(n) (the successor ofn ) is a Natural number. -
If
m andn are Natural numbers thenm=n if and only ifσ(m)=σ(n) . -
For any Natural number
n ,σ(n)≠0 . -
If
P(n) is a property such thatP(0) and for any Natural numbern ,P(n)⇒P(σ(n)) thenP(n) for all Natural numbers.
The last of these axioms is the axiom of induction and the basis of proof by induction.
Given Peano's axioms, we can define addition of Natural numbers as follows:
-
n+0=0+n=n for any Natural numbern . -
m+σ(n)=σ(m)+n=σ(m+n) for any Natural numbersm,n .
If we define
- If
P(n) is a property such thatP(0) and for any Natural numbern ,P(n)⇒P(n+1) thenP(n) for all Natural numbers.
So to prove that a proposition