Lectures on Representations of Quivers by William Crawley-Boevey ...
Lectures on Representations of Quivers by William Crawley-Boevey ...
Lectures on Representations of Quivers by William Crawley-Boevey ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
EXAMPLES.<br />
(1) If Q c<strong>on</strong>sists <strong>of</strong> <strong>on</strong>e vertex and <strong>on</strong>e loop, then kQ k[T]. If Q has <strong>on</strong>e<br />
vertex and r loops, then kQ is the free associative algebra <strong>on</strong> r letters.<br />
(2) If there is at most <strong>on</strong>e path between any two points, then kQ can be<br />
identified with the subalgebra<br />
{C ¡ M (k) ¢ C =0 if no path from j to i}<br />
n ij<br />
<strong>of</strong> M (k). If Q is 1 ¡ 2 ¡ ... ¡ n this is the lower triangular matrices.<br />
n<br />
(i£<br />
IDEMPOTENTS. Set A=kQ.<br />
(1) The e<br />
i<br />
are orthog<strong>on</strong>al idempotents, ie e e<br />
i j<br />
2<br />
= 0 j), e<br />
i<br />
= e .<br />
i<br />
n<br />
(2) A has an identity given <strong>by</strong> 1 = ¤ e .<br />
i=1 i<br />
(3) The spaces Ae , e A, and e Ae have as bases the paths starting at i<br />
i j j i<br />
and/or terminating at j.<br />
n<br />
(4) A = ¥ Ae , so each Ae is a projective left A-module.<br />
i=1 i i<br />
(5) If X is a left A-module, then Hom (Ae ,X) e X.<br />
A i i<br />
(6) If 0£ f¡ Ae and 0£ g¡ e A then fg£ 0.<br />
i i<br />
PROOF. Look at the l<strong>on</strong>gest paths x,y involved in f,g. In the product fg the<br />
coefficient <strong>of</strong> xy cannot be zero.<br />
(7) The e are primitive idempotents, ie Ae is a indecomposable module.<br />
i i<br />
2<br />
PROOF. If End (Ae ) e Ae c<strong>on</strong>tains idempotent f, then f =f=fe , so<br />
A i i i i<br />
f(e -f)=0. Now use (6).<br />
i<br />
(8) If e ¡ Ae A then i=j.<br />
i j<br />
PROOF. Ae A has as basis the paths passing through the vertex j.<br />
j<br />
(9) The e are inequivalent, ie Ae ¦ Ae for i£ j.<br />
i i j<br />
PROOF. Thanks to (5), inverse isomorphisms give elements f¡ e Ae , g¡ e Ae<br />
i j j i<br />
with fg=e and gf=e . This c<strong>on</strong>tradicts (8).<br />
i j<br />
4