Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Characteristic polynomials, traces and nilpotence of contact multiplication matrices

Proved
WeierstrassEllipticZeta.triangular_multiplication_spectrum

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

commutative-algebraelliptic-functionstranscendencezero-estimates

Let A=C[x0,x1,x2,x3]A=\mathbb C[x_0,x_1,x_2,x_3]A=C[x0​,x1​,x2​,x3​], let VVV be a finite set of points of C4\mathbb C^4C4, and give each point a nonnegative integer multiplicity eve_vev​. Let d≥0d\ge0d≥0 and let ρ:A⟶Mat⁡d(C)\rho:A\longrightarrow\operatorname{Mat}_d(\mathbb C)ρ:A⟶Matd​(C) be a complex-algebra homomorphism satisfying

det⁡ρ(p)=∏v∈Vp(v)ev(p∈A).\det\rho(p)=\prod_{v\in V}p(v)^{e_v}\qquad(p\in A).detρ(p)=v∈V∏​p(v)ev​(p∈A).

Then every multiplication matrix has characteristic polynomial and trace

χρ(p)(t)=∏v∈V(t−p(v))ev,tr⁡ρ(p)=∑v∈Vevp(v).\chi_{\rho(p)}(t)=\prod_{v\in V}(t-p(v))^{e_v},\qquad \operatorname{tr}\rho(p)=\sum_{v\in V}e_vp(v).χρ(p)​(t)=v∈V∏​(t−p(v))ev​,trρ(p)=v∈V∑​ev​p(v).

Its spectrum consists exactly of the values p(v)p(v)p(v) at points with ev>0e_v>0ev​>0.

Moreover, ρ(p)\rho(p)ρ(p) is nilpotent if and only if p(v)=0p(v)=0p(v)=0 at every point of positive multiplicity. Whenever these values vanish, the explicit bound

ρ(p)d=0\rho(p)^d=0ρ(p)d=0

holds.

The statement allows zero multiplicities, repeated values of ppp, and the empty contact set. In the empty case the hypotheses force d=0d=0d=0, so the characteristic polynomial is 111 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.

Preamble
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
Formal statement
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
Source
Derived finite-algebra lemma for the approach associated with Senthil Kumar K (2026), Appendix A and Theorem A.2, https://doi.org/10.1017/S001309152610145X. Proved here for a complex-algebra representation satisfying the contact determinant product formula. This lemma is not quoted from the article. It computes every characteristic polynomial and trace, identifies the spectrum, and proves nilpotence precisely when all positive-multiplicity point values vanish, with exponent bounded by matrix size. Primary Mathlib references: Polynomial.funext, Matrix.eval_charpoly, trace_eq_sum_roots_charpoly_of_splits, mem_spectrum_iff_isRoot_charpoly, aeval_self_charpoly, and isNilpotent_charpoly_sub_pow_of_isNilpotent. No Prove2Me theorem dependencies or new definitions.

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