Pre-primitive permutation groups
Marina Anagnostopoulou-Merkouri, Peter J. Cameron, Enoch Suleiman

TL;DR
This paper explores the concept of pre-primitive permutation groups, analyzing their properties, relationships with other group classes, and describing invariant partitions across various group classes to understand their structure.
Contribution
It introduces and investigates the notion of pre-primitivity, examining its independence from quasiprimitivity and its relation to primitivity, with detailed descriptions of invariant partitions in different group classes.
Findings
Pre-primitivity and quasiprimitivity are independent properties.
Pre-primitivity combined with quasiprimitivity implies primitivity.
Descriptions of invariant partitions for various transitive groups.
Abstract
A transitive permutation group on a finite set is said to be pre-primitive if every -invariant partition of is the orbit partition of a subgroup of . It follows that pre-primitivity and quasiprimitivity are logically independent (there are groups satisfying one but not the other) and their conjunction is equivalent to primitivity. Indeed, part of the motivation for studying pre-primitivity is to investigate the gap between primitivity and quasiprimitivity. We investigate the pre-primitivity of various classes of transitive groups including groups with regular normal subgroups, direct and wreath products, and diagonal groups. In the course of this investigation, we describe all -invariant partitions for various classes of permutation groups . We also look briefly at conditions similarly related to other pairs of conditions, including transitivity andā¦
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.
Taxonomy
Topicssemigroups and automata theory Ā· Advanced Topology and Set Theory Ā· Finite Group Theory Research
Pre-primitive permutation groups
Marina Anagnostopoulou-Merkouri111School of Mathematics, University of Bristol, BS8 1UG, UK; [email protected],ā Peter J. Cameron222School of Mathematics and Statistics, University of St Andrews, Fife, KY16 9SS, UK; [email protected]
and Enoch Suleiman333Department of Mathematics, Federal University Gashua, Yobe State, Nigeria; [email protected]
Abstract
A transitive permutation group on a finite set is said to be pre-primitive if every -invariant partition of is the orbit partition of a subgroup of . It follows that pre-primitivity and quasiprimitivity are logically independent (there are groups satisfying one but not the other) and their conjunction is equivalent to primitivity. Indeed, part of the motivation for studying pre-primitivity is to investigate the gap between primitivity and quasiprimitivity. We investigate the pre-primitivity of various classes of transitive groups including groups with regular normal subgroups, direct and wreath products, and diagonal groups. In the course of this investigation, we describe all -invariant partitions for various classes of permutation groups . We also look briefly at conditions similarly related to other pairs of conditions, including transitivity and quasiprimitivity, -homogeneity and -transitivity, and primitivity and synchronization.
**Keywords: **transitive permutation group, invariant partition, quasiprimitivity
1 Introduction
In his pioneering work on permutation groups in his Second MemoirĀ [5], Galois introduced the notion of primitivity, which has occupied the attention of mathematicians ever since. However, NeumannĀ [8] has pointed out that Galois confused two inequivalent conditions for the transitive permutation groupĀ on :
- ā¢
preserves no non-trivial partition of (the trivial partitions being the partition into singletons and the partition with a single part);
- ā¢
every non-trivial normal subgroup of is transitive.
The first of these conditions is what is now called primitivity, while the second is quasiprimitivity. Since the orbit partition of a normal subgroup is -invariant, we see that a primitive group is quasiprimitive; but the converse is false, as we may see by considering the regular representation of a non-abelian simple group.
In order to investigate the gap between these two properties, we make the following definition: The transitive permutation group on is pre-primitive if every -invariant partition is the orbit partition of a subgroup of . We can assume that this subgroup is normal:
Proposition 1.1
If a -invariant partition is the orbit partition of a subgroup of , then it is the orbit partition of a normal subgroup.
**Proof **
The set of permutations fixing all parts of a -invariant partition is a normal subgroup of . āā
Theorem 1.2
- (a)
There are permutation groups which are quasiprimitive but not pre-primitive, and permutation groups which are pre-primitive but not quasiprimitive. 2. (b)
A permutation group is primitive if and only if it is quasiprimitive and pre-primitive.
**Proof **
We establish the second statement first. We have noted that a primitive group is quasiprimitive; it is also pre-primitive, since both trivial partitions are orbit partitions of subgroups (the trivial group and the whole group respectively). Conversely, suppose that is pre-primitive and quasiprimitive, and let be a -invariant partition. Then is the orbit partition of a subgroup of . As noted after the definition, we may assume that is normal in ; now quasiprimitivity shows that is trivial or transitive, so is trivial.
We have seen examples of quasiprimitive groups which are not primitive, and hence not pre-primitive. For the other case, let be an abelian group which is not of prime order, acting regularly. Then the -invariant partitions are the coset partitions of subgroups of , and so is pre-primitive but not primitive, hence not quasiprimitive. āā
We give here another general property of pre-primitivity, which it shares with many permutation group properties.
Theorem 1.3
Pre-primitivity is upward-closed; that is, if and are transitive permutation groups on with pre-primitive and , then is pre-primitive.
**Proof **
With these hypotheses, let be a -invariant partition. Then clearly is -invariant, so it is the orbit partition of a subgroup of ; and we have . āā
We also give a group-theoretical characterisation of pre-primitivity.
Theorem 1.4
Let be transitive on , and take . Then is pre-primitive if and only if every subgroup containing has the form for some normal subgroup of .
**Proof **
We observe that every subgroup containing is the stabiliser of the part containing of some -invariant partition . If is pre-primitive, then there is a normal subgroup of whose orbits are the parts of ; then the -orbit of is the part of containing , and so . Conversely, if for some normal subgroup of , then the -orbit of is equal to the -orbit, and so is a part of ; since is normal, every -orbit is a part of . Thus is pre-primitive. āā
In the remainder of the paper, we consider various classes of transitive groups, including groups with regular normal subgroups, direct and wreath products of transitive groups, and diagonal groupsĀ [2]. We attempt to determine when these groups are pre-primitive; in some cases we succeed, in others we obtain necessary and sufficient conditions which are quite close together. We report the result of computations on the numbers of transitive groups of small degree which are pre-primitive, quasiprimitive and primitive respectively, showing that the first two conditions are approximately statistically independent. In several cases we determine all the -invariant partitions for certain types of permutation group.
In the last section we consider similar conditions relating to other pairs of permutation group properties, the second being stronger than the first:
- ā¢
transitivity and quasiprimitivity;
- ā¢
-homogeneity and -transitivity;
- ā¢
primitivity and synchronizationĀ [1, 9].
These all turn out to be of less interest. The first case is trivial. In the second, the property we are looking for is Neumannās notion of generous -transitivityĀ [7], which has been much studied, especially for . In the third case, we define an appropriate property which we call pre-synchronization, but we prove that the only transitive group which is pre-synchronizing but not synchronizing is the Klein group of orderĀ .
2 Pre-primitive groups of specific types
In this major section we discuss some familiar types of transitive permutation groups with a view to deciding when they are pre-primitive.
2.1 Groups with regular normal subgroups
To help fix the ideas, we first discuss groups acting regularly. If acts regularly on , then the set is bijective with and the given action is isomorphic to the action by right multiplication. If the point corresponds to the identity of , then:
- (a)
a partition of is -invariant if and only if it is the right coset partition of a subgroup of ; 2. (b)
a partition of is the orbit partition of a subgroup of if and only if it is the left coset partition of .
For (a), suppose that is the part of the partition containing the identity. Then for , multiplication by maps to , so fixes ; thus . So is a subgroup of . Then, for any , is a part of the partition. So the claim is proved.
For (b), let be a subgroup of . Then the orbit of containing is the left coset . So the claim holds.
It follows that the regular group is pre-primitive if and only if, for every subgroup , the left and right coset partitions of coincide, that is, is a normal subgroup. We will state this formally as a corollary of the main result of this section.
Theorem 2.1
Let be a permutation group on with a regular normal subgroup . Then is pre-primitive if and only if every -invariant subgroup of is normal in .
**Proof **
Since is a regular normal subgroup of , we have , and we can identify with in such a way that acts by right multiplication and acts by conjugation. Moreover, we can assume that is the identity element of (seeĀ [11, TheoremĀ 11.2]).
Suppose that is pre-primitive. Let be a -invariant subgroup of . The right coset partition of is -invariant. It is also -invariant: for if is a right coset of and , then for some . Since , is -invariant. Since is pre-primitive, is the orbit partition of a normal subgroup of . Now , so . Since s regular, it follows that .
Conversely, assume that every -invariant subgroup of is normal in . Choose a -invariant partition . Since is -invariant it is the right coset partition of a subgroup of , which is also -invariant, since fixes the part of containing the identity. Thus is normal in . The normal subgroup of fixing every part of contains , and is the orbit partition of . āā
This result allows us to deal with some special types of permutation groups. First we state and prove our earlier result about regular groups. Recall that a Dedekind group is a finite group in which every subgroup is normal. DedekindĀ [4] showed:
Theorem 2.2
A finite group is a Dedekind group if and only if either is abelian, or , where is the quaternion group of orderĀ , is an elementary abelian -group, and is an abelian group of odd order.
Corollary 2.3
The regular action of a finite group is pre-primitive if and only if is a Dedekind group.
**Proof **
In this case, TheoremĀ 2.1 applies with and . Thus every subgroup of is -invariant; so is pre-primitive if and only if every subgroup of is normal. āā
The holomorph of a group is the semidirect product of with . It acts as a permutation group on , where acts by right multplication and in the natural way.
Corollary 2.4
For any finite group , the holomorph of is pre-primitive.
**Proof **
The group is a regular normal subgroup of its holomorph. A subgroup of is -invariant if and only if it is characteristic; and a characteristic subgroup is certainly normal. āā
The proof actually shows a stronger result: the semidirect product of by its inner automorphism group is pre-primitive.
Finally, since a transitive abelian group is regular, and a direct product of regular groups (in its product action) is regular, we have the following:
Corollary 2.5
The direct product of transitive abelian groups in its product action is pre-primitive.
2.2 Direct products
Next we consider various product constructions for transitive groups and ask, is it true that if the factors are pre-primitive, then so is the product? First, the direct product in its product action.
Let and be permutation groups on and respectively. Then the direct product acts coordinatewise on , by . If and are transitive then is transitive in this action.
It follows from CorollaryĀ 2.3 that, if two transitive groups are pre-primitive, then their direct product (in its product action) is pre-primitive if the factors are abelian, but may fail to be pre-primitive in general. (Take two copies of acting regularly: is a Dedekind group but is not.) So it is natural to ask what additional conditions on the factors will guarantee pre-primitivity of the product. To examine these, we look more closely at partitions invariant under .
Suppose that and act transitively on and respectively, and let be a -invariant partition of . We define two partitions of as follows.
- ā¢
Let be a part of . Let be the subset of defined by
[TABLE]
We claim that the sets arising in this way are pairwise disjoint. For suppose that , where is defined similarly from another part of ; suppose that and . There is an element mapping to . Then maps to , and hence maps to , and to ; but this element acts trivially on , so . It follows that the sets arising in this way form a partition of , which we call the -projection partition.
- ā¢
Choose a fixed , and consider the intersections of the parts of with . These form a partition of and so, by ignoring the second factor, we obtain a partition of called the -fibre partition. Now the action of the group shows that it is independent of the element chosen.
We note that the -projection partition and the -fibre partition are both -invariant, and the second is a refinement of the first. In a similar way we get -fibre and -projection partitions of , both -invariant.
For a non-trivial example, consider the group acting on , where each of and is a copy of the integers moduloĀ . Take
[TABLE]
The images of under form a partition with eight parts; its projection partition on the first coordinate has two parts consisting of the even and odd elements, while its fibre partition has four parts consisting of the cosets of .
The next lemma gives some properties of these partitions. First, some definitions.
The partial order of refinement is defined on partitions of by the rule that, for partitions and , we have (read refines ) if every part of is a union of parts of .
If and are partitions of and respectively, then their cartesian product is the partition of whose parts are all cartesian products of a part of and a part of .
Lemma 2.6
Let and be transitive permutation groups on and respectively, and let be a -invariant partition of .
- (a)
The -projection and -fibre partitions of are -invariant, and the second is a refinement of the first. 2. (b)
The number of parts of the -fibre partition contained in a part of the -projection partition is equal to the corresponding number for . 3. (c)
If , then is the cartesian product of a -invariant partition of and an -invariant partition of . 4. (d)
If , then the set of parts of within a part of has the structure of a Latin square, where the first and second coordinates define the square grid and the parts of give the positions of the letters.
**Proof **
The first statement is clear from the definition.
For the second, let and be the -projection and -fibre partitions of , and and the corresponding partitions of . We claim first that
[TABLE]
The second inequality is clear since, if two elements of lie in the same part of , then their projections onto lie in the same part of , and similarly for and . For the first inequality, suppose that and lie in the same part of , and and in the same part of . Then there exists such that and lie in the same part of ; applying an element of , we can assume that . Similarly, we can assume that and belong to the same part of . Now transitivity gives the result.
Now let and be parts of and , and choose a part of which projects onto and . Any point of belongs to for some parts of and respectively. This induces a bijection between the parts of in and the parts of in .
The third part is now clear.
For the final part, note that the parts of within have the structure of a square grid. Choose a part of within . Then is a union of parts of . By the definition of the fibre partition, the first coordinates of pairs in with given second coordinate form a single part of , so contains just one part of within any row of the grid; and similarly for columns. Since every part of is contained in a unique part of , the result is proved. āā
Theorem 2.7
Let and be transitive and let act component-wise on . If both and are primitive, then is pre-primitive.
**Proof **
Since both and are primitive, it follows that given a -invariant partition of the and -fibre partitions and the and -projection partitions must be trivial. If , then is one of four possibilities: , (the partition with a single part), , (the partition into singletons), , and . Then is the orbit partition of , , , respectively, and hence is pre-primitive.
If , then there is one additional case to consider, namely the one where the and -fibre partitions are the singletons, and the and -projection partitions consist of a single part. Each part of induces a bijection between and , so the stabiliser of a point fixes every point in the part of containing , and hence is the identity. So is regular, whence also and are regular. Since they are also primitive, they are cyclic of prime order, whence is abelian, and hence by CorollaryĀ 2.5 it is pre-primitive. āā
Theorem 2.8
Let and be transitive and let act component-wise on . If and are pre-primitive and the sizes of and are coprime, then is pre-primitive.
**Proof **
Let be a -invariant partition. We denote the and -fibre partitions by and respectively, and we let and be the - and -projection partitions respectively.
Let be the number of parts of the -fibre partition in a part of . Then divides , since the product of the size of a part of the -fibre partition times times the number of parts of is equal to . Similarly divides . Thus , by LemmaĀ 2.6. Since and are orbit partitions of subgroups and of and respectively, is the orbit partition of . āā
Corollary 2.9
Let , be transitive and regular. The direct product acting on componentwise is pre-primitive if and only if either and are abelian, or one is a non-abelian Dedekind group and the other an abelian group whose exponent is not divisible by .
**Proof **
If and both act regulary on and respectively, then acts regularly on . Therefore, is pre-primitive if and only if it is Dedekind, which happens only in the two cases stated, by Dedekindās theorem (TheoremĀ 2.2). āā
Theorem 2.10
Let and be pre-primitive. Suppose that every -invariant partition of is of one of the following types:
- ā¢
The -fibre partition induced by on is the same as the -projection partition and the -fibre partition induced by on is the same as the -projection partition;
- ā¢
The and -projection partitions induced by on and respectively are the partitions with a single part.
then in its product action is pre-primitive.
**Proof **
If is of the first form, then by LemmaĀ 2.6, . Since is pre-primitive, there exists a subgroup of whose orbit partition is , and similarly there exists some whose orbit partition is . Now it is easy to see that the orbit partition of is .
Now suppose that is of the second type and let and be the - and -fibre partition induced by on and respectively. As in the first part, there are subgroups and of and respectively (which can be chosen to be normal, by PropositionĀ 1.1) whose orbit partitions are and respectively; and is the orbit partition of . Moreover, we can take to consist of all elements of fixing the parts of , and similarly for .
The group permutes (faithfully, by the above remark) the parts of . The argument in the second part of TheoremĀ 2.7 shows that and are isomorphic and regular. If has a non-trivial proper subgroup , and is the corresponding subgroup of , then the inverse image in of a diagonal subgroup of defines a -invariant partition not of the form in the theorem. So and are of prime order . Then is the orbit partition of a subgroup of whose projection onto is a diagonal subgroup of . āā
In the next section, we will show a clean converse of these results: if is pre-primitive, then both and are pre-primitive.
2.3 Wreath products, imprimitive action
By contrast with direct products, wreath products are better behaved. Again let and be permutation groups on and respectively. Take , regarded as the disjoint union of copies of indexed by , where . The partition of into the sets will be called the canonical partition. Now is generated by
- ā¢
the base group, the direct product of copies of indexed by , where copy with index acts on as acts on and fixes all the other parts of the canonical partition pointwise;
- ā¢
the top group, a copy of acting on the second coordinate of points in .
For further use, we note a property of this action.
Lemma 2.11
Let and be permutation groups on and respectively. Then the direct product in its product action is a subgroup of the wreath product in its imprimitive action.
**Proof **
The top group is isomorphic to and acts on the second coordinate. If is the diagonal subgroup of the base group, consisting of elements with all coordinates equal, then is isomorphic to and acts on the first coordinate. Together these subgroups generate in its product action. āā
Proposition 2.12
Let and be transitive permutation groups on and respectively and let have its imprimitive action on , with canonical partition . If is any -invariant partition, then either or .
**Proof **
Suppose not, and let be a part of . Then intersects two parts and of but contains neither. Now is a part of a -invariant partition of ; by transitivity, we can find an element which maps this set to a disjoint subset of . Then the element of the base group which acts as on and the identity outside maps to a set which is neither equal to nor disjoint from , contradicting the assumption that is -invariant. āā
From this we see that, apart from the canonical partition, there are just two types of non-trivial -invariant partitions :
- ā¢
If , then we take a -invariant partition of , and copy it to all parts of the canonical partition using the top group. Since is invariant under the top group, the partitions of the parts of must correspond in this way.
- ā¢
If , then we take an -invariant partition of , and replace each part by the union of the sets for . For the sets of indices for which is contained in each part of the partition must form an -invariant partition of .
From this, we can prove our main result about the imprimitive action of the wreath product:
Theorem 2.13
Let be transitive groups on and respectively. Then the wreath product in its imprimitive action on is pre-primitive if and only if both and are pre-primitive.
**Proof **
Suppose that and are pre-primitive, and let be a -invariant partition of , different from the canonical partition .
- ā¢
If , then is obtained by copying a -invariant partition of onto each of the parts . By assumption. is the orbit partition of a subgroup of . Then clearly is the orbit partition of , where , since the coordinate of the direct product acts on with orbit partition .
- ā¢
If , then is obtained by taking the unions of the sets corresponding the the points in each part of a -invariant partition of . By assumption, the parts of are the orbits of a subgroup of . Then clearly the parts of are the orbits of the subgroup of .
Now suppose conversely that is pre-primitive.
- ā¢
Let be a -invariant partition of . Then the partition obtained by copying onto each part of the canonical partition is -invariant, and so is the orbit partition of a subgroup of . The group of all elements fixing this partition induces on the parts of the canonical partition, and has the form , where is the stabiliser of all the parts of . So is the orbit partition of the subgroup of . Thus, is pre-primitive.
- ā¢
Let be a -invariant partition of . The partition whose parts are unions of parts of indexed by elements of a part of is -invariant, and so is the orbit partition of a subgroup of . Clearly this subgroup has the form , where is a subgroup of whose orbit partition is . So is pre-primitive. āā
Here is the promised result for direct products:
Theorem 2.14
Let and be transitive groups. If the direct product in its product action is pre-primitive then both and are pre-primitive.
**Proof **
Suppose that is pre-primitive. Since the direct product is embedded in the wreath product in its imprimitive action (LemmaĀ 2.11), we have that in its imprimitive action is pre-primitive by PropositionĀ 1.3; so and are pre-primitive, by TheoremĀ 2.13. āā
2.4 Wreath products, product action
This is the same group (up to isomorphism) but a different action. As before let act on and on . Then acts on the Cartesian product of copies of , which we regard as the set of words of length over the alphabet . The factor of the base group acts on the symbols in position , fixing the symbols in the other positions; the top group acts by permuting the coordinates.
In this section we examine the product action of the wreath product of two permutation groups and . First some preliminary remarks.
To begin, is transitive if and only if is transitive, independent of (since then the base group is transitive in the product action). It is known that is primitive if and only if is primitive but not cyclic of prime order and is transitive; a similar result holds for quasiprimitivityĀ [10, Theorem 5.8]. Apart from the first example below, we assume that is transitive in this section.
Remark
If is transitive and abelian, then is pre-primitive, since the base group is transitive and abelian.
Remark
The quaternion group is pre-primitive, but is not. For has a regular normal subgroup ; the stabiliser interchanges the two factors. So, if and generate , then the subgroup generated by is -invariant, but is not normal, since , and so conjugates to , which is not in the subgroup generated by . By TheoremĀ 2.1, is not pre-primitive.
However, with an extra assumption on , we do get pre-primitivity of . Let be the degree of , and the set on which acts. Given a partition of , we denote by the partition of in which and belong to the same part if and only if and belong to the same part of for .
Theorem 2.15
Let and be transitive permutation groups on and respectively. Assume that is pre-primitive and has the property that the stabiliser of a point fixes no additional points (equivalently, this stabiliser is equal to its normaliser in ). Then , in the product action, is pre-primitive.
**Proof **
Let be a non-trivial -invariant partition of , where . We claim that
Let be a part of , and let . Then contains two -tuples which agree in all positions except position .
To see this, choose . Since is non-trivial, we can choose a different element ; since is transitive on the coordinates, we can assume that . Now consider the subgroup of the base group which acts as the identity on all positions different from the -th and acts as on the -th position. By assumption, this subgroup fixes and contains an element mapping to . Then and are the required -tuples.
Now is a block of imprimitivity for , and so its setwise stabiliser acts transitively on it. Suppose that for one (and hence all) elements of , there are other elements of differing from the chosen one only in the -th position. The transitivity of shows that this number is independent of . Also, the mapping taking one such tuple to another can be chosen to lie in the base group and to stabilise . Since elements of the base group acting on different coordinates commute, we see that is the Cartesian product of -subsets of , one for each coordinate. We show that the partition has the form for some partition of .
First we look at the parts of containing diagonal elements of . Such a part is invariant under the action of the top group , which is transitive on the components; so the subsets of the different copies of making up are all equivalent under the natural bijections between these copies. Hence the sets for form a partition of , and all these parts correspond.
Now take a general element of . The unique part containing it can be mapped to by an element of the base group fixing pointwise, so . This shows that there is a unique partition of each set made up of the projections of parts of onto ; and these parts correspond under the natual maps between different sets . This shows that , as claimed.
Now by assumption, is pre-primitive, so is the orbit partition of a normal subgroup of . But now it follows that is the orbit partition of the subgroup of the base group of . Hence is pre-primitive. āā
Remark
If is primitive, the extra condition on in this theorem excludes only the cyclic groups of prime order.
In the other direction, things are simpler:
Theorem 2.16
If in the product action is pre-primitive then is pre-primitive.
**Proof **
Let be a -invariant partition of . It is easy to see that is a -invariant partition of . By hypothesis, it is the orbit partition of a normal subgroup of . This subgroup clearly contains the top group , and its intersection with the base group induces on the first coordinate a subgroup of whose orbit partition is . āā
2.5 Diagonal groups
Diagonal groups arose in the celebrated OāNanāScott Theorem. However, they form a much larger class of transitive groups, discussed in detail in [2]. Let be a positive integer and a group. Then the diagonal group is the group of permutations on (where we distinguish -tuples in by putting them in square brackets) generated by the following elements:
- (a)
elements of , acting by right multiplication; 2. (b)
elements of , acting simultaneously on all coordinates by left multiplication (that is, maps to ); 3. (c)
automorphisms of , acting simultaneously on all coordinates; 4. (d)
elements of the symmetric group , permuting the coordinates; 5. (e)
the map
[TABLE]
Note that the permutations of types (d) and (e) generate a group isomorphic to .
We are going to find a sufficient condition for to be pre-primitive.
Permutations of type (a) constitute a regular subgroup. Types (c), (d) and (e) generate the stabiliser of a point. Type (b) are not actually necessary, since any two of left multiplication, right multiplication and conjugation by a diagonal element generate the third. The regular subgroup is not normal if is nonabelian, so the results of SectionĀ 2.1 do not immediately apply; but we will see that very similar results hold.
Proposition 2.17
Let .
- (a)
A -invariant partition is the right coset partition of a subgroup of normalised by the elements of types (c), (d) and (e). 2. (b)
If any subgroup of which is normalised by elements of types (c), (d) and (e) is normal in , then is pre-primitive.
**Proof **
(a) Let be a -invariant partition, and let be the part of containing the identity. Since is regular, the arguments of SectionĀ 2.1 show that is a subgroup of and is its right coset partition.
If is invariant under the point stabiliser, then the same is true for . In other words, if , then
- ā¢
for all ;
- ā¢
for all ;
- ā¢
.
Conversely, suppose that is invariant under these transformations. Take any right coset of , say .
- ā¢
Applying an automorphism of , we find
[TABLE]
since is invariant under the coordinatewise action of .
- ā¢
Applying a permutation to the subscripts, we find
[TABLE]
since is invariant under applied to the subscripts;
- ā¢
Applying the map of type (e), we find
[TABLE]
since is invariant under both conjugation by and .
So is invariant under these three types of element.
(b) If is a normal subgroup of , then its right coset partition coincides with its orbit partition. āā
Theorem 2.18
Let be a finite group and a positive integer. Suppose that the following property holds:
*If is any characteristic subgroup of , and the subgroup of generated by the *st powers and commutators of elements in , then every subgroup of containing is normal in .
Then is pre-primitive.
**Proof **
We examine further the right coset partition of a subgroup of invariant under the transformations (c), (d) and (e). Let be the projection of onto the th direct factor. Since is invariant under permutations, (as subgroup of ) is independent of the index ; since is invariant under automorphisms, is a characteristic subgroup of . Thus, .
Take . Then . It follows by closure that , whence . The same is true with the first and second coordinates swapped; so .
From this we make two deductions:
- ā¢
For any , the elements , and all belong to . Multiplying the first two by the inverse of the third and swapping the first two coordinates, we find that .
- ā¢
We know . Multiplying successively by the elements with in the first coordinate and in the th, for , we get .
Since this holds with any coordinate replacing the first, we see that , where is the subgroup of generated by st powers and commutators. Thus is contained in . Note that is an abelian group of exponent dividing .
Let be the subgroup of consisting of -tuples for which the product of the coordinates is . Then is generated by elements having one coordinate , one coordinate , and the remaining coordinates . Since for all , we see that contains the inverse image of in .
Now any subgroup of containing must have the form
[TABLE]
where is a subgroup of ; and is normal in if and only if the inverse image of in is normal in . So, with our hypothesis, is normal in , and is pre-primitive, by PropositionĀ 2.17(b). āā
There are several simpler conditions which guarantee that the hypotheses of this theorem are satisfied.
Corollary 2.19
Suppose that one of the following holds:
- (a)
* is coprime to ;* 2. (b)
* is supersoluble;* 3. (c)
* is a direct product of non-abelian simple groups.*
Then is pre-primitive.
**Proof **
In cases (a) and (c), the subgroup of is equal to , since there is no nontrivial abelian quotient with exponent dividing .
Suppose that is supersoluble, is characteristic in , the subgroup of generated by st powers and commutators, and a subgroup of containing which is not normal in . Then there is an element which does not normalise , and so an element such that is not normalised by . But this means that there is a chief factor of in containing and which is not cyclic, contradicting the fact that is supersoluble. āā
It may be that the converse of TheoremĀ 2.18 is true; we have not been able to decide this.
Example
It can be verified by using GAPĀ [6] that is not pre-primitive. In this case, with , , we see that there are subgroups of which are not normal in .
2.6 Groups with pre-primitive subgroups
According to Jordanās theorem, a primitive group containing a transitive subgroup on a subset of , fixing the points outside , is -transitive. We will prove a somewhat similar theorem for pre-primitivity.
Theorem 2.20
Suppose that is a transitive permutation group on . Suppose that is a subset of satisfying and a subgroup of which fixes every point outside and acts pre-primitively on . Then is pre-primitive.
**Proof **
Suppose that is a -invariant partition. No part of can intersect both and non-trivially, since such a part would be fixed by and therefore would contain the whole of (by transitivity of ). So every part of is either contained in or disjoint from .
The parts contained in form a -invariant partition of , and so by hypothesis form the orbit partition of a subgroup of . Now every conjugate of in fixes all parts of , and so they generate a group whose orbit partition is .
Since this holds for every -invariant partition, is pre-primitive. āā
3 Data on small transitive groups
We remarked earlier that pre-primitivity and quasiprimitivity are logically independent. We might ask whether they are statistically independent, in the sense that if we pick an isomorphism type of transitive permutation group of degree at random, the events that it is pre-primitive and that it is quasiprimitive are uncorrelated. If , , and denote the numbers of transitive, primitive, quasiprimitive and pre-primitive groups of degree up to permutation isomorphism, this is equivalent to asking whether . This equation is true in some cases (for example, if is prime, then every transitive group of degree is primitive, so the four numbers are equal). In general, it seems to be roughly true. TableĀ 1, computed from the library in GAPĀ [6], gives the values of the four functions with , and the correlation coefficient of the properties āpre-primitveā and āquasiprimitiiveā when a transitive group of degree is chosen uniformly at random.
It might be useful to have a bound on the correlation coefficient or some evidence about its sign, but we have been unable to do this. The data suggest that most transitive groups are pre-primitive and most quasiprimitive groups are primitive.
4 Degrees for which all transitive groups are pre-primitive
Let
[TABLE]
Problem
Describe the set .
We give some context and then give upper and lower bounds for this set.
One could ask in a similar way about the set of natural numbers for which every pre-primitive group of degree is primitive. But this is easily seen to be just the set of prime numbers. For, if is composite, say , then in its imprimitive action is pre-primitive.
What about the set of natural numbers for which the only primitive groups of degree are the symmetric and alternating groups? This question has a longer history: for example Mathieu thought about it. But as one of the first applications of the Classification of Finite Simple Groups, the authors of [3] showed that this set contains almost all natural numbers. More precisely, if is the complementary set (for which non-trivial primitive groups exist), then they showed that
[TABLE]
where is the number of primes in .
Clearly our set contains all prime numbers, since a transitive group of prime degree is primitive. It also contains all squares of primes:
Proposition 4.1
A transitive permutation group of degree , where is prime, is pre-primitive.
**Proof **
It suffices to prove the result in the case where the group is a -group. For the Sylow -subgroup of a transitive group of prime power degree is transitive, and if it is pre-primitive then so is . So suppose that is a -group.
Let be any -invariant partition; it consists of sets of size . Let be the subgroup of fixing a part of . Then and fixes all the blocks. But cannot fix a point, since a point stabiliser has index . So the blocks are orbits of . Thus is pre-primitive. āā
In the other direction, let be the set of natural numbers for which every group of order is abelian. This well-studied set consists of all numbers which are not divisible by (where is prime), or by (where and are primes with ) or by (where and are primes with ). (This result is āfolkloreā, but we have been unable to find a good reference.)
Proposition 4.2
.
**Proof **
A little thought shows that is also the set of natural numbers for which every group of order is Dedekind; and, if is not in this set, then a non-Dedekind group acting regularly is not pre-primitive, so . āā
Strict inequality holds in both cases:
- ā¢
The groups and have transitive imprimitive actions on points (on the cosets of a Sylow -subgroup). Since is simple, this action of is quasiprimitive, and so not pre-primitive; the same is true forĀ . So .
- ā¢
Computation shows that all transitive groups of degrees and are pre-primitive. So , where is the set of primes and the set of primes squared.
A special case of the general problem which may be tractable is to find which products of two distinct primes belong to . Suppose that and are primes with . We have seen that, if , then . Further examples can be constructed as follows. Let be a Fermat prime, and let be a prime divisor of . The group has an imprimitive action on points (the stabiliser being a subgroup of index in the Sylow -normaliser). Since this group is simple, the action is quasiprimitive, and so not pre-primitive.
5 Related concepts
The guiding principle behind the definition of pre-primitivity was to find a condition logically independent of quasiprimitivity such that its conjunction with quasiprimitivity is equivalent to primitivity.
We could now consider playing the same game with other pairs of properties of permutation groups. We give three examples, and invite readers to consider others.
5.1 From transitivity to quasiprimitivity
We want a property, which we shall call pre-QP, which together with transitivity is equivalent to quasiprimitivity. It is clear that such a property can be defined as follows: The permutation group on is pre-QP if its action on each of its orbits is quasiprimitive (equivalently, every normal subgroup of acts either transitively or trivially on each -orbit).
This property does not have such a rich theory as pre-primitivity, so we say no more about it.
5.2 From -homogeneity to -transitity
Let be a positive integer less than . A permutation group on is -homogeneous if its action on the set of -element subsets of is transitive, and is -transitive if its action on the set of ordered -tuples of distinct elements of is transitive. Both of these conditions have been intensively studied.
The property that lifts -homogeneity to -transitivity is also known, having been first given by NeumannĀ [7]. The permutation group is generously -transitive if the setwise stabiliser in of any -set acts on it as the symmetric group . Neumann showed that this condition implies -transitivity. In the case , it is equivalent to requiring that all the orbitals of are self-paired. We have nothing more to add here.
5.3 From primitivity to synchronization
The property of synchronization comes from automata theory by way of semigroup theory, and is discussed in [1]. We say that the permutation group on is synchronizing if, for any map which is not a permutation, the monoid generated by and contains an element of rankĀ (that is, one which maps the whole of onto a single point).
For our purposes, the most useful characterisation of this property is due to NeumannĀ [9]. We say that a partition of is section-regular for the permutation group on if there exists a subset of such that is a section (transversal) of for all . Now Neumann showed that a permutation group is synchronizing if and only if it has no non-trivial section-regular partition (where the trivial partitions are as described earlier).
From this it is clear that synchronization implies primitivity: for a -invariant partition is section-regular (simply take to be any transversal to ). The converse is false, as numerous examples show.
Accordingly, we will say that the transitive permutation group on is pre-synchronizing if every section-regular partition for is -invariant.
So our interest is in pre-synchronizing groups which are imprimitive. It turns out that these can be completely classified:
Theorem 5.1
Let be a transitive imprimitive permutation group which is pre-synchronizing. Then is isomorphic to the Klein group, in its regular action of degreeĀ .
**Proof **
Let be a non-trivial -invariant partition, and a part of . Then the images of under are the parts of . Take to be any partition such that each part of is a transversal for . Then is a transversal for , for all ; in other words, is section-regular.
Since is pre-synchronizing, it follows that is -invariant. Suppose that is the size of a part of , and let be another transversal for satisfying . Then is a block of imprimitivity contained in . So divides , whence .
Now let be the number of parts of (the size of ). Since is a non-trivial -invariant partition, we can run the same argument with and interchanged to conclude that also , whence is a permutation group of degreeĀ . Since it preserves at least two distinct partitions into two sets of size , we conclude that must be the Klein group of orderĀ . āā
Acknowledgements
The first author was funded by a StARIS research internship from the University of St Andrews.
No data were used in the preparation of this paper apart from the GAP transitive groups library.
The authors declare no conflict of interest.
The authors are grateful to a reviewer for detailed and thoughtful comments which have materially improved the paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] JoĆ£o AraĆŗjo, Peter J. Cameron and Benjamin Steinberg, Between primitive and 2 2 2 -transitive: synchronization and its friends, Europ. Math. Soc. Surveys 4 (2017), 101ā184.
- 2[2] R. A. Bailey, Peter J. Cameron, Cheryl E. Praeger and Csaba Schneider, The geometry of diagonal groups, Trans. Amer. Math. Soc. 375 (2022), 5259ā5311.
- 3[3] Peter J. Cameron, Peter M. Neumann and David N. Teague, On the degrees of primitive permutation groups, Math. Z. 180 (1982), 141ā149.
- 4[4] Richard Dedekind, Ćber Gruppen, deren sƤmmtliche Theiler Normaltheiler sind, Math. Ann. 48 (1897), 548ā561.
- 5[5] Ćvariste Galois, Åuvres mathĆ©matiques dāĆvariste Galois. (J. Liouville editor), J. de Math. Pures et Appl. (Liouvilleās Journal), XI (1846), 381ā444.
- 6[6] The GAP Group, GAP ā Groups, Algorithms, and Programming, Version 4.12.2; 2022. (https://www.gap-system.org)
- 7[7] Peter M. Neumann, Generosity and characters of multiply transitive permutation groups, Proc. London Math. Soc. (3) 31 (1975), 457ā481.
- 8[8] Peter M. Neumann, The concept of primitivity in group theory and the second memoir of Galois, Arch. Hist. Exact Sci. 60 (2006), 379ā429.
