Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Covered left windows have a pure adjacent cut above

Proved
Monotonicity_Theorem.left_adjacent_cut

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

If two definable sets cover a left window, some cut above the left endpoint yields a pure adjacent subwindow. Strengthens the adjacent-piece selection with the lower bound needed for domain membership of the cut.

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.left_adjacent_cut {R : Type} (D : DenseLinearOrderNoEndpoints R)
    (M : OMinimalStructure D) {A B : Set (Power R 1)}
    (hA : M.S 1 A) (hB : M.S 1 B)
    {c1 p : R} (hlt : D.lt c1 p)
    (hcov : forall x : Power R 1,
      openInterval D (Endpoint.finite c1) (Endpoint.finite p) x -> A x \/ B x) :
    exists c1' : R, D.lt c1' p /\ (D.lt c1 c1' \/ c1 = c1') /\
      ((forall x : Power R 1,
        openInterval D (Endpoint.finite c1') (Endpoint.finite p) x -> A x) \/
       (forall x : Power R 1,
        openInterval D (Endpoint.finite c1') (Endpoint.finite p) x -> B x)) := by sorry
Source
monotonicity.tex, Lemma 2 covering step; bounded selection lemma
Read-back

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

Let RRR be a type, DDD a dense linear order without endpoints on RRR, MMM an o-minimal structure over DDD, and A,BA,BA,B subsets of the 111-fold power of RRR such that AAA belongs to the family designated by MMM in dimension 111 and BBB belongs to the family designated by MMM in dimension 111; let c1,p∈Rc_{1},p\in Rc1​,p∈R with c1<Dpc_{1} <_{D} pc1​<D​p, and assume that for every xxx in the 111-fold power of RRR, if xxx lies in the open interval with finite endpoints c1c_{1}c1​ and ppp then x∈Ax\in Ax∈A or x∈Bx\in Bx∈B; then there exists c1′∈Rc_{1}'\in Rc1′​∈R such that c1′<Dpc_{1}' <_{D} pc1′​<D​p and (c1<Dc1′c_{1} <_{D} c_{1}'c1​<D​c1′​ or c1=c1′c_{1}=c_{1}'c1​=c1′​) and (for every xxx in the 111-fold power of RRR, if xxx lies in the open interval with finite endpoints c1′,pc_{1}',pc1′​,p then x∈Ax\in Ax∈A, or for every xxx in the 111-fold power of RRR, if xxx lies in the open interval with finite endpoints c1′,pc_{1}',pc1′​,p then x∈Bx\in Bx∈B), where in particular the left endpoint is allowed to stay at c1c_{1}c1​ and, if no element lies in (c1,p)(c_{1},p)(c1​,p) resp. (c1′,p)(c_{1}',p)(c1′​,p), the corresponding universal implication holds vacuously, making the covering hypothesis resp. one or both final alternatives vacuously true.

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