Sum of squares of irreducible representation dimensions Created 2026-10-06 Updated 2026-11-05
The regular group representation of a finite group over the complex numbers contains each irreducible representation with multiplicity equal to its dimension. Consequently the sum of the squared dimensions is the group order. Once a list of distinct irreducibles exhausts this sum, it is complete.
Supersolvable group Created 2026-10-14 Updated 2026-11-05
A finite group is supersolvable if it has a normal series of a group whose nontrivial factors are cyclic of prime order. This is stronger than solubility, because the individual terms must be normal in the ambient group. For instance, is soluble via its normal Klein four-group, but is not supersolvable: it has no normal subgroup of order two or three with which such a series could begin.
Sylow subgroup of a subgroup from double cosets Created 2026-09-24 Updated 2026-11-05
If is a Sylow subgroup of a finite group and , some intersection is a Sylow subgroup of . Otherwise every double-coset sizewould be divisible by a larger power of than , as would their sum .
Symmetric cube of a group representation 2026-10-25
The symmetric cube of a group representation is the symmetric part of . Over the complex numbers, its character isThe projection onto symmetric tensors averages the six permutations of the three factors. The identity permutation contributes , the three transpositions each contribute , and the two three-cycles each contribute . Cubic polynomial invariants are fixed vectors in , whose dimension follows by averaging this character for a finite group.
Symmetric group Created 2026-09-24 Updated 2026-11-05
The symmetric group is the group of all bijections of an -element set, with multiplication given by function composition. There are such permutations, since one chooses the images successively in ways.
For , composition is not commutative: but the reversed product is , applying the rightmost permutation first. Every permutation decomposes into disjoint cycles and into transpositions. By Cayley's theorem, every finite group embeds in some symmetric group, so permutation actions provide a universal concrete model of finite group operations.
Thompson's character-degree normal complement theorem Created 2026-10-14 Updated 2026-11-05
If a prime divides the degree of every nonlinear irreducible character of a finite group, the group has a normal p-complement. Indeed, the p-prime-degree characters are exactly the linear characters. Their squared-degree sum is , whose p-part is ; Isaacs' character-degree criterion for p-nilpotency applies.
Torsion-free finite extension of a lattice Created 2026-10-14 Updated 2026-11-05
For a specified finite group action on , extensions are classified by . For an element of prime order , a lift satisfies ; changing the lift changes by . Thus the extension is torsion-free precisely when every restriction to a prime-order cyclic subgroup is nonzero in . Any finite-order element has a prime-order power, so this tests all torsion. An arbitrary finite quotient must not be confused with faithful holonomy on a maximal translation lattice.
Transfer ideal of conjugation-fixed elements Created 2026-10-03 Updated 2026-11-05
Let a finite group act on an algebra by conjugation and let . The transfer ideal from isThe notation records both the source subgroup and the ambient fixed-point algebra.
Transitive group action Created 2026-10-03 Updated 2026-10-25
A group action on a nonempty set is transitive when every two points lie in the same orbit of a group action, equivalently when for all there is a group element with . There is exactly one group orbit: every position is reachable from every other. Requiring avoids calling the group action on the empty set transitive merely because the quantified statement has no points to test.[ref]
Transitive Group Actions by Keith Conrad. Definition 1.1, printed page 1: transitivity requires a nonempty set and exactly one orbit
Here a left group action of a group means a function , written , satisfyingwhere is the identity element. Products move the point by first, then by . Transitivity says that an orbit map , , is surjective for every ; it suffices to check one chosen point.[ref][ref]
For example, the symmetric group acts on by . This is a transitive group action, but it is not a free group action: the stabilizer subgroup of is . Both the transposition and the cyclic permutation send to . In contrast, the cyclic group acts on itself by , using modular arithmetic. The group element sending to is uniquely . These two group actions reach the same number of points, but only the second has unique transport between them.
Transitive group actions with and without unique transport
. The symmetric group on three labels has a stabilizer subgroup of group order two at each point, hence two group elements sending any chosen point to any other. The cyclic group acting on itself has trivial stabilizer subgroups and one transport per pair. Red arrows show a generating cyclic permutation; blue arrows show the extra transposition in . Gray loops show the identity element in both group actions. Details.The stabilizer subgroup measures the ambiguity of transport. If , thenThe first set is a left coset, and the second identity says that stabilizer subgroups in one group orbit are conjugate subgroups. Briefly, exactly when . Thus, for a finite group in a transitive group action, the orbit-stabilizer theorem gives , and there are exactly transports for each pair of points. The example counts are for and for . This separates the number of reachable positions from the number of ways to reach each one.[ref]
Suppose distinct Sylow subgroups for in a finite group have trivial intersections. Conjugation by one of them, , fixes . The stabilizer of any other is . Since normalizes , the product is a subgroup of -power order; maximality of gives . Thus . All other orbits have size , proving the congruence.
Trivial representation in a tensor square Created 2026-10-20 Updated 2026-11-05
For a finite-dimensional irreducible complex representation , invariant tensors in correspond to equivariant maps . Schur's lemma makes their dimension one if is self-dual and zero otherwise. For a finite group, in particular, a real-character irreducible representation has precisely one trivial copy in its tensor square. For arbitrary complex irreducibles, the unconditional statement is that contains the trivial representation once.
For an arbitrary group, a real-valued character need not imply self-duality: the one-dimensional group representation of has real character but its tensor square has action , so contains no trivial representation.
Unipotent quotient in a Deligne-Lusztig variety Created 2026-10-14 Updated 2026-11-05
Choose rational , a representative , and with . Set and . Then is rational, andThe map sends to . Quotienting only by the finite group leaves fibres isomorphic to the positive-dimensional unipotent intersection when that intersection is nontrivial. For in , this is an affine-line fibre over each rational flag, so the missing quotient cannot be ignored in a variety isomorphism.
Unipotent representation Created 2026-09-24 Updated 2026-11-05
In the operator sense, a finite-dimensional group representation is unipotent when every represented element is a unipotent matrix: for each , is a nilpotent endomorphism. This terminology is distinct from the special unipotent characters in the representation theory of finite groups of Lie type.
For example, the generator of can act on a two-dimensional vector space by . Then , and the first coordinate line gives a nonsplit extension of representations of the trivial representation by itself. Over a field of characteristic zero, a unipotent matrix of finite order is the identity, because its minimal polynomial divides both a power of and the separable polynomial . Thus every unipotent group representation of a finite group is trivial in characteristic zero; in characteristic , the displayed instead gives a nontrivial group representation of .
Unitarization of a finite-group representation Created 2026-09-24 Updated 2026-11-05
Average a positive-definite Hermitian form over a finite group and choose an orthonormal basis for the averaged form. In that basis every representing matrix is unitary.
Unitriangular group of degree three over F3 2026-10-06
The upper unitriangular group consists of for . Its multiplication is . The elements and do not commute. Yet every element is with , so characteristic three gives . It is a nonabelian finite group of order whose nonidentity elements all have order three.
Weighted Burnside lemma Created 2026-10-14 Updated 2026-11-05
Let a finite group act on a finite set , with an orbit-invariant weight in a commutative ring. Double counting gives the division-free identityIndeed, each is counted times, and each orbit contributes copies of its common weight. If is invertible in , dividing gives the weighted average formula of Burnside's lemma. For formal monomial weights one can first count over the integers and then specialize into any commutative ring; this avoids dividing by zero in modular characteristic.
