Theorem 2.39 — nested -cells have a common point
ProvedRudin.ch02_nested_kcellsanalysistopology
If is a decreasing sequence of nonempty -cells, then .
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 RudinSource
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 and two sequences of corner data . For each let
be the corresponding -cell. Assume that every is nonempty and that the cells are nested in the sense for every (nesting is assumed only between consecutive indices). Then
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 and the intersection need not be a single point. The case is allowed, where is a single point and every cell equals the whole space.
Human review
Confirmed by the mission captain (proposal self-audit).