Bourbaki

Remark 2

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

Algebra, chapter X, § 7. Produit de composition

Theorem 1 provides a description of ExtAn(M,N)\mathrm{Ext}_A^n(M, N) as a set of equivalence classes of exact sequences; it is easy to describe the group law obtained on this set by transport of structure. Indeed, let θ\theta (resp. θ′\theta') be the class of an exact sequence 0→N→fn+1Rn→fn…→R1→M→00 \to N \xrightarrow{f_{n+1}} R_n \xrightarrow{f_n} \ldots \to R_1 \to M \to 0 (resp. 0→N→fn+1′Rn′→fn′…→R1′→M→00 \to N \xrightarrow{f'_{n+1}} R'_n \xrightarrow{f'_n} \ldots \to R'_1 \to M \to 0). Let Δ:M→M⊕M\Delta : M \to M \oplus M and ∇:N⊕N→N\nabla : N \oplus N \to N be the AA-linear maps defined by Δ(x)=(x,x)\Delta(x) = (x, x) for x∈Mx \in M and ∇(y,z)=y+z\nabla(y, z) = y + z for y,z∈Ny, z \in N. Consider the mapping

m:ExtA(M,N)⊕ExtA(M,N)→ExtA(M⊕M,N⊕N) m : \mathrm{Ext}_A(M, N) \oplus \mathrm{Ext}_A(M, N) \to \mathrm{Ext}_A(M \oplus M, N \oplus N)

defined in the remark, p. 121. With the notations of loc. cit., one has ∇∘iN=1N\nabla \circ i_N = 1_N and qM∘Δ=1Mq_M \circ \Delta = 1_M, and thus θ+θ′=∇∘m(θ,θ′)∘Δ\theta + \theta' = \nabla \circ m(\theta, \theta') \circ \Delta. Taking into account loc. cit. and cor. 3, p. 120, this provides an exact sequence of class θ+θ′\theta+\theta': for example, if n≥2n \geq 2, one can take the sequence

0⟶N⟶Rn′′⟶Rn−1⊕Rn−1′→ fn−1⊕fn−1′ ⋯⟶R2⊕R2′⟶R1′⟶M⟶0 0\longrightarrow \mathbf{N}\longrightarrow R_n''\longrightarrow R_{n-1}\oplus R'_{n-1}\xrightarrow{\,f_{n-1}\oplus f'_{n-1}\,}\cdots\longrightarrow R_2\oplus R'_2\longrightarrow R'_1\longrightarrow M\longrightarrow0

where Rn′′R_n'' is the quotient of Rn⊕Rn′R_n\oplus R'_n by the submodule formed by the couples

(fn+1(x),−fn+1′(x))pour x∈N, \left(f_{n+1}(x),-f'_{n+1}(x)\right)\quad\text{pour }x\in\mathbf{N},

and where R1′′=R1×MR1′R''_1=R_1\times_M R'_1.

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.