WorksMathematics
An explicit counterexample of degree 29440 to Smale's mean value problem with constant one
Abstract
For a complex polynomial p with p(0)=0 and p'(0)=1, let S(p,0) be the minimum of |p(c)/c| over the critical points c of p. Adamczewski and Colbrook recently gave an explicit polynomial of degree 29984 with S(p,0)>1, certified by interval arithmetic, built on the counterexample found by GPT-6 Astra. Within their family of polynomials, with re-chosen coefficients, we give an explicit p in Q(i)[z] of degree 29440 with 1.00000093069254310 < S(p,0) < 1.00000093069254311. Jatar and Ng have shown that Smale's constant sup_p S(p,0) exceeds 1.1018, through polynomials of unspecified degree; the point here is an explicit polynomial with a certified bound. The bound is certified twice: by a ball-arithmetic Krawczyk certificate covering all 29439 critical points, and, independently, by the Adamczewski-Colbrook verifier, which confirms 29418 of them and is inconclusive (insufficient working precision) on the other 21. The exact coefficients and both verification programs are provided as ancillary files.
Introduction
Let be a complex polynomial of degree and with . Smale [5] proved that
and asked whether the constant 4 can be replaced by 1, or even by . The constant-one version was disproved by GPT-6 Astra, with a formal Lean 4 proof [1]. Adamczewski and Colbrook [2] explained the underlying mechanism and gave an explicit polynomial of degree 29 984 with , certified by interval arithmetic [3]. Independently, Jatar and Ng [4] reduced the determination of Smale’s mean value constant , the supremum over normalized polynomials, to an extremal problem for admissible pairs of a univalent function and a finite Blaschke product, and showed that ; their polynomials come from an approximation argument, and no explicit degree is given. Thus the value 1.00000093 . . . below is not a bound on ; what is new here is only the degree of an explicit, certified example.
This note records a smaller explicit counterexample. It uses the same construction as [2 Appendix A]: the same lemniscate coordinate, model anchor, Blaschke parameter, correction centres and correction structure. Only the truncation level , the size of the high-degree tail and the coefficient tables are changed. The reduction in degree is modest (about 1.8%); no new mechanism is claimed.
The polynomial
We keep the notation of [2 Appendix A]: , , , , the model anchor , the Blaschke parameter and the truncated model of [2 (A.5)]. We take
and set
with the correction polynomial of [2] (its 1024 coefficients re-chosen), rational with exactly, rational , and a rational base point . The normalized polynomial is
All data are exact elements of or and are listed in the ancillary file polynomial_N1840.json, which follows the format of [3] (field defining formula). In particular .
Only reaches degree ; all other terms have degree at most 29 439, and the leading coefficient is nonzero. Hence , and , by construction.
Theorem 1. The polynomial above has degree 29 440, its 29 439 critical points are simple, and
In particular is a counterexample to Smale’s mean value conjecture with constant one.
Remark 2. Adamczewski and Colbrook note [2 §1.1] that perturbations of an explicit counterexample, together with Rouché’s theorem, give counterexamples in every larger degree. Applied to , the same argument would give counterexamples in every degree ; we do not repeat it here, and Theorem 1 only concerns degree 29 440.
Verification
Since is unchanged by the affine normalization, it suffices to work with and : with
Certificate 1 (ball arithmetic)
Certificate 1 (ball arithmetic). Arithmetic is done with complex balls (Arb, via python-flint) at 1280 bits, starting from the exact rationals of the specification. For each of 29 439 approximate critical points:
three Newton steps for give a centre ;
on the square box of half-side about , an enclosure of is obtained from and a Cauchy bound , where is a rigorous majorant of on the disc of radius about (term-by-term triangle inequality);
the Krawczyk operator is shown to lie in the interior of , which proves that contains exactly one zero of , and that it is simple;
(4) is bounded below on all of by a second-order Taylor enclosure of with the same remainder bound, and a point counts as certified only if this lower bound exceeds 1. All 29 439 points pass. The boxes have half-side at most , the refined centres differ from the supplied ones by at most , and any two supplied centres are at distance at least ; hence the boxes are pairwise disjoint. They thus contain 29 439 distinct zeros of , i.e. all critical points, each simple. The smallest certified value is
attained in a single box, which also gives the upper bound of Theorem 1.
Certificate 2 (Adamczewski–Colbrook verifier)
Certificate 2 (Adamczewski–Colbrook verifier). The program verify.cpp of [3] (outward-rounded interval bounds with MPFR-directed endpoints, Rouché test on critical disks) was recompiled with N_PARAM=1840, TAIL_BLOCKS_PARAM=48, the expected parameters in make_parameters.py being read from the specification; the specification passes all its exact-rational consistency checks. Run disk by disk on the 29 439 critical disks, it certifies on 29 418 of them, with smallest lower bound 1.000000930692128, on the same critical point as Certificate 1. On the remaining 21 disks (indices, in the order of critical_disks_N1840.csv, listed in the ancillary summary) its fixed working precision does not suffice to conclude; these are covered by Certificate 1 only.
| [2] | this note | |
| 1874 | 1840 | |
| degree | 29 984 | 29 440 |
| tail blocks | 8 | 48 |
| certified lower bound for | 1.00000049595801 | 1.00000093069254310 |
Table 2.
Ancillary files
polynomial_N1840.json: exact specification ( and data).centres_N1840.csv: the 29 439 supplied critical-point centres, sorted by increasing .verify_ball_N1840.py: Certificate 1 for any range of critical points (Python withpython-flintandnumpy).certificate_N1840.log: summary of both certificates.critical_disks_N1840.csv,make_parameters_N1840.py: input disks and the modified parameter script used to run the verifier of [3] (Apache License 2.0).
Status and acknowledgements
Theorem 1 is a computer-assisted result: its proof is the pair of certificates above, which anyone can rerun from the ancillary files. The construction is entirely that of Adamczewski and Colbrook [2], building on the counterexample found by GPT-6 Astra [1]; only parameters were changed. The computations were carried out with the assistance of Claude (Anthropic).
References
Meaux, France
Email address: [email protected]
References
- [1]T. Adamczewski, Mean-value-problem: Lean 4 disproof of Smale’s mean value conjecture (K = 1), GitHub repository, 2026.
- [2]T. Adamczewski and M. J. Colbrook, From boundary geometry to counterexamples in Smale’s mean value problem, arXiv:2610.36158, 2026.arxiv.org/abs/2610.36158
- [3]M. J. Colbrook, Interval_arithmetic_counterexample_Smale_mean_value, GitHub repository, 2026.
- [4]A. Jatar and T. W. Ng, Smale’s mean value constant and admissible univalent Blaschke pairs, arXiv:2610.21472, 2026.arxiv.org/abs/2610.21472
- [5]S. Smale, The fundamental theorem of algebra and complexity theory, Bull. Amer. Math. Soc. (N.S.) 4 (1981), 1–36.