Local constancy or injectivity
ProvedMonotonicity_Theorem.lemma_one_correctedA definable function on an infinite one-dimensional definable set has a nonempty subinterval on which it is constant or injective, matching Lemma 1 of the monotonicity proof. Further retired 2026-09-14: old-framework statement superseded by Monotonicity_Theorem.lemma_one (new framework) in the current staging proposal.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.lemma_one_corrected {R : Type} (D : DenseLinearOrderNoEndpoints R) (M : OMinimalStructure D)
{I B : Set (Power R 1)} (f : DefinableFunction M I B) (hI : IsInfinite1 I) :
∃ a b : Endpoint R, Endpoint.lt D a b ∧
(openInterval D a b).Subset I ∧
((∀ x (hxI : I x), openInterval D a b x → ∀ y (hyI : I y), openInterval D a b y →
f.toFun (Subtype.mk x hxI) = f.toFun (Subtype.mk y hyI)) ∨
(∀ x (hxI : I x), openInterval D a b x → ∀ y (hyI : I y), openInterval D a b y →
f.toFun (Subtype.mk x hxI) = f.toFun (Subtype.mk y hyI) → x = y)) := by sorryRead-back
What the Lean code literally says, in plain math · muse-spark
Let be a type with a dense linear order on without endpoints and an o-minimal structure over , and let and be sets of -tuples over , let be a function from to definable in , and assume is infinite in the -dimensional sense; then there exist endpoints and over such that is strictly less than in the -order on endpoints and the -open interval with endpoints is contained in as sets, and moreover one of the following two holds: either for all lying in that open interval and all lying in that open interval, the value of at regarded as an element of equals the value of at regarded as an element of , i.e. is constant on the intersection of with the interval, or for all such , equality of those -values implies , i.e. is injective on that intersection, where in particular if the interval contains no points of both alternatives hold vacuously.
Confirmed by the mission captain (proposal self-audit).