Plectis

Long paper

Paths in Polynomial Lemniscates: A Degree-Seven Counterexample and Radial Connections

Summary. The record gives the rational estimates and geometric proof for ani's degree-seven polynomial: every connected set in its strict unit lemniscate joining two roots has Hausdorff measure greater than two. It develops contained paths for trinomials, collinear roots and two sparse families. Ordinary analytic arguments for critical-value criteria retain their unformalised inputs beside the statements. Critical-value moments, counterexamples to prescribed paths and questions about flow-strip geometry complete the account. The one-polynomial formal statement and correspondence with the historical wording remain distinct.

This paper covers the exact geometry of ani's one-polynomial counterexample, proved positive families and critical-value arguments with their unformalised inputs identified; formal-statement status and historical correspondence remain owned by the claims registry.

It does not establish the validity of claims tagged Lean, which belongs to the cited kernel-checked source, or the current status of Erdős #1041, including the later one-polynomial Formal Conjectures path-image Hausdorff-length check and its unreviewed historical curve-length correspondence; those distinctions belong to docs/claims.json in the mathematics repository.

In this paper
Containment of the two selected segments.

Let f be monic of degree n≥3 with roots in the closed unit disc. The following estimate controls the segments from a critical point to its two nearest roots. To specify the constant, put

Mn2=max0≤t≤14−n≤y≤n(1−t)2((1−t)2+2ty+n(n−2)t2)⋅((1−t)2+2t(n−y)n−2)n−2.

Here t parametrises the segment. The product estimates below use f′(c)=0 and the ordering of distances, not the root-disc hypothesis; the latter enters when bounding the combined segment length. To explain the other parameter and the coefficient n(n−2), suppose f(c)≠0, order the roots a1,…,an by distance from c, and set vj=(a2−c)/(aj−c). Then v2=1, |vj|≤1 for j≥2, and ∑jvj=0 by f′(c)=0. With y=1−ℜv1, this gives

y=2+∑j=3nℜvj∈[4−n,n],|v1|≤n−1.

Consequently

|1−tv1|2≤(1−t)2+2ty+n(n−2)t2,1n−2∑j=3n|1−tvj|2≤(1−t)2+2t(n−y)n−2.

The factor v2=1 contributes (1−t)2. Applying AM–GM to the remaining n−2 squared factors in f(c+t(a2−c))/f(c)=∏j(1−tvj) gives the defining expression for Mn2. Thus the maximisation is an explicit bound for the second segment, not an additional optimisation hypothesis about the roots.

For the nearer segment, put xj=(a1−c)/(aj−c). Now x1=1, |xj|≤1 for every j, and ∑jxj=0. Hence

∑j=2n|1−txj|2≤(n−1)(1+t2)+2t,

so AM–GM gives

|f(c+t(a1−c))f(c)|2≤(1−t)2((1−t)2+2tnn−1)n−1.

This bound is at most Mn2 for every n≥3, not just for numerically tested degrees. Indeed, set y=n/(n−1) in the defining maximum. This value is admissible because n/(n−1)−(4−n)=(n−2)2/(n−1)≥0. The last factor then has base (1−t)2+2tn/(n−1), and the preceding factor has this same base plus n(n−2)t2≥0. Their product therefore dominates the displayed nearer-segment bound. Thus |f(z)|≤Mn|f(c)| on both segments, so 0<|f(c)|≤1/Mn gives containment in {|f|≤1}; the critical-point distance estimate gives total length at most 2. If f(c)=0, two root occurrences already coincide at c. The quadratic case is the direct root segment treated earlier. For degree five the maximum evaluates to

M5=(1−t∗)(1+t∗)316t∗2−4t∗+1,t∗=516+310580,1M5=0.2760461….

The breakpoint comes from the constraint on y, not from a numerical search. For fixed 0<t<1, write the two bases in the definition of M5 as

A=(1−t)2+2ty+15t2,B=(1−t)2+2t(5−y)3.

They are positive for −1≤y≤5, and ∂ylog⁡(AB3)=2t(B−A)/(AB). Thus the unconstrained maximum occurs at A=B, or y=5/4−45t/8. This reaches the lower endpoint −1 at t=2/5; thereafter the maximum is at y=−1. For 0≤t≤2/5 the resulting expression is (1−t)(1+t/2+19t2/4)2, whose derivative is

