If is a strictly upper triangular matrix, then unless . We prove by mathematical induction that
The assertion for is the definition. In the matrix multiplication formula
a nonzero summand would require and , hence . This proves the induction step. Since for all entries, . In particular, every strictly upper triangular matrix is a nilpotent matrix.
Write , where
The binomial theorem for commuting matrices applies because . All terms of degree at least three vanish, so for every positive integer ,
The same expression directly gives when , so no small exponent is excluded.

Articles by others on the same topic (0)

There are currently no matching articles.