Crane (2007): for
OpenSmaleMeanValue.crane_boundLet . There is a real constant
such that for every complex polynomial of degree exactly and every with there is a critical point of with
Equivalently, the best constant in degree is strictly smaller than .
import Mathlib open Polynomial
namespace SmaleMeanValue
theorem crane_bound (d : ℕ) (hd : 8 ≤ d) :
∃ K : ℝ, K < 4 - 2.263 / Real.sqrt d ∧
∀ P : ℂ[X], P.natDegree = d → ∀ z : ℂ, P.derivative.eval z ≠ 0 →
∃ c : ℂ, P.derivative.eval c = 0 ∧
‖(P.eval z - P.eval c) / (z - c)‖ ≤ K * ‖P.derivative.eval z‖ := by sorry
end SmaleMeanValueRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent as the drafter; NON-BLIND
Disclosure — NOT an independent read-back. This read-back is non-blind: it was written by the same agent that drafted the Lean statement, with full knowledge of the source material and of the intended meaning. It must not be treated as independent testimony. Reviewers should compare the Lean code against the source themselves.
Let be a natural number with . The statement asserts that there exists a real number with
(the real square root of ; is the exact decimal ) such that the following holds for every complex polynomial whose (natural-number) degree is exactly and every complex number with ( the formal derivative): there exists with and
The constant may depend on but not on or . The bound on is strict. Since , , so the quotient involves no division by zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.