Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.36 — the finite intersection property

Proved
Rudin.ch02_finite_intersection_property

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

topology

Let K\mathcal{K}K be a nonempty collection of compact subsets of a metric space such that every nonempty finite subcollection has nonempty intersection. Then ⋂K≠∅\bigcap \mathcal{K} \ne \varnothing⋂K=∅.

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 Rudin
Source
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 XXX be a metric space and let K\mathcal{K}K be a family of subsets of XXX such that:

  • K\mathcal{K}K is nonempty (it contains at least one set);
  • every K∈KK \in \mathcal{K}K∈K is compact;
  • for every subfamily F⊆K\mathcal{F} \subseteq \mathcal{K}F⊆K that is finite and nonempty, the intersection ⋂F\bigcap \mathcal{F}⋂F is nonempty.

Then ⋂K\bigcap \mathcal{K}⋂K, the intersection of all members of K\mathcal{K}K, is nonempty.

The nonemptiness requirement on F\mathcal{F}F in the third hypothesis matters: the empty subfamily is deliberately excluded (its intersection would be all of XXX). Compactness is required of every member of the family, not merely of one of them.

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