An element is semisimple when its image in a faithful finite-dimensional representation is diagonalizable, and unipotent when that image has every eigenvalue equal to one. These conditions are independent of the faithful representation. The Jordan decomposition in an affine algebraic group is the unique factorization
with semisimple and unipotent.
In , matrices with two distinct eigenvalues form a dense open subset and are semisimple, so semisimple elements are dense. Their full locus is not open: a scalar matrix is semisimple, but every neighbourhood of it contains a nontrivial Jordan block. The group also has nonidentity unipotent matrices.
For a contrasting example take . Its semisimple locus is , which is closed and not dense, while for is unipotent and for is semisimple.
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.