5t(14−19t)(19t2+2t+4)16≥0.

For 2/5≤t≤1, the square of the resulting expression is (1−t)2(1+t)6(16t2−4t+1), whose derivative is

−4t(1−t)(1+t)5(40t2−25t−2).

The quadratic changes sign once on this interval, at t∗, so the second branch increases from the common breakpoint to t∗ and then decreases to zero. Since the first branch increases to that breakpoint, t∗ gives the global maximum. This proves the displayed value without sampling either optimisation variable. As an existence criterion this is weaker than the 13/25 theorem. Its different content is the control of the two straight segments from the specified critical point, rather than a curve selected by area averaging. For z5−b it requires |b|≤1/M5, so it excludes part of a binomial family already covered by the trinomial theorem. No claim is made that every quintic has a critical value below this level.

A near-regular pentagon illustrates why a prescribed joining point is restrictive. For sufficiently small ϵ>0, set

Pϵ(z)=z5+ϵ5z4+ϵ3z3−ϵ3z2−ϵ5z−1,Fϵ(z)=r5Pϵ(z/r),r=1−ϵ9.

All five roots of Fϵ lie in the open unit disc, approach a regular pentagon, and have escaping segments from the origin. Here is a proof of that assertion, including the effect of the radial contraction.

The roots of Pϵ are simple perturbations ζϵ=ζ0+O(ϵ3) of the fifth roots of unity. The identity

z5Pϵ(1/z―)―=−Pϵ(z)

makes the roots invariant under conjugate inversion. Uniqueness of the root near each ζ0 therefore forces |ζϵ|=1. The roots rζϵ of Fϵ consequently have modulus r<1. The displacement estimate follows from the implicit function theorem at each simple root of z5−1, since the first coefficient perturbations have order ϵ3.

For ζ0=1,e4πi/5,e−4πi/5, take t=ϵ/4. Substitution into the polynomial gives

|Fϵ(rtζϵ)|2=1+(ℜζ028−1512)ϵ5+O(ϵ6).

The coefficient is positive, since ℜζ02≥(5−1)/4. For the remaining roots, with ζ0=e2πi/5 or e−2πi/5, take t=ϵ2/4 instead. Then

|Fϵ(rtζϵ)|2=1+35−532ϵ7+O(ϵ9)>1

for sufficiently small ϵ. The two scales are needed because ℜζ02 is negative for this second pair; its positive linear contribution dominates at the smaller scale. Multiplication by r10=1+O(ϵ9) cannot remove either positive leading term. The remainders are uniform over the five root branches, so one sufficiently small ϵ works for every segment. This is an ordinary asymptotic proof; it gives no numerical upper bound for the permitted ϵ.

The addendum [26] reports the stronger assertion that no critical point of this family supplies two contained straight arms of total length at most 2. Its proof is not available. The origin calculation above does not prove it: Pϵ′(0)=−ϵ5 shows that the origin is not a critical point. The stronger reported assertion is not used in any theorem here. Neither the proved failure at the origin nor the reported critical-point obstruction excludes curved inverse images of rays or a different joining point.

A different local question allows a freely chosen, noncritical vertex: for some δ>0, does every monic quintic with open-disc roots within δ of a rotated regular pentagon admit two contained straight arms through some h∈C of total length below 2? Neither the origin nor a critical point is prescribed in this question. The sufficient low-critical threshold preceding this paragraph is unchanged.

About this paper

Authorship and AI use. Will Cook built and directed the research infrastructure and maintains the public release. He reviewed claims when he could. AI agents did most of the research and drafting. Cook did not independently verify every claim.

Cite and contact. Cite this paper by its title, author and date above, with its PDF; cite the earlier sources it uses for a mathematical result. For software, use the release citation and give the commit used. Contact Will with questions or corrections.

Prefer the manuscript?

Equations typeset from the exact TeX. Rendered from the LaTeX manuscript source with file fingerprint sha256:4bee9a881dbbe940. Its file fingerprint matched the published source record, so the PDF above, the LaTeX, and this page are one manuscript. Redeploying the site regenerates this page from whatever the public repository holds at that moment.