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
Two further root-count bounds.

Order the distances as d1≤⋯≤dk. The triangle inequality gives dj≥D−d1 for j≥2. The function λ is decreasing and convex, since λ′(d)=−1/sinh⁡d and λ″(d)=cosh⁡d/sinh2⁡d>0. On [dlow,D/2], the convex function λ(d)+(k−1)λ(D−d) takes its maximum at an endpoint. If d1≥D/2, each summand is at most λ(D/2) instead. (The definitions give dlow<D/2.) Thus

x≤∑jλ(dj)≤max{δ(a)2+(k−1)λ(D−dlow),kλ(D/2)},

and consequently

k≥min{1+x−δ(a)/2λ(D−dlow),xλ(D/2)}.

The minimum is essential: the two expressions arise from alternative positions of the nearest root, not from simultaneous restrictions.

For the second bound, integrate over the disjoint hyperbolic balls of radius D/2. Put E=e2/a−1, so each ball has hyperbolic area 2πE. At most one contains the origin; its contribution to ∑jλ(dj) is at most δ(a)/2. On every other ball, −log⁡|z| is harmonic. To average it, first move the ball’s centre to 0 by a disc automorphism. Hyperbolic area is invariant under this change of coordinates and has radial density 4/(1−|z|2)2 there. The ordinary mean-value property on each centred Euclidean circle therefore gives hyperbolic area mean λ(dj). If the original ball has 0 on its boundary, use increasing smaller concentric balls and monotone convergence.

There are m=k−1 nonexceptional balls if one contains the origin, and m=k otherwise. Their union has area 2πmE. Each superlevel set of −log⁡|z| is a centred ball, so its intersection with any set of this area has area at most the smaller of the two areas. The centred ball of area 2πmE attains that upper bound at every superlevel. Integrating these intersection areas over the superlevel parameter therefore bounds the integral over the union by the integral over that centred ball. Its radius R satisfies cosh⁡R=1+mE. With v=cosh⁡r−1, the identity −log⁡tanh⁡(r/2)=12log⁡(1+2/v) reduces the radial integral to (2E)−1∫0mElog⁡(1+2/v)dv. Evaluating it gives

12πE∫Bhyp(0,R)−log⁡|z|dAhyp=mE2log⁡(1+2/(mE))+log⁡(1+mE/2)E≤1+log⁡(1+mE/2)E,

where the improper integral is finite because vlog⁡v→0 as v↓0, and the last inequality uses log⁡(1+u)≤u for u>0. Adding the possible exceptional contribution and inverting each case yields

k≥min{1+2E(eE(x−δ(a)/2)−1−1),2E(eEx−1−1)}.

Again the minimum accounts for the two possible cases. This estimate uses area rearrangement, whereas the preceding one uses only ordered distances; neither replaces the circle-slice inequalities.

The comparison takes the maximum of 2, 2x/δ(a), these two bounds, and the certified circle-slice bounds. Each may first be rounded up because k is an integer. Any of these estimates derived with an upper bound for a remains valid at the actual smaller area: the root configuration still satisfies the weaker separation and radius conditions at that upper bound.

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.