Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Injective functions are locally strictly monotone

Proved
Monotonicity_Theorem.lemma_two_corrected

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

An injective definable function on an infinite domain is strictly increasing or strictly decreasing on a subinterval. Further retired 2026-09-14: old-framework statement superseded by Monotonicity_Theorem.lemma_two (new framework) in the current staging proposal.

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.lemma_two_corrected {R : Type} (D : DenseLinearOrderNoEndpoints R) (M : OMinimalStructure D)
    {I B : Set (Power R 1)} (f : DefinableFunction M I B) (hI : IsInfinite1 I)
    (hinj : forall x y (hx : I x) (hy : I y),
      f.toFun (Subtype.mk x hx) = f.toFun (Subtype.mk y hy) -> x = y) :
    exists a b : Endpoint R, Endpoint.lt D a b /\
      (forall x, openInterval D a b x -> I x) /\
      ((forall x (hxI : I x) y (hyI : I y), openInterval D a b x -> openInterval D a b 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) y (hyI : I y), openInterval D a b x -> openInterval D a b y ->
          Lt1 D x y -> Lt1 D (f.toFun (Subtype.mk y hyI)).1 (f.toFun (Subtype.mk x hxI)).1)) := by sorry
Source
monotonicity.tex, Lemma 2
Read-back

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

Fix a type RRR with a dense linear order without endpoints DDD and an o-minimal structure MMM over DDD; let III and BBB be subsets of the 111-dimensional power R1R^1R1; let fff be a function definable in MMM from III to BBB; assume III is infinite in the 111-dimensional sense; assume fff is injective in the sense that for all x,yx,yx,y in R1R^1R1 with x∈Ix\in Ix∈I and y∈Iy\in Iy∈I, if the value of fff at xxx regarded as a point of III equals the value of fff at yyy regarded as a point of III then x=yx=yx=y; then there exist endpoints a,ba,ba,b over RRR such that aaa is strictly less than bbb in the endpoint order, and every xxx in R1R^1R1 lying in the open interval (a,b)(a,b)(a,b) lies in III, and at least one of the following two holds: (i) for all x∈Ix\in Ix∈I and all y∈Iy\in Iy∈I, if xxx lies in (a,b)(a,b)(a,b) and yyy lies in (a,b)(a,b)(a,b) and xxx precedes yyy in the 111-dimensional order then the first coordinate of f(x)f(x)f(x) precedes the first coordinate of f(y)f(y)f(y), (ii) for all x∈Ix\in Ix∈I and all y∈Iy\in Iy∈I, if xxx lies in (a,b)(a,b)(a,b) and yyy lies in (a,b)(a,b)(a,b) and xxx precedes yyy then the first coordinate of f(y)f(y)f(y) precedes the first coordinate of f(x)f(x)f(x), where in (i) and (ii) the injectivity hypothesis compares full function values while the conclusion compares only first coordinates, and if there are no x,y∈I∩(a,b)x,y\in I\cap(a,b)x,y∈I∩(a,b) with xxx preceding yyy both (i) and (ii) hold vacuously.

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