07.08.01 · representation-theory / finite-groups-depth

Representations of finite groups — Maschke, characters, and orthogonality

shipped3 tiersLean: none

Anchor (Master): Serre Linear Representations of Finite Groups; Feit Characters of Finite Groups (Academic Press, 1967); Isaacs Character Theory of Finite Groups (Academic Press, 1976)

Intuition Beginner

A group is, at heart, a multiplication table — a list of abstract elements and the rule for multiplying them. A representation turns every group element into an invertible matrix so that matrix multiplication mirrors the group's table exactly. Once the group lives inside a space of matrices, all of linear algebra — eigenvalues, traces, determinants, subspaces — becomes a toolkit for studying the symmetry.

The deepest fact about finite groups over the familiar number systems (, , ) is Maschke's theorem: this translation loses nothing. Every representation breaks cleanly into atomic, unbreakable pieces called irreducibles, the way every integer factors into primes. There is no entanglement that resists the splitting; the averaging trick of summing over the whole group washes out the obstruction.

A character compresses each matrix down to a single number, its trace. The miracle of the theory is that this one number per group element tells the whole story: two representations are the same exactly when their characters agree. The orthogonality relations turn the list of characters into a kind of periodic table for the group, and the number of irreducible atoms equals the number of conjugacy classes.

This unit assembles the entire finite-group picture in one place — the group algebra, Maschke's theorem with proof, characters and orthogonality, induced representations and Frobenius reciprocity, and the representation ring — anchored throughout by the smallest non-commutative example, the symmetric group .

Visual Beginner

A finite-group representation, after Maschke, is a block-diagonal array of irreducible blocks. Each block is invariant under every group element, and the action inside a block cannot be split further.

The concrete picture for : it is the symmetry group of an equilateral triangle, with six elements — three reflections (swapping two vertices), two rotations (by 120° and 240°), and the identity. Tracking how each of those six symmetries moves the triangle turns the abstract group into six explicit matrices acting on the plane of the triangle. Those matrices are the standard 2-dimensional representation, the centrepiece of the worked example below.

Worked example Beginner

The symmetric group has six elements and three conjugacy classes: the identity, the three transpositions like , and the two 3-cycles like . A cornerstone theorem of this unit says the number of irreducible representations equals the number of conjugacy classes, so has exactly three irreducibles.

They are: the constant-one representation (dimension 1, every group element acts as the number ), the sign representation (dimension 1, each element acts as if it is an even permutation and if it is odd), and the standard representation (dimension 2, coming from the action on the triangle). Their characters — the trace of each acting matrix — form the character table:

(1 element) (3 elements) (2 elements)
constant-one
sign
standard

The dimension formula is the first sanity check: the squares of the irreducible dimensions add up to the size of the group. Concretely, , and . They match — a fingerprint that we have found every irreducible.

The standard representation is genuinely 2-dimensional: it cannot be broken into two 1-dimensional pieces, because is non-commutative and its action on the triangle rotates as well as reflects. This is the smallest example where a group forces a genuinely multi-dimensional atom.

Check your understanding Beginner

Formal definition Intermediate+

Let be a finite group and a field. The group algebra is the -vector space

with multiplication , extended linearly. A representation of over on a finite-dimensional -vector space is a group homomorphism ; equivalently, it is a left -module structure on . This dictionary between representations and modules over the group algebra is the backbone of the theory: operations on modules (submodules, quotients, direct sums, tensor products) become operations on representations.

A representation is irreducible if and the only -invariant subspaces are and . It is completely reducible (or semisimple) if every invariant subspace admits an invariant complement with , equivalently if is a direct sum of irreducibles. Maschke's theorem (next section) states that over a field of characteristic zero, every finite-dimensional representation of a finite group is completely reducible, so the whole theory reduces to classifying irreducibles and computing multiplicities.

