Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Brauer-Nesbitt determines semisimplifications

Statement

Let V and W be finite-dimensional kG-modules over a splitting field of characteristic p. Then

φV=φW

if and only if the semisimplifications Vss and Wss are isomorphic.

Facts & Assumptions

Given: Finite-dimensional kG-modules V and W.

[L1]

Brauer characters are additive on short exact sequences (Brauer characters are additive on short exact sequences).

[L2]

The irreducible Brauer characters form a basis of the complex vector space of class functions on G0 (Irreducible Brauer characters form a basis of the p-regular class functions).

Proof

technique · iff
1.1

Repeatedly applying [L1] along a composition series of V shows that φV is the sum of the irreducible Brauer characters of the composition factors of V, counted with multiplicity. The same holds for W.

L1givenalgebra
2.1

If VssWss, then V and W have the same irreducible composition factors with the same multiplicities. Step 1.1 then gives φV=φW.

step 1.1
2.2

Conversely, suppose φV=φW. Subtracting the two expansions from step 1.1 gives a linear relation among irreducible Brauer characters. By [L2], those characters are linearly independent, so every coefficient is 0. Hence the composition multiplicities in V and W agree, and therefore VssWss.

L2step 1.1algebra
3.1

Steps 2.1 and 2.2 prove the equivalence.

step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources