Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Decreasing on a uniform above-below window

Proved
Monotonicity_Theorem.decreasing_of_uniform_above_below2

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

geometry-topologyo-minimality

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_Framework2
Formal statement
theorem Monotonicity_Theorem.decreasing_of_uniform_above_below2 {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 x hxI)).1 (f.toFun (Subtype.mk y hyI)).1) ∧
        (∀ y (hyI : I y), openInterval a b y → Lt1 x y → Lt1 y c2 ->
          Lt1 (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).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 y hyI)).1 (f.toFun (Subtype.mk x hxI)).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 RRR to be a type equipped with a linear order that is dense and has no maximum and no minimum, fix MMM to be an o-minimal structure on RRR, fix III and BBB to be sets of unary tuples over RRR, and fix fff to be a function definable in MMM from III to BBB, whose underlying function takes points of III viewed as tuples together with witnesses of membership in III to points of BBB; suppose fff is injective in the sense that for all unary tuples x,yx,yx,y and all witnesses hxhxhx that xxx is in III and hyhyhy that yyy is in III, if the value of fff at xxx with witness hxhxhx equals the value of fff at yyy with witness hyhyhy then x=yx=yx=y as tuples, which is vacuously true if III has fewer than two elements; fix endpoints a,ba,ba,b over RRR and write (a,b)(a,b)(a,b) for the set of unary tuples strictly between them; suppose every unary tuple in (a,b)(a,b)(a,b) is in III, so in particular (a,b)(a,b)(a,b) is contained in III; suppose aaa is strictly less than bbb in the endpoint order; suppose that for every unary tuple xxx with a witness hxIhxIhxI of membership in III such that xxx is in (a,b)(a,b)(a,b), there exist unary tuples c1,c2c_1,c_2c1​,c2​ such that c1c_1c1​ is in (a,b)(a,b)(a,b) and c2c_2c2​ is in (a,b)(a,b)(a,b) and c1<1xc_1 <_1 xc1​<1​x and x<1c2x <_1 c_2x<1​c2​ in the strict order <1<_1<1​ on unary tuples, and both of the following hold: first, for every unary tuple yyy with a witness hyIhyIhyI of membership in III such that yyy is in (a,b)(a,b)(a,b) and c1<1yc_1 <_1 yc1​<1​y and y<1xy <_1 xy<1​x, the first and only coordinate of the value of fff at xxx is <1<_1<1​ the first and only coordinate of the value of fff at yyy, and second, for every such yyy with witness hyIhyIhyI such that yyy is in (a,b)(a,b)(a,b) and x<1yx <_1 yx<1​y and y<1c2y <_1 c_2y<1​c2​, the first and only coordinate of the value of fff at yyy is <1<_1<1​ the first and only coordinate of the value of fff at xxx, where in each case the values of fff are taken at the points viewed as elements of III via the stated membership witnesses, and this whole uniform two-sided local comparison hypothesis is vacuously true if no point of III lies in (a,b)(a,b)(a,b); then there exist endpoints a2,b2a_2,b_2a2​,b2​ over RRR such that a2a_2a2​ is strictly less than b2b_2b2​ and every unary tuple in (a2,b2)(a_2,b_2)(a2​,b2​) is in III and fff is strictly decreasing on (a2,b2)(a_2,b_2)(a2​,b2​) in the sense that for all unary tuples x,yx,yx,y with respective membership witnesses hxI,hyIhxI,hyIhxI,hyI in III such that xxx is in (a2,b2)(a_2,b_2)(a2​,b2​) and yyy is in (a2,b2)(a_2,b_2)(a2​,b2​), if x<1yx <_1 yx<1​y then the first and only coordinate of the value of fff at yyy is <1<_1<1​ the first and only coordinate of the value of fff at xxx, which decreasing condition is vacuously true if (a2,b2)(a_2,b_2)(a2​,b2​) contains fewer than two witnessed points of III.

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