Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The quartic distinct-distance proposition

Definition
Esgk_MaximallyCircularQuarticBootstrap

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

algebraic-geometryfinite-combinatoricsincidence-geometry

This defines the proposition asserting positive universal natural constants T,CT,CT,C such that N4≤Cd4D(S)3N^4\le C d^4 D(S)^3N4≤Cd4D(S)3 whenever Td5≤N2Td^5\le N^2Td5≤N2. Here SSS is an NNN-point sample on the real zero set of an irreducible, absolutely irreducible, noncircular maximally circular polynomial of degree ddd, and D(S)D(S)D(S) counts its positive distinct distances.

Definition code
-- Extracted dependency interfaces and their necessary proofs.
import Definitions.Def_Esgk_DistanceDeficiencyNewton
import Definitions.Def_Esgk_DistanceNewtonFactorSaturation
import Definitions.Def_Esgk_MaximallyCircularCurveDistinctDistances
import Definitions.Def_Esgk_PlanarGeneralPosition
import Definitions.Def_Esgk_PlaneCircleFactor
import Definitions.Def_Esgk_PlaneNonabsoluteRealPointBound
import Definitions.Def_LeanFormalizations_PachDeZeeuw_AlgebraicPrelim
import Definitions.Def_LeanFormalizations_PachDeZeeuw_CurveInterface
import Mathlib

/-
Copyright (c) 2026 Adam McKenna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam McKenna
-/


noncomputable section

namespace Esgk

open Filter PachDeZeeuw.Algebraic

variable {n : ℕ}

 
def MaximallyCircularQuarticDistinctDistancesStatement : Prop :=
  ∃ T C : ℕ, 0 < T ∧ 0 < C ∧
    ∀ (G : PlanePoly) (S : Finset PachDeZeeuw.Algebraic.Point2),
      Irreducible G →
      IsAbsolutelyIrreducible G →
      ¬ IsCircleFactor G →
      IsMaximallyCircular G →
      (S : Set PachDeZeeuw.Algebraic.Point2) ⊆ PlaneCurveZeroSet G →
      T * G.totalDegree ^ 5 ≤ S.card ^ 2 →
        S.card ^ 4 ≤ C * G.totalDegree ^ 4 * (EuclideanGeometry.distinctDistances S) ^ 3


end Esgk

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