Stone's separation theorem
ProvedFamousTheorems.stone_separation_theoremStone's separation theorem. Let be a vector space over a linearly ordered field , and let be disjoint convex sets. Then there is a convex set whose complement is also convex, with and .
Sets with and its complement both convex are called half-spaces (or hemispaces). The theorem is a purely algebraic version of the Hahn–Banach separation theorem: it needs no topology and no completeness, only convexity. It underlies the abstract theory of convexity spaces.
Formalization note. Mathlib's exists_convex_convex_compl_subset. The field is any linearly ordered field (Field 𝕜, LinearOrder 𝕜, IsStrictOrderedRing 𝕜), and Cᶜ is the set complement.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem stone_separation_theorem {𝕜 E : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] [AddCommGroup E] [Module 𝕜 E] {s t : Set E}
(hs : Convex 𝕜 s) (ht : Convex 𝕜 t) (hst : Disjoint s t) :
∃ C : Set E, Convex 𝕜 C ∧ Convex 𝕜 Cᶜ ∧ s ⊆ C ∧ t ⊆ Cᶜ := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `exists_convex_convex_compl_subset`. Proof here reduces to that Mathlib result.