Scribd
Upload
201 views

Permutation Presentation

This document discusses permutations and related concepts in mathematics. It begins with an introduction to permutations as bijective functions on a set. It then discusses the group structure of permutations, with the symmetric group formed by all permutations of a set. It covers several types of permutations including identity, product, cyclic, and transposition permutations. It also defines even and odd permutations based on their parity or determinant. Finally, it introduces alternating groups as the subset of symmetric groups consisting of only even permutations.

Uploaded by

Huma Khan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
201 views

Permutation Presentation

This document discusses permutations and related concepts in mathematics. It begins with an introduction to permutations as bijective functions on a set. It then discusses the group structure of permutations, with the symmetric group formed by all permutations of a set. It covers several types of permutations including identity, product, cyclic, and transposition permutations. It also defines even and odd permutations based on their parity or determinant. Finally, it introduces alternating groups as the subset of symmetric groups consisting of only even permutations.

Uploaded by

Huma Khan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

PERMUTATION

PRESENTED TO: PROF. DR. NAWAZ


PRESENTED BY: M. MEHRAN ZAHID
REGISTRATION NO: S19-2046
DEPARTMENT OF MATHEMATICS, LAHORE LEADS UNIVERSITY
DEDICATION
To the treasures in my life: To my loving PARENTS, who are
the image of brilliance and faithfulness. Thank you for being the
sunshine in my cloudy days. Thank you for your sacrifice and example.
You are my inspiration. Together you instilled in me the desire to learn
and the passion to achieve.
CONTENTS
• What is Permutation?
• Group Structure of Permutation
• Types of Permutation
Identity Permutation
Product of Permutation
Cyclic Permutation
Transposition
Parity of Permutation
• Alternating Group
WHAT IS PERMUTATION?
• A permutation of a set X is a function σ : X X that is one-to-
one and onto, i.e., a bijective map.
Example:
Combining
GROUP STRUCTURE OF
PERMUTATION
• All permutation of a set X forms a group under composition, called the
Symmetric group on ‘n’ elements, denoted by S(n).

Composition of two
bijections is a bijection
• Every permutation has an inverse, the inverse permutation

Inverse of Permutation
is bijection

• Example:
IDENTITY PERMUTATION
• If each element of permutation is replaced by itself then it is known as
the identity permutation and is denoted by the symbol I.
• I=a b c
a b c is an identity permutation
PRODUCT OF PERMUTATION
• A permutation is one- one onto the map and hence it is invertible, i.e.
every permutation f on a set P ={ a1, a2, ..., an} has a unique inverse
permutation denoted by f^-1.
• Thus if
f = a1 a2 ......an
b1 b2 ......bn then

f^-1 = b1 b2 ......bn
a1 a2 ......an
CYCLIC PERMUTATION
• A permutation which replaces n objects cyclically is called cyclic
permutation of degree n.
• Consider the permutation p = 1 2 3 4 this assignment of 2 3 4 1 values
could be presented.
• The number of elements permuted by a cycle is said to be its length
and disjoint cycles are those which have no common elements. A
cycle of length 1 means that the image of an element is the element
itself and represents identity permutation
TRANSPOSITION
• A transposition (exchange) is a permutation that swaps two
elements and does not change the others.
• In cycle notation, a transposition has the form (i j).
Example: (1 2) on the set X={1,2,3,4}
In matrix notation, a transposition is an identity matrix, but for
for two rows that are swapped.

0100
1000
0010
0001
PARITY OF PERMUTATION
• Even Permutation
• Odd Permutation

A permutation is even if det(Pσ)=1 and odd if det(Pσ)=-1.

Sign(132)=(-1)^2=1
(Even Permutation)
ALTERNATING GROUPS
• The subset of Sn formed by even permutations is a group, called the
alternating group An.

• IF σ is a permutation with matrix Pσ, then its inverse


permutation has matrix PσT . Now det(PσPσT)=1 and since
det(Pσ)=1, we must have det(PσT)=1!
THANK YOU

You might also like