Spreading primitive groups of diagonal type
do not exist
Abstract.
The synchronisation hierarchy of finite permutation groups consists of classes of groups lying between -transitive groups and primitive groups. This includes the class of spreading groups, which are defined in terms of sets and multisets of permuted points, and which are known to be primitive of almost simple, affine or diagonal type. In this paper, we prove that in fact no spreading group of diagonal type exists. As part of our proof, we show that all non-abelian finite simple groups, other than six sporadic groups, have a transitive action in which a proper normal subgroup of a point stabiliser is supplemented by all corresponding two-point stabilisers.
1. Introduction
An important fact in the characterisation of a finite permutation group on a finite set is that all -transitive groups are primitive. However, there is a large gap between primitivity and -transitivity, in the sense that relatively few primitive groups are -transitive. In [1], Araújo, Cameron and Steinberg introduced a hierarchy of classes of permutation groups that provides a finer characterisation. These classes include spreading groups, defined in terms of sets and multisets of elements of (see §2 for a precise definition); separating groups, defined in terms of subsets of , or graphs on preserved by ; and synchronising groups, originally defined in [2] in terms of transformation semigroups on containing . (See also [6] for equivalent definitions of these properties in terms of -modules.) In particular, these members of the hierarchy are related as follows (see [1, p. 151]):
Moreover, the finite primitive groups can be divided into five types via the O’Nan–Scott Theorem, and by [1, Thereom 2.11 & Proposition 3.7], each synchronising group is one of three types: almost simple, affine or diagonal (the relevant diagonal type groups will be defined in §2). It is also well-known that each finite -transitive group is almost simple or affine.
Now, [1, §6–7] classifies the affine spreading groups, and provides examples of almost simple groups that are spreading but not -transitive, separating but not spreading, or synchronising but not separating, while [5] describes affine synchronising groups that are not spreading. In addition, [8, Theorem 1.4] states that a primitive group that is not almost simple is synchronising if and only if it is separating. The first (and so far only) known examples of synchronising groups of diagonal type were presented in [4]: the groups acting diagonally on , with and .
Many open questions involving this hierarchy of permutation groups remain, and in this paper, we work towards solving Problem 12.4 of [1], the classification of spreading groups (of almost simple or diagonal type). Specifically, we completely resolve the diagonal case, with the aid of the following theorem.
Theorem 1.1 ([8, Theorem 1.5]).
Let be a synchronising primitive group of diagonal type. Then has socle , where is a non-abelian finite simple group.
In addition, it is shown in [4, Theorem 2] that the diagonal type group is non-spreading for every prime power . We generalise this result to all groups of diagonal type, as follows.
Theorem 1.2.
Each primitive group of diagonal type is non-spreading.
Therefore, the types of spreading groups are precisely the types of finite -transitive groups: almost simple and affine.
For all but six possible socles , we will prove Theorem 1.2 as a consequence of the following result, which may be of general interest, and which distinguishes six sporadic simple groups from all other non-abelian finite simple groups. For the six remaining socles, we employ elementary character theory.
Theorem 1.3.
Let be a non-abelian finite simple group. Then the following are equivalent.
-
(i)
There exists a proper subgroup of and a proper normal subgroup of such that for all .
-
(ii)
There exists a proper subgroup of and a proper normal subgroup of such that for all .
-
(iii)
The group does not lie in the set of sporadic groups.
Property (ii) of this theorem implies that, in the transitive action of on the set of right cosets of , the proper normal subgroup of the point stabiliser is supplemented by all corresponding two-point stabilisers. This is a stronger property than all two-point stabilisers being nontrivial, which is equivalent to the action having base size at least three.
2. Background
In this section, we provide the background on spreading permutation groups, and on primitive groups of diagonal type, that will be necessary to prove Theorems 1.2 and 1.3.
Given a set , a multiset (or set) of elements of and a point , we write to denote the multiplicity of in . We say that is trivial if either is constant on , or there exists a unique point such that . Additionally, a sum of multisets is defined so that for all , and similarly for scalar products of multisets. As usual, the cardinality of is .
We are now able to define spreading permutation groups.
Definition 2.1 ([1, §5.5]).
A transitive permutation group on is non-spreading if there exist a nontrivial subset of and a nontrivial multiset of elements of , such that divides and is constant for all . Otherwise, is spreading.
We shall call a pair satisfying the above properties a witness to being non-spreading. Recall from §1 that each imprimitive group is non-spreading. It is also immediate from Definition 2.1 that if is non-spreading, then so is each transitive subgroup of . The following theorem provides a useful method for finding a witness to a group being non-spreading.
Theorem 2.2 ([3]).
Let be a finite group acting transitively on a finite set , let be a subgroup of , and let a proper normal subgroup of . Additionally, let with , such that for , and . Finally, let for some non-empty . If is transitive on each -orbit of , then is a witness to being non-spreading.
Now, let be a non-abelian finite simple group. In the remainder of this section, we shall consider the primitive groups of diagonal type with socle . To define these groups, let act on the set by . In addition, let be the corresponding permutation representation, and let be the natural permutation representation of on . Then . Finally, let such that for all . Define , and note that . The groups of diagonal type with socle are precisely the subgroups of containing (see, for example, [17, §1]). We will often drop the use of and , and allow elements (and subgroups) of and to denote permutations (and subgroups) of .
In order to derive Theorem 1.2 from Theorem 1.3 (for most non-abelian finite simple groups), we require the following corollary of Theorem 2.2. Throughout the remainder of this section, we will use the elementary fact that if is a transitive permutation group on a set and , then acts transitively on if and only if for each .
Corollary 2.3.
Let be a non-abelian finite simple group, and suppose that there exists a proper subgroup of and a proper normal subgroup of such that for all . Then is a witness to the diagonal type group being non-spreading in its action on .
Proof.
Let , , , and . Note that , as acts transitively on . Let . Then , and . Next, define , and observe that . Thus the orbits of on are for each . Additionally, the stabiliser in of is . As , we observe that is transitive on . The result now follows from Theorem 2.2, applied to the groups , and . ∎
Our next lemma translates Property (i) of Theorem 1.3 into the language of coset actions.
Lemma 2.4.
Let be a non-abelian finite simple group, , and a proper subgroup of . Suppose also that has a proper normal subgroup that acts transitively on each orbit of in its action on the right cosets of in . If , or if all -conjugates of are conjugate in , then for all .
Proof.
Let be the set of right cosets of in . Then the point stabilisers in the action of on are precisely the subgroups with . As is transitive on each orbit in this action, it follows that for all . Hence we are done if . Assume therefore that all -conjugates of are conjugate in . Then for each , there exists such that , and so . ∎
In the case where is one of the six sporadic groups listed in Property (iii) of Theorem 1.3, we will show that is non-spreading using the following lemma, which involves elementary character theory. The multiset in the witness here is similar to that of Theorem 2.2.
Lemma 2.5.
Let be a non-abelian finite simple group, and let be the set of irreducible complex characters of . Suppose also that there exist pairwise non-conjugate elements , and of , such that:
-
(i)
; and
-
(ii)
for all and all with .
Then is a witness to the diagonal type group being non-spreading in its action on .
Proof.
The set and the multiset are clearly nontrivial, and (i) implies that . Thus by Definition 2.1, it remains to prove that is constant for all . In fact, we will show that for all , and it will follow immediately that for all .
As above, , and the transitivity of on implies that . Hence for each , there exist , and such that . Letting , and , we observe from [16, Problem 3.9] that the set has size
where is the complex conjugate of . Since is constant for all , and is constant for all , it follows that . As for each character of , (i) and (ii) yield for all , as required. ∎
Remark 2.6.
For many small non-abelian finite simple groups , it is possible to choose an element satisfying Property (ii) of Lemma 2.5 when and are non-conjugate elements of such that , or more generally, such that . The non-abelian finite simple groups with all elements conjugate to their inverses are classified in [18, Theorem 1.2], and [14, Corollary B.1] shows that and are the only such groups where are conjugate whenever . Denoting conjugacy classes as in the Atlas [13], we observe by inspecting the Atlas character tables of these two groups that we can choose , and when , and , and when . We leave open the problem of determining which non-abelian finite simple groups, if any, do not contain pairwise non-conjugate elements , and satisfying Properties (i) and (ii) of Lemma 2.5.
3. Non-abelian finite simple groups and groups of diagonal type
In this section, we show that Property (i) of Theorem 1.3 holds for all non-abelian finite simple groups other than the sporadic groups , , , , and , and then prove Theorems 1.3 and 1.2. Note that we address the Tits group together with the sporadic groups. Throughout, we use Atlas [13] notation for the structures of groups.
We first consider the finite simple groups of Lie type, beginning with the Chevalley groups (i.e. the untwisted groups of Lie type) defined over fields of size , then the twisted groups of Lie type, and finally the Chevalley groups with .
Proposition 3.1.
Let be a finite simple Chevalley group , with . Then Property (i) of Theorem 1.3 holds for .
Proof.
Let be the prime dividing , and let be a Sylow -subgroup of . Then contains a subgroup such that and form a -pair, and the normal subgroup of complements in (see [12, Ch. 7.2–9.4]). Since (and since is not the soluble group ), we observe from [12, pp. 121–122] that , and so is a proper subgroup of . Furthermore, as is the normaliser in of the Sylow subgroup , all -conjugates of are conjugate in .
By Lemma 2.4, it suffices to show that and have the same orbits in the action of on the set of right cosets of . For each element of the Weyl group , fix a preimage of under the natural homomorphism from to . In addition, let and be elements of so that and lie in a common -orbit. Then the double cosets and are equal. By [12, Theorem 8.4.3], there exist , and such that and . It follows that . As and form a -pair, [12, Proposition 8.2.3] yields . Thus , i.e. and lie in the same -orbit, as required. ∎
Proposition 3.2.
Let be a finite simple twisted group of Lie type . Then Property (i) of Theorem 1.3 holds for .
Proof.
Note that . As above, let be the prime dividing , and let be a Sylow -subgroup of . By [12, Ch. 13–14], contains subgroups , and analogous to those in the proof of Proposition 3.1, so that and form a -pair, and . Furthermore, is nontrivial for all , as is not isomorphic to , or . Although [12] directly states only that , we can show that . Indeed, if this were not the case, then some preimage of a fundamental reflection would normalise (see [12, Proposition 8.2.2 & Theorem 8.3.2]). However, we deduce from Proposition 13.6.1 and the proof of Theorem 13.5.4 in [12] that no such exists, and so . We now proceed exactly as in the proof of Proposition 3.1, this time using Proposition 13.5.3 of [12] instead of Theorem 8.4.3. ∎
Proposition 3.3.
Let be a finite simple Chevalley group . Then Property (i) of Theorem 1.3 holds for .
Proof.
Since is addressed by Proposition 3.1, and since the remaining groups with are not simple, we shall assume that . Let be a root system for , with a system of positive roots and a system of simple roots (see, for example, [12, Ch. 2]). Then is the disjoint union of and , and each node in the Dynkin diagram corresponding to is associated with a unique root in (and vice versa). Hence each diagram automorphism of induces a permutation of . Let and be the simple roots associated with a leaf in and the adjacent node, respectively. Additionally, let be the closure of the set under the group of diagram automorphisms of , so that .
Next, let , and be as in the proof of Proposition 3.1. In this case, the group from that proof is trivial, and so and . By [12, Proposition 2.1.8, p. 68 & p. 93], is generated by a set of involutions ( is written as in [12]), with , and is generated by a set of involutions. Let be the parabolic subgroup of corresponding to the subset of . Then by [12, Ch. 8.5] and the well-known structure of parabolic subgroups of Chevalley groups, has shape for some positive integer , where and are Levi subgroups. Since , all automorphisms of are products of inner and graph automorphisms. Moreover, is fixed setwise by all diagram automorphisms of , which correspond to the graph automorphisms of , and so all -conjugates of are conjugate in . In addition, contains an index two subgroup of shape , where . We will show that for all , and the result will follow from Lemma 2.4.
Since , we deduce as in the proof of Proposition 3.1 that, for each , there exists such that . Thus it suffices to prove that for all (it will immediately follow that for the corresponding ). We also observe using [12, Ch. 8.5] (and the fact that has index two in ) that and . The former containment implies that . To complete the proof, we will show that .
The Weyl group acts linearly on and fixes . Let be the element of corresponding to . By [12, Lemma 7.2.1(i)], and . If , then , and so . Otherwise, and , yielding and hence , which lies in by the previous paragraph. In either case, we see that , as required. ∎
Next, we consider the alternating groups, followed by the sporadic groups and the Tits group.
Proposition 3.4.
Let be a finite simple alternating group . Then Property (i) of Theorem 1.3 holds for .
Proof.
Since and are addressed by Proposition 3.1, we shall assume that . Let be the set of -subsets of a set of size , and let . Then , and all -conjugates of are conjugate in . Additionally, has four orbits on , namely and for . Since the index two subgroup of acts transitively on each of these orbits, and since the action of on is equivalent to its action on the right cosets of , the result follows from Lemma 2.4. ∎
Proposition 3.5.
Let be the Tits group , or a sporadic simple group that does not lie in . Then Property (i) of Theorem 1.3 holds for .
Proof.
We observe from the Atlas [13] that has a maximal subgroup , as specified in Table 1, such that either or all -conjugates of are conjugate in . It is also clear that the group in the table is a proper normal subgroup of . Note that if , then has two normal subgroups isomorphic to ; in what follows, may be chosen as either.
Now, let if , and otherwise. Additionally, let be the permutation character corresponding to the action of on the set of right cosets of in . Then for each , the number of points in fixed by is equal to . By the Cauchy–Frobenius Lemma, and have and orbits on , respectively. It is straightforward to compute and in GAP [15] using the Character Table Library [9] ( is most readily calculated as the inner product ), and in each case we obtain . Thus Lemma 2.4 yields the result. ∎
We are now able to prove Theorem 1.3. Given a group and a non-trivial (core-free) subgroup of , we will write to denote the base size of in its action on the set of right cosets of , i.e., the minimum size of a subset of such that the pointwise stabiliser is trivial. Notice that , as is a point stabiliser in this action.
Proof of Theorem 1.3.
Propositions 3.1–3.5 show that (iii) implies (i), which clearly implies (ii). To complete the proof, we will show that if (iii) does not hold, then neither does (ii). If , then we construct in Magma [7] via the AutomorphismGroupSimpleGroup and Socle functions, and show that (ii) does not hold via fast, direct computations.
Suppose next that , let be a proper subgroup of , and let be a subgroup of . Observe that if , then (as discussed below the statement of Theorem 1.3) the two-point stabiliser is trivial for some . Hence , and so does not satisfy (ii). In general, . By [11, Theorem 1], has only two maximal subgroups (up to conjugacy) with corresponding base size greater than two, namely and , and . Hence any proper subgroup of satisfying (ii) is a non-simple subgroup of or with .
Now, let be the set of right cosets in of a proper subgroup , and let be the number of orbits of on . If , then for all , and it follows from the Orbit-Stabiliser Theorem that . If is a maximal subgroup of either or , then the character table of is included in The GAP Character Table Library. Thus for every such , we can compute as in the proof of Proposition 3.5, and we see that in fact , and hence . To show that for each maximal subgroup of , we construct and in Magma as subgroups of using the respective generating pairs and given in [19]. Magma calculations (with a runtime of less than 10 minutes and a memory usage of 1.5 GB) then show that for all representatives of the conjugacy classes of maximal subgroups of returned by the MaximalSubgroups function. Therefore, and are the only non-simple subgroups of with corresponding base size at least three. Further character table computations in GAP show that if , then for each proper normal subgroup of , the number of -orbits on is greater than the number of -orbits. An additional application of the Orbit-Stabiliser Theorem yields for some . Therefore, (ii) does not hold.
Finally, suppose that . As above, any proper subgroup of satisfying (ii) also satisfies . By [10, Theorem 3.1], the unique (up to conjugacy) proper subgroup of with is the maximal subgroup , with . Since is quasisimple, its centre of order two is its unique nontrivial proper normal subgroup, and lies in each maximal subgroup of . Hence for all , and so (ii) does not hold. ∎
We now prove our main theorem.
Proof of Theorem 1.2.
As each spreading primitive group is synchronising, Theorem 1.1 implies that a spreading primitive group of diagonal type has socle , for some non-abelian finite simple group . For each , let , and let be the subgroup of defined in §2. Recall also that each subgroup of a non-spreading group is non-spreading. Thus it suffices to show that is non-spreading for each . If , then this is an immediate consequence of Theorem 1.3 and Corollary 2.3.
7A | 5A | 5B | |
5A | 7A | 7B | |
5A | 19A | 19B | |
4A | 9A | 9B | |
7A | 39A | 39B | |
110A | 119A | 119B |
Acknowledgements
References
- [1] João Araújo, Peter J. Cameron, and Benjamin Steinberg. Between primitive and 2-transitive: synchronization and its friends. EMS Surv. Math. Sci., 4(2):101–184, 2017.
- [2] Fredrick Arnold and Benjamin Steinberg. Synchronizing groups and automata. Theoret. Comput. Sci., 359(1-3):101–110, 2006.
- [3] John Bamberg, Michael Giudici, Jesse Lansdown, and Gordon F. Royle. Tactical decompositions in finite polar spaces and non-spreading classical group actions (in preparation).
- [4] John Bamberg, Michael Giudici, Jesse Lansdown, and Gordon F. Royle. Synchronising primitive groups of diagonal type exist. Bull. Lond. Math. Soc., 54(3):1131–1144, 2022.
- [5] John Bamberg, Michael Giudici, Jesse Lansdown, and Gordon F. Royle. Separating rank 3 graphs. European J. Combin., 112:Paper No. 103732, 13, 2023.
- [6] John Bamberg and Jesse Lansdown. The synchronisation hierarchy for coherent configurations (in preparation).
- [7] Wieb Bosma, John Cannon, and Catherine Playoust. The Magma algebra system. I. The user language. J. Symbolic Comput., 24(3-4):235–265, 1997.
- [8] John N. Bray, Qi Cai, Peter J. Cameron, Pablo Spiga, and Hua Zhang. The Hall-Paige conjecture, and synchronization for affine and diagonal groups. J. Algebra, 545:27–42, 2020.
- [9] Thomas Breuer. The GAP Character Table Library, Version 1.3.4, 2022.
- [10] Timothy C. Burness. On soluble subgroups of sporadic groups. Israel J. Math., 254(1):313–340, 2023.
- [11] Timothy C. Burness, E. A. O’Brien, and Robert A. Wilson. Base sizes for sporadic simple groups. Israel J. Math., 177:307–333, 2010.
- [12] Roger W. Carter. Simple groups of Lie type, volume Vol. 28 of Pure and Applied Mathematics. John Wiley & Sons, London-New York-Sydney, 1972.
- [13] 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. Maximal subgroups and ordinary characters for simple groups, With computational assistance from J. G. Thackray.
- [14] Walter Feit and Gary M. Seitz. On finite rational groups and related topics. Illinois J. Math., 33(1):103–131, 1989.
- [15] The GAP Group. GAP – Groups, Algorithms, and Programming, Version 4.12.2, 2022.
- [16] I. Martin Isaacs. Character theory of finite groups, volume No. 69 of Pure and Applied Mathematics. Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London, 1976.
- [17] Martin W. Liebeck, Cheryl E. Praeger, and Jan Saxl. On the O’Nan-Scott theorem for finite primitive permutation groups. J. Austral. Math. Soc. Ser. A, 44(3):389–396, 1988.
- [18] Pham Huu Tiep and A. E. Zalesski. Real conjugacy classes in algebraic groups and finite groups of Lie type. J. Group Theory, 8(3):291–315, 2005.
- [19] Robert Wilson, Peter Walsh, Jonathan Tripp, Ibrahim Suleiman, Richard Parker, Simon Norton, Simon Nickerson, Steve Linton, John Bray, and Rachel Abbott. ATLAS of Finite Group Representations - Version 3. http://atlas.math.rwth-aachen.de. Accessed: August 22, 2023.