Explicit weighted time basis and coordinates of a finite quotient
ProvedWeierstrassEllipticZeta.triangular_weighted_time_basisLet , let be an ideal of , let , and let . Write for substitution of for .
Suppose is complex-linear and, for every , is the unique polynomial of degree below satisfying
More explicitly, assume the degree bound and congruence for , and that every polynomial of degree below with equals .
Then has a basis indexed by given by
Each displayed polynomial representative has total degree at most . For every , the th coordinate of in this basis is the coefficient of in . In particular,
Here brackets around a multivariate polynomial denote its residue class, and denotes a coefficient. Natural subtraction is truncated; polynomial degree at zero is . The case is included, with the empty basis of the zero quotient. No additional geometric hypotheses are implicit.
import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Algebra.MvPolynomial.Degrees import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.Data.Complex.Basic import Mathlib.LinearAlgebra.Isomorphisms import Mathlib.LinearAlgebra.Dimension.StrongRankCondition import Mathlib.RingTheory.Ideal.Quotient.Operations import Mathlib.RingTheory.Polynomial.DegreeLT open scoped Classical
theorem WeierstrassEllipticZeta.triangular_weighted_time_basis
(I : Ideal (MvPolynomial (Fin 4) ℂ)) (d : ℕ) (q : MvPolynomial (Fin 4) ℂ)
(T : MvPolynomial (Fin 4) ℂ →ₗ[ℂ] Polynomial ℂ)
(hrep : ∀ p : MvPolynomial (Fin 4) ℂ, (T p).degree < (d : ℕ) ∧
p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (T p) * q ∈ I ∧
∀ b : Polynomial ℂ, b.degree < (d : ℕ) →
p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b * q ∈ I → b = T p) :
∃ β : Module.Basis (Fin d) ℂ (MvPolynomial (Fin 4) ℂ ⧸ I),
(∀ i : Fin d, β i = Ideal.Quotient.mk I ((MvPolynomial.X (0 : Fin 4)) ^ i.val * q) ∧
((MvPolynomial.X (0 : Fin 4)) ^ i.val * q).totalDegree ≤ d - 1 + q.totalDegree) ∧
(∀ (p : MvPolynomial (Fin 4) ℂ) (i : Fin d),
β.repr (Ideal.Quotient.mk I p) i = (T p).coeff i.val) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
Ideal.Quotient.mk I p = ∑ i : Fin d,
(T p).coeff i.val • Ideal.Quotient.mk I ((MvPolynomial.X (0 : Fin 4)) ^ i.val * q)) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ I) = d := by sorry