Primitive almost simple IBIS groups with sporadic socle
Abstract.
An irredundant base for a permutation group is an ordered subset of with trivial stabiliser such that no base point is fixed by the stabiliser of its predecessors. Groups whose irredundant bases all have the same size are termed Irredundant Bases of Invariant Size (IBIS) groups, and were introduced by Cameron and Fon-Der-Flaass. In this paper, we contribute to the classification of primitive IBIS groups by classifying those that are almost simple with sporadic socle.
Let be a permutation group. A base for is a subset of with trivial pointwise stabiliser. The cardinality of the smallest base for is called the base size and denoted . Since their introduction by Sims in the 1970s, bases have been of enduring research interest because of their applications in computational group theory.
An ordered base for is irredundant if, for each with , there is an element of that fixes , but does not fix . We say that is an Irredundant Bases of Invariant Size (IBIS) group if all of its irredundant bases are of the same size. Note that all such irredundant bases must have size equal to the base size of . Amongst the known examples of IBIS groups are and acting naturally on points, as well as the general linear group acting on a finite dimensional vector space , where any spanning set forms a base for , but a spanning set is an irredundant base if and only if it is a basis.
A reordered irredundant base is not irredundant in general. Indeed, Cameron and Fon-Der-Flaass [4], proved that is an IBIS group if and only if any reordering of an irredundant base for is irredundant, and the set of irredundant bases for forms the set of bases of a matroid.
Lucchini et al. [9] recently made a major breakthrough in the study of IBIS groups by proving that a primitive IBIS group can belong to one of only three of the O’Nan-Scott types, namely almost simple, affine or diagonal type. They further showed that the primitive IBIS groups of diagonal type all belong to the infinite family , where each group has degree . Lee and Spiga classified the primitive almost simple IBIS groups with alternating socle [8]. Namely, they show that apart from the aforementioned natural actions of and , there are 14 further examples and in each case, the socle has .
In the present paper, we continue the classification of primitive almost simple IBIS groups by classifying those with a sporadic socle.
Theorem 1.
An almost simple primitive group with sporadic socle is IBIS if and only if is one of , , , or .
The methods used to prove Theorem 1 rely heavily on computation in GAP and Magma [1, 6]. Code to reproduce the results in this paper are available on the author’s website [7].
1. Proof of Theorem 1
The following two results show that we need only consider groups of base size at least three in order to prove Theorem 1, and give an explicit list of cases that we need to investigate.
Lemma 1.1 ([9, Lemma 2.3]).
There are no IBIS groups with non-abelian socle and .
Proposition 1.2 ([3, Theorem 1]).
The almost simple primitive groups with sporadic socle and are known.
Let be an almost simple group with sporadic socle, acting primitively on the cosets of a maximal subgroup of . In general, we expect IBIS groups to be rare, so the majority of the techniques that we employ to prove Theorem 1 involve showing that there exists an irredundant base of of size larger than , so is not IBIS. This may be achieved in a variety of ways, some of which we now set out. The labellings of these techniques will allow us to be more concise later on.
-
(T1)
We consider as a permutation group on cosets of , and we construct a partial irredundant base of size by random search.
-
(T2)
We observe that the stabiliser in of a coset is . Therefore, we find a set of conjugates of by random search such that, writing , we have a descending chain of subgroups . This implies that is a partial irredundant base for .
-
(T3)
We choose a subgroup , and show that has an irredundant base of size larger than in its action on the cosets of .
We now embark on the proof of Theorem 1.
1.1.
In all of these cases, we are able to construct the permutation representation of acting on cosets of in Magma by first constructing as a matrix group, finding its maximal subgroups and using the LMGCosetImage function. We prove most groups are not IBIS by applying (T1). The remaining cases are when is one of , , , or ; we prove they are IBIS by enumerating a set of orbit representatives on -tuples, and showing that each is either an irredundant base, or is not a base.
1.2.
Here at least one of the permutation representations equivalent to acting on cosets of is not readily available. In most cases however, we are able to construct using the AtlasSubgroup command as part of the AtlasRep package of GAP [2, 6]. We then apply (T2) in each case and deduce that is not IBIS.
1.3.
In view of Proposition 1.2, we have , where in each case.
Let . We appeal to (T3) by considering the centraliser of an element of order 5. We find has two classes of elements of order 5 and, by the centraliser orders, we deduce that both classes are contained in the class labelled 5A in . Now is maximal in [5, p. 174] and, replacing with a conjugate if necessary, a construction of is available as a straight line program in the Online Atlas [13]. Without loss, we choose to be in class 5A in , so that , and find candidates for using the Subgroups command in Magma. In order to construct an partial irredundant base for of length 3, we first fix the trivial coset so that we now must find a partial irredundant base for of size 2. We then randomly search for two elements such that the following conditions hold:
-
(1)
, so that and are distinct.
-
(2)
, and
-
(3)
so that forms a partial irredundant base for by (T2).
Choosing , in this way allows us to verify each of these conditions in rather than , which significantly reduces the computational resources required. We find an appropriate via random search and therefore prove that is not IBIS.
If instead , we repeat the same process, instead considering the centraliser of an involution in class 2A of . We deduce that is not IBIS.
1.4.
By Proposition 1.2, we only need consider the action of on right cosets of one of its maximal subgroups , where in each case.
Suppose . Now is the stabiliser of a vector in the irreducible 112-dimensional representation of over [5, p.190]. Generators for and in this representation, along with a vector fixed by , are given in the Online Atlas [13]. The action of on cosets of is then permutationally isomorphic to the action of on . We consider a subgroup of and find that along with two further vectors in obtained by random search have stabiliser order chain in . The result follows applying (T3).
Now suppose . We employ technique (T3) with the centraliser of an element of order 5. There is a single class of elements of order 5 in and so we have , while . Two elements are representatives for the same coset in if and only if . We find appropriate via random search such that by (T2) we can deduce that and form a partial irredundant base for , so is not IBIS.
Finally, suppose . We apply (T3) with a subgroup of . The construction of such a subgroup is available in the Online Atlas, and we find that fixes a non-zero vector . As before, we consider the action of on . By random search, we find such that , so is not IBIS.
1.5.
By Lemma 1.1 and Proposition 1.2, if is IBIS, then and . In each case, straight line programs for the generators of in terms of standard generators of are available in the Online Atlas. We proceed by applying (T3) in the same fashion as in Section 1.3. More explicitly, if , then we apply (T3) by considering the centraliser of an involution lying in the class labelled 2A of . If instead , we again consider the centraliser of a 2A involution in .
1.6.
By Proposition 1.2, it remains to check that the action of on cosets of , where . First fix the identity coset, whose stabiliser is . If is IBIS, then every irredundant base of on has size 2. Let be an element of order 17. We consider with the view of employing (T3). We may construct in GAP as a subgroup of its maximal overgroup using the Online Atlas [5, p.234]. We know from the character table of [5, p.210–219] that . Now has a single conjugacy class of subgroups of order 136, so without loss of generality, we may fix one of them and set it to be . Now is divisible by 3 and 7, while is not, so take to be elements of orders 3 and 7 respectively. Clearly , and we must also verify that . We observe that fixes if and only if . Since , we must have , and a similar argument holds for . Therefore, we check directly in our construction of and in GAP that there exist , such that: (1) so that , are distinct, (2) and (3) . Together, these demonstrate that has a partial irredundant base of size 2 on , hence so does . Therefore, is not IBIS.
1.7.
By Proposition 1.2, we need to consider
The action of on cosets of has base size 3 in all cases except , where .
First let . We can construct as the centraliser of an element in conjugacy class of . The orbit lengths of on 2A involutions are given in [5, p. 216] and we reproduce them in Table 1.
Class of | ||
---|---|---|
0 | 1A | |
1 | 2B | |
2 | 2C | |
3 | 3A | |
4 | 4B |
Let be an orbit representative of the orbit labelled in Table 1. We claim that forms a partial irredundant base for , implying is not IBIS. Clearly by definition and by Table 1. Choosing and appropriately, we find that the Sylow 2-subgroup of has order , while the Sylow 2-subgroup of has order . Therefore, these groups are distinct and non-trivial, so the claim is proved.
Now let . Similar to the last case, can be constructed as the centraliser of an involution in class 2B of , and we can instead consider the action of on its class 2B. Müller [10, Table 1] computed the orbit lengths of on 2B involutions. The smallest non-trivial orbit has length 93150 and so the size of a stabiliser in of an element of this orbit is larger than the number of cosets of in . Therefore, it is impossible to construct an irredundant base of size 3 that begins with , so is not IBIS.
Now let . The -orbits on cosets of were computed by Müller et al. [11, Table 2]. The Sylow 7-subgroup of has order 7, as do the stabilisers and of elements in the non-trivial orbits labelled 2 and 3 in [11, Table 2] respectively. Hence, taking appropriate representatives of these orbits, we achieve an irredundant partial base of size 3 stabilised by an element of order 7. Since the stabiliser is not trivial, is not IBIS.
Next suppose . Neunhöffer et al. [12, Table 1] computed a subset of the -suborbits of acting on cosets of . Although only the orbit lengths and sizes of the corresponding stabilisers in are available, this is sufficient to show is not IBIS. There is a single class of elements of order 5 in , and two distinct orbits of on cosets with stabiliser sizes 240 and 120. Therefore, by choosing representatives of these orbits appropriately, we can construct a partial irredundant base of size three stabilised by an element of of order 5. Therefore, is not IBIS.
For the remaining maximal subgroups , and we adopt a different approach. In the following construction, we will use to refer to any one of the groups or . Let have order 6, and let . We will construct distinct cosets and such that is fixed by and , while is fixed by , but not . This will show that form a partial irredundant base for in its coset action on , and so is not IBIS.
Now, fixes if and only if , and similarly for . Hence, it is sufficient to exhibit and such that , while . Notice that we may simplify the problem slightly by taking . We must then check that and that to ensure that , and are distinct. Since , the probability of finding such that is proportional to
We try to maximise this quantity in our choice of the class of , and using the Character Table Library in GAP (including the labelling of classes given there), we choose from classes , and in , and respectively.
We now turn to a computational search in Magma. The relevant code to reproduce the procedure we describe is available on the author’s website. We are able to construct as a matrix group in a 4370-dimensional representation over , and construct each of the maximal subgroups using straight-line programs on the standard generators, which are available in [13]. We observe that each maximal subgroup acts reducibly on the underlying vector space , so we compute the submodules preserved by each maximal subgroup. In each case, we are able to find a relatively small submodule on which acts faithfully. We project onto this submodule so that we are able to find the conjugacy classes of using the LMGClasses function. Once we have found an appropriate element , we then find the preimage in the 4370-dimensional representation of , and define . We compute using CentraliserOfInvolution function, and search for and satisfying the above conditions by random selection. Since determining membership of a random element of in is very time-consuming, we instead equivalently check whether the element preserves a submodule fixed by . We are able to find an appropriate and in each case, so infer that is not IBIS in its coset actions on , and .
The proof of Theorem 1 is now complete.
Acknowledgements
The author would like to thank Eamonn O’Brien for helpful discussions and assistance with the intensive computations required for the proof for the Baby Monster. The author also acknowledges the support of an Australian Research Council Discovery Early Career Researcher Award (project number DE230100579).
References
- [1] W. Bosma, J. Cannon, and C. Playoust. The Magma algebra system. I. The user language. J. Symbolic Comput., 24(3-4):235–265, 1997. Computational algebra and number theory (London, 1993).
- [2] T. Breuer, J. N. Bray, S. Nickerson, R. A. Parker, and R. A. Wilson. AtlasRep — A GAP 4 Package (Version 2.1.0).
- [3] T. C. Burness, E. A. O’Brien, and R. A. Wilson. Base sizes for sporadic simple groups. Israel J. Math., 177:307–333, 2010.
- [4] P. J. Cameron and D. G. Fon-Der-Flaass. Bases for permutation groups and matroids. European Journal of Combinatorics, 16(6):537–544, 1995.
- [5] J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, and R. A. Wilson. Atlas of finite groups. Oxford University Press, Eynsham, 1985.
- [6] The GAP Group. GAP – Groups, Algorithms, and Programming, Version 4.9.3, 2018.
- [7] M. Lee. Code supplement for ”Primitive almost simple IBIS groups with sporadic socle”. https://melissamaths.wordpress.com/ibis_sporadic/.
- [8] M. Lee and P. Spiga. A classification of finite primitive IBIS groups with alternating socle, 2022. arXiv:2206.01456.
- [9] A. Lucchini, M. Morigi, and M. Moscatiello. Primitive permutation IBIS groups. J. Combin. Theory Ser. A, 184:105516, 2021.
- [10] J. Müller. On the action of the sporadic simple Baby Monster group on its conjugacy class 2B. LMS J. Comput. Math., 11:15–27, 2008.
- [11] J. Müller, M. Neunhöffer, and R. A. Wilson. Enumerating big orbits and an application: acting on the cosets of . J. Algebra, 314(1):75–96, 2007.
- [12] M. Neunhöffer, F. Noeske, E. A. O’Brien, and R. A. Wilson. Orbit invariants and an application to the Baby Monster. J. Algebra, 341:297–305, 2011.
- [13] R. A. Wilson et al. ATLAS of Finite Group Representations – Version 3. http://atlas.math.rwth-aachen.de/Atlas/v3/.