Uniform below-above pattern gives increase
OpenMonotonicity_Theorem.increasing_of_uniform_below_aboveIf 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_Framework
theorem Monotonicity_Theorem.increasing_of_uniform_below_above {R : Type} (D : DenseLinearOrderNoEndpoints R)
(M : OMinimalStructure D) {I B : Set (Power R 1)}
(f : DefinableFunction M I B)
(hinj : forall 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 : forall x, openInterval D a b x -> I x)
(hU : forall x (hxI : I x), openInterval D a b x ->
exists c1 c2 : Power R 1, openInterval D a b c1 /\ openInterval D a b c2 /\
Lt1 D c1 x /\ Lt1 D x c2 /\
(forall y (hyI : I y), openInterval D a b y -> Lt1 D c1 y -> Lt1 D y x ->
Lt1 D (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).1) /\
(forall y (hyI : I y), openInterval D a b y -> Lt1 D x y -> Lt1 D y c2 ->
Lt1 D (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1)) :
exists a2 b2 : Endpoint R, Endpoint.lt D a2 b2 /\
(forall x, openInterval D a2 b2 x -> I x) /\
(forall x (hxI : I x) y (hyI : I y), openInterval D a2 b2 x -> openInterval D a2 b2 y ->
Lt1 D x y -> Lt1 D (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
Let be a type with a dense linear order without endpoints and an o-minimal structure over , let be subsets of and a definable function over with domain and codomain , let be endpoints, and assume is injective on in the sense that for all in with and , if the value of at (as an element of ) equals the value of at (as an element of ) then , and assume every lying in the -open interval belongs to , and assume that for every with lying in there exist in such that lies in and lies in and and and for all with , if lies in and and then the first coordinate of at is the first coordinate of at , and for all with , if lies in and and then the first coordinate of at is the first coordinate of at , where is the given -dimensional strict order relative to ; then there exist endpoints with in the endpoint order relative to such that every lying in the -open interval belongs to and for all and , if lies in and lies in and then the first coordinate of at is the first coordinate of at , with the degenerate cases that if is empty the containment and the per-point two-sided bounding hypothesis hold vacuously, and the conclusion still asserts a strictly non-empty subinterval contained in on which the stated first-coordinate strict monotonicity holds, vacuously if that subinterval meets in at most one -comparable pair.
Confirmed by the mission captain (proposal self-audit).