The prime ideal theorem for distributive lattices
ProvedFamousTheorems.prime_ideal_theorem_distributive_latticeThe prime ideal theorem for distributive lattices. Let be a filter and an ideal in a distributive lattice, with . Then there is a prime ideal that is still disjoint from .
This separation theorem, due to Stone, is the key step in Stone's representation theorem: every distributive lattice embeds into a lattice of sets. It is a weak form of the axiom of choice, equivalent to the Boolean prime ideal theorem.
Formalization note. Mathlib's DistribLattice.prime_ideal_of_disjoint_filter_ideal. Order.PFilter α is a (proper or improper) filter, Order.Ideal α is an order ideal, and J.IsPrime means is a proper ideal whose complement is a filter. Disjointness is stated for the underlying sets.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem prime_ideal_theorem_distributive_lattice {α : Type*} [DistribLattice α] {F : Order.PFilter α} {I : Order.Ideal α}
(h : Disjoint (F : Set α) (I : Set α)) :
∃ J : Order.Ideal α, J.IsPrime ∧ I ≤ J ∧ Disjoint (F : Set α) (J : Set α) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `DistribLattice.prime_ideal_of_disjoint_filter_ideal`. Proof here reduces to that Mathlib result.