Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definable fibers split into an infinite or finite case

Proved
Monotonicity_Theorem.fiber_dichotomy_v2

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

For a definable function, either some definable value fiber is infinite, or every value fiber is finite.

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.fiber_dichotomy_v2 {R : Type} (D : DenseLinearOrderNoEndpoints R)
    (M : OMinimalStructure D) {I B : Set (Power R 1)}
    (f : DefinableFunction M I B) :
    (∃ z : Power R 1,
      (M.S 1 (fun x : Power R 1 => I x ∧ ∃ hx : I x,
        (f.toFun ⟨x, hx⟩).1 = (fun _ : Fin 1 => z 0)) ∧
       IsInfinite1 (fun x : Power R 1 => I x ∧ ∃ hx : I x,
        (f.toFun ⟨x, hx⟩).1 = (fun _ : Fin 1 => z 0)))) ∨
    ∀ z : Power R 1, IsFinite1 (fun x : Power R 1 => I x ∧ ∃ hx : I x,
      (f.toFun ⟨x, hx⟩).1 = (fun _ : Fin 1 => z 0)) := by sorry
Source
monotonicity.tex, Lemma 1 case split
Read-back

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

Fix an arbitrary type RRR equipped with a dense linear order without endpoints DDD, an o-minimal structure MMM over DDD, arbitrary subsets I,BI,BI,B of the 111-dimensional power space over RRR, and a function fff definable in MMM with domain III and codomain BBB; then exactly the following disjunction is asserted: either there exists a 111-tuple zzz such that, for the fiber predicate FzF_{z}Fz​ defined by Fz(x)F_{z}(x)Fz​(x) iff x∈Ix\in Ix∈I and there exists a witness hxh_{x}hx​ to x∈Ix\in Ix∈I with the first coordinate of the underlying value of fff at the pair (x,hx)(x,h_{x})(x,hx​) equal to the constant 111-tuple whose every coordinate equals the 000-th coordinate of zzz, i.e. Fz={x∣I(x)∧∃hx:I(x), π1(f(x,hx))=cz}F_{z} = \{x \mid I(x)\land \exists h_{x}:I(x),\,\pi_{1}(f(x,h_{x})) = c_{z}\}Fz​={x∣I(x)∧∃hx​:I(x),π1​(f(x,hx​))=cz​} where cz(i)=z(0)c_{z}(i)=z(0)cz​(i)=z(0) for all indices iii, both the 111-dimensional SSS-predicate of MMM holds of FzF_{z}Fz​, M.S1(Fz)M.S_{1}(F_{z})M.S1​(Fz​), and FzF_{z}Fz​ is 111-dimensionally infinite, IsInfinite1(Fz)\mathrm{IsInfinite}_{1}(F_{z})IsInfinite1​(Fz​), or for every 111-tuple zzz, with FzF_{z}Fz​ and czc_{z}cz​ as above, FzF_{z}Fz​ is 111-dimensionally finite, IsFinite1(Fz)\mathrm{IsFinite}_{1}(F_{z})IsFinite1​(Fz​), where the quantifier over zzz ranges over the whole power space including 111-tuples outside BBB and outside the image of fff, and where if III is empty or x∉Ix\notin Ix∈/I then I(x)∧∃hx:I(x), …I(x)\land \exists h_{x}:I(x),\,\ldotsI(x)∧∃hx​:I(x),… is false because the required witness hxh_{x}hx​ is impossible, so all fibers are then empty.

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