Bennett exists sign root error
ProvedD1Bound5.bennett_exists_sign_root_errordiophantine-tuplesnumber-theory
One fixed sign gives the elementary root error bound relative to any nonzero complex target. The chosen sign is retained in the conclusion.
Preamble
import Lean.Elab.Tactic.Omega import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Algebra.Polynomial.Degree.Operations import Mathlib.Analysis.Analytic.Binomial import Mathlib.Analysis.Complex.Basic import Mathlib.Analysis.Normed.Ring.Basic import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Combinatorics.Enumerative.Catalan.Basic import Mathlib.Data.Finset.Insert import Mathlib.Data.Sym.Basic import Mathlib.Data.Sym.Card import Mathlib.LinearAlgebra.Lagrange import Mathlib.RingTheory.Binomial import Mathlib.RingTheory.MvPolynomial.Symmetric.Defs import Mathlib.RingTheory.PowerSeries.Binomial import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.NormNum import Mathlib.Tactic.Ring
Formal statement
section
namespace D1Bound5
theorem _root_.D1Bound5.bennett_exists_sign_root_error (t θ : ℂ) (hθ : θ ≠ 0) :
∃ v : ℂ, (v = t ∨ v = -t) ∧
0 ≤ (v / θ).re ∧ ‖θ - v‖ ≤ ‖t ^ 2 - θ ^ 2‖ / ‖θ‖ := by sorry
end D1Bound5
end
Source
D1Bound5/BennettRootApproximation.lean, lines 7-36, SHA-256 ca1061aebc87736a011fd6e5cb0011ac939b7397422bdbe21a20c1861b490805. Project: https://github.com/tomislav-math/d1-bound5-lean