SearcharxivSearch

arXiv · 2304.08388

Complete reducibility in bad characteristic

Abstract

Let $G$ be a simple algebraic group of exceptional type over an algebraically closed field of characteristic $p > 0$. This paper continues a long-standing effort to classify the connected reductive subgroups of $G$. Having previously completed the classification when $p$ is sufficiently large, we focus here on the case that $p$ is bad for $G$. We classify the connected reductive subgroups of $G$ which are not $G$-completely reducible, whose simple components have rank at least $3$. For each such subgroup $X$, we determine the action of $X$ on the adjoint module $L(G)$ and on a minimal non-trivial $G$-module, and the connected centraliser of $X$ in $G$. As corollaries we obtain information on: subgroups which are maximal among connected reductive subgroups; products of commuting $G$-completely reducible subgroups; subgroups with trivial connected centraliser; and subgroups which act indecomposably on an adjoint or minimal module for $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Alastair J. Litterick, Adam R. Thomas. 2023-04-17. Complete reducibility in bad characteristic. https://arxiv.org/abs/2304.08388

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR