Radon's theorem
ProvedFamousTheorems.radon_theoremRadon's theorem. Let be an affinely dependent family of points in a vector space over an ordered field. Then the index set splits into two parts and whose convex hulls intersect:
In particular, any points in can be partitioned into two sets with intersecting convex hulls.
It is one of the three classical theorems of combinatorial convexity with Helly's and Carathéodory's, and it gives the shortest proof of Helly's theorem. It also shows that halfspaces in have VC dimension .
Formalization note. Mathlib's Convex.radon_partition; affine dependence is ¬ AffineIndependent 𝕜 f.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem radon_theorem {ι 𝕜 E : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [AddCommGroup E] [Module 𝕜 E]
{f : ι → E} (h : ¬ AffineIndependent 𝕜 f) :
∃ I : Set ι, (convexHull 𝕜 (f '' I) ∩ convexHull 𝕜 (f '' Iᶜ)).Nonempty := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Convex.radon_partition`. Proof here reduces to that Mathlib result.