Search Results
G-complete reducibility in non-connected groups
In this paper we present an algorithm for determining whether a subgroup H of a non-connected reductive group G is G-completely reducible. The algorithm consists of a series of reductions; at each step, we perform operations involving connected groups, such as checking whether a certain subgroup of G0 is G0-cr. This essentially reduces the problem of determining G-complete reducibility to the connected case.
Cocharacter-Closure and the Rational Hilbert-Mumford Theorem
For a field k, let G be a reductive k-group and V an affine k-variety on which G acts. Using the notion of cocharacter-closed G(k)-orbits in V , we prove a rational version of the celebrated Hilbert-Mumford Theorem from geometric invariant theory. We initiate a study of applications stemming from this rationality tool. A number of examples are discussed to illustrate the concept of cocharacter-closure and to highlight how it differs from the usual Zariski-closure.
On unipotent radicals of pseudo-reductive groups
We establish some results on the structure of the geometric unipotent radicals of pseudo-reductive k-groups. In particular, let k′ be a purely inseparable field extension of k of degree pe and let G denote the Weil restriction of scalars Rk′/k(G′) of a reductive k′-group G′. We prove that the unipotent radical Ru(Gk¯) of the extension of scalars of G to the algebraic closure k¯ of k has exponent e. Our main theorem is to give bounds on the nilpotency class of geometric unipotent radicals of standard pseudo-reductive groups, which are sharp in many cases.