Timeline for Computing centralizers in Lie groups
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 11, 2011 at 1:09 | comment | added | Allen Knutson | 2. Generators should be enough -- centralizing the finite group is the same as commuting with its generators. The centralizer of a single element of finite order is easy to compute from Borel-de Siebenthal theory, but intersecting them seems likely to be hard, a priori. | |
| Jun 11, 2011 at 1:07 | comment | added | Allen Knutson | 1. Such a finite group comes with an $n$-dim or $2n$-dim complex representation, perhaps reducible, and the centralizer inside that $GL(n$ resp. $2n)$ just comes from Schur's lemma and the multiplicities of the irreps. Then it's trickier, I suppose, to see how those centralizers intersect your $G$. | |
| Jun 10, 2011 at 20:20 | history | asked | J Newman | CC BY-SA 3.0 |