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.
Projective indecomposable characters and Cartan invariants
Definition
For each irreducible Brauer character , let be the corresponding simple -module and let be its projective cover. The module is an indecomposable projective -module, and these exhaust the indecomposable projectives up to isomorphism.
Choose a projective -lattice whose reduction is . Its ordinary character is called the projective indecomposable character attached to . The existence of such a projective lift and the independence of its ordinary character are proved in Brauer reciprocity ↗.
For irreducible Brauer characters , the multiplicity of as a composition factor of is denoted . The matrix is the Cartan matrix of at .
Depends on
Used by
- Brauer reciprocity Theorem
- The Cartan matrix is D^T D Theorem
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)
- Tudor Ciurca, Representation Theory (standard reference, not scraped)