Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedprecheck passaudited 2026-09-27
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.

Integral path ring of a finite quiver

Definition

A finite quiver is a quadruple Q=(Q0,Q1,s,t) in which Q0 and Q1 are finite sets, whose elements are called vertices and arrows, together with maps s,t:Q1→Q0 assigning to an arrow a its source s(a) and its target t(a); one draws a:s(a)→t(a). Both sets are finite and no further structure is assumed: Q may have several arrows with the same source and target, and an arrow may be a loop, although the quivers used below have neither property.

A directed path in Q of length l≥0 consists of vertices v0,…,vl and specified arrows aj:vj−1→vj for 1≤j≤l. Write it as p=(v0→a1v1→a2⋯→alvl). The arrows are part of the data: distinct parallel arrows give distinct paths. A path of length zero is a single vertex (v), called a vertex idempotent. Write ∣p∣:=l, s(p):=v0 and t(p):=vl for its length, source and target. When the arrows are determined by their endpoints, as in the doubled lines used below, abbreviate this by (v0∣⋯∣vl); in formulas for a general quiver this abbreviation retains the specified arrows as implicit data. Paths p and q are composable if t(p)=s(q). Their concatenation pq traverses the arrow sequence of p first and then that of q, retaining all arrow labels; in the abbreviated notation it is (v0∣⋯∣vl)(vl∣w1∣⋯∣wl′)=(v0∣⋯∣vl∣w1∣⋯∣wl′).

The integral path ring ZQ is the free abelian group on the set of all directed paths of Q (The free module on a set and its standard basis), with multiplication defined on basis paths by (v0∣⋯∣vl)(w0∣⋯∣wl′):={(v0∣⋯∣vl∣w1∣⋯∣wl′),vl=w0,0,vl≠w0, and extended by Z-bilinearity. Its unit is the finite sum 1ZQ=∑v∈Q0(v) of the vertex idempotents, which is a finite sum because Q0 is finite.

Endpoint conventions. For a path p and vertices u,v one has (u) p={p,s(p)=u,0,s(p)≠u,p (v)={p,t(p)=v,0,t(p)≠v. Consequently the vertex idempotents are mutually orthogonal, (u)(v)=δuv(v), and they decompose the ring as ZQ=⨁u,v∈Q0(u) ZQ (v), the sum of the free abelian groups spanned by the paths with source u and target v. In the quotient rings used below, the analogous statements read: the right ideal generated by the image of (u) is spanned by the classes of paths with source u, and the left ideal generated by the image of (v) is spanned by the classes of paths with target v, so that A ei consists of the paths ending at i and eiA of the paths beginning at i whenever A is a quotient of ZQ and ei is the image of (i).

Empty quiver. For Q0=Q1=∅ the set of paths is empty, so ZQ is the zero abelian group, the displayed sum for 1 is empty and 1=0; this is the zero ring, and every statement below is trivial there. All quivers occurring on this page are the doubled lines Γm with m≥1, which have m+1≥2 vertices.

Facts & Assumptions

Given: A finite quiver Q=(Q0,Q1,s,t), its set of directed paths, and the free abelian group ZQ on that set, with multiplication defined on basis paths as displayed and extended bilinearly.

[F1]

For a set X there is a free abelian group Z(X) on X, whose elements are the finite formal sums ∑x∈Fnxex with F⊆X finite, and a Z-linear map out of Z(X) is determined by, and may be specified by, arbitrary values on the basis elements ex; a function X→G into an abelian group G extends uniquely to a homomorphism Z(X)→G (The free module on a set and its standard basis).

[F2]

A ring is a set with addition and multiplication making it an abelian group under addition and a monoid under multiplication, with both distributive laws; multiplication is not assumed commutative (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides).

Proof

technique · direct
1.1

The product is well defined. Let P be the set of directed paths of Q. The concatenation rule defines a function P×P→Z(P), the set of composable pairs going to their concatenation and all other pairs to 0; by [F1] it extends uniquely to a Z-bilinear map Z(P)×Z(P)→Z(P), which is the multiplication displayed in the definition. Every element of ZQ is a finite sum of basis paths by [F1], so no further well-definedness issue arises.

F1
1.2

Associativity on basis paths. Let p=(v0∣⋯∣vl), q=(w0∣⋯∣wl′) and r=(x0∣⋯∣xl′′) be paths. If t(p)≠s(q) or t(q)≠s(r) then both (pq)r and p(qr) are 0, since a non-composable adjacent pair makes the corresponding product vanish and a vanishing factor stays zero. If t(p)=s(q) and t(q)=s(r), then all three concatenate and (pq)r=(v0∣⋯∣vl∣w1∣⋯∣wl′∣x1∣⋯∣xl′′)=p(qr). Lengths add, ∣pq∣=∣p∣+∣q∣, and sources and targets multiply as s(pq)=s(p), t(pq)=t(q).

algebra
1.3

Unit. Let p=(v0∣⋯∣vl). By the endpoint formulas, (v)p=p for v=v0 and (v)p=0 for v≠v0, so 1ZQ⋅p=∑v(v)p=p; symmetrically p⋅1ZQ=p, using t(p)=vl.

algebra
1.4

Orthogonality and the block decomposition. For vertices u,v the product (u)(v) is the concatenation of the two length-zero paths, which is composable exactly when u=v and then equals (u); hence (u)(v)=δuv(u). The displayed decomposition is the direct sum over the sets of paths with fixed source and target, and these sets partition the path set, so it is a direct sum decomposition of the free abelian group.

F1
2.1

Distributivity and the ring axioms. Bilinearity of the product, established in step 1.1, gives x(y+z)=xy+xz and (y+z)x=yx+zx for all x,y,z∈ZQ, and the additive group structure is the one coming from the free abelian group. Associativity of multiplication holds on basis paths by step 1.2 and hence on all elements by bilinearity, and 1ZQ is a two-sided identity by step 1.3. Thus [F2] applies.

step 1.1step 1.2step 1.3F2
3.1

Conclusion. The free abelian group ZQ on the directed paths of Q, with the displayed concatenation product, is a ring with unit ∑v(v); the endpoint formulas, orthogonality and the block decomposition of steps 1.3, 1.4 hold, and a path of length zero at u acts as a two-sided identity exactly on the paths with source u on the left and target u on the right. In a quotient ring of ZQ these identities are read in the quotient, so Aei and eiA have the stated descriptions. For the empty quiver the construction gives the zero ring, and for the doubled lines used below there are at least two vertices.

step 1.2step 1.3step 1.4step 2.1∎

Depends on

Used by

Dependency tree · two levels

11 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