pith. sign in

arxiv: 1707.01935 · v2 · pith:JOCG5FL4new · submitted 2017-07-06 · 🧮 math.RT · math.GR

Root data with group actions

classification 🧮 math.RT math.GR
keywords gammaactsroottextconstructgrouppairprocess
0
0 comments X
read the original abstract

Suppose $k$ is a field, $G$ is a connected reductive algebraic $k$-group, $T$ is a maximal $k$-torus in $G$, and $\Gamma$ is a finite group that acts on $(G,T)$. From the above, one obtains a root datum $\Psi$ on which $\text{Gal}(k)\times\Gamma$ acts. Provided that $\Gamma$ preserves a positive system in $\Psi$, not necessarily invariant under $\text{Gal}(k)$, we construct an inverse to this process. That is, given a root datum on which $\text{Gal}(k)\times\Gamma$ acts appropriately, we show how to construct a pair $(G,T)$, on which $\Gamma$ acts as above. Although the pair $(G,T)$ and the action of $\Gamma$ are canonical only up to an equivalence relation, we construct a particular pair for which $G$ is $k$-quasisplit and $\Gamma$ fixes a $\text{Gal}(k)$-stable pinning of $G$. Using these choices, we can define a notion of taking "$\Gamma$-fixed points" at the level of equivalence classes, and this process is compatible with a general "restriction" process for root data with $\Gamma$-action.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.