Four triangular ideal generators from unique bounded time representatives
ProvedWeierstrassEllipticZeta.time_normal_form_triangular_generatorsLet and let send to . Fix an ideal , an integer , and a monic polynomial of degree , with .
Suppose that every polynomial residue class modulo has a unique time-polynomial representative of degree less than : for every , there is a unique such that
Then there are polynomials , each of degree less than , such that
Moreover, for every there is the exact membership test
The are the unique bounded time representatives of the coordinate variables. Modulo the displayed four generators, substituting leaves every polynomial unchanged. Division by the monic and uniqueness of the degree-bounded representative show that the time polynomials in are precisely the multiples of . Together these facts prove the generator equality and the membership criterion.
Formalization Note This is a general commutative-algebra lemma specialized to four variables over . Its hypotheses are supplied by the contact normal forms in the elliptic-extension application; no analytic or elliptic properties are assumed in this statement. Degree means Polynomial.degree, with bottom value for zero. The case is included and forces , , and all . The three Lean indices i : Fin 3 use i.succ for variables . The statement proves an ideal presentation and divisibility criterion; it does not assert a regular-sequence theorem or the global multiplicity estimate.
import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.Algebra.Polynomial.Div import Mathlib.Data.Complex.Basic import Mathlib.RingTheory.Ideal.Span
theorem WeierstrassEllipticZeta.time_normal_form_triangular_generators
(I : Ideal (MvPolynomial (Fin 4) ℂ)) (d : ℕ) (M : Polynomial ℂ)
(hM : M.Monic) (hdegree : M.degree = (d : ℕ))
(hMI : Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) M ∈ I)
(hrep : ∀ p : MvPolynomial (Fin 4) ℂ, ∃! q : Polynomial ℂ,
q.degree < (d : ℕ) ∧ p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) q ∈ I) :
∃ r : Fin 3 → Polynomial ℂ,
(∀ i, (r i).degree < (d : ℕ)) ∧
I = Ideal.span (insert (Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) M)
(Set.range (fun i : Fin 3 => MvPolynomial.X i.succ -
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (r i)))) ∧
∀ p : MvPolynomial (Fin 4) ℂ,
p ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) p := by sorry