Bourbaki

Proposition 2

Tag 0424, permanent. Cite it as [Bourbaki, Tag 0424].

Commutative Algebra, chapter I, § 1. Diagrams and exact sequences

Suppose that in the commutative diagram (10) the sequences (u,v)(u, v) and (u′,u′)(u', u') are exact. Then:

(i) v1∘u1=0v_1 \circ u_1 = 0; if u′u' is injective, the sequence (u1,v1)(u_1, v_1) is exact. (ii) v2∘u2=0v_2 \circ u_2 = 0; if vv is surjective, the sequence (u2,v2)(u_2, v_2) is exact. (iii) Suppose that u′u' is injective and vv is surjective. Then there exists one and only one homomorphism d:Ker(c)→Coker(a)d : \mathrm{Ker}(c) \to \mathrm{Coker}(a) with the following property: if x∈Ker(c)x \in \mathrm{Ker}(c), y∈By \in B and t′∈A′t' \in A' satisfy the relations v(y)=k(x)v(y) = k(x) and u′(t′)=b(y)u'(t') = b(y), then d(x)=p(t′)d(x) = p(t'). Moreover the sequence

(*)

Ker(a)→u1Ker(b)→v1Ker(c)→dCoker(a)→u2Coker(b)→v2Coker(c) \begin{array}{cccccc} \mathrm{Ker}(a) & \xrightarrow{u_1} & \mathrm{Ker}(b) & \xrightarrow{v_1} & \mathrm{Ker}(c) & \xrightarrow{d} \\ & & & & & \\ & & & & & \\ & & & & & \\ \mathrm{Coker}(a) & \xrightarrow{u_2} & \mathrm{Coker}(b) & \xrightarrow{v_2} & \mathrm{Coker}(c) \end{array}

is exact.

Let us prove (i). As u1u_1 and v1v_1 have the same graphs as the restrictions of uu and vv to Ker(a)\mathrm{Ker}(a) and Ker(b)\mathrm{Ker}(b) respectively, we have v1∘u1=0v_1 \circ u_1 = 0. Then

Ker(v1)=Ker(b)∩Ker(v)=Ker(b)∩Im(u)=Im(j)∩Im(u). \mathrm{Ker}(v_1) = \mathrm{Ker}(b) \cap \mathrm{Ker}(v) = \mathrm{Ker}(b) \cap \mathrm{Im}(u) = \mathrm{Im}(j) \cap \mathrm{Im}(u).
But, by Proposition 1, (i), Ker(v1)=Im(j∘u1)=Im(u1)\mathrm{Ker}(v_1) = \mathrm{Im}(j \circ u_1) = \mathrm{Im}(u_1) if u′u' is injective.

Let us prove (ii). As u2u_2 and v2v_2 are obtained from uu and vv by taking quotients, it is clear that v2∘u2=0v_2 \circ u_2 = 0. Suppose that vv is surjective; as qq and pp are surjective, it follows from the hypotheses and Proposition 1, (ii) that

Ker(v2)=q(Ker(v2∘q))=q(Ker(v′)+Im(b))=q(Ker(v′))=q(Im(u′))=Im(q∘u′)=Im(u2∘p)=Im(u2). \begin{align*} \mathrm{Ker}(v_2) &= q(\mathrm{Ker}(v_2 \circ q)) = q(\mathrm{Ker}(v') + \mathrm{Im}(b)) = q(\mathrm{Ker}(v')) = q(\mathrm{Im}(u')) \\ &= \mathrm{Im}(q \circ u') = \mathrm{Im}(u_2 \circ p) = \mathrm{Im}(u_2). \end{align*}

Finally let us prove (iii). For x∈Ker(c)x \in \mathrm{Ker}(c) there exists y∈By \in B such that v(y)=k(x)v(y) = k(x) since vv is surjective; moreover v′(b(y))=c(k(x))=0v'(b(y)) = c(k(x)) = 0 and consequently there exists a unique t′∈A′t' \in A' such that u′(t′)=b(y)u'(t') = b(y), since u′u' is injective. We now show that the element p(t′)∈Coker(a)p(t') \in \mathrm{Coker}(a) is independent of the element y∈By \in B such that v(y)=k(x)v(y) = k(x). For if y′∈By' \in B is another element such that v(y′)=k(x)v(y') = k(x), then y′=y+u(z)y' = y + u(z), where z∈Az \in A; we show that if t′′∈A′t'' \in A' is such that u′(t′′)=b(y′)u'(t'') = b(y') then t′′=t′+a(z)t'' = t' + a(z); for

u′(t′+a(z))=u′(t′)+u′(a(z))=b(y)+b(u(z))=b(y+u(z))=b(y′). u'(t' + a(z)) = u'(t') + u'(a(z)) = b(y) + b(u(z)) = b(y + u(z)) = b(y').
Finally, it follows that p(t′′)=p(t′)+p(a(z))=p(t′)p(t'') = p(t') + p(a(z)) = p(t'). Then it is possible to set d(x)=p(t′)d(x) = p(t') and the mapping d:Ker(c)→Coker(a)d : \mathrm{Ker}(c) \to \mathrm{Coker}(a) has thus been defined.

If now x1,x2x_1, x_2 are elements of Ker(c)\mathrm{Ker}(c) and x=x1+x2x = x_1 + x_2, we take elements y1,y2y_1, y_2 of BB such that v(y1)=k(x1)v(y_1) = k(x_1) and v(y2)=k(x2)v(y_2) = k(x_2) and choose for y∈By \in B the element y1+y2y_1 + y_2; it is then immediate that d(x)=d(x1)+d(x2)d(x) = d(x_1) + d(x_2) and hence dd is a homomorphism.

Suppose that x=v1(x′)x = v_1(x') for some x′∈Ker(b)x' \in \mathrm{Ker}(b); then take y∈By \in B to be the element j(x′)j(x'). As b(j(x′))=0b(j(x')) = 0, it follows that d(x)=0d(x) = 0, hence d∘v1=0d \circ v_1 = 0. Conversely, suppose that d(x)=0d(x) = 0. In the above notation we then have t′=a(s)t' = a(s), where s∈As \in A. In this case we have b(y)=u′(t′)=u′(a(s))=b(u(s))b(y) = u'(t') = u'(a(s)) = b(u(s)), or b(y−u(s))=0b(y - u(s)) = 0. The element y−u(s)y - u(s) is therefore of the form j(n)j(n), where n∈Ker(b)n \in \mathrm{Ker}(b), and we have k(x)=v(y)=v(u(s)+j(n))=v(j(n))=k(v1(n))k(x) = v(y) = v(u(s) + j(n)) = v(j(n)) = k(v_1(n)); as kk is injective, x=v1(n)x = v_1(n), which proves that the sequence (*) is exact at Ker(c)\mathrm{Ker}(c).

Finally, we have (always in the same notation)

u2(d(x))=u2(p(t′))=q(u′(t′))=q(b(y))=0 u_2(d(x)) = u_2(p(t')) = q(u'(t')) = q(b(y)) = 0
and hence u2∘d=0u_2 \circ d = 0. Conversely, suppose that an element w=p(t′)w = p(t') of Coker(a)\mathrm{Coker}(a) is such that u2(w)=u2(p(t′))=0u_2(w) = u_2(p(t')) = 0 (where t′∈At' \in A). Then q(u′(t′))=0q(u'(t')) = 0 and consequently u′(t′)=b(y)u'(t') = b(y) for some y∈By \in B; as v′(u′(t′))=0v'(u'(t')) = 0, we have v′(b(y))=0v'(b(y)) = 0, hence c(v(y))=0c(v(y)) = 0, in other words v(y)=k(x)v(y) = k(x) for some x∈Ker(c)x \in \mathrm{Ker}(c), and by definition w=d(x)w = d(x), which shows that the sequence (*) is exact at

Coker(a). It has been seen in (i) that it is exact at Ker(b) and in (ii) it is exact at Coker(b), which completes the proof of (iii).

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Cites

Transcribed from the printed volume. Not translated.