Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Both original infinity sections of the actual mixed quadratic curve

Definition
MazurTransfer_Order13MixedQuadraticOriginalInfinitySectionsData20261019

by Vas · Oct 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrymazur-theoremnumber-theory

The two original reciprocal chart points with coordinates (0,0) and (0,-1), their whole glued-curve section morphisms, and both section identities over every commutative base ring. Nine public declaration types, four whole nonproof values and the private Spec section helper type are checked. Named downstream consumer: rigidification of the actual dyadic integral Picard family.

Definition code
/-
Copyright (c) 2026 Vas and contributors. Released under Apache-2.0.
Design boundary: two actual coefficient-ring sections of the mixed
quadratic glued curve, with reciprocal coordinates (0,0) and (0,-1).
Named downstream consumer: rigidification of its integral Picard family.
Their comparison with the existing rational infinity sections is separate.
-/
import Definitions.Def_MazurTransfer_Order13MixedQuadraticOriginalGluedCurveData20261019

noncomputable section
namespace MazurTransfer.Order13MixedQuadraticInfinitySections
open Polynomial CategoryTheory AlgebraicGeometry
open MixedQuadraticCoordinateJacobian Order13MixedQuadraticJacobianCertificates
open Order13MixedQuadraticPolynomialEvaluations Order13DyadicMixedQuadraticCharts
open Order13MixedQuadraticGluedCurve
universe u
variable (R : Type u) [CommRing R]

def infinityPointZero : reciprocalCoordinateRing R →ₐ[R] R :=
  AdjoinRoot.liftAlgHom (equation R (reciprocalH R) (reciprocalF R)) (aeval (0 : R)) 0 (by
    change eval₂ (aeval (0 : R)).toRingHom 0
      (X ^ 2 + C (reciprocalH R) * X - C (reciprocalF R)) = 0
    simp only [eval₂_sub, eval₂_add, eval₂_mul, eval₂_pow, eval₂_X, eval₂_C]
    rw [map_reciprocalH R _, map_reciprocalF R _]
    simp only [AlgHom.toRingHom_eq_coe, AlgHom.coe_toRingHom, aeval_X]
    ring)

def infinityPointNegOne : reciprocalCoordinateRing R →ₐ[R] R :=
  AdjoinRoot.liftAlgHom (equation R (reciprocalH R) (reciprocalF R)) (aeval (0 : R)) (-1) (by
    change eval₂ (aeval (0 : R)).toRingHom (-1)
      (X ^ 2 + C (reciprocalH R) * X - C (reciprocalF R)) = 0
    simp only [eval₂_sub, eval₂_add, eval₂_mul, eval₂_pow, eval₂_X, eval₂_C]
    rw [map_reciprocalH R _, map_reciprocalF R _]
    simp only [AlgHom.toRingHom_eq_coe, AlgHom.coe_toRingHom, aeval_X]
    ring)

private theorem spec_algHom_section (A : Type u) [CommRing A] [Algebra R A] (φ : A →ₐ[R] R) :
    Spec.map (CommRingCat.ofHom φ.toRingHom) ≫
      Spec.map (CommRingCat.ofHom (algebraMap R A)) = 𝟙 (Spec (.of R)) := by
  have hh : CommRingCat.ofHom (algebraMap R A) ≫ CommRingCat.ofHom φ.toRingHom =
      𝟙 (CommRingCat.of R) := by
    apply CommRingCat.hom_ext
    ext r
    exact φ.commutes r
  rw [← Spec.map_comp, hh, Spec.map_id]

def infinitySectionZero : Spec (.of R) ⟶ curveScheme R :=
  Spec.map (CommRingCat.ofHom (infinityPointZero R).toRingHom) ≫ reciprocalChartMap R

def infinitySectionNegOne : Spec (.of R) ⟶ curveScheme R :=
  Spec.map (CommRingCat.ofHom (infinityPointNegOne R).toRingHom) ≫ reciprocalChartMap R

theorem infinitySectionZero_comp : infinitySectionZero R ≫ curveToBase R = 𝟙 (Spec (.of R)) := by
  let t : Spec (.of R) ⟶ reciprocalScheme R := Spec.map (CommRingCat.ofHom (infinityPointZero R).toRingHom)
  have ht : t ≫ reciprocalToBase R = 𝟙 (Spec (.of R)) :=
    spec_algHom_section R (reciprocalCoordinateRing R) (infinityPointZero R)
  have he : t ≫ (reciprocalChartMap R ≫ curveToBase R) = t ≫ reciprocalToBase R :=
    congrArg (fun g : reciprocalScheme R ⟶ Spec (.of R) => t ≫ g) (reciprocalChartMap_curveToBase R)
  change (t ≫ reciprocalChartMap R) ≫ curveToBase R = 𝟙 (Spec (.of R))
  exact (Category.assoc t (reciprocalChartMap R) (curveToBase R)).trans (he.trans ht)


theorem infinitySectionNegOne_comp : infinitySectionNegOne R ≫ curveToBase R = 𝟙 (Spec (.of R)) := by
  let t : Spec (.of R) ⟶ reciprocalScheme R := Spec.map (CommRingCat.ofHom (infinityPointNegOne R).toRingHom)
  have ht : t ≫ reciprocalToBase R = 𝟙 (Spec (.of R)) :=
    spec_algHom_section R (reciprocalCoordinateRing R) (infinityPointNegOne R)
  have he : t ≫ (reciprocalChartMap R ≫ curveToBase R) = t ≫ reciprocalToBase R :=
    congrArg (fun g : reciprocalScheme R ⟶ Spec (.of R) => t ≫ g) (reciprocalChartMap_curveToBase R)
  change (t ≫ reciprocalChartMap R) ≫ curveToBase R = 𝟙 (Spec (.of R))
  exact (Category.assoc t (reciprocalChartMap R) (curveToBase R)).trans (he.trans ht)


end MazurTransfer.Order13MixedQuadraticInfinitySections
#print axioms MazurTransfer.Order13MixedQuadraticInfinitySections.infinitySectionZero_comp
#print axioms MazurTransfer.Order13MixedQuadraticInfinitySections.infinitySectionNegOne_comp
Source
MazurTheorem Order13MixedQuadraticInfinitySections; Vas and contributors; Apache-2.0.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me