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.
Nilpotent representations of the Jordan quiver
Definition
The Jordan quiver has one vertex and one loop, labelled :
A finite-dimensional representation over a field is a pair , where is a finite-dimensional -vector space and is nilpotent (Nilpotent endomorphisms and their nilpotency index). A morphism is a linear map satisfying , encoded by the commutative square
For this page, denotes the small model whose objects are , for , with a nilpotent matrix, and whose morphisms are all matrices intertwining the endomorphisms. Every finite- dimensional vector space is isomorphic to a standard , so the model represents all finite-dimensional nilpotent representations. For any field , write for the one-dimensional object and for the length- Jordan block, using Jordan blocks, Jordan strings, and their endpoints. For a partition (Partitions, English diagrams, and conjugation), write for the block-diagonal representation with blocks . Use for the zero object.
Depends on
Used by
- The degree-two Jordan-quiver Hall product Example
- Jordan-quiver categories are abelian; finite-field models are finitary Lemma
- Jordan-quiver isomorphism classes are indexed by partitions Lemma
- The generic Jordan Hall regular module carries the normalized Heisenberg Fock action Theorem
- The generic Jordan-quiver Hall algebra is the symmetric-function ring Theorem
Dependency tree · two levels
8 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
- Olivier Schiffmann, Lectures on Hall Algebras, arXiv:math/0611617v2, §2.1 (standard reference, not scraped)