The dual Smale mean value conjecture, formulated by Dubinin and Sugawa (2009) and independently by Ng, asserts that every complex polynomial normalized by and has a critical point (a zero of ) with , where is the degree. The constant is sharp and is attained when all critical points coalesce at one point. The conjecture is proved for degrees , for conservative polynomials, for odd polynomials of any degree with nonzero linear term (and, more generally, for polynomials invariant under a root-of-unity symmetry), and for polynomials whose critical points lie on a single ray, while the best bound valid for all polynomials, due to Dubinin, is a factor weaker than the conjectured constant. The method that settled , selecting a critical point of minimal modulus, provably fails from degree 8 on. The problem is to prove the conjecture for arbitrary degree — the open core being unrestricted polynomials of degree — or to refute it by an explicit counterexample.
Background
In 1981, Steve Smale, studying the complexity of Newton-type methods for finding roots of complex polynomials, proved a quantitative mean value bound: if is a complex polynomial of degree and is a point with , then among the critical points of — the zeros of the derivative , which number when counted with multiplicity — there is one with . Smale conjectured that the constant 4 can be replaced by ; the polynomial shows no smaller constant can work, and this classical conjecture remains open (Beardon, Minda and Ng (2002) survey the background and partial estimates).
By affine changes of variable the general statement reduces to the class of normalized polynomials with , that is, and . Writing Smale's conjecture reads : some critical point makes the difference quotient from the origin small. The dual problem, formulated by Dubinin and Sugawa (2009) and independently by Ng, asks the reverse question: is there always a critical point where the quotient is large? The conjecture is for every ; equivalently, every has a critical point with . The same translation-and-scaling reduction shows this is equivalent to the invariant form: for every polynomial of degree and every noncritical point there is a critical point with , a lower mean value bound. The constant cannot be improved: for the mono-critical polynomial , , all critical points coalesce at and exactly.
Partial results. Tischler (1989) proved the conjecture for conservative polynomials — those for which takes the same value at all critical points — and established the stronger two-sided bound for ; Tyson (2005) showed this stronger bound fails for , refuting only the strengthening and not the dual conjecture itself. Dubinin and Sugawa (2009) proved the first general bound, of exponential type in , later refined by Ng and Zhang (2016), and Dubinin (2019) obtained the best known universal bound: for every degree- polynomial and every point there is a critical with — still a factor below the conjectured constant. Degree by degree, Hinkkanen, Kayumov and Khammatova proved the conjecture for and (2019) and for (2025). Their method selects a critical point of minimal modulus, scales it to , and uses the integral representation over the critical points , reducing the problem to sharp multivariate trigonometric inequalities on a torus, verified in part by computer algebra. However, the 2019 paper also exhibits an explicit degree-8 polynomial, with critical points and six copies of (all seven of modulus ), for which the critical point gives , while a critical point of the sextuple at gives : the seven critical points tie for minimal modulus, and taking an arbitrary such point can return a value below , so the selection heuristic that settled provably fails as a universal method from degree 8 on. Most recently, Tang (2025) verified the conjecture for all odd polynomials (those with , hence of odd degree) with nonzero linear term, and more generally for polynomials satisfying for a root of unity ; Kayumov and Khammatova (2026) proposed a stronger conjectured inequality and verified it when all critical points lie on a single ray; and Khammatova (2026) proved an analog of the inequality for -symmetric polynomials with critical points. What remains is the general case: unrestricted polynomials of degree , and with it a proof or refutation valid for all degrees.
Problem Statement
Prove or refute the dual Smale mean value conjecture: for every integer and every polynomial with , there exists a critical point (a zero of ) such that Equivalently, for every , where ; or in translation-invariant form, for every complex polynomial of degree and every noncritical point there is a critical point with .
Degrees are already settled, as are the special classes described in the background (conservative polynomials, odd polynomials with nonzero linear term and, more generally, polynomials with root-of-unity symmetry , and polynomials with all critical points on one ray). The open core is unrestricted polynomials of degree . A refutation consists of a single explicit normalized polynomial of some degree for which every critical point satisfies . The equality cases are known for the settled degrees: for , holds only for the mono-critical family , , and the same is expected in general.
References
- S. Smale, The fundamental theorem of algebra and complexity theory, Bull. Amer. Math. Soc. (N.S.) 4 (1981), 1–36. DOI: 10.1090/S0273-0979-1981-14858-8, https://doi.org/10.1090/S0273-0979-1981-14858-8
- D. Tischler, Critical points and values of complex polynomials, J. Complexity 5 (1989), 438–456. DOI: 10.1016/0885-064X(89)90019-8, https://doi.org/10.1016/0885-064X(89)90019-8
- A. F. Beardon, D. Minda, T. W. Ng, Smale's mean value conjecture and the hyperbolic metric, Math. Ann. 322 (2002), no. 4, 623–632. DOI: 10.1007/s002080000184, https://doi.org/10.1007/s002080000184
- T. W. Ng, Smale's mean value conjecture for odd polynomials, J. Aust. Math. Soc. 75 (2003), no. 3, 409–412. DOI: 10.1017/S1446788700008181, https://doi.org/10.1017/S1446788700008181
- J. T. Tyson, Counterexamples to Tischler's strong form of Smale's mean value conjecture, Bull. London Math. Soc. 37 (2005), no. 1, 95–106. DOI: 10.1112/S0024609304003613, https://doi.org/10.1112/S0024609304003613
- V. Dubinin, T. Sugawa, Dual mean value problem for complex polynomials, Proc. Japan Acad. Ser. A Math. Sci. 85 (2009), no. 9, 135–137. DOI: 10.3792/pjaa.85.135, https://doi.org/10.3792/pjaa.85.135
- T. W. Ng, Y. Zhang, Smale's mean value conjecture for finite Blaschke products, J. Anal. 24 (2016), no. 2, 331–345. DOI: 10.1007/s41478-016-0007-4, https://doi.org/10.1007/s41478-016-0007-4
- V. N. Dubinin, On the dual mean-value conjecture for complex polynomials, Math. Notes 106 (2019), no. 1–2, 133–135. DOI: 10.1134/S0001434619070149, https://doi.org/10.1134/S0001434619070149
- A. Hinkkanen, I. R. Kayumov, D. M. Khammatova, Dual Smale's mean value conjecture, Proc. Amer. Math. Soc. 147 (2019), no. 12, 5227–5237. DOI: 10.1090/proc/14639, https://doi.org/10.1090/proc/14639
- A. Hinkkanen, I. R. Kayumov, D. M. Khammatova, Dual Smale's mean value conjecture for n=7, Constr. Approx. 61 (2025), no. 3, 603–613. DOI: 10.1007/s00365-025-09709-4, https://doi.org/10.1007/s00365-025-09709-4; arXiv:2303.17586, https://arxiv.org/abs/2303.17586
- I. R. Kayumov, D. M. Khammatova, On an inequality related to Dual Smale's mean value conjecture, J. Math. Anal. Appl. 556 (2026), no. 1, Article 130108. DOI: 10.1016/j.jmaa.2025.130108, https://doi.org/10.1016/j.jmaa.2025.130108
- Q. Tang, Dual Smale's mean value conjecture for odd polynomials, preprint arXiv:2510.16875 [math.CV] (2025). arXiv: 2510.16875, https://arxiv.org/abs/2510.16875
- D. M. Khammatova, On an inequality for critical values of -symmetric polynomials, Math. Notes 120 (2026), no. 1–2, 366–371. DOI: 10.1134/S0001434626603412, https://doi.org/10.1134/S0001434626603412