Commensurability growths of algebraic groups (Q2304340)

From MaRDI portal
Revision as of 04:42, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Commensurability growths of algebraic groups
scientific article

    Statements

    Commensurability growths of algebraic groups (English)
    0 references
    0 references
    0 references
    0 references
    11 March 2020
    0 references
    Two subgroups \(A\) and \(B\) of a group \(G\) are called commensurable if their commensurability index \(c(A,B) = [A:A \cap B][B:A \cap B]\) is finite. For a pair of groups \(\Gamma \leq G\), the authors define the commensurability growth function \[c_n(\Gamma, G) = |\{ \Delta \leq G:\ c(\Gamma,\Delta) = n\}|\] and the full commensurability growth function \(C_n(\Gamma, G) = \sum_{k=1}^n c_k(\Gamma, G).\) Note that when \(\Gamma = G\) these functions coincide with the classical subgroup growth functions \(a_n(\Gamma)\) and \(s_n(\Gamma)\). The main result of the paper relates the full commensurability growth of an arithmetic lattice in a higher rank Chevalley group to its subgroup growth: Theorem 1. Let \(\mathrm{G}\) be a Chevalley group scheme defined over \(\mathbb{Z}\). If \(\mathrm{G}\) has rank greater than \(1\), then there exists \(M > 0\) such that for any arithmetic lattice \(\Gamma\) in \(\mathrm{G}(\mathbb{R})\), \[s_n(\Gamma) \le C_n(\Gamma, \mathrm{G}(\mathbb{R})) \preceq n^M s_n(\Gamma).\] The main technical ingredient of the proof of the theorem is Lemma 3, which says that the number of maximal arithmetic subgroups of \(\mathrm{G}(\mathbb{R})\) containing \(H = \mathrm{ker}(\mathrm{G}(\mathbb{Z}) \to \mathrm{G}(\mathbb{Z}/m\mathbb{Z}))\) is bounded above by \(m^{5\mathrm{dim(G)}}\). Its proof is based on some ideas and methods of Borel and Prasad.
    0 references
    commensurators
    0 references
    algebraic groups
    0 references
    residually finite groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references