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 reciprocity
Statement
Let be an irreducible Brauer character. Its projective cover has a projective -lattice lift , unique up to the ordinary character it affords. If that character is , then for every ordinary irreducible character the multiplicity of in equals the decomposition number .
Facts & Assumptions
Given: An ordinary irreducible character and an irreducible Brauer character .
The decomposition number is the multiplicity of the simple module in the reduction of a stable lattice affording (Decomposition numbers and the decomposition matrix).
Those multiplicities are nonnegative integers (Decomposition numbers are nonnegative integers).
Projective covers and projective indecomposable characters are attached to the simple -modules as in Projective indecomposable characters and Cartan invariants.
In a splitting -modular system, is a complete discrete valuation ring (A splitting p-modular system for a finite group is a p-modular system whose fraction and residue fields split the needed group algebras).
Proof
Write as the image of an idempotent matrix over . Because is complete by [F3], idempotents lift through the ideal . A lifted idempotent has image a projective -lattice whose reduction is .
Let be a stable lattice affording . Since is projective, formation of from it commutes with extension to and reduction to . Hence The left side is the multiplicity of in the split semisimple module .
The functor is exact, and on a simple module it has dimension for and otherwise, because every map from to a simple module factors through its head . The right side of step 2.1 is therefore the composition multiplicity of in , namely by [F1].
Thus the multiplicity of every in the ordinary character of is . These coefficients depend only on , so the character is independent of the chosen lift and equals .
Depends on
Used by
- The Cartan matrix is D^T D Theorem
Cited to discharge well-definedness by Projective indecomposable characters and Cartan invariants.
Dependency tree · two levels
11 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
- J. Miquel Martinez, Modular Representation Theory of Finite Groups (standard reference, not scraped)
- Peter Webb, A Course in Finite Group Representation Theory, Sections 7.3 and 9.4 (standard reference, not scraped)
- Tudor Ciurca, Representation Theory (standard reference, not scraped)