Permutation Group

In mathematics, a permutation group is a group ''G'' whose elements are permutations of a given set ''M'' and whose group operation is the composition of permutations in ''G'' (which are thought of as bijective functions from the set ''M'' to itself). The group of ''all'' permutations of a set ''M'' is the symmetric group of ''M'', often written as Sym(''M''). The term ''permutation group'' thus means a subgroup of the symmetric group. If then Sym(''M'') is usually denoted by S_''n'', and may be called the ''symmetric group on n letters''.

By Cayley's theorem, every group is isomorphic to some permutation group.

The way in which the elements of a permutation group permute the elements of the set is called its group action. Group actions have applications in the study of symmetries, combinatorics and many other branches of mathematics, physics and chemistry.

Basic properties and terminology

Being a subgroup of a symmetric group, all that is necessary for a set of permutations to satisfy the group axioms and be a permutation group is that it contain the identity permutation, the inverse permutation of each permutation it contains, and be closed under composition of its permutations. A general property of finite groups implies that a finite nonempty subset of a symmetric group is again a group if and only if it is closed under the group operation.

The degree of a group of permutations of a finite set is the number of elements in the set. The order of a group (of any type) is the number of elements (cardinality) in the group. By Lagrange's theorem, the order of any finite permutation group of degree ''n'' must divide ''n''! since ''n''- factorial is the order of the symmetric group ''S''_''n''.

Notation

Since permutations are bijections of a set, they can be represented by Cauchy's ''two-line notation''. This notation lists each of the elements of ''M'' in the first row, and for each element, its image under the permutation below it in the second row. If $\sigma$ is a permutation of the set $M = \$ then,
: $\sigma = \begin x_1 & x_2 & x_3 & \cdots & x_n \\ \sigma(x_1) &\sigma(x_2) & \sigma(x_3) & \cdots& \sigma(x_n)\end.$
For instance, a particular permutation of the set can be written as
: $\sigma=\begin 1 & 2 & 3 & 4 & 5 \\ 2 & 5 & 4 & 3 & 1\end;$
this means that ''σ'' satisfies ''σ''(1) = 2, ''σ''(2) = 5, ''σ''(3) = 4, ''σ''(4) = 3, and ''σ''(5) = 1. The elements of ''M'' need not appear in any special order in the first row, so the same permutation could also be written as
: $\sigma=\begin 3 & 2 & 5 & 1 & 4 \\ 4 & 5 & 1 & 2 & 3\end.$

Permutations are also often written in cycle notation (''cyclic form'') so that given the set ''M'' = , a permutation ''g'' of ''M'' with ''g''(1) = 2, ''g''(2) = 4, ''g''(4) = 1 and ''g''(3) = 3 will be written as (1, 2, 4)(3), or more commonly, (1, 2, 4) since 3 is left unchanged; if the objects are denoted by single letters or digits, commas and spaces can also be dispensed with, and we have a notation such as (124). The permutation written above in 2-line notation would be written in cycle notation as $\sigma = (125)(34).$

Composition of permutations–the group product

The product of two permutations is defined as their composition as functions, so $\sigma \cdot \pi$ is the function that maps any element ''x'' of the set to $\sigma (\pi (x))$. Note that the rightmost permutation is applied to the argument first, because of the way function composition is written. Some authors prefer the leftmost factor acting first, but to that end permutations must be written to the ''right'' of their argument, often as a superscript, so the permutation $\sigma$ acting on the element $x$ results in the image $x ^$. With this convention, the product is given by $x ^ = (x ^)^$.

However, this gives a ''different'' rule for multiplying permutations. This convention is commonly used in the permutation group literature, but this article uses the convention where the rightmost permutation is applied first.

