Theorem 4.10.1 — general Helly theorem for infinite families of closed convex sets
ProvedModernConvex.SLemma.general_hellyLet be a family (possibly infinite) of closed convex subsets of such that
- every sets from the family have a point in common, and
- there is a finite subfamily whose intersection is bounded.
Then all sets of the family have a point in common:
The finite Helly theorem needs neither closedness nor boundedness. For infinite families both are needed: the half-lines , , have the finite intersection property but empty intersection. The book uses this theorem to give a straightforward proof of the S-lemma (Exercises 4.45–4.46).
Formalization Note is Fin n → ℝ. Its sup-norm bornology has the same bounded sets as the Euclidean one. "Every sets" is every map Fin (n + 1) → I, so repeated indices are allowed and a family with fewer than members is covered. The finite subfamily is a Finset I. The index type I is arbitrary and may be empty. This is not the platform's FamousTheorems.helly_theorem, which treats finite families.
import Mathlib
namespace ModernConvex.SLemma
/-- Ben-Tal–Nemirovski, Theorem 4.10.1 (General Helley theorem), p. 305: let `{A_α}_{α ∈ I}` be a
family of closed convex sets in `ℝⁿ` such that (1) every `n + 1` sets from the family have a
point in common, and (2) some finite subfamily has a bounded intersection. Then all sets of the
family have a point in common. "Every `n + 1` sets" is every choice of `n + 1` indices, repetitions
allowed (so a family with fewer than `n + 1` members is covered). -/
theorem general_helly {n : ℕ} {I : Type} (A : I → Set (Fin n → ℝ))
(hclosed : ∀ α, IsClosed (A α)) (hconvex : ∀ α, Convex ℝ (A α))
(hinter : ∀ f : Fin (n + 1) → I, (⋂ k, A (f k)).Nonempty)
(hbdd : ∃ s : Finset I, Bornology.IsBounded (⋂ α ∈ s, A α)) :
(⋂ α, A α).Nonempty := by sorry
end ModernConvex.SLemma
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a natural number and an arbitrary index type, possibly empty or infinite. Let be a family of subsets of . Topology and boundedness are those of with the product (sup) metric, which have the same closed and bounded sets as the Euclidean ones.
Assumptions:
- Every is closed.
- Every is convex.
- For every choice of indices , repetitions allowed, the intersection is nonempty.
- There is a finite set , possibly empty, such that is bounded. Over the empty this intersection is all of .
Conclusion: is nonempty.
Degenerate cases.
- empty: assumption 3 is vacuous, because there are no maps from the nonempty index set into an empty . Assumption 4 forces , so it says is bounded, which holds only for . The conclusion concerns the empty intersection, which is and so is always nonempty.
- : is a single point. Assumption 4 always holds with . Assumption 3 with one index says each is nonempty, hence equal to that point.
- A family with fewer than members is covered by assumption 3 through repeated indices.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.