Zariski closure of the curve in the chart of
ProvedCurveSymmetry.reciprocal_affine_points_closureLet be an integer and let be arbitrary. Let be the polynomial of equation (6). Near , use the chart of with coordinates , where and , and put , which equals . Let be the prime spectrum of the polynomial ring in the chart coordinates, with its Zariski topology; for let be the maximal ideal of the polynomials vanishing at , and let be the set of prime ideals containing .
Then the closure of the points of the affine curve off both coordinate axes, written in the chart coordinates, is the whole zero locus of :
This is one of the chart computations behind , the closure of the curve (6) in , which the note introduces before Lemma 4: in the chart around the boundary point , the closure of the affine curve is cut out by . Gluing the charts into a global statement is a separate step.
Formalization Note: points of are sent into the prime spectrum by , the kernel of evaluation at ; the closure and the zero locus are taken in Mathlib's prime spectrum with its Zariski topology, non-closed points included.
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.Nullstellensatz import Mathlib.RingTheory.Polynomial.Eisenstein.Criterion import Mathlib.RingTheory.Polynomial.GaussLemma import Mathlib.RingTheory.RootsOfUnity.Complex import Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots import Mathlib.RingTheory.Spectrum.Prime.Jacobson import Mathlib.RingTheory.Spectrum.Prime.Topology import Mathlib.Tactic open CurveSymmetry set_option autoImplicit false open MvPolynomial
theorem CurveSymmetry.reciprocal_affine_points_closure {m : ℕ} (hm : 0 < m) (α : ℂ) :
closure ((fun z : Fin 2 → ℂ => affineSpectrumPoint ![(z 0)⁻¹, (z 1)⁻¹]) ''
{z | eval z (familyPolynomial m α) = 0 ∧ z 0 ≠ 0 ∧ z 1 ≠ 0}) =
PrimeSpectrum.zeroLocus ({familyInfinityPolynomial m α} : Set BPoly) := by sorry