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

Consequences of having no short path.

Assume no two distinct roots are joined inside {|f|<1} by a curve of length below 2. Choose a critical point at level μ and two descending inverse arcs into distinct one-root components of {|f|<μ}; below μ each component maps conformally onto the value disc, and distinct local inverse arcs at the first critical point enter distinct components, since two inverse images of a nearby regular value in one component would contradict its degree one. Their union is a compact connected set containing two roots. Fix a level t∈(μ,1) at which no critical value has modulus t, so that the level is regular. Let Ct be the component of {|f|<t} containing that set, let k≥2 be its root count, and put x=log⁡(t/μ) and a=Area⁡(Ct)/π; Pólya’s inequality [2] gives a≤t2/n<1. The component is a Jordan domain. List its roots as ζ1,…,ζk, choose a Riemann map φ:D→Ct, and write bj=φ−1(ζj). The component-wise form of [8] is

f(φ(z))t=eiθ∏j=1kz−bj1−bj―z.

Indeed, regularity extends φ across the Jordan boundary. The quotient of the two sides without the phase has no zero or pole on the closed disc and has boundary modulus one. The maximum principle, applied to that quotient and its reciprocal, makes it a unimodular constant. The product has degree k, the root count of this component, not necessarily the full degree n. Distances between the bj below are hyperbolic distances in D, normalised by d(0,s)=2artanh⁡s for 0≤s<1. Intrinsic distances in Ct are infima of Euclidean lengths of curves in that component.

The length estimate converts area into a bound for the image of a compact real interval I⊂(−1,1). Here is the coefficient calculation underlying the Bergman-kernel argument. Write φ′(z)=∑ℓ≥0αℓzℓ. Injectivity and the area formula give ∑ℓ≥0|αℓ|2/(ℓ+1)=a. To express length as a linear integral, choose ω(x)=φ′(x)―/|φ′(x)| on I; the denominator is nonzero because φ is conformal. Cauchy–Schwarz gives

length⁡(φ(I))2=|∑ℓ≥0αℓ∫Iω(x)xℓdx|2≤a∑ℓ≥0(ℓ+1)|∫Iω(x)xℓdx|2.

Compactness of I permits termwise integration of the series. Since ∑ℓ≥0(ℓ+1)(xy)ℓ=(1−xy)−2>0 for real x,y∈I, taking absolute values in the resulting double integral yields

length⁡(φ(I))2≤a∫I∫Idxdy(1−xy)2.

This is precisely the positivity of the disc Bergman kernel K(z,w)=π−1(1−zw―)−2 on the real diameter. For I=[u,v]⊂(−1,1), direct integration gives

∫uv∫uvdxdy(1−xy)2=log⁡(1−uv)2(1−u2)(1−v2).

Thus I=[0,r] gives length⁡(φ([0,r]))2≤alog⁡(1/(1−r2)). Moving two preimages to ±s and taking I=[−s,s] instead gives

length⁡(φ([−s,s]))2≤4aartanh⁡(s2).

A pair of roots at hyperbolic distance d may be placed at ±tanh⁡(d/4). Their connecting curve then has length less than 2 whenever artanh⁡(tanh2⁡(d/4))<1/a. Under our assumption that no such curve exists, we therefore have

(7)d(bi,bj) ≥ D:=4artanh⁡tanh⁡(1/a),cosh⁡(D/2)=e2/a.

There is also a point h in the chosen compact connected set whose intrinsic distance in Ct from every root is at least 1. Otherwise the open intrinsic balls of radius 1 about the roots would cover that set. Two balls with distinct centres cannot meet: paths from their centres to a common point would concatenate to length below 2. But a connected set containing two distinct roots cannot be covered by these disjoint open sets. This contradiction proves the assertion. Now choose the Riemann map with φ(0)=h, and continue to write bj=φ−1(ζj). Put dj=d(0,bj) and λ(d)=−log⁡tanh⁡(d/2). The one-root estimate at h gives tanh⁡(dj/2)≥1−e−1/a. The centre h lies on the chosen inverse arcs, so 0<|f(h)|≤μ; it is not a root because its intrinsic distance from every root is at least 1. The Blaschke identity at 0 gives |f(h)|/t=∏j|bj|, hence ∑jλ(dj)=log⁡(t/|f(h)|)≥log⁡(t/μ)=x. Together these estimates give

(8)λ(dj)≤δ(a)2,δ(a)=−log⁡(1−e−1/a),∑j=1kλ(dj) ≥ x.

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.