Multiplication matrices and the characteristic polynomial of the time coordinate
ProvedWeierstrassEllipticZeta.triangular_multiplication_matrixLet and let be an ideal of . Let be monic, set , and let . Write for substitution of and for substitution of . Assume the exact membership criterion
Let and let be complex-linear. Assume that, whenever and , one has . Suppose is a basis of , indexed by , with
There exists a complex-algebra homomorphism such that is the matrix of multiplication by in the basis . Its entries are
and its kernel is exactly :
Writing , one has
Here denotes a residue class and denotes a coefficient. Polynomial evaluation at a matrix uses scalar matrices for coefficients. The remainder is division by the monic polynomial . The case , with zero-size matrices and characteristic polynomial , is included. All presentation, uniqueness and basis hypotheses are explicit.
import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.Algebra.Polynomial.Div import Mathlib.Data.Complex.Basic import Mathlib.LinearAlgebra.Matrix.ToLin import Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff import Mathlib.RingTheory.Ideal.Quotient.Operations open scoped Classical
theorem WeierstrassEllipticZeta.triangular_multiplication_matrix
(I : Ideal (MvPolynomial (Fin 4) ℂ)) (M : Polynomial ℂ)
(hM : M.Monic) (r : Fin 3 → Polynomial ℂ)
(hmem : ∀ p : MvPolynomial (Fin 4) ℂ,
p ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) p)
(q : MvPolynomial (Fin 4) ℂ)
(T : MvPolynomial (Fin 4) ℂ →ₗ[ℂ] Polynomial ℂ)
(hunique : ∀ (p : MvPolynomial (Fin 4) ℂ) (b : Polynomial ℂ),
b.degree < (M.natDegree : ℕ) →
p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b * q ∈ I → b = T p)
(β : Module.Basis (Fin M.natDegree) ℂ (MvPolynomial (Fin 4) ℂ ⧸ I))
(hβ : ∀ j : Fin M.natDegree,
β j = Ideal.Quotient.mk I ((MvPolynomial.X (0 : Fin 4)) ^ j.val * q))
(hcoord : ∀ (p : MvPolynomial (Fin 4) ℂ) (i : Fin M.natDegree),
β.repr (Ideal.Quotient.mk I p) i = (T p).coeff i.val) :
∃ ρ : MvPolynomial (Fin 4) ℂ →ₐ[ℂ] Matrix (Fin M.natDegree) (Fin M.natDegree) ℂ,
(∀ p : MvPolynomial (Fin 4) ℂ,
ρ p = Algebra.leftMulMatrix β (Ideal.Quotient.mk I p)) ∧
(∀ (p : MvPolynomial (Fin 4) ℂ) (i j : Fin M.natDegree),
ρ p i j = ((MvPolynomial.aeval (Fin.cons Polynomial.X r) p *
Polynomial.X ^ j.val) %ₘ M).coeff i.val) ∧
(∀ p : MvPolynomial (Fin 4) ℂ, ρ p = 0 ↔ p ∈ I) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
ρ p = Polynomial.aeval (ρ (MvPolynomial.X (0 : Fin 4)))
(MvPolynomial.aeval (Fin.cons Polynomial.X r) p)) ∧
(ρ (MvPolynomial.X (0 : Fin 4))).charpoly = M := by sorry