Search arXivSearch

arXiv · 2112.02430

Aschbacher's Theorem for the General Linear Group

Abstract

In 1984, Michael Aschbacher proved a seminal classification theorem for the maximal subgroups of effectively all of the classical groups. In this thesis we give a comprehensive, yet accessible description and proof of Aschbacher's theorem, restricting its scope to the general linear group. The main theorem of this paper classifies the maximal subgroups of the general linear group into nine different classes; eight of which have natural descriptions based on an object that their members act on and stabilise, whilst the ninth class - though not having such a natural description - contains groups that are bound by the property of having a unique normal quasisimple subgroup that acts absolutely irreducibly on the vector space. We give a detailed description of each of the first eight classes before proving that if a subgroup is not contained in a member of one of them, then it must have the properties that make up the ninth class. This paper uses techniques that cross over the fields of group theory, linear algebra and representation theory and it is approachable for anyone with an undergraduate understanding of these subjects.

Explore related subjects

Keep this discovery

BibTeXRIS

Kadeem Harrigan. 2021-12-04. Aschbacher's Theorem for the General Linear Group. https://arxiv.org/abs/2112.02430

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