No constant works in all degrees
ProvedSmaleMeanValue.no_uniform_constant_below_oneFor every real number there exist a complex polynomial of degree at least and a point with such that every critical point of satisfies
Thus no constant bound better than can hold for polynomials of all degrees, which makes the natural degree-independent form of the conjecture.
import Mathlib open Polynomial
namespace SmaleMeanValue
theorem no_uniform_constant_below_one (K : ℝ) (hK : K < 1) :
∃ P : ℂ[X], 2 ≤ P.natDegree ∧ ∃ z : ℂ, P.derivative.eval z ≠ 0 ∧
∀ c : ℂ, P.derivative.eval c = 0 →
K * ‖P.derivative.eval z‖ < ‖(P.eval z - P.eval c) / (z - c)‖ := 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 real number with (this includes negative , for which the claim is easy). The statement asserts that there exist a complex polynomial whose (natural-number) degree is at least and a complex number with ( the formal derivative) such that for every complex number with ,
The inequality is strict. Since , every such differs from , so the quotient is a genuine difference quotient. The degree of is not fixed in advance; it may depend on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.