Search arXiv⌕ Search

arXiv · math/0408109

A Geometric Approach to Complete Reducibility

Abstract

Let G be a connected reductive linear algebraic group. We use geometric methods to investigate G-completely reducible subgroups of G, giving new criteria for G-complete reducibility. We show that a subgroup of G is G-completely reducible if and only if it is strongly reductive in G; this allows us to use ideas of R.W. Richardson and Hilbert--Mumford--Kempf from geometric invariant theory. We deduce that a normal subgroup of a G-completely reducible subgroup of G is again G-completely reducible, thereby providing an affirmative answer to a question posed by J.-P. Serre, and conversely we prove that the normalizer of a G-completely reducible subgroup of G is again G-completely reducible. Some rationality questions and applications to the spherical building of G are considered. Many of our results extend to the case of non-connected G.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Bate, B. M. S. Martin, G. Roehrle. 2004-12-01. A Geometric Approach to Complete Reducibility. https://doi.org/10.1007/s00222-004-0425-9

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↗