Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.39 — nested kkk-cells have a common point

Proved
Rudin.ch02_nested_kcells

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

analysistopology

If I1⊇I2⊇⋯I_1 \supseteq I_2 \supseteq \cdotsI1​⊇I2​⊇⋯ is a decreasing sequence of nonempty kkk-cells, then ⋂nIn≠∅\bigcap_n I_n \ne \varnothing⋂n​In​=∅.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch02_topology
Formal statement
namespace Rudin

/-- Rudin, Theorem 2.39: a nested sequence of nonempty `k`-cells has nonempty intersection. -/
theorem ch02_nested_kcells (k : ℕ) (a b : ℕ → Fin k → ℝ)
    (hne : ∀ n, (kCell k (a n) (b n)).Nonempty)
    (hnest : ∀ n, kCell k (a (n + 1)) (b (n + 1)) ⊆ kCell k (a n) (b n)) :
    (⋂ n, kCell k (a n) (b n)).Nonempty := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 2, p. 39, Theorems 2.38 and 2.39
Read-back

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

Fix a natural number kkk and two sequences of corner data a,b:N→({0,…,k−1}→R)a, b : \mathbb{N} \to (\{0,\dots,k-1\} \to \mathbb{R})a,b:N→({0,…,k−1}→R). For each nnn let

In  =  { x∈Rk  :  an(j)≤xj≤bn(j) for all coordinates j }I_n \;=\; \{\, x \in \mathbb{R}^k \;:\; a_n(j) \le x_j \le b_n(j) \text{ for all coordinates } j \,\}In​={x∈Rk:an​(j)≤xj​≤bn​(j) for all coordinates j}

be the corresponding kkk-cell. Assume that every InI_nIn​ is nonempty and that the cells are nested in the sense In+1⊆InI_{n+1} \subseteq I_nIn+1​⊆In​ for every nnn (nesting is assumed only between consecutive indices). Then

⋂n∈NIn≠∅.\bigcap_{n \in \mathbb{N}} I_n \neq \emptyset .n∈N⋂​In​=∅.

No monotonicity is assumed of the corner data itself, only of the cells; and no bound on the side lengths, so the diameters need not tend to 000 and the intersection need not be a single point. The case k=0k=0k=0 is allowed, where R0\mathbb{R}^0R0 is a single point and every cell equals the whole space.

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