SearcharxivSearch

arXiv · 1801.08748

Normal structure of isotropic reductive groups over rings

Abstract

The paper studies the lattice of subgroups of an isotropic reductive group G(R) over a commutative ring R, normalized by the elementary subgroup E(R). We prove the sandwich classification theorem for this lattice under the assumptions that the reductive group scheme G is defined over an arbitrary commutative ring, its isotropic rank is at least 2, and the structure constants are invertible in R. The theorem asserts that the lattice splits into a disjoint union of sublattices (sandwiches) E(R,q)<=...<=C(R,q) parametrized by the ideals q of R, where E(R,q) denotes the relative elementary subgroup and C(R,q) is the inverse image of the center under the natural homomorphism G(R) to G(R/I). The main ingredients of the proof are the "level computation" by the first author and the universal localization method developed by the second author.

Explore related subjects

Keep this discovery

BibTeXRIS

Anastasia Stavrova, Alexei Stepanov. 2018-01-26. Normal structure of isotropic reductive groups over rings. https://arxiv.org/abs/1801.08748

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