Abstract

We now consider properties like generation, conjugacy, classification, connectedness and dimension of centralizers in connected reductive groups. It turns out that the situation is easiest for semisimple elements. Semisimple elements Recall from Corollary 6.11(a) that every semisimple element of a connected group lies in some maximal torus. More precisely we have: Proposition 14.1 Let G be connected, s ∈ G semisimple, T ≤ G a maximal torus. Then s ∈ T if and only if T ≤ C G (s)°. In particular, s ∈ C G (s)° . Proof As T is abelian, s ∈ T if and only if T ≤ C G (s) , which is equivalent to T ≤ C G (s) ° as T is connected. We remark that in contrast, for u ∈ G unipotent, u may not be in C G (u) °. See Exercise 20.10 for an example in Sp 4 over a field of characteristic 2. We now determine the structure of centralizers of semisimple elements: Theorem 14.2 Let G be connected reductive, s ∈ G semisimple, T ≤ G a maximal torus with corresponding root system Φ. Let s ∈ T and Ψ ≔ {α ∈ Φ | α(s) = 1}. Then: (a) C G (s) ° = 〈 T,U α ; | α ∈ Ψ〉. (b) C G (s) = 〈 T,U α ,ẇ | α ∈ Ψ, w ∈ W with s w = s 〉. Moreover, C G (s)° is reductive with root system Ψ and Weyl group W 1 = 〈s α | α ∈ Ψ〉 .

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.