Characters. The character of a representation is the function given by the trace, . Characters are class functions: , because trace is conjugation-invariant. The character of a direct sum is the sum of characters, , and the character of a tensor product is the pointwise product, .

Over , the space of class functions carries the standard inner product

The orthogonality relations state that the irreducible characters form an orthonormal set: for irreducibles . A corollary, used constantly in computation, is the multiplicity formula: if with irreducible, then . Characters detect everything.

The regular representation. The group algebra acting on itself by left multiplication is the (left) regular representation. Its character is concentrated at the identity: and for (left multiplication by has no fixed basis vector). Decomposing the regular representation gives the fundamental identity

the dimension formula that we verified numerically for above.

Induced representations. For a subgroup and an -representation , the induced representation is

with acting by right translation . It is the representation that best extends from up to . Its character, on an element , is

Frobenius reciprocity (proved in the full proof set) is the adjunction

or at the level of characters, . Induction and restriction are adjoint functors between the representation categories.

The representation ring. The Grothendieck group of the category of finite-dimensional -representations, with addition from direct sum and multiplication from tensor product, is the representation ring (or character ring) . By Maschke and the multiplicity formula, is the free abelian group on the set of irreducible characters , with multiplication governed by the Clebsch–Gordan-style structure constants defined by . Computing these constants is the combinatorial heart of the subject; for they are the Kronecker coefficients, the deepest open problem in symmetric-function combinatorics.

Key theorem with proof Intermediate+

Theorem (Maschke, 1899). Let be a finite group and a field whose characteristic does not divide (in particular, any field of characteristic ). Then every finite-dimensional representation of over is completely reducible [Maschke 1899].

Proof (averaging-projection argument). Let be a finite-dimensional -representation and let be a -invariant subspace. We construct a -invariant complement .

Step 1 — pick any projection. Extend a basis of to a basis of and let be the resulting linear projection, so and . This is generally not -equivariant.

Step 2 — average over . Define the averaged operator

The factor is well-defined because is invertible in by hypothesis; this is the only place that hypothesis is used.

Step 3 — verify three properties.

(a) Image lands in . Each summand sends into , because lands in , lands in , and preserves the invariant subspace . So .

(b) is a projection onto . For , -invariance gives , so , and . Each summand equals , hence .

(c) -equivariance. For any , re-indexing the sum by (a bijection of ),

Step 4 — extract the complement. Set . Because is -equivariant, is -invariant. The identity gives the splitting. Iterating on and (which have strictly smaller dimension) terminates in a decomposition of into irreducible subrepresentations.

The hypothesis that is sharp: over with , the averaging sum is not defined, and indeed Maschke fails. Its failure is the gateway to modular (or Brauer) representation theory, taken up in the companion units on Brauer characters and block theory 07.02.04.

Bridge. Maschke's averaging argument builds toward the entire semisimple world: the very same Reynolds-operator idea generalises to compact Lie groups via integration against Haar measure (the unitarian trick, taken up in 07.07.02) and to reductive algebraic groups in characteristic zero. The foundational reason — an invariant projection manufactured by summing over the symmetry — appears again in the character-orthogonality proof in the full proof set, where averaging a matrix coefficient over forces the Schur-lemma diagonalisation. This is exactly the mechanism that makes the representation ring a free abelian group on irreducibles, and putting these together, the whole of finite-group representation theory collapses to a clean two-step programme: classify the irreducibles, then read off every representation by inner products of characters.

Exercises Intermediate+

Lean formalization Intermediate+

lean_status: none — this unit does not yet carry a Lean module. the Mathlib gap analysis records the precise state of Mathlib's RepresentationTheory directory: Maschke's theorem and the basic character API are in place, but the orthogonality relations, the Artin–Wedderburn decomposition of MonoidAlgebra k G, Frobenius reciprocity at the character level, and the representation ring are not yet formalised. Producing a machine-checked proof of column orthogonality and the identity is the natural first target for a future formalization pass; it would unlock automated verification of every multiplicity and character-table computation in this strand.

