Permutation is disjoint cycle product

Dependencies:

1. Permutation group

Every permutation can be written as the product of disjoint cycles.

Proof

(To be done)

Dependency for:

1. Permutation is transposition product
2. Canonical cycle notation of a permutation

Info:

• Depth: 3
• Number of transitive dependencies: 5

Transitive dependencies:

1. /sets-and-relations/relation-composition-is-associative
2. /sets-and-relations/composition-of-bijections-is-a-bijection
3. Group
4. Subgroup
5. Permutation group