Character theory

Character theory
Name	Character theory
Field	Representation theory
Related	Group theory, Linear algebra, Number theory

Character theory is the study of complex-valued class functions associated with linear representations of finite groups, tracing roots through the work of Ferdinand Georg Frobenius, Issai Schur, William Burnside, and Richard Brauer. It connects explicit computations for groups like Symmetric group S_n, Alternating group A_n, Dihedral group D_n, Cyclic group C_n with structural results surrounding Simple group, Solvable group, p-group, and Finite simple group. Techniques from Linear algebra, Complex analysis, Algebraic number theory, and Combinatorics are central, and tools such as character tables and orthogonality relations enable classification tasks and applications in areas influenced by Évariste Galois's ideas.

Introduction

Character theory formalizes the passage from a linear representation over the complex numbers to a function on conjugacy classes known as the character, following foundational contributions by Ferdinand Georg Frobenius, Issai Schur, William Burnside, and later expansions by Richard Brauer and John G. Thompson. For a finite group acting on a complex vector space via a homomorphism into GL_n(C), characters record traces of matrices and are constant on conjugacy classes; their arithmetic properties involve algebraic integers studied by Richard Dedekind and Ernst Kummer. The subject interfaces with explicit examples such as representations of Symmetric group S_n, permutation modules for Alternating group A_n, and representations arising from actions of Dihedral group D_n and Cyclic group C_n.

Characters of Finite Groups

An ordinary character arises from a finite-dimensional complex representation of a group such as Symmetric group S_n, Alternating group A_n, General linear group GL_n(F_q), or Special linear group SL_2(F_q). Irreducible characters correspond to irreducible modules whose classification in many cases relies on combinatorial objects developed by Alfred Young and George Mackey, including Young tableau for Symmetric group S_n and branching rules related to Littlewood–Richardson rule. The degrees of irreducible characters reflect divisibility constraints from the group's order by results of William Burnside and interplay with subgroup structure studied by Frobenius and Claude Chevalley. Modular restrictions and lifting problems lead naturally to the work of Richard Brauer and connections with Alperin's weight conjecture and conjectures of Daniel Gorenstein and John G. Thompson on Finite simple group classification.

Orthogonality Relations and Character Tables

The orthogonality relations, proved by Ferdinand Georg Frobenius and Issai Schur, give inner-product formulas for rows and columns of the character table used for groups like Symmetric group S_n, Alternating group A_n, Dihedral group D_n, and Cyclic group C_n. Character tables, assembled for groups such as Mathieu group M_24, Monster group, Janko group J1, and Higman–Sims group, encode deep structural information and were crucial in the classification program of Finite simple group. Computational projects by Atlas of Finite Groups contributors and software like GAP and Magma (software) produce explicit tables, enabling applications to problems studied by Emil Artin, Richard Brauer, and John Conway. Column orthogonality links conjugacy class sizes to character degrees, reflecting divisibility properties used in proofs by William Burnside and later by Walter Feit and John G. Thompson.

Induced Characters and Frobenius Reciprocity

Induction and restriction, formalized in Frobenius's work and later elaborated by George Mackey and I. M. Isaacs, allow characters to pass between a subgroup such as a Sylow subgroup or Borel subgroup and the ambient group, as in constructions for Symmetric group S_n or General linear group GL_n(F_q). Frobenius reciprocity equates inner products after induction and restriction and underlies methods used by Frobenius, Issai Schur, and Richard Brauer to analyze blocks and defect groups in modular representation theory. Mackey's subgroup theorem, applied by researchers like G. D. James and G. Lusztig, organizes induced representations and contributes to the study of characters for groups of Lie type such as GL_n(F_q) and SL_n(F_q). Techniques of Harish-Chandra induction further connect with work by Harish-Chandra on harmonic analysis for p-adic group analogues.

Applications and Connections

Character theory has broad applications: proofs of Burnside's p^a q^b theorem and criteria for solvability by William Burnside and Frobenius; enumeration problems and combinatorics tied to Alfred Young and Richard Stanley; symmetry and spectral analysis in chemistry and physics via character tables used by practitioners influenced by Linus Pauling and Michael Tinkham; and moonshine phenomena linking the Monster group with modular functions studied by John Conway and Simon Norton. It informs number-theoretic topics studied by Hecke and Erich Hecke analogues, representation-theoretic approaches in algebraic geometry by Pierre Deligne and George Lusztig, and computational group theory advanced by GAP and the Atlas of Finite Groups project. Connections with homological algebra and cohomology theories appear in work of Jean-Pierre Serre and J. L. Alperin.

Representations over Other Fields

Passing to representations over fields of positive characteristic leads to modular representation theory developed by Richard Brauer, Alperin, and G. D. James; block theory, Brauer characters, and defect groups shape the classification of modules for groups like Symmetric group S_n and General linear group GL_n(F_q). Integral representations and lattices tie into arithmetic handled by Richard Dedekind and Emmy Noether, while representations over local fields and p-adic group analogues engage work by Harish-Chandra and George Lusztig. Modern advances relate to derived equivalences conjectured by Michel Broué and categorical frameworks developed by Raphaël Rouquier, with computational aspects explored in GAP and Magma (software).

Category:Representation theory