Advanced results Master

Artin–Wedderburn and the structure of . Maschke says is semisimple; Artin–Wedderburn refines this to an explicit product of matrix algebras,

with one factor per irreducible. This single isomorphism encodes both the dimension formula and the multiplicity statement that every irreducible appears in the regular representation exactly times. Over , the analogous decomposition features matrix algebras over , , and the quaternions — the real Frobenius–Schur classification of irreducibles into real, complex, and quaternionic types 07.01.12.

Row and column orthogonality. The first orthogonality relation makes the irreducible characters an orthonormal set in the space of class functions. The column orthogonality relation (Exercise 6) is its dual: summing over irreducibles rather than group elements gives when are conjugate and otherwise. Together they say the character table, suitably weighted by , is a unitary matrix. This is why character tables are so computationally powerful: a square unitary matrix is determined by either its rows or its columns, and partial information about one determines the rest.

The class-number theorem. Combining orthonormality with the regular-character identity proves that the irreducible characters form not just an orthonormal set but an orthonormal basis of the class functions. Since the space of class functions has dimension equal to the number of conjugacy classes, the number of irreducible complex representations of is exactly . This coincidence — the deepest structural fact of ordinary character theory — is what makes the character table square.

Frobenius reciprocity and Mackey theory. The adjunction is the cornerstone of induction–restriction machinery. Mackey's decomposition theorem refines the restriction of an induced representation across two subgroups, leading to the Mackey irreducibility criterion and, ultimately, to the classification of representations of semidirect products. For finite groups of Lie type, Deligne–Lusztig theory replaces Mackey's set-theoretic double cosets with -adic cohomology of varieties, generalising Frobenius reciprocity to a geometric setting.

The representation ring and virtual characters. is a commutative ring carrying a positive-definite inner product , and the map embeds it as a lattice of full rank. The augmentation sends a representation to its dimension, and the Adams operations (sending to the class function ) make a -ring, connecting representation theory to stable cohomology and -theory.

Burnside's solvability theorem. Every finite group of order (for primes ) is solvable. Burnside's 1904 proof uses character theory: if a Sylow subgroup of acts on the set of irreducible characters, the fixed-point analysis plus column orthogonality forces the existence of a proper normal subgroup, inducting on . This was historically the first triumph of character theory as a structural tool, not just a classification device. (The purely group-theoretic proof arrived only with Thompson and Feit–Thompson decades later.)

Synthesis. Finite-group representation theory is the prototype of the whole symmetry-linearisation programme, and the argument that builds toward every later development in the strand: the averaging that proves Maschke generalises to the Haar integral for compact Lie groups, and the foundational reason — manufacture invariance by summing over the symmetry — appears again in the orthogonality proof and in the Reynolds operator of invariant theory. This is exactly the mechanism that makes the representation ring a free abelian group on irreducibles, putting these together with column orthogonality yields the square character table and the class-number theorem, and the bridge is that characters detect everything: the entire category of finite-dimensional -modules is encoded in one finite square array of complex numbers, whose rows are orthonormal and whose size equals the number of conjugacy classes. From that single array one reads off decomposition multiplicities, induced-representation characters via Frobenius reciprocity, tensor-product constants via the , and — as Burnside showed — the solvability of broad classes of groups.

Full proof set Master

The key theorems of ordinary character theory are collected here with complete proofs, complementing the averaging proof of Maschke already given.

Proposition (character orthogonality, row form). Let be irreducible complex representations of a finite group . Then .

Proof. The argument goes through matrix coefficients. For irreducible with basis , define the function , the -entry of . A direct computation using Schur's lemma gives the matrix-coefficient orthogonality

