Mathematica Math Induction Explained: Step-by-Step Guide

AI Thread Summary
Mathematical induction is a method used to prove statements about integers, starting with a base case and then showing that if a statement holds for an arbitrary case k, it also holds for k+1. The initial step involves proving that the first theorem in a sequence is true, not merely establishing that P(1) exists. To demonstrate that a sequence is increasing, one must show that if the kth term is greater than the (k-1)th term, then the (k+1)th term is greater than or equal to the kth term. It's important to clarify that proving P(1) is greater than zero may not suffice unless the context of the sequence is properly defined. Understanding these steps is crucial for successfully applying mathematical induction.
Richter915
Messages
37
Reaction score
0
Hi I was wondering if any of you could explain the concept of Mathematical Induction to me...I really am confused on this, we didn't learn it in class (yet we're going to be quizzed on it)...if you could walk through a simple example, it would be really appreciated...thank you!
 
Physics news on Phys.org
Wow, thank you so much. I have a question though. My teacher, as an example asked to use induction to prove that a certain sequence is increasing...so by using induction would I:
1. Prove P(1) exists
2. Prove P(K) is increasing
3. Prove P(K+1) > P(K) thus concluding that the sequence increases>
 
Richter915 said:
Wow, thank you so much. I have a question though. My teacher, as an example asked to use induction to prove that a certain sequence is increasing...so by using induction would I:
1. Prove P(1) exists
2. Prove P(K) is increasing
3. Prove P(K+1) > P(K) thus concluding that the sequence increases>
The first step is not to prove that P(1) exists, it is to prove that the first theorem in a chain of theorems holds true. The "arbitrary kth theorem being true implies truth of (k+1)th theorem" proof then allows one to form a logical chain to the (k+1)-th theorem from the 1st theorem if challenged to prove that the (k+1)-th theorem is true.
In your case, you want to prove that the second item in the sequence is greater than the first item. Your second step is to prove that given an arbitrary kth term in the sequence and assuming the kth term is greater than the (k-1)th term, prove that the (k+1)th term is greater than or equal to (if your aim is not to prove strictly increasing) the kth term. The actual item to prove changes with each set of theorems, only the logical machinery is the same.
 
Last edited:
oh ok I see my mistake...so I'd have to say that P(1) holds true for the condition...so for this example it'd be P(1)>0 and then I'd proceed from there?
 
Richter915 said:
oh ok I see my mistake...so I'd have to say that P(1) holds true for the condition...so for this example it'd be P(1)>0 and then I'd proceed from there?
Unless the P(0)'th term is 0, it doesn't prove much of anything to show that P(1) is greater than zero (Consider an increasing sequence that starts with negative numbers). This inductive proof starts with showing P(2)>P(1). :smile:
 
Back
Top