If is a strictly upper triangular matrix, then unless . We prove by mathematical induction thatThe assertion for is the definition. In the matrix multiplication formulaa 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 , whereThe 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
There are currently no matching articles.