Balanced intrinsic cell covers on a maximally circular curve
ProvedEsgk.maximallyCircular_exists_balancedIntrinsicCellCoverLet be an irreducible and absolutely irreducible real plane polynomial of degree , with real zero set . Assume that is not a circle factor and is maximally circular: its local order at each of the two complex circular points at infinity is . Let be a finite sample with .
There is one disjoint split into nonempty sets, satisfying
Both point sets lie on . The incidence configuration uses as both carrier curves, each represented by the same irreducible degree- polynomial . 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 with and , there are a finite set of cells , target sets , label sets , and an exceptional set with the following properties. A label is incident with a target when .
- .
- Every target outside belongs to some with .
- Every label incident with a target in belongs to .
- .
- for every .
- .
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)
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