Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.43 — nonempty perfect sets are uncountable

Proved
Rudin.ch02_perfect_uncountable

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

analysisset-theorytopology

A nonempty perfect set P⊆RkP \subseteq \mathbb{R}^kP⊆Rk — closed, with every point a limit point of PPP — is uncountable. In particular every interval [a,b][a,b][a,b] with a<ba < ba<b is uncountable, and so is the Cantor set.

Preamble
import Mathlib
Formal statement
namespace Rudin

/-- Rudin, Theorem 2.43: a nonempty perfect set in `ℝ^k` — a nonempty closed set every point of
which is a limit point of the set — is uncountable. -/
theorem ch02_perfect_uncountable (k : ℕ) (P : Set (EuclideanSpace ℝ (Fin k)))
    (hne : P.Nonempty) (hP : Perfect P) : ¬ P.Countable := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 2, p. 41, Theorem 2.43
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Let kkk be a natural number and let PPP be a subset of kkk-dimensional Euclidean space Rk\mathbb{R}^kRk which is nonempty and perfect, where perfect means: PPP is closed and PPP has no isolated points (every point of PPP lies in the closure of PPP minus that point). Then PPP is not countable, i.e. there is no injection from PPP into N\mathbb{N}N.

Nonemptiness is an explicit separate hypothesis (the empty set is perfect and countable). Both k=0k=0k=0 and k≥1k \ge 1k≥1 are formally covered by the statement as written; in R0\mathbb{R}^0R0 the hypotheses can only be met vacuously or not at all, which the statement does not discuss.

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