Bourbaki

Exercise 4, § 1

Tag 03XH, permanent. Cite it as [Bourbaki, Tag 03XH].

Algebraic Topology, II, p. 216

Let Q=(S,F,o,t)Q = (S,F, o, t) be a quiver. We denote by I the sum set of the family (S,F)(S,F); we identify S and F with subsets of I. Let kk be a commutative ring. We call the kk-algebra of the quiver Q the quotient AQA_Q of the free associative kk-algebra on the set I by the two-sided ideal generated by the elements Xs2−XsX^2_s-X_s (for s∈Ss\in S), XuXv−XvXuX_uX_v-X_vX_u (for u,v∈Su, v\in S), XfXt(f)−XfX_fX_{t(f)}-X_f and Xo(f)Xf−XfX_{o(f)}X_f-X_f (for f∈Ff\in F). For i∈Ii\in I, we denote by xix_i the image of XiX_i in the algebra AQA_Q.

(a) Prove that one has ∑s∈Sxs=1\sum_{s\in S}x_s= 1.

(b) Prove that one has xfxg=0x_fx_g= 0 if ff and gg are arrows of Q which are not composable.

(c) For every path c=(a0,f1,...,fn,an)c= (a_0, f_1, . . . , f_n, a_n) in Q, put xcx_c = xa0xf1...xfnx_{a_0}x_{f_1}. . . x_{f_n}. Let cc and c′c' be paths in Q; prove that one has xcxc′=xcc′x_cx_{c'}=x_{cc'} if cc and c′c' are composable, and xc=xc′x_c=x_{c'} otherwise.

(d) Let C be the set of paths in the quiver Q; prove that the family (xc)c∈C(x_c)_{c\in C} is a basis of the kk-module AQA_Q.

(e) Let JQJ_Q be the two-sided ideal of AQA_Q generated by the elements of the form xfx_f, for f∈Ff\in F. Prove that the algebra AQ/JQA_Q/J_Q is isomorphic to k(S)k^{(S)}.

(f) In order that the kk-algebra AQA_Q be a finitely generated kk-module, it is necessary and sufficient that the set of vertices of Q be finite and that every loop in Q be of length zero. The ideal JQJ_Q is then nilpotent.

We retain these notations for the remainder of the exercises of §1. When we speak of an AQA_Q-module (without further specification), it is a right module. If A is a ring, an A-module M (without further specification) will be a right A-module; if aa is an element of A, we denote by aMa_M or (a)M(a)_M the homothety x↦xax\mapsto xa of M.

Solution

No solution has been written yet.

Cited by

Nothing.

Cites

Nothing.

Machine translation of the English, by gpt-5-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.