Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Non-minimal points of a definable function are definable

Proved
Monotonicity_Theorem.nonminimal_points_definable

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

The set of domain points admitting a strictly smaller point with the same function value is definable. The joint relation is built by reindexing the graph and order into a three-coordinate space and projecting, so fiber minima become definable by complementation. This is the core of the Lemma 1 finite-fiber case.

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.nonminimal_points_definable {R : Type} (D : DenseLinearOrderNoEndpoints R)
    (M : OMinimalStructure D) {I B : Set (Power R 1)}
    (f : DefinableFunction M I B) :
    M.S 1 (fun x : Power R 1 => exists w : Power R 1, I w /\ Lt1 D w x /\
      exists hxw : I w, exists hxx : I x,
        (f.toFun (Subtype.mk w hxw)).1 = (f.toFun (Subtype.mk x hxx)).1) := by sorry
Source
monotonicity.tex, Lemma 1 finite-fiber step; supporting definability lemma
Read-back

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

Let RRR be a type, let DDD be a dense linear order with no endpoints on RRR, let MMM be an o-minimal structure over DDD, let III and BBB be sets of 111-tuples over RRR, and let fff be an MMM-definable function from III to BBB; then the 111-ary family associated to MMM contains the set of those 111-tuples xxx for which there exists a 111-tuple www such that w∈Iw \in Iw∈I and w<xw < xw<x in the 111-dimensional order induced by DDD and there exist membership witnesses hw:w∈Ih_w : w \in Ihw​:w∈I and hx:x∈Ih_x : x \in Ihx​:x∈I with the first coordinate of the value of fff at www regarded as an element of III via hwh_whw​ equal to the first coordinate of the value of fff at xxx regarded as an element of III via hxh_xhx​, i.e. (f(w))1=(f(x))1(f(w))_1 = (f(x))_1(f(w))1​=(f(x))1​; in particular the defining condition explicitly requires w∈Iw \in Iw∈I and, via the required witness hxh_xhx​, can hold only when x∈Ix \in Ix∈I (with w∈Iw \in Iw∈I required a second time via hwh_whw​), so that if III is empty or if x∉Ix \notin Ix∈/I the condition is unsatisfiable and no such xxx belongs to the set.

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