Math 2.0

statement theorem

Sign is a homomorphism

Statement

Let n≥2n \geq 2. The map sgn⁡ ⁣:Sn→{1,−1}\operatorname{sgn} \colon S_n \to \{1, -1\} is a surjective group homomorphism, where {1,−1}\{1, -1\} is a group under multiplication. That is, sgn⁡(στ)=sgn⁡(σ)sgn⁡(τ)\operatorname{sgn}(\sigma \tau) = \operatorname{sgn}(\sigma) \operatorname{sgn}(\tau) for all σ,τ∈Sn\sigma, \tau \in S_n.

Remarks

If σ\sigma is a product of mm transpositions and τ\tau is a product of ll transpositions, then στ\sigma \tau is a product of m+lm + l transpositions. The map is surjective because sgn⁡((1 2))=−1\operatorname{sgn}((1\ 2)) = -1. Its kernel is the alternating group AnA_n.

Explanations

L1 human

When you do two permutations one after the other, you join their chains of swaps. The number of swaps adds, so the signs multiply. This is exactly the rule of a homomorphism.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 10 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Cycle notation concept
  2. Group concept
  3. Group homomorphism definition
  4. Symmetric group definition
  5. Disjoint cycles commute statement
  6. Transposition definition
  7. Decomposition of a permutation into disjoint cycles statement
  8. Decomposition of a permutation into transpositions statement
  9. Sign of a permutation definition
  10. Sign is a homomorphism statement

What depends on this

7 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Parity_of_a_permutation, Properties