Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every interior point has a local sign pattern

Proved
Monotonicity_Theorem.pattern_at_interior_point

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

An interior point of the domain of an injective definable function on an interval satisfies one of the four local sign patterns: on some two-sided window in the domain, values stay strictly above or below on each side. This is the pointwise covering step of Lemma 2.

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.pattern_at_interior_point {R : Type} (D : DenseLinearOrderNoEndpoints R)
    (M : OMinimalStructure D) {a b : Endpoint R} {B : Set (Power R 1)}
    (f : DefinableFunction M (openInterval D a b) B)
    (hinj : forall x y (hx : openInterval D a b x) (hy : openInterval D a b y),
      f.toFun (Subtype.mk x hx) = f.toFun (Subtype.mk y hy) -> x = y)
    {p : Power R 1} (hp : openInterval D a b p) :
    (exists c1 c2 : Power R 1, openInterval D a b c1 /\ openInterval D a b c2 /\
      Lt1 D c1 p /\ Lt1 D p c2 /\
      (forall y (hy : openInterval D a b y), Lt1 D c1 y -> Lt1 D y p ->
        Lt1 D (f.toFun (Subtype.mk p hp)).1 (f.toFun (Subtype.mk y hy)).1) /\
      (forall y (hy : openInterval D a b y), Lt1 D p y -> Lt1 D y c2 ->
        Lt1 D (f.toFun (Subtype.mk p hp)).1 (f.toFun (Subtype.mk y hy)).1)) \/
    (exists c1 c2 : Power R 1, openInterval D a b c1 /\ openInterval D a b c2 /\
      Lt1 D c1 p /\ Lt1 D p c2 /\
      (forall y (hy : openInterval D a b y), Lt1 D c1 y -> Lt1 D y p ->
        Lt1 D (f.toFun (Subtype.mk p hp)).1 (f.toFun (Subtype.mk y hy)).1) /\
      (forall y (hy : openInterval D a b y), Lt1 D p y -> Lt1 D y c2 ->
        Lt1 D (f.toFun (Subtype.mk y hy)).1 (f.toFun (Subtype.mk p hp)).1)) \/
    (exists c1 c2 : Power R 1, openInterval D a b c1 /\ openInterval D a b c2 /\
      Lt1 D c1 p /\ Lt1 D p c2 /\
      (forall y (hy : openInterval D a b y), Lt1 D c1 y -> Lt1 D y p ->
        Lt1 D (f.toFun (Subtype.mk y hy)).1 (f.toFun (Subtype.mk p hp)).1) /\
      (forall y (hy : openInterval D a b y), Lt1 D p y -> Lt1 D y c2 ->
        Lt1 D (f.toFun (Subtype.mk p hp)).1 (f.toFun (Subtype.mk y hy)).1)) \/
    (exists c1 c2 : Power R 1, openInterval D a b c1 /\ openInterval D a b c2 /\
      Lt1 D c1 p /\ Lt1 D p c2 /\
      (forall y (hy : openInterval D a b y), Lt1 D c1 y -> Lt1 D y p ->
        Lt1 D (f.toFun (Subtype.mk y hy)).1 (f.toFun (Subtype.mk p hp)).1) /\
      (forall y (hy : openInterval D a b y), Lt1 D p y -> Lt1 D y c2 ->
        Lt1 D (f.toFun (Subtype.mk y hy)).1 (f.toFun (Subtype.mk p hp)).1)) := by sorry
Source
monotonicity.tex, Lemma 2 covering step; pointwise pattern lemma
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, endpoints a,ba,ba,b, a set BBB of 111-powers over RRR, a definable function fff from the open interval (a,b)(a,b)(a,b) to BBB, and a point ppp with p∈(a,b)p\in (a,b)p∈(a,b); assume fff is injective in the sense that for all x,yx,yx,y with x∈(a,b)x\in(a,b)x∈(a,b) and y∈(a,b)y\in(a,b)y∈(a,b), if the value of fff at xxx (taken with its membership witness) equals the value of fff at yyy (taken with its membership witness) then x=yx=yx=y.

Then one of the following four alternatives holds, where c1,c2c_1,c_2c1​,c2​ range over 111-powers, c∈(a,b)c\in(a,b)c∈(a,b) means membership in the open interval, <1<_{1}<1​ is the given 111-dimensional strict order, and f(p)1f(p)_1f(p)1​, f(y)1f(y)_1f(y)1​ denote the first-coordinate projections of the values of fff at ppp and yyy taken with the witnesses that p,y∈(a,b)p,y\in(a,b)p,y∈(a,b):

  1. there exist c1,c2c_1,c_2c1​,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<1pc_1 <_{1} pc1​<1​p, p<1c2p <_{1} c_2p<1​c2​, and both: for all yyy with y∈(a,b)y\in(a,b)y∈(a,b), if c1<1yc_1 <_{1} yc1​<1​y and y<1py <_{1} py<1​p then f(p)1<1f(y)1f(p)_1 <_{1} f(y)_1f(p)1​<1​f(y)1​, and for all yyy with y∈(a,b)y\in(a,b)y∈(a,b), if p<1yp <_{1} yp<1​y and y<1c2y <_{1} c_2y<1​c2​ then f(p)1<1f(y)1f(p)_1 <_{1} f(y)_1f(p)1​<1​f(y)1​; or
  2. there exist c1,c2c_1,c_2c1​,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<1pc_1 <_{1} pc1​<1​p, p<1c2p <_{1} c_2p<1​c2​, and both: for all yyy with y∈(a,b)y\in(a,b)y∈(a,b), if c1<1yc_1 <_{1} yc1​<1​y and y<1py <_{1} py<1​p then f(p)1<1f(y)1f(p)_1 <_{1} f(y)_1f(p)1​<1​f(y)1​, and for all yyy with y∈(a,b)y\in(a,b)y∈(a,b), if p<1yp <_{1} yp<1​y and y<1c2y <_{1} c_2y<1​c2​ then f(y)1<1f(p)1f(y)_1 <_{1} f(p)_1f(y)1​<1​f(p)1​; or
  3. there exist c1,c2c_1,c_2c1​,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<1pc_1 <_{1} pc1​<1​p, p<1c2p <_{1} c_2p<1​c2​, and both: for all yyy with y∈(a,b)y\in(a,b)y∈(a,b), if c1<1yc_1 <_{1} yc1​<1​y and y<1py <_{1} py<1​p then f(y)1<1f(p)1f(y)_1 <_{1} f(p)_1f(y)1​<1​f(p)1​, and for all yyy with y∈(a,b)y\in(a,b)y∈(a,b), if p<1yp <_{1} yp<1​y and y<1c2y <_{1} c_2y<1​c2​ then f(p)1<1f(y)1f(p)_1 <_{1} f(y)_1f(p)1​<1​f(y)1​; or
  4. there exist c1,c2c_1,c_2c1​,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<1pc_1 <_{1} pc1​<1​p, p<1c2p <_{1} c_2p<1​c2​, and both: for all yyy with y∈(a,b)y\in(a,b)y∈(a,b), if c1<1yc_1 <_{1} yc1​<1​y and y<1py <_{1} py<1​p then f(y)1<1f(p)1f(y)_1 <_{1} f(p)_1f(y)1​<1​f(p)1​, and for all yyy with y∈(a,b)y\in(a,b)y∈(a,b), if p<1yp <_{1} yp<1​y and y<1c2y <_{1} c_2y<1​c2​ then f(y)1<1f(p)1f(y)_1 <_{1} f(p)_1f(y)1​<1​f(p)1​.
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