


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The concept of permutations, focusing on cycles and their composition. It provides examples and exercises to help understand the properties of permutations and how they can be represented as cycles. Students of mathematics, particularly those studying algebra or combinatorics, will find this document useful for gaining a deeper understanding of permutations.
Typology: Study notes
1 / 4
This page cannot be seen from the preview
Don't miss anything!



If S is a finite set, then a permutation of S is a function f:S → S that has the following two properties:
f (5) = 3, f (6) = 1, f (7) = 2, then (1 6), (5 3 7 2), and (4) are cycles of f, as are (6 1) and (3 7 2 5). However, since cycles are, by their definition, cyclically ordered it follows that (1 6) = (6 1) and (5 3 7 2) = ( 3 7 2 5) = (7 2 5 3) = ( 2 5 3 7). Hence (1 6), (5 3 7 2), and (4) are the complete set of cycles of f and we write f = (1 6)(5 3 7 2)(4). The order of the cycles is immaterial. Thus, f = (1 6)(5 3 7 2)(4) = (5 3 7 2)(4)(1 6) = (4)(1 6)(5 3 7 2) = (3 7 2 5)(4)(6 1) = ….
c , f (4) = 8, f (5) = 9, f (6) = 7, f (7) = 3, f (8) = 4, f (9) = 6, f ( a ) = 2, f ( b ) = b , f ( c ) = 5, then f = (2 1 a )(7 3 c 5 9 6)(4 8)( b ). If f and g are permutations of the same set S , then the composition f+g is also a permutation of S such that
Rewrite the functions of exercises 1-5 in terms of their cycles.