Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The local ring of w2=h(t)w^2=h(t)w2=h(t) at a point (c,d)(c,d)(c,d) contains 1/t1/t1/t if and only if c≠0c\ne0c=0

Proved
CurveSymmetry.quadPlace_X_inv_mem_iff

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

curve-symmetry-leanfunction-fieldsvaluation-theory

Let h∈C[t]h\in\mathbb C[t]h∈C[t] be squarefree and such that W2−h(t)W^2-h(t)W2−h(t) is irreducible in C(t)[W]\mathbb C(t)[W]C(t)[W], and let Lh=C(t)[W]/(W2−h(t))L_h=\mathbb C(t)[W]/(W^2-h(t))Lh​=C(t)[W]/(W2−h(t)). For c,d∈Cc,d\in\mathbb Cc,d∈C with d2=h(c)d^2=h(c)d2=h(c), let Oc,d⊆Lh\mathcal O_{c,d}\subseteq L_hOc,d​⊆Lh​ be the local ring of the point (c,d)(c,d)(c,d) of w2=h(t)w^2=h(t)w2=h(t): the localization of C[t][W]/(W2−h(t))\mathbb C[t][W]/(W^2-h(t))C[t][W]/(W2−h(t)) at the kernel of the evaluation t↦ct\mapsto ct↦c, W↦dW\mapsto dW↦d, viewed inside LhL_hLh​. Then

t−1∈Oc,d  ⟺  c≠0.t^{-1}\in\mathcal O_{c,d}\iff c\ne0.t−1∈Oc,d​⟺c=0.

It is used in the coordinate s=1/ts=1/ts=1/t, for the double cover rewritten as w′2=hαˉ(s)w'^2=h_{\bar\alpha}(s)w′2=hαˉ​(s), to identify the place at infinity of the double cover (7) when its places are classified, for Lemma 4 and Remark 5.

Formalization Note: the two hypotheses on hhh are Fact instances.

Preamble
import Definitions.Def_CurveSymmetry_01_RealLoci
import Definitions.Def_CurveSymmetry_02_FamilyBasics
import Definitions.Def_CurveSymmetry_03_IsometriesAndCharts
import Definitions.Def_CurveSymmetry_05_FamilyFunctionField
import Definitions.Def_CurveSymmetry_06_QuadraticRing
import Definitions.Def_CurveSymmetry_07_Places
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.Algebra.Polynomial.SpecificDegree
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.RatFunc.Basic
import Mathlib.FieldTheory.Separable
import Mathlib.RingTheory.AdjoinRoot
import Mathlib.RingTheory.DedekindDomain.Dvr
import Mathlib.RingTheory.DiscreteValuationRing.TFAE
import Mathlib.RingTheory.Localization.AsSubring
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.RingTheory.Valuation.ValuationSubring
import Mathlib.Tactic

open CurveSymmetry
set_option autoImplicit false
open Polynomial
open scoped nonZeroDivisors
variable {m : ℕ} {α : ℂ} [hm : Fact (0 < m)] [ha : Fact (α ≠ star α)]
Formal statement
theorem CurveSymmetry.quadPlace_X_inv_mem_iff (h : ℂ[X]) [Fact (Squarefree h)] [Fact (Irreducible (quadRat h))]
    (c d : ℂ) (hd : d ^ 2 = h.eval c) :
    (algebraMap ℂ[X] (QuadField h) X)⁻¹ ∈ quadPlace h c d hd ↔ c ≠ 0 := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, for proof of Lemma 4, equation (7), 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/QuadraticInfinity.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