Math 2.0

statement proposition

Sign of a cycle

Statement

Let k≥1k \geq 1 and let σ\sigma be a kk-cycle in SnS_n. Then sgn⁡(σ)=(−1)k−1\operatorname{sgn}(\sigma) = (-1)^{k-1}.

Remarks

A kk-cycle is a product of k−1k - 1 transpositions, which gives the formula. Thus a cycle is an even permutation exactly when its length is odd. With the disjoint cycle decomposition, the sign of σ∈Sn\sigma \in S_n is (−1)n−c(-1)^{n - c}, where cc is the number of cycles, with the fixed points counted as 11-cycles.

Explanations

L1 human

A cycle of length kk is a chain of k−1k - 1 swaps. So a 33-cycle is even and a transposition is odd. The length and the parity of a cycle are opposite.

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 9 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. Symmetric group definition
  4. Disjoint cycles commute statement
  5. Transposition definition
  6. Decomposition of a permutation into disjoint cycles statement
  7. Decomposition of a permutation into transpositions statement
  8. Sign of a permutation definition
  9. Sign of a cycle statement

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Parity_of_a_permutation, Properties
  2. Web https://en.wikipedia.org/wiki/Cyclic_permutation, Basic properties