In mathematics, when X is a finite set with at least two elements, the permutations of X (i.e. the bijective functions from X to X) fall into two classes of equal size: the even permutations and the odd permutations. If any total ordering of X is fixed, the parity (oddness or evenness) of a permutation
\sigma
The sign, signature, or signum of a permutation σ is denoted sgn(σ) and defined as +1 if σ is even and -1 if σ is odd. The signature defines the alternating character of the symmetric group Sn. Another notation for the sign of a permutation is given by the more general Levi-Civita symbol (εσ), which is defined for all maps from X to X, and has value zero for non-bijective maps.
The sign of a permutation can be explicitly expressed as
where N(σ) is the number of inversions in σ.
Alternatively, the sign of a permutation σ can be defined from its decomposition into the product of transpositions as
where m is the number of transpositions in the decomposition. Although such a decomposition is not unique, the parity of the number of transpositions in all decompositions is the same, implying that the sign of a permutation is well-defined.[1]
Consider the permutation σ of the set defined by
\sigma(1)=3,
\sigma(2)=4,
\sigma(3)=5,
\sigma(4)=2,
\sigma(5)=1.
\sigma=\begin{pmatrix}1&2&3&4&5\\ 3&4&5&2&1\end{pmatrix}=\begin{pmatrix}1&3&5\end{pmatrix}\begin{pmatrix}2&4\end{pmatrix}=\begin{pmatrix}1&3\end{pmatrix}\begin{pmatrix}3&5\end{pmatrix}\begin{pmatrix}2&4\end{pmatrix}.
,but it is impossible to write it as a product of an even number of transpositions.
The identity permutation is an even permutation. An even permutation can be obtained as the composition of an even number (and only an even number) of exchanges (called transpositions) of two elements, while an odd permutation can be obtained by (only) an odd number of transpositions.
The following rules follow directly from the corresponding rules about addition of integers:
From these it follows that
Considering the symmetric group Sn of all permutations of the set, we can conclude that the map
that assigns to every permutation its signature is a group homomorphism.[2]
Furthermore, we see that the even permutations form a subgroup of Sn. This is the alternating group on n letters, denoted by An.[3] It is the kernel of the homomorphism sgn.[4] The odd permutations cannot form a subgroup, since the composite of two odd permutations is even, but they form a coset of An (in Sn).[5]
If, then there are just as many even permutations in Sn as there are odd ones; consequently, An contains n!/2 permutations. (The reason is that if σ is even then is odd, and if σ is odd then is even, and these two maps are inverse to each other.)
A cycle is even if and only if its length is odd. This follows from formulas like
(a b c d e)=(d e)(c e)(b e)(a e)or(a b)(b c)(c d)(d e).
Another method for determining whether a given permutation is even or odd is to construct the corresponding permutation matrix and compute its determinant. The value of the determinant is the same as the parity of the permutation.
Every permutation of odd order must be even. The permutation in A4 shows that the converse is not true in general.
This section presents proofs that the parity of a permutation σ can be defined in two equivalent ways:
The parity of a permutation of
n
Let σ = (i1 i2 ... ir+1)(j1 j2 ... js+1)...(ℓ1 ℓ2 ... ℓu+1) be the unique decomposition of σ into disjoint cycles, which can be composed in any order because they commute. A cycle involving points can always be obtained by composing k transpositions (2-cycles):
(a b c...x y z)=(a b)(b c)...(x y)(y z),
so call k the size of the cycle, and observe that, under this definition, transpositions are cycles of size 1. From a decomposition into m disjoint cycles we can obtain a decomposition of σ into transpositions, where ki is the size of the ith cycle. The number is called the discriminant of σ, and can also be computed as
nminusthenumberofdisjointcyclesinthedecompositionof\sigma
if we take care to include the fixed points of σ as 1-cycles.
Suppose a transposition (a b) is applied after a permutation σ. When a and b are in different cycles of σ then
(a b)(a c1 c2...cr)(b d1 d2...ds)=(a c1 c2...cr b d1 d2...ds)
and if a and b are in the same cycle of σ then
(a b)(ac1c2...cr b d1 d2...ds)=(a c1 c2...cr)(b d1 d2...ds)
In either case, it can be seen that, so the parity of N((a b)σ) will be different from the parity of N(σ).
If is an arbitrary decomposition of a permutation σ into transpositions, by applying the r transpositions
t1
Parity can be generalized to Coxeter groups: one defines a length function ℓ(v), which depends on a choice of generators (for the symmetric group, adjacent transpositions), and then the function gives a generalized sign map.