By Lemmas 4 and 5 of Eremenko and Hayman, some monic cubic p∗ maximizes
ℓ and has all its critical points on its lemniscate, so its critical
values have modulus one. A translation and the rotation
p(z)↦e−3iθp(eiθz) preserve monicity and length, so
we may take p∗(z)=z3−3u2z+b with b≤0. Its critical values are
b∓2u3, and ∣b−2u3∣=∣b+2u3∣=1 gives Re(buˉ3)=0
and b2+4∣u∣6=1. If b<0, then u3 is purely imaginary, and a rotation
by a multiple of 2π/3, which fixes b, makes u=±ia with a=∣u∣.
If b=0, an arbitrary rotation achieves the same normalization. Thus
p∗=qa. This is the normalization of the
research sketch. Hence every
monic cubic p has ℓ(p)≤ℓ(p∗)=L(a) for some a, and the
inequality for every cubic follows from the family inequality.
2. The length integral
The lemniscate of qa is P−1(C), where C={s:∣s−c∣=1}. The critical
points of P are ±ia, with critical values s±=±2ia3, and both
lie on C since 4a6+c2=1. Away from these two values, P restricted to
P−1(C) is a three-sheeted covering by analytic arcs, and on each arc
∣dz∣=∣ds∣/∣P′(z)∣. Therefore
L(a)=∫02πGa(c+eiθ)dθ,Ga(s)=P(z)=s∑∣P′(z)∣1,
and the conjugation symmetry Ga(sˉ)=Ga(s) gives
L(a)=2∫0πGa(c+eiθ)dθ. On C the critical values sit
at θ±=π∓β. For a=0 the roots of z3=s give
G0(s)=∣s∣−2/3.
3. Root identities
If P(z)=s, expansion gives
(z2+a2)2(z2+4a2)=z6+6a2z4+9a4z2+4a6=s2+4a6.
Since P′(z)=3(z2+a2), for s=s±,
∣P′(z)∣1=3∣s2+4a6∣1/2∣z2+4a2∣1/2.
Let U be either root of U−a6/U=s and let u1,u2,u3 be the cube roots
of U. Then (u−a2/u)3+3a2(u−a2/u)=u3−a6/u3=s, the roots of P(z)=s
are uj−a2/uj (the other choice of U is −a6/U, whose cube roots are
−a2/uj, giving the same roots), and z2+4a2=(u+a2/u)2. Hence
Ga(s)=3∣s2+4a6∣1/2∑j∣uj+a2/uj∣.(1)
For a>0 put σ=s/a3. Then Ga(s)=a−2G1(σ), where G1 is
(1) with a=1.
4. The comparison with z3−c
Let Φ(c)=∫02π∣c+eiθ∣−2/3dθ, the length of
{∣z3−c∣=1}. For 0≤c<1,
(1+ceiθ)−1/3=∑kbkckeikθ
with bk=(k−1/3), and Parseval gives
Φ(c)=2π∑kbk2c2k, strictly increasing for c>0. To pass to
c=1, use ∣c+eiθ∣2=(1−c)2+c∣1+eiθ∣2 for c≥1/2
and dominated convergence; the limiting singularity has exponent −2/3.
Monotone convergence of the series and the beta integral at c=1 give
Here it suffices that I(a)<0. The circle Γa has center c/a3 and
radius a−3 and passes through ±2i. For a≤13/64 one has
a6⋅502<1 and c/a3>50. Hence the arc of Γa near the origin is
the graph
and every other point of Γa has ∣σ∣≥50. The integrand and the
arc are symmetric under conjugation.
Tail. Let ∣σ∣≥Y>2, let T be the root of T−1/T=σ with
∣T∣≥1, so ∣T∣≥∣σ∣−1, let τ be a cube root of T,
ε=τ−2 and e=∣ε∣=∣T∣−2/3≤(Y−1)−2/3. From
(1) with a=1,
with ω=e2πi/3. The real parts of the three terms of A sum to
three, and ∣1+w∣≤1+Rew+∣w∣2/(2(1−∣w∣)), so
1≤A≤1+e2/(2(1−e)). With (1+e3)−2/3≥1−32e3 and
(1−e3)−2/3≤(1−e3)−1 this gives $|g(\sigma)|\le K|T|^{-2}\le
K(|\sigma|-1)^{-2}$, where
With Y=50 this tail is at most 0.03 in absolute value.
Near arc. For each box a∈[k/64,(k+1)/64], 0≤k≤12, the program
bounds 2∫050g(xa(y)+iy)(1−a6y2)−1/2dy from above, uniformly
for a in the box. On [0,2−10] it uses ∣σ∣≤X+y, with X the
largest ∣xa∣ there, so the subtracted term is at least
3[(X+2−10)1/3−X1/3]. On [2−2−13,2+2−13] it uses
G1(σ)=N1(σ)/(3∣σ−2i∣1/2∣σ+2i∣1/2) with a ball
enclosure of the numerator and ∣σ−2i∣≥∣y−2∣, so that the window
contributes at most the enclosure times 4⋅2−13/2. Elsewhere it sums
the supremum of a ball enclosure of the integrand over each piece times the
piece width. Every box gives I(a)<0; the largest bound is about −0.216.
By (2), L(a)<L0 for 0<a≤13/64.
The first parameter box includes a=0 only as an enclosure of the continuous
formula for xa(y) and its weight. The circle Γa and (2) are used
only for a>0; at a=0 the target equality is exact. The head estimate
integrates the ∣y∣−2/3 singularity rather than evaluating it at zero,
and the window estimate integrates the ∣y−2∣−1/2 singularity. Thus no
positive lower cutoff on a or on distance to either singularity is assumed.
6. Larger parameters: 7/512≤β≤π/2
Here the program bounds L(a)=2∫0πGa(c+eiθ)dθ itself,
uniformly for β in each box, with c=cosβ and a3=sinβ/2.
A window W contains θ+=π−β for every β in the box. On it,
Ga(s)=Na(s)/(3∣s−s+∣1/2∣s−s−∣1/2) by (1), with
∣s−s+∣=2∣sin((θ−θ+)/2)∣≥(2/π)∣θ−θ+∣ and
∫W∣θ−θ+∣−1/2dθ≤22∣W∣; so the window is
bounded by the supremum of Na/(3∣s−s−∣1/2) over W times
(π/2)1/222∣W∣. The point θ−=π+β lies outside
[0,π]. Off the window the program sums piece suprema of ball enclosures
of (1). Starting from 300 equal boxes and bisecting any box whose bound is not
below L0−1/100, it covers [7/512,π/2] by 591 consecutive boxes, each
with L(a)<L0−1/100.
The program checks 0<infW<supW<π and inclusion of every possible
θ+ before accepting a window. It integrates the nonnegative density
up to an upper dyadic enclosure π+≥π for an upper bound. The
parameter cover likewise ends at a dyadic enclosure of π/2 from above,
so it includes c=0 without assuming c>0. The density formula remains
valid in this small extension by taking c=cosβ and
a3=sinβ/2.
7. Coverage and conclusion
The program checks 7/512<arcsin(2(13/64)3), so the two regimes overlap and
together cover 0<a≤2−1/3. Hence L(a)<L0 for every a in that range.
With Section 1, every monic cubic p satisfies ℓ(p)≤L0.
On the nonsingular pieces, every bound in Sections 5 and 6 is a finite sum
of exact piece widths times enclosing endpoints of arb balls. The explicit
head, window and tail estimates bound all omitted pieces. All formulas take
the whole parameter box as their input, so the bound holds at every
parameter in that box, rather than only at sampled values. Stopping an
integration subdivision at its depth limit retains the same certified
rectangle bound; a nonfinite enclosure fails. The adaptive tolerances affect
only sharpness.
The square-root and cube-root choices in (1) cause no loss of coverage:
either quadratic root and any cube root give the same multiset of three
roots of P(z)=s. A fixed branch is enclosed on each input ball; the code
rotates its cut when convenient. No holomorphic integration assumption is
used. As a control, the program also computes a lower bound at β=1/2
using lower ends on the regular pieces, omitting the singular window, and
stopping at a lower dyadic enclosure π−≤π. Nonnegativity makes
these omissions valid. The two bounds are 8.1746≤L≤8.1830.
8. Uniqueness of the maximizer
Let p be a monic cubic of maximal length; then ℓ(p)≥L0. Translate so
that p(z)=z3−3u2z+b.
If u=0, Section 2 with G0(s)=∣s∣−2/3 on the circle ∣s+b∣=1 gives
ℓ(p)=Φ(∣b∣) when ∣b∣≤1 and ℓ(p)=∣b∣−2/3Φ(1/∣b∣) when
∣b∣>1. Since b1=−1/3=0, Φ is strictly increasing, so
ℓ(p)<L0 unless ∣b∣=1.
If u=0, the critical points ±u are simple and the critical values
b∓2u3 are distinct. If both lie on the unit circle T, Section 1
makes p a rotation and translation of q∣u∣, and Sections 5 to 7 give
ℓ(p)<L0, a contradiction. Otherwise use the deformation in the proof of
Eremenko and Hayman's Lemma 5, which applies to every extremal polynomial: for
a critical value v∈/T and an open disc U∋v missing
T and the other critical values, it gives monic polynomials
pλ=ϕλ∘p∘ψλ−1, ∣λ∣<ϵ,
with ϕλ,ψλ homeomorphisms, the critical value v moved
to v+λ, the other critical value fixed, and ℓ(pλ)=ℓ(p).
Each pλ again has two simple critical points.
Let v∈/T be a critical value of p and w the other one.
Choose a simple arc γ from v to a point ζ∈T,
ζ=w, avoiding w and meeting T only at ζ. Such an
arc exists in either component of C∖T, with one
point removed if necessary. The set of t∈γ∖{ζ} for
which some maximizer has critical values t and w contains v and is
relatively open by the deformation.
It is also relatively closed. Center each maximizer by translation, writing
it as z3−3uj2z+bj. If its critical values are tj→t and w, then
bj=(tj+w)/2 and ∣uj∣3=∣w−tj∣/4 are bounded. A subsequence converges
to a monic cubic with critical values t and w, and its length is maximal
by Lemma 4. The connectedness of γ∖{ζ} therefore gives
every t on that arc. The same compactness argument at ζ gives a
maximizer with the two distinct critical values ζ and w.
If w∈/T, repeat with an arc from w to a point of
T∖{ζ} avoiding ζ. This produces a maximizer
with two distinct critical values on T, which the strict family
inequality excludes.
Therefore every maximizer is (z−z0)3−w with ∣w∣=1. Conversely each such
polynomial is a rotation and translation of z3−1 and has length L0.