Smale's conjecture with the optimal constant
OpenSmaleMeanValue.smale_mean_value_conjecture_optimalLet be a complex polynomial of degree and let with . Then there is a critical point of with
This is the strong form of Smale's conjecture, with the constant that the example shows to be optimal in each degree. It implies the goal () and is open; Tischler proved it for polynomials with only real roots and for polynomials whose roots all have the same absolute value.
import Mathlib open Polynomial
namespace SmaleMeanValue
theorem smale_mean_value_conjecture_optimal (P : ℂ[X]) (hP : 2 ≤ P.natDegree) (z : ℂ)
(hz : P.derivative.eval z ≠ 0) :
∃ c : ℂ, P.derivative.eval c = 0 ∧
‖(P.eval z - P.eval c) / (z - c)‖ ≤
(((P.natDegree : ℝ) - 1) / P.natDegree) * ‖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 any polynomial with complex coefficients, and write for its degree (the natural-number degree; for the zero polynomial this would be , but here it is excluded because is assumed). Write for the formal derivative of and for evaluation at . Let be any complex number such that . The statement asserts that there exists with and
where is computed in the real numbers from (so it lies in for ). Here ranges over all complex numbers; the condition says that is a critical point of . Because and , necessarily , so the denominator is never zero and no division-by-zero convention is involved. The absolute values are the usual modulus on . No hypotheses on the roots of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.