Finite fibers yield an injective subinterval
ProvedMonotonicity_Theorem.finite_fiber_case_v4If every one-dimensional value fiber of a definable function is finite, then the function is injective on some subinterval of its infinite domain.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.finite_fiber_case_v4 {R : Type} (D : DenseLinearOrderNoEndpoints R)
(M : OMinimalStructure D) {I B : Set (Power R 1)}
(f : DefinableFunction M I B) (hI : IsInfinite1 I)
(hfinite : ∀ z : Power R 1, IsFinite1 (fun x : Power R 1 =>
I x ∧ ∃ hx : I x, (f.toFun ⟨x, hx⟩).1 = (fun _ : Fin 1 => z 0))) :
∃ 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 = y) := by sorryRead-back
What the Lean code literally says, in plain math · muse-spark
Let be a type, let be a dense linear order without endpoints on , let be an o-minimal structure over , let and be subsets of the -dimensional sort , and let be a function definable in from to ; assume is infinite in the -dimensional sense, and assume that for every the collection of such that and there exists a witness for with the underlying -tuple of the value of at (taken with ) equal to the constant -tuple whose sole entry is , the -th coordinate of , is finite in the -dimensional sense; then there exist endpoints of such that is strictly less than with respect to , and the open interval determined by is contained as a subset in , and for every with , if lies in that open interval, then for every with , if lies in that open interval, then if the value of at (taken with its membership witness) equals the value of at (taken with its membership witness) it follows that as elements of .
Confirmed by the mission captain (proposal self-audit).