Cantor's Non-Equinumerosity Theorems, Inductively

Abstract

In the first, pre-college level part, we present a proof by mathematical induction for Cantor's theorem on the uncountability of the infinite binary strings and the real numbers. In the second, undergraduate-level part, we prove Cantor's powerset theorem by using transfinite induction. There, we will need the axiom of choice and the concept of ordinals. Some of these proofs by (mathematical and transfinite) induction seem to be new; comparisons will be made with older results.

6 pages