§4.2, Lemma roots0
ProvedQAlgorithms.Papers.Independent.Dependency50.P27.roots0Let be a discrete ordered field equipped with a witness-returning intermediate value operation for polynomials. No completeness or Archimedean hypothesis is imposed. Write for the local derivative/IVT root-isolation procedure on the open interval . For all endpoints,
This fixes the total convention at the zero polynomial.
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P27
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every linearly ordered field whose order is compatible with its field operations, equipped with a choice of a point satisfying whenever a polynomial and endpoints satisfy , and for all , the root-list construction applied to the zero polynomial returns the empty list. This construction uses recursion depth , and its first step returns the empty list because the polynomial is zero. The conclusion holds for every ordering of ; it does not enumerate the points where the zero polynomial vanishes.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.