Alternating group¶

The subgroup A_n of the symmetric group S_n consisting of all even permutations of n objects, equivalently the kernel of the sign homomorphism, with order n!/2 for n at least two.

Version: v1 · 2026-09-28 · History
Domain-specific #: 7932
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Group Theory → Mathematics

Core Idea¶

The alternating group A_n consists of the even permutations of an n-element set. The sign homomorphism sends permutations in S_n to +1 or -1, and A_n is its kernel. Consequently A_n is normal of index two and, for n at least two, has n!/2 elements. Composition and inversion preserve even parity, so the selected elements form a group. Its structure changes sharply with degree. Its structure changes sharply with degree.

How would you explain it like I'm…

The Even-Swaps Club

Line up some toys and rearrange them by swapping two at a time. Some rearrangements take an even number of swaps and some take an odd number, and a given rearrangement is always one kind or the other. The alternating group is the club of all the even-swap rearrangements, and doing two of them in a row always gives another one in the club.

Group of Even Shuffles

A permutation is a way of rearranging a set of things, like shuffling numbered cards into a new order. Every rearrangement can be made by swapping two items at a time, and for any given rearrangement the number of swaps is always even or always odd, no matter how you do it. The alternating group is the collection of all the even rearrangements. If you do one even rearrangement and then another, you still get an even one, and undoing an even one is also even, so the collection hangs together nicely. As long as there are at least two things, exactly half of all rearrangements are even.

Group of Even Permutations

For a set of n objects, the symmetric group S_n contains every permutation, and each permutation has a sign: +1 if it is even (a product of an even number of swaps) and −1 if it is odd. The alternating group A_n is the set of even permutations. Composing or inverting even permutations keeps them even, so A_n is a group, and for n at least 2 it contains exactly half the permutations, n!/2 of them. Its structure depends a lot on n: A_5, with 60 elements, is the smallest nonabelian simple group, meaning it can't be broken into smaller normal pieces and its elements don't all commute. Also, some families of permutations that are all alike (conjugate) in S_n split into two separate families inside A_n.

The alternating group A_n is the subgroup of the symmetric group S_n consisting of the even permutations. Formally, the sign homomorphism sgn: S_n → {+1, −1} sends each permutation to its parity, and A_n is its kernel. Being a kernel, A_n is automatically a normal subgroup, and since sgn is onto for n ≥ 2, A_n has index two and order n!/2. Closure under composition and inversion follows from sgn being a homomorphism. The structure depends strongly on n: A_5, of order 60, is the smallest nonabelian simple group, while smaller alternating groups have exceptional properties. Conjugacy in A_n refines conjugacy in S_n: an S_n conjugacy class of even permutations can split into two A_n classes when its cycle lengths satisfy the relevant condition of being odd and distinct. Parity decides membership, but degree and cycle type govern the deeper claims.

Scope of Application¶

Use A_n with degree, action, parity convention, and any small-degree exceptions stated. Use A_n with degree, action, parity convention, and any small-degree exceptions stated.

Group theory. Studies normality and simplicity.
Galois theory. Relates discriminants and solvability.
Permutation theory. Analyzes actions and cycles.
Representation theory. Builds irreducible representations.
Geometry. Uses rotational symmetry examples.

Clarity¶

Order n!/2 and even element order are unrelated tests; membership concerns permutation parity, not numerical parity of group size. The closest near miss sets the boundary: The symmetric group S_n is closest: it is the ambient group containing both even and odd permutations, with A_n as its index-two sign kernel. A positive case must satisfy this test: A group is the alternating group A_n when it is the sign-kernel subgroup of permutations of a specified n-element set.

Manages Complexity¶

Properties must be indexed by n. Conjugacy in A_n is stricter than in S_n because the conjugating permutation must itself be even, allowing some classes to split. The central uniform definition–small-degree exceptions tradeoff is this: The sign kernel is uniform while simplicity and abelianness vary. A second same cycle shape–split conjugacy tension matters because S_n equivalence need not survive inside A_n.

Abstract Reasoning¶

Use three linked moves: fix the n-element action; express permutations and compute sign; take the sign kernel under composition. As a collapse test, the case exits when odd permutations are included or the group action and degree n are not fixed. A fourth check is to apply order and normality consequences. A final check is to check degree-specific and conjugacy exceptions.

Knowledge Transfer¶

Kernel-defined index-two subgroups transfer across algebra, but permutation sign and degree delimit alternating groups. The nearest stopping boundary is explicit: The symmetric group S_n is closest: it is the ambient group containing both even and odd permutations, with A_n as its index-two sign kernel. The inclusion test remains: A group is the alternating group A_n when it is the sign-kernel subgroup of permutations of a specified n-element set. The structure no longer applies when the case exits when odd permutations are included or the group action and degree n are not fixed. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. A_n acts by bijections of a finite set. Sign +1 defines the subgroup.

Relationships to Other Abstractions¶

Current abstraction Alternating group Domain-specific

Parents (1) — more general patterns this builds on

Alternating group is a kind of Group Prime

Alternating group is a domain-specific kind of group under the frozen identity and differentia.

Neighborhood in Abstraction Space¶

Alternating group sits in a crowded region of the domain-specific corpus (40^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Abstract Algebra & Category Theory (24 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08