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.
Irreducible, completely reducible, and faithful representations
Definition
A nonzero representation is irreducible if its only stable linear subspaces are and .
A representation is completely reducible if it is isomorphic, as a representation, to an algebraic direct sum
of irreducible representations, where elements have finite support. This is a definition, not an assertion that every representation has such a decomposition. The zero representation is the empty direct sum and is therefore completely reducible under this convention.
A representation is faithful if is injective.
Depends on
Used by
Dependency tree · two levels
6 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
- Etingof, MIT 18.745 notes, §11.1, printed pp. 61–62 (standard reference, not scraped)
- Kirillov, An Introduction to Lie Groups and Lie Algebras, §4.3, printed pp. 52–53 (standard reference, not scraped)