Let GG be a linear over an . An element gGg\in G is semisimple if its image under one, equivalently every, faithful algebraic representation is a semisimple linear operator. Over C\mathbb C, this means diagonalizable.

In a connected , an element is semisimple exactly when it lies in a . Its is Zariski closed.

Jordan decomposition

Every element gg has a commuting Jordan decomposition

g=gsgu=gugsg=g_sg_u=g_ug_s

with gsg_s semisimple and gug_u unipotent. Invariant regular functions on GG take the same values on gg and gsg_s, so the affine conjugacy quotient records the semisimple class.

Rational versus geometric conjugacy

If GG is defined over a non-algebraically-closed field FF, elements of G(F)G(F) that are conjugate over F\overline F need not be conjugate over FF. For this distinction is organized by and .

Examples
  • In GLn(C)\operatorname{GL}_n(\mathbb C), semisimple elements are precisely the diagonalizable matrices.
  • A unipotent matrix other than the identity is not semisimple, even though all of its eigenvalues are 11.
Langlands role

and are taken up to semisimple conjugacy because . A semisimplified parameter can lose or information, so “semisimple” is not a harmless adjective.

References
  1. T. A. Springer, Linear Algebraic Groups, second edition, Birkhäuser, 1998.