Bourbaki

Proposition 2

Tag 0DOW, permanent. Cite it as [Bourbaki, Tag 0DOW].

Algebra, chapter X, § 1. Compléments d’algèbre linéaire

Suppose that in the commutative diagram (4), the sequences (u,v)(u, v) and (u′,v′)(u', v') are exact. Then: (i) We have v1∘u1=0v_1 \circ u_1 = 0; if u′u' is injective, the sequence (u1,v1)(u_1, v_1) is exact. (ii) We have 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. There exists then one and only one homomorphism d:Ker (h)→Coker (f)d : \text{Ker } (h) \to \text{Coker } (f) having the following property: if z∈Ker (h),y∈Nz \in \text{Ker } (h), y \in N and x′∈M′x' \in M' satisfy the relations v(y)=k(z)v(y) = k(z) and u′(x′)=g(y)u'(x') = g(y), we have d(z)=p(x′)d(z) = p(x'). Moreover the sequence (*) Ker (f)→u1Ker (g)→v1Ker (h)→dCoker (f)→u2Coker (g)→v2Coker (h)\text{Ker } (f) \xrightarrow{u_1} \text{Ker } (g) \xrightarrow{v_1} \text{Ker } (h) \xrightarrow{d} \text{Coker } (f) \xrightarrow{u_2} \text{Coker } (g) \xrightarrow{v_2} \text{Coker } (h) is exact.

Ker⁡(f)→u1Ker⁡(g)→v1Ker⁡(h)↓i↓j↓kM→uN→vP↓f↓g↓hM′→u′N′→v′P′↓p↓q↓rCoker⁡(f)→u2Coker⁡(g)→v2Coker⁡(h) \begin{array}{ccccc} \operatorname{Ker}(f)&\xrightarrow{u_1}&\operatorname{Ker}(g)&\xrightarrow{v_1}&\operatorname{Ker}(h)\\ \downarrow\scriptstyle i&&\downarrow\scriptstyle j&&\downarrow\scriptstyle k\\ M&\xrightarrow{u}&N&\xrightarrow{v}&P\\ \downarrow\scriptstyle f&&\downarrow\scriptstyle g&&\downarrow\scriptstyle h\\ M'&\xrightarrow{u'}&N'&\xrightarrow{v'}&P'\\ \downarrow\scriptstyle p&&\downarrow\scriptstyle q&&\downarrow\scriptstyle r\\ \operatorname{Coker}(f)&\xrightarrow{u_2}&\operatorname{Coker}(g)&\xrightarrow{v_2}&\operatorname{Coker}(h) \end{array}

Let us prove (i). Since u1u_1 and v1v_1 have the same graphs as the restrictions of uu and vv to Ker⁡(f)\operatorname{Ker}(f) and Ker⁡(g)\operatorname{Ker}(g) respectively, we have v1∘u1=0v_1\circ u_1=0. We have

Ker⁡(v1)=Ker⁡(g)∩Ker⁡(v)=Ker⁡(g)∩Im⁡(u)=Im⁡(j)∩Im⁡(u). \operatorname{Ker}(v_1)=\operatorname{Ker}(g)\cap\operatorname{Ker}(v)=\operatorname{Ker}(g)\cap\operatorname{Im}(u)=\operatorname{Im}(j)\cap\operatorname{Im}(u).

But by prop. 1 (i), we have Ker⁡(v1)=Im⁡(j∘u1)=Im⁡(u1)\operatorname{Ker}(v_1)=\operatorname{Im}(j\circ u_1)=\operatorname{Im}(u_1) if u′u' is injective.

Let us prove (ii). Since u2u_2 and v2v_2 are obtained from uu and vv by passing to quotients, it is clear that v2∘u2=0v_2\circ u_2=0. Suppose that vv is surjective; since qq and pp are surjective, we have, by virtue of the hypotheses and prop. 1 (ii)

