Uniform below-below pattern gives decrease
OpenMonotonicity_Theorem.decreasing_of_uniform_below_belowIf every point of a window has a below-below sign pattern, some subwindow has the function strictly decreasing. The difficult below case of Lemma 2. Retired: the window was not required to be nonempty, so the statement is false as stated; use Monotonicity_Theorem.decreasing_of_uniform_below_below_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.decreasing_of_uniform_below_below {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 y hyI)).1 (f.toFun (Subtype.mk x hxI)).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 y hyI)).1 (f.toFun (Subtype.mk x hxI)).1) := by sorryRead-back
What the Lean code literally says, in plain math · muse-spark
Fix a type with a dense linear order without endpoints on , an o-minimal structure over , subsets of the -fold power of , a definable (relative to ) function from to , and endpoints ; assume is injective on in the sense that for all with and , if the value of at equals the value of at then , assume in the sense that for every , if is in the -open interval with endpoints then , and assume the following two-sided local above-condition uniformly in : for every with and in there exist in the -fold power of such that is in and is in and and in the strict order on the -fold power, and for all with and in , if and then the first coordinate of the value of at is strictly less than the first coordinate of the value of at , and for all with and in , if and then the first coordinate of the value of at is strictly less than the first coordinate of the value of at ; then there exist endpoints with strictly below such that every in the -open interval satisfies and such that for all with and and in and in , if then the first coordinate of the value of at is strictly less than the first coordinate of the value of at , i.e. is strictly decreasing in first coordinate on that subinterval; note the degenerate readings that if is empty injectivity holds vacuously and if is empty the containment holds for the empty interval and the local condition holds vacuously, whereas the conclusion always demands strictly ordered endpoints and an contained in on which the strict decreasing inequality holds, which is unsatisfiable if contains no such interval.
Confirmed by the mission captain (proposal self-audit).