Jump to content

Permutation/Cycle/Definition

From Wikiversity
Cycle

Let M be a finite set and let π be a permutation on M. Then π is called a cycle of order r (or of length r), if there exists a subset Z⊆M, containing r elements and such that π is on M∖Z the identity and such that π commutes the elements of Z in a cyclic way. If Z={z,π(z),π2(z),…,πr−1(z)}, then we write

π=⟨z,π(z),π2(z),…,πr−1(z)⟩.