Theorem 2.27 — the closure is the smallest closed superset
ProvedRudin.ch02_closureFor in a metric space : the closure of is , where is the set of limit points of ; the closure is closed; the closure equals exactly when is closed; and the closure is contained in every closed set containing . Hence is the smallest closed subset of containing .
import Mathlib import Definitions.Def_Rudin_ch02_topology
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 RudinRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Let be a metric space and an arbitrary subset (possibly empty). Write for the topological closure of , and call a limit point of when for every there is with and . Then all four of the following hold:
- (equality of sets);
- is closed;
- if and only if is closed;
- for every subset , if is closed and , then .
Item 4 is an implication for each such , so together with 2 it says is the smallest closed superset of . The statement is universally quantified over all subsets , including , for which the set of limit points is empty as well.
Confirmed by the mission captain (proposal self-audit).