zbMATH — the first resource for mathematics

On defining characteristic representations of finite reductive groups. (English) Zbl 1290.20011
From the introduction: We consider series of finite groups of Lie type which are specified by a root datum and a finite order automorphism of that root datum. For each power \(q\) of a prime \(p\) this determines a connected reductive algebraic group \(\mathbf G\) over \(\overline{\mathbb F}_p\) (an algebraic closure of the field with \(p\) elements) and a group of fixed points \(\mathbf G^F\) of a Frobenius morphism \(F\colon\mathbf G\to\mathbf G\), up to isomorphism.
We are interested in a parameterization of the irreducible modules of \(\mathbf G^F\) over \(\overline{\mathbb F}_p\).
In the literature on representations of connected reductive algebraic groups and finite groups of Lie type in their defining characteristic most authors restrict their descriptions to the case of simply-connected algebraic groups and the finite groups of Lie type arising from these.
In this paper we give a parameterization of the irreducible representations in defining characteristic for arbitrary finite groups of Lie type. It is very concrete and computable starting from the given root datum for the algebraic group and Frobenius action on the root datum. The description will not become more complicated for twisted Frobenius actions.
Here is an overview of the content of the other sections of this paper. Section 2 contains a description of our setup. We describe how root data and Frobenius actions on root data can be represented and how to compute certain related data. Some of the results in this section may be of independent interest. For example, we describe a construction of a certain covering group of an arbitrary connected reductive group, which generalizes the well-known simply-connected coverings of semisimple groups (see Proposition 2.5).
In Section 3 we first recall the results about defining characteristic representations of the algebraic groups and the finite groups of Lie type arising from simply-connected semisimple groups which we have mentioned above. Then we state our main result in Theorem 3.5 where we consider arbitrary finite groups of Lie type. In the end of that section we work out an example in some detail (certain centralizers of semisimple elements in exceptional groups of type \(E_8\)).
In Section 4 we give a more detailed description of the parameter sets in our main theorem for finite groups of Lie type arising from any simple connected reductive group. As an application of these results we work out the number of semisimple conjugacy classes for all of these finite groups. The results of this application were obtained before by the first named author with a completely different proof. The new proof given here is more elementary.

20C33 Representations of finite groups of Lie type
20G05 Representation theory for linear algebraic groups
20G40 Linear algebraic groups over finite fields
PDF BibTeX Cite
Full Text: DOI arXiv
[1] Blackburn, N.; Huppert, B., Finite groups II, (1981), Springer-Verlag Berlin · Zbl 0477.20001
[2] Borel, A., Seminar on algebraic groups and related finite groups, Lecture Notes in Math., vol. 131, (1970), Springer-Verlag Berlin
[3] Brunat, O., Counting \(p^\prime\)-characters in finite reductive groups, J. Lond. Math. Soc. (2), 81, 3, 544-562, (2010) · Zbl 1251.20017
[4] Cabanes, M., Brauer morphism between modular Hecke algebras, J. Algebra, 115, 1, 1-31, (1988) · Zbl 0656.20003
[5] Carter, R. W., Simple groups of Lie type, (1972), Wiley-Interscience London · Zbl 0248.20015
[6] Carter, R. W., Finite groups of Lie type - conjugacy classes and complex characters, (1985), Wiley-Interscience Chichester · Zbl 0567.20023
[7] Curtis, C. W., Modular representations of finite groups with split \((B, N)\)-pairs, (Seminar on Algebraic Groups and Related Finite Groups, The Institute for Advanced Study, Princeton, NJ, 1968/1969, (1970), Springer-Verlag Berlin), 57-95
[8] Digne, F.; Michel, J., Representations of finite groups of Lie type, (1991), Cambridge University Press Cambridge · Zbl 0815.20014
[9] Geck, M., An introduction to algebraic geometry and algebraic groups, Oxf. Grad. Texts Math., vol. 10, (2003), Oxford University Press Oxford · Zbl 1037.14019
[10] Geck, M.; Hiss, G.; Lübeck, F.; Malle, G.; Pfeiffer, G., CHEVIE—A system for computing and processing generic character tables, Computational Methods in Lie Theory, Essen, 1994, Appl. Algebra Engrg. Comm. Comput., 7, 3, 175-210, (1996) · Zbl 0847.20006
[11] Herzig, F., The weight in a Serre-type conjecture for tame n-dimensional Galois representations, Duke Math. J., 149, 1, 37-116, (2009) · Zbl 1232.11065
[12] Humphreys, J. E., Reflections groups and Coxeter groups, Cambridge Stud. Adv. Math., vol. 29, (1990), Cambridge University Press · Zbl 0725.20028
[13] Isaacs, I. M., Character theory of finite groups, Pure Appl. Math., vol. 69, (1976), Academic Press [Harcourt Brace Jovanovich Publishers] New York · Zbl 0337.20005
[14] Jantzen, J. C., Representations of algebraic groups, Math. Surveys Monogr., (2003), American Mathematical Society
[15] Lübeck, F., Numbers of conjugacy classes of finite groups of Lie type
[16] Lübeck, F., Small degree representations of finite Chevalley groups in defining characteristic, LMS J. Comput. Math., 4, 135-169, (2001), (electronic) · Zbl 1053.20008
[17] Schönert, M., GAP - groups, algorithms, and programming - version 3 release 4 patchlevel 4, (1997), Rheinisch Westfälische Technische Hochschule Aachen, Germany, Lehrstuhl D für Mathematik
[18] Springer, T. A., Linear algebraic groups, Progr. Math., vol. 9, (1998), Birkhäuser Boston · Zbl 0927.20024
[19] Steinberg, R., Endomorphisms of linear algebraic groups, Mem. Amer. Math. Soc., vol. 80, (1968), American Mathematical Society Providence, RI · Zbl 0164.02902
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.