Increasing on a uniform below-above window
ProvedMonotonicity_Theorem.increasing_of_uniform_below_above2If every point of a window has a below-above sign pattern, some subwindow has the function strictly increasing. The easy below-above case of Lemma 2. Retired: the window was not required to be nonempty, so the statement is false as stated; use Monotonicity_Theorem.increasing_of_uniform_below_above_corrected instead. Further retired 2026-09-14: old-framework statement superseded by the same-named new-framework formalization in the current staging proposal; the _corrected successor names are retired, use the clean names.
import Definitions.Def_Monotonicity_Theorem_Framework2
theorem Monotonicity_Theorem.increasing_of_uniform_below_above2 {R : Type} [LinearOrder R] [DenselyOrdered R] [NoMaxOrder R] [NoMinOrder R]
(M : OMinimalStructure R) {I B : Set (Power R 1)}
(f : DefinableFunction M I B)
(hinj : ∀ x y (hx : I x) (hy : I y),
f.toFun (Subtype.mk x hx) = f.toFun (Subtype.mk y hy) → x = y)
{a b : Endpoint R} (hsubJ : ∀ x, openInterval a b x → I x)
(hlt : Endpoint.lt a b)
(hU : ∀ x (hxI : I x), openInterval a b x ->
∃ c1 c2 : Power R 1, openInterval a b c1 ∧ openInterval a b c2 ∧
Lt1 c1 x ∧ Lt1 x c2 ∧
(∀ y (hyI : I y), openInterval a b y → Lt1 c1 y → Lt1 y x ->
Lt1 (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).1) ∧
(∀ y (hyI : I y), openInterval a b y → Lt1 x y → Lt1 y c2 ->
Lt1 (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1)) :
∃ a2 b2 : Endpoint R, Endpoint.lt a2 b2 ∧
(∀ x, openInterval a2 b2 x → I x) ∧
(∀ x (hxI : I x) y (hyI : I y), openInterval a2 b2 x → openInterval a2 b2 y ->
Lt1 x y → Lt1 (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1) := by sorryRead-back
What the Lean code literally says, in plain math · muse-spark
Fix a type equipped with a linear order that is dense and has neither a maximum nor a minimum, let be an o-minimal structure on , let and be sets of unary tuples over , let be a function definable in from to , suppose is injective in the sense that for any -tuples belonging to , equality of the values of at and implies , let and be extended endpoints over , suppose every -tuple lying in the open interval with endpoints belongs to , suppose is strictly below , and suppose that for every belonging both to and to the interval there exist -tuples such that and both lie in and in the strict order on -tuples, and for every belonging both to and to with the underlying -tuple of the -value at is -below the underlying -tuple of the -value at , and for every belonging both to and to with the underlying -tuple of the -value at is -below the underlying -tuple of the -value at ; then there exist extended endpoints and such that is strictly below and every -tuple lying in the open interval belongs to and for any belonging both to and to , if then the underlying -tuple of the -value at is -below the underlying -tuple of the -value at , where the injectivity hypothesis is vacuous if has fewer than two points, each local comparison is vacuous when there is no such intermediate , and the final strict-increase claim is vacuous when contains fewer than two points of , while the containment of in together with strictly below rules out being empty given that a nondegenerate interval in a dense order without extrema is inhabited.
Confirmed by the mission captain (proposal self-audit).