Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Balanced intrinsic cell covers on a maximally circular curve

Proved
Esgk.maximallyCircular_exists_balancedIntrinsicCellCover

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

combinatoricsgeometry

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. Let S⊂CS\subset CS⊂C be a finite sample with N=∣S∣≥2N=|S|\ge 2N=∣S∣≥2.

There is one disjoint split S=P1⊔P2S=P_1\sqcup P_2S=P1​⊔P2​ into nonempty sets, satisfying

∣P1∣≤2∣P2∣,∣P2∣≤2∣P1∣,|P_1|\le 2|P_2|,\qquad |P_2|\le 2|P_1|,∣P1​∣≤2∣P2​∣,∣P2​∣≤2∣P1​∣,

Both point sets lie on CCC. The incidence configuration uses CCC as both carrier curves, each represented by the same irreducible degree-ddd polynomial GGG. The real curve is neither a line nor a circle, so the line- and circle-specific normalization conditions impose no additional restriction on the split. This split is chosen independently of the scale below.

For every integer jjj with 24d≤j24d\le j24d≤j and jd<Njd<Njd<N, there are a finite set of cells Ω\OmegaΩ, target sets Qω⊂P2×P2Q_\omega\subset P_2\times P_2Qω​⊂P2​×P2​, label sets Lω⊂P1×P1L_\omega\subset P_1\times P_1Lω​⊂P1​×P1​, and an exceptional set B⊂P2×P2B\subset P_2\times P_2B⊂P2​×P2​ with the following properties. A label (a,b)(a,b)(a,b) is incident with a target (p,q)(p,q)(p,q) when ∥a−p∥2=∥b−q∥2\|a-p\|^2=\|b-q\|^2∥a−p∥2=∥b−q∥2.

  1. ∣B∣≤4d2N|B|\le 4d^2N∣B∣≤4d2N.
  2. Every target outside BBB belongs to some QωQ_\omegaQω​ with ω∈Ω\omega\in\Omegaω∈Ω.
  3. Every label incident with a target in QωQ_\omegaQω​ belongs to LωL_\omegaLω​.
  4. ∣Ω∣≤2d2j2|\Omega|\le 2d^2j^2∣Ω∣≤2d2j2.
  5. ∣Qω∣≤4N2/(d2j2)|Q_\omega|\le 4N^2/(d^2j^2)∣Qω​∣≤4N2/(d2j2) for every ω∈Ω\omega\in\Omegaω∈Ω.
  6. ∑ω∈Ω∣Lω∣≤20d2jN2\sum_{\omega\in\Omega}|L_\omega|\le 20d^2jN^2∑ω∈Ω​∣Lω​∣≤20d2jN2.
Preamble
import Definitions.Def_Esgk_DistanceNewtonFactorSaturation
import Definitions.Def_Esgk_MaximallyCircularIntrinsicCellCover
import Definitions.Def_Esgk_PachDeZeeuwQuadraticDegree
import Definitions.Def_Esgk_PlaneCircleFactor
import Definitions.Def_Esgk_PlaneNonabsoluteRealPointBound
import Definitions.Def_LeanFormalizations_PachDeZeeuw_AlgebraicPrelim
import Definitions.Def_LeanFormalizations_PachDeZeeuw_Basic
import Definitions.Def_LeanFormalizations_PachDeZeeuw_CurveInterface

open Esgk
open PachDeZeeuw (PreparedBipartiteInput)
open PachDeZeeuw.Algebraic (PlanePoly PlaneCurveZeroSet)

Formal statement
theorem Esgk.maximallyCircular_exists_balancedIntrinsicCellCover
    {G : PlanePoly} (hG : Irreducible G) (hAbs : IsAbsolutelyIrreducible G)
    (hNotCircle : ¬ IsCircleFactor G) (hMax : IsMaximallyCircular G)
    (S : Finset PachDeZeeuw.Algebraic.Point2)
    (hS : (S : Set PachDeZeeuw.Algebraic.Point2) ⊆ PlaneCurveZeroSet G)
    (hcard : 2 ≤ S.card) :
    ∃ X : PreparedBipartiteInput G.totalDegree,
      SelfCurvePreparedInput X ∧
      X.C₂ = PlaneCurveZeroSet G ∧
      Disjoint X.P₁ X.P₂ ∧ X.P₁ ∪ X.P₂ = S ∧
      X.P₁.card ≤ 2 * X.P₂.card ∧
      X.P₂.card ≤ 2 * X.P₁.card ∧
      0 < X.P₁.card * X.P₂.card ∧
      ∀ j : ℕ, 24 * G.totalDegree ≤ j → j * G.totalDegree < S.card →
        Nonempty (IntrinsicAuxiliaryCellCover X S.card j) := 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