feat(ErdosProblems): add Problem 114 (Erdős–Herzog–Piranian conjecture)#3712
feat(ErdosProblems): add Problem 114 (Erdős–Herzog–Piranian conjecture)#3712bengoechea wants to merge 4 commits intogoogle-deepmind:mainfrom
Conversation
|
Thanks for your pull request! It looks like this may be your first contribution to a Google open source project. Before we can look at your pull request, you'll need to sign a Contributor License Agreement (CLA). View this failed invocation of the CLA check for more information. For the most up to date status, view the checks section at the bottom of the pull request. |
|
Is this a duplicate of #3708? |
Formalise the EHP conjecture (1958): among monic degree-n polynomials, z^n - c (|c|=1) uniquely maximises the lemniscate arc length. Two theorems: - erdos_114: full open conjecture for all n - erdos_114_small_n: solved for 3 ≤ n ≤ 14 via IEEE 1788-rigorous interval arithmetic (doi:10.5281/zenodo.19480329) References: Erdős–Herzog–Piranian (1958), Eremenko–Hayman (1999), Pommerenke (1961), Tao (2025), Mendoza (2026).
48105e1 to
c962003
Compare
|
For context on what changed from #3708: CLA was failing because the original PR came from a personal fork before I'd signed it. Also fixed the Apache 2.0 license header (http → https in the license URL, which was failing CI) and updated the AI disclosure section. This PR is from the MendozaLab org fork with a clean single commit. The mathematical content in 114.lean is identical. |
|
Build was failing because |
Match the pattern used in 1041.lean (which compiles in CI). Also use Polynomial ℂ[X] abbreviation with open Polynomial.
|
Note on the fix commits: the initial submission compiled locally against a slightly older Mathlib snapshot. CI's pinned toolchain exposed type class resolution differences — specifically around |
Summary
Adds
FormalConjectures/ErdosProblems/114.lean— the Erdős–Herzog–Piranian (EHP) conjecture (#114) with a computationally certified small-n result.erdos_114: Full open conjecture (all n)erdos_114_small_n: Solved for 3 ≤ n ≤ 14 via IEEE 1788-rigorous interval arithmeticContext
Moritz Firsching confirmed a standalone PR is welcome:
Zulip message
This PR is intentionally separate from #3422.
Certificates
Each n case is verified independently by branch-and-bound over the compact
parameter space of monic degree-n polynomials, with IEEE 1788-2015 certified
interval arithmetic bounds:
All results deposited with SHA-256 checksums:
doi:10.5281/zenodo.19322367
Definitions
levelCurveUnit parcLength pFuture work
erdos_114_small_n_unique) as a follow-up