Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

The motivic Hall algebra of a finite quiver

Definition

Let Q=(Q0,Q1,s,t) be a finite quiver over a field k. A representation of Q assigns a finite-dimensional k-vector space Vi to each vertex i∈Q0 and a linear map Vs(a)→Vt(a) to each arrow a∈Q1. Its dimension vector is d=(dim⁡Vi)i∈Q0∈NQ0.

For d∈NQ0 put Rep⁡d(Q)=∏a∈Q1Hom⁡k(kds(a),kdt(a)),Gd=∏i∈Q0GL⁡di(k),and let Md(Q)=[Rep⁡d(Q)/Gd] be the quotient Artin stack. It is finite type and has affine stabilizers: the representation variety and the acting group are finite type and affine, and each stabilizer is a closed subgroup of Gd. For dimension vectors d,e, let Ed,e(Q) be the stack of short exact sequences of representations0⟶Be⟶Ed+e⟶Ad⟶0.The endpoints are part of the data, and isomorphisms are isomorphisms of the whole exact sequence. Equivalently, after choosing the standard e-dimensional subspaces at each vertex, this is the quotient by the product parabolic preserving those subspaces of the affine space of block upper-triangular arrow maps. Thus Ed,e(Q) is a finite-type Artin stack with affine stabilizers. More explicitly, on a local splitting Ei=Bi⊕Ai, the arrow a:i→j has block matrix(Baξa0Aa),ξa:Ai→Bj.Changing the splitting by hi:Ai→Bi changes ξa to ξa+Bahi−hjAa. This is the translation action of the vector bundle ⨁iHom⁡(Ai,Bi) on ⨁a:i→jHom⁡(Ai,Bj) used in the extension stack calculation. Let q:Ed,e→Md send a sequence to its quotient, s:Ed,e→Me send it to its subrepresentation, and m:Ed,e→Md+e send it to its middle representation. The Hall correspondence is

& \mathfrak E_{\mathbf d,\mathbf e}(Q) \ar[dl,"(q,s)"'] \ar[dr,"m"] & \\ \mathfrak M_{\mathbf d}(Q)\times\mathfrak M_{\mathbf e}(Q) && \mathfrak M_{\mathbf d+\mathbf e}(Q)

Its arrows record the ordered quotient, subrepresentation, and middle object of the displayed short exact sequence; the diagram fixes the convolution convention. DefineHQ:=⨁d∈NQ0K(Md(Q)).For α∈K(Md) and β∈K(Me), defineα∗β:=m!((q,s)∗(α⊠β))∈K(Md+e). Thus the first factor is the quotient and the second factor is the subrepresentation, so the sequence is 0→B→E→A→0. Each homogeneous product is defined by one finite-type stack correspondence; no completion or finiteness of a sum over isomorphism classes is required. This is the stack-function product without a potential or a vanishing-cycle weight.

Depends on

Used by

Dependency tree · two levels

3 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