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.
Decomposition numbers are nonnegative integers
Statement
Every decomposition number is a nonnegative integer.
Facts & Assumptions
Given: An ordinary irreducible character and an irreducible Brauer character .
The decomposition numbers are the coefficients of the simple-module expansion of the reduction of a stable lattice (Decomposition numbers and the decomposition matrix).
Proof
By [F1], is the multiplicity of the simple module among the composition factors of the reduced lattice representing .
A composition multiplicity counts how many times a simple factor occurs, so it is an integer and cannot be negative. Hence .
Therefore all decomposition numbers are nonnegative integers.
Depends on
Used by
- Brauer reciprocity Theorem
Dependency tree · two levels
4 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)
- Tudor Ciurca, Representation Theory (standard reference, not scraped)