Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every image value has a fiber-minimal preimage

Proved
Monotonicity_Theorem.min_preimage_exists

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

If every value fiber is finite, then every value in the image has a preimage that is minimal in its fiber: no strictly smaller domain point shares its value. The finite fiber is listed, its least coordinate exists, and the constant tuple there is the required minimum. This is the minimum-preimage construction of Lemma 1.

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.min_preimage_exists {R : Type} (D : DenseLinearOrderNoEndpoints R)
    (M : OMinimalStructure D) {I B : Set (Power R 1)}
    (f : DefinableFunction M I B)
    (hfinite : forall z : Power R 1, IsFinite1 (fun x : Power R 1 =>
      I x /\ exists hx : I x, (f.toFun (Subtype.mk x hx)).1 = (fun _ : Fin 1 => z 0))) :
    forall y : Power R 1, (exists x : Power R 1, exists hx : I x,
      (f.toFun (Subtype.mk x hx)).1 = y) ->
      exists m : Power R 1, exists hm : I m,
        (¬ exists w : Power R 1, I w /\ Lt1 D w m /\ exists hxw : I w, exists hxm : I m,
          (f.toFun (Subtype.mk w hxw)).1 = (f.toFun (Subtype.mk m hxm)).1) /\
        (f.toFun (Subtype.mk m hm)).1 = y := by sorry
Source
monotonicity.tex, Lemma 1 finite-fiber step; minimum-preimage lemma
Read-back

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

Fix a type RRR equipped with DDD, a dense linear order without endpoints on RRR, and MMM, an o-minimal structure over DDD; let I,BI,BI,B be subsets of the 111-dimensional power R1R^{1}R1 and let fff be a definable function in MMM from III to BBB; assume that for every z∈R1z\in R^{1}z∈R1 the collection of x∈R1x\in R^{1}x∈R1 satisfying x∈Ix\in Ix∈I and, for some witness hxhxhx that x∈Ix\in Ix∈I, the underlying R1R^{1}R1-value of fff applied to xxx (with witness hxhxhx) equals the 111-tuple whose value at every index is the 000-th coordinate z(0)z(0)z(0) of zzz, is finite in the 111-dimensional sense. Then for every y∈R1y\in R^{1}y∈R1, if there exist x∈R1x\in R^{1}x∈R1 and a witness hxhxhx that x∈Ix\in Ix∈I such that the underlying R1R^{1}R1-value of fff applied to xxx with witness hxhxhx equals yyy — this antecedent being unsatisfiable in particular when III is empty or yyy is not attained, in which case the implication is vacuous — then there exist m∈R1m\in R^{1}m∈R1 and a witness hmhmhm that m∈Im\in Im∈I such that both (i) it is not the case that there exist w∈R1w\in R^{1}w∈R1 with w∈Iw\in Iw∈I and www less than mmm in the 111-dimensional order induced by DDD and witnesses hxwhxwhxw that w∈Iw\in Iw∈I and hxmhxmhxm that m∈Im\in Im∈I (the latter possibly distinct from hmhmhm) with the underlying R1R^{1}R1-value of fff applied to www with witness hxwhxwhxw equal to the underlying R1R^{1}R1-value of fff applied to mmm with witness hxmhxmhxm, and (ii) the underlying R1R^{1}R1-value of fff applied to mmm with witness hmhmhm equals yyy.

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