Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform below-above pattern gives increase

Open
Monotonicity_Theorem.increasing_of_uniform_below_above

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

If 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.

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
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 sorry
Source
monotonicity.tex, Lemma 2 easy case
Read-back

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

Let RRR be a type with a dense linear order without endpoints DDD and an o-minimal structure MMM over DDD, let I,BI,BI,B be subsets of R1R^{1}R1 and fff a definable function over MMM with domain III and codomain BBB, let a,ba,ba,b be endpoints, and assume fff is injective on III in the sense that for all x,yx,yx,y in R1R^{1}R1 with x∈Ix\in Ix∈I and y∈Iy\in Iy∈I, if the value of fff at xxx (as an element of III) equals the value of fff at yyy (as an element of III) then x=yx=yx=y, and assume every xxx lying in the DDD-open interval (a,b)(a,b)(a,b) belongs to III, and assume that for every xxx with x∈Ix\in Ix∈I lying in (a,b)(a,b)(a,b) there exist c1,c2c_{1},c_{2}c1​,c2​ in R1R^{1}R1 such that c1c_{1}c1​ lies in (a,b)(a,b)(a,b) and c2c_{2}c2​ lies in (a,b)(a,b)(a,b) and c1<1xc_{1} <_{1} xc1​<1​x and x<1c2x <_{1} c_{2}x<1​c2​ and for all yyy with y∈Iy\in Iy∈I, if yyy lies in (a,b)(a,b)(a,b) and c1<1yc_{1} <_{1} yc1​<1​y and y<1xy <_{1} xy<1​x then the first coordinate of fff at yyy is <1<_{1}<1​ the first coordinate of fff at xxx, and for all yyy with y∈Iy\in Iy∈I, if yyy lies in (a,b)(a,b)(a,b) and x<1yx <_{1} yx<1​y and y<1c2y <_{1} c_{2}y<1​c2​ then the first coordinate of fff at xxx is <1<_{1}<1​ the first coordinate of fff at yyy, where <1<_{1}<1​ is the given 111-dimensional strict order relative to DDD; then there exist endpoints a2,b2a_{2},b_{2}a2​,b2​ with a2<b2a_{2}<b_{2}a2​<b2​ in the endpoint order relative to DDD such that every xxx lying in the DDD-open interval (a2,b2)(a_{2},b_{2})(a2​,b2​) belongs to III and for all x∈Ix\in Ix∈I and y∈Iy\in Iy∈I, if xxx lies in (a2,b2)(a_{2},b_{2})(a2​,b2​) and yyy lies in (a2,b2)(a_{2},b_{2})(a2​,b2​) and x<1yx <_{1} yx<1​y then the first coordinate of fff at xxx is <1<_{1}<1​ the first coordinate of fff at yyy, with the degenerate cases that if (a,b)(a,b)(a,b) is empty the containment and the per-point two-sided bounding hypothesis hold vacuously, and the conclusion still asserts a strictly non-empty subinterval (a2,b2)(a_{2},b_{2})(a2​,b2​) contained in III on which the stated first-coordinate strict monotonicity holds, vacuously if that subinterval meets III in at most one <1<_{1}<1​-comparable pair.

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