Increasing on a uniform above-above window
ProvedMonotonicity_Theorem.increasing_of_uniform_above_above2If every point of a window has an above-above sign pattern, some subwindow has the function strictly increasing. The difficult 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_above_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_above_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 x hxI)).1 (f.toFun (Subtype.mk y hyI)).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 no maximum and no minimum, let be an o-minimal structure on , let and be sets of unary tuples over , let be an -definable function from to , and let and be endpoints over ; assume is injective in the sense that for any unary tuples belonging to , equality of the -values at and implies , assume every unary tuple lying in the open interval belongs to , assume the left endpoint is strictly below the right endpoint , and assume the following uniform two-sided local lower-bound property: for every belonging to and also to there exist unary tuples both in with in the strict order on unary tuples such that, first, for every belonging to and to with the scalar component of the -value at is strictly less than the scalar component of the -value at , and second, for every belonging to and to with the scalar component of the -value at is strictly less than the scalar component of the -value at ; then there exist endpoints and with strictly below such that every unary tuple in the open interval belongs to and is strictly increasing on in the sense that for any belonging to and to with strictly below , the scalar component of the -value at is strictly below that at , where the universal claims are vacuously true if the relevant intersections or contain zero or one point, while the hypotheses that is nondegenerate and contained in normally force to be nonempty in a dense order without ends.
Confirmed by the mission captain (proposal self-audit).