Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Monotonicity theorem

Proved
Monotonicity_Theorem.monotonicity_theorem

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

Let an o-minimal structure M be given on a dense linear order without endpoints. For a definable function f on an infinite definable interval I, and ordered endpoints a and b, there are finitely many cut points from a to b. On each intervening open interval, f is constant, or strictly increasing and continuous, or strictly decreasing and continuous, with continuity expressed by ContinuousPoints. Further retired 2026-09-14: superseded by the TeX-faithful formalization under the same name in the current staging proposal (interval domain, continuity only on monotone pieces).

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.monotonicity_theorem {R : Type} (D : DenseLinearOrderNoEndpoints R)
    (M : OMinimalStructure D) {I B : Set (Power R 1)}
    (f : DefinableFunction M I B) (hI : IsInfinite1 I)
    {a b : Power R 1} (hab : Lt1 D a b) :
    exists k : Nat, exists p : Fin (k + 1) -> Power R 1,
      p 0 = a /\ p (Fin.last k) = b /\
      (forall i : Fin k, Lt1 D (p i.castSucc) (p i.succ)) /\
      (forall i : Fin k,
        let J : Set (Power R 1) := openInterval D (Endpoint.finite ((p i.castSucc) 0)) (Endpoint.finite ((p i.succ) 0))
        ((forall x (hxI : I x), J x -> forall y (hyI : I y), J y ->
          f.toFun (Subtype.mk x hxI) = f.toFun (Subtype.mk y hyI)) \/
         (((forall x (hxI : I x), J x -> forall y (hyI : I y), J y -> Lt1 D x y ->
            Lt1 D (f.toFun (Subtype.mk x hxI)).1 (f.toFun (Subtype.mk y hyI)).1) \/
           (forall x (hxI : I x), J x -> forall y (hyI : I y), J y -> Lt1 D x y ->
            Lt1 D (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).1)) /\
          J.Subset (ContinuousPoints D I (FunctionGraph (R := R) (m := 1) (n := 1) (A := I) (B := B) f.toFun))))) := by sorry
Source
monotonicity.tex, Theorem (Monotonicity Theorem)
Read-back

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

Fix a type RRR, a dense linear order without endpoints DDD on RRR, an o-minimal structure MMM over DDD, subsets I,BI,BI,B of R1R^1R1, a definable function fff from III to BBB with respect to MMM, the hypothesis that III is infinite in the 111-dimensional sense, and points a,ba,ba,b in R1R^1R1 with aaa strictly less than bbb in the DDD-order in dimension 111. Then there exist a natural number kkk and a sequence p0,…,pkp_0,\dots,p_kp0​,…,pk​ in R1R^1R1 such that p0=ap_0=ap0​=a and pk=bp_k=bpk​=b and pi<pi+1p_i<p_{i+1}pi​<pi+1​ in the DDD-order in dimension 111 for every i<ki<ki<k, and such that for every i<ki<ki<k, letting JJJ be the open interval over DDD with finite left endpoint the 000-th coordinate of pip_ipi​ and finite right endpoint the 000-th coordinate of pi+1p_{i+1}pi+1​, either fff is constant on I∩JI\cap JI∩J in the sense that for all xxx in III with xxx in JJJ and all yyy in III with yyy in JJJ, the value of fff at xxx regarded as an element of III equals the value of fff at yyy regarded as an element of III, or both of the following hold: (a) either fff is strictly increasing on I∩JI\cap JI∩J in the sense that for all xxx in III with xxx in JJJ and all yyy in III with yyy in JJJ, if x<yx<yx<y then the underlying R1R^1R1-point of the value of fff at xxx is strictly less in the DDD-order than the underlying R1R^1R1-point of the value of fff at yyy, or fff is strictly decreasing on I∩JI\cap JI∩J in the sense that for all xxx in III with xxx in JJJ and all yyy in III with yyy in JJJ, if x<yx<yx<y then the underlying R1R^1R1-point of the value of fff at yyy is strictly less in the DDD-order than the underlying R1R^1R1-point of the value of fff at xxx, and (b) JJJ is a subset of the set of continuity points with parameters D,ID,ID,I of the function graph in dimensions m=1,n=1m=1,n=1m=1,n=1 with domain III and codomain BBB of the underlying function of fff; in the degenerate case k=0k=0k=0 there is a single point p0p_0p0​ required to equal both aaa and bbb despite a<ba<ba<b, and the strict-increase and per-interval conditions over i<ki<ki<k are vacuous, and in general an interval JJJ may be empty or I∩JI\cap JI∩J may be empty making the universal constant/monotone conditions vacuous.

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