Register to reply 
Type of Induction 
Share this thread: 
#1
Jul2708, 07:41 PM

P: 1,367

What do you call this type of induction (if it even exists):
Let P(x) be some statement concerning the integer x. If  P(m) is true, and  P(k) is true implies P(k + 1) is true, where m ≤ k < n, then P(x) is true for all integers x = m, ..., n. 


#2
Jul2708, 07:48 PM

P: 103

It's just induction.



#3
Jul2708, 08:43 PM

P: 1,367

I've been googling around but I haven't found a single website that mentions this sort of induction. I'll take your word for it.



#4
Jul2708, 08:49 PM

P: 1,520

Type of Induction
The only two terms for induction I've ever heard about are finite induction and mathematical induction.



#5
Jul2708, 08:58 PM

Sci Advisor
P: 2,751




#6
Jul2708, 09:41 PM

P: 1,367

I didn't just google "induction". I tried "finite induction types" and variations thereof.



#7
Jul2708, 09:58 PM

Sci Advisor
P: 2,751



#8
Jul2708, 11:19 PM

P: 103

In this sense of the word, there is essentially only one form of induction.
Whilst we may use the terms 'induction' and 'strong induction' for two different things they are entirely equivalent notions (i.e. each one implies the other), and your notion of induction in post 1 falls between the two. It is a simple exercise to show that your description is equivalent to ordinary induction. 


#9
Jul2808, 06:32 AM

Math
Emeritus
Sci Advisor
Thanks
PF Gold
P: 39,682

"Strong induction" asserts:
If P(1) is true and whenever P(n) is true for all [itex]n\le k[/itex], then P(k+1) is true Then P(n) is true for all P It is "Strong" because the hypotheses are easier you only have to show P(k+1) is true when P(n) is true for all [itex]n\le k[/itex] so you have "more information". It is easy to see that "strong induction" implies regular induction: if P(k+1) is true whenever P(k) is true then it is certainly the case that P(k+1) is true whenever P(n) is true for all n less than or equal to k. The remarkable thing is that regular induction implies strong induction: Suppose P(n) is a statement such that: P(1) is true and whenever P(n) is true for all n less than or equal to k, P(k+1) is true. Let Q(n) be the statement "P(m) is true for all m less than or equal to n". Q(1) is the statement "P(m) is true for all m less than or equal to 1". But the only natural number "less than or equal to 1" is 1 itself. Q(1) just says P(1) is true and that's true. Now suppose Q(k) is true. That means P(m) is true for all m less than or equal to k and so, by the induction hypothesis, P(k+1) is true. But since we already have that P(m) is true for all m less than or equal to k, we now know that P(m) is true for all k less than or equal to k+1: Q(k+1) is true. Therefore, by regular induction, Q(n) is true for all n. But Q(n) says P(m) is true for all m less than or equal to n. If Q(n) is true for all n, then P(n) is true for all n. The statement given in the first post looks like "strong" induction restricted to n greater than or equal to m. As everyone else has said, it is equivalent (as long as n is larger than or equal to m) to regular induction. 


#10
Jul2808, 03:05 PM

P: 230

http://en.wikipedia.org/wiki/Transfinite_induction 


Register to reply 
Related Discussions  
What type of Tea  General Discussion  61  
What type of...  Introductory Physics Homework  5  
Type of Course  Academic Guidance  5  
Type 1,2, & 3 Civilizations  General Physics  7 