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.
Generalized decomposition numbers exist and are unique
Statement
Fix a splitting -modular system for a finite group . For every and every -element , there is a unique family
such that, for every -regular ,
Writing and , these unique coefficients are
In particular, .
Facts & Assumptions
Given: The splitting system, , , and in the Statement.
Generalized decomposition numbers defines the displayed finite sum, including the scalar .
Maschke's theorem gives complete reducibility over the characteristic- field (Maschke's theorem for finite groups over fields whose characteristic does not divide ).
Schur's lemma makes a central group element an endomorphism of every irreducible constituent (Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and is a division ring); the scalar conclusion here is supplied by the splitting-field clause recorded in F1.
On -regular elements, an ordinary irreducible character is the sum of irreducible Brauer characters with its ordinary decomposition numbers (Decomposition numbers and the decomposition matrix).
A Brauer-character value is an element of obtained as a sum of Teichmüller lifts of prime-to- roots of unity (Brauer character of a finite-dimensional kG-module).
Under the standard complex realization of those prime-to- roots, irreducible Brauer characters form a basis of the complex class functions on the -regular elements (Irreducible Brauer characters form a basis of the p-regular class functions).
Proof
By F2, restriction to gives the finite decomposition . Since , its representing operator commutes with ; F3 and the splitting condition give . Moreover , so without any algebraic-closedness assumption.
Let be -regular. Because and commute, trace gives By F4, . Substitution into the restriction formula and reordering its finite sums yields The coefficient in parentheses is exactly by F1.
Let represent the -regular conjugacy classes of , and list the irreducible Brauer characters as ; equality of the two cardinalities follows from [F6]. By [F5], the evaluation matrix has entries in the cyclotomic subfield generated by the Teichmüller lifts that occur. Applying the standard complex realization entrywise gives the Brauer-character table from [F6], whose determinant is nonzero by complex linear independence. Hence already in that cyclotomic subfield, and therefore is invertible over . If another family in gave the same values, subtraction would yield ; invertibility forces . This proves uniqueness without applying a complex-linear independence assertion directly to -coefficients.
If , then , the restriction has only the constituent with multiplicity one, and . The formula in F1 becomes . The case in step 2.1 is valid and gives the corresponding value at . All decompositions and sums are finite, so no choice principle is used.
Depends on
- Generalized decomposition numbers
- Maschke's theorem for finite groups over fields whose characteristic does not divide $|G|$
- Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and $\operatorname{End}_G(V)$ is a division ring
- Decomposition numbers and the decomposition matrix
- Brauer character of a finite-dimensional kG-module
- Irreducible Brauer characters form a basis of the p-regular class functions
Used by
- Brauer's Second Main Theorem Theorem
Dependency tree · two levels
21 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
- Craven, The Brauer Correspondence, section 1.5 and construction preceding Theorem 1.19, pp. 13–14 (standard reference, not scraped)
- Aschbacher–Kessar–Oliver, Fusion Systems in Algebra and Topology, Part IV, pp. 277–278 (standard reference, not scraped)