Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform above-below pattern gives decrease

Open
Monotonicity_Theorem.decreasing_of_uniform_above_below

by Tamas Fulop · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

If every point of a window has an above-below sign pattern, some subwindow has the function strictly decreasing. The easy above-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_above_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.

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.decreasing_of_uniform_above_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 x hxI)).1 (f.toFun (Subtype.mk y hyI)).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 sorry
Source
monotonicity.tex, Lemma 2 easy case
Read-back

What the Lean code literally says, in plain math · muse-spark

Fix a type RRR with a dense linear order without endpoints DDD and an o-minimal structure MMM over DDD; let I,BI,BI,B be subsets of the 111-dimensional power of RRR and let fff be a definable function relative to MMM with domain III and codomain BBB, writing fI(x)f_I(x)fI​(x) for its value at xxx viewed as a point of III via a membership witness and f1(x)f_1(x)f1​(x) for the first coordinate thereof; assume fff is injective in the sense that for all x,yx,yx,y with witnesses hxhxhx that x∈Ix\in Ix∈I and hyhyhy that y∈Iy\in Iy∈I, if fI(x)=fI(y)f_I(x)=f_I(y)fI​(x)=fI​(y) then x=yx=yx=y; let a,ba,ba,b be endpoints over RRR with associated open interval (a,b)(a,b)(a,b); assume every point of (a,b)(a,b)(a,b) lies in III; assume further that for every xxx with witness hxIhxIhxI that x∈Ix\in Ix∈I such that x∈(a,b)x\in(a,b)x∈(a,b), there exist points c1,c2c_1,c_2c1​,c2​ with c1∈(a,b)c_1\in(a,b)c1​∈(a,b) and c2∈(a,b)c_2\in(a,b)c2​∈(a,b) and c1<1xc_1 <_1 xc1​<1​x and x<1c2x <_1 c_2x<1​c2​ such that both (left-above) for all yyy with witness hyIhyIhyI that y∈Iy\in Iy∈I satisfying y∈(a,b)y\in(a,b)y∈(a,b) and c1<1yc_1 <_1 yc1​<1​y and y<1xy <_1 xy<1​x one has f1(x)<1f1(y)f_1(x) <_1 f_1(y)f1​(x)<1​f1​(y), and (right-below) for all yyy with witness hyIhyIhyI that y∈Iy\in Iy∈I satisfying y∈(a,b)y\in(a,b)y∈(a,b) and x<1yx <_1 yx<1​y and y<1c2y <_1 c_2y<1​c2​ one has f1(y)<1f1(x)f_1(y) <_1 f_1(x)f1​(y)<1​f1​(x) hold, where <1<_1<1​ is the 111-dimensional order and ∈(a,b)\in(a,b)∈(a,b) is membership in the DDD-open interval; note if (a,b)(a,b)(a,b) is empty or I∩(a,b)I\cap(a,b)I∩(a,b) is empty the inclusion and the universal local condition hold vacuously, while injectivity also holds vacuously if III is empty; then the assertion is that there exist endpoints a2,b2a_2,b_2a2​,b2​ with a2<b2a_2 < b_2a2​<b2​ in the endpoint order such that every point of (a2,b2)(a_2,b_2)(a2​,b2​) lies in III and for all x,yx,yx,y with witnesses hxI,hyIhxI,hyIhxI,hyI of membership in III satisfying x∈(a2,b2)x\in(a_2,b_2)x∈(a2​,b2​) and y∈(a2,b2)y\in(a_2,b_2)y∈(a2​,b2​), if x<1yx <_1 yx<1​y then f1(y)<1f1(x)f_1(y) <_1 f_1(x)f1​(y)<1​f1​(x), i.e. (a2,b2)(a_2,b_2)(a2​,b2​) is a non-degenerate subinterval contained in III on which the first coordinate of fff is strictly decreasing.

Human review
  • Endorsed by Shuze Chen · Sep 11, 2026

  • Endorsed by Tamas Fulop · Sep 11, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me