Artin fixed-field theorem says that for a finite group , is Galois with group and degree . Let any finite act faithfully by left translation on variables in . Artin's theorem then realizes as .
is the sum of all square-free degree- monomials in the . The symmetric group permutes variables and fixes exactly , so Artin gives . The Vandermonde is not symmetric, but is symmetric and hence belongs to .
The relations are and , so the generated group is . The functions and are fixed. Conversely are roots of , and adjoining then gives degree at most . Artin gives degree exactly , proving .
If a group acts on a finite set , it acts on the direct product of groups by permuting its factors. The resulting semidirect product is the permutation wreath product. For acting on two-point blocks and , it describes independent within-block swaps combined with a permutation of blocks, and has order . The action on is part of the definition; it need not be the regular action used in a regular wreath product.
Ping-pong lemma Created 2026-09-28 Updated 2026-10-06
Suppose nontrivial groups act on a set and there are disjoint nonempty subsets such that every nonidentity element of maps into , while every nonidentity element of maps into . Assume at least one factor has at least three elements. Then the subgroup generated by and is their free product. The cardinality hypothesis excludes the counterexample in which acts by swapping and . Versions allowing both factors to have order two need an additional separation hypothesis.
In an accepted padded convolution of words, a loop after one tape ends can be deleted or repeated while keeping that entire tape fixed. The altered other tape still represents the same required neighbouring group element. A shortest representative has a suffix no longer than the fixed number of automaton states; an accepted longer suffix gives infinitely many representatives of the same element.
Quotient group Created 2026-09-24 Updated 2026-09-24
A reduced word contains no adjacent generator and inverse-generator pair. Cancel such pairs to obtain the unique reduced representative in a free group. One proof constructs the free group itself from reduced words, with multiplication given by concatenation followed by cancellation; its action by these operations on words distinguishes distinct reduced representatives.
Representation theory Created 2026-09-24 Updated 2026-10-13
Representation theory describes abstract symmetries by linear maps on vector spaces. A group representation assigns an invertible linear map to each group element, respecting multiplication. The payoff is that a symmetry problem becomes a problem about matrices, invariant subspaces, and eigenvalues. Decomposing the action can reveal combinations of variables that a symmetric system cannot mix.
Take the cyclic group , with . On three real coordinates, let send to :
This permutation representation does more than relabel a list: it acts linearly on every possible assignment of values to the three positions. The vector stays fixed. The vector subspace is also preserved, since a permutation does not change the sum.
Every vector separates uniquely into these two types:
For example, . The first term belongs to a trivial representation; the second is a contrast with zero coordinate sum. This is a direct sum decomposition . The symmetry preserves the mean and rotates the contrasts.
Figure 1.
Three-coordinate cyclic symmetry preserves the mean and rotates the zero-sum contrasts by 120 degrees
. Details.
The rotation is literal after choosing the orthonormal basis , of . In this basis,
It is a rotation through degrees, and three applications return to the starting point. There is no nonzero invariant real line, because this rotation has no real eigenvector. Thus the two-dimensional action is an irreducible representation over the real numbers. Over the complex numbers it instead splits into two eigenlines with eigenvalues and . The coefficient field is part of an irreducibility claim.
Why would this decomposition matter for a physical calculation? Consider three equal masses with scalar displacements and the symmetric quadratic coupling energy
The equations of motion are , where
is a Graph Laplacian and is the all-ones matrix. The constant vector has eigenvalue zero: translating all coordinates equally costs no coupling energy. On , vanishes and , so both independent contrast directions have angular frequency . A three-coordinate coupled problem reduces to a free mean and two identical harmonic oscillators.
Figure 2.
Equal pair couplings leave the mean fixed and make two independent zero-sum modes oscillate at the same frequency
. Details.
For initial displacement and initial velocity zero, the exact solution is . The fixed mean and oscillating contrast can be read directly from the decomposition. More generally, a linear operator commuting with the group action carries its fixed-vector subspace into itself; with an invariant inner product, it preserves the corresponding orthogonal complement too.
For a finite group, averaging over the action constructs an invariant inner product over the real numbers or complex numbers. The resulting invariant complements explain Maschke's theorem: a finite-dimensional group representation decomposes into irreducible representations. Characters compress the action into traces and help identify those pieces. The assumptions matter; in modular representation theory the coefficient field can have characteristic dividing the group order, and such decompositions can fail. Chapter 4 of Pavel Etingof and coauthors' notes develops these mechanisms. [ref].
The restricted direct sum of a family of groups is the subgroup of their direct product of groups consisting of tuples with only finitely many nonidentity coordinates. Multiplication is coordinatewise. If every factor is a finite group, each subgroup that is a finitely generated group lies in a finite subproduct, so the restricted direct sum is a locally finite group. This gives concrete infinite torsion groups without a uniform bound on element orders.
For a scalar function on a group, use as the right-translation convention. For Fourier analysis on a finite group this gives . Specifying whether or appears in the definition avoids sign and multiplication-order ambiguity.
Rotational symmetry group of a cube Created 2026-10-05 Updated 2026-10-06
The orientation-preserving symmetries of a cube are the signed permutation matrices with determinant one. There are of them. Their group action on the four body diagonals identifies this group with the symmetric group . Indeed choose diagonal directions , whose sum is zero and whose only linear relation has all coefficients equal. A rotation fixing every diagonal sends each direction to itself or its negative; the relation forces all four signs equal. All negative would give , which has determinant , so the kernel of a group homomorphism is trivial. Both groups have order 24, giving the identification. Its face permutations have cycle types , , , and , occurring times respectively.
Schreier graph 2026-10-03
For a group , a subgroup , and a generating set , the Schreier graph has the left cosets as vertices and an edge from to for each . Its radius- ball records the cosets met by .
Sign homomorphism Created 2026-09-24 Updated 2026-10-03
The sign homomorphism sends an even permutation to and an odd permutation to ; its kernel is the alternating group.
A symmetric group is the group of all bijections from a set to itself, with function composition as its operation.
Skyscraper sheaf of sets 2026-10-07
For inclusion of a point , this is the direct-image sheaf of a set. It is right adjoint to the stalk functor. It uses the singleton terminal set on opens omitting , rather than the zero group used for abelian-group skyscraper sheaves.
The six-element dihedral group generated by the displayed rotations already forces every invariant second-rank tensor to have the same form as an axially invariant second-rank tensor. The axial threefold rotation eliminates mixed entries and leaves only a planar scalar plus a planar antisymmetric part; the transverse half-turn eliminates the latter. No smaller finite subgroup suffices: cyclic rotation groups retain an axial antisymmetric tensor, while a four-element noncyclic rotation group retains arbitrary diagonal tensors along its three mutually perpendicular half-turn axes.