The Symmetric Group S_n is the permutation group consisting of all bijections of an n-element set, with group order n! and composition as the operation; it is the full automorphism group of a discrete n-point set.

Principle

All permutations of n labeled points are included; S_n is generated by transpositions (adjacent transpositions suffice) and its algebraic structure is governed by cycle decompositions and conjugacy classes determined by cycle type.

Demonstration

S_3 has six elements corresponding to the permutations of {1,2,3}; it contains cycles like (1 2), (1 2 3) and realizes symmetries of a labeled triangle when labels are permuted but not reflected if orientation matters.

Misapplication

Confusing the dihedral group of geometric symmetries of a polygon with S_n (they coincide only for n ≤ 3) or assuming S_n preserves additional structure on points (order, metric) without specification is incorrect.

Consequence

S_n provides canonical permutation representations, classification of elements by cycle type, explicit subgroup lattice including alternating subgroup A_n, and serves as a target for embeddings of arbitrary finite groups by Cayley’s theorem.

Reversal

The alternating group A_n is the index-two reversal capturing only even permutations; restricting S_n to certain structure-preserving permutations (e.g., order-preserving) yields proper subgroups, not the full symmetric group.

Boundary

Defined for finite cardinality n; for infinite sets one considers the full symmetric group on an infinite set with different properties. S_n treats points as unlabeled up to permutation but does not encode extra structures like topology or geometry unless additional constraints are imposed.

Semantic Tension

Tension appears between S_n as the algebraic full permutation group and geometric symmetry groups (dihedral, polyhedral) which act on the same set but may preserve metric or orientation — same underlying set, different preserved structures.

Synthesis

S_n is the universal finite permutation group on n points: it contains every bijection of an n-element set, is generated by transpositions, and organizes permutations by cycle type, forming the ambient symmetry group for pointwise combinatorial actions.