Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules
Alice C. Niemeyer, Sabina B. Pannek, Cheryl E. Praeger

TL;DR
This paper investigates the properties of pairs of 'fat' elements in finite general linear groups, showing that most such pairs generate irreducible subgroups and analyzing their structural characteristics.
Contribution
It provides probabilistic bounds on the likelihood that pairs of fat elements generate reducible subgroups and explores their action on large invariant subspaces.
Findings
Most pairs of fat elements generate irreducible subgroups.
The probability of generating a reducible subgroup is less than q^{-d+1}.
Reducible subgroups act irreducibly on large subspaces and preserve fatness.
Abstract
We call an element of a finite general linear group \emph{fat} if it leaves invariant, and acts irreducibly on, a subspace of dimension greater than . Fatness of an element can be decided efficiently in practice by testing whether its characteristic polynomial has an irreducible factor of degree greater than . We show that for groups with most pairs of fat elements from generate irreducible subgroups, namely we prove that the proportion of pairs of fat elements generating a reducible subgroup, in the set of all pairs in , is less than . We also prove that the conditional probability to obtain a pair in which generates a reducible subgroup, given that are fat elements, is less than . Further, we show that any reducible subgroup…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules
Alice C. Niemeyer, Sabina B. Pannek, Cheryl E. Praeger
Abstract
We call an element of a finite general linear group fat if it leaves invariant, and acts irreducibly on, a subspace of dimension greater than . Fatness of an element can be decided efficiently in practice by testing whether its characteristic polynomial has an irreducible factor of degree greater than . We show that for groups with most pairs of fat elements from generate irreducible subgroups, namely we prove that the proportion of pairs of fat elements generating a reducible subgroup, in the set of all pairs in , is less than . We also prove that the conditional probability to obtain a pair in which generates a reducible subgroup, given that are fat elements, is less than . Further, we show that any reducible subgroup generated by a pair of fat elements acts irreducibly on a subspace of dimension greater than , and in the induced action the generating pair corresponds to a pair of fat elements.
Mathematics Subject Classification (2010). Primary 20G40; Secondary 20P05.
Keywords. General linear group, proportions of elements, large irreducible subspaces.
††The results of this paper form part of the Australian Research Council funded project DP110101153 of the first and third author. The third author is also supported by the Australian Research Council Federation Fellowship FF0776186.
The second author is greatful for support of her PhD Fellowship funded by the German National Academic Foundation (Studienstiftung des deutschen Volkes). This paper is part of her PhD project as a co-tutelle student at RWTH Aachen University and the University of Western Australia.
1 Introduction
Consider the finite general linear group for , that is the group of invertible -matrices over the finite field of order . For a subgroup of the underlying vector space of row vectors of length over becomes a right -module via the natural “vector times matrix” action. We call this module the natural -module. An element is said to be fat, or more precisely a -element, if the natural -module has an irreducible -submodule of dimension , or equivalently, if the characteristic polynomial for has an irreducible factor over of degree . Fat pairs, that is pairs of fat elements, relative to the (not necessarily distinct) integers are called -pairs. Further, a pair in is said to be reducible or irreducible according as the natural -module has this property.
Let denote the finite special linear group, the group of all matrices in with determinant 1. Motivated by the wish to upgrade the Classical Recognition Algorithm [5] (see discussion in Section 2), we study fat pairs in for a matrix group satisfying . We first give an explicit upper bound for the proportion of reducible fat pairs in the set of all pairs in . We denote this proportion by .
Theorem 1.1**.**
Let . If is a group with , then
[TABLE]
Let be the proportion of reducible pairs in the set of fat pairs in . Equivalently, we may define to be the (conditional) probability that, on a single random selection from the set of fat pairs in , we obtain a reducible pair. An upper bound for is given in
Theorem 1.2**.**
Let . If is a group with , then
[TABLE]
Our next theorem shows that each reducible fat pair leads to an irreducible fat pair on a quotient space of dimension greater than .
Theorem 1.3**.**
For integers satisfying , let be a -pair, and let be the natural -module. Then there exists an -composition factor of with , such that writing for the element in induced by on , is an irreducible -pair.
The proofs of Theorems 1.1 and 1.2 (see Subsections 5.2 and 5.3) rely on the following observation. A fat pair , where satisfies , is reducible, if and only if there exists a non-trivial and proper -invariant subspace . In this case lie in the maximal parabolic subgroup . The key ingredient to prove Theorems 1.1 and 1.2 is to show in Lemma 4.4 that for the proportion of -elements in equals the proportion of -elements in . The results then follow by summing the number of fat pairs over all possible maximal parabolic subgroups of . The proof of Theorem 1.3 is presented in Subsection 5.1. In Section 2 we motivate the results of this paper. The linear algebra background required is presented in Section 3, while the group theoretic preliminaries are in Section 4.
2 Motivation
The principal motivation for the work reported in this paper is the Classical Recognition Algorithm [5]. This is a one-sided Monte Carlo algorithm that, given a set of generating matrices for a subgroup of the finite general linear group , examines whether contains a “classical group” in its natural representation, that is whether (in its natural representation) contains , or a -dimensional symplectic, unitary or orthogonal group defined over . The performance of the algorithm has been described by Leedham-Green in [3] as “one of the most efficient algorithms in the business”. The algorithm seeks particular kinds of elements, called ppd-elements, in by making independent uniformly distributed random selections of elements from . A ppd-element, or more precisely a -element for some integer with , is an element such that has order divisible by a prime divisor of which does not divide for any . It is shown in [5] that -elements with greater than are very likely to occur in classical groups. Under some additional hypotheses, finding a pair of ppd-elements from allows us to conclude that contains a classical group. The proof of this relies on good estimates of the proportions of ppd-elements along with deep group theoretic analysis (depending on the simple group classification). In the long run, we wish to upgrade the Classical Recognition Algorithm in a threefold manner as described below. This paper takes a first step in this direction.
First, note that by [5, Lemma 5.1], given a -element with , there exists a unique irreducible -dimensional -submodule of the natural -module. In particular, is a -element. While every ppd-element is fat the converse implication is not true, as the presence of an -dimensional irreducible -submodule of the natural -module is not sufficient to guarantee that is a -element. For example in , an element of order is a -element but not a -element since has no prime divisors which do not divide . However, even though fat elements do not necessarily need to be ppd-elements, most of them turn out to be. Our goal is to remove the restriction of looking for ppd-elements in the Classical Recognition Algorithm and evolve the algorithm into one based solely on elements with large irreducible submodules. Dropping the ppd-property should result in an even better performance of the algorithm as in practice fatness can be tested more cheaply than the -property by finding an irreducible factor of degree greater than of the characteristic polynomial. The wish to waive the ppd-property raises the following problem which we intend to address in further work.
Problem 2.1**.**
Describe all subgroups of containing an irreducible -pair for .
As presented in [5], the Classical Recognition Algorithm takes as input a basis for the non-degenerate sesquilinear forms preserved by the subgroup , as well as the knowledge that is irreducible on the underlying vector space. This requirement is reasonable as efficient algorithms for testing irreducibility exist (namely the Meataxe algorithm due to Richard Parker [6] and the improved, general purpose version of it developed by Holt and Rees [2]). Yet, we wish to develop a new (fat element based) recognition algorithm without the necessity to test for irreducibility. In order to evaluate how this move modifies the situation, Theorem 1.2 gives a good upper bound for the (conditional) probability of obtaining, on a single random selection from the set of fat pairs in (where ), a reducible pair. We expect that similar bounds will hold if for any classical group .
Finally, by Theorem 1.3, if for a given matrix group with , contains a fat pair, then has a quotient which is isomorphic to a matrix group of degree , such that contains an irreducible fat pair. This suggests that recognition of groups containing classical groups could be generalised to test if a (reducible) subgroup of has a large quotient containing or an -dimensional symplectic, unitary or orthogonal group, with .
3 Linear algebra preliminaries
Throughout this section let be a power of a prime, a non-negative integer, and a -dimensional vector space defined over the finite field .
The proofs of Theorems 1.1 and 1.2 involve counting certain subspaces in . As usual we denote the number of -dimensional subspaces in (for ) by so-called Gaussian coefficients (see for example [1, p. ]).
Definition 3.1**.**
For a non-negative integer , the Gaussian coefficient is defined to be the number of -dimensional subspaces in .
An explicit formula for is given for example in [1, ].
Lemma 3.2**.**
Let be a non-negative integer. Then
[TABLE]
and in particular
For a rational number let be the smallest integer which is at least .
Lemma 3.3**.**
If , then
Proof.
Since for , is the number if -dimensional subspaces in , we have for , and obtain
[TABLE]
Note that and , whence
[TABLE]
If , then . For we use induction on to show that . Now, . Next, assuming , we have
[TABLE]
By assumption, , and thus
[TABLE]
Using and ,
[TABLE]
We therefore have , as asserted. ∎
4 Group theory preliminaries
In this section we assume that is an integer, and is a power of a prime. Let be the natural -module, that is the vector space of -dimensional row vectors over on which acts naturally.
For and a subspace , we denote by the subgroup of which leaves invariant, that is . Using an argument very similar to [7, proof of Theorem 4.1] we obtain
Lemma 4.1**.**
Let be integers, and of dimension .
If , then acts transitively on the set of all -dimensional subspaces such that . 2.
If , then acts transitively on the set of all -dimensional subspaces .
In particular, is transitive on the all -dimensional subspaces in .
As specified in the introduction, we call an element a -element, if has an irreducible -submodule of dimension . In the remainder of this section we shall be concerned with the proportions of -elements in (maximal parabolic subgroups of) , where satisfies .
Definition 4.2**.**
For an integer and , define to be the proportion of -elements in . Set .
Lemma 4.3**.**
For an integer we have .
Proof.
For , the lower bound is given in [4, Lemma 2.3]. From the proof of the same lemma it follows that for all we have , where is a proper subset of with
[TABLE]
For we thus get (using )
[TABLE]
as required. Since , the upper bound follows (for all ). ∎
The proof of the following lemma is based on [5, proof of Lemma 5.4].
Lemma 4.4**.**
Let be a group satisfying , and let . Let be an integer such that . Then, contains a -element if and only if , and in this case
[TABLE]
In particular, .
Proof.
We set . If , then it is easy to verify that contains a -element.
Conversely, suppose that contains a -element , and let be the irreducible -submodule of with . Note that is uniquely determined, as it is irreducible and of dimension . The intersection is an -submodule of . Hence , and in particular or . Recall from Lemma 4.1 that acts transitively on the set , where
[TABLE]
Since , by the orbit stabiliser theorem . Thus, the number of -elements in equals times the number of -elements in , that is , whence .
Let be the representation afforded by as an -submodule of . Let be the kernel of . If for the coset contains a -element, then every element of is a -element. It follows that the number of -elements in equals times the number of -elements in , that is . Then, using , we get .
Finally, since , we have and thus . This proves the assertion, as .
By setting we obtain that . ∎
5 Proofs of main results
Throughout this section let be a positive integer, a finite field of order for some prime power , and the natural -module.
5.1 Proof of Theorem 1.3
If is a -pair for some integers , then by definition determines an (uniquely determined) -dimensional irreducible -submodule of In addition, there may or may not exist a proper and non-trivial -submodule of according as is reducible or not. The following lemma presents a basic, yet critical property of in such a setting. Note that, if , then is irreducible. Hence, in order that exists, we assume that each . We write for the intersection of all -submodules in which contain and .
Lemma 5.1**.**
Let with , and let be a reducible -pair in . For let denote the irreducible -submodule of of dimension , and let be a -submodule of . Then exactly one of the following holds:
, and , or 2.
* and .*
In particular, .
Proof.
For the intersection is an -submodule of . Since is irreducible it follows that is trivial or non-proper. Suppose that for some , and . Then which contradicts . Thus either for , or for . In the first case, and (a) holds. In the second case, , and as each , also , so (b) holds. ∎
Proof of Theorem 1.3.
For , let denote the -submodule of with . Let , and let be an -submodule of maximal by inclusion with respect to the property . Define . For , \mathcal{U}_{i}\cong(\mathcal{U}_{i}\oplus\mathcal{Y})\bigl{/}\mathcal{Y}\leq\mathcal{X}/\mathcal{Y} can be viewed as a submodule of . It follows that , and that the pair induced by on is a -pair.
It remains to prove that is irreducible, that is is an -composition factor of . We do this by showing that is a maximal -submodule of . Suppose that there exists an -module satisfying . By Lemma 5.1, we either have for , or . Since and , the latter case cannot occur. Hence, is a proper -submodule of that satisfies and properly contains . This, however, is not true as we have chosen to be maximal with respect to this property. ∎
5.2 Proof of Theorem 1.1
Given a group , which satisfies , we wish to find a good upper bound for the proportion of reducible fat pairs in . As a first step, we consider the proportion of reducible fat pairs relative to some fixed parameters .
Definition 5.2**.**
For a group such that , and integers we define to be the proportion of reducible -pairs in the set of all pairs in .
Lemma 5.3**.**
Let such that , and let be a group satisfying . Then
[TABLE]
Proof.
The pair is a reducible -pair if and only if there exists at least one non-trivial and proper subspace such that is a -element in . By Lemma 5.1, . We thus obtain the following upper bound for the number of reducible -pairs in .
[TABLE]
where , and with . By Lemma 4.4, , and hence
[TABLE]
with as before. Since acts transitively on the set of all -dimensional subspaces in there is a total of such subspaces, whence
[TABLE]
where as before. Using the notation from Definition 3.1, we write . Then, since , and since ,
[TABLE]
Then, by Lemmas 3.3 and 4.3, . ∎
Note that for with we have . This observation together with the upper bound given in Lemma 5.3 are the main ingredients of the
Proof of Theorem 1.1.
In the case any -pair is irreducible, and thus . Hence, using Lemma 5.3,
[TABLE]
where . An easy argument estimating the sum by an integral shows that . Hence, \mbox{\rm{red}\emph{and}\hskip 0.56917pt\rm{fat}}(G)<2\bigl{(}\ln(2)\bigr{)}^{2}q^{-d+1}<q^{-d+1}, as required. ∎
5.3 Proof of Theorem 1.2
Recall that for a group with we write for the proportion of reducible fat pairs in the set of fat pairs from . Our final task is to prove the upper bound for given in Theorem 1.2.
Proof of Theorem 1.2.
For integers with we write for the number of reducible -pairs in , and for the number of -pairs in . By Lemma 4.4 we have for , whence
[TABLE]
If , then every -pair in is irreducible, and hence in that case. If , then
[TABLE]
by Lemma 5.3. Note also that being a proportion , and thus . We obtain
[TABLE]
∎
Acknowledgement
The results presented in this paper improve and expand results from the Diplom thesis of the second author, which was submitted at the University of Bayreuth. She thanks her supervisor, Adalbert Kerber, for valuable discussions and academic guidance during that time. The Diplom thesis, on the other hand, developed from her honours thesis submitted at the University of Western Australia under the supervision of the first and third author.
The second author is also indebted to Gerhard Hiß for numerous discussions and fruitful suggestions which improved the clarity of this work.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Peter J. Cameron. Combinatorics: topics, techniques, algorithms . Cambridge University Press, Cambridge, 1994.
- 2[2] Derek F. Holt and Sarah Rees. Testing modules for irreducibility. J. Austral. Math. Soc. Ser. A , 57(1):1–16, 1994.
- 3[3] Charles R. Leedham-Green. The computational matrix group project. In Groups and computation, III ( ( ( Columbus, OH, 1999 ) 1999) , volume 8 of Ohio State Univ. Math. Res. Inst. Publ. , pages 229–247. de Gruyter, Berlin, 2001.
- 4[4] Peter M. Neumann and Cheryl E. Praeger. A recognition algorithm for special linear groups. Proc. London Math. Soc. ( 3 ) 3 (3) , 65(3):555–603, 1992.
- 5[5] Alice C. Niemeyer and Cheryl E. Praeger. A recognition algorithm for classical groups over finite fields. Proc. London Math. Soc. ( 3 ) 3 (3) , 77(1):117–169, 1998.
- 6[6] R. A. Parker. The computer calculation of modular characters (the meat-axe). In Computational group theory ( ( ( Durham, 1982 ) 1982) , pages 267–274. Academic Press, London, 1984.
- 7[7] Donald E. Taylor. The geometry of the classical groups , volume 9 of Sigma Series in Pure Mathematics . Heldermann Verlag, Berlin, 1992.
