Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Characteristic polynomials of endomorphisms adjoint under a perfect pairing: det⁡Φ⋅det⁡(1−TΨ)=(−1)rχΦ(λT)\det\Phi\cdot\det(1-T\Psi)=(-1)^r\chi_\Phi(\lambda T)detΦ⋅det(1−TΨ)=(−1)rχΦ​(λT)

Proved
Matrix.charpolyRev_of_transpose_mul_mul_eq_smul

by emmgaml · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometryweil-conjectures

Let KKK be a field, let Φ\PhiΦ be an r×rr\times rr×r matrix and Ψ\PsiΨ an s×ss\times ss×s matrix over KKK, and let GGG be an r×sr\times sr×s matrix that has a two-sided inverse HHH. Thus r=sr=sr=s, and the bilinear pairing ⟨x,y⟩=xTGy\langle x,y\rangle=x^{\mathsf T}Gy⟨x,y⟩=xTGy on Kr×KsK^r\times K^sKr×Ks is perfect. Let λ∈K\lambda\in Kλ∈K be nonzero and suppose that

ΦT G Ψ=λ G,\Phi^{\mathsf T}\,G\,\Psi=\lambda\,G,ΦTGΨ=λG,

that is, ⟨Φx,Ψy⟩=λ ⟨x,y⟩\langle\Phi x,\Psi y\rangle=\lambda\,\langle x,y\rangle⟨Φx,Ψy⟩=λ⟨x,y⟩ for all xxx and yyy. Write χΦ(T)=det⁡(T−Φ)\chi_\Phi(T)=\det(T-\Phi)χΦ​(T)=det(T−Φ) for the characteristic polynomial of Φ\PhiΦ. Then:

  1. det⁡Φ≠0\det\Phi\neq0detΦ=0;
  2. det⁡Φ⋅det⁡Ψ=λr\det\Phi\cdot\det\Psi=\lambda^{r}detΦ⋅detΨ=λr;
  3. in the polynomial ring K[T]K[T]K[T],
det⁡Φ⋅det⁡(1−TΨ)=(−1)r χΦ(λT).\det\Phi\cdot\det(1-T\Psi)=(-1)^{r}\,\chi_\Phi(\lambda T).detΦ⋅det(1−TΨ)=(−1)rχΦ​(λT).

Since χΦ(λT)=(λT)rdet⁡(1−1λTΦ)\chi_\Phi(\lambda T)=(\lambda T)^{r}\det\big(1-\tfrac{1}{\lambda T}\Phi\big)χΦ​(λT)=(λT)rdet(1−λT1​Φ), item 3 is the identity

det⁡(1−TΨ)=(−1)rλrTrdet⁡Φ det⁡(1−1λT Φ)\det(1-T\Psi)=\frac{(-1)^{r}\lambda^{r}T^{r}}{\det\Phi}\,\det\Big(1-\frac{1}{\lambda T}\,\Phi\Big)det(1−TΨ)=detΦ(−1)rλrTr​det(1−λT1​Φ)

of the source, and item 2 is its second assertion det⁡Ψ=λr/det⁡Φ\det\Psi=\lambda^{r}/\det\PhidetΨ=λr/detΦ.

This is the linear-algebra step that turns Poincaré duality into the functional equation of a zeta function. When Φ\PhiΦ and Ψ\PsiΨ are the matrices of Frobenius on HiH^iHi and H2n−iH^{2n-i}H2n−i and λ=qn\lambda=q^nλ=qn, it says that the inverse roots of det⁡(1−TΨ)\det(1-T\Psi)det(1−TΨ) are the numbers qn/αq^n/\alphaqn/α, for α\alphaα an inverse root of det⁡(1−TΦ)\det(1-T\Phi)det(1−TΦ).

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 det⁡(1−TΨ)\det(1-T\Psi)det(1−TΨ) is Mathlib's Matrix.charpolyRev Ψ, the polynomial χΦ(λT)\chi_\Phi(\lambda T)χΦ​(λT) is Φ.charpoly.comp (C lam * X), and rrr is Fintype.card m. The hypothesis λ≠0\lambda\neq0λ=0 is implicit in the source, whose formula divides by det⁡Φ\det\PhidetΦ; without it Φ\PhiΦ need not be invertible.

Preamble
import Mathlib
Formal statement
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
Source
R. Hartshorne, *Algebraic Geometry*, Graduate Texts in Mathematics 52, Springer (1977), Appendix C (The Weil Conjectures), §4, Lemma 4.3 (endomorphisms fff, ggg compatible with a perfect pairing up to the scalar λ\lambdaλ).

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