Suppose that \(A=(a_{ij})\) be an \(n\times n\) matrix over a field \(F\text{.}\) We describe the collection of elements \(a_{ij}\) with
\(i=j\) the main diagonal of \(A\);
\(i-j=r\) (where \(r\) is a given number) the diagonal lying \(r\) steps from the main diagonal
Let \(A\in M_m(F)\) be the Jordan block (see Definition 7.5.7). Then, \(A=\lambda\cdot I_m+B\) where \(B\) is a matrix with a lower diagonal (diagonal lying \(1\) step from the main diagonal) entries \(1\) and all other entries \(0\text{.}\) We thus have
Thus, the matrix of \(B^r\) has the diagonal lying \(r\) steps from the main diagonal containing all \(1\)’s, and all other entries are \(0\text{.}\)
Furthermore, \(\lambda I_m\cdot B=B\cdot\lambda I_m\text{.}\) Therefore using (A.1.1), for a polynomial of degree \(n\) in one variable \(f(t)\in F[t]\text{,}\) we get
Using the above expression it is relatively easy to compute the powers of a Jordan block. As an exercise compute the \(100\)-th power of \(2\times 2\) Jordan block.