§4.2, Lemma neighpr_wit
ProvedQAlgorithms.Papers.Independent.Dependency50.P27.neighpr_witLet be a discrete ordered field equipped with a witness-returning intermediate value operation for polynomials. No completeness or Archimedean hypothesis is imposed. Let be the right neighborhood ending at the next root, with the specified total defaults. If and , then
Both hypotheses ensure that this open neighborhood has a witness.
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P27
namespace QAlgorithms.Papers.Independent.Dependency50.P27
noncomputable section
open Polynomial
/-- Source PDF p. 20, neighpr_wit, with both nondegeneracy hypotheses. -/
theorem neighpr_wit {R : Type*} [Field R] [LinearOrder R] [IsStrictOrderedRing R]
[PolynomialIVT R] (p : Polynomial R) (x b : R) (hxb : x < b) (hp : p ≠ 0) :
∃ y : R, y ∈ neighpr p x 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
Let be a field with a linear order making it a strictly ordered ring, equipped with a polynomial intermediate-value operation: whenever and , this operation selects a zero of in . For every polynomial and satisfying and , there exists such that , where is the first entry of the following computed list of roots, or if that list is empty. Define lists recursively: is empty; is empty if or ; otherwise, scan the list followed by , starting at . For each successive pair of scan points , append the selected intermediate-value zero of if and , or the selected zero of if and ; then append if , and continue from . Retain only entries strictly between and . The list used to define is , where is the natural degree of , with natural degree for the zero polynomial. The hypotheses permit nonzero constant polynomials and permit .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.