Over the complex numbers, if , then
Here the generalized binomial coefficient is , with . This is an exact finite identity, even when an infinite binomial series would not converge.
One can construct the required polynomial without any infinite series. At polynomial degree , the coefficient of is plus terms involving only earlier coefficients. Recursively choose it to agree with through polynomial degree ; the first coefficients are . The stated generalized binomial coefficients solve this recursion: near , the binomial series for cubes to , and truncating it changes no coefficient below polynomial degree . Thus is divisible by as a polynomial identity. Substituting the nilpotent matrix kills the remaining terms, all divisible by . For a Jordan block with , replace by and multiply by a scalar cube root of .

Articles by others on the same topic (0)

There are currently no matching articles.