Definable fibers split into an infinite or finite case
ProvedMonotonicity_Theorem.fiber_dichotomy_v2For a definable function, either some definable value fiber is infinite, or every value fiber is finite.
import Definitions.Def_Monotonicity_Theorem_Framework
theorem Monotonicity_Theorem.fiber_dichotomy_v2 {R : Type} (D : DenseLinearOrderNoEndpoints R)
(M : OMinimalStructure D) {I B : Set (Power R 1)}
(f : DefinableFunction M I B) :
(∃ z : Power R 1,
(M.S 1 (fun x : Power R 1 => I x ∧ ∃ hx : I x,
(f.toFun ⟨x, hx⟩).1 = (fun _ : Fin 1 => z 0)) ∧
IsInfinite1 (fun x : Power R 1 => I x ∧ ∃ hx : I x,
(f.toFun ⟨x, hx⟩).1 = (fun _ : Fin 1 => z 0)))) ∨
∀ 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)) := by sorryRead-back
What the Lean code literally says, in plain math · muse-spark
Fix an arbitrary type equipped with a dense linear order without endpoints , an o-minimal structure over , arbitrary subsets of the -dimensional power space over , and a function definable in with domain and codomain ; then exactly the following disjunction is asserted: either there exists a -tuple such that, for the fiber predicate defined by iff and there exists a witness to with the first coordinate of the underlying value of at the pair equal to the constant -tuple whose every coordinate equals the -th coordinate of , i.e. where for all indices , both the -dimensional -predicate of holds of , , and is -dimensionally infinite, , or for every -tuple , with and as above, is -dimensionally finite, , where the quantifier over ranges over the whole power space including -tuples outside and outside the image of , and where if is empty or then is false because the required witness is impossible, so all fibers are then empty.
Confirmed by the mission captain (proposal self-audit).