Helly's theorem
ProvedFamousTheorems.helly_theoremHelly's theorem. Let be convex sets in a -dimensional vector space over an ordered field, with . If every of them have a common point, then all of them have a common point.
It is the most important intersection theorem of convex geometry. It is the basis of many results on transversals and centre points and of combinatorial dimension in optimisation (LP-type problems). Its infinite version for compact convex sets is equally widely used.
Formalization note. Mathlib's Convex.helly_theorem, for a finite index set s; Module.finrank 𝕜 E is the dimension .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem helly_theorem {ι 𝕜 E : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [AddCommGroup E] [Module 𝕜 E]
[FiniteDimensional 𝕜 E] {F : ι → Set E} {s : Finset ι} (h_card : Module.finrank 𝕜 E + 1 ≤ s.card)
(h_convex : ∀ i ∈ s, Convex 𝕜 (F i))
(h_inter : ∀ I ⊆ s, I.card = Module.finrank 𝕜 E + 1 → (⋂ i ∈ I, F i).Nonempty) : (⋂ i ∈ s, F i).Nonempty := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Convex.helly_theorem`. Proof here reduces to that Mathlib result.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.