Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The lowest-degree part of aXm+bYm+XY(cXm+dYm)aX^m+bY^m+XY(cX^m+dY^m)aXm+bYm+XY(cXm+dYm) is aXm+bYmaX^m+bY^maXm+bYm, and atm+bat^m+batm+b is separable

Proved
CurveSymmetry.fourTermForm_tangent_data

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

algebraic-geometrycurve-symmetry-leaneuclidean-geometry

Let m≥1m\ge1m≥1 be an integer, let a,b∈Ca,b\in\mathbb Ca,b∈C be nonzero and c,d∈Cc,d\in\mathbb Cc,d∈C arbitrary, and let F(X,Y)=aXm+bYm+XY (cXm+dYm)∈C[X,Y]F(X,Y)=aX^m+bY^m+XY\,(cX^m+dY^m)\in\mathbb C[X,Y]F(X,Y)=aXm+bYm+XY(cXm+dYm)∈C[X,Y]. For n≥0n\ge0n≥0 let FnF_nFn​ be the homogeneous component of FFF of degree nnn.

Then:

  1. Fn=0F_n=0Fn​=0 for every n<mn<mn<m;
  2. Fm=aXm+bYmF_m=aX^m+bY^mFm​=aXm+bYm;
  3. aXm+bYm≠0aX^m+bY^m\ne0aXm+bYm=0;
  4. the one-variable polynomial atm+b∈C[t]at^m+b\in\mathbb C[t]atm+b∈C[t] is separable, i.e. it has mmm distinct roots.

In short,

Fn=0  (n<m),Fm=aXm+bYm≠0,atm+b separable.F_n=0\ \ (n<m),\qquad F_m=aX^m+bY^m\ne0,\qquad at^m+b\ \text{separable}.Fn​=0  (n<m),Fm​=aXm+bYm=0,atm+b separable.

So the origin is an mmm-fold point of F=0F=0F=0 whose tangent cone aXm+bYmaX^m+bY^maXm+bYm consists of mmm distinct lines. Applied to PαP_\alphaPα​, where (a,b)=(α,αˉ)(a,b)=(\alpha,\bar\alpha)(a,b)=(α,αˉ), and to its equation um+vm+uv(αˉum+αvm)u^m+v^m+uv(\bar\alpha u^m+\alpha v^m)um+vm+uv(αˉum+αvm) in the coordinates u=1/Xu=1/Xu=1/X, v=1/Yv=1/Yv=1/Y, it gives the tangent cones αXm+αˉYm\alpha X^m+\bar\alpha Y^mαXm+αˉYm and um+vmu^m+v^mum+vm of Lemma 4 at (0,0)(0,0)(0,0) and (∞,∞)(\infty,\infty)(∞,∞), both ordinary mmm-fold points.

Preamble
import Definitions.Def_CurveSymmetry_01_RealLoci
import Definitions.Def_CurveSymmetry_02_FamilyBasics
import Definitions.Def_CurveSymmetry_03_IsometriesAndCharts
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

open CurveSymmetry
set_option autoImplicit false
open MvPolynomial
Formal statement
theorem CurveSymmetry.fourTermForm_tangent_data {m : ℕ} (hm : 0 < m) {a b : ℂ}
    (ha : a ≠ 0) (hb : b ≠ 0) (c d : ℂ) :
    (∀ n < m, homogeneousComponent n (fourTermForm m a b c d) = 0) ∧
      homogeneousComponent m (fourTermForm m a b c d) = binaryForm m a b ∧
      binaryForm m a b ≠ 0 ∧
      Polynomial.Separable (Polynomial.C a * Polynomial.X ^ m + Polynomial.C b) := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, for proof of Lemma 4, p. 3; 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/FamilyCharts.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