Scribd
Upload
122 views16 pages

Cyclic Permutation - Dec9 - Lens

This document discusses cyclic groups and cyclic permutations. It defines a cyclic group as a group that can be generated by a single element. It also defines a cyclic permutation as a permutation that can be expressed as a product of disjoint cycles. The document provides examples of writing permutations in cycle notation and discusses how permutations can be expressed as products of disjoint cycles. It also notes that the order of disjoint cycles does not matter and discusses how to identify if two permutations are the same based on their cycle notation.

Uploaded by

Magda Frutas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
122 views16 pages

Cyclic Permutation - Dec9 - Lens

This document discusses cyclic groups and cyclic permutations. It defines a cyclic group as a group that can be generated by a single element. It also defines a cyclic permutation as a permutation that can be expressed as a product of disjoint cycles. The document provides examples of writing permutations in cycle notation and discusses how permutations can be expressed as products of disjoint cycles. It also notes that the order of disjoint cycles does not matter and discusses how to identify if two permutations are the same based on their cycle notation.

Uploaded by

Magda Frutas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
You are on page 1/ 16

Abstract

Algebra
Cyclic Permutation
Lagrange Theorem
Magda L. Frutas, DME
Cagayan State University, Andrews Campus
Cyclic Group
DEFINITION: A group G is cyclic if it can be generated by
one element.
A cyclic group is a group that can be “generated” by
combining a single element of the group multiple times.
A cyclic group with n elements is commonly named Cn.

Is the set of symmetries of a square a cyclic group?


Cyclic Permutation
• Definition: A permutation of ∝ of a finite set A is a cycle of
length k if ∃ distinct elements a1, a2,…,an such that
∝(a1) = a2
For any a ∈ A other
∝(a2) = a3 than a1, a2, …, ak
∝(a1) = a2 ∝(a) = a

∝(ak-1) = ak
∝(ak) = a1

The cycle is then defined as


Cycle Notation
• There is a more compact way to write permutations.
This notation is due to Augustin Cauchy.
The permutation
12345678
35247816
is ( 1,3,2,5,7) (6,8), but cycles of length 1 are
They are often dropped from the cycle
notation. Therefore, the above permutation can be
written as
Example: Write the following permutations in
cycle notation
a.

Solution:

Reminder:
1-cycles are usually
omitted.
Example: Write the following permutations in
cycle notation
b.

Solution:
A cycle of length two is called a transposition.
Thus the cycle (1,3) is a transposition. It is 2-cyclic such
that the image of 1 is 3 and the image of 3 is 1 and the
remaining missing elements are invariant.

1 3
Note: Missing elements are mapped to themselves.
Definition: When two cycles have no elements in common,
they are said to be disjoint.

Theorem: Every permutation can be expressed as cycle or


a product of disjoint cycles

The permutation below can be expressed as

= (1, 2) (3, 4, 6)

Note: (1, 2) (3, 4, 6) is the same as (3, 4, 6) (1, 2).

When a permutation is decomposed into cycles, the order of the


cycles does not matter.
Express the given permutation in cycle
notation
12345
13542
•Answers:
•a. ( 2,3,5)
•b. ( 3,5,2)
•c. (5,2,3)
Express the given permutation in cycle
notation
1234
3412
•Answers:
All of the following indicate exactly
the same permutation:

Since there are so many possible ways to label a particular


permutation, if there is no convention about the labeling, it
may be difficult to tell if two permutations are the same or
different as the example above illustrates.
Guide:
1. Begin with the smallest element. If it is moved, list
the permutation beginning with that smallest
element as the first entry in the cycle.
2. After listing the complete cycle, check to see if
there are other elements moved by the
permutation that do not appear in the cycle. If so,
choose the smallest remaining, and repeat the
process until all moved elements are listed.
Exercises:
1. Write the permutation (1, 3) (2, 7) (4, 5, 6) (8) in array form.
Answer:

2.
Write 𝛼 and 𝛽 in cycle notation. Then, write 𝛼𝛽 in cycle notation
Answer:
Exercises:
3. Write the permutation as a
product of disjoint cycles.
Answer:

4. Write in array notation.


Answer:

5. Write in array notation


Answer:
6 . Find ab
Answer:
Assignment: Find ab and ba
1.

2.

3.
Important Notes:
• Cycles with no numbers in common could be
rearranged ( they commute with each other).
• Cycles with common numbers may not
commute

You might also like