Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Increasing on a uniform below-above window

Proved
Monotonicity_Theorem.increasing_of_uniform_below_above2

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

geometry-topologyo-minimality

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_Framework2
Formal statement
theorem Monotonicity_Theorem.increasing_of_uniform_below_above2 {R : Type} [LinearOrder R] [DenselyOrdered R] [NoMaxOrder R] [NoMinOrder R]
    (M : OMinimalStructure R) {I B : Set (Power R 1)}
    (f : DefinableFunction M I B)
    (hinj : ∀ 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 : ∀ x, openInterval a b x → I x)
    (hlt : Endpoint.lt a b)
    (hU : ∀ x (hxI : I x), openInterval a b x ->
        ∃ c1 c2 : Power R 1, openInterval a b c1 ∧ openInterval a b c2 ∧
        Lt1 c1 x ∧ Lt1 x c2 ∧
        (∀ y (hyI : I y), openInterval a b y → Lt1 c1 y → Lt1 y x ->
          Lt1 (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).1) ∧
        (∀ y (hyI : I y), openInterval a b y → Lt1 x y → Lt1 y c2 ->
          Lt1 (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1)) :
    ∃ a2 b2 : Endpoint R, Endpoint.lt a2 b2 ∧
      (∀ x, openInterval a2 b2 x → I x) ∧
      (∀ x (hxI : I x) y (hyI : I y), openInterval a2 b2 x → openInterval a2 b2 y ->
        Lt1 x y → Lt1 (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1) := by sorry
Source
van den Dries, Tame Topology and O-Minimal Structures, Ch. 3
Read-back

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

Fix a type RRR equipped with a linear order that is dense and has neither a maximum nor a minimum, let MMM be an o-minimal structure on RRR, let III and BBB be sets of unary tuples over RRR, let fff be a function definable in MMM from III to BBB, suppose fff is injective in the sense that for any 111-tuples x,yx,yx,y belonging to III, equality of the values of fff at xxx and yyy implies x=yx=yx=y, let aaa and bbb be extended endpoints over RRR, suppose every 111-tuple xxx lying in the open interval with endpoints a,ba,ba,b belongs to III, suppose aaa is strictly below bbb, and suppose that for every xxx belonging both to III and to the interval (a,b)(a,b)(a,b) there exist 111-tuples c1,c2c_1,c_2c1​,c2​ such that c1c_1c1​ and c2c_2c2​ both lie in (a,b)(a,b)(a,b) and c1<1x<1c2c_1 <_1 x <_1 c_2c1​<1​x<1​c2​ in the strict order on 111-tuples, and for every yyy belonging both to III and to (a,b)(a,b)(a,b) with c1<1y<1xc_1 <_1 y <_1 xc1​<1​y<1​x the underlying 111-tuple of the fff-value at yyy is <1<_1<1​-below the underlying 111-tuple of the fff-value at xxx, and for every yyy belonging both to III and to (a,b)(a,b)(a,b) with x<1y<1c2x <_1 y <_1 c_2x<1​y<1​c2​ the underlying 111-tuple of the fff-value at xxx is <1<_1<1​-below the underlying 111-tuple of the fff-value at yyy; then there exist extended endpoints a2a_2a2​ and b2b_2b2​ such that a2a_2a2​ is strictly below b2b_2b2​ and every 111-tuple lying in the open interval (a2,b2)(a_2,b_2)(a2​,b2​) belongs to III and for any x,yx,yx,y belonging both to III and to (a2,b2)(a_2,b_2)(a2​,b2​), if x<1yx <_1 yx<1​y then the underlying 111-tuple of the fff-value at xxx is <1<_1<1​-below the underlying 111-tuple of the fff-value at yyy, where the injectivity hypothesis is vacuous if III has fewer than two points, each local comparison is vacuous when there is no such intermediate yyy, and the final strict-increase claim is vacuous when (a2,b2)(a_2,b_2)(a2​,b2​) contains fewer than two points of III, while the containment of (a,b)(a,b)(a,b) in III together with aaa strictly below bbb rules out III being empty given that a nondegenerate interval in a dense order without extrema is inhabited.

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

  • Endorsed by Tamas Fulop · Sep 15, 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