Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A smooth integral projective cover of the two-parameter node uv=st

Proved
MvPolynomial.CrossingQuotient.exists_smooth_integral_projective_two_parameter_cover

by tomasz · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrynodal-curvesphilippon-multiplicitysmooth-morphisms

Let KKK be any commutative integral domain, let R=K[s,t]R=K[s,t]R=K[s,t], and let

N=Spec⁡(K[s,t,u,v]/(uv−st)).N=\operatorname{Spec}\bigl(K[s,t,u,v]/(uv-st)\bigr).N=Spec(K[s,t,u,v]/(uv−st)).

There exist an integral scheme YYY and a proper surjective morphism q:Y→Nq:Y\to Nq:Y→N such that YYY is smooth over KKK, with the structure morphism given by qqq followed by the original projection N→Spec⁡KN\to\operatorname{Spec}KN→SpecK.

The same scheme YYY admits a closed immersion into the relative projective line over NNN:

e:Y↪PN1,π∘e=q.e:Y\hookrightarrow\mathbb P^1_N,\qquad \pi\circ e=q.e:Y↪PN1​,π∘e=q.

Thus the particular covering morphism qqq is projective, with a specified relative projective ambient space. No field, perfectness, characteristic, noetherianity or regularity hypothesis on KKK is required. The result concerns relative projectivity over the affine node NNN; it does not assert that YYY is proper over KKK.

This is the two-independent-parameter local case of the nodal boundary-cover construction. General monomial boundary charts and a globally compatible smooth cover remain separate assertions.

Preamble
import Mathlib
import Definitions.Def_MvPolynomial_CrossingResolution
import Definitions.Def_AlgebraicGeometry_ProjSpace
set_option autoImplicit false
set_option backward.isDefEq.respectTransparency.types false
open AlgebraicGeometry CategoryTheory CategoryTheory.Limits
open MvPolynomial MvPolynomial.CrossingQuotient
attribute [local instance] MvPolynomial.gradedAlgebra
universe u
Formal statement
theorem MvPolynomial.CrossingQuotient.exists_smooth_integral_projective_two_parameter_cover (K : Type u) [CommRing K] [IsDomain K] :
    let R := Polynomial (Polynomial K)
    let s : R := Polynomial.X
    let t : R := Polynomial.C Polynomial.X
    ∃ (Y : Scheme.{u}) (q : Y ⟶ Spec (.of (CrossingQuotient R (s * t)))),
      IsIntegral Y ∧ IsProper q ∧ Surjective q ∧
      Smooth (q ≫ Spec.map (CommRingCat.ofHom
        ((algebraMap R (CrossingQuotient R (s * t))).comp
          ((Polynomial.C : Polynomial K →+* R).comp
            (Polynomial.C : K →+* Polynomial K))))) ∧
      ∃ e : Y ⟶ Proj (@MvPolynomial.homogeneousSubmodule (Fin (1 + 1))
        (CrossingQuotient R (s * t))
        (@CommRing.toCommSemiring (CrossingQuotient R (s * t)) inferInstance)),
        IsClosedImmersion e ∧ e ≫ ProjSpace.π (CrossingQuotient R (s * t)) 1 = q := by sorry
Source
Auxiliary two-parameter polynomial-chart case of A. J. de Jong, Smoothness, semi-stability and alterations, Publications Mathématiques de l’IHÉS 83 (1996), Section 3.6, pp. 64-65; https://www.numdam.org/item/PMIHES_1996__83__51_0.pdf . This is a derived local cover theorem for uv=st, not a verbatim numbered assertion. It reuses the Proved arbitrary-ring projective binary factorization https://prove2.me/theorems/531b8729-e3ef-409f-a060-dc1b9f2c6dcd and proves smoothness and integrality of its actual supplied charts and gluing. The result makes no blowup-identification or birationality assertion and does not construct stable moduli or a global alteration.

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