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.
The Cartan matrix is D^T D
Statement
If is the decomposition matrix and is the Cartan matrix, then
Equivalently,
Facts & Assumptions
Given: The decomposition matrix and the Cartan matrix of at .
The Cartan invariants record composition multiplicities in projective covers (Projective indecomposable characters and Cartan invariants).
Brauer reciprocity identifies with the multiplicity of in the projective indecomposable character (Brauer reciprocity).
The decomposition map is additive on ordinary representation classes, sends the class afforded by to , and sends the projective lattice lift affording to (Decomposition numbers and the decomposition matrix, Projective indecomposable characters and Cartan invariants).
Proof
Fix . Decompose the projective indecomposable character as by [L1].
The Cartan entry is the multiplicity of in the projective cover by [F1]. Apply the decomposition map [F2] to the ordinary-character expansion in step 1.1. Its left side becomes , while the right side becomes . Comparing coefficients of gives
This is exactly the entry of , so .
Depends on
Used by
- A Cartan matrix computed from D^T D Example
- FALSE: the Cartan matrix equals the decomposition matrix False statement
- Weight-zero symmetric-group blocks are defect zero Proposition
Dependency tree · two levels
10 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)