Non-minimal points of a definable function are definable
ProvedMonotonicity_Theorem.nonminimal_points_definableThe set of domain points admitting a strictly smaller point with the same function value is definable. The joint relation is built by reindexing the graph and order into a three-coordinate space and projecting, so fiber minima become definable by complementation. This is the core of the Lemma 1 finite-fiber case.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.nonminimal_points_definable {R : Type} (D : DenseLinearOrderNoEndpoints R)
(M : OMinimalStructure D) {I B : Set (Power R 1)}
(f : DefinableFunction M I B) :
M.S 1 (fun x : Power R 1 => exists w : Power R 1, I w /\ Lt1 D w x /\
exists hxw : I w, exists hxx : I x,
(f.toFun (Subtype.mk w hxw)).1 = (f.toFun (Subtype.mk x hxx)).1) := by sorryRead-back
What the Lean code literally says, in plain math · muse-spark
Let be a type, let be a dense linear order with no endpoints on , let be an o-minimal structure over , let and be sets of -tuples over , and let be an -definable function from to ; then the -ary family associated to contains the set of those -tuples for which there exists a -tuple such that and in the -dimensional order induced by and there exist membership witnesses and with the first coordinate of the value of at regarded as an element of via equal to the first coordinate of the value of at regarded as an element of via , i.e. ; in particular the defining condition explicitly requires and, via the required witness , can hold only when (with required a second time via ), so that if is empty or if the condition is unsatisfiable and no such belongs to the set.
Confirmed by the mission captain (proposal self-audit).