Since the composition of two bijections always gives another bijection, the product of two permutations is again a permutation. In two-line notation, the product of two permutations is obtained by rearranging the columns of the second (leftmost) permutation so that its first row is identical with the second row of the first (rightmost) permutation. The product can then be written as the first row of the first permutation over the second row of the modified second permutation. For example, given the permutations,
:$P = \begin1 & 2 & 3 & 4 & 5 \\2 & 4 & 1 & 3 & 5 \end\quad \text \quad Q = \begin1 & 2 & 3 & 4 & 5 \\ 5 & 4 & 3 & 2 & 1 \end,$
the product ''QP'' is:
:$QP =\begin1 & 2 & 3 & 4 & 5 \\ 5 & 4 & 3 & 2 & 1 \end\begin1 & 2 & 3 & 4 & 5 \\2 & 4 & 1 & 3 & 5 \end = \begin 2 & 4 & 1 & 3 & 5 \\ 4 & 2 & 5 & 3 & 1 \end \begin1 & 2 & 3 & 4 & 5 \\2 & 4 & 1 & 3 & 5 \end = \begin1 & 2 & 3 & 4 & 5 \\4 & 2 & 5 & 3 & 1 \end.$

The composition of permutations, when they are written in cycle notation, is obtained by juxtaposing the two permutations (with the second one written on the left) and then simplifying to a disjoint cycle form if desired. Thus, the above product would be given by:
:$Q \cdot P = (1 5)(2 4) \cdot (1 2 4 3) = (1 4 3 5).$

Since function composition is associative, so is the product operation on permutations: $(\sigma \cdot \pi) \cdot \rho = \sigma \cdot(\pi \cdot \rho)$. Therefore, products of two or more permutations are usually written without adding parentheses to express grouping; they are also usually written without a dot or other sign to indicate multiplication (the dots of the previous example were added for emphasis, so would simply be written as $\sigma \pi \rho$).

Neutral element and inverses

The identity permutation, which maps every element of the set to itself, is the neutral element for this product. In two-line notation, the identity is
:$\begin1 & 2 & 3 & \cdots & n \\ 1 & 2 & 3 & \cdots & n\end.$
In cycle notation, ''e'' = (1)(2)(3)...(''n'') which by convention is also denoted by just (1) or even ().

Since bijections have inverses, so do permutations, and the inverse ''σ''⁻¹ of ''σ'' is again a permutation. Explicitly, whenever ''σ''(''x'')=''y'' one also has ''σ''⁻¹(''y'')=''x''. In two-line notation the inverse can be obtained by interchanging the two lines (and sorting the columns if one wishes the first line to be in a given order). For instance
:$\begin1 & 2 & 3 & 4 & 5 \\ 2 & 5 & 4 & 3 & 1\end^ =\begin2 & 5 & 4 & 3 & 1\\ 1 & 2 & 3 & 4 & 5 \end =\begin1 & 2 & 3 & 4 & 5 \\ 5 & 1 & 4 & 3 & 2\end.$

To obtain the inverse of a single cycle, we reverse the order of its elements. Thus,
:$(1 2 5)^ = (5 2 1) = (152).$

To obtain the inverse of a product of cycles, we first reverse the order of the cycles, and then we take the inverse of each as above. Thus,
: 1 2 5)(3 4) = (34)^(125)^ = (43)(521) = (34)(152).

Having an associative product, an identity element, and inverses for all its elements, makes the set of all permutations of ''M'' into a group, Sym(''M''); a permutation group.

Examples

Consider the following set ''G''₁ of permutations of the set ''M'' = :

* ''e'' = (1)(2)(3)(4) = (1)
**This is the identity, the trivial permutation which fixes each element.
* ''a'' = (1 2)(3)(4) = (1 2)
**This permutation interchanges 1 and 2, and fixes 3 and 4.
* ''b'' = (1)(2)(3 4) = (3 4)
**Like the previous one, but exchanging 3 and 4, and fixing the others.
* ''ab'' = (1 2)(3 4)
**This permutation, which is the composition of the previous two, exchanges simultaneously 1 with 2, and 3 with 4.

''G''₁ forms a group, since ''aa'' = ''bb'' = ''e'', ''ba'' = ''ab'', and ''abab'' = ''e''. This permutation group is isomorphic, as an abstract group, to the Klein group ''V''₄.

