Skip to content

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. A_5, of order 60, is the smallest nonabelian simple group, while smaller alternating groups have exceptional properties. Conjugacy also refines the symmetric-group picture: an S_n conjugacy class can split into two A_n classes when its cycle lengths satisfy the relevant odd-and-distinct condition. Thus parity defines membership, but degree and cycle structure govern further claims.

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.

Structural Signature

Sig role-phrases:

  • finite underlying set. Supplies n objects being permuted. Constitutive carrier. If altered: Changing n changes the group.
  • symmetric group S_n. Provides all bijective permutations under composition. Constitutive ambient group. If altered: A_n is not defined independently of the permutation action.
  • parity or sign. Classifies permutations as even or odd. Identity-bearing invariant. If altered: Cycle notation alone must still yield sign +1.
  • kernel closure. Selects sign +1 permutations, closed under group operations. Constitutive construction. If altered: A mere collection of even-looking cycles must satisfy the group definition.
  • degree-sensitive structure. Determines order, simplicity, abelianness, and conjugacy behavior by n. Diagnostic property frame. If altered: Statements valid for A_5 need not hold for small degrees.

What It Is Not

  • Symmetric group. Are odd permutations included?
  • Even-order group. Is parity about elements or group order?
  • Arbitrary index-two subgroup. Is the sign action on n letters fixed?
  • Rotation group. Is an isomorphism being mistaken for identity?

Scope of Application

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.

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.

Abstract Reasoning

  1. Fix the n-element action.
  2. Express permutations and compute sign.
  3. Take the sign kernel under composition.
  4. Apply order and normality consequences.
  5. 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.

Examples

Canonical

In S_5, all products of an even number of transpositions form A_5; the sign map has kernel A_5, giving order 60 and the smallest nonabelian simple group.

Mapped back: finite underlying set → five letters; symmetric group S_n → S5; parity or sign → even; kernel closure → kernel of sign; degree-sensitive structure → simple at n=5.

Applied / In Practice

The subgroup of S_4 generated by one transposition contains odd permutations. It is a permutation subgroup but not A_4, regardless of any coincidental size property.

Mapped back: finite underlying set → four letters; symmetric group S_n → S4; parity or sign → includes odd; kernel closure → fails; degree-sensitive structure → not A4.

Structural Tensions

T1: uniform definition vs. small-degree exceptions. The sign kernel is uniform while simplicity and abelianness vary. Diagnostic: What range of n supports the theorem?

T2: same cycle shape vs. split conjugacy. S_n equivalence need not survive inside A_n. Diagnostic: Can the conjugator be chosen even?

Structural–Framed Character

Description turns on finite underlying set, symmetric group S_n, parity or sign, kernel closure, degree-sensitive structure. Skeletal core. A binary invariant partitions a group and its identity class forms an index-two kernel. Domain-bound accent. Permutations, transpositions, sign, degree, cycles, and conjugacy define A_n. Transfer remains bounded because Why not prime. Kernel construction is portable; alternating groups are its permutation-parity realization. The negative boundary is concrete: Any subgroup of S_n, set of cycles, even-order group, commutator subgroup, simple group, permutation representation, or group with n!/2 elements is not automatically A_n. Alternating groups are structural-formal: a homomorphism kernel fixes membership exactly, while degree controls higher structure. Its character: even permutation symmetry isolated inside S_n.

Structural Core vs. Domain Accent

Skeletal core. A binary invariant partitions a group and its identity class forms an index-two kernel.

Domain-bound accent. Permutations, transpositions, sign, degree, cycles, and conjugacy define A_n.

Why not prime. Kernel construction is portable; alternating groups are its permutation-parity realization.

This entry is a kind of Group.

  • Permutation group. A_n acts by bijections of a finite set.
  • Kernel. Sign +1 defines the subgroup.
  • No strict parent is asserted.

Relationships to Other Abstractions

Local relationship map for Alternating groupParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Alternating groupDOMAINPrime abstraction: Group — is a kind ofGroupPRIME

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.

Hierarchy paths (5) — routes to 5 parentless roots

Neighborhood in Abstraction Space

Alternating group sits in a crowded region of the domain-specific corpus (40th 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

Not to Be Confused With

  • Symmetric group. Tell: Are odd permutations included?
  • Even-order group. Tell: Is parity about elements or group order?
  • Arbitrary index-two subgroup. Tell: Is the sign action on n letters fixed?
  • Rotation group. Tell: Is an isomorphism being mistaken for identity?

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Alternating_group (revision 1360320479).
  • Preserved source candidate: https://groupprops.subwiki.org/wiki/Splitting_criterion_for_conjugacy_classes_in_the_alternating_group
  • Preserved source candidate: https://faculty.etsu.edu/beelerr/fifteen-supp.pdf
  • Preserved source candidate: https://web.archive.org/web/20210107214840/https://faculty.etsu.edu/beelerr/fifteen-supp.pdf
  • Preserved source candidate: http://www.maths.qmul.ac.uk/~raw/fsgs.html
  • Preserved source candidate: http://www.maths.qmul.ac.uk/~raw/fsgs_files/alt.ps
  • Preserved source candidate: https://web.archive.org/web/20110522121819/http://www.maths.qmul.ac.uk/~raw/fsgs.html

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.