## Periodic matrices

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

A square matrix $M$ such that $M^{k+1}=M$, for some positive integer $k$, is called a periodic matrix.

1. Can we characterize the periodic matrices in $\mathcal{M}_n(\mathbb{Z})$?
2. If we replace $\mathbb{Z}$ by an Euclidean domain?
3. If we replace $\mathbb{Z}$ by a PID?
-

## 2 Answers

Geoff already gave a description. Here is a semigroup theory approach. $M^{k+1}=M$ means that $E=M^k$ is an idempotent, $E^2=E$, and $EM=M=ME$. All idempotents in the matrix semigroup over $Z$ are easily described as matrices similar to diag$(0,...,0,1,1,...,1)$ (several 0's followed by several $1$'s) with unimodular conjugator. Hence we can assume that $E$ has that form. Therefore $M=EM=ME$ must have the form described in Geoff's answer. The same description holds for matrices over any ring if the structure of idempotents is similar to the above.

Edit. As Geoff pointed out below, in fact since $EM=ME=M$, we get that the block $A$ in $M$ is 0, so $M$ looks like $$\left(\begin{array}{ll} 0&0\\ 0 & B\end{array}\right)$$ where $B$ is an integer matrix with $B^k=1$. This is of course an "if and only if" description. I am pretty sure this has been known since the 50s, but I do not have time to dig it up. It should follow from the description of Green relations in the matrix semigroups.

-

Actually, your result is a bit stronger, since some of the matrices in my answer are conjugate. Because you have $M = EM = ME,$ you have actually conjugated them to a matrix of the form in my answer which also has $A = 0.$ – Geoff Robinson Aug 20 2011 at 7:39
@Geoff: Yes, you are right.  – Mark Sapir Aug 20 2011 at 8:07
Very nice Mark, Geoff, thanks. – Portland Aug 21 2011 at 2:14
@Geoff: I used a standard semigroup theoretic argument (an element of a semigroup satisfying $x^{n+1}=x$ is called a group element, it belongs to the maximal subgroup with identity element $x^n$, etc.). When you deal with a (finite) semigroup, you should start with describing idempotents, then group elements, then regular D-classes, etc. The argument works for every (not necessarily commutative) ring where the structure of idempotents is as I described. – Mark Sapir Aug 23 2011 at 0:49

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

It seems that they are those matrices which are conjugate via a unimodular integral matrix to a matrix of the form `$\left( \begin{array}{clcr} 0 & A\\0 & B \end{array} \right),$` where $B$ is an invertible integral (square) matrix of finite order and $A$ is an arbitrary integral matrix. I think you just extend a $\mathbb{Z}$-basis of the pure submodule of integral vectors with $Mv = 0$ to a basis for $\mathbb{Z}^{n}$ (as column space). Then it's just a matter of seeing what the matrix looks like with respect to that basis, and computing its powers. This argument works over any PID (so, in particular, over any Euclidean domain).

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 30, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.940951406955719, "perplexity_flag": "head"}