07.02.04 · representation-theory / character

Brauer character

shipped3 tiersLean: none

Anchor (Master): Brauer 1935 Math. Ann. 110; Curtis-Reiner Methods of Representation Theory Vol. I; Navarro Character Theory and the McKay Conjecture; Linckelmann Block Theory of Finite Group Algebras

Intuition [Beginner]

An ordinary character records the trace of a representation at each group element, yielding a complex-valued function on the group. When the field has positive characteristic dividing , the trace still exists but loses information: for instance, the trace of a matrix over is an element of , which cannot distinguish between and . Brauer characters fix this by lifting eigenvalues from the finite field to complex numbers before taking the trace.

The key insight is that the eigenvalues of a group element acting on a representation are roots of unity, and roots of unity in characteristic can be lifted uniquely to roots of unity in characteristic zero. A Brauer character is defined only on -regular elements (group elements of order coprime to ), because only on these elements are the eigenvalues semisimple (diagonalisable).

Why does this concept exist? Brauer characters rescue the character-theoretic approach from the failure of Maschke's theorem. They provide a complete invariant for modular representations --- two -modules are isomorphic if and only if they have the same Brauer character on all -regular elements --- and satisfy orthogonality relations analogous to the ordinary case.

Visual [Beginner]

A two-column table. The left column lists the -regular conjugacy classes of (group elements whose order is coprime to ). The right column shows the Brauer character values: complex numbers obtained by lifting eigenvalues from the finite field to . The table has fewer rows than the ordinary character table (only -regular classes) but carries the essential information about modular representations.

A Brauer character table for a finite group, with rows indexed by irreducible Brauer characters and columns indexed by p-regular conjugacy classes.

The Brauer character table is the modular analogue of the ordinary character table: it records complete information about representations over the field of characteristic .

Worked example [Beginner]

Consider (symmetric group on 3 elements) and the prime .

The 3-regular elements of are those of order coprime to 3: the identity and the transpositions . The 3-cycles have order 3 and are excluded. So there are two 3-regular conjugacy classes: and .

Step 1. Over , the group has two irreducible representations: the identity representation (every element acts as 1) and a 2-dimensional simple representation. The sign representation over coincides with the identity representation because , and the transpositions act by 1.

Step 2. The Brauer character of the identity representation : at , the trace is 1. At a transposition, the matrix is the identity, with eigenvalue 1. Lifting to : , .

Step 3. The Brauer character of the 2-dimensional simple : at , the trace is 2. At a transposition , the matrix has eigenvalues 1 and in (lifted from where ). So .

Step 4. The Brauer character table for at has two rows () and two columns (3-regular classes):

1 1
2 0

What this tells us: the Brauer character table captures the modular representation theory of at in a table. The ordinary character table of is , losing one row in the passage to positive characteristic.

Check your understanding [Beginner]

Formal definition [Intermediate+]

Let be a finite group, a prime dividing , and a -modular system. Fix an isomorphism between the groups of roots of unity of order coprime to in and in (the Teichmuller lift).

An element is -regular if its order is coprime to .

Definition (Brauer character). Let be a finitely generated -module and a -regular element. The action of on is semisimple (since the order of is coprime to and ). Let be the eigenvalues of acting on (viewed in an algebraic closure). The Brauer character of at is:

where each eigenvalue is a root of unity of order coprime to and is its Teichmuller lift to . The function (where denotes the set of -regular elements) is the Brauer character of .

Key properties.

  • is a class function on : constant on conjugacy classes of -regular elements.
  • (the degree).
  • If is a short exact sequence of -modules, then on .
  • Two finitely generated -modules are isomorphic if and only if their Brauer characters agree on all -regular elements.

Counterexamples to common slips

  • Brauer characters are not defined on -singular elements. For an element of order divisible by , the action of on a -module need not be semisimple, and the Jordan normal form may have non-diagonal blocks, making eigenvalue lifting ambiguous.

  • The Brauer character is not the reduction mod of an ordinary character. Rather, the ordinary character of a lift to restricts to the Brauer character on -regular elements: if is the ordinary character of a -module and is the Brauer character of its reduction mod , then for all -regular .

  • Brauer characters take values in characteristic zero, not in . The whole point is to lift from positive characteristic to characteristic zero where the arithmetic of traces is well-behaved.

