Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weierstrass line in the additive plane: exact Hilbert degree

Proved
WeierstrassEllipticZeta.additive_line_hilbert_degree

by tomasz · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometryelliptic-curveshilbert-polynomial

Let p(t) in the product of projective spaces P¹ × P⁴ have homogeneous coordinates ([1:a t], [0:0:1:0:ρ+b t]), where a and b are not both zero. For every pair of natural block degrees (m,n), its actual factorial-normalized Hilbert degree is m when b=0, n when a=0, and m+n when both are nonzero. The parameter ρ allows an arbitrary choice of origin in the vertical affine chart. The degree is computed from the multigraded quotient by the homogeneous vanishing ideal.

Preamble
import Definitions.Def_PhilipponMultiplicity_Degree
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveExtensionFiberModel

set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
open PhilipponMultiplicity MvPolynomial
Formal statement
theorem WeierstrassEllipticZeta.additive_line_hilbert_degree (a b ρ : ℂ) (hne : a ≠ 0 ∨ b ≠ 0)
    (p : ℂ → (@MultiProjectiveSpace.mk ℂ 2 (by decide) ![1, 4]).Point)
    (hp : ∀ t, (∃ h : ![1, a * t] ≠ (0 : Fin 2 → ℂ),
        Projectivization.mk ℂ ![1, a * t] h = p t (0 : Fin 2)) ∧
      (∃ h : ![0, 0, 1, 0, ρ + b * t] ≠ (0 : Fin 5 → ℂ),
        Projectivization.mk ℂ ![0, 0, 1, 0, ρ + b * t] h = p t (1 : Fin 2))) (D : Fin 2 → ℕ) :
    Hilbert.degreeValue ℂ 2 ![1, 4]
      ((@MultiProjectiveSpace.mk ℂ 2 (by decide) ![1, 4]).vanishingIdeal (Set.range p)) D =
        (if a = 0 then 0 else (D 0 : ℚ)) + (if b = 0 then 0 else (D 1 : ℚ)) := by sorry
Source
Supporting degree computation for Lemma A.1 and Proposition A.1 of the Senthil Kumar mission; https://doi.org/10.1017/S001309152610145X, Appendix A.

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