# Order of unipotent matrices over $\mathbb{Z}/q\mathbb{Z}$

Let $q$ be a prime power and let $n\geq2$ be an integer. Is it known what is the largest order of a unipotent upper-triangular $n\times n$ matrix over the ring $\mathbb{Z}/q\mathbb{Z}$? I am mostly interested in upper bounds.

• Just checking: you really mean the integers modulo $q$, and not the field of $q$ elements, right? Mar 2, 2018 at 11:49
• @GerryMyerson - Yes, the ring. Mar 2, 2018 at 11:55

This works for any unipotent matrix whose characteristic polynomial is $(x-1)^n$ (including some upper-triangular matrices without ones on the diagonal). By Cayley-Hamilton, the matrix $U$ satisfies $(U-1)^{n}=0$, so we can write $U = 1 + N$ with $N^n=0$.

Then $$U^{p^k} = (1+N)^{p^k} = \sum_{i=0}^{n-1} {p^k \choose i} N^i$$ so it is sufficient to find $k$ such that ${p^k \choose i }=0\mod q$ for all $i$ from $0$ to $n-1$.

Consider the group action of $\mathbb Z/p^k$ by translation on subsets of $\mathbb Z/p^k$ of size $i$. The order of the stabilizer of any point divides $\gcd ( i,p^k)$, so by the orbit-stabilizer theorem, the binomial coefficient is a multiple of $p^k/\gcd(i,p^k)$. The largest possible value of $\gcd(i,p^k)$ is the largest power of $p$ less than $n$, and we want $p^k$ to be $q$ times it, so it suffices to take

$$p^k = q p^ { \lfloor \log_p (n-1) \rfloor }$$

and the order of the matrix is at most this.

One can check this is sharp by taking a single unipotent Jordan block, and checking that the lower bound on the $p$-adic valuation of binomial coefficients is sharp. (At this point one needs to use the fact that the order is necessarily a power of $p$ to reduce to the case of a $p^k$th power.)

• Thank you for the beautiful argument. Doesn't the argument in fact lead to the formula $p^k=qp^{\lceil\log_pn\rceil-1}$? Mar 2, 2018 at 15:21
• In the first displayed formula, is $U^N$ supposed to be $U^{p^k}$? If so, should one start by mentioning that the order of the element must be a power of $p$, since the order of the group is a power of $p$? Mar 2, 2018 at 15:42
• As Joe Silverman points out, the notation $U^N$ in the display doesn't make sense. Please edit. Mar 2, 2018 at 16:02
• @user05811 You're welcome. Yes. I actually meant to write a slightly different formula, which is equivalent. Mar 2, 2018 at 16:57
• @JoeSilverman Yes, that's correct. The argument doesn't actually need to use independently the fact that the order is a power of $p$ - we show explicitly that the $p^k$th power of the element is $1$, from which the fact about the order follows. Mar 2, 2018 at 16:59

Let $q=p^r$. The eigenvalues of a unipotent matrix are all 1 and so we may conjugate it into Jordan canonical form without extending the field. This yields a unipotent upper triangular matrix with entries in ${\Bbb Z}/p{\Bbb Z}$. Thus the answer is independent of $r$.

Consider a Jordan block $A$ of size $m$. Computing its powers we see that its order is $p^t$ where $t=\lceil m / p \rceil$. Thus your answer is $p^{\lceil n / p \rceil}$.

• What is a reference for 'Jordan canonical form' over rings? Please note that $\mathbb{Z}/p^k\mathbb{Z}$ is not a field if $k>1$. Mar 2, 2018 at 10:56
• To second @PeterHeinig's question, in what sense can you guarantee that you can conjugate a matrix over $\mathbb Z/q\mathbb Z$ so that it not only is upper triangular, but has its entries in $\mathbb Z/p\mathbb Z$? For that matter, what do you mean by $\mathbb Z/p\mathbb Z$? Since it's implicitly inside $\mathbb Z/q\mathbb Z$, I guess you mean $q'\mathbb Z/q\mathbb Z$ (with $q' = q/p$), but that seems to be quite a strong statement. Mar 2, 2018 at 11:13
• Note that when $n=2$, the group of $2\times 2$ upper-triangular unipotent matrices over $\mathbb{Z}/q\mathbb{Z}$ is cyclic of order $q$. Mar 2, 2018 at 11:29
• I think that this is a good and correct answer for the field $\mathbb{F}_q$ of order $q$, but the question was about $\mathbb{Z}/q\mathbb{Z}$, which is of course different. Mar 2, 2018 at 11:34
• This answer is not right even over the field $\mathbb F_p$. You mean $p ^ { \lceil \log_p n \rceil }$. Mar 2, 2018 at 12:49