SearcharxivSearch

arXiv · 1806.03067

On relative complete reducibility

Abstract

Let $K$ be a reductive subgroup of a reductive group $G$ over an algebraically closed field $k$. The notion of relative complete reducibility, introduced in previous work of Bate-Martin-Roehrle-Tange, gives a purely algebraic description of the closed $K$-orbits in $G^n$, where $K$ acts by simultaneous conjugation on $n$-tuples of elements from $G$. This extends work of Richardson and is also a natural generalization of Serre's notion of $G$-complete reducibility. In this paper we revisit this idea, giving a characterization of relative $G$-complete reducibility which directly generalizes equivalent formulations of $G$-complete reducibility. If the ambient group $G$ is a general linear group, this characterization yields representation-theoretic criteria. Along the way, we extend and generalize several results from the aforementioned work of Bate-Martin-Roehrle-Tange.

Explore related subjects

Keep this discovery

BibTeXRIS

Christopher Attenborough, Michael Bate, Maike Gruchot, Alastair Litterick, Gerhard Roehrle. 2018-06-08. On relative complete reducibility. https://arxiv.org/abs/1806.03067

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