The path algebra is the -vector space with basis all directed paths, including the length-zero path at each vertex. Extend path composition bilinearly, declaring the product zero when the paths cannot be composed. We use the left-module convention: means first traverse , then ; for an arrow , .
The constant paths are mutually orthogonal idempotents. For any path ,Consequently, for the finite vertex set used here,It acts as an identity on every basis path, hence on the entire path algebra. Finiteness of the vertex set is what makes this a genuine element of the algebra; an infinite-vertex path algebra instead has finite vertex sums as local units.
There is one constant path and loop generators; every other path is a word in those loops. Distinct words are distinct basis paths, so there are no relations among the generators. Thereforethe free associative algebra on generators, with each loop sent to its corresponding generator. For this is ; for it is noncommutative. The quiver with one loop is the case of the quiver with r loops.
Number the source vertices and the sink , and write for the arrows. The only basis paths are . Using standard matrix units, defineThe relations , orthogonality of the vertex idempotents, and agree exactly with multiplication of these matrix units. The map is therefore an algebra homomorphism, and its images form a basis of the algebraThis is an explicit isomorphism of the path algebra of the subspace quiver with a -dimensional triangular matrix algebra.
First split off the kernel of each source-to-sink arrow. Each kernel contributes copies of the simple representation supported at that source. The remaining arrows are injective, so identify the three source spaces with subspaces of the sink space . We now give an elementary three-subspace decomposition.
Split off the common intersection : any projection onto it preserves all three subspaces. Next split off each pairwise intersection. For example, once the triple intersection has gone, is disjoint from ; a projection onto that kills preserves . This extracts blocks whose membership is exactly . Repeating for the other pairs leaves pairwise disjoint subspaces.
For each , choose a complement to in . A projection onto killing preserves the triple, so these complements split off as blocks of membership exactly . In the remaining triple, every lies in the sum of the other two and all pairwise intersections are zero. Thus the sum is , and both projections of onto are isomorphisms. Hence is the graph of an isomorphism . Choose a basis of and the basis of ; this graph decomposes into two-dimensional blocks with three distinct lines. A complement to in contributes sink-only simple blocks.
The complete list of indecomposable blocks is therefore:
Each of the first eleven blocks has endomorphism ring . For the exceptional indecomposable of the three-subspace quiver, an endomorphism of preserving the first two lines is diagonal; preserving the third makes its two diagonal entries equal. Its endomorphism ring is also , so all twelve are indecomposable. Their dimension vectors of quiver representations distinguish them. The decomposition argument proves completeness, and hence there are exactly isomorphism classes. No general classification theorem is needed.
Articles by others on the same topic
There are currently no matching articles.
