Signature of a permutation

In Mathematical, the Permutation S can break up into a product of Transposition S, i.e. in a succession of exchanges of elements two to two.

  • a even permutation is a permutation which can be expressed like the product of an even number of transpositions;

  • a odd permutation is a permutation which can be expressed like the product of an odd number of transpositions.

The signature of a permutation is worth 1 if this one is even, -1 if it is odd. The signature application constitutes a morphism of groups. It intervenes in Multilinear algebra, in particular for the calculation of the determining.

Definition of the signature

That is to say a permutation \ sigma. The traditional definition of the parity of \ sigma is done by the counting of the inversions.

; Definition

I two distinct elements ranging between 1 and N are . It is said that the pair {I, J} is in inversion for \ sigma when \ sigma (I) > \ sigma (J) .

A permutation is known as even when it presents an even number of inversions, odd if not.

; Example

Is the permutation
\ begin {pmatrix} 1&2&3&4&5 \ \ 1&3&5&4&2 \ end {pmatrix}
the pair {1,2} is not in inversion since the images of 1 and 2 are arranged in the same order: 1 and 3. The list of the pairs in inversion is {2,5}, {3,4}, {3,5}, {4,5}. There are four of them, therefore the permutation is even.

By definition, the signature of an even permutation is 1, that of an odd permutation is -1.

A transposition is odd

All Transposition is an odd permutation. Indeed by noting I and J , i, the terms exchanged by the transposition, this one is written

\ begin {pmatrix} 1& \ dots&i-1&i&i+1& \ dowries &j-1&j&j+1& \ dowries \; N \ \
1& \ dowries & i-1&j&i+1& \ dowries &j-1&i&j+1& \ dowries \; N \ end {pmatrix}

The pairs in inversion are the pairs of the form {I, K} with K ranging between i+1 and J and those of the form {K, J} with K ranging between i+1 and j-1 . On the whole, there is an odd number of inversions, and the disparity of the permutation results from this.

A formula for the signature

One notes {\ mathcal P} the whole of the Paire S of elements ranging between 1 and N (there is N (n-1) of it /2 ). A permutation σ has as a signature

\ varepsilon (\ sigma) = \ prod \ limits_ {i

\ prod \ limits_ {\ {I, J \} \ in {\ mathcal P}} \ frac {\ sigma (I) - \ sigma (J)}{i-j}

Démonstration

Let us call P this product. To examine all the couples (I, J) with i amounts examining all the pairs {I, J} . For each one of them, the term which is in the product has a negative sign if the pair is in inversion, positive if not. This shows that the sign of P is well that of the signature. Lastly, by bijectivity of σ, the terms σ (I) - σ (J) of the numerator is, except for the sign, the same ones as the i-j of the denominator. This shows that the absolute value of P is worth 1 and makes it possible to conclude.

This formula has a certain algebraic interest but in practice does not allow an effective calculation of the signature. Indeed compared to the simple counting of the inversions is added the multiplication and division by a certain number of entireties.

Signature of a product

The permutations check a rule of the signs for the product: the product of two even permutations is even, of two odd permutations is even, the product of an even permutation and of odd is odd. By using the signature, that is summarized by the formula

\ varepsilon (\ sigma \ circ \ tau) = \ varepsilon (\ sigma). \ varepsilon (\ tau)

Demonstration

\ varepsilon (\ sigma \ circ \ tau) = \ prod \ limits_ {\ {I, J \} \ in {\ mathcal P}} \ frac {\ sigma (\ tau (I))- \ sigma (\ tau (J))}{\ tau (I) - \ tau (J)}
\ prod \ limits_ {\ {I, J \} \ in {\ mathcal P}} \ frac {\ tau (I) - \ tau (J)}{i-j}
In the second term one recognizes a signature directly. For the first, one needs réindexer as a preliminary by posing {i', I} = {τ (I), τ (J)} , one then recognizes also a signature there.

In algebraic terms: the signature is a morphism of group S of the symmetrical Groupe (\ mathfrak S_n, \ circ) in \ left (\ {- 1,1 \}, \ times \ right) . The whole of the even permutations forms the alternate Groupe, core of this morphism. Finally the permutation reverses σ with the same signature as σ.

Calculation of a signature

In corollary of the preceding results,

  • a permutation is even if and only if it can be expressed like the product of an even number of transpositions;
  • a permutation is odd if and only if it can be expressed like the product of an odd number of transpositions
and these two cases are excluded mutually.

The calculation of the signature by the decomposition in product of transpositions is much more effective than the application of the initial definition; indeed for a permutation of {\ mathfrak S} _n this decomposition requires of the more n-1 operations, against N (n-1) /2 for the definition.

; Examples

the identity is an even permutation;
a transposition is an odd permutation;
a circular Shift is even if the number of elements is odd; it is odd if the number of elements is even.

See too

  • symmetrical Permutation

  • Group

Random links:Riviera studios | The Pian-on-Garonne | Aaron-Abior | Ron Stewart | Georgetown (Saint-Vincent-and them Grenadian) | Liste_de_matières_de_bruit