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.
Jordan-quiver isomorphism classes are indexed by partitions
Statement
Every object of is isomorphic to a unique direct sum , where is a partition. The unique simple object is .
Facts & Assumptions
Given: A field and a finite-dimensional vector space with a nilpotent endomorphism , defining an object of .
Every finite-dimensional nilpotent endomorphism has a basis that is a concatenation of Jordan strings, including the empty basis on the zero space (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings).
For a nilpotent endomorphism, the numbers of Jordan blocks of each size are determined by the ranks of its powers (Ranks of shifted powers determine Jordan form up to block order).
In a Jordan string of length , and for ; its matrix is (Jordan blocks, Jordan strings, and their endpoints).
A partition is a finite weakly decreasing sequence of positive integers; its parts record a multiset uniquely (Partitions, English diagrams, and conjugation).
is a category whose objects and morphisms are finite-dimensional nilpotent representations and their intertwiners (Nilpotent representations of the Jordan quiver).
Here a simple object means a nonzero object whose only subobjects are the zero subobject and the identity subobject.
Subobjects in correspond to invariant subspaces, via their images (Jordan-quiver categories are abelian; finite-field models are finitary).
Proof
Apply [F1] to . The spans of its Jordan strings are invariant, their concatenation is a basis of , and by [F3] each span is isomorphic as a representation to the block whose length is that string's length. Sorting these finitely many positive lengths weakly decreasing gives a partition by [F4] and an isomorphism . The zero space gives the empty partition.
If , the intertwining isomorphism conjugates their nilpotent matrices, so the ranks of every power agree. By [F2], the multiplicities of blocks of each length agree; hence the multisets of parts and the partitions are equal.
If a string has length , the span of its initial vector is a nonzero proper invariant subspace, hence a proper nonzero subobject by [F7]; therefore is not simple by [F6]. The object is nonzero and has only the zero and whole subspaces, so it is simple by [F6] and [F7]. Any decomposition in step 1.1 with at least two summands has a proper nonzero invariant summand and hence is not simple. A single summand is simple only when it has length one. Thus is the unique simple object.
Depends on
- Nilpotent representations of the Jordan quiver
- Jordan-quiver categories are abelian; finite-field models are finitary
- Partitions, English diagrams, and conjugation
- Jordan blocks, Jordan strings, and their endpoints
- Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings
- Ranks of shifted powers determine Jordan form up to block order
Used by
Dependency tree · two levels
20 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)
- S. Treil, Linear Algebra Done Wrong, Chapter 9, Theorems 4.2–4.3 (standard reference, not scraped)