As another example consider the group of symmetries of a square. Let the vertices of a square be labeled 1, 2, 3 and 4 (counterclockwise around the square starting with 1 in the top left corner). The symmetries are determined by the images of the vertices, that can, in turn, be described by permutations. The rotation by 90° (counterclockwise) about the center of the square is described by the permutation (1234). The 180° and 270° rotations are given by (13)(24) and (1432), respectively. The reflection about the horizontal line through the center is given by (12)(34) and the corresponding vertical line reflection is (14)(23). The reflection about the 1,3−diagonal line is (24) and reflection about the 2,4−diagonal is (13). The only remaining symmetry is the identity (1)(2)(3)(4). This permutation group is abstractly known as the dihedral group of order 8.

Group actions

In the above example of the symmetry group of a square, the permutations "describe" the movement of the vertices of the square induced by the group of symmetries. It is common to say that these group elements are "acting" on the set of vertices of the square. This idea can be made precise by formally defining a group action.

Let ''G'' be a group and ''M'' a nonempty set. An action of ''G'' on ''M'' is a function ''f'': ''G'' × ''M'' → ''M'' such that
* ''f''(1, ''x'') = ''x'', for all ''x'' in ''M'' (1 is the identity (neutral) element of the group ''G''), and
* ''f''(''g'', ''f''(''h'', ''x'')) = ''f''(''gh'', ''x''), for all ''g'',''h'' in ''G'' and all ''x'' in ''M''.
This pair of conditions can also be expressed as saying that the action induces a group homomorphism from ''G'' into ''Sym''(''M''). Any such homomorphism is called a ''(permutation) representation'' of ''G'' on ''M''.

For any permutation group, the action that sends (''g'', ''x'') → ''g''(''x'') is called the natural action of ''G'' on ''M''. This is the action that is assumed unless otherwise indicated. In the example of the symmetry group of the square, the group's action on the set of vertices is the natural action. However, this group also induces an action on the set of four triangles in the square, which are: ''t''₁ = 234, ''t''₂ = 134, ''t''₃ = 124 and ''t''₄ = 123. It also acts on the two diagonals: ''d''₁ = 13 and ''d''₂ = 24.

Transitive actions

The action of a group ''G'' on a set ''M'' is said to be ''transitive'' if, for every two elements ''s'', ''t'' of ''M'', there is some group element ''g'' such that ''g''(''s'') = ''t''. Equivalently, the set ''M'' forms a single orbit under the action of ''G''. Of the examples above, the group of permutations of is not transitive (no group element takes 1 to 3) but the group of symmetries of a square is transitive on the vertices.

Primitive actions

A permutation group ''G'' acting transitively on a non-empty finite set ''M'' is ''imprimitive'' if there is some nontrivial set partition of ''M'' that is preserved by the action of ''G'', where "nontrivial" means that the partition isn't the partition into singleton sets nor the partition with only one part. Otherwise, if ''G'' is transitive but does not preserve any nontrivial partition of ''M'', the group ''G'' is ''primitive''.

For example, the group of symmetries of a square is imprimitive on the vertices: if they are numbered 1, 2, 3, 4 in cyclic order, then the partition into opposite pairs is preserved by every group element. On the other hand, the full symmetric group on a set ''M'' is always primitive.

Cayley's theorem

Any group ''G'' can act on itself (the elements of the group being thought of as the set ''M'') in many ways. In particular, there is a regular action given by (left) multiplication in the group. That is, ''f''(''g'', ''x'') = ''gx'' for all ''g'' and ''x'' in ''G''. For each fixed ''g'', the function ''f''_''g''(''x'') = ''gx'' is a bijection on ''G'' and therefore a permutation of the set of elements of ''G''. Each element of ''G'' can be thought of as a permutation in this way and so ''G'' is isomorphic to a permutation group; this is the content of Cayley's theorem.

