Permutation group

From Citizendium, the Citizens' Compendium
Jump to: navigation, search
This article is a stub and thus not approved.
Main Article
Talk
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and not meant to be cited; by editing it you can help to improve it towards a future approved, citable version. These unapproved articles are subject to a disclaimer.

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 denote a finite set of distinct objects, and let denote the set of permutations of the elements of . The criteria of associativity and the existence of inverses are obvious from the definition of permutations as bijections from to itself. The existence of an identity is slightly more difficult to establish, but we can define an identity mapping , 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 elements is simply denoted .

A symmetry group is in general a subgroup of the permutation group over the number of vertices in the figure in question, since all affine transformations of a figure are permutations of its vertices, although the converse does not in general hold.

References

  1. Fraleigh J B (2003) A First Course in Abstract Algebra ISBN 0321156080, section 8