Absolutely irreducible real representation Created 2026-10-14 Updated 2026-11-05
A real group representation is absolutely irreducible if its complexification is irreducible. For a finite group this is equivalent to having only scalar real endomorphisms commuting with the representation. Independent coordinate sign changes force a commuting matrix to be diagonal; a transitive cyclic permutation of the coordinates then forces its entries equal. Alternatively, the coordinate projections and the cyclic permutation directly prove irreducibility over either field.
Algebraic quotient by a finite group Created 2026-10-07 Updated 2026-10-14
For an affine variety with coordinate ring acted on by a finite group , the affine quotient is . Elements of satisfy monic orbit polynomials over , so the quotient map is a finite morphism. Over an algebraically closed field, invariant functions separate finite orbits; in characteristic not dividing , interpolate and average a function separating two orbits. The quotient fibres are consequently the orbits.
Alternating-group embedding of a finite group Created 2026-10-06 Updated 2026-10-14
Cayley theorem embeds a finite group of order into . Extend to letters and multiply it by the disjoint transposition exactly when is odd. Additivity of parity makes this an injective group homomorphism into the alternating group . Thus every finite group is isomorphic to a subgroup of some alternating group.
Ambivalent group Created 2026-10-14 Updated 2026-11-05
A finite group is ambivalent when every element is conjugate to its inverse. Since every complex character satisfies , an ambivalent group has real values for every irreducible character. Conversely, if every irreducible value is real, irreducible characters separate conjugacy classes and force every to be conjugate to .
Artin fixed-field theorem Created 2026-09-24 Updated 2026-11-05
If a finite group acts faithfully by automorphisms on a field , then is Galois, has degree , and has Galois group .
This theorem constructs a Galois extension from a finite group of field automorphisms; it is not an alternative name for the extension itself.
Artin induction 2026-10-14
Every complex character of a representation of a finite group is a rational linear combination of characters of induced representations from one-dimensional group representations of cyclic subgroups . One-dimensionality follows because the irreducible representations of a finite cyclic group over the complex numbers are one-dimensional. The rational coefficients distinguish this statement from Brauer induction, which permits integer coefficients by allowing more general subgroups. For a rational-valued character, another form of Artin induction uses rational combinations of induced representations of trivial group representations of cyclic subgroups.
Averaging over a finite group Created 2026-09-24 Updated 2026-11-05
When is invertible in the coefficient field or ring, averaging an element of a group representation over a finite group, , produces a group-invariant object because left multiplication permutes the summation index.
Mathematische Annalen 20, 301–329. The opening finite group definition is reproduced in Oxford's exam and discussed in The abstract group concept by the MacTutor History of Mathematics Archive. The publisher page establishes the article's title, author, pages and issue date; the commentary does not assume access to its subscription facsimile.
Block of a group algebra Created 2026-10-03 Updated 2026-11-05
A block of a finite group algebra is an indecomposable two-sided ideal determined by a primitive central idempotent . An -module lies in this block when .
For a finite group generated by , take the regular covering of a thrice-punctured sphere with monodromy and fill each lifted puncture by a disk. Locally the projection is , where is the order of its monodromy. The result is a closed oriented topological surface with an orientation-preserving group action. The nontrivial stabiliser subgroups are the conjugates of , and at the three types of ramification points. Counting lifted cells gives the displayed Euler characteristic. A subgroup acts freely exactly when it meets every conjugate of these three cyclic groups trivially. Its quotient is then a regular covering of degree equal to the subgroup order, and quotient Euler characteristic is divided by that order.
Branching of a representation Created 2026-10-25 Updated 2026-11-05
The branching of a group representation to a subgroup is its decomposition into irreducible representations of , when that restriction of a representation is a semisimple representation: . The nonnegative integers are the branching multiplicities. For finite groups over the complex numbers, they are the character inner products of the restricted character with the irreducible characters of . Restriction to an arbitrary subgroup need not be completely reducible.
Brauer character inner product Created 2026-10-03 Updated 2026-11-05
For class functions on the p-regular elements of a finite group,
Equivalently, summing over p-regular conjugacy-class representatives gives weights .
Brauer induction Created 2026-10-14 Updated 2026-11-05
Every complex character of a representation of a finite group is an integer linear combination of characters of induced representations from one-dimensional group representations of subgroups . Negative coefficients are allowed. Unlike Artin induction, the subgroups need not be cyclic groups. Applied to an Artin L-function, compatibility with induced representations turns this character identity into a product of one-dimensional Artin L-functions with integer exponents, reducing the behavior at to abelian extensions.
Brauer's characterization of characters Created 2026-10-14 Updated 2026-11-05
A complex class function on a finite group is a generalized character if and only if is a generalized character of every elementary subgroup. Equivalently, for every such and . Ordinary characters additionally have nonnegative global irreducible multiplicities; integrality of the virtual-character lattice is the conclusion of this criterion.
Brauer's permutation lemma Created 2026-10-14 Updated 2026-11-05
A group of automorphisms of a finite group permutes both its conjugacy classes and its irreducible characters. The two permutation representations have the same character: each automorphism fixes equally many conjugacy classes and irreducible characters. The invertible character table intertwines the two permutation matrices, which have equal traces. The claim concerns fixed classes, not merely fixed elements.
Burnside's lemma Created 2026-10-14 Updated 2026-11-05
For a finite group acting on a finite set , the number of orbits is
It follows by counting pairs with first by and then by .
Burnside's theorem Created 2026-10-05 Updated 2026-10-14
Every finite group whose order is divisible by at most two distinct primes is a solvable group. A nonabelian simple group must therefore have at least three distinct prime divisors.
Cauchy theorem for groups Created 2026-09-24 Updated 2026-11-05
If a prime divides the order of a finite group, the group contains an element of that prime order.
One proof lets a cyclic group of order rotate the tuples
The tuple set has size , and its fixed tuples are precisely with . Counting nonfixed orbits modulo forces a nonidentity fixed tuple.
Cayley's theorem 2026-10-14
Every group is isomorphic to a subgroup of the symmetric group on its underlying set. The construction uses the left regular action: each group element becomes a permutation of all the group elements, given by
For a finite group of group order , labeling these elements by gives a group embedding into . The same construction works for an infinite group, with the symmetric group of all bijections of its underlying set.[ref]
The beauty is that the multiplication rule itself supplies a concrete model. Whatever the group elements originally represent, each one rearranges the entire group by multiplication. A product becomes function composition, and no distinctions between group elements are lost. For a finite group, a row of its Cayley table lists the images under one : the multiplication table is already a catalogue of permutations.
Throughout this construction, products of permutations act rightmost first:
Thus first multiplies by , then by . This is a left group action, not a license to reverse the multiplication order in a nonabelian group. Ordinary right multiplication instead satisfies with this convention; replacing it by restores the group homomorphism law.[ref]
For an explicit cyclic group example, take under addition, using modular arithmetic. Its left regular action consists of . In permutation cycles on the labels ,
The function composition sends to , to , to , and to : squaring the four-point permutation cycle produces two disjoint permutation cycles. Also . These four permutations form a cyclic subgroup of , reproducing addition in exactly.
For a nonabelian group example, let , with , , and its identity element. The six group elements are , where and . Now the labels being permuted are themselves permutations of three points. Computing the left regular action gives permutations of these six labels:
For example, ; putting here would accidentally switch to right multiplication. Noncommutativity survives in the model:
These different outputs prove that . The group generators become group generators of a six-element subgroup of .
Figure 1. . Each arrow sends a label to , or to in the additive cyclic group. The top panels show the translations by and in ; the bottom panels show multiplication by and in the symmetric group . Each panel depicts one permutation, decomposed into disjoint permutation cycles. Details.
Why does a group action here produce a group embedding? Any group action on a set gives a group homomorphism ; it is a group embedding precisely when it is a faithful group action. The group kernel consists of the group elements fixing every point of . In the left regular action, , so fixing the identity element already forces . In fact every stabilizer subgroup is trivial, since forces ; this stronger property makes the left regular action a regular group action.[ref]
Compare two group actions of the same cyclic group . Its left regular action on four labels distinguishes all four group elements. On , the rule defines a transitive group action, but and both fix both points, while and both exchange them. Its group kernel is , so it is not a faithful group action. Its image is a two-element subgroup of , isomorphic to the quotient group rather than to .
Figure 2.
A faithful group action preserves all four translations; a two-point group action merges them
. Both panels start with the same cyclic group . The arrows show the group action of its group generator , and the tables show all four resulting permutations. On four points the group kernel is ; on two points it is . Reachability of every point does not imply a faithful group action. Details.
The guaranteed number of labels need not be the smallest possible for a faithful group action. The symmetric group naturally acts faithfully on : a permutation fixing all three labels is the identity element. Its left regular action uses six labels instead. Three is the smallest possible here, since and have fewer than six elements and cannot contain an isomorphic copy of . Moreover, in the natural three-point group action, the stabilizer subgroup of is : a faithful group action can have nontrivial point stabilizer subgroups. Cayley's construction supplies a universal model, while a smaller model can reveal particular symmetries.
The proof is short. Each is a bijection with inverse . Associativity gives
so is a group homomorphism. If , evaluating both at the identity element gives . Hence is injective, and its image is the required isomorphic subgroup. No finiteness assumption entered the argument.
The historical connection is unusually close to the notation. The opening paragraph of Arthur Cayley's 1854 paper already treats permutations as one example of operations on a collection of quantities and explicitly performs the rightmost operation first in a product. It also allows noncommutativity while insisting on associativity. The modern left regular action shows how that viewpoint reaches every abstract group, by choosing the group itself as the set to be acted on.[ref]
For a complex irreducible representation of a finite group , the sum commutes with every : conjugation sends its summands to , merely permuting the summation index. Schur's lemma gives . Taking the trace yields , proving the identity. Here is the Frobenius-Schur indicator. For a reducible representation the sum is still central in its image, but need not be one scalar on all irreducible constituents.