Search arXiv⌕ Search

arXiv · math/0609433

Complete Reducibility and Commuting Subgroups

Abstract

Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p. We study J.-P. Serre's notion of G-complete reducibility for subgroups of G. In particular, for a subgroup H and a normal subgroup N of H, we look at the relationship between G-complete reducibility of N and of H, and show that these properties are equivalent if H/N is linearly reductive, generalizing a result of Serre. We also study the case when H = MN with M a G-completely reducible subgroup of G which normalizes N. We show that if G is connected, N and M are connected commuting G-completely reducible subgroups of G, and p is good for G, then H = MN is also G-completely reducible.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Bate, B. M. S. Martin, G. E. Roehrle. 2008-02-29. Complete Reducibility and Commuting Subgroups. https://arxiv.org/abs/math/0609433

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

KEEP EXPLORING

Related papers

Strongly Regular Graphs of Rank Four

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the last few decades and often give rise to interesting groups of automorphisms. In this paper we take a reverse approach, and leverage strong classification results on rank four permutation groups to classify the strongly regular graphs which yield such groups as a group of automorphisms.

math.GR↗

Every finite group admits a just finite presentation

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite group admits such a presentation. We resolve this conjecture in the affirmative.

math.GR↗

Assouad--Nagata dimension of systolic complexes with almost flat intervals

We introduce the notion of systolic complexes with almost flat intervals. They constitute a subclass of fit systolic complexes and arise naturally in the study of graphical C(3)--T(6) small cancellation complexes. We prove that their Assouad--Nagata dimension is bounded above by a universal constant. As consequences, we obtain universal bounds on the Assouad--Nagata dimension of tame simply connected graphical C(3)--T(6) small cancellation complexes and of finitely generated groups defined by graphical C(3)--T(6) small cancellation presentations. In the appendix, we observe that the proof of finiteness of asymptotic dimension for buildings due to Dymara and Schick also yields finiteness of their asymptotic Assouad--Nagata dimension.

math.GR↗