Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Finite loopless quiver nilpotent representation categories are hereditary and finitary

Statement

Let Q be a finite loopless quiver over Fq. If Q has oriented cycles, take the abelian category of finite-dimensional nilpotent representations; if Q is acyclic, take all finite-dimensional representations. In either case the indicated representation category is essentially small; let AQ be the explicit small skeleton constructed in the proof. This skeleton is a finite-field hereditary Hall category. Its simple objects are Si, K0≅ZQ0 by dimension vector, and dim⁡FqYExt⁡1(Si,Sj)=cij for arrows i→j.

Facts & Assumptions

Given: A finite loopless quiver Q, the finite field k=Fq, and the category of its finite-dimensional nilpotent representations. Nilpotent means that some integer n≥1 kills the composite along every path of length n.

[F1]

The target Hall-category conditions are those of Finite-field hereditary Hall categories and Small finitary abelian categories for Hall multiplication. In particular, heredity here means vanishing of endpoint-fixed Yoneda two-extension classes, rather than a resolution assertion.

[F2]

A two-fold splice is zero if its second short extension is the pushout of an extension by the first middle object (A zero Yoneda splice factors through the middle object).

[F3]

The Grothendieck-group relation is [B]=[A]+[C] for each short exact sequence (Grothendieck group of an essentially small abelian category). Baer addition is the diagonal-pullback/codiagonal-pushout operation of The Baer sum of extension classes and Baer sum makes extension classes an abelian group.

Proof

technique · direct
1.1givenconstruct

Kernels and cokernels of representation maps are formed at each vertex; the induced arrow maps satisfy the abelian identities vertexwise. Subrepresentations and quotients of a representation killed by all paths of length n have the same property. If 0→U→V→W→0 is vertexwise exact and all length-r paths kill U while all length-s paths kill W, then any length-s path sends V into U, and the next r arrows kill it. Thus all length-(r+s) paths kill V. Consequently nilpotent finite-dimensional representations are closed under kernels, cokernels, and extensions, and form an abelian k-linear category. This quantitative bound applies to every extension constructed below.

2.1F1step 1.1construct

Fix an ordering of the finite field and of the finite vertex and arrow sets. For each dimension vector d, use the fixed spaces kdi and list the finitely many arrow-matrix tuples. Keep the nilpotent tuples and the lexicographically least member of each orbit under the finite group ∏iGL⁡di(k). Their union over d∈NQ0, with all commuting families of matrices as morphisms, is the supplied small skeleton AQ. Isomorphisms to representatives may also be chosen as the least in the corresponding finite matrix sets, so transporting kernels, cokernels, and biproducts to it needs no infinite choice. We use this small abelian model when applying [F1]. Hom spaces are subspaces of the finite-dimensional vector space ⨁iHom⁡k(Vi,Wi).

2.2F3step 1.1constructalgebra

For fixed nilpotent V,W, split a short extension vertexwise, using bases in finitely many finite-dimensional vector spaces. Each arrow a:i→j then acts on Wi⊕Vi by the block matrix (Waξa0Va) with ξa:Vi→Wj. Conversely every tuple (ξa) defines a representation extension because a quiver representation has no relations beyond the specified compositions of arrows. It is nilpotent by step 1.1, independently of the tuple. Changing the vertex sections by maps θi:Vi→Wi changes the tuple by d(θ)a=Waθi−θjVa. Every endpoint-fixed isomorphism is exactly such a change of sections. Hence YExt⁡1(V,W) is identified with coker⁡(d:⨁iHom⁡k(Vi,Wi)→⨁a:i→jHom⁡k(Vi,Wj)). Under [F3], Baer sum adds arrow tuples and pushout along λid⁡W multiplies them by λ. This proves that the prescribed extension operations give a finite-dimensional k-space.

2.3F3step 1.1constructalgebra

The vertex representations Si are simple. Every nonzero nilpotent representation has a subobject isomorphic to some Si: among all nonzero images of nonzero vectors under paths choose one of greatest path length, which exists because sufficiently long paths vanish. Its terminal vector is killed by every outgoing arrow, so its one-dimensional span at that vertex and zero at the other vertices is the required subrepresentation. In a simple representation this is the whole object. Total vector-space dimension strictly decreases on a proper quotient, giving a finite composition series with factors among the Si. Counting vertex dimensions along it and using [F3] gives [V]=∑idim⁡k(Vi)[Si]. The dimension-vector map is additive on short exact sequences and sends these classes to the standard basis, so it is inverse to the map ZQ0→K0 taking that basis to [Si].

3.1step 1.1step 2.2construct

Consider an arbitrary two-extension 0→A→B→D→X→0 in the nilpotent category. Its image C⊂D gives short extensions E:0→A→B→pC→0 and F:0→C→D→X→0. Choose a vector-space section of Di→Xi and of pi:Bi→Ci at every vertex. There are finitely many choices, so this does not use the Axiom of Choice. In the resulting coordinates Di=Ci⊕Xi, its arrow maps have form (Caξa0Xa). If sj:Cj→Bj is the chosen section of pj, put ξ~a=sjξa. Define Ti=Bi⊕Xi and Ta=(Baξ~a0Xa). These maps define a finite-dimensional quiver representation and an exact sequence 0→B→T→X→0.

4.1F2step 1.1step 3.1construct

If length-r paths kill B and length-s paths kill X, then length-(r+s) paths kill T by step 1.1. Thus the constructed intermediate object belongs to the nilpotent category, including when Q has oriented cycles. The maps Ti→Di given by (b,x)↦(pib,x) commute with arrows because pjξ~a=ξa and pjBa=Capi. They give a surjection T→D with kernel A, and the pushout of 0→B→T→X→0 along p is precisely F. By [F2] the given two-extension is zero within the nilpotent category itself: the finite zigzag in that lemma involves only finite sums, subquotients, and extensions of these objects, which remain finite-dimensional and nilpotent by step 1.1. Since the original two-extension was arbitrary, all its Yoneda two-extension classes vanish.

5.1F1step 1.1step 2.1step 2.2step 3.1step 4.1step 2.3algebra∎

Apply step 2.2 to V=Si,W=Sj. If i≠j, the source of d is zero, and its target has one scalar coordinate for each arrow i→j. If i=j, that target is zero because Q has no loops. Thus dim⁡kYExt⁡1(Si,Sj)=cij in all cases. Steps 1.1–4.1 verify every condition in [F1], while step 2.3 and this computation prove the remaining assertions for the chosen skeleton. If Q is acyclic then every path has length less than ∣Q0∣, so all finite-dimensional representations are nilpotent; hence the same argument covers the chosen small skeleton of the acyclic category in the statement, consistently with Finite-dimensional representations of an acyclic quiver form a hereditary finitary Hall category.

Source notes

Schiffmann §3.1 explicitly allows cycles, defines nilpotence by uniformly vanishing path composites, proves the simple-object and Grothendieck-group assertions, and states that this nilpotent category is hereditary. The proof above supplies the missing local hereditary argument by lifting arrow coordinates. It neither places infinite-dimensional path projectives in the category nor assumes an ambient-to-Serre-subcategory comparison for Yoneda Ext².

Depends on

Used by

Dependency tree · two levels

22 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