Cauchy's bound on polynomial roots
ProvedFamousTheorems.cauchy_bound_polynomial_rootsCauchy's bound on polynomial roots. Let be a nonzero polynomial over a normed division ring. Every root of satisfies
Cauchy gave this bound in 1829. It confines all roots to an explicit disc, which is the starting point for root-isolation and numerical root-finding algorithms.
Formalization note. Mathlib's Polynomial.IsRoot.norm_lt_cauchyBound. p.cauchyBound is the non-negative real number , and the norm of the root is taken in NNReal (‖a‖₊). The coefficients may lie in any normed division ring, including , , the quaternions and .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem cauchy_bound_polynomial_roots {K : Type*} [NormedDivisionRing K] {p : Polynomial K} (hp : p ≠ 0) {a : K} (ha : p.IsRoot a) :
‖a‖₊ < p.cauchyBound := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Polynomial.IsRoot.norm_lt_cauchyBound`. Proof here reduces to that Mathlib result.