Key theorem with proof [Intermediate+]

Theorem (Brauer character basis theorem). The Brauer characters of the simple -modules form a basis for the space of -valued class functions on . In particular, the number of simple -modules equals the number of -regular conjugacy classes of .

Proof. Let denote the number of -regular conjugacy classes of . The space of -valued class functions on has dimension (one basis vector for each -regular class).

Step 1: The number of simple modules is at most . The Brauer characters are class functions on (since conjugate elements have the same eigenvalue multiset). By the Jordan-Holder theorem, the classes of simple modules form a basis for as a free abelian group, so the Brauer characters of distinct simple modules are distinct (two simple modules with the same Brauer character are isomorphic). So .

Step 2: The decomposition map gives an injective map. The decomposition map from 07.02.03 sends the ordinary character to the Brauer character on . The ordinary characters are linearly independent as class functions on (by ordinary character orthogonality 07.01.04), hence their restrictions to are elements of .

The images span (since is surjective by the Brauer-Nesbitt lemma). Each is a -linear combination of . So span ... but this requires .

Step 3: An explicit inner product. Define the Brauer inner product on :

where is the -part of (the order of the centraliser). By the modular orthogonality relations:

for the Brauer characters of simple -modules. This orthogonality proves linear independence: if , then .

Step 4: Conclusion. Since are linearly independent in the -dimensional space , we have . Since is surjective and the images are non-negative integer combinations of that span , we also have . So , and is a basis.

Bridge. The basis theorem builds toward the block theory of 07.02.03, where the decomposition matrix and Cartan matrix encode the relationship between ordinary and modular characters, and appears again in 07.01.04, whose orthogonality relations are the prototype for the Brauer orthogonality used here. The foundational reason is that lifting eigenvalues from characteristic to characteristic zero preserves enough information to classify modular representations, and this is exactly the bridge from ordinary character theory to modular representation theory. Putting these together, the Brauer character table is the modular counterpart of the ordinary character table, with rows indexed by modular irreducibles and columns by -regular classes.

Exercises [Intermediate+]

Advanced results [Master]

Theorem 1 (Decomposition matrix). The decomposition matrix is the integer matrix with equal to the multiplicity of the simple module as a composition factor of the reduction mod of the ordinary irreducible . The Brauer characters satisfy on .

Theorem 2 (Cartan matrix and Brauer reciprocity). The Cartan matrix records the composition factors of the projective indecomposable modules. The entries give the multiplicity of in the projective cover . Brauer reciprocity (see 07.02.03) identifies decomposition numbers with the entries of .

Theorem 3 (Block decomposition). The group algebra decomposes as where each is a block (indecomposable two-sided ideal). Each block contains some ordinary irreducibles and some modular irreducibles, and the decomposition matrix and Cartan matrix decompose into block-diagonal form.

Theorem 4 (Defect groups). Each block has a defect group , a -subgroup of unique up to conjugacy, measuring the complexity of the block. Blocks of defect 0 correspond to ordinary characters that remain irreducible mod (Cartan matrix ). Blocks of maximal defect are the most complex.

Theorem 5 (Brauer-Nesbitt lemma). Two -modules have the same Brauer character if and only if they have the same composition factors (the same element of ). This is the modular analogue of the statement that ordinary characters determine representations up to isomorphism.

Theorem 6 (Ordinary character restriction). For any ordinary irreducible character and -regular element : , where is the Brauer character of the reduction. The restriction of to determines the reduction of modulo .

