Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
29 views5 pages

Permutation Groups

This document provides an overview of permutation groups in abstract algebra, defining permutations, symmetric groups, and various notations used to represent them. It explains that a permutation is a rearrangement of a set's elements and introduces the symmetric group as the collection of all permutations of n elements. Additionally, it includes examples, exercises, and assessments to reinforce understanding of the concepts presented.

Uploaded by

hilarioelmatthew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
29 views5 pages

Permutation Groups

This document provides an overview of permutation groups in abstract algebra, defining permutations, symmetric groups, and various notations used to represent them. It explains that a permutation is a rearrangement of a set's elements and introduces the symmetric group as the collection of all permutations of n elements. Additionally, it includes examples, exercises, and assessments to reinforce understanding of the concepts presented.

Uploaded by

hilarioelmatthew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Permutation Groups

Learning Objectives
By the end of this module, learners should be able to:
a. define permutations and permutation groups;
b. define symmetric group; and
c. present permutations using different notations.

Abstraction
In mathematics, especially in abstract algebra, permutation groups play a central
role in understanding the structure of sets under rearrangement. A permutation is
simply a rearrangement of elements in a set. When we consider all the possible
permutations of a set and how they combine, we obtain a permutation group.

Permutation Group
A permutation of a set is a bijective (one-to-one and onto) mapping of the set to
itself. In simple term, it is a collection of ways to rearrange the element of a set, where
combining two arrangements results in another valid arrangement.

For example:
1. A permutation of the set {1, 2, 3} might be {2, 3, 1}
2. Permutation of the set {2, 4, 6, 8} can be {8, 6, 4, 2}

3. A= (2 , 3 , 1, 4 )
1 , 2 ,3 , 4
(
B= 1 ,2 , 3 , 4
3 , 2, 4 , 1 )
(
Permutation AB= 1 , 2 ,3 , 4
2 , 4 ,3 , 1 )
Try This!

(
A= 2 , 4 ,6 ,8 , 9
6 , 4 , 9 , 2 ,8 ) (
B= 2 , 4 , 6 , 8 , 9
4 , 8 ,9 , 2 , 6 )
Symmetric Group
The set of all permutation of n elements forms a group under composition, called
the symmetric group, denoted by Sn . The number of element in a symmetric group |
Sn∨¿ is n! (n factorial), which represents the total number of ways to arrange n distinct
objects.

For example: For the set {1, 2, 3}, or S3 (3! = 6 permutations)


Permutations:
 {1, 2, 3} the original order
 {1, 2} swap 1 and 2
 {1, 3} swap 1 and 3
 {2, 3} swap 2 and 3
 {3, 1, 2} move 3 to the front
 {3, 2, 1} reverse the entire order

Try This!
Find Sn and list all the possible set given the set of :{2, 4, 6}
Answer: {2, 4, 6} {2, 4} {2, 6} {6, 4} {6, 2, 4} {6, 4, 2}

Notation
In permutation groups, notations are used to concisely represent permutations,
which are bijective functions mapping a set to its self Common notations include two-line
notation and cycle notation.

Two-Line Notation- Lists the elements of the set in the first row and their images under
the permutation in the second row.

For example:

(
σ = 1, 2 , 3
3 ,1 , 2)
This means that the permutation are:
σ (1)=3 , σ (2)=1 ,∧σ (3)=2

Cycle Notation
This notation decomposes a permutation into disjoint cycles. A cycle is a
sequence of elements where the permutation maps each element to the next in the
sequence, and the last element in the sequence is mapped back to the first.
For example:
1. σ=(1 , 3 ,2)
This means:
1 →3
3 →2
2 →1

(
σ = 1, 3 , 2
3 ,2 , 1 )
2. σ = ( 1,3 ,12 ,, 32 ,, 44)
σ =(1 , 3 , 2)(4)

Try This!

( 41,,32,,23,,14)
Find the cycle notation and two-line notation for this set: σ =

Assessment
Choose the best answer for each question.

1. What is a permutation?
a. A group of integers
b. A subset of elements
c. A rearrangement of elements in a set
d. An arrangement in alphabetical order

2. Which of the following best describes a permutation group?


a. A collection of sets
b. A bijective function from one set to another
c. All the subsets of a set
d. The set of all permutations of a set, closed under composition

3. How many permutations are in the symmetric group S4 ?


a. 4
b. 12
c. 16
d. 24

4. In cycle notation, what does (1 3 2) mean?


a. 1 maps to 3, 3 maps to 2, and 2 maps to 1
b. 1 maps to 2, 2 maps to 3, 3 maps to 1
c. 1 maps to 3, 3 maps to 1, 2 is fixed
d. All elements are fixed

5. Which of the following is NOT a correct representation of a permutation?


a. Two-line notation
b. Cycle notation
c. Matrix form
d. Word notation

6-10. Using this set:

(
σ = (1 , 2, 3 , 4 ,5 , 6)
3 , 5 ,2 , 6 , 1 , 4 )
Find the two-line notation and cycle notation.

Answer Key
1. C.
2. D.
3. D.
4. A.
5. D.
6-10.
Two-line Notation
σ ( 1 )=3
σ ( 2 ) =5
σ ( 3 )=2
σ ( 4 ) =6
σ ( 5 ) =1
σ ( 6 )=4

Cycle Notation
σ =(1 , 3 , 2 ,5)(4 , 6)

You might also like