|
|
| Line 1: |
Line 1: |
| {{Distinguish|Symmetry group}}
| | بيع,شراء,بيع واشتري,بيع وشراء,مستعمل,جديد,[http://www.Filmarket.net لاب توب للبيع],سياره,سياره<br>للبيع,كلب للبيع,موبايل ,لبيع,موبايل,تاب,تابلت,في الماركت,في الماركت<br>دوت نت,بيع واشتري في الماركت,بيع واشتري في الماركت دوت نت,<br><br>http://www.Filmarket.net |
| [[File:Symmetric group 4; Cayley graph 4,9.svg|thumb|320px|A [[Cayley graph]] of the symmetric group [[v:Symmetric group S4|S<sub>4</sub>]]]]
| |
| [[File:Symmetric group 3; Cayley table; matrices.svg|thumb|320px|[[Cayley table]] of the symmetric group S<sub>3</sub><br>([[multiplication table]] of [[permutation matrix|permutation matrices]])<br><br>These are the positions of the six matrices:<br>[[File:Symmetric group 3; Cayley table; positions.svg|310px]]<br>Only the unity matrices are arranged symmetrically to the main diagonal - thus the symmetric group is not abelian.]]
| |
| {{Group theory sidebar |Finite}}
| |
| | |
| In [[abstract algebra]], the '''symmetric group''' ''S''<sub>''n''</sub> on a [[finite set]] of ''n'' symbols is the [[group (mathematics)|group]] whose elements are all the [[permutations]] of the ''n'' symbols, and whose [[group operation]] is the [[function composition|composition]] of such permutations, which are treated as [[bijection|bijective functions]] from the set of symbols to itself.<ref name=Jacobson-def>Jacobson (2009), p. 31.</ref> Since there are ''n''! (''n'' [[factorial]]) possible permutations of a set of ''n'' symbols, it follows that the [[Order (group theory)|order]] (the number of elements) of the symmetric group ''S''<sub>''n''</sub> is ''n''!.
| |
| | |
| Although symmetric groups can be defined on infinite sets as well, this article discusses only the finite symmetric groups: their applications, their elements, their [[conjugacy class]]es, a [[finitely presented group|finite presentation]], their [[subgroup]]s, their automorphism groups, and their representation theory. For the remainder of this article, "symmetric group" will mean a symmetric group on a finite set.
| |
| | |
| The symmetric group is important to diverse areas of mathematics such as [[Galois theory]], [[invariant theory]], the [[representation theory of Lie groups]], and [[combinatorics]]. [[Cayley's theorem]] states that every group ''G'' is [[group isomorphism|isomorphic]] to a [[subgroup]] of the symmetric group on ''G''.
| |
| | |
| == Definition and first properties ==
| |
| The '''symmetric group''' on a finite set ''X'' is the group whose elements are all bijective functions from ''X'' to ''X'' and whose group operation is that of [[function composition]].<ref name=Jacobson-def /> For finite sets, "permutations" and "bijective functions" refer to the same operation, namely rearrangement. The symmetric group of '''degree''' ''n'' is the symmetric group on the set {{nowrap|1=''X'' = { 1, 2, ..., ''n'' }.}}
| |
| | |
| The symmetric group on a set ''X'' is denoted in various ways including ''S''<sub>''X''</sub>, 𝔖<sub>''X''</sub>, Σ<sub>''X''</sub>, and Sym(''X'').<ref name=Jacobson-def /> If ''X'' is the set {{nowrap|{ 1, 2, ..., ''n'' },}} then the symmetric group on ''X'' is also denoted ''S''<sub>''n''</sub>,<ref name=Jacobson-def /> 𝔖<sub>''n''</sub>, Σ<sub>''n''</sub>, and Sym(''n'').
| |
| | |
| Symmetric groups on infinite sets behave quite differently from symmetric groups on finite sets, and are discussed in {{harv|Scott|1987|loc=Ch. 11}}, {{harv|Dixon|Mortimer|1996|loc=Ch. 8}}, and {{harv|Cameron|1999}}. This article concentrates on the finite symmetric groups.
| |
| | |
| The symmetric group on a set of ''n'' elements has [[order (group theory)|order]] [[factorial|''n''!]] <ref>Jacobson (2009), p. 32. Theorem 1.1.</ref> It is [[abelian group|abelian]] if and only if {{nowrap|''n'' ≤ 2}}. For {{nowrap|1=''n'' = 0}} and {{nowrap|1=''n'' = 1}} (the [[empty set]] and the [[singleton set]]) the symmetric group is [[trivial group|trivial]] (note that this agrees with {{nowrap|1=0! = 1! = 1}}), and in these cases the [[alternating group]] equals the symmetric group, rather than being an index two subgroup. The group ''S''<sub>''n''</sub> is [[solvable group|solvable]] if and only if {{nowrap|''n'' ≤ 4}}. This is an essential part of the proof of the [[Abel–Ruffini theorem]] that shows that for every {{nowrap|''n'' > 4}} there are [[polynomial]]s of degree ''n'' which are not solvable by radicals, i.e., the solutions cannot be expressed by performing a finite number of operations of addition, subtraction, multiplication, division and root extraction on the polynomial's coefficients.
| |
| | |
| == Applications ==
| |
| The symmetric group on a set of size ''n'' is the [[Galois group]] of the general [[polynomial]] of degree ''n'' and plays an important role in [[Galois theory]]. In [[invariant theory]], the symmetric group acts on the variables of a multi-variate function, and the functions left invariant are the so-called [[symmetric function]]s. In the [[representation theory of Lie groups]], the [[representation theory of the symmetric group]] plays a fundamental role through the ideas of [[Schur functor]]s. In the theory of [[Coxeter group]]s, the symmetric group is the Coxeter group of type ''A''<sub>''n''</sub> and occurs as the [[Weyl group]] of the [[general linear group]]. In [[combinatorics]], the symmetric groups, their elements ([[permutation]]s), and their [[group representation|representations]] provide a rich source of problems involving [[Young tableaux]], [[plactic monoid]]s, and the [[Bruhat order]]. [[Subgroup]]s of symmetric groups are called [[permutation group]]s and are widely studied because of their importance in understanding [[group action]]s, [[homogenous space]]s, and [[automorphism group]]s of [[Graph (mathematics)|graph]]s, such as the [[Higman–Sims group]] and the [[Higman–Sims graph]].
| |
| | |
| == Elements ==
| |
| The elements of the symmetric group on a set ''X'' are the [[permutation]]s of ''X''.
| |
| | |
| === Multiplication ===
| |
| The group operation in a symmetric group is [[function composition]], denoted by the symbol ∘ or simply by juxtaposition of the permutations. The composition {{nowrap|''f'' ∘ ''g''}} of permutations ''f'' and ''g'', pronounced "''f'' after ''g''", maps any element ''x'' of ''X'' to ''f''(''g''(''x'')). Concretely, let (see [[permutation]] for an explanation of notation):
| |
| | |
| : <math> f = (1\ 3)(4\ 5)=\begin{pmatrix} 1 & 2 & 3 & 4 & 5 \\ 3 & 2 & 1 & 5 & 4\end{pmatrix} </math>
| |
| : <math> g = (1\ 2\ 5)(3\ 4)=\begin{pmatrix} 1 & 2 & 3 & 4 & 5 \\ 2 & 5 & 4 & 3 & 1\end{pmatrix}.</math>
| |
| | |
| Applying ''f'' after ''g'' maps 1 first to 2 and then 2 to itself; 2 to 5 and then to 4; 3 to 4 and then to 5, and so on. So composing ''f'' and ''g'' gives
| |
| : <math> fg = f\circ g = (1\ 2\ 4)(3\ 5)=\begin{pmatrix} 1 & 2 &3 & 4 & 5 \\ 2 & 4 & 5 & 1 & 3\end{pmatrix}.</math>
| |
| | |
| A [[Cycle (mathematics)|cycle]] of length {{nowrap|1=''L'' = ''k'' · ''m''}}, taken to the ''k''-th power, will decompose into ''k'' cycles of length ''m'': For example ({{nowrap|1=''k'' = 2}}, {{nowrap|1=''m'' = 3}}),
| |
| : <math> (1~2~3~4~5~6)^2 = (1~3~5) (2~4~6).</math>
| |
| | |
| === Verification of group axioms ===
| |
| To check that the symmetric group on a set ''X'' is indeed a [[group (mathematics)|group]], it is necessary to verify the group axioms of closure, associativity, identity, and inverses.<ref>modern algebra Author A. R. Vasishtha, A. K. Vasishtha Publisher Krishna Prakashan Media</ref> 1) The operation of [[function composition]] is closed in the set of permutations of the given set ''X'', 2) [[function composition]] is always associative, 3) The trivial bijection that assigns each element of ''X'' to itself serves as an identity for the group, and 4) Every bijection has an [[inverse function]] that undoes its action, and thus each element of a symmetric group does have an inverse which is a permutation too.
| |
| | |
| === Transpositions ===
| |
| {{main|Transposition (mathematics)}}
| |
| A '''transposition''' is a permutation which exchanges two elements and keeps all others fixed; for example (1 3) is a transposition. Every permutation can be written as a product of transpositions; for instance, the permutation ''g'' from above can be written as ''g'' = (1 2)(2 5)(3 4). Since ''g'' can be written as a product of an odd number of transpositions, it is then called an [[Even and odd permutations|odd permutation]], whereas ''f'' is an even permutation.
| |
| | |
| The representation of a permutation as a product of transpositions is not unique; however, the number of transpositions needed to represent a given permutation is either always even or always odd. There are several short proofs of the invariance of this parity of a permutation.
| |
| | |
| The product of two even permutations is even, the product of two odd permutations is even, and all other products are odd. Thus we can define the '''sign''' of a permutation:
| |
| | |
| :<math>\operatorname{sgn}f = \begin{cases} +1, & \text{if }f\mbox { is even} \\ -1, & \text{if }f \text{ is odd}. \end{cases}</math>
| |
| | |
| With this definition,
| |
| :<math>\operatorname{sgn}\colon S_n \rightarrow \{+1, -1\}\ </math>
| |
| is a [[group homomorphism]] ({+1, –1} is a group under multiplication, where +1 is ''e'', the [[neutral element]]). The [[Kernel (algebra)|kernel]] of this homomorphism, i.e. the set of all even permutations, is called the '''[[alternating group]]''' ''A''<sub>''n''</sub>. It is a [[normal subgroup]] of ''S''<sub>''n''</sub>, and for {{nowrap|''n'' ≥ 2}} it has {{nowrap|''n''!/2}} elements. The group ''S''<sub>''n''</sub> is the [[semidirect product]] of ''A''<sub>''n''</sub> and any subgroup generated by a single transposition.
| |
| | |
| Furthermore, every permutation can be written as a product of ''[[adjacent transposition]]s'', that is, transpositions of the form {{nowrap|(''a'' ''a''+1)}}. For instance, the permutation ''g'' from above can also be written as {{nowrap|1=''g'' = (4 5)(3 4)(4 5)(1 2)(2 3)(3 4)(4 5)}}. The sorting algorithm [[Bubble sort]] is an application of this fact. The representation of a permutation as a product of adjacent transpositions is also not unique.
| |
| | |
| === Cycles ===
| |
| A [[Cycle (mathematics)|cycle]] of ''length'' ''k'' is a permutation ''f'' for which there exists an element ''x'' in {1,...,''n''} such that ''x'', ''f''(''x''), ''f''<sup>2</sup>(''x''), ..., ''f''<sup>''k''</sup>(''x'') = ''x'' are the only elements moved by ''f''; it is required that {{nowrap|''k'' ≥ 2}} since with {{nowrap|1=''k'' = 1}} the element ''x'' itself would not be moved either. The permutation ''h'' defined by
| |
| | |
| :<math>h = \begin{pmatrix} 1 & 2 & 3 & 4 & 5 \\ 4 & 2 & 1 & 3 & 5\end{pmatrix}</math>
| |
| | |
| is a cycle of length three, since {{nowrap|1=''h''(1) = 4}}, {{nowrap|1=''h''(4) = 3}} and {{nowrap|1=''h''(3) = 1}}, leaving 2 and 5 untouched. We denote such a cycle by {{nowrap|(1 4 3)}}, but it could equally well be written {{nowrap|(4 3 1)}} or {{nowrap|(3 1 4)}} by starting at a different point. The order of a cycle is equal to its length. Cycles of length two are transpositions. Two cycles are ''disjoint'' if they move disjoint subsets of elements. Disjoint cycles [[Commutative property|commute]], e.g. in ''S''<sub>6</sub> we have {{nowrap|1=(4 1 3)(2 5 6) = (2 5 6)(4 1 3)}}. Every element of ''S''<sub>''n''</sub> can be written as a product of disjoint cycles; this representation is unique [[up to]] the order of the factors, and the freedom present in representing each individual cycle by choosing its starting point.
| |
| | |
| === Special elements ===
| |
| Certain elements of the symmetric group of {1, 2, ..., ''n''} are of particular interest (these can be generalized to the symmetric group of any finite totally ordered set, but not to that of an unordered set).
| |
| | |
| The '''{{visible anchor|order reversing permutation}}''' is the one given by:
| |
| :<math>\begin{pmatrix} 1 & 2 & \cdots & n\\
| |
| n & n-1 & \cdots & 1\end{pmatrix}.</math>
| |
| This is the unique maximal element with respect to the [[Bruhat order]] and the
| |
| [[longest element of a Coxeter group|longest element]] in the symmetric group with respect to generating set consisting of the adjacent transpositions {{nowrap|(''i'' ''i''+1)}}, {{nowrap|1 ≤ ''i'' ≤ ''n'' − 1}}.
| |
| | |
| This is an involution, and consists of <math>\lfloor n/2 \rfloor</math> (non-adjacent) transpositions
| |
| :<math>(1\,n)(2\,n-1)\cdots,\text{ or }\sum_{k=1}^{n-1} k = \frac{n(n-1)}{2}\text{ adjacent transpositions: }</math>
| |
| :: <math>(n\,n-1)(n-1\,n-2)\cdots(2\,1)(n-1\,n-2)(n-2\,n-3)\cdots,</math>
| |
| | |
| so it thus has sign:
| |
| | |
| :<math>\mathrm{sgn}(\rho_n) = (-1)^{\lfloor n/2 \rfloor} =(-1)^{n(n-1)/2} = \begin{cases}
| |
| +1 & n \equiv 0,1 \pmod{4}\\
| |
| -1 & n \equiv 2,3 \pmod{4}
| |
| \end{cases}</math>
| |
| which is 4-periodic in ''n''.
| |
| | |
| In ''S''<sub>2''n''</sub>, the ''[[perfect shuffle]]'' is the permutation that splits the set into 2 piles and interleaves them. Its sign is also <math>(-1)^{\lfloor n/2 \rfloor}.</math>
| |
| | |
| Note that the reverse on ''n'' elements and perfect shuffle on 2''n'' elements have the same sign; these are important to the classification of [[Clifford algebra]]s, which are 8-periodic.
| |
| | |
| == Conjugacy classes ==
| |
| The [[conjugacy class]]es of ''S''<sub>''n''</sub> correspond to the cycle structures of permutations; that is, two elements of ''S''<sub>''n''</sub> are conjugate in ''S''<sub>''n''</sub> if and only if they consist of the same number of disjoint cycles of the same lengths. For instance, in ''S''<sub>5</sub>, (1 2 3)(4 5) and (1 4 3)(2 5) are conjugate; (1 2 3)(4 5) and (1 2)(4 5) are not. A conjugating element of ''S''<sub>''n''</sub> can be constructed in "two line notation" by placing the "cycle notations" of the two conjugate permutations on top of one another. Continuing the previous example:
| |
| | |
| :<math>k = \begin{pmatrix} 1 & 2 & 3 & 4 & 5 \\ 1 & 4 & 3 & 2 & 5\end{pmatrix}</math>
| |
| | |
| which can be written as the product of cycles, namely: (2 4).
| |
| | |
| This permutation then relates (1 2 3)(4 5) and (1 4 3)(2 5) via conjugation, i.e.
| |
| | |
| :<math>(2~4)(1~2~3)(4~5)(2~4)=(1~4~3)(2~5).\ </math>
| |
| | |
| It is clear that such a permutation is not unique.
| |
| | |
| == Low degree groups ==
| |
| {{See also|Representation theory of the symmetric group#Special cases}}
| |
| The low-degree symmetric groups have simpler and exceptional structure, and often must be treated separately.
| |
| | |
| ;Sym(0) and Sym(1): The symmetric groups on the [[empty set]] and the [[singleton set]] are trivial, which corresponds to {{nowrap|1=0! = 1! = 1}}. In this case the alternating group agrees with the symmetric group, rather than being an index 2 subgroup, and the sign map is trivial. In the case of Sym(0), its only member is the [[Empty function]].
| |
| | |
| ;Sym(2): This group consists of exactly two elements: the identity and the permutation swapping the two points. It is a [[cyclic group]] and so [[abelian group|abelian]]. In [[Galois theory]], this corresponds to the fact that the [[quadratic formula]] gives a direct solution to the general [[quadratic polynomial]] after extracting only a single root. In [[invariant theory]], the representation theory of the symmetric group on two points is quite simple and is seen as writing a function of two variables as a sum of its symmetric and anti-symmetric parts: Setting ''f<sub>s</sub>''(''x'',''y'') = f(''x'',''y'') + f(''y'',''x''), and ''f<sub>a</sub>''(''x'',''y'') = ''f''(''x'',''y'') − ''f''(''y'',''x''), one gets that 2·''f'' = ''f<sub>s</sub>'' + ''f<sub>a</sub>''. This process is known as [[symmetrization]].
| |
| | |
| ;Sym(3): This group is isomorphic to the [[dihedral group of order 6]], the group of reflection and rotation symmetries of an [[equilateral triangle]], since these symmetries permute the three vertices of the triangle. Cycles of length two correspond to reflections, and cycles of length three are rotations. In Galois theory, the sign map from Sym(3) to Sym(2) corresponds to the resolving quadratic for a [[cubic polynomial]], as discovered by [[Gerolamo Cardano]], while the Alt(3) kernel corresponds to the use of the [[discrete Fourier transform]] of order 3 in the solution, in the form of [[Lagrange resolvent]]s.{{citation needed|date=September 2009}}
| |
| | |
| ;Sym(4): The group [[Wikiversity:Symmetric group S4|''S''<sub>4</sub>]] is isomorphic to the group of proper rotations about opposite faces, opposite diagonals and opposite edges, [[Rencontres numbers|9, 8 and 6]] permutations, of the [[cube]].<ref>Die Untergruppenverbände der Gruppen der ordnung weniger als 100, Habilitationsschrift, J. Neubuser, Universität Kiel, Germany, 1967.</ref> Beyond the group [[Alternating group|Alt(4)]], Sym(4) has a [[Klein four-group]] V as a proper [[normal subgroup]], namely the even transpositions {(1), (1 2)(3 4), (1 3)(2 4), (1 4)(2 3)}, with quotient Sym(3). In [[Galois theory]], this map corresponds to the resolving cubic to a [[quartic polynomial]], which allows the quartic to be solved by radicals, as established by [[Lodovico Ferrari]]. The Klein group can be understood in terms of the [[Lagrange resolvent]]s of the quartic. The map from Sym(4) to Sym(3) also yields a 2-dimensional irreducible representation, which is an irreducible representation of a symmetric group of degree ''n'' of dimension below {{nowrap|''n'' − 1}}, which only occurs for {{nowrap|1=''n'' = 4}}.
| |
| | |
| ;Sym(5): Sym(5) is the first non-solvable symmetric group. Along with the [[special linear group]] SL(2, 5) and the [[icosahedral group]] Alt(5) × Sym(2), Sym(5) is one of the three non-solvable groups of order 120 up to isomorphism. Sym(5) is the [[Galois group]] of the general [[quintic equation]], and the fact that Sym(5) is not a [[solvable group]] translates into the non-existence of a general formula to solve [[quintic polynomial]]s by radicals. There is an exotic inclusion map {{nowrap|Sym(5) → Sym(6)}} as a [[#Transitive subgroup anchor|transitive subgroup]]; the obvious inclusion map {{nowrap|Sym(''n'') → Sym(''n'' + 1)}} fixes a point and thus is not transitive. This yields the outer automorphism of Sym(6), discussed below, and corresponds to the resolvent sextic of a quintic.
| |
| | |
| ;Sym(6): Sym(6), unlike other symmetric groups, has an [[outer automorphism]]. Using the language of [[Galois theory]], this can also be understood in terms of [[Lagrange resolvents]]. The resolvent of a quintic is of degree 6—this corresponds to an exotic inclusion map Sym(5) → Sym(6) as a transitive subgroup (the obvious inclusion map {{nowrap|Sym(''n'') → Sym(''n'' + 1)}} fixes a point and thus is not transitive) and, while this map does not make the general quintic solvable, it yields the exotic outer automorphism of Sym(6)—see [[automorphisms of the symmetric and alternating groups]] for details.
| |
| :Note that while Alt(6) and Alt(7) have an exceptional [[Schur multiplier]] (a [[Covering groups of the alternating and symmetric groups|triple cover]]) and that these extend to triple covers of Sym(6) and Sym(7), these do not correspond to exceptional Schur multipliers of the symmetric group.
| |
| | |
| === Maps between symmetric groups ===
| |
| Other than the trivial map {{nowrap|1=Sym(''n'') → 1 ≅ Sym(0) ≅ Sym(1)}} and the sign map {{nowrap|Sym(''n'') → Sym(2)}}, the notable maps between symmetric groups, in order of [[relative dimension]], are:
| |
| * Sym(4) → Sym(3) corresponding to the exceptional normal subgroup {{nowrap|V < Alt(4) < Sym(4)}};
| |
| * Sym(6) → Sym(6) (or rather, a class of such maps up to inner automorphism) corresponding to the outer automorphism of Sym(6)
| |
| * Sym(5) → Sym(6) as a transitive subgroup, yielding the outer automorphism of Sym(6) as discussed above.
| |
| | |
| == Properties ==
| |
| Symmetric groups are [[Coxeter group]]s and [[reflection group]]s. They can be realized as a group of reflections with respect to hyperplanes {{nowrap|1=''x''<sub>''i''</sub> = ''x''<sub>''j''</sub>, 1 ≤ ''i'' < ''j'' ≤ ''n''}}. [[Braid group]]s ''B''<sub>''n''</sub> admit symmetric groups ''S''<sub>''n''</sub> as [[quotient group]]s.
| |
| | |
| [[Cayley's theorem]] states that every group ''G'' is isomorphic to a subgroup of the symmetric group on the elements of ''G'', as a group acts on itself faithfully by (left or right) multiplication.
| |
| | |
| == Relation with alternating group ==
| |
| For {{nowrap|''n'' ≥ 5}}, the [[alternating group]] ''A''<sub>''n''</sub> is [[Simple group|simple]], and the induced quotient is the sign map: {{nowrap|''A''<sub>''n''</sub> → ''S''<sub>''n''</sub> → ''S''<sub>2</sub>}} which is split by taking a transposition of two elements. Thus ''S''<sub>''n''</sub> is the semidirect product {{nowrap|''A''<sub>''n''</sub> ⋊ ''S''<sub>2</sub>}}, and has no other proper normal subgroups, as they would intersect ''A''<sub>''n''</sub> in either the identity (and thus themselves be the identity or a 2-element group, which is not normal), or in ''A''<sub>''n''</sub> (and thus themselves be ''A''<sub>''n''</sub> or ''S''<sub>''n''</sub>).
| |
| | |
| ''S''<sub>''n''</sub> acts on its subgroup ''A''<sub>''n''</sub> by conjugation, and for {{nowrap|''n'' ≠ 6}}, ''S''<sub>''n''</sub> is the full automorphism group of ''A''<sub>''n''</sub>: Aut(''A''<sub>''n''</sub>) ≅ ''S''<sub>''n''</sub>. Conjugation by even elements are [[inner automorphism]]s of ''A''<sub>''n''</sub> while the [[outer automorphism]] of ''A''<sub>''n''</sub> of order 2 corresponds to conjugation by an odd element. For {{nowrap|1=''n'' = 6}}, there is an [[Automorphisms of the symmetric and alternating groups#exceptional outer automorphism|exceptional outer automorphism]] of ''A''<sub>''n''</sub> so ''S''<sub>''n''</sub> is not the full automorphism group of ''A''<sub>''n''</sub>.
| |
| | |
| Conversely, for {{nowrap|''n'' ≠ 6}}, ''S''<sub>''n''</sub> has no outer automorphisms, and for {{nowrap|''n'' ≠ 2}} it has no center, so for {{nowrap|''n'' ≠ 2, 6}} it is a [[complete group]], as discussed in [[#Automorphism group|automorphism group]], below.
| |
| | |
| For {{nowrap|''n'' ≥ 5}}, ''S''<sub>''n''</sub> is an [[almost simple group]], as it lies between the simple group ''A''<sub>''n''</sub> and its group of automorphisms.
| |
| | |
| == Generators and relations ==
| |
| The symmetric group on ''n''-letters, ''S''<sub>''n''</sub>, may be described as follows. It has generators: <math>\sigma_1, \ldots, \sigma_{n-1}</math> and relations:
| |
| *<math>{\sigma_i}^2 = 1,</math>
| |
| *<math>\sigma_i\sigma_j = \sigma_j\sigma_i \text{ if } j \neq i\pm 1,</math>
| |
| *<math>\sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i\sigma_{i+1}.\ </math>
| |
| | |
| One thinks of <math>\sigma_i</math> as swapping the ''i''th and {{nowrap|(''i'' + 1)th}} position.
| |
| | |
| Other popular generating sets include the set of transpositions that swap 1 and ''i'' for {{nowrap|2 ≤ ''i'' ≤ ''n''}} and a set containing any ''n''-cycle and a 2-cycle of adjacent elements in the n-cycle.
| |
| | |
| == Subgroup structure ==
| |
| A [[subgroup]] of a symmetric group is called a [[permutation group]].
| |
| | |
| === Normal subgroups ===
| |
| The [[normal subgroup]]s of the finite symmetric groups are well understood. If {{nowrap|''n'' ≤ 2}}, ''S''<sub>''n''</sub> has at most 2 elements, and so has no nontrivial proper subgroups. The [[alternating group]] of degree ''n'' is always a normal subgroup, a proper one for {{nowrap|''n'' ≥ 2}} and nontrivial for {{nowrap|''n'' ≥ 3}}; for {{nowrap|''n'' ≥ 3}} it is in fact the only non-identity proper normal subgroup of ''S''<sub>''n''</sub>, except when {{nowrap|1=''n'' = 4}} where there is one additional such normal subgroup, which is isomorphic to the [[Klein four group]].
| |
| | |
| The symmetric group on an infinite set does not have an associated alternating group: not all elements can be written as a (finite) product of transpositions. However it does contain a normal subgroup ''S'' of permutations that fix all but finitely many elements, and such permutations can be classified as either even or odd. The even elements of ''S'' form the alternating subgroup ''A'' of ''S'', and since ''A'' is even a [[characteristic subgroup]] of ''S'', it is also a normal subgroup of the full symmetric group of the infinite set. The groups ''A'' and ''S'' are the only non-identity proper normal subgroups of the symmetric group on a countably infinite set. For more details see {{harv|Scott|1987|loc=Ch. 11.3}} or {{harv|Dixon|Mortimer|1996|loc=Ch. 8.1}}.
| |
| | |
| === Maximal subgroups ===
| |
| {{expand section|date=September 2009}}
| |
| | |
| The [[maximal subgroup]]s of the finite symmetric groups fall into three classes: the intransitive, the imprimitive, and the primitive. The intransitive maximal subgroups are exactly those of the form {{nowrap|Sym(''k'') × Sym(''n'' − ''k'')}} for {{nowrap|1 ≤ ''k'' < ''n''/2}}. The imprimitive maximal subgroups are exactly those of the form Sym(''k'') wr Sym(''n''/''k'') where {{nowrap|2 ≤ ''k'' ≤ ''n''/2}} is a proper divisor of ''n'' and "wr" denotes the [[wreath product]] acting imprimitively. The primitive maximal subgroups are more difficult to identify, but with the assistance of the [[O'Nan–Scott theorem]] and the [[classification of finite simple groups]], {{harv|Liebeck|Praeger|Saxl|1988}} gave a fairly satisfactory description of the maximal subgroups of this type<!-- though beware of typos in the low degrees--> according to {{harv|Dixon|Mortimer|1996|p=268}}.
| |
| | |
| === Sylow subgroups ===
| |
| The [[Sylow subgroup]]s of the symmetric groups are important examples of [[p-group|''p''-groups]]. They are more easily described in special cases first:
| |
| | |
| The Sylow ''p''-subgroups of the symmetric group of degree ''p'' are just the cyclic subgroups generated by ''p''-cycles. There are {{nowrap|1=(''p'' − 1)!/(''p'' − 1) = (''p'' − 2)!}} such subgroups simply by counting generators. The [[normalizer]] therefore has order ''p''·(''p''−1) and is known as a [[Frobenius group]] {{nowrap|''F''<sub>''p''(''p'' − 1)</sub>}} (especially for {{nowrap|1=''p'' = 5}}), and is the [[affine general linear group]], {{nowrap|AGL(1, ''p'')}}.
| |
| | |
| The Sylow ''p''-subgroups of the symmetric group of degree ''p''<sup>2</sup> are the [[wreath product]] of two cyclic groups of order ''p''. For instance, when ''p'' = 3, a Sylow 3-subgroup of Sym(9) is generated by ''a'' = (1 4 7)(2 5 8)(3 6 9) and the elements ''x'' = (1 2 3), ''y'' = (4 5 6), ''z'' = (7 8 9)<!-- or just use (1,2,3) -->, and every element of the Sylow 3-subgroup has the form ''a''<sup>''i''</sup>''x''<sup>''j''</sup>''y''<sup>''k''</sup>''z''<sup>''l''</sup> for 0 ≤ ''i'',''j'',''k'',''l'' ≤ 2.
| |
| | |
| The Sylow ''p''-subgroups of the symmetric group of degree ''p''<sup>''n''</sup> are sometimes denoted W<sub>''p''</sub>(''n''), and using this notation one has that {{nowrap|W<sub>''p''</sub>(''n'' + 1)}} is the wreath product of W<sub>''p''</sub>(''n'') and W<sub>''p''</sub>(1).
| |
| | |
| In general, the Sylow ''p''-subgroups of the symmetric group of degree ''n'' are a direct product of ''a''<sub>''i''</sub> copies of W<sub>''p''</sub>(''i''), where 0 ≤ ''a<sub>i</sub>'' ≤ ''p'' − 1 and ''n'' = ''a''<sub>0</sub> + ''p''·''a''<sub>1</sub> + ... + ''p''<sup>k</sup>·''a''<sub>''k''</sub>.
| |
| | |
| For instance, W<sub>2</sub>(1) = ''C''<sub>2</sub> and W<sub>2</sub>(2) = ''D''<sub>8</sub>, the [[dihedral group of order 8]], and so a Sylow 2-subgroup of the symmetric group of degree 7 is generated by { (1,3)(2,4), (1,2), (3,4), (5,6) } and is isomorphic to ''D''<sub>8</sub> × ''C''<sub>2</sub>.
| |
| | |
| These calculations are attributed to {{harv|Kaloujnine|1948}} and described in more detail in {{harv|Rotman|1995|p=176}}. Note however that {{harv|Kerber|1971|p=26}} attributes the result to an 1844 work of [[Augustin-Louis Cauchy|Cauchy]], and mentions that it is even covered in textbook form in {{harv|Netto|1882|loc=§39–40}}.
| |
| | |
| ===<span id="Transitive subgroup anchor"></span> Transitive subgroups ===<!-- Transitive subgroup redirects to this anchor-->
| |
| A '''transitive subgroup''' of ''S''<sub>''n''</sub> is a subgroup whose action on {1, 2, ,..., ''n''} is [[transitive action|transitive]]. For example, the Galois group of a ([[finite extension|finite]]) [[Galois extension]] is a transitive subgroup of ''S''<sub>''n''</sub>, for some ''n''.
| |
| | |
| == Automorphism group ==
| |
| {{details|Automorphisms of the symmetric and alternating groups}}
| |
| {| class="wikitable" style="float:right;" cellspacing="2"
| |
| |- style="background:#a0e0a0;"
| |
| | ''n''
| |
| | <math>\mathrm{Aut}(S_n)</math>
| |
| | <math>\mathrm{Out}(S_n)</math>
| |
| | <math>Z(S_n)</math>
| |
| |-
| |
| | <math>n\neq 2,6</math>
| |
| | <math>S_n</math>
| |
| | 1
| |
| | 1
| |
| |-
| |
| | <math>n=2</math>
| |
| | 1
| |
| | 1
| |
| | <math>S_2</math>
| |
| |-
| |
| | <math>n=6</math>
| |
| | <math>S_6 \rtimes C_2</math>
| |
| | <math>C_2</math>
| |
| | 1
| |
| |}
| |
| For {{nowrap|n ≠ 2, 6}}, ''S''<sub>''n''</sub> is a [[complete group]]: its [[center (group theory)|center]] and [[outer automorphism group]] are both trivial.
| |
| | |
| For {{nowrap|1=''n'' = 2}}, the automorphism group is trivial, but ''S''<sub>2</sub> is not trivial: it is isomorphic to ''C''<sub>2</sub>, which is abelian, and hence the center is the whole group.
| |
| | |
| For {{math|1=''n'' = 6}}, it has an outer automorphism of order 2: {{nowrap|1=Out(''S''<sub>6</sub>) = ''C''<sub>2</sub>}}, and the automorphism group is a semidirect product
| |
| :<math>\mathrm{Aut}(\mathrm{S}_6)=\mathrm{S}_6 \rtimes \mathrm{C}_2.\ </math>
| |
| | |
| In fact, for any set ''X'' of cardinality other than 6, every automorphism of the symmetric group on ''X'' is inner, a result first due to {{harv|Schreier|Ulam|1937}} according to {{harv|Dixon|Mortimer|1996|p=259}}.
| |
| | |
| == Homology ==
| |
| {{see also|Alternating group#Group homology}}
| |
| The [[group homology]] of ''S''<sub>''n''</sub> is quite regular and stabilizes: the first homology (concretely, the [[abelianization]]) is:
| |
| | |
| :<math>H_1(\mathrm{S}_n,\mathbf{Z}) = \begin{cases} 0 & n < 2\\
| |
| \mathbf{Z}/2 & n \geq 2.\end{cases}</math>
| |
| | |
| The first homology group is the abelianization, and corresponds to the sign map ''S''<sub>''n''</sub> → ''S''<sub>2</sub> which is the abelianization for ''n'' ≥ 2; for ''n'' < 2 the symmetric group is trivial. This homology is easily computed as follows: ''S''<sub>''n''</sub> is generated by involutions (2-cycles, which have order 2), so the only non-trivial maps {{nowrap|''S''<sub>''n''</sub> → ''C''<sub>''p''</sub>}} are to ''S''<sub>2</sub> and all involutions are conjugate, hence map to the same element in the abelianization (since conjugation is trivial in abelian groups). Thus the only possible maps {{nowrap|''S''<sub>''n''</sub> → ''S''<sub>2</sub> ≅ {±1} }} send an involution to 1 (the trivial map) or to −1 (the sign map). One must also show that the sign map is well-defined, but assuming that, this gives the first homology of ''S''<sub>''n''</sub>.
| |
| | |
| The second homology (concretely, the [[Schur multiplier]]) is:
| |
| :<math>H_2(\mathrm{S}_n,\mathbf{Z}) = \begin{cases} 0 & n < 4\\
| |
| \mathbf{Z}/2 & n \geq 4.\end{cases}</math>
| |
| This was computed in {{Harv|Schur|1911}}, and corresponds to the [[covering groups of the alternating and symmetric groups|double cover of the symmetric group]], 2 · ''S''<sub>''n''</sub>.
| |
| | |
| Note that the [[exceptional object|exceptional]] low-dimensional homology of the alternating group (<math>H_1(\mathrm{A}_3)\cong H_1(\mathrm{A}_4) \cong \mathrm{C}_3,</math> corresponding to non-trivial abelianization, and <math>H_2(\mathrm{A}_6)\cong H_2(\mathrm{A}_7) \cong \mathrm{C}_6,</math> due to the exceptional 3-fold cover) does not change the homology of the symmetric group; the alternating group phenomena do yield symmetric group phenomena – the map <math>\mathrm{A}_4 \twoheadrightarrow \mathrm{C}_3</math> extends to <math>\mathrm{S}_4 \twoheadrightarrow \mathrm{S}_3,</math> and the triple covers of ''A''<sub>6</sub> and ''A''<sub>7</sub> extend to triple covers of ''S''<sub>6</sub> and ''S''<sub>7</sub> – but these are not ''homological'' – the map <math>S_4 \twoheadrightarrow S_3</math> does not change the abelianization of ''S''<sub>4</sub>, and the triple covers do not correspond to homology either.
| |
| | |
| The homology "stabilizes" in the sense of [[stable homotopy]] theory: there is an inclusion map {{nowrap|''S''<sub>''n''</sub> → ''S''<sub>''n'' + 1</sub>}}, and for fixed ''k,'' the induced map on homology {{nowrap|''H''<sub>''k''</sub>(''S''<sub>''n''</sub>) → ''H''<sub>''k''</sub>(''S''<sub>''n'' + 1</sub>)}} is an isomorphism for sufficiently high ''n''. This is analogous to the homology of families [[Lie groups]] stabilizing.
| |
| | |
| The homology of the infinite symmetric group is computed in {{Harv|Nakaoka|1961}}, with the cohomology algebra forming a [[Hopf algebra]].
| |
| | |
| == Representation theory ==
| |
| {{main|Representation theory of the symmetric group}}
| |
| | |
| The [[representation theory of the symmetric group]] is a particular case of the [[representation theory of finite groups]], for which a concrete and detailed theory can be obtained. This has a large area of potential applications, from [[symmetric function]] theory to problems of [[quantum mechanics]] for a number of [[identical particles]].
| |
| | |
| The symmetric group ''S''<sub>''n''</sub> has order ''n''<nowiki>!</nowiki>. Its [[conjugacy class]]es are labeled by [[integer partition|partition]]s of ''n''. Therefore according to the representation theory of a finite group, the number of inequivalent [[irreducible representation]]s, over the [[complex number]]s, is equal to the number of partitions of ''n''. Unlike the general situation for finite groups, there is in fact a natural way to parametrize irreducible representation by the same set that parametrizes conjugacy classes, namely by partitions of ''n'' or equivalently [[Young diagram]]s of size ''n''.
| |
| | |
| Each such irreducible representation can be realized over the integers (every permutation acting by a matrix with integer coefficients); it can be explicitly constructed by computing the [[Young symmetrizer]]s acting on a space generated by the [[Young tableau]]x of shape given by the Young diagram.
| |
| | |
| Over other [[Field (mathematics)|field]]s the situation can become much more complicated. If the field ''K'' has [[characteristic (algebra)|characteristic]] equal to zero or greater than ''n'' then by [[Maschke's theorem]] the [[group algebra]] ''KS<sub>n</sub>'' is semisimple. In these cases the irreducible representations defined over the integers give the complete set of irreducible representations (after reduction modulo the characteristic if necessary).
| |
| | |
| However, the irreducible representations of the symmetric group are not known in arbitrary characteristic. In this context it is more usual to use the language of [[module (mathematics)|module]]s rather than representations. The representation obtained from an irreducible representation defined over the integers by reducing modulo the characteristic will not in general be irreducible. The modules so constructed are called ''[[Specht modules]]'', and every irreducible does arise inside some such module. There are now fewer irreducibles, and although they can be classified they are very poorly understood. For example, even their [[dimension (vector space)|dimension]]s are not known in general.
| |
| | |
| The determination of the irreducible modules for the symmetric group over an arbitrary field is widely regarded as one of the most important open problems in representation theory.
| |
| | |
| == See also ==
| |
| * [[History of group theory]]
| |
| * [[Symmetric inverse semigroup]]
| |
| * [[Signed symmetric group]]
| |
| * [[Generalized symmetric group]]
| |
| | |
| == References ==
| |
| {{reflist}}
| |
| {{refbegin}}
| |
| * {{Citation | last1=Cameron | first1=Peter J. | title=Permutation Groups | publisher=[[Cambridge University Press]] | series=London Mathematical Society Student Texts | isbn=978-0-521-65378-7 | year=1999 | volume=45}}
| |
| * {{Citation | last1=Dixon | first1=John D. | last2=Mortimer | first2=Brian | title=Permutation groups | publisher=[[Springer-Verlag]] | location=Berlin, New York | series=Graduate Texts in Mathematics | isbn=978-0-387-94599-6 | mr=1409812 | year=1996 | volume=163}}
| |
| * {{Citation| last=Jacobson| first=Nathan| author-link=Nathan Jacobson| year=2009| title=Basic algebra| edition=2nd| volume = 1 | publisher=Dover| isbn = 978-0-486-47189-1}}.
| |
| * {{Citation | last1=Kaloujnine | first1=Léo | title=La structure des p-groupes de Sylow des groupes symétriques finis | url=http://www.numdam.org/item?id=ASENS_1948_3_65__239_0 | mr=0028834 | year=1948 | journal=Annales Scientifiques de l'École Normale Supérieure. Troisième Série | issn=0012-9593 | volume=65 | pages=239–276}}
| |
| *{{Citation | last1=Kerber | first1=Adalbert | title=Representations of permutation groups. I | publisher=[[Springer-Verlag]] | location=Berlin, New York | series=Lecture Notes in Mathematics, Vol. 240 | doi=10.1007/BFb0067943 | mr=0325752 | year=1971 | volume=240 | isbn=978-3-540-05693-5}}
| |
| * {{Citation | first1=M.W. | last1=Liebeck | first2=C.E. | last2=Praeger | first3=J. | last3=Saxl | title=On the O'Nan-Scott theorem for finite primitive permutation groups | journal=J. Austral. Math. Soc. | volume=44 | year=1988 | pages=389–396 | doi=10.1017/S144678870003216X | issue=3 }}
| |
| * {{Citation | title=Homology of the Infinite Symmetric Group | first=Minoru | last=Nakaoka | journal=[[The Annals of Mathematics]] | series=2 | volume=73 | number=2 |date=March 1961 | pages=229–257 | jstor=1970333 | doi=10.2307/1970333 | publisher=Annals of Mathematics }}
| |
| * {{Citation | last1=Netto | first1=E. | author1-link=Eugen Netto | title=Substitutionentheorie und ihre Anwendungen auf die Algebra | publisher=Leipzig. Teubner | language=German | jfm=14.0090.01 | year=1882}}
| |
| * {{Citation | last1=Scott | first1=W.R. | title=Group Theory | publisher=[[Dover Publications]] | location=New York | isbn=978-0-486-65377-8 | year=1987 | pages=45–46}}
| |
| *{{citation | first=Issai | last=Schur | authorlink=Issai Schur | title=Über die Darstellung der symmetrischen und der alternierenden Gruppe durch gebrochene lineare Substitutionen | journal=[[Journal für die reine und angewandte Mathematik]] | volume=139 | year=1911 | pages=155–250 |doi=10.1515/crll.1911.139.155 }}
| |
| * {{Citation | author2-link=Stanislaw Ulam | last1=Schreier | first1=J. | last2=Ulam | first2=Stanislaw | title=Über die Automorphismen der Permutationsgruppe der natürlichen Zahlenfolge | url=http://matwbn.icm.edu.pl/ksiazki/fm/fm28/fm28128.pdf | language=German | zbl=0016.20301 | year=1936 | journal=Fundam. Math. | volume=28 | pages=258–260}}
| |
| {{refend}}
| |
| | |
| == External links==
| |
| * {{springer|title=Symmetric group|id=p/s091670}}
| |
| * {{mathworld | urlname = SymmetricGroup | title = Symmetric group }}
| |
| * {{mathworld | urlname = SymmetricGroupGraph | title = Symmetric group graph }}
| |
| *[http://www.ted.com/talks/marcus_du_sautoy_symmetry_reality_s_riddle.html Marcus du Sautoy: Symmetry, reality's riddle] (video of a talk)
| |
| * [[OEIS]] [http://oeis.org/search?q=Symmetric+Group Entries dealing with the Symmetric Group]
| |
| | |
| {{DEFAULTSORT:Symmetric Group}}
| |
| [[Category:Permutation groups]]
| |
| [[Category:Symmetry]]
| |
| [[Category:Finite reflection groups]]
| |