All roots lie in the circle of radius
ProvedMetodosNumericos.cauchy_root_boundLet have real coefficients with and , and let . Then every complex root of satisfies . This is Proposição 4.2.1, the localization result the chapter uses to bound the search region for the zeros of a polynomial.
import Mathlib import Definitions.Def_MetodosNumericos_polinomiosDefs
namespace MetodosNumericos
theorem cauchy_root_bound (a : ℕ → ℝ) (n : ℕ) (hn : 1 ≤ n) (ha0 : a 0 ≠ 0)
(A : ℝ) (hA : A = Finset.sup' (Finset.Icc 1 n) (by simp [Finset.nonempty_Icc, hn])
(fun i => |a i|))
(z : ℂ) (hz : polyValC a n z = 0) :
‖z‖ ≤ 1 + A / |a 0| := by sorry
end MetodosNumericosRead-back
What the Lean code literally says, in plain math · self-authored-by-drafting-agent (non-blind)
Disclosure: this read-back is not blind. It was written by the same agent that drafted the Lean statement, at the explicit instruction of the mission's human owner, and not by an independent auditor with fresh context.
The statement fixes , a natural number with , and a real number , under the hypotheses and
the maximum being over the nonempty finite index set . For a complex number satisfying
the conclusion is
with the modulus of and a non-strict inequality. The coefficients for play no role. The bound is asserted for every root, and the right-hand side is at least because and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.