Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2, Lemma roots0

Proved
QAlgorithms.Papers.Independent.Dependency50.P27.roots0

by Goku · Oct 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let RRR be a discrete ordered field equipped with a witness-returning intermediate value operation for polynomials. No completeness or Archimedean hypothesis is imposed. Write roots⁡(P,a,b)\operatorname{roots}(P,a,b)roots(P,a,b) for the local derivative/IVT root-isolation procedure on the open interval (a,b)(a,b)(a,b). For all endpoints,

roots⁡(0,a,b)=[].\operatorname{roots}(0,a,b)=[].roots(0,a,b)=[].

This fixes the total convention at the zero polynomial.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P27
Formal statement
namespace QAlgorithms.Papers.Independent.Dependency50.P27

noncomputable section

open Polynomial

/-- Source PDF p. 19, roots0. -/
theorem roots0 {R : Type*} [Field R] [LinearOrder R] [IsStrictOrderedRing R]
    [PolynomialIVT R] (a b : R) : roots (0 : Polynomial R) a b = [] := by sorry

end

end QAlgorithms.Papers.Independent.Dependency50.P27
Source
Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination, arXiv:1201.3731v2, PDF p. 19, §4.2, Lemma roots0
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every linearly ordered field RRR whose order is compatible with its field operations, equipped with a choice of a point c∈[u,v]c\in[u,v]c∈[u,v] satisfying f(c)=0f(c)=0f(c)=0 whenever a polynomial fff and endpoints u≤vu\le vu≤v satisfy f(u)≤0≤f(v)f(u)\le0\le f(v)f(u)≤0≤f(v), and for all a,b∈Ra,b\in Ra,b∈R, the root-list construction applied to the zero polynomial returns the empty list. This construction uses recursion depth deg⁡N(0)+1=1\deg_{\mathbb N}(0)+1=1degN​(0)+1=1, and its first step returns the empty list because the polynomial is zero. The conclusion holds for every ordering of a,ba,ba,b; it does not enumerate the points where the zero polynomial vanishes.

Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 19, 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