Characteristic polynomials of endomorphisms adjoint under a perfect pairing:
ProvedMatrix.charpolyRev_of_transpose_mul_mul_eq_smulLet be a field, let be an matrix and an matrix over , and let be an matrix that has a two-sided inverse . Thus , and the bilinear pairing on is perfect. Let be nonzero and suppose that
that is, for all and . Write for the characteristic polynomial of . Then:
- ;
- ;
- in the polynomial ring ,
Since , item 3 is the identity
of the source, and item 2 is its second assertion .
This is the linear-algebra step that turns Poincaré duality into the functional equation of a zeta function. When and are the matrices of Frobenius on and and , it says that the inverse roots of are the numbers , for an inverse root of .
Formalization Note The pairing is given by its Gram matrix G : Matrix m n K together with an explicit two-sided inverse H, for arbitrary finite index types m and n. The polynomial is Mathlib's Matrix.charpolyRev Ψ, the polynomial is Φ.charpoly.comp (C lam * X), and is Fintype.card m. The hypothesis is implicit in the source, whose formula divides by ; without it need not be invertible.
import Mathlib
theorem Matrix.charpolyRev_of_transpose_mul_mul_eq_smul {K : Type*} [Field K] {m n : Type*}
[Fintype m] [DecidableEq m] [Fintype n] [DecidableEq n]
(Φ : Matrix m m K) (Ψ : Matrix n n K) (G : Matrix m n K) (H : Matrix n m K)
(hGH : G * H = 1) (hHG : H * G = 1) (lam : K) (hlam : lam ≠ 0)
(h : Φ.transpose * G * Ψ = lam • G) :
Φ.det ≠ 0 ∧ Φ.det * Ψ.det = lam ^ Fintype.card m ∧
Polynomial.C Φ.det * Ψ.charpolyRev =
(-1) ^ Fintype.card m * Φ.charpoly.comp (Polynomial.C lam * Polynomial.X) := by sorry