AoPSWiki
Looking for a challenging algebra text? Preparing for MATHCOUNTS or the AMC exams?
Check out Art of Problem Solving's Introduction to Algebra by Richard Rusczyk.
Personal tools

Cycle

From AoPSWiki

A cycle is a type of permutation.

Let be the symmetric group on a set . Let be an element of , and let be the subgroup of generated by . Then is a cycle if has exactly one orbit (under the operation of ) which does not consist of a single element. This orbit is called the support of , and is sometimes denoted .

Some properties of cycles

Lemma. Let be a family of cycles of with pairwise disjoint supports . Then the commute. The product \sigma = \prod_{i\in I} \zeta_i is then well defined as , for , and , for . Let be the subgroup generated by . Then the function is a bijection from to the orbits of containing more than one element.

Proof. Suppose and are of the . Then \zeta_a \zeta_b(x) = \begin{cases} \zeta_a(x),& x \in S_a, \\\zeta_b (x), &x\in S_b , \\x, & x \notin S_a \cup S_b,\end{cases} so by symmetry \zeta_a\zeta_b = \zeta_b \zeta_a. This proves that the commute and justifies the definition of .

Suppose is a an orbit of with more than one element, and suppose . Then by our characterization of , must belong to , for some ; since is the orbit of , it follows that . Thus the mapping is a surjection from to the orbits of with more than one element; since it is evidently injective, it follows that this mapping is a bijection.

Theorem (cycle notation). Let be an element of . Then there exists a unique set of cycles of with pairwise disjoint supports such that \sigma = \prod_{\zeta \in C} \zeta.

Proof. Let be the subgroup of generated by . Let be the family of nonempty orbits of . For all , let be the restriction of to ; let C = \bigcup_{i\in I} \{\zeta_i\}. Then by the lemma, \sigma = \prod_{\zeta \in C} \zeta. Since the mapping must be a bijection from to the orbits of , it follows from the lemma that is unique.

See also

USA Mathematical Talent Search
2008-09 Round 1 Problems now available!
Visit www.usamts.org
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us