Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definability of one-dimensional value fibers

Proved
Monotonicity_Theorem.definable_value_fiber

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

For a definable function, each one-dimensional fiber over a value is a definable set.

Preamble
import Definitions.Def_Monotonicity_Theorem_Framework
Formal statement
theorem Monotonicity_Theorem.definable_value_fiber {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)) := by sorry
Source
monotonicity.tex, Lemma 1 fiber dichotomy; proved by graph intersection and projection
Read-back

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

Let RRR be an arbitrary type, DDD a dense linear order with no endpoints on RRR, MMM an o-minimal structure over DDD, I,BI,BI,B arbitrary subsets of the 111-fold power of RRR, fff an MMM-definable function with domain set III and codomain set BBB, and zzz an arbitrary point of the 111-fold power of RRR; then it is asserted that the family M.SM.SM.S in arity 111 contains the predicate on xxx in the 111-fold power of RRR given by x∈Ix\in Ix∈I and there exists a witness hxhxhx that x∈Ix\in Ix∈I such that the underlying tuple of the underlying function of fff evaluated at the paired element ⟨x,hx⟩\langle x,hx\rangle⟨x,hx⟩ equals the constant 111-tuple whose value at every index is the value of zzz at index 000, i.e. {x:x∈I∧∃hx:(x∈I), (f(x,hx))1=(_↦z(0))}\{x : x\in I \wedge \exists hx:(x\in I),\, (f(x,hx))_{1} = (\_\mapsto z(0))\}{x:x∈I∧∃hx:(x∈I),(f(x,hx))1​=(_↦z(0))}, with the vacuous/degenerate cases preserved that if x∉Ix\notin Ix∈/I the conjunction fails and if III is empty the defined set is 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