Table of Contents
Fetching ...

Traces of powers of matrices over finite fields

Ofir Gorodetsky, Brad Rodgers

Abstract

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as $n \to \infty$, and Johansson proved that the rate of convergence is superexponential in $n$. We prove a finite field analogue of these results. Fixing a prime power $q = p^r$, we choose a matrix $M$ uniformly from the finite unitary group $\mathrm{U}(n,q)\subseteq \mathrm{GL}(n,q^2)$ and show that the traces of $\{ M^i \}_{1 \le i \le k,\, p \nmid i}$ converge to independent uniform variables in $\mathbb{F}_{q^2}$ as $n \to \infty$. Moreover we show the rate of convergence is exponential in $n^2$. We also consider the closely related problem of the rate at which characteristic polynomial of $M$ equidistributes in `short intervals' of $\mathbb{F}_{q^2}[T]$. Analogous results are also proved for the general linear, special linear, symplectic and orthogonal groups over a finite field. In the two latter families we restrict to odd characteristic. The proofs depend upon applying techniques from analytic number theory over function fields to formulas due to Fulman and others for the probability that the characteristic polynomial of a random matrix equals a given polynomial.

Traces of powers of matrices over finite fields

Abstract

Let be a random matrix chosen according to Haar measure from the unitary group . Diaconis and Shahshahani proved that the traces of converge in distribution to independent normal variables as , and Johansson proved that the rate of convergence is superexponential in . We prove a finite field analogue of these results. Fixing a prime power , we choose a matrix uniformly from the finite unitary group and show that the traces of converge to independent uniform variables in as . Moreover we show the rate of convergence is exponential in . We also consider the closely related problem of the rate at which characteristic polynomial of equidistributes in `short intervals' of . Analogous results are also proved for the general linear, special linear, symplectic and orthogonal groups over a finite field. In the two latter families we restrict to odd characteristic. The proofs depend upon applying techniques from analytic number theory over function fields to formulas due to Fulman and others for the probability that the characteristic polynomial of a random matrix equals a given polynomial.

Paper Structure

This paper contains 63 sections, 87 theorems, 300 equations.

Key Result

Theorem 1.1

Let $M \in \mathrm{GL}(n,q)$ be a random matrix chosen according to Haar measure. Fix a strictly increasing sequence $b_1,\ldots,b_k$ of positive integers coprime to $p$. Then for any sequence $a_1,...,a_k$ of elements of elements from $\mathbb{F}_{q}$, we have

Theorems & Definitions (170)

  • Theorem 1.1
  • Remark 1
  • Remark 2
  • Theorem 1.2
  • Remark 3
  • Theorem 1.3
  • Remark 4
  • Theorem 1.4
  • Remark 5
  • Theorem 1.5
  • ...and 160 more