Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform above-above pattern gives increase

Open
Monotonicity_Theorem.increasing_of_uniform_above_above

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

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

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.increasing_of_uniform_above_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 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 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 difficult case
Read-back

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

Fix a type RRR equipped with DDD, a dense linear order without endpoints, and MMM, an o-minimal structure over DDD; let I,BI,BI,B be sets of 111-tuples over RRR and fff a function definable in MMM from III to BBB. Assume fff is injective on III in the sense that for all x,yx,yx,y with x∈Ix\in Ix∈I and y∈Iy\in Iy∈I, if the value of fff at xxx equals the value of fff at yyy then x=yx=yx=y; assume endpoints a,ba,ba,b over RRR with every xxx in the open interval (a,b)(a,b)(a,b) (taken with respect to DDD) satisfying x∈Ix\in Ix∈I, i.e. (a,b)⊆I(a,b)\subseteq I(a,b)⊆I; assume the uniform local condition that for every x∈Ix\in Ix∈I with x∈(a,b)x\in(a,b)x∈(a,b) there exist points c1,c2c_{1},c_{2}c1​,c2​ with c1∈(a,b)c_{1}\in(a,b)c1​∈(a,b), c2∈(a,b)c_{2}\in(a,b)c2​∈(a,b), c1<1xc_{1} <_{1} xc1​<1​x, x<1c2x <_{1} c_{2}x<1​c2​ such that (i) for all y∈Iy\in Iy∈I with y∈(a,b)y\in(a,b)y∈(a,b), if c1<1yc_{1} <_{1} yc1​<1​y and y<1xy <_{1} xy<1​x then f(x)1<1f(y)1f(x)_{1} <_{1} f(y)_{1}f(x)1​<1​f(y)1​, and (ii) for all y∈Iy\in Iy∈I with y∈(a,b)y\in(a,b)y∈(a,b), if x<1yx <_{1} yx<1​y and y<1c2y <_{1} c_{2}y<1​c2​ then f(x)1<1f(y)1f(x)_{1} <_{1} f(y)_{1}f(x)1​<1​f(y)1​, where <1<_{1}<1​ is the 111-dimensional strict order and f(⋅)1f(\cdot)_{1}f(⋅)1​ denotes the value of fff viewed as a 111-tuple. Then there exist endpoints a2,b2a_{2},b_{2}a2​,b2​ with a2<b2a_{2}<b_{2}a2​<b2​ in the endpoint order such that (a2,b2)⊆I(a_{2},b_{2})\subseteq I(a2​,b2​)⊆I and fff is strictly increasing on (a2,b2)(a_{2},b_{2})(a2​,b2​) in the sense that for all x∈Ix\in Ix∈I, y∈Iy\in Iy∈I with x∈(a2,b2)x\in(a_{2},b_{2})x∈(a2​,b2​), y∈(a2,b2)y\in(a_{2},b_{2})y∈(a2​,b2​), if x<1yx <_{1} yx<1​y then f(x)1<1f(y)1f(x)_{1} <_{1} f(y)_{1}f(x)1​<1​f(y)1​. Note the degenerate cases: if (a,b)(a,b)(a,b) is empty then the inclusion (a,b)⊆I(a,b)\subseteq I(a,b)⊆I and the uniform local hypothesis hold vacuously; if III is empty then injectivity holds vacuously but the inclusion forces (a,b)(a,b)(a,b) to be empty; the conclusion always requires a pair a2<b2a_{2}<b_{2}a2​<b2​, i.e. an endpoint-order-nondegenerate interval, contained in III on which the stated strict inequality for fff-values holds, vacuously if that subinterval contains no 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