Real Induction
Did you know you can do mathematical induction over the reals? Don't listen to the naysayers. Follow along!
Theorem: Real Inudction Consider a predicate and a closed real interval where < , if the following hold:
- assumption one:
- assumption two: implies for some real numbers
- hypotheses two: implies for some real numbers
Then .
Proof:
First of all, shout out to Peter Clarke for his paper on real induction. Our assumptions are slightly different, but he inspired this proof by contradiction.
Assume as a contrarian might, that we have the necessary predicate, real numbers, and conditions above, but there's a catch does not hold!
This means there is some non-empty subset of such that for every of its points , . Since every bounded real set has a greatest lower bound, let be the greatest lower bound of our the set on which does not hold. Then we have three possible cases:
-
. Consider then our first two conditions. By assumption one we have and by the second assumption, (where, doing its usual thing ). But contradicts our statement that is the infimum of the set.
-
Of course, it could be the case that and . Then, we'd have one of , , or .*
Morever, we'd also have . Then if we let and , our second assumption would allow at the same time as . Again a contradiction.
-
Lastly, it could be the case that and . Then we'd have . And letting , our third assumption would tell us . We'd have both and . Again a contradiction.
Thus our contrarian claim is refuted. Under our three assumptions, holds.
*Technically these cases can be reduced to the open interval , but that might require some other theorems.