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's Second Main Theorem
Statement
Assume the Axiom of Choice. Let be a splitting -modular system for a finite group , with algebraically closed. Let be a block of , let , let be a -element, and put . If is a block of and , then Equivalently, for every -regular ,
Facts & Assumptions
Given: AC and the modular system, block, character, -element, local block, and Brauer character in the Statement.
Generalized decomposition numbers give the unique full expansion of on the -regular elements of (Generalized decomposition numbers exist and are unique).
The induced local block is defined by the subsection convention (Brauer subsections and B-subsections).
If , the lifted -component of the restricted character vanishes at every under the algebraically closed residue-field hypothesis (Local block projection controls p-section character support and An algebraically closed field: every nonconstant polynomial has a root in the field).
Ordinary and Brauer irreducibles lie in unique blocks, and ordinary decomposition numbers between distinct blocks are zero (Blocks partition the ordinary and Brauer irreducible characters and After block ordering, the decomposition matrix is block diagonal).
The irreducible Brauer characters of are linearly independent on its -regular elements (Irreducible Brauer characters form a basis of the p-regular class functions).
AC is available (The Axiom of Choice) and is used through the AC-stated subsection and local-projection suppliers F2–F3. The basis partition and all sums below are finite.
Proof
Write the ordinary restriction as For a block of , its lifted idempotent selects exactly the ordinary constituents in , so On -regular , expand each by ordinary decomposition numbers. F4 deletes all terms outside the block . Conversely, in the defining formula for with , F4 deletes every outside . Therefore for every -regular .
Suppose . F3 makes the left side of the last display zero for every -regular . Linear independence in F5 then gives for every . The contrapositive is the asserted support implication.
F1 gives the full expansion where F4 partitions the Brauer basis by its unique blocks. Step 2.1 deletes exactly the summands with and proves the displayed restricted formula in the Statement. Conversely, if that restricted formula holds, subtracting it from F1's full expansion and applying F5 block by block forces every coefficient in a noninducing block to be zero, recovering the support implication.
When , one has , , and ; the theorem becomes ordinary block diagonality from F4. Empty local Brauer-character sets contribute empty sums, and no converse asserting that a permitted coefficient is nonzero has been used. Algebraic closedness and AC enter exactly through F2–F3.
Depends on
- Generalized decomposition numbers exist and are unique
- Brauer subsections and B-subsections
- Local block projection controls p-section character support
- Blocks partition the ordinary and Brauer irreducible characters
- After block ordering, the decomposition matrix is block diagonal
- Irreducible Brauer characters form a basis of the p-regular class functions
- An algebraically closed field: every nonconstant polynomial has a root in the field
- The Axiom of Choice
Used by
Dependency tree · two levels
30 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, Theorems 1.19 and 2.22, pp. 14 and 29–30 (standard reference, not scraped)
- Meierfrankenfeld, MTH 912 Class Notes, Theorem 6.7.15 and Corollary 6.7.16, pp. 169–171 (standard reference, not scraped)
- Aschbacher–Kessar–Oliver, Fusion Systems in Algebra and Topology, Theorems 5.4–5.5, pp. 276–278 (standard reference, not scraped)