We construct a cube root of a matrix on each Jordan block. Since is an invertible matrix over the complex numbers, its Jordan normal form isConsider one block , where is a Nilpotent Jordan block and . Choose a complex cube root of , so .
We need a polynomial with constant term one satisfyingThis can be constructed using only polynomial multiplication. Write . Once have been chosen, the coefficient of in is plus an expression depending only on those earlier coefficients. Choose to make this coefficient one at and zero at . Division by three is possible over the complex numbers, so the recursion always succeeds. Its first coefficients areThis is the truncated binomial cube root of the identity plus a nilpotent matrix; equivalently , where the generalized binomial coefficient is and the empty product is one.
Substitute . The polynomial remainder is a multiple of , hence zero. It follows thatFor , take , so the same construction covers single-entry blocks. Assemble the block diagonal matrix . Taking matrix powers respects these blocks, and conjugating back givesThus every invertible matrix over the complex numbers has at least one cube root of a matrix. The construction uses only finitely many matrix powers.
Take the Nilpotent Jordan blockThenSuppose that a complex matrix of size three satisfied . We would have , so would be a nilpotent matrix. Every eigenvalue of must then be zero: if with , applying gives . Its characteristic polynomial is therefore , and the Cayley-Hamilton theorem gives . This contradicts . HenceThe obstruction is that a nilpotent matrix of size three cannot have nilpotency index greater than three.
Articles by others on the same topic
There are currently no matching articles.