Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematical Object

Symmetric Group

Algebra

The symmetric group on a finite set is the group formed by every possible bijection, or permutation, of that set to itself, with the group operation being the composition of two permutations one after another. The symmetric group on n elements, written S sub n, has exactly n factorial elements, one for every possible ordering of the set, and it is abelian, meaning the order of composition does not matter, only when n is 2 or smaller. Cayley's theorem shows that every group whatsoever is isomorphic to some subgroup of a symmetric group, making the symmetric groups a kind of universal building block for all of group theory. The symmetric group is also central to Galois theory, invariant theory, the representation theory of Lie groups and combinatorics.

Facts
Classification
Object Kind
Structure or Algebraic Object 1
Connections

In Branch

Source Symmetric group (Wikipedia)

Is Kind Of Object

Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.

Sources
1. Wikipedia: Symmetric group
Definition and first properties section
Quote, Definition and first properties section
the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself
Symmetric group (Wikipedia)
In Branch: Algebra, Lead sentence
Quote, In Branch: Algebra, Lead sentence
In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to i
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.