Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.14 — the set of binary sequences is uncountable

Proved
Rudin.ch02_binary_sequences_uncountable

by LG · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

set-theory

The set of all sequences whose terms are the digits 000 and 111 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 N\mathbb{N}N into the two-element set {0,1}\{0,1\}{0,1} — 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 N\mathbb{N}N, 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
  • Endorsed by Shuze Chen · Sep 12, 2026

  • Endorsed by LG · Sep 12, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me