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

The two roots in the component

The local estimates identify a critical point, but we still have to find the two roots in its component. The connections from cs to b3,b6 use a small disc and four segments near the critical point, short segments to the root directions, and radial segments out to the roots. The following ordinary argument identifies the component directly; the Lean source uses barriers. Put

Re⁡wq=392265832599170384843469532006471040,Im⁡wq=82324746619448489536729178494728000780831040,x3=wq−6+3i,x6=wq+5−5i,m3=−720775094321935300989+347106991294046496381i1020,m6=498791841486986824420−625465185974423846967i1020.

The elementary inequality 1−ρ14≥14ρ14ε8 shows that

H0(w)=7ε+Re⁡Q(w)−ε72|Q(w)|2≤H(w).

Thus H0>0 suffices for containment. To check a segment from u to v, expand H0(u+t(v−u))=∑k=014aktk. Its Bernstein coefficients of degree 14 are

βj=∑k=0jak(jk)(14k),H0(u+t(v−u))=∑j=014βj(14j)tj(1−t)14−j.

All weights on the right are nonnegative and sum to one for 0≤t≤1. Exact substitution gives the lower bounds

Segment Lower bound for every βj
[wq,x3] 3556874/1012
[x3,m3] 640506
[wq,x6] 3556874/1012
[x6,m6] 139485

The formula for Tk above, followed by the displayed formula for βj, specifies these checks using rational arithmetic alone; no sampling between endpoints is involved. The same Taylor test at wq, with radius 10−8, gives one zero of Q′ in that disc and H0>3556874/1012 throughout it. The disc is contained in |w−v2|<10−6, so this zero is ws. For each j=3,6, we can therefore follow the segments from ws to wq, then to xj and mj, staying where H0>0. It remains to connect mj to the corresponding root.

For the remaining segments no large polynomial expansion is needed. The Cayley intervals give |mj/8−ζj|<1/10 and |mj/8|<101/100, for j=3,6. If x lies between mj/8 and ζj, then |x|≤101/100 and |x−ζj|<1/10. From F(ζj)=0 and |ζj|=1 we have |ζj7−1|<10−40. Telescoping x7−ζj7 therefore gives

Re⁡x7≥1−710(101100)6−10−40>14.

The coefficient bounds

(|q1|,…,|q7|)≤(720,690,206,10−9,10−30,10−55,1)=:(U1,…,U7)

imply

∑k=16Uk(8.08)k<160000,Re⁡Q(8x)>350000,|Q(8x)|<2500000.

Hence H0(8x)>0. This connects mj to 8ζj. Finally, for 8ε≤t≤1, the root equation gives

F(tζj)=t7−1+∑k=16ε7−kqkζjk(tk−t7),

so

|F(tζj)|≤1−t7+t7∑k=16Uk87−k<1,∑k=16Uk87−k<340.

Scaling by ρ joins ρε8ζj to bj within {|f|<1}. The concatenated segments connect cs to both roots.

Every component of a polynomial lemniscate at a regular level is simply connected. The component-wise Riemann–Hurwitz formula [8] says that a component containing k zeros has k−1 critical points, counted with multiplicity. The critical point table therefore shows that the component U of cs contains exactly b3,b6, and every other component contains one root.

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.