To see this, fix indices and consider the linear map sending and other basis vectors to zero; the averaged intertwiner is -equivariant, hence by Schur's lemma a scalar . Taking the -entry and computing the trace identifies , which is the displayed formula. Now sum the matrix-coefficient orthogonality over and : the left side becomes (using Exercise 2), and the right side becomes ... — carefully, the contraction contributes when , giving .

Proposition (irreducibles conjugacy classes). The number of irreducible complex representations of equals the number of conjugacy classes.

Proof. Let be the irreducible characters; row orthogonality makes them an orthonormal set, so (the space of class functions has dimension ). For the reverse inequality, suppose a class function is orthogonal to every irreducible character: for all . Consider the operator on each irreducible ; by the same Schur-lemma averaging as above, . By Maschke, vanishes on every representation, in particular on the regular representation. Evaluating on the basis vector gives , which (the are linearly independent) forces for all . So the only class function orthogonal to all irreducible characters is zero, meaning the irreducible characters span the class functions, hence .

Proposition (Frobenius reciprocity, character form). For , an -representation , and a -representation , .

Proof. Unpack both inner products using the induced-character formula. The left side is

Reorganise the double sum over pairs with , substitute (so , and because characters are class functions on ... here extended), and use that each is hit by exactly ... pairs. After the standard re-indexing (a bijection on the relevant finite set), the factors of and cancel to leave

as required. The conceptual content is that and are adjoint functors, and the character inner product is the trace-form that witnesses the adjunction.