Theorem 7 (Webber's theorem on the Brauer tree). For a block with cyclic defect group, the Brauer characters of the modular irreducibles can be organised into a graph called the Brauer tree, which completely determines the block structure. The tree has the exceptional vertex (if any) and ordinary characters as edges.

Synthesis. The Brauer character is the foundational tool that makes modular representation theory computable: it extends the character-theoretic methods from characteristic zero to positive characteristic by lifting eigenvalues. The central insight is that the -regular elements carry enough information to classify all modular representations, and this is exactly the bridge between the ordinary character table and the modular theory. Putting these together with the cde-triangle of 07.02.03, the decomposition matrix records how ordinary characters reduce to Brauer characters, and the Cartan matrix measures the deviation from semisimplicity. The pattern generalises to blocks with defect groups 07.02.03, where the Brauer tree theorem classifies blocks with cyclic defect, and the bridge is the identification of modular representations with projective modules via the Cartan map.

Full proof set [Master]

Proposition 1 (Brauer-Nesbitt lemma). Two finitely generated -modules have the same Brauer character if and only if they have the same composition factors.

Proof. () If and have the same composition factors (same element of ), then for each -regular , the eigenvalues of on and are the same (counted with multiplicity in the composition series), so .

() By induction on . If and is simple, then is a composition factor of (since and means appears in the composition series of ). Remove one copy of from both and continue.

More precisely: let be a simple submodule of . Then . Since and is a Brauer character of a simple module, must appear as a composition factor of with at least the same multiplicity. Proceed by induction.

Proposition 2 (Semisimplicity on -regular elements). For any -regular element and any finitely generated -module , the action of on is semisimple.

Proof. The element has order coprime to . Since and , the polynomial is separable over (its derivative is nonzero since in ). So the minimal polynomial of acting on divides , which is separable, hence the minimal polynomial has no repeated roots. A linear operator whose minimal polynomial has no repeated roots is diagonalisable, hence semisimple.

Connections [Master]

  • Grothendieck groups and the cde-triangle 07.02.03. The Brauer character is the concrete realisation of the decomposition map at the level of class functions. The cde-triangle organises the relationship between ordinary characters, Brauer characters, and projective modules.

  • Maschke's theorem 07.02.01. Brauer characters exist precisely where Maschke fails: in characteristic dividing , representations are no longer atomic, and Brauer characters provide the invariant that replaces ordinary characters in this non-semisimple setting.

  • Character orthogonality 07.01.04. The ordinary orthogonality relations have a modular analogue: Brauer characters satisfy orthogonality on -regular elements. The formula is the same in spirit but weighted by the -part of the centraliser orders, and the Gram matrix is the inverse of the Cartan matrix.

  • Character of a representation 07.01.03. The ordinary character restricts to the Brauer character on -regular elements: for -regular . The Brauer character is the shadow that the ordinary character casts on the modular world.

Historical & philosophical context [Master]

Richard Brauer introduced Brauer characters in his 1935 paper Uber die Darstellung von Gruppen in Galoisschen Feldern (Math. Ann. 110) [Brauer1935], which launched modular representation theory as a systematic discipline. Brauer's insight was that the eigenvalue-lifting construction recovers enough information from the modular setting to build a character theory paralleling the ordinary one. The orthogonality relations for Brauer characters appeared in Brauer and Nesbitt's 1937 University of Toronto study, and the block theory (with defect groups and the Brauer tree) was developed by Brauer through the 1940s--60s.

The block theory was systematised by Curtis and Reiner in their two-volume Methods of Representation Theory (1981--87) [CurtisReiner1981], and the modern derived-equivalence approach is due to Rickard (1989) and Linckelmann (2018) [Linckelmann2018], whose The Block Theory of Finite Group Algebras (Cambridge University Press) is the current definitive reference.

Bibliography [Master]

@article{Brauer1935,
  author = {Brauer, Richard},
  title = {Uber die Darstellung von Gruppen in {Galoisschen} Feldern},
  journal = {Math. Ann.},
  volume = {110},
  year = {1935},
  pages = {417--449},
}

@book{Serre1977,
  author = {Serre, Jean-Pierre},
  title = {Linear Representations of Finite Groups},
  publisher = {Springer},
  year = {1977},
}

@book{CurtisReiner1981,
  author = {Curtis, Charles W. and Reiner, Irving},
  title = {Methods of Representation Theory: With Applications to Finite Groups and Orders},
  publisher = {Wiley},
  year = {1981},
  volume = {I},
}

@book{Navarro1998,
  author = {Navarro, Gabriel},
  title = {Characters and Blocks of Finite Groups},
  publisher = {Cambridge University Press},
  year = {1998},
}

@book{Linckelmann2018,
  author = {Linckelmann, Markus},
  title = {The Block Theory of Finite Group Algebras},
  publisher = {Cambridge University Press},
  year = {2018},
  volume = {I},
}