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
Area of a connected sublevel set.

The following calculation applies in every degree n≥2, independently of the degree-five segment criterion. Let f be monic of degree n and let t>0 with Kt={|f|≤t} connected. Translate its root centroid to 0, so f(z)=zn+cn−2zn−2+⋯, and let ψ be the exterior map normalised at infinity with positive leading coefficient. For a regular connected lemniscate, the identity f(ψ(ζ))=tζn is [8] after scaling the value level. The following argument also permits critical boundary points. The exterior Green functions (log⁡|f|−log⁡t)/n and log⁡|ψ−1| agree: both vanish at the boundary and have a logarithmic pole of coefficient one at infinity. Comparison there gives the leading coefficient t1/n for ψ. The quotient f(ψ(ζ))/(tζn) has constant modulus one and limit one at infinity, proving the polynomial identity. Its ζn−1 coefficient forces the constant Laurent coefficient of ψ to vanish. Thus

ψ(ζ)=t1/nζ+∑k≥1akζ−k.

Grönwall’s area identity takes the form

Area⁡(Kt)=π(t2/n−∑k≥1k|ak|2).

One can obtain it directly without assuming that level t is regular. For r>1, Green’s area formula on the analytic Jordan curve ψ(reiθ) gives the enclosed area π(t2/nr2−∑k≥1k|ak|2r−2k). These enclosed compact sets decrease to Kt as r↓1; continuity of area from above and monotone convergence of the series give the identity. Comparing the coefficient of ζn−2 in the exterior identity now gives

nt(n−1)/na1+cn−2t(n−2)/n=0,a1=−cn−2nt1/n.

The nonnegative coefficient sum quantifies the loss from Pólya’s upper bound. It does not by itself control an internal path length. No analogous coefficient formula for an individual component of a disconnected sublevel set is established here. The degree-five statements and their evidence classes are recorded in the degree-five estimates and their proofs.

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.