Complements of one-dimensional definable sets are definable
ProvedMonotonicity_Theorem.compl_mem_oneThe complement of a one-dimensional definable set is definable. On the line this follows from o-minimality: a finite union of points and intervals has a complement of the same shape. This supplies the missing complement operation used to carve out fiber-minimal points in the Lemma 1 finite-fiber case.
Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.compl_mem_one {R : Type} (D : DenseLinearOrderNoEndpoints R)
(M : OMinimalStructure D) {A : Set (Power R 1)}
(hA : M.S 1 A) :
M.S 1 (fun x : Power R 1 => ¬ A x) := by sorrySource
monotonicity.tex, Lemma 1 finite-fiber step; supporting definability lemma
Read-back
What the Lean code literally says, in plain math · muse-spark
Let be a type equipped with a dense linear order without endpoints , let be an o-minimal structure over , and let be an arbitrary subset, possibly empty or full, of satisfying the hypothesis that holds; then holds, where is the complement of in .
Human review
Confirmed by the mission captain (proposal self-audit).