Let be a set. Let be the set of permutations of (i.e. the set of bijective functions on ). Then the act of taking the composition of two permutations induces a groupstructure on . We call this group the symmetric group and it is often denoted
.
When has a finite number of elements, we often refer to the symmetric group as , and describe the elements by using cycle notation.