Theorem 2.36 — the finite intersection property
ProvedRudin.ch02_finite_intersection_propertytopology
Let be a nonempty collection of compact subsets of a metric space such that every nonempty finite subcollection has nonempty intersection. Then .
Preamble
import Mathlib
Formal statement
namespace Rudin
/-- Rudin, Theorem 2.36: if a nonempty collection of compact sets has the property that every
finite subcollection has nonempty intersection, then the intersection of the whole collection is
nonempty. -/
theorem ch02_finite_intersection_property {X : Type*} [MetricSpace X] (𝒦 : Set (Set X))
(hne : 𝒦.Nonempty) (hcomp : ∀ K ∈ 𝒦, IsCompact K)
(hfin : ∀ ℱ ⊆ 𝒦, ℱ.Finite → ℱ.Nonempty → (⋂₀ ℱ).Nonempty) :
(⋂₀ 𝒦).Nonempty := by sorry
end RudinSource
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 2, p. 38, Theorem 2.36
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Let be a metric space and let be a family of subsets of such that:
- is nonempty (it contains at least one set);
- every is compact;
- for every subfamily that is finite and nonempty, the intersection is nonempty.
Then , the intersection of all members of , is nonempty.
The nonemptiness requirement on in the third hypothesis matters: the empty subfamily is deliberately excluded (its intersection would be all of ). Compactness is required of every member of the family, not merely of one of them.
Human review
Confirmed by the mission captain (proposal self-audit).