AI ALIGNMENT FORUM
AF

816
Wikitags

The collection of even-signed permutations is a group

Edited by Patrick Stevens last updated 17th Jun 2016
Requires: Symmetric group, Transposition (as an element of a symmetric group), The sign of a permutation is well-defined

The collection of elements of the symmetric group Sn which are made by multiplying together an even number of permutations forms a subgroup of Sn.

This proves that the alternating_group An is well-defined, if it is given as "the subgroup of Sn containing precisely that which is made by multiplying together an even number of transpositions".

Proof

Firstly we must check that "I can only be made by multiplying together an even number of transpositions" is a well-defined notion; this is in fact true.

We must check the group axioms.

  • Identity: the identity is simply the product of no transpositions, and 0 is even.
  • Associativity is inherited from Sn.
  • Closure: if we multiply together an even number of transpositions, and then a further even number of transpositions, we obtain an even number of transpositions.
  • Inverses: if σ is made of an even number of transpositions, say τ1τ2…τm, then its inverse is τmτm−1…τ1, since a transposition is its own inverse.
Parents:
Alternating group
Discussion
Discussion