XIV

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/evenness) of a permutation ${\displaystyle \sigma }$ of X can be, defined as the parity of the number of inversions for σ, i.e., of pairs of elements x, y of X such that x < y and σ(x) > σ(y).

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 S_n. 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

sgn(σ) = (−1)

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

sgn(σ) = (−1)

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.

Example※

Consider the permutation σ of the set {1, 2, 3, 4, 5} defined by ${\displaystyle \sigma (1)=3,}$ ${\displaystyle \sigma (2)=4,}$ ${\displaystyle \sigma (3)=5,}$ ${\displaystyle \sigma (4)=2,}$ and ${\displaystyle \sigma (5)=1.}$ In one-line notation, this permutation is denoted 34521. It can be obtained from the identity permutation 12345 by three transpositions: first exchange the numbers 2 and "4," then exchange 3 and 5. And finally exchange 1 and 3. This shows that the given permutation σ is odd. Following the method of the cycle notation article, "this could be written," composing from right to left, as

${\displaystyle \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}}.}$

There are many other ways of writing σ as a composition of transpositions, for instance

σ = (1 5)(3 4)(2 4)(1 2)(2 3),

but it is impossible to write it as a product of an even number of transpositions.

Properties※

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:

• the composition of two even permutations is even
• the composition of two odd permutations is even
• the composition of an odd and an even permutation is odd

From these it follows that

• the inverse of every even permutation is even
• the inverse of every odd permutation is odd

Considering the symmetric group S_n of all permutations of the set {1, ..., n}, we can conclude that the map

sgn: S_n → {−1, 1} 

that assigns to every permutation its signature is a group homomorphism.

Furthermore, we see that the even permutations form a subgroup of S_n. This is the alternating group on n letters, denoted by A_n. It is the kernel of the homomorphism sgn. The odd permutations cannot form a subgroup, since the composite of two odd permutations is even. But they form a coset of A_n (in S_n).

If n > 1, then there are just as many even permutations in S_n as there are odd ones; consequently, A_n contains n!/2 permutations. (The reason is that if σ is even then (1  2)σ is odd, and if σ is odd then (1  2)σ 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

${\displaystyle (a\ b\ c\ d\ e)=(d\ e)(c\ e)(b\ e)(a\ e){\text{ or }}(a\ b)(b\ c)(c\ d)(d\ e).}$

In practice, in order to determine whether a given permutation is even or odd, one writes the permutation as a product of disjoint cycles. The permutation is odd if and only if this factorization contains an odd number of even-length cycles.

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 (1 2)(3 4) in A₄ shows that the converse is not true in general.

Equivalence of the two definitions※

This section presents proofs that the parity of a permutation σ can be defined in two equivalent ways:

• as the parity of the number of inversions in σ (under any ordering); or
• as the parity of the number of transpositions that σ can be decomposed to (however we choose to decompose it).

Proof 3

A third approach uses the presentation of the group S_n in terms of generators τ₁, ..., τ_n−1 and relations

• ${\displaystyle \tau _{i}^{2}=1}$  for all i
• ${\displaystyle \tau _{i}^{}\tau _{i+1}\tau _{i}=\tau _{i+1}\tau _{i}\tau _{i+1}}$   for all i < n − 1
• ${\displaystyle \tau _{i}^{}\tau _{j}=\tau _{j}\tau _{i}}$   if ${\displaystyle |i-j|\geq 2.}$

[Here the generator ${\displaystyle \tau _{i}}$ represents the transposition (i, i + 1).] All relations keep the length of a word the same or change it by two. Starting with an even-length word will thus always result in an even-length word after using the relations, and similarly for odd-length words. It is therefore unambiguous to call the elements of S_n represented by even-length words "even", and the elements represented by odd-length words "odd".

Proof 5

Consider the elements that are sandwiched by the two elements of a transposition. Each one lies completely above, completely below. Or in between the two transposition elements.

An element that is either completely above or completely below contributes nothing to the inversion count when the transposition is applied. Elements in-between contribute ${\displaystyle 2}$.

As the transposition itself supplies ${\displaystyle \pm 1}$ inversion, and all others supply 0 (mod 2) inversions, a transposition changes the parity of the number of inversions.

Other definitions and proofs※

The parity of a permutation of ${\displaystyle n}$ points is also encoded in its cycle structure.

Let σ = (i₁ i₂ ... i_r+1)(j₁ j₂ ... j_s+1)...(ℓ₁ ℓ₂ ... ℓ_u+1) be the unique decomposition of σ into disjoint cycles, which can be composed in any order. Because they commute. A cycle (a b c ... x y z) involving k + 1 points can always be obtained by composing k transpositions (2-cycles):

${\displaystyle (a\ b\ c\dots x\ y\ z)=(a\ b)(b\ c)\dots (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 k₁ + k₂ + ... + k_m transpositions, where k_i is the size of the ith cycle. The number N(σ) = k₁ + k₂ + ... + k_m is called the discriminant of σ, and can also be computed as

${\displaystyle n{\text{ minus the number of disjoint cycles in the decomposition of }}\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

${\displaystyle (a\ b)(a\ c_{1}\ c_{2}\dots c_{r})(b\ d_{1}\ d_{2}\dots d_{s})=(a\ c_{1}\ c_{2}\dots c_{r}\ b\ d_{1}\ d_{2}\dots d_{s})}$,

and if a and b are in the same cycle of σ then

${\displaystyle (a\ b)(ac_{1}c_{2}\dots c_{r}\ b\ d_{1}\ d_{2}\dots d_{s})=(a\ c_{1}\ c_{2}\dots c_{r})(b\ d_{1}\ d_{2}\dots d_{s})}$.

In either case, it can be seen that N((a b)σ) = N(σ) ± 1, so the parity of N((a b)σ) will be different from the parity of N(σ).

If σ = t₁t₂ ... t_r is an arbitrary decomposition of a permutation σ into transpositions, by applying the r transpositions ${\displaystyle t_{1}}$ after t₂ after ... after t_r after the identity (whose N is zero) observe that N(σ) and r have the same parity. By defining the parity of σ as the parity of N(σ), a permutation that has an even length decomposition is an even permutation and a permutation that has one odd length decomposition is an odd permutation.

Remarks

• A careful examination of the above argument shows that r ≥ N(σ), and since any decomposition of σ into cycles whose sizes sum to r can be expressed as a composition of r transpositions, the number N(σ) is the minimum possible sum of the sizes of the cycles in a decomposition of σ, including the cases in which all cycles are transpositions.
• This proof does not introduce a (possibly arbitrary) order into the set of points on which σ acts.

Generalizations※

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 v ↦ (−1) gives a generalized sign map.

See also※

• The fifteen puzzle is a classic application
• Zolotarev's lemma

Notes※

References※

• Weisstein, Eric W. "Even Permutation". MathWorld.
• Jacobson, Nathan (2009). Basic algebra. Vol. 1 (2nd ed.). Dover. ISBN 978-0-486-47189-1.
• Rotman, J.J. (1995). An introduction to the theory of groups. Graduate texts in mathematics. Springer-Verlag. ISBN 978-0-387-94285-8.
• Goodman, Frederick M. Algebra: Abstract and Concrete. ISBN 978-0-9799142-0-1.
• Meijer, Paul Herman Ernst; Bauer, Edmond (2004). Group theory: the application to quantum mechanics. Dover classics of science and mathematics. Dover Publications. ISBN 978-0-486-43798-9.