Characteristic polynomials, traces and nilpotence of contact multiplication matrices
ProvedWeierstrassEllipticZeta.triangular_multiplication_spectrumLet , let be a finite set of points of , and give each point a nonnegative integer multiplicity . Let and let be a complex-algebra homomorphism satisfying
Then every multiplication matrix has characteristic polynomial and trace
Its spectrum consists exactly of the values at points with .
Moreover, is nilpotent if and only if at every point of positive multiplicity. Whenever these values vanish, the explicit bound
holds.
The statement allows zero multiplicities, repeated values of , and the empty contact set. In the empty case the hypotheses force , so the characteristic polynomial is and the spectrum is empty. These assertions do not require diagonalizability. This is a derived algebraic lemma for the contact-quotient construction in the mission.
import Mathlib.Algebra.CharZero.Infinite import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.Data.Complex.Basic import Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff import Mathlib.LinearAlgebra.Matrix.Charpoly.Eigs open scoped Classical
theorem WeierstrassEllipticZeta.triangular_multiplication_spectrum
(V : Finset (Fin 4 → ℂ)) (e : V → ℕ) (d : ℕ)
(ρ : MvPolynomial (Fin 4) ℂ →ₐ[ℂ] Matrix (Fin d) (Fin d) ℂ)
(hdet : ∀ p : MvPolynomial (Fin 4) ℂ,
(ρ p).det = ∏ v : V, (MvPolynomial.eval v.val p) ^ e v) :
(∀ p : MvPolynomial (Fin 4) ℂ,
(ρ p).charpoly = ∏ v : V,
(Polynomial.X - Polynomial.C (MvPolynomial.eval v.val p)) ^ e v) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
(ρ p).trace = ∑ v : V, (e v : ℂ) * MvPolynomial.eval v.val p) ∧
(∀ (p : MvPolynomial (Fin 4) ℂ) (z : ℂ),
z ∈ spectrum ℂ (ρ p) ↔ ∃ v : V, 0 < e v ∧ z = MvPolynomial.eval v.val p) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
IsNilpotent (ρ p) ↔ ∀ v : V, 0 < e v → MvPolynomial.eval v.val p = 0) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
(∀ v : V, 0 < e v → MvPolynomial.eval v.val p = 0) → (ρ p) ^ d = 0) := by sorry