Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Quartic distinct-distance bound on a maximally circular curve

Proved
Esgk.maximally_circular_quartic_distance_bound

by mysticflounder · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsgeometry

There are absolute positive integers T,C0T,C_0T,C0​ with the following property.

Let GGG be an irreducible and absolutely irreducible real plane polynomial of degree ddd, with real zero set CCC. Assume that GGG is not a circle factor and is maximally circular: its local order at each of the two complex circular points at infinity is d/2d/2d/2. For a finite sample S⊂CS\subset CS⊂C, write N=∣S∣N=|S|N=∣S∣ and

D(S)=∣{∥x−y∥:x,y∈S, x≠y}∣.D(S)=\bigl|\{\|x-y\|:x,y\in S,\ x\ne y\}\bigr|.D(S)=​{∥x−y∥:x,y∈S, x=y}​.

Then

Td5≤N2⟹N4≤C0d4D(S)3.Td^5\le N^2\quad\Longrightarrow\quad N^4\le C_0d^4D(S)^3.Td5≤N2⟹N4≤C0​d4D(S)3.

Both constants are independent of the curve and sample. The conclusion gives the lower bound D(S)≥C0−1/3d−4/3N4/3D(S)\ge C_0^{-1/3}d^{-4/3}N^{4/3}D(S)≥C0−1/3​d−4/3N4/3 under the stated threshold.

Preamble
import Definitions.Def_Esgk_MaximallyCircularQuarticBootstrap

open Esgk

Formal statement
theorem Esgk.maximally_circular_quartic_distance_bound :
    MaximallyCircularQuarticDistinctDistancesStatement := by sorry

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me