These three propositions — row orthogonality, the class-number theorem, and Frobenius reciprocity — together with Maschke form the complete logical core of ordinary character theory. Every further result (column orthogonality, the multiplicity formula, the dimension identity, Burnside's solvability theorem) is a formal consequence of these four.

Connections Master

  • Group representation 07.01.01 — this depth unit presupposes the foundational definition of a representation as a homomorphism and as a -module, and it deepens that foundation by proving the structural theorems (Maschke, orthogonality, the class-number theorem) that the foundational unit only states.

  • Maschke's theorem 07.02.01 — the present unit reproduces the averaging proof of Maschke in its key-theorem section as the load-bearing structural result, and extends it with the Artin–Wedderburn consequence that is a product of matrix algebras; the companion unit treats Maschke's failure in modular characteristic in depth.

  • Character of a representation 07.01.03 and character orthogonality 07.01.04 — the foundational definitions of characters and the orthogonality relations live here; this depth unit proves both row and column orthogonality in full, derives the class-number theorem, and exhibits the character table as the worked example.

  • Induced representation 07.01.07 and Frobenius reciprocity 07.01.08 — induced representations and the induction–restriction adjunction are defined here and proved in the full proof set; Mackey theory and the representation-theoretic analysis of semidirect products build directly on this material.

  • Symmetric-group representations 07.05.02 and Specht modules 07.05.03 — the character table computed in the worked example is the smallest instance of the general theory of symmetric-group irreducibles indexed by Young diagrams; the representation-ring structure constants for are the Kronecker coefficients of symmetric-function theory.

  • Brauer character and block theory 07.02.04 — Maschke's sharpness hypothesis () marks the boundary of ordinary character theory; beyond it, modular representation theory replaces characters with Brauer characters and organises the category into blocks with defect groups.

  • Lang, Algebra, Ch. XVIII [foundational-home] — the Artin–Wedderburn theorem for semisimple algebras and the resulting structure theory of provide the algebraic backdrop against which the character-theoretic results of this unit are read; the group algebra dictionary between representations and modules is the unifying perspective.

Historical & philosophical context Master

The systematic theory of group characters was created by Frobenius in a burst of papers beginning in 1896. His Über Gruppencharaktere [Frobenius 1896] introduced the character of a representation as a class function and the group determinant, and derived the multiplication law for characters — the formula that makes characters a computational tool rather than a mere invariant. Frobenius arrived at characters not through representations but through the determinant of the matrix of formal variables, factoring it into irreducible factors over ; the modern definition came slightly later, clarifying what the determinant factors actually were.

Maschke supplied the complete-reducibility theorem in 1899 [Maschke 1899], proving that every finite-group representation over a characteristic-zero field splits into irreducibles. The averaging trick at the heart of his proof — summing an arbitrary projection over the group and dividing by — was already implicit in Frobenius's earlier work, but Maschke isolated the geometric content: every invariant subspace has an invariant complement. This is the result that makes the entire theory semisimple and hence tractable.

Burnside and Schur consolidated the theory in the first decade of the twentieth century. Burnside's Theory of Groups of Finite Order [Burnside 1911] gave the first textbook account and used character theory to prove the solvability theorem — historically the first demonstration that representation theory could resolve pure group-theoretic questions inaccessible to direct methods. Schur's lemma, the orthogonality relations in their modern trace-theoretic form, and the Schur index all date to Schur's work in this period.

The philosophical pivot of the whole theory is the discovery that the trace forgets almost nothing: although a representation is a great deal of data (a matrix for every group element), its character — a single complex number per conjugacy class — already determines it up to isomorphism, provided Maschke holds. This compression, from matrices to numbers, is what makes character tables practical, and the failure of the compression in the modular case is what makes modular representation theory so much harder. The representation ring packages this compression functorially, turning the category of representations into a commutative ring that braids representation theory with -theory, stable homotopy, and — for — the algebra of symmetric functions.

Bibliography Master

@book{serre1977linear,
  author = {Serre, Jean-Pierre},
  title = {Linear Representations of Finite Groups},
  series = {Graduate Texts in Mathematics},
  volume = {42},
  publisher = {Springer-Verlag},
  address = {New York},
  year = {1977}
}

@book{fulton1991representation,
  author = {Fulton, William and Harris, Joe},
  title = {Representation Theory: A First Course},
  series = {Graduate Texts in Mathematics},
  volume = {129},
  publisher = {Springer-Verlag},
  address = {New York},
  year = {1991}
}

@book{lang2002algebra,
  author = {Lang, Serge},
  title = {Algebra},
  series = {Graduate Texts in Mathematics},
  volume = {211},
  edition = {3},
  publisher = {Springer-Verlag},
  address = {New York},
  year = {2002}
}

@article{frobenius1896gruppencharaktere,
  author = {Frobenius, Ferdinand Georg},
  title = {\"Uber Gruppencharaktere},
  journal = {Sitzungsberichte der K\"oniglich Preu{\ss}ischen Akademie der Wissenschaften zu Berlin},
  year = {1896},
  pages = {985--1021}
}

@article{maschke1899beweis,
  author = {Maschke, Heinrich},
  title = {Beweis des Satzes, dass diejenigen endlichen linearen Substitutionsgruppen, in welchen einige durchgehends verschwindende Coefficienten auftreten, intransitiv sind},
  journal = {Mathematische Annalen},
  volume = {52},
  number = {3},
  pages = {363--368},
  year = {1899}
}

@book{burnside1911theory,
  author = {Burnside, William},
  title = {Theory of Groups of Finite Order},
  edition = {2},
  publisher = {Cambridge University Press},
  address = {Cambridge},
  year = {1911}
}

@book{isaacs1976character,
  author = {Isaacs, I. Martin},
  title = {Character Theory of Finite Groups},
  publisher = {Academic Press},
  address = {New York},
  year = {1976},
  note = {Reprinted by Dover Publications, 1994}
}

@book{feit1967characters,
  author = {Feit, Walter},
  title = {Characters of Finite Groups},
  publisher = {W. A. Benjamin},
  address = {New York},
  year = {1967}
}

@book{curtis1999pioneers,
  author = {Curtis, Charles W.},
  title = {Pioneers of Representation Theory: Frobenius, Burnside, Schur, and Brauer},
  series = {History of Mathematics},
  volume = {15},
  publisher = {American Mathematical Society},
  address = {Providence, RI},
  year = {1999}
}