Primitive permutation group

Short description: Permutation group that preserves no non-trivial partition

In mathematics, a permutation group G acting on a non-empty finite set X is called primitive if G acts transitively on X and the only partitions the G-action preserves are the trivial partitions into either a single set or into |X| singleton sets. Otherwise, if G is transitive and G does preserve a nontrivial partition, G is called imprimitive.

While primitive permutation groups are transitive, not all transitive permutation groups are primitive. The simplest example is the Klein four-group acting on the vertices of a square, which preserves the partition into diagonals. On the other hand, if a permutation group preserves only trivial partitions, it is transitive, except in the case of the trivial group acting on a 2-element set. This is because for a non-transitive action, either the orbits of G form a nontrivial partition preserved by G, or the group action is trivial, in which case all nontrivial partitions of X (which exists for |X| ≥ 3) are preserved by G.

This terminology was introduced by Évariste Galois in his last letter, in which he used the French term équation primitive for an equation whose Galois group is primitive.[1]

## Contents

* 1 Properties
* 2 Examples
* 3 See also
* 4 References

## Properties

In the same letter in which he introduced the term "primitive", Galois stated the following theorem:[2]

> If G is a primitive solvable group acting on a finite set X, then the order of X is a power of a prime number p. Further, X may be identified with an affine space over the finite field with p elements, and G acts on X as a subgroup of the affine group.

If the set X on which G acts is finite, its cardinality is called the degree of G.

A corollary of this result of Galois is that, if p is an odd prime number, then the order of a solvable transitive group of degree p is a divisor of p(p−1). In fact, every transitive group of prime degree is primitive (since the number of elements of a partition fixed by G must be a divisor of p), and p(p−1) is the cardinality of the affine group of an affine space with p elements.

It follows that, if p is a prime number greater than 3, the symmetric group and the alternating group of degree p are not solvable, since their order are greater than p(p−1). Abel–Ruffini theorem results from this and the fact that there are polynomials with a symmetric Galois group.

An equivalent definition of primitivity relies on the fact that every transitive action of a group G is isomorphic to an action arising from the canonical action of G on the set G/H of cosets for H a subgroup of G. A group action is primitive if it is isomorphic to G/H for a maximal subgroup H of G, and imprimitive otherwise (that is, if there is a proper subgroup K of G of which H is a proper subgroup). These imprimitive actions are examples of induced representations.

The numbers of primitive groups of small degree were stated by Robert Carmichael in 1937:

Degree | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | OEIS

|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|

Number | 1 | 2 | 2 | 5 | 4 | 7 | 7 | 11 | 9 | 8 | 6 | 9 | 4 | 6 | 22 | 10 | 4 | 8 | 4 | 9 | 4 | 7 | 5 | A000019

There are a large number of primitive groups of degree 16. As Carmichael notes,Template:Pages? all of these groups, except for the symmetric and alternating group, are subgroups of the affine group on the 4-dimensional space over the 2-element finite field.

## Examples

* Consider the symmetric group S3 acting on the set X={1,2,3} and the permutation

η=(123231).

Both S3 and the group generated by η are primitive.

* Now consider the symmetric group S4 acting on the set {1,2,3,4} and the permutation

σ=(12342341).

The group generated by σ is not primitive, since the partition (X1,X2) where X1={1,3} and X2={2,4} is preserved under σ, i.e. σ(X1)=X2 and σ(X2)=X1.

* Every transitive group of prime degree is primitive
* The symmetric group Sn acting on the set {1,…,n} is primitive for every n and the alternating group An acting on the set {1,…,n} is primitive for every n > 2.

## See also

* Block (permutation group theory)
* Jordan's theorem (symmetric group)
* O'Nan–Scott theorem, a classification of finite primitive groups into various types

## References

1. ↑ Galois' last letter: http://www.galois.ihp.fr/ressources/vie-et-oeuvre-de-galois/lettres/lettre-testament
2. ↑ Galois used a different terminology, because most of the terminology in this statement was introduced afterwards, partly for clarifying the concepts introduced by Galois.

* Roney-Dougal, Colva M. The primitive permutation groups of degree less than 2500, Journal of Algebra 292 (2005), no. 1, 154-183.
* The GAP Data Library "Primitive Permutation Groups".
* Carmichael, Robert D., Introduction to the Theory of Groups of Finite Order. Ginn, Boston, 1937. Reprinted by Dover Publications, New York, 1956.
* Todd Rowland. "Primitive Group Action". http://mathworld.wolfram.com/PrimitiveGroupAction.html.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Primitive permutation group. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Primitive_permutation_group&oldid=203816"