/- Copyright 2026 The Formal Conjectures Authors. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at https://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. -/ module public import FormalConjecturesUtil

Erdős Problem 114

References:

    erdosproblems.com/114

    [EHP58] Erdős, P., Herzog, F. and Piranian, G., Metric properties of polynomials. J. Analyse Math. (1958), 125-148.

    [ErHa99] Eremenko, A. and Hayman, W., On the length of lemniscates. Michigan Math. J. (1999), 409-415. arXiv:0805.2295

    [Ta25] Tao, T., The maximal length of the Erdős–Herzog–Piranian lemniscate in high degree (2025). arXiv:2512.12455

@[expose] public sectionopen Polynomial MeasureTheory Filternamespace Erdos114

The lemniscate ${z \in \mathbb{C} : \lvert p(z)\rvert = 1}$ of a complex polynomial $p$.

def lemniscate (p : ℂ[X]) : Set ℂ := {z | ‖p.eval z‖ = 1}

The length of the lemniscate of $p$, as its one-dimensional Hausdorff measure.

noncomputable def lemniscateLength (p : ℂ[X]) : ENNReal := μH[1] (lemniscate p)

If $p(z) \in \mathbb{C}[z]$ is a monic polynomial of degree $n$, is the length of the curve ${z \in \mathbb{C} : \lvert p(z)\rvert = 1}$ maximised when $p(z) = z^n - 1$?

We require $n \geq 1$. For $n = 0$ the only monic polynomial is $1$, whose level set is all of $\mathbb{C}$, while $z^0 - 1 = 0$ has an empty level set.

@[category research open, question, AMS 28 30] theorem erdos_114 : ∀ n : ℕ, 1 ≤ n → ∀ p : ℂ[X], p.Monic → p.natDegree = n → lemniscateLength p ≤ lemniscateLength (X ^ n - 1) := ⊢ ∀ (n : ℕ), 1 ≤ n → ∀ (p : ℂ[X]), p.Monic → p.natDegree = n → lemniscateLength p ≤ lemniscateLength (X ^ n - 1) All goals completed! 🐙

Tao [Ta25] proved that $z^n - 1$ maximises the length of the lemniscate for all sufficiently large $n$.

@[category research solved, AMS 28 30] theorem erdos_114.variants.large_n : ∀ᶠ n in atTop, ∀ p : ℂ[X], p.Monic → p.natDegree = n → lemniscateLength p ≤ lemniscateLength (X ^ n - 1) := ⊢ ∀ᶠ (n : ℕ) in atTop, ∀ (p : ℂ[X]), p.Monic → p.natDegree = n → lemniscateLength p ≤ lemniscateLength (X ^ n - 1) All goals completed! 🐙

Eremenko and Hayman [ErHa99] proved the case $n = 2$.

@[category research solved, AMS 28 30] theorem erdos_114.variants.two (p : ℂ[X]) (hp : p.Monic) (hdeg : p.natDegree = 2) : lemniscateLength p ≤ lemniscateLength (X ^ 2 - 1) := p:ℂ[X]hp:p.Monichdeg:p.natDegree = 2⊢ lemniscateLength p ≤ lemniscateLength (X ^ 2 - 1) All goals completed! 🐙

The case $n = 1$. A monic linear polynomial is $z - a$. Its lemniscate is a translate of the lemniscate of $z - 1$, and translations preserve Hausdorff measure.

All goals completed! 🐙end Erdos114