Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definition 2.32 — open-cover compactness agrees with the library notion

Proved
Rudin.ch02_cover_compact_iff_compact

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

topology

For a subset KKK of a metric space, Rudin's definition — every open cover of KKK has a finite subcover — is equivalent to the notion of compactness used in Mathlib.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch02_topology
Formal statement
namespace Rudin

/-- Rudin, Definition 2.32: the open-cover definition of compactness agrees with the notion of
compactness used in Mathlib. -/
theorem ch02_cover_compact_iff_compact {X : Type*} [MetricSpace X] (K : Set X) :
    IsCoverCompact K ↔ IsCompact K := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 2, p. 36, Definitions 2.31 and 2.32
Read-back

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

Let XXX be a metric space and K⊆XK \subseteq XK⊆X any subset. The statement is an equivalence between two properties of KKK:

  • (left) For every family G\mathcal{G}G of subsets of XXX all of whose members are open and whose union contains KKK, there is a finite subfamily F⊆G\mathcal{F} \subseteq \mathcal{G}F⊆G whose union still contains KKK — the open-cover formulation, spelled out with covers by open subsets of the ambient space.
  • (right) KKK is compact in the sense of the ambient library, i.e. every filter containing KKK in its sets has a cluster point inside KKK (the filter formulation of compactness).

Both directions are asserted. KKK is arbitrary: the empty set is included, and satisfies both sides.

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