Bourbaki

Exercise 5, § 5

Algebra, X, p. 187

Let PP be an AA-complex projective, zero to the right, let nn be an integer ⩾0\geqslant 0. Show that the following conditions are equivalent:

α) There exists a complex P′P' of projective AA-modules of finite type, such that Pi′=0P'_i = 0 for i>ni > n or i<0i < 0, and a morphism f:P′→Pf : P' \to P such that Hi(f)H_i(f) is bijective for i<ni < n and surjective for i=ni = n.

β) For every filtered inductive system of AA-modules (Mα)α∈I(M_\alpha)_{\alpha \in I}, the canonical homomorphism

lim←⁡Hi(HomgrA(P,Mα))→Hi(HomgrA(P,lim←⁡Mα)) \varprojlim H^i(\mathrm{Homgr}_A(P, M_\alpha)) \to H^i(\mathrm{Homgr}_A(P, \varprojlim M_\alpha))
is bijective for i<ni < n and injective for i=ni = n.

γ) For every family of right AA-modules (Nα)α∈I(N_\alpha)_{\alpha \in I}, the canonical homomorphism

Hi((∏αNα)⊗AP)→∏αHi(Nα⊗P) H_i((\prod_\alpha N_\alpha) \otimes_A P) \to \prod_\alpha H_i(N_\alpha \otimes P)
is bijective for i<ni < n and surjective for i=ni = n.

(To prove that α) implies β) and γ), apply Exercise 4 to the cone of ff. To prove that β) or γ\gamma implies α\alpha), reason by induction on nn, applying Exercise 4, Exercise 18, p. 170 and Exercise 10, p. 174.)

Solution

No solution has been written yet.

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.