Chapter 56: The Three Failures of Cantor's Diagonal

Cantor’s diagonal argument (1891) is one of the most celebrated proofs in all of mathematics. It shows that no enumeration of the real numbers can be complete, and thereby establishes that the reals are uncountable — strictly larger than the natural numbers. The argument is short, elegant, and, within ZFC set theory, irrefutable.

This chapter presents Cantor’s proof step by step, then identifies precisely where it fails in Category τ. Not because the proof is logically flawed, but because it relies on three pieces of infrastructure that τ refuses to grant. Each failure is sharp and structural: (1) the diagonal digit-extraction requires a uniform oracle that constructive reals do not provide; (2) the comprehension step that forms “the real not in the list” has no analogue in τ’s bounded powerset; (3) the self-pairing map n ↦ (n,n) violates the diagonal discipline. The conjunction of all three failures yields the Cantor Diagonal Inapplicability Theorem: no form of the diagonal argument can produce an uncountable object within τ.