Definability of fiber-minimal points
ProvedMonotonicity_Theorem.fiber_minimals_definableThe set of fiber-minimal domain points is definable: points with no strictly smaller point sharing their function value. This is the domain intersected with the complement of the non-minimal set, and it carries the minimum-preimage construction of the Lemma 1 finite-fiber case.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.fiber_minimals_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 => I x /\ ¬ 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
For any type , any dense linear order without endpoints on , any o-minimal structure over , any subsets of the -dimensional Cartesian power (allowing or to be empty), and any -definable function from to , the distinguished family at dimension contains the set of those such that and there does not exist with and and, for some witnesses of and of (which, given and , are automatically present, so this is just equality of the values), the first coordinate of the value formed using equals the first coordinate of the value formed using ; in particular the existential over ranges over all of including possibly itself and is vacuous when is empty, and the defining condition reduces to with no strictly -below taking the same -first-coordinate value.
Confirmed by the mission captain (proposal self-audit).