/bio/skills/blog/math

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 PP and a closed real interval [a,b][a,b] where aa < bb, if the following hold:

  • assumption one: P([a,a])P([a,a])
  • assumption two: P([a,x])P([a,x]) implies P([a,y])P([a,y]) for some real numbers x<yx < y
  • hypotheses two: P([a,z))P([a,z)) implies P([a,z])P([a,z]) for some real numbers zz

Then P([a,b])P([a,b]).

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 P([a,b])P([a,b]) does not hold!

This means there is some non-empty subset of [a,b][a,b] such that for every of its points rr, ¬P({r})\neg P(\{r\}). Since every bounded real set has a greatest lower bound, let cc be the greatest lower bound of our the set on which PP does not hold. Then we have three possible cases:

  • c=ac = a. Consider then our first two conditions. By assumption one we have P([c,c])P([c,c]) and by the second assumption, P([c,c+ε])P([c, c + \varepsilon]) (where, doing its usual thing ε>0\varepsilon > 0). But contradicts our statement that cc is the infimum of the ¬P\neg P set.

  • Of course, it could be the case that c>ac > a and P({c})P(\{c\}). Then, we'd have one of P((c,c+ε))P((c, c + \varepsilon)), P((c,c+ε])P((c, c + \varepsilon]), or P({c+ε,c})QP(\{c + \varepsilon,c\}) \subset Q.*

    Morever, we'd also have P([a,c])P([a,c]). Then if we let x=cx = c and y=c+εy = c + \varepsilon, our second assumption would allow P([a,c+ε])P([a,c + \varepsilon]) at the same time as ¬P([c+ε,c+ε])\neg P([c + \varepsilon,c + \varepsilon]). Again a contradiction.

  • Lastly, it could be the case that c>ac > a and ¬P({c})\neg P(\{c\}). Then we'd have P([a,c))P([a,c)). And letting z=cz = c, our third assumption would tell us P([a,c])P([a,c]). We'd have both P({c})P(\{c\}) and ¬P({c})\neg P(\{c\}). Again a contradiction.

Thus our contrarian claim is refuted. Under our three assumptions, P([a,b])P([a,b]) holds.

*Technically these cases can be reduced to the open interval P((c,c+ε))P((c, c + \varepsilon)), but that might require some other theorems.

2025 Stefano De Vuono