# Permutation group

Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
In mathematical group theory, the set of permutations on a set of objects form a group, is called a permutation group, with composition as the group operation. For example, let ${\displaystyle A}$ denote a finite set of ${\displaystyle n}$ distinct objects, and let ${\displaystyle S_{A}}$ denote the set of permutations of the elements of ${\displaystyle A}$. The criteria of associativity and the existence of inverses are obvious from the definition of permutations as bijections from ${\displaystyle A}$ to itself. The existence of an identity is slightly more difficult to establish, but we can define an identity mapping ${\displaystyle i(a)=a,\forall a\in A}$, and it is clear that this mapping is both a permutation and an identity.[1]
Since all permutation groups over sets with the same number of elements are isomorphic, and since abstract algebra is generally only concerned with groups, rings, fields et cetera up to isomorphism, the generic permutation group over ${\displaystyle n}$ elements is simply denoted ${\displaystyle S_{n}}$.