Theorem 2.14 — the set of binary sequences is uncountable
ProvedRudin.ch02_binary_sequences_uncountableset-theory
The set of all sequences whose terms are the digits and is uncountable. Rudin proves this by Cantor's diagonal process; with Theorem 2.12 it separates the countable from the uncountable in the chapter.
Preamble
import Mathlib
Formal statement
namespace Rudin /-- Rudin, Theorem 2.14: the set of all sequences whose terms are the digits `0` and `1` is uncountable. -/ theorem ch02_binary_sequences_uncountable : ¬ (Set.univ : Set (ℕ → Fin 2)).Countable := by sorry end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 2, p. 30, Theorem 2.14
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
The set of all functions from into the two-element set — that is, all infinite sequences of binary digits — taken as a subset of its own ambient type (the full set, no element excluded), is not countable: there is no injection from it into , and in particular it is neither finite nor countably infinite.
The statement has no hypotheses. The digit type has exactly two elements, so no degeneracy such as an empty or one-element alphabet arises.
Human review
Confirmed by the mission captain (proposal self-audit).