Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.27 — the closure is the smallest closed superset

Proved
Rudin.ch02_closure

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

topology

For EEE in a metric space XXX: the closure of EEE is E∪E′E \cup E'E∪E′, where E′E'E′ is the set of limit points of EEE; the closure is closed; the closure equals EEE exactly when EEE is closed; and the closure is contained in every closed set containing EEE. Hence Eˉ\bar EEˉ is the smallest closed subset of XXX containing EEE.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch02_topology
Formal statement
namespace Rudin

/-- Rudin, Definition 2.26 and Theorem 2.27: the closure of `E` is `E` together with its limit
points; it is closed; it equals `E` exactly when `E` is closed; and it is contained in every
closed set containing `E`, so it is the smallest closed set containing `E`. -/
theorem ch02_closure {X : Type*} [MetricSpace X] (E : Set X) :
    closure E = E ∪ {p | IsLimitPoint p E} ∧
    IsClosed (closure E) ∧
    (closure E = E ↔ IsClosed E) ∧
    (∀ F : Set X, IsClosed F → E ⊆ F → closure E ⊆ F) := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 2, p. 35, Definition 2.26 and Theorem 2.27
Read-back

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

Let XXX be a metric space and E⊆XE \subseteq XE⊆X an arbitrary subset (possibly empty). Write E‾\overline{E}E for the topological closure of EEE, and call ppp a limit point of EEE when for every r>0r>0r>0 there is q∈Eq \in Eq∈E with q≠pq \ne pq=p and d(q,p)<rd(q,p) < rd(q,p)<r. Then all four of the following hold:

  1. E‾=E∪{ p∈X:p is a limit point of E }\overline{E} = E \cup \{\, p \in X : p \text{ is a limit point of } E \,\}E=E∪{p∈X:p is a limit point of E} (equality of sets);
  2. E‾\overline{E}E is closed;
  3. E‾=E\overline{E} = EE=E if and only if EEE is closed;
  4. for every subset F⊆XF \subseteq XF⊆X, if FFF is closed and E⊆FE \subseteq FE⊆F, then E‾⊆F\overline{E} \subseteq FE⊆F.

Item 4 is an implication for each such FFF, so together with 2 it says E‾\overline{E}E is the smallest closed superset of EEE. The statement is universally quantified over all subsets EEE, including E=∅E = \emptysetE=∅, for which the set of limit points is empty as well.

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