Introduction
Two points in the open unit disc are less than 2 apart. The extra condition in the
following question is that the whole connecting curve stay where a given
polynomial has modulus less than 1.
For a monic polynomial 𝑓, write
Ω𝑓={𝑧:|𝑓(𝑧)|<1},𝐾𝑡(𝑓)={𝑧:|𝑓(𝑧)|≤𝑡}.
Erdős, Herzog and Piranian [2] asked whether two zeros in
the open unit disc could always be connected by a short curve in Ω𝑓. Their question is listed as
Problem 1041 in Bloom’s catalogue [1].
Problem 1.1 (Erdős #1041). Let 𝑓(𝑧) =∏𝑛𝑖=1(𝑧 −𝑧𝑖) be monic with
𝑛 ≥2 and all 𝑧𝑖 in the open unit disc. Must two root
occurrences be joined by a curve of length less than 2 inside {|𝑓| <1}?
A repeated root allows a constant curve between two occurrences, so
we consider distinct zeros. Pendyala [4] proved the degree-four case using a
close-pair chord or radial segments through the centre of a smallest
enclosing disc. In degree seven the answer is negative. The example was
constructed by the erdosproblems.com contributor ani.
Theorem 1.2 (ani’s degree-seven example).
The monic polynomial 𝑓 in
(2) has seven distinct
zeros in the open unit disc. Every connected set 𝐾 ⊂Ω𝑓 containing two of its
zeros satisfies H1(𝐾) >2.
Here H1 is
one-dimensional Hausdorff measure. A rectifiable path image has measure
at most its total variation, so the theorem excludes short paths as well
as more general connected sets.
Five components of Ω𝑓
contain one zero each; the sixth contains two and is the only possible
place to join a pair. On this component, 𝑓 has degree two. Cut the value disc from
its critical value to the unit circle. Inside the two-root component,
the whole slit preimage lies in a small disc about the critical
point. Connectedness forces a root-joining set to approach this disc on
both inverse sheets. The two radial projections then give a lower bound:
the sum of the root distances from the critical point, minus twice the
small disc’s radius. For the chosen pair this bound exceeds 2.
Section 2
contrasts the quadratic with the counterexample; Section 3 treats trinomials and
the obstruction introduced by a fourth term. Section 6.1 separates
root proximity from containment. Sections 4 and 5 construct paths by
component growth and continuation around an isolated critical value,
respectively. These independent analytic arguments remain unformalised.
The companion
paper gives their proofs, the counterexample’s rational data, and
the arguments behind the later estimates and questions.
A component with a narrow bottleneck
A quadratic model
Consider 𝑝(𝑧) =𝑧2 −𝑟2 with 0 <𝑟 <1. Its critical point is 0, its critical value is −𝑟2, and the outward slit in the value
disc is 𝐽 =( −1, −𝑟2]. We can compute
its preimage without choosing a branch:
𝑝−1(𝐽)={𝑖𝑦:|𝑦|<√1−𝑟2}.
This vertical interval separates the two inverse sheets containing 𝑟 and −𝑟. It shrinks to the critical point as
𝑟 ↑1. Yet the horizontal
segment [ −𝑟,𝑟] stays in {|𝑝| <1} and has length 2𝑟 <2. A narrow neck alone therefore
does not give the desired counterexample. For the radial-distance
estimate below to exceed 2, the two
root distances from the critical point must themselves have sum greater
than 2.
A length estimate for a double cover
The degree on a component counts preimages in that
component, with multiplicity; it equals the number of zeros there,
not necessarily the degree of the polynomial [8]. Near a simple critical point 𝑐, write 𝑝(𝑐 +𝑧) −𝑝(𝑐) =𝑧2𝐴(𝑧). The quadratic model
suggests a spatial scale √𝛿/𝑀: the value slit has
length 𝛿 =1 −|𝑝(𝑐)|, while 𝑀 =|𝐴(0)| =|𝑝″(𝑐)|/2 converts
squared distance into value distance. The next lemma controls this
comparison on a disc of radius ℎ.
Degree two serves a different purpose. It ensures that the two local
preimages near 𝑐 exhaust every
fibre in the chosen component, so a connection cannot pass through an
unexamined part of the slit preimage.
Lemma 2.1. Let 𝑝 be a polynomial and 𝑈 a component of {|𝑝| <1} on which 𝑝 has degree two, with one simple
critical point 𝑐 and 𝑣 =𝑝(𝑐) ≠0. Write 𝑝(𝑐 +𝑧) −𝑣 =𝑧2𝐴(𝑧) and put 𝑀 =|𝐴(0)|, 𝛿 =1 −|𝑣|. Let ℎ >0. If |𝐴(𝑧)/𝐴(0) −1| ≤1/4 for |𝑧| ≤ℎ and 𝛿 <𝑀ℎ2/4, then every connected
subset 𝐾 of 𝑈 containing its two roots 𝑎,𝑏 satisfies
H1(𝐾)≥|𝑎−𝑐|+|𝑏−𝑐|−83√𝛿/𝑀.
Proof. Cut the value disc along 𝐽 ={𝑡𝑣 :1 ≤𝑡 <1/|𝑣|}. The slit avoids
0 and removes the only critical
value of 𝑝|𝑈. Over its simply
connected complement, the double cover splits into two inverse sheets
𝑈1,𝑈2, containing 𝑎,𝑏 respectively.
The sheet boundaries inside 𝑈
lie over the slit. To confine them, put 𝑟0 =(4/3)√𝛿/𝑀 <2ℎ/3. The
relative-error hypothesis makes 𝐴
nonvanishing on this disc, and on |𝑧| =𝑟0 gives
|𝑝(𝑐+𝑧)−𝑣|≥34𝑀𝑟20=43𝛿>𝛿.
Every value on 𝐽 is less than 𝛿 from 𝑣. Rouché’s theorem compares its
preimages with the double zero of 𝑝 −𝑣 and gives exactly two in 𝐵(𝑐,𝑟0), counted with multiplicity. As
the value moves from 𝑣 along 𝐽, these preimages continue from 𝑐 without crossing the circle. Their
values stay in the unit disc, so they remain in 𝑈. The degree-two hypothesis now
identifies these local preimages with the entire fibre in 𝑈. Thus
𝑝−1(𝐽)∩𝑈⊂𝐵(𝑐,𝑟0).
It remains to count how much of 𝐾 lies on each sheet. For 𝑟0 <𝑡 <|𝑎 −𝑐|, suppose 𝐾 ∩𝑈1 missed the circle |𝑧 −𝑐| =𝑡. Then 𝐾 ∩𝑈1 ∩{|𝑧 −𝑐| >𝑡} would be both
open and closed in 𝐾: the boundary
of 𝑈1 inside 𝑈 lies in 𝐵(𝑐,𝑟0), and the remaining boundary is
on the missing circle. This set contains 𝑎 and excludes 𝑏, contradicting connectedness. Hence the
radial image of 𝐾 ∩𝑈1 contains
(𝑟0,|𝑎 −𝑐|) whenever this interval
is nonempty. The map 𝑧 ↦|𝑧 −𝑐|
is 1-Lipschitz, and therefore
H1(𝐾∩𝑈1)≥(|𝑎−𝑐|−𝑟0)+.
Here 𝑥+ =max(𝑥,0). The same
argument on 𝑈2 gives the
contribution from 𝑏. The radial
intervals may overlap on the real line; it is the disjointness of the
sheets in the plane that permits addition. Hausdorff outer
measure adds across disjoint open sets, without a measurability
assumption on 𝐾, so
H1(𝐾)≥(|𝑎−𝑐|−𝑟0)++(|𝑏−𝑐|−𝑟0)+≥|𝑎−𝑐|+|𝑏−𝑐|−2𝑟0.
This is the required bound. No parametrisation of
𝐾 has been used. ◻
This figure is drawn in the PDF.
The polynomial
Starting from 𝑧7 −1, we put the
roots on |𝑧| =𝜌 <1 and split
the multiple critical point at scale 𝜀. The linear, quadratic and
cubic perturbations below all have order 𝜀7 at 𝑧 =𝜀𝑤, so they alter the
critical geometry without comparable root displacement. We must identify
the only component containing a pair and make its distance surplus
exceed the loss in Lemma 2.1. The fixed
coefficients are those of ani’s construction. Put 𝑠 =10−6, 𝜀 =𝑠2 =10−12 and 𝜌 =1 −𝑠16, and let
𝐴=−3295071600,𝐵=551827800,𝐶=−2301381332000,𝑎=𝐴−𝑖𝑠,𝑏=𝑖𝐵+95𝑠,𝑐0=−𝐶−16225𝑖𝑠.
Define
𝐹(𝑧)=𝑧7−1+𝜀4(𝑎𝑧3−¯𝑎𝑧4)+𝜀5(𝑏𝑧2−¯𝑏𝑧5)+𝜀6(𝑐0𝑧−¯𝑐0𝑧6),𝑓(𝑧)=𝜌7𝐹(𝑧/𝜌).(1)(2)
Putting the roots on a circle.
By 𝐹(𝑧) = −𝑧7―――――𝐹(1/¯𝑧), the Cayley substitution 𝑧 =(1 +𝑖𝑥)/(1 −𝑖𝑥) gives a real polynomial
after clearing the denominator and removing a constant phase. Symmetry
alone does not locate the zeros: the decisive step is seven sign changes
on disjoint rational intervals. The map parametrises the unit circle
except −1, so these give seven
distinct circle zeros 𝜁𝑗,
exhausting the degree. Thus −1 is
not a zero and 𝑏𝑗 =𝜌𝜁𝑗
satisfies |𝑏𝑗| =𝜌 <1. The
distance estimate below absorbs the contraction 1 −𝜌 =𝜀8.
Resolving the critical points.
At the smaller scale 𝑧 =𝜌𝜀𝑤, write
𝐹(𝜀𝑤)=−1+𝜀7𝑄(𝑤),𝑄(𝑤)=𝑐0𝑤+𝑏𝑤2+𝑎𝑤3−𝜀¯𝑎𝑤4−𝜀3¯𝑏𝑤5−𝜀5¯𝑐0𝑤6+𝑤7.
Rouché estimates on six disjoint rational discs
locate the six zeros of 𝑄′.
Exactly one, 𝑤𝑠, corresponds to a
critical value of modulus less than one. It satisfies
|𝑤𝑠−(0.0000000039+0.8232474662𝑖)|<10−6.
Let 𝑐𝑠 =𝜌𝜀𝑤𝑠, 𝑣 =𝑓(𝑐𝑠), 𝛿 =1 −|𝑣|, and write 𝑓(𝑐𝑠 +𝑧) −𝑣 =𝑧2𝐴𝑠(𝑧). Since |𝜁𝑗| =1,
|𝑏𝑗−𝑐𝑠|=𝜌|𝜁𝑗−𝜀𝑤𝑠|≥𝜌(1−𝜀Re(𝑤𝑠¯𝜁𝑗)).
The negative projection sum for 𝜁3,𝜁6 gives a positive distance
surplus of order 𝜀; the
contraction has only order 𝜀8. The exact bounds at the
fixed parameter are:
𝑀:=|𝐴𝑠(0)|>180𝜌5𝜀5,𝛿<365⋅106𝜌7𝜀7,|𝐴𝑠(𝑧)/𝐴𝑠(0)−1|<14(|𝑧|≤𝜌𝜀10),|𝑏3−𝑐𝑠|+|𝑏6−𝑐𝑠|>𝜌(2+1431000𝜀).(3)(4)
The subscripts 3,6 refer to Cayley roots in the
intervals (43812,43813)/104 and
( −4816, −4815)/104. The Taylor
bound gives the lemma’s quadratic control, while the bounds on 𝑀 and 𝛿 give √𝛿/𝑀 <𝜌𝜀/5000.
Thus the slit loss is smaller than the displayed distance surplus. This
comparison matters only if the selected roots share a component; the
following paths establish that membership, not a short connection.
Identifying the two roots in the component.
In the 𝑤-plane, polygonal arcs
connect a small disc about 𝑤𝑠 to
points near 8𝜁3 and 8𝜁6. Short joining segments then
reach those exact root directions, and radial segments continue to the
roots. For the four inner polygonal segments we use
1−|𝑓(𝜌𝜀𝑤)|2≥2𝜌14𝜀7(7𝜀+Re𝑄(𝑤)−12𝜀7|𝑄(𝑤)|2).
This follows by expanding the square and using 1 −𝜌14 ≥14𝜌14𝜀8.
On each segment, the expression in parentheses is a polynomial of degree
at most fourteen in the segment parameter. All fifteen coefficients in
its degree-fourteen Bernstein basis are positive. The basis polynomials
are nonnegative and sum to one, so the expression is positive along the
whole segment, which therefore stays inside {|𝑓| <1} after scaling. The companion
bounds 𝑄 directly on the short
joining segments. For the radial portions we use the root identity
𝐹(𝑡𝜁)=𝑡7−1+6∑𝑘=1𝜀7−𝑘𝑞𝑘𝜁𝑘(𝑡𝑘−𝑡7),𝑄(𝑤)=7∑𝑘=1𝑞𝑘𝑤𝑘,
which gives |𝐹(𝑡𝜁)| <1 for 8𝜀 ≤𝑡 ≤1. All rational
intervals, vertices and coefficient tests are specified in the
companion’s finite verification. At the regular level |𝑓| =1, the component-wise Riemann–Hurwitz
calculation [8] gives
𝑘 −1 critical points in a component
with 𝑘 zeros, counted with
multiplicity. Since 𝑐𝑠 is the only
critical point in Ω𝑓, its
component contains exactly the two roots just reached; every other
component contains one.
Proof of Theorem 1.2.
Apply Lemma 2.1 to the
component containing 𝑏3,𝑏6, with
ℎ =𝜌𝜀/10 >0. The
finite estimates give √𝛿/𝑀 <𝜌𝜀/5000
and 𝛿 <𝑀ℎ2/4. Every
connected set in that component containing the two zeros therefore has
measure greater than
𝜌(2+(1431000−815000)𝜀)>2.
All other
components contain one zero. A connected set containing two zeros must
lie in the component just considered, which proves the theorem. ◻
The choice 𝑠 =10−6 is fixed
throughout. Extending these estimates to the small-parameter family
reported by ani remains unproved here. The argument
estimates the measure of the connected set itself; a bound for the total
variation of a chosen parametrisation would not suffice.
Trinomials and radial segments
If 𝑓(𝑧) =𝑧𝑛 +𝑏 has a zero 𝜁 in the open unit disc, then |𝑏| =|𝜁|𝑛 <1. The identity 𝑓(𝑡𝜁) =𝑏(1 −𝑡𝑛), 0 ≤𝑡 ≤1, keeps the whole segment [0,𝜁] in the lemniscate. The same
cancellation survives a middle monomial. Its coefficient may be large,
so we use 𝑓(𝜁) =0 to eliminate
that term before taking absolute values. The remaining
quantities are 𝑏 and −𝜁𝑛, both of modulus less than
one.
Theorem 3.1 (all-degree monic trinomials). Let
1 ≤𝑚 <𝑛 and
𝑓(𝑧)=𝑧𝑛+𝑎𝑧𝑚+𝑏,
with every zero in the
open unit disc. For any zero 𝜁,
the entire segment [0,𝜁] lies
in {|𝑓| <1}. Distinct zeros
𝜁1,𝜁2 are therefore
joined by the broken line 𝜁1 →0 →𝜁2 of length ‖𝜁1‖ +‖𝜁2‖ <2 inside the
open unit lemniscate.
Proof. Fix a zero 𝜁. Eliminating 𝑎𝜁𝑚 with the root equation gives
𝑓(𝑡𝜁)=(1−𝑡𝑚)𝑏+(𝑡𝑚−𝑡𝑛)(−𝜁𝑛).
Vieta’s formula gives |𝑏| <1. For
0 ≤𝑡 <1, the two weights are
nonnegative, the first is positive, and their sum is 1 −𝑡𝑛. Hence
|𝑓(𝑡𝜁)|≤|𝑏|(1−𝑡𝑚)+|𝜁|𝑛(𝑡𝑚−𝑡𝑛)<1−𝑡𝑛≤1.
At 𝑡 =1 the value is zero. We join any two
distinct zeros by concatenating their segments through the origin. ◻
Abel summation identifies exactly what this argument needs. For 𝑓(𝑧) =∑𝑛𝑘=0𝑎𝑘𝑧𝑘 and a zero 𝜁, put 𝑆𝑗 =∑𝑗𝑘=0𝑎𝑘𝜁𝑘. Since 𝑆𝑛 =0, summation by parts gives
𝑓(𝑡𝜁)=𝑛−1∑𝑗=0(𝑡𝑗−𝑡𝑗+1)𝑆𝑗.
For 0 ≤𝑡 <1, the weights are
nonnegative and sum to 1 −𝑡𝑛. Thus
𝑓(𝑡𝜁)/(1 −𝑡𝑛) is a convex
combination of the 𝑆𝑗. For a
trinomial, 𝑆𝑗 =𝑏 before the middle
term and 𝑆𝑗 = −𝜁𝑛 after it.
Thus every partial sum lies in the unit disc. A fourth term introduces
another partial sum for which root locations alone need not give that
bound, as the next example shows. The conclusion concerns segments
ending at zeros, not star-shapedness of the whole lemniscate.
Proposition 3.2 (failure of a prescribed radial
segment). There exist 𝑟 ∈(0,1) for which every zero of
𝑓𝑟(𝑧)=𝑧6+15𝑟2𝑧4−15𝑟4𝑧2−𝑟6
lies in the open unit disc, yet the radial segment from
the origin to the zero 𝑟 leaves
{|𝑓𝑟| <1}.
Proof. We substitute 𝑧 =𝑟𝑤 and factor the polynomial as 𝑟6(𝑤2 −1)(𝑤4 +65𝑤2 +1). The
quadratic in 𝑤2 has conjugate
roots of product one, so all six original zeros have modulus 𝑟. At the midpoint of that segment, 𝑓𝑟(𝑟/2) = −(327/320)𝑟6; choosing 320/327 <𝑟6 <1 proves the
assertion. ◻
This failure concerns the prescribed segment only. In Section 6.2 we use the
partial-sum identity again, first for power substitutions in a cubic and
then for a quintic whose two missing coefficients select a suitable pair
of segments.
A small least critical value
A small critical value leaves a long interval of levels before the
unit lemniscate is reached. For a squarefree polynomial, put 𝜇 =min𝑓′(𝑐)=0|𝑓(𝑐)| >0 and
follow a component from its first merger at level 𝜇 to level 1. If no two roots admit a connection
shorter than 2, conformal length
estimates force them far apart in the component’s hyperbolic metric.
Packing then bounds the root count from below; inverse-ray averaging
turns that count into a lower bound for area growth. When log(1/𝜇) is large enough, this growth
contradicts Pólya’s area bound.
The companion proves the analytic reduction and gives the rational
comparison. The resulting criterion needs no restriction on root
locations, but its analytic proof has not been formalised.
Scaling implication. For 𝑛 ≥3, apply the preceding assertion to
𝑔(𝑧) =𝑠−𝑛𝑓(𝑠𝑧), where 𝑠 =((25/13)𝜇)1/𝑛. Its least
critical-value modulus is 13/25,
and rescaling its connection gives the first bound. The estimate 2(25/13)1/𝑛 <5/2 holds for 𝑛 ≥3. For 𝑛 =2, write 𝑓(𝑧) =(𝑧 −ℎ)2 −𝑑2 and use the root
segment, of length 2|𝑑| =2√𝜇,
contained in 𝐾𝜇(𝑓). ◻
The analytic argument
Assume that no pair has a connection of length less than 2 in Ω𝑓. At a regular level 𝑡 ∈(𝜇,1), let 𝐶𝑡 contain a chosen first merger and let
𝑘 ≥2 be its root count. Put 𝑎 =Area(𝐶𝑡)/𝜋 and 𝑥 =log(𝑡/𝜇); Pólya’s inequality gives
𝑎 ≤1 [7]. Uniformise 𝐶𝑡 by the disc, with 𝑑(0,𝑠) =2artanh𝑠 for 0 ≤𝑠 <1. For roots at hyperbolic
distance 𝑑, choose 𝜑 :𝔻 →𝐶𝑡 sending ±𝑠 to them. Then 𝑑 =4artanh𝑠 and ∫𝔻|𝜑′|2 𝑑𝐴 =𝜋𝑎. Cauchy–Schwarz with the Bergman kernel gives
length(𝜑([−𝑠,𝑠]))2≤𝑎∫𝑠−𝑠∫𝑠−𝑠𝑑𝑢𝑑𝑣(1−𝑢𝑣)2=2𝑎logcosh(𝑑/2).
Thus pairwise root distances are at least
𝐷, where cosh(𝐷/2) =𝑒2/𝑎.
To control the distances from the centre as well, choose a point
ℎ on a connected set through the
first pair in 𝐾𝜇(𝑓) whose
intrinsic distance from every root is at least 1. Here intrinsic distance means the
infimum of Euclidean curve lengths in 𝐶𝑡. Such an ℎ exists: the intrinsic open unit balls
about distinct roots are disjoint, since an intersection would give a
path shorter than 2, and disjoint
open sets cannot cover a connected set containing two roots. Choose the
uniformisation to send 0 to ℎ. If 𝑑𝑗 are the resulting hyperbolic root
distances from 0, then
𝜆(𝑑𝑗)≤12𝛿(𝑎),∑𝑗𝜆(𝑑𝑗)≥𝑥,𝜆(𝑑)=−logtanh(𝑑/2),𝛿(𝑎)=−log(1−𝑒−1/𝑎).
The one-root Bergman estimate
gives the first bound because every root has intrinsic distance at least
1 from ℎ. For the second, the component-wise
Blaschke representation [8] expresses 𝑓/𝑡 in disc coordinates. Since ℎ is not a root and lies in 𝐾𝜇(𝑓), evaluation at 0 gives ∑𝑗𝜆(𝑑𝑗) =log(𝑡/|𝑓(ℎ)|) ≥𝑥.
Dividing the required sum 𝑥 by the
maximum contribution 𝛿(𝑎)/2
gives 𝑘 ≥2𝑥/𝛿(𝑎). This uses
only distances from the centre. To exploit the pairwise separation too,
we intersect the disjoint hyperbolic balls about the roots with a common
circle. The passage through a first merger, including simultaneous
mergers, is part of the analytic input still to be formalised.
On a fixed hyperbolic circle of radius 𝑟 >0 centred at 0, the balls of radius 𝐷/2 cut out disjoint arcs. Their angular
half-widths satisfy
𝑤(𝑑,𝑟)=arccos(clamp[−1,1]cosh𝑑cosh𝑟−cosh(𝐷/2)sinh𝑑sinh𝑟),∑𝑗𝑤(𝑑𝑗,𝑟)≤𝜋.
Here clamp[−1,1] truncates
to [ −1,1]. This circle-slice
inequality is formalised separately. To turn it into a root count,
majorise the contribution of one root by weighted slice widths: choose
𝜎𝑖 ≥0, 𝑟𝑖 >0 and 𝑈 >0 such that 𝜆(𝑑) ≤𝑈 +∑𝑖𝜎𝑖𝑤(𝑑,𝑟𝑖)
whenever 𝑑 >0 and 𝜆(𝑑) ≤𝛿(𝑎)/2. Summing at the
roots and using the angular bound at each 𝑟𝑖 gives
𝑘≥𝑥−𝜋∑𝑖𝜎𝑖𝑈.(5)
The circle must be fixed before taking these
intersections: angular projections of disjoint balls at different
distances can overlap.
We now convert the root count into area growth. Lift one common value
radius from all 𝑘 roots to 𝜕𝐶𝑡 and join successive
endpoints by boundary arcs. All pieces stay in Ω𝑓 because 𝑡 <1. Splitting the lift integral at
level 𝜇 bounds the mean total
lift length by √𝑘𝑎(𝑥+2)/2.
Each of the 𝑘 resulting
root-to-root connections has length at least 2; their sum counts each lift twice and
the boundary once. Hence 2𝑘 ≤√2𝑘𝑎(𝑥+2) +H1(𝜕𝐶𝑡). Combining this with H1(𝜕𝐶𝑡)2 ≤2𝜋𝑘𝑡 (𝑑/𝑑𝑡)Area(𝐶𝑡)
yields the ordinary differential inequality
𝑎′(𝑥)≥12𝜋2[2√𝑘−√2𝑎(𝑥)(𝑥+2)]2+.(6)
Here the derivative is with respect to 𝑥, between merger levels. The companion
proves the lift estimate and accounts for the nonnegative area jumps at
mergers; those jumps do not weaken the lower bound.
The recorded rational comparison
At each level use the largest integer lower bound for the current
root count 𝑘: (5), 𝑘 ≥2𝑥/𝛿(𝑎), or the companion’s two
further packing estimates. The starting bound 𝑎(3/105) >10−6 follows by
integrating (6) with 𝑘 ≥2 and 𝑎 ≤1; it is not an extra assumption on
the polynomial. The recorded rational calculation then reaches 𝑎 >1 by
𝑋=6357628895991012.
It used
18 area levels, 126 certified weighted inequalities and a
maximum step 1/400. On each
interval [𝑢,𝑣] of possible root
distances, the calculation bounds 𝜆(𝑑) −∑𝑖𝜎𝑖𝑤(𝑑,𝑟𝑖) by
𝜆(𝑢) −∑𝑖𝜎𝑖min(𝑤(𝑢,𝑟𝑖),𝑤(𝑣,𝑟𝑖));
on the tail, 𝜆 itself
suffices. Thus numerical optimisation only proposes the weights.
Rational inequalities certify a valid 𝑈 on the whole admissible half-line, as
required by (5). The endpoint
minimum is valid because each slice width, as a function of 𝑑, increases and then decreases, or is
monotone; it has no interior dip. This is an interval bound, not
sampling between grid points.
Since 𝑡 =𝜇𝑒𝑥, the
contradiction 𝑎 >1 occurs before
level 1 provided that 𝜇𝑒𝑋 <1. The recorded comparison
gives (13/25)𝑒𝑋 <0.982000386 <1. It also
gives (529/1000)𝑒𝑋 <0.998996547,
so the ordinary argument supports that sharper threshold as well.
Neither threshold is claimed optimal, and this arithmetic does not
formalise the analytic reduction.
A related ordinary averaging argument, also unformalised in its
analytic construction, gives the following bounds. For a monic
polynomial of degree 𝑛 ≥2, two
zero occurrences can be joined in 𝐾2𝜇(𝑓) with length at most (71/10)𝜇1/𝑛; they are distinct in
the squarefree case, and a repeated root gives a constant path. When
𝜇 ≤1/2, the argument gives a
path of length at most 5.7 in Ω𝑓. The proof, together with
refinements that retain the number of zeros in the component or its
logarithmic capacity, is given in the inverse-ray
averaging argument.
An isolated simple critical value
Smallness of the least critical value is not the only useful
condition. An isolated simple critical value lets us continue the two
branches meeting there without encountering further branching. After
dividing values by 𝑣 =𝑓(𝑐) ≠0, the
critical value is 1 and the roots
lie over 0. We seek a disc
containing both points but no other critical value. Its centre 𝑤0 ∈[0,1] and radius 𝑆 must therefore satisfy 𝑆 >max(𝑤0,1 −𝑤0).
The ordinary construction combines a square-root coordinate, a
Bergman length estimate and a component-area bound. These are the
contents of the unformalised input DiscSepBergmanArea; the
formal consequences below remain conditional on it.
For example, 𝑓(𝑧) =𝑧3 −3𝑎2𝑧 with
0 <𝑎 <1/√3 has zeros 0, ±√3𝑎. At 𝑐 =𝑎 its critical value is 𝑣 = −2𝑎3 and the other normalised critical
value is −1. Thus the disc with
centre 𝑤0 =1 and radius 4/3 satisfies the separation
hypothesis.
Square roots and component area
The ordinary argument first removes the scale of 𝑣, then constructs a curve, and finally
bounds its length. Choose 𝛼𝑛 =𝑣 and set 𝑃(𝑧) =𝑣−1𝑓(𝑐 +𝛼𝑧). This polynomial
is monic, with its chosen critical point at 0 and critical value 1; Euclidean lengths are multiplied by
|𝛼| =|𝑣|1/𝑛 on returning to
the original plane. The component 𝑈
of 𝑃−1(𝐷(𝑤0,𝑆)) containing
0 has degree two. To apply
Riemann–Hurwitz, exhaust it by components above regular inner discs: the
outer boundary itself may contain other critical values. Since 𝑈 is simply connected and 1 −𝑃 has only a double zero at 0 there, it has a single-valued analytic
square root 𝜉. This square root
removes the simple branching. It is a proper local biholomorphism onto
𝑉 ={𝜉 :|𝜉2 −(1 −𝑤0)| <𝑆}, a
star-shaped and hence simply connected domain. Thus it is biholomorphic.
Its inverse maps −1 and 1 to the two roots and [ −1,1] to their connection. Along this
interval 𝑃 =1 −𝜉2 ∈[0,1], which
gives the required containment. Let 𝐿 be the Euclidean length of this
normalised curve.
Put 𝑎 =1 −𝑤0 and 𝑝 =𝑤0(1 −𝑤0). Squaring maps 𝑉 onto 𝐷(𝑎,𝑆). A Möbius map from this disc to
the unit disc fixing 0, followed by
taking a square root, gives the conformal map
𝜁=𝜉√𝑆𝑆2+𝑎𝜉2−𝑎2.
Choose the square-root factor positive at 0. The endpoints 𝜉 = ±1 then map to 𝜁 = ±𝑞, where 𝑞2 =𝑆/(𝑆2 +𝑝). The hypothesis on 𝑆 gives 𝑆2 −𝑆 +𝑝 =(𝑆 −𝑤0)(𝑆 −(1 −𝑤0)) >0, so 0 <𝑞 <1. The Bergman segment estimate
used in Section 4 now applies to
[ −𝑞,𝑞] and gives
𝐿2≤2𝜋log𝑆2+𝑆+𝑝𝑆2−𝑆+𝑝Area(𝑈).
The factor 𝑛 −1 comes from the roots outside 𝑈, not from Pólya’s inequality alone. For
monic 𝐹 of degree 𝑛 and regular level 𝑡 >0, let 𝑊 be a component of {|𝐹| <𝑡} containing 𝑘 <𝑛 zeros counted with multiplicity.
Reflecting the 𝑛 −𝑘 exterior-root
factors into the disc gives a Blaschke product 𝐵 of degree 𝑛 −𝑘 with |𝐵(0)| =cap(―――𝑊)𝑛/𝑡 and |𝐵′| <𝑛
on the boundary. The boundary-fibre identity gives
𝑛−𝑘𝑛<∑𝐵(𝜁)=𝑤|𝜁|=11|𝐵′(𝜁)|=1−|𝐵(0)|2|𝑤−𝐵(0)|2,|𝑤|=1.
Choosing 𝑤 opposite 𝐵(0) gives (𝑛 −𝑘)/𝑛 <(1 −|𝐵(0)|)/(1 +|𝐵(0)|), hence
cap(―――𝑊)𝑛/𝑡 <𝑘/(2𝑛 −𝑘).
Apply this to 𝐹 =𝑃 −𝑤0 on the
regular inner components exhausting 𝑈. Their degree is two, so 𝑘 =2 and 𝑘/(2𝑛 −𝑘) =1/(𝑛 −1). Here 𝑘 counts preimages of 𝑤0 under 𝑃. These need not be the roots joined by
the curve; the component degree gives both counts. Pólya’s area–capacity
inequality [15], [7], followed by exhaustion, now
gives Area(𝑈) ≤𝜋(𝑆/(𝑛 −1))2/𝑛.
The original curve has length length(Γ) =|𝑣|1/𝑛𝐿,
which gives (7). Dubinin’s
relative area inequality [14] has a different full-covering hypothesis;
the absolute component estimate is needed here.
For the conditional threshold, decrease 𝑆 to 4/3. Since 𝑝 ≥0 and 𝑛 ≥3, the logarithm is at most log7 <2 and (𝑆/(𝑛 −1))2/𝑛 ≤1, giving length(Γ) <2|𝑣|1/𝑛 <2.
For 𝑛 =3,𝑤0 =1,𝑆 =6/5, use (3/5)2/3log11 <2. The chosen
critical value must be nonzero and have modulus less than one. Root
locations by themselves do not isolate it from the others.
Further estimates
Root distances do not ensure containment
Order the root distances at a non-root critical point 𝑐 as 0 <𝑑1 ≤⋯ ≤𝑑𝑛. The balance
∑𝑗(𝑐 −𝑧𝑗)−1 =0 and this
ordering give
1𝑑1≤𝑛−1𝑑2,𝑑1𝑑𝑛−12≤|𝑓(𝑐)|.
The ratio bound 1 ≤𝑑2/𝑑1 ≤𝑛 −1 permits the scalar
comparison
𝑑1+𝑑2≤2(𝑑1𝑑𝑛−12)1/𝑛≤2|𝑓(𝑐)|1/𝑛.
Neither inequality supplies containment.
When all zeros lie in the open unit disc, a different estimate
holds: at every non-root critical point the sum of the distances to the
two nearest zeros is strictly less than 2. The companion gives both root-distance
estimates. The nearest pair is chosen among all roots of 𝑓. It need not be the pair in the
two-root component of the degree-seven example, where containment
restricts which pair can be joined.
Even a short segment from a critical point can leave the lemniscate.
For the quintic
(𝑧−𝑎)(𝑧2+𝑝2)(𝑧2+902901𝑝𝑧+𝑝2),𝑝=9991000,𝑎=901902𝑝,
all roots
lie in the disc and 0 is a non-root
critical point, but its unique nearest-root segment leaves the unit
lemniscate. Moreover, every root-pair midpoint of 𝑧3 −(99/100)3 lies outside it. This
cubic still admits the two-segment connections of Theorem 3.1; it is the
straight chords that fail. The exact
counterexamples include the escape calculations.
Nor do the two critical-value criteria cover every polynomial in the
root-disc class. For 𝑧3 +3𝑧/100 −3/4, the least critical-value
modulus exceeds 13/25, and the two
normalised critical values are too close for the isolation
criterion.
A further cubic has two roots at its first merger but normalised
component capacity one at level 2𝜇. By that level all three roots have
merged, so the initial two-root count cannot be used at the later level.
The component is now the whole filled lemniscate, whose capacity is
given by cap(𝐾𝑡(𝑓)) =𝑡1/𝑛 [23].
Finally, 𝑧8 −(3/2)𝑧 has least
critical-value modulus 𝜇 >1,
yet a one-root unit-level component has perimeter larger than Γ(1/4)2/(2√𝜋); see the
companion’s component examples. No root-location restriction is
imposed. The open question asks for a constant 𝛽 bounding each component perimeter
of 𝐾𝜎(𝑓) by 𝛽𝜎1/𝑛, uniformly over
squarefree monic 𝑓 of degree 𝑛 ≥2 and 0 <𝜎 <𝜇. This level
restriction is stronger than a one-root condition on a single component.
Although [21]
reports a Runge construction of unbounded one-root perimeters, its proof
is unavailable and we do not use it.
Sparse families and binomial chords
Let 𝑓(𝑧) =𝑃((𝑧 −ℎ)𝑞), where
𝑞 ≥2 and 𝑃 is a monic cubic, and suppose all zeros
of 𝑓 lie in the open unit disc. For
any root 𝑟 =𝑦𝑞 of 𝑃, averaging |ℎ +𝑦𝜁|2 over the 𝑞th roots of unity cancels the cross term
and gives |ℎ|2 +|𝑦|2 <1. Thus
the quotient roots satisfy |𝑟| =|𝑦|𝑞 <1. If 𝑓 has two distinct zeros, the companion
selects a nonzero root 𝑟 with [0,𝑟] ⊂{|𝑃| <1}. Choose 𝑦𝑞 =𝑟. Then 𝑓(ℎ +𝑡𝑦𝜁) =𝑃(𝑡𝑞𝑟) for 0 ≤𝑡 ≤1, so the whole fibre gives
contained segments through ℎ. Two
distinct fibre points are joined with length 2|𝑦| <2, using the same average.
For 𝑓(𝑧) =𝑧5 +𝑎𝑧4 +𝑏𝑧 +𝑐 with
open-disc roots, Abel summation gives a contained radial segment
whenever |𝑏𝑧𝑗 +𝑐| <1. For 𝑎 ≠0, the missing coefficients fix the
first three power sums. After rotation, the companion’s harmonic
function sums to 5 −2|𝑎| over the
roots. It is bounded above by 4 −2|𝑎| on the disc and by 2/31 at roots with |𝑏𝑧𝑗 +𝑐| ≥1. Four such indices would
therefore give
5−2|𝑎|≤4−2|𝑎|+831<5−2|𝑎|,
a
contradiction. Hence two indices satisfy |𝑏𝑧𝑗 +𝑐| <1. When 𝑎 =0, the root equation gives |𝑏𝑧𝑗 +𝑐| =|𝑧𝑗|5 <1 directly.
Coincident selected root values give the constant path. The companion
gives the cubic-fibre
proof and the quintic
selection argument, including repeated root occurrences.
For 𝑧𝑛 −𝑟𝑛, 0 <𝑟 <1, the maximum modulus on an
adjacent chord of radius 0 <𝑠 ≤𝑟 is 𝑟𝑛 +(𝑠cos(𝜋/𝑛))𝑛.
The outer root chord therefore works below 𝑟∗ =(1 +cos𝑛(𝜋/𝑛))−1/𝑛. At and
above this value, take a slightly contracted inner radius 𝑠 >0 making that maximum less than one.
The radial legs remain contained, and for 𝑛 ≥3 the total length is
2(𝑟−𝑠)+2𝑠sin(𝜋/𝑛)<2𝑟<2.
The chord
calculation proves the maximum on the entire segment, not geodesic
optimality. For 𝑛 =2, use the
diameter.
Collinear roots
For collinear roots of diameter 𝐷, a Chebyshev alternation argument gives
two adjacent root occurrences whose segment satisfies
|𝑓|≤(𝐷/2)𝑛2𝑛−1cos𝑛(𝜋/(2𝑛)).
The constant is sharp, with equality for the appropriately scaled zeros
of the Chebyshev polynomial 𝑇𝑛.
Qualitative existence of a contained root segment was already proved in
[2]. For distinct roots,
first reduce to the real monic case. If every gap maximum exceeded the
bound, subtracting the endpoint-normalised monic Chebyshev polynomial
would give a polynomial of degree at most 𝑛 −1 with 𝑛 distinct zeros: two endpoints and 𝑛 −2 intervening sign changes. See
Eremenko and Yuditskii [10] for the critical-sequence
viewpoint. The companion contains the alternation
proof and equality case.
Critical-value means
For 𝑐𝑗 ∈――𝔻
and positive weights of sum one, set 𝐺(𝑧) =∏𝑗|1 −¯𝑐𝑗𝑧|𝑤𝑗. Then
∑𝑗𝑤𝑗𝐺(𝑐𝑗)2 ≤1, with
equality only when all 𝑐𝑗 =0.
For interior centres, the nonvanishing factors give an analytic 𝑔(𝑧) =1 +∑𝜈≥1𝑎𝜈𝑧𝜈 with
|𝑔| =𝐺. On 𝜁 =𝑒𝑖𝜃 the weighted Poisson
kernel is 𝑃 =∑𝑗𝑤𝑗(1 −|𝑐𝑗|2)/|𝜁 −𝑐𝑗|2 =1 −2Re(𝜁𝑔′/𝑔). With 𝑑𝑚 =𝑑𝜃/(2𝜋), subharmonicity gives
the inequality below, and orthogonality gives the identity:
∑𝑗𝑤𝑗𝐺(𝑐𝑗)2≤∫|𝑔|2𝑃𝑑𝑚=1−∑𝜈≥1(2𝜈−1)|𝑎𝜈|2.
Indeed, ∫|𝑔|2 𝑑𝑚 =1 +∑|𝑎𝜈|2 and ∫𝜁𝑔′――𝑔 𝑑𝑚 =∑𝜈|𝑎𝜈|2. Each nonconstant coefficient therefore
contributes 1 −2𝜈 <0. For
boundary centres, replace 𝑐𝑗 by
𝑟𝑐𝑗 and let 𝑟 ↑1 with a finite coefficient sum
first; no boundary logarithm is needed. Equality forces every 𝑎𝜈 to vanish. Logarithmic
differentiation of 𝑔 =1, grouping
repeated centres, then forces all the positive-weight centres to be
zero.
To apply this inequality to a monic polynomial 𝑓 of degree 𝑛 ≥2 with zeros in the closed unit disc,
take its 𝑚 =𝑛 −1 critical points,
counted with multiplicity, and give them equal weights 1/𝑚. Gauss–Lucas puts these points in the
closed unit disc. The reflected-derivative comparison then gives the
pointwise bound
|𝑓(𝑐𝑗)|2/𝑚≤(𝑚∏𝑘=1|1−¯𝑐𝑘𝑐𝑗|)2/𝑚=𝐺(𝑐𝑗)2.
Summing and using the weighted inequality gives ∑𝑗|𝑓(𝑐𝑗)|2/𝑚 ≤𝑚. For zeros in a
closed disc with centre ℎ and
radius 𝑅 >0, apply this to 𝑅−𝑛𝑓(ℎ +𝑅𝑧) and scale back to obtain
∑𝑛−1𝑗=1|𝑓(𝑐𝑗)|2/(𝑛−1) ≤(𝑛 −1)𝑅2𝑛/(𝑛−1).
If 𝑅 =0, all critical values vanish.
An unformalised refinement, recorded as an ordinary argument, uses 𝑔2 in the same Poisson integral and
gives the proposed fourth-power bound
𝑛−1∑𝑗=1|𝑓(𝑐𝑗)|4/(𝑛−1)≤(𝑛−1)𝑅4𝑛/(𝑛−1)
for the same enclosing disc.
Equality is attained by (𝑧 −ℎ)𝑛 −𝜆 with |𝜆| =𝑅𝑛. The companion supplies the
weighted
identity, reflected-derivative comparison and equality analysis.
Applying AM–GM to ∑𝑗|𝑓(𝑐𝑗)|2/(𝑛−1) ≤𝑛 −1 in the
unit disc gives Dubinin’s sharp critical-value product bound [16]. With a zero
prescribed at the disc centre, his Theorem 3 gives a different, sharper
product estimate and credits earlier work of Tischler [20]. The corresponding
marked-zero positive-moment question in [21] remains unresolved here. To turn any
of these mean bounds into a short-path theorem, one would still have to
select a pair of roots and control a curve joining them inside the
lemniscate.
Successive merger scales
For a component with 𝑘 ≥1
roots, let 𝑟 ∈(0,1] be the earlier
merger level divided by the later one. An integral arising in length
estimates is
𝐼𝑘(𝑟)=∫1𝑟𝑑𝑞𝑞log((1+𝑞2/𝑘)/(1−𝑞2/𝑘))=𝑘Φ(1𝑘log1𝑟),Φ(𝑥)=∫𝑥0𝑑𝑡logcoth𝑡.
Substituting
𝑞 =𝑒−𝑘𝑡 gives the identity; the
integrand defining Φ has
limiting value zero at 𝑡 =0. It is
increasing, so Φ is strictly
convex and Φ(𝑥)/𝑥 →0 as 𝑥 ↓0. Thus, when the two merger
levels approach one another (𝑟 ↑1), 𝐼𝑘(𝑟) becomes arbitrarily small relative
to 𝑘−1log(1/𝑟), even for fixed
𝑘. No positive uniform lower factor
exists. See the merger-scale
calculation.
Flow constructions and remaining questions
Inverse rays and perturbation
Along an existing real-interval trajectory ˙𝑧 = −𝑓(𝑧)/𝑓′(𝑧) with 𝑓′(𝑧(𝑡)) ≠0, the chain rule gives
(𝑓 ∘𝑧)′ = −𝑓 ∘𝑧, hence
𝑓(𝑧(𝑡)) =𝑒−(𝑡−𝑡0)𝑓(𝑧(𝑡0)). This
classical identity fixes the ray of a nonzero value, not the Euclidean
length ∫|𝑓(𝑧(𝑡))/𝑓′(𝑧(𝑡))| 𝑑𝑡; see Kozen
and Stefánsson [6] on the Newtonian graph of
Shub, Tischler and Williams. The companion’s local complex-parameter
identities for (𝑓 ∘𝑧)′ and
(𝑒𝑡𝑓(𝑧(𝑡)))′ are pointwise
statements, distinct from the real-interval integration in its value
and finite-endpoint theorems.
For a finite interval [𝑎,𝑏],
assume the Newton equation only for 𝑎 <𝑡 <𝑏 and continuity of 𝑓(𝑧(𝑡)) up to both endpoints. The
interior identity then extends to 𝑓(𝑧(𝑏)) =𝑒𝑎−𝑏𝑓(𝑧(𝑎)), without
evaluating 𝑓/𝑓′ at an endpoint.
Nonzero endpoint values therefore lie on the same positive ray. Critical
values with distinct arguments exclude such a connection; distinct
moduli are insufficient.
Adding 𝛽 leaves 𝑓′ unchanged and sends each critical
value 𝑣 to 𝑣 +𝛽. For distinct values 𝑎,𝑏, a common positive ray requires 𝛽 to lie on the real line through
−𝑎 and −𝑏. Avoiding these finitely many lines
and the points −𝑣 therefore makes
the distinct values nonzero and ray-separated; equal values remain
equal. The formal sources give the one-parameter
collision locus and the finite
affine-line avoidance argument. The companion
calculation describes the forbidden translations; its unformalised
linear-perturbation argument supplies distinct critical values. Neither
qualitative step controls the slack in a near-extremal path inequality.
Separately, expand log|𝑓| about a
non-root point and let 𝑞 be the
displacement divided by the distance to the nearest zero. For 𝑞 <1, the remainder after order 𝑁 is at most 𝑛𝑞𝑁+1/((𝑁 +1)(1 −𝑞)). This local
expansion cannot be used through a zero and does not itself give a
coefficient-perturbation bound.
Inverse-branch prerequisites.
For a nonconstant complex polynomial, each component of {|𝑓| <1} contains
a root. The restriction to that component is onto
the unit disc and has finite
fibres. Over values avoiding the critical values attained in that
component, it is a covering
map. When 0 is not a critical
value on the component, choose finitely many nonzero slit starts
including its critical values, and remove their outward rays from the
value disc. On the remaining domain, each root in the component
determines a unique
continuous inverse branch, taking 0 to that root. The archived Lean source
states these prerequisites and supplies proof scripts; a kernel-check
receipt for this module is not supplied here. The full conformal sheet
decomposition, sheet count, monodromy and embedded-tree assertions
remain ordinary arguments in the companion; the prerequisites give no
length estimate.
The failed tree estimate
For 𝑧2 −(9/10)2, the distance
between the roots already forces any connected set containing them to
have length at least 9/5.
Proposition 12 of the March manuscript [3] instead proposes a bound below 41/25 plus an arbitrarily small error.
Since 41/25 <9/5, choosing the
error smaller than this gap contradicts the lower bound. The
spanning-tree estimate is false. At a simple saddle the local level set
has four sectors, consistently with the lemniscate graph description in
[13].
The Cassini
calculation and corrected topological statement separate the metric
failure from the valid sheet decomposition.
The full topological reconstruction in that discussion remains
unformalised. Cutting outward from critical values to obtain
inverse-sheet adjacency is classical; see [16] and [22]. Length control requires
additional estimates on the actual pieces and their attachment. An uncut
Newton orbit space can even fail to be Hausdorff, so it cannot be
identified with a finite Reeb graph without further argument. Earlier
grid searches in degrees 5,6,8,10
found no counterexample, but neither certified containment along
unexamined edges nor established a statement for all polynomials.
Restricted extremal problems
The companion records the following ordinary compactness argument,
which has not been formalised. In the closed lemniscate 𝐾1(𝑓), a finite infimum of connecting
path lengths is attained. At fixed degree, compactness of the closed
root-disc class and lower semicontinuity of this infimum allow uniform
upper bounds to pass to coefficient limits. These are statements about
the closed lemniscate, as proved in the companion’s compactness
argument. Closed containment survives such limits; strict
containment need not. The binomial family approaches length 2, but the degree-seven example rules out
2 as a universal upper bound. That
refuted assertion is not a remaining open problem. What remains is to
determine quantitative bounds for restricted classes and as the degree
varies.
The precise unresolved questions about cut-open flow strips,
attachment lengths and quantitative perturbation are stated in the
companion’s final
questions. The origin-spoke failure for the near-regular-pentagon
family has an ordinary, unformalised proof there. The stronger failure
asserted in the research addendum [21] for every critical joining point has
no available proof and is not used. Likewise the fixed degree-seven
proof does not establish the whole small-parameter family.