Ker⁡(v2)=q(Ker⁡(v2∘q))=q(Ker⁡(v′)+Im⁡(g))=q(Ker⁡(v′))=q(Im⁡(u′))=Im⁡(q∘u′)=Im⁡(u2∘p)=Im⁡(u2). \begin{aligned} \operatorname{Ker}(v_2)&=q(\operatorname{Ker}(v_2\circ q))=q(\operatorname{Ker}(v')+\operatorname{Im}(g))=q(\operatorname{Ker}(v'))\\ &=q(\operatorname{Im}(u'))=\operatorname{Im}(q\circ u')=\operatorname{Im}(u_2\circ p)=\operatorname{Im}(u_2). \end{aligned}

Let us finally prove (iii). For z∈Ker⁡(h)z\in\operatorname{Ker}(h), there exists y∈Ny\in N such that v(y)=k(z)v(y)=k(z) since vv is surjective; moreover, we have v′(g(y))=h(k(z))=0v'(g(y))=h(k(z))=0, and consequently there exists a unique x′∈M′x'\in M' such that u′(x′)=g(y)u'(x')=g(y) since u′u' is injective. Let us show that the element p(x′)∈Coker⁡(f)p(x')\in\operatorname{Coker}(f) is independent of the element y∈Ny\in N such that v(y)=k(z)v(y)=k(z). Indeed, if y1∈Ny_1\in N is a second element such that v(y1)=k(z)v(y_1)=k(z), we have y1=y+u(x)y_1=y+u(x) where x∈Mx\in M; let us show that if x1′∈M′x'_1\in M' is such that u′(x1′)=g(y1)u'(x'_1)=g(y_1), we have x1′=x′+f(x)x'_1=x'+f(x); indeed, we have u′(x′+f(x))=u′(x′)+u′(f(x))=g(y)+g(u(x))=g(y+u(x))=g(y1)u'(x'+f(x))=u'(x')+u'(f(x))=g(y)+g(u(x))=g(y+u(x))=g(y_1). Finally, we conclude that p(x1′)=p(x′)+p(f(x))=p(x′)p(x'_1)=p(x')+p(f(x))=p(x'). We can therefore set d(z)=p(x′)d(z)=p(x') and we have thus defined a mapping d:Ker⁡(h)→Coker⁡(f)d:\operatorname{Ker}(h)\to\operatorname{Coker}(f).

If now z1,z2z_1,z_2 are elements of Ker⁡(h)\operatorname{Ker}(h), if λ1,λ2∈A\lambda_1,\lambda_2\in A and z=λ1z1+λ2z2z=\lambda_1z_1+\lambda_2z_2, we take elements y1y_1 and y2y_2 of NN such that v(y1)=k(z1)v(y_1)=k(z_1) and v(y2)=k(z2)v(y_2)=k(z_2) and we choose for y∈Ny\in N the element λ1y1+λ2y2\lambda_1y_1+\lambda_2y_2; it is then immediate that

d(z)=λ1d(z1)+λ2d(z2), d(z)=\lambda_1d(z_1)+\lambda_2d(z_2),

so dd is a homomorphism.

Suppose that z=v1(t)z=v_1(t) for some t∈Ker⁡(g)t\in\operatorname{Ker}(g); we then take for y∈Ny\in N the element j(t)j(t). Since g(j(t))=0g(j(t))=0, we conclude that d(z)=0d(z)=0, hence d∘v1=0d\circ v_1=0. Conversely, suppose that d(z)=0d(z)=0. With the preceding notations, we thus have x′=f(x)x'=f(x), where x ∈ M. In this case, we have g(y)=u′(f(x))=g(u(x))g(y) = u'(f(x)) = g(u(x)), or equivalently g(y−u(x))=0g(y - u(x)) = 0. The element y−u(x)y - u(x) is therefore of the form j(n)j(n) for n∈Ker (g)n \in \mathrm{Ker}\,(g), and we have

k(z)=v(y)=v(u(x)+j(n))=v(j(n))=k(v1(n)); k(z) = v(y) = v(u(x) + j(n)) = v(j(n)) = k(v_1(n));

as kk is injective, z=v1(n)z = v_1(n), which proves that the sequence (*) is exact at Ker (h)\mathrm{Ker}\,(h).

Finally, we have (with the same notations)

u2(d(z))=u2(p(x′))=q(u′(x′))=q(g(y))=0thereforeu2∘d=0. u_2(d(z)) = u_2(p(x')) = q(u'(x')) = q(g(y)) = 0 \quad \text{therefore} \quad u_2 \circ d = 0 .

Conversely, suppose that an element w=p(x′)w = p(x') of Coker (f)\mathrm{Coker}\,(f) is such that

u2(w)=u2(p(x′))=0(with x′∈M′). u_2(w) = u_2(p(x')) = 0 \quad (\text{with } x' \in \mathbf{M}') .

We thus have q(u′(x′))=0q(u'(x')) = 0, and consequently u′(x′)=g(y)u'(x') = g(y) for a y∈Ny \in \mathbf{N}; since v′(u′(x′))=0v'(u'(x')) = 0, we have v′(g(y))=0v'(g(y)) = 0, hence h(v(y))=0h(v(y)) = 0, in other words v(y)=k(z)v(y) = k(z) for a z∈Ker (h)z \in \mathrm{Ker}\,(h), and by definition w=d(z)w = d(z), which shows that the sequence (*) is exact at Coker (f)\mathrm{Coker}\,(f). We have seen in (i) that it is exact at Ker (g)\mathrm{Ker}\,(g) and in (ii) that it is exact at Coker (g)\mathrm{Coker}\,(g), which completes the proving of (iii).

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

Cited by

Nothing.

Cites

Nothing.

Translated with machine help, not yet reviewed by a person.