Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The tangent cones αXm+αˉYm\alpha X^m+\bar\alpha Y^mαXm+αˉYm and um+vmu^m+v^mum+vm each vanish at exactly mmm points of P1\mathbb{P}^1P1

Proved
CurveSymmetry.family_diagonal_tangent_direction_counts

by carlok · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrycurve-symmetry-leanzariski-topology

Let m≥1m\ge 1m≥1 be an integer and let α∈C\alpha\in\mathbb{C}α∈C with α≠αˉ\alpha\ne\bar\alphaα=αˉ. For a,b∈Ca,b\in\mathbb{C}a,b∈C let Dm(a,b)={[x:y]∈P1(C):axm+bym=0}D_m(a,b)=\{[x:y]\in\mathbb{P}^1(\mathbb{C}) : ax^m+by^m=0\}Dm​(a,b)={[x:y]∈P1(C):axm+bym=0} be the set of points of the complex projective line at which the binary form axm+bymax^m+by^maxm+bym vanishes (a well-defined condition, since the form is homogeneous).

Then

#Dm(α,αˉ)=mand#Dm(1,1)=m:\#D_m(\alpha,\bar\alpha)=m\qquad\text{and}\qquad\#D_m(1,1)=m:#Dm​(α,αˉ)=mand#Dm​(1,1)=m:

each of the binary forms αxm+αˉym\alpha x^m+\bar\alpha y^mαxm+αˉym and xm+ymx^m+y^mxm+ym vanishes at exactly mmm points of P1(C)\mathbb{P}^1(\mathbb{C})P1(C).

In the proof of Lemma 4 of the note, αXm+αˉYm\alpha X^m+\bar\alpha Y^mαXm+αˉYm and um+vmu^m+v^mum+vm, with u=1/Xu=1/Xu=1/X and v=1/Yv=1/Yv=1/Y, are the tangent cones at (0,0)(0,0)(0,0) and (∞,∞)(\infty,\infty)(∞,∞) of VαV_\alphaVα​, the closure in P1×P1\mathbb{P}^1\times\mathbb{P}^1P1×P1 of the curve Xm(α+XY)+Ym(αˉ+XY)=0X^m(\alpha+XY)+Y^m(\bar\alpha+XY)=0Xm(α+XY)+Ym(αˉ+XY)=0. The statement gives the mmm distinct tangent directions at each of these two ordinary mmm-fold points.

Formalization Note: P1(C)\mathbb{P}^1(\mathbb{C})P1(C) is the projectivization of C2\mathbb{C}^2C2; membership is tested on a chosen representative vector of each point, and the counts are Nat.card, so finiteness is included.

Preamble
import Definitions.Def_CurveSymmetry_01_RealLoci
import Definitions.Def_CurveSymmetry_02_FamilyBasics
import Definitions.Def_CurveSymmetry_03_IsometriesAndCharts
import Definitions.Def_CurveSymmetry_04_ProjectiveClosure
import Mathlib.Algebra.MvPolynomial.Nilpotent
import Mathlib.Algebra.MvPolynomial.NoZeroDivisors
import Mathlib.Algebra.MvPolynomial.PDeriv
import Mathlib.Algebra.Polynomial.FieldDivision
import Mathlib.Algebra.Polynomial.Reverse
import Mathlib.Analysis.Complex.Isometry
import Mathlib.Analysis.Complex.OperatorNorm
import Mathlib.Analysis.Complex.Polynomial.Basic
import Mathlib.Analysis.Normed.Affine.MazurUlam
import Mathlib.Data.Complex.Basic
import Mathlib.FieldTheory.Separable
import Mathlib.RingTheory.MvPolynomial.Homogeneous
import Mathlib.RingTheory.MvPolynomial.IrreducibleQuadratic
import Mathlib.RingTheory.Polynomial.Eisenstein.Criterion
import Mathlib.RingTheory.Polynomial.GaussLemma
import Mathlib.RingTheory.RootsOfUnity.Complex
import Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
import Mathlib.Tactic
import Mathlib.Topology.Compactification.OnePoint.ProjectiveLine

open CurveSymmetry
set_option autoImplicit false
open OnePoint
Formal statement
theorem CurveSymmetry.family_diagonal_tangent_direction_counts {m : ℕ} (hm : 0 < m) {α : ℂ}
    (ha : α ≠ star α) :
    Nat.card (binaryTangentDirections m α (star α)) = m ∧
      Nat.card (binaryTangentDirections m 1 1) = m := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, for Lemma 4, p. 3, https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/sharp_symmetry_bounds.pdf. Lean: https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/lean/BinaryTangentDirections.lean (C. Perassi)

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