For example, consider the group ''G''₁ acting on the set given above. Let the elements of this group be denoted by ''e'', ''a'', ''b'' and ''c'' = ''ab'' = ''ba''. The action of ''G''₁ on itself described in Cayley's theorem gives the following permutation representation:
:''f''_''e'' ↦ (''e'')(''a'')(''b'')(''c'')
:''f''_''a'' ↦ (''ea'')(''bc'')
:''f''_''b'' ↦ (''eb'')(''ac'')
:''f''_''c'' ↦ (''ec'')(''ab'').

Isomorphisms of permutation groups

If ''G'' and ''H'' are two permutation groups on sets ''X'' and ''Y'' with actions ''f''₁ and ''f''₂ respectively, then we say that ''G'' and ''H'' are ''permutation isomorphic'' (or ''isomorphic as permutation groups'') if there exists a bijective map and a group isomorphism such that
: ''λ''(''f''₁(''g'', ''x'')) = ''f''₂(''ψ''(''g''), ''λ''(''x'')) for all ''g'' in ''G'' and ''x'' in ''X''.

If this is equivalent to ''G'' and ''H'' being conjugate as subgroups of Sym(''X''). The special case where and ''ψ'' is the identity map gives rise to the concept of ''equivalent actions'' of a group.

In the example of the symmetries of a square given above, the natural action on the set is equivalent to the action on the triangles. The bijection ''λ'' between the sets is given by . The natural action of group ''G''₁ above and its action on itself (via left multiplication) are not equivalent as the natural action has fixed points and the second action does not.

Oligomorphic groups

When a group ''G'' acts on a set ''S'', the action may be extended naturally to the Cartesian product ''Sⁿ'' of ''S'', consisting of ''n''-tuples of elements of ''S'': the action of an element ''g'' on the ''n''-tuple (''s''₁, ..., ''s''_''n'') is given by
: ''g''(''s''₁, ..., ''s''_''n'') = (''g''(''s''₁), ..., ''g''(''s''_''n'')).

The group ''G'' is said to be ''oligomorphic'' if the action on ''Sⁿ'' has only finitely many orbits for every positive integer ''n''. (This is automatic if ''S'' is finite, so the term is typically of interest when ''S'' is infinite.)

The interest in oligomorphic groups is partly based on their application to model theory, for example when considering automorphisms in countably categorical theories.

History

The study of groups originally grew out of an understanding of permutation groups. Permutations had themselves been intensively studied by Lagrange in 1770 in his work on the algebraic solutions of polynomial equations. This subject flourished and by the mid 19th century a well-developed theory of permutation groups existed, codified by Camille Jordan in his book ''Traité des Substitutions et des Équations Algébriques'' of 1870. Jordan's book was, in turn, based on the papers that were left by Évariste Galois in 1832.

When Cayley introduced the concept of an abstract group, it was not immediately clear whether or not this was a larger collection of objects than the known permutation groups (which had a definition different from the modern one). Cayley went on to prove that the two concepts were equivalent in Cayley's theorem.

Another classical text containing several chapters on permutation groups is Burnside's ''Theory of Groups of Finite Order'' of 1911. The first half of the twentieth century was a fallow period in the study of group theory in general, but interest in permutation groups was revived in the 1950s by H. Wielandt whose German lecture notes were reprinted as ''Finite Permutation Groups'' in 1964.

See also

* 2-transitive group
* Rank 3 permutation group
* Mathieu group

Notes

References

*
*
*
*

Further reading

* Akos Seress. ''Permutation group algorithms''. Cambridge Tracts in Mathematics, 152. Cambridge University Press, Cambridge, 2003.
* Meenaxi Bhattacharjee, Dugald Macpherson, Rögnvaldur G. Möller and Peter M. Neumann. ''Notes on Infinite Permutation Groups''. Number 1698 in Lecture Notes in Mathematics. Springer-Verlag, 1998.
* Peter J. Cameron. ''Permutation Groups''. LMS Student Text 45. Cambridge University Press, Cambridge, 1999.
* Peter J. Cameron. ''Oligomorphic Permutation Groups''. Cambridge University Press, Cambridge, 1990.

External links

*
* Alexander Hulpke. GAP Data Librar
"Transitive Permutation Groups"

{{DEFAULTSORT:Permutation Group

Finite groups