Classification of reductive groups via root datum

Click For Summary

Discussion Overview

The discussion centers on the classification of reductive groups over algebraically closed fields via root datum, particularly focusing on the relationship between root datum and Dynkin diagrams. Participants explore how root datum can reconstruct the center of a reductive group and the implications for the classification of semisimple versus general reductive groups.

Discussion Character

  • Technical explanation
  • Debate/contested

Main Points Raised

  • Some participants propose that a root datum ##(X^*(T), \Phi, X(T)_*, \phi^{\vee})## contains full information about the center ##Z(G)## of a reductive group ##G##.
  • One participant suggests that the center can be reconstructed by considering the connected components of the kernel associated with each root.
  • There is a question about whether all reductive groups are classified up to central isogenies by their Dynkin diagrams, or if this classification is limited to semisimple groups.
  • Another participant argues that the quotient map ##G \to G/Z(G)## is not always an isogeny unless the kernel (the center) is finite.
  • It is noted that semisimple groups are characterized by having a finite center, which distinguishes them from other reductive groups.

Areas of Agreement / Disagreement

Participants generally agree that semisimple groups have finite centers, which is a key distinction. However, there is disagreement regarding the extent to which all reductive groups can be classified by Dynkin diagrams, with some participants asserting that this classification does not apply to all reductive groups.

Contextual Notes

The discussion highlights the dependence on the definitions of isogeny and the properties of the center of reductive groups, which may not be universally applicable across all cases.

The Tortoise-Man
Messages
95
Reaction score
5
I have a couple of questions about classification of reductive groups over algebraically closed field (up to isomorphism) by so called root datum.

In the linked discussion is continued that

In particular, the semisimple groups over an algebraically closed field
are classified up to central isogenies by their Dynkin diagrams.

Obviously, a root datum ##(X^*, \Phi, X_*, \phi^{\vee})## contains full information ("building plan") about the associated Dynkin diagram, but the converse is not true: A root datum contains slightly more information than the Dynkin diagram, eg it "knows" the center of the given reductive group.

Questions:

1) How concretely a root datum ##(X^*(T), \Phi, X(T)_*, \phi^{\vee})## associated to a reductive group ##G## with maximal torus ##T## "reconstructs" fully the center ##Z(G)## of the group? (in other words: why does this root datum "contain" full information about the
center of this group?

2) The quoted statement above claims that due to this classification of reductive groups via root data, the semisimple groups - which form a subclass of reductive groups, those with ##R(G)=1## - are classified up to central isogenies by their Dynkin diagrams.

But aren't then in turn all reductive groups, not only the semisimple ones classified - up to central isogenies! - by their Dynkin diagrams?

Because, isn't the quotient map ##G \to G/Z(G)## always an isogeny, or
is this quotient map only an isogeny when ##G## is semisimple?

The question in 2) at all becomes finally "how much more information" do a root datum contain than the associated Dynkin diagram only? Problem in 1) suggests that the only "additional piece" of information which the root datum carries but the
Dynkin diagram "not sees", is the information about the center of the group.
 
Last edited:
Physics news on Phys.org
The Tortoise-Man said:
I have a couple of questions about classification of reductive groups over algebraically closed field (up to isomorphism) by so called root datum.

In the linked discussion is continued that
Obviously, a root datum ##(X^*, \Phi, X_*, \phi^{\vee})## contains full information ("building plan") about the associated Dynkin diagram, but the converse is not true: A root datum contains slightly more information than the Dynkin diagram, eg it "knows" the center of the given reductive group.

Questions:

1) How concretely a root datum ##(X^*(T), \Phi, X(T)_*, \phi^{\vee})## associated to a reductive group ##G## with maximal torus ##T## "reconstructs" fully the center ##Z(G)## of the group? (in other words: why does this root datum "contain" full information about the
center of this group?
For each root, consider the connocted component of the kernel, then the intersecrion of all these kernels, then take the connected component. That is the center.
The Tortoise-Man said:
2) The quoted statement above claims that due to this classification of reductive groups via root data, the semisimple groups - which form a subclass of reductive groups, those with ##R(G)=1## - are classified up to central isogenies by their Dynkin diagrams.

But aren't then in turn all reductive groups, not only the semisimple ones classified - up to central isogenies! - by their Dynkin diagrams?

Because, isn't the quotient map ##G \to G/Z(G)## always an isogeny, or
is this quotient map only an isogeny when ##G## is semisimple?
No, because to be an isogeny the kernel has to be finite. Here the kernel is the center, which need not be finite.
The Tortoise-Man said:
The question in 2) at all becomes finally "how much more information" do a root datum contain than the associated Dynkin diagram only? Problem in 1) suggests that the only "additional piece" of information which the root datum carries but the
Dynkin diagram "not sees", is the information about the center of the group.
 
Alright, so only the semisimple ones are precisely those with finite center, that's the issue, right?
 
The Tortoise-Man said:
Alright, so only the semisimple ones are precisely those with finite center, that's the issue, right?
Yes. Think of ##GL_n## is reductive and ##SL_n## semisimple.
 
  • Like
Likes   Reactions: fresh_42

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 8 ·
Replies
8
Views
3K
  • Poll Poll
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
23
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
4K