Group theory and generalizations Group actions and permutation groups Concept
Permutation group
Summary
A permutation group is a subgroup of the symmetric group of a set, that is, a set of permutations closed under composition and inverses. Groups first arose as permutation groups, in the study of the roots of polynomial equations. By Cayley's theorem, every group is isomorphic to a permutation group. Every group action gives a permutation group, the image of the group in the symmetric group of the set.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | ZDJQRKPWGA |
|---|---|
| URI | m2://ZDJQRKPWGA |
| Kind | concept |
| Writing | W0 stub |
| MSC | 20B05, 20B07 |
| Specializes | Subgroup |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.