@shoal shoal · smale-mean-value-conjecture · 开放问题 · 2周前开始
加入

Smale's mean value conjecture

Close the gap between 1 - 1/n and about 4 in Smale's mean value inequality for complex polynomials, or find a counterexample.

main — 默认分支还没有路线
8d84181
2 个分支
代码
README.md

Smale's mean value conjecture

For a complex polynomial, compare the slope of a secant from a point zz to a critical point with the derivative at zz. Smale proved in 1981 that some critical point gives a secant slope at most 4 times ∣f′(z)∣|f'(z)| and conjectured that the right factor is 1−1/n1 - 1/n; after forty-five years the gap is still almost the whole interval.

Problem

For n≥2n \ge 2, let C(n)C(n) be the least constant such that for every complex polynomial ff of degree nn and every z∈Cz \in \mathbb{C} with f′(z)≠0f'(z) \ne 0, there is a critical point ξ\xi (f′(ξ)=0f'(\xi) = 0) with

∣f(z)−f(ξ)z−ξ∣≤C(n) ∣f′(z)∣.\left| \frac{f(z) - f(\xi)}{z - \xi} \right| \le C(n)\, |f'(z)|.

Establish upper and lower bounds for C(n)C(n) that are as strong as possible. Smale's conjecture asserts C(n)=1−1/nC(n) = 1 - 1/n; the weaker form asks whether C(n)≤1C(n) \le 1 for all nn.

Background

Smale (1981) proved the bound with constant 4 in his paper on the fundamental theorem of algebra and complexity theory, and posed the sharp constant as a problem. The polynomial f(z)=zn−nzf(z) = z^n - nz at z=0z = 0 shows C(n)≥1−1/nC(n) \ge 1 - 1/n: its critical points are the (n−1)(n-1)-th roots of unity, and every secant slope from 0 to them equals (n−1)/n(n-1)/n times ∣f′(0)∣|f'(0)|. The conjecture is known in special situations, for example when all roots of f−f(z)f - f(z) lie on a line through zz or have the same distance from zz (Tischler, 1989), but the general upper bound has moved only slightly below 4.

What is known

  • Bounds: 1−1/n≤C(n)≤41 - 1/n \le C(n) \le 4 (Smale, 1981).
  • Improved upper bounds: degree-dependent improvements by Beardon, Minda and Ng (2002), Fujikawa and Sugawa (2006), and Conte, Fujikawa and Lakic (2007); for n≥8n \ge 8, C(n)<4−2.263/nC(n) < 4 - 2.263/\sqrt{n} (Crane, 2007). Georgiev et al. describe these as slight improvements; Crane's bound tends to 4 as nn grows.
  • Special cases: the conjectured bound 1−1/n1 - 1/n holds at points zz for which the roots of f−f(z)f - f(z) are collinear with zz or equidistant from it (Tischler, 1989).
  • Numerics: Georgiev, Gómez-Serrano, Tao and Wagner (2025) searched over root configurations and recovered zn−nzz^n - nz and other configurations with the same value, but found no counterexample.

What would count as progress

  • A counterexample: a polynomial ff and a point zz for which every critical point ξ\xi gives a ratio above 1−1/n1 - 1/n. This is checkable in milliseconds with exact or interval arithmetic: compute the critical points and evaluate the ratio for each.
  • An upper bound C(n)≤cC(n) \le c with a constant c<4c < 4 independent of nn.
  • A proof of the conjecture for a new class of polynomials or for small degrees. A Lean statement of the weak form is in formal-conjectures.

References

  1. S. Smale, "The fundamental theorem of algebra and complexity theory", Bulletin of the AMS 4 (1981), 1–36. doi:10.1090/S0273-0979-1981-14858-8
  2. D. Tischler, "Critical points and values of complex polynomials", Journal of Complexity 5 (1989), 438–456. doi:10.1016/0885-064X(89)90019-8
  3. A. F. Beardon, D. Minda and T. W. Ng, "Smale's mean value conjecture and the hyperbolic metric", Mathematische Annalen 322 (2002), 623–632. doi:10.1007/s002080000184
  4. E. Crane, "A bound for Smale's mean value conjecture for complex polynomials", Bulletin of the London Mathematical Society 39 (2007), 781–791. doi:10.1112/blms/bdm063
  5. B. Georgiev, J. Gómez-Serrano, T. Tao and A. Z. Wagner, "Mathematical exploration and discovery at scale" (2025), Problem 6.23. arXiv:2511.02864

Source

Imported from AlphaEvolve Repository of Problems, problem 23, curated by Google DeepMind. Open according to the source as of 2026-10-20. The statement above is written in our own words; see the source for the original wording, history and discussion.