Math 2.0

Group theory and generalizations Definition

Symmetric group

Builds on Group

Definition

Let XX be a set. The symmetric group Sym⁡(X)\operatorname{Sym}(X) is the set of all bijections σ ⁣:X→X\sigma \colon X \to X, with composition of maps as the operation. For a positive integer nn, the symmetric group SnS_n is Sym⁡({1,2,…,n})\operatorname{Sym}(\{1, 2, \dots, n\}). An element of SnS_n is a permutation of degree nn.

Remarks

The identity map is the identity element, and the inverse of σ\sigma is the inverse map σ−1\sigma^{-1}. In this node, the product στ\sigma \tau means first τ\tau, then σ\sigma. The group SnS_n is not abelian for n≥3n \geq 3, because (1 2)(2 3)≠(2 3)(1 2)(1\ 2)(2\ 3) \neq (2\ 3)(1\ 2). If XX and YY have the same cardinality, then Sym⁡(X)\operatorname{Sym}(X) and Sym⁡(Y)\operatorname{Sym}(Y) are isomorphic.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Group concept
  2. Symmetric group definition

Where this leads

82 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Symmetric_group, Definition and first properties
About this page