MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $p$ be an odd prime and $\mathbb Z_p$ be the prime field of order $p$. Consider the matrix ring $R=M_n(\mathbb Z_p)$. Is there any method to count the solutions of the equation (in the ring $R$)

$$X^2=I.$$ Where $I$ is the identity matrix?

share|cite|improve this question
up vote 1 down vote accepted

Denote $k:=Z_p$. If $p\ne2$, the matrix $X$ is in one-to-one correspondence with a decomposition $k^n=E_+ \oplus E_-$, where $E_\pm$ is the eigenspace associated with the eigenvalue $\pm1$.

Given the dimension $m$ of $E_+$ ($n-m$ for $E_-$), these decompositions are in one-to-one correspondence with the bases of $k^n$, quotiented by the action of $GL_m\times GL_{n-m}$. Therefore, their number is $$\frac{|GL_n(Z_p)|}{|GL_m(Z_p)|\cdot|GL_{n-m}(Z_p)|}=p^{m(n-m)}\frac{(p-1)\cdots(p^n-1)}{(p-1)\cdots(p^m-1)(p-1)\cdots(p^{n-m}-1)}.$$ Summing up over all the possible $m$'s, the number of solutions to $X^2=I$ is $$\sum_{m=0}^np^{m(n-m)}\frac{(p^{m+1}-1)\cdots(p^n-1)}{(p-1)\cdots(p^{n-m}-1)}.$$

share|cite|improve this answer
Your formula is precisely the same as my formula, except you wrote $r=n-m$. – Jason Starr Dec 4 '12 at 0:18

Because $p$ is different from $2$, the solutions are the same as direct sum decompositions $\mathbb{Z}_p^{\oplus n} = E_{+1} \oplus E_{-1}$ as $\mathbb{Z}_p$-vector spaces. You can index these by the dimensions, say $r$ and $n-r$. For each, the number of solutions is $$ \frac{(p^n-1)(p^n-p) \cdot \dots \cdot (p^n-p^{r-1})}{(p^r-1)(p^r-p) \cdot \dots \cdot (p^r-p^{r-1})} \cdot p^{r(n-r)} $$ So the final answer is the sum over $r$ from $0$ to $n$ of this factor.

share|cite|improve this answer
Didn't you count twice the powers of $p$ ? – Denis Serre Dec 3 '12 at 17:02

There are $\displaystyle \sum_{i=0}^n \frac{N(n)}{N(i)N(n-i)}$ solutions to your problem, where $N(r)$ is the number of elements in $GL_r(\mathbb{F}_p)$.

Any such $X$ is invertible, and $X\in GL_n(\mathbb{F}_p)$ is a solution if and only if it is conjugate in $GL_n(\mathbb{F}_p)$ to a diagonal matrix with the first $i$ entries equal to $1$ and last $n-i$ entries equal to $-1$. This explains the number of summands. Now $g\in GL_n(\mathbb{F}_p)$ commutes with such diagonal matrix if and only if it preserves both eigenspaces. Hence, there are $\frac{N(n)}{N(i)N(n-i)}$ elements in the conjugacy class.

The formula can be made even more explicit by substituting a formula for $N(r)$.

share|cite|improve this answer
Matrices conjugate to a diagonal matrix with $i$ 1's and $n-i$ $-1$'s on the diagonal form a class of matrices with a fixed rational canonical form. For the general problem of enumerating matrices in $R$ with a fixed rational canonical form, see Theorems 1.10.4 and 1.10.7 of Enumerative Combinatorics, vol. 1, 2nd ed. – Richard Stanley Dec 4 '12 at 1:41

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.