Bourbaki

Exercise 10, § 9

Commutative Algebra, X

Let AA be a noetherian ring. Let II be a bounded injective AA-complex, whose homology is of finite type; for every AA-complex CC, denote by D(C)\mathbf{D}(C) the complex HomgrA(C,I)\mathrm{Homgr}_A(C, I).

a) Prove that the following conditions are equivalent:

(i) for every finitely generated AA-module MM, the canonical morphism of complexes αM:M→D(D(M))\alpha_M : M \to \mathbf{D}(D(M)) (No. 5) is a homology isomorphism ; (ii) for every bounded AA-complex CC whose homology is of finite type, the morphism αC:C→D(D(C))\alpha_C : C \to \mathbf{D}(D(C)) (loc. cit.) is a homology isomorphism ; (iii) the canonical morphism αA:A→HomgrA(I,I)\alpha_A : A \to \mathrm{Homgr}_A(I, I) is a homology isomorphism.

(Adapt the proof of Theorem 1.)

The complex II is said to be dualizing if it is bounded, injective, if H(I)H(I) is of finite type and if it satisfies the equivalent conditions above.

b) If AA admits a dualizing module Ω\Omega, every finite length injective resolution (I,δ)(I, \delta) of Ω\Omega defines a dualizing complex (loc. cit.).

c) Let BB be an AA-algebra which is a finitely generated AA-module, II a dualizing complex of AA-modules; prove that the complex of BB-modules HomA(B,I)\mathrm{Hom}_{\mathbf{A}}(B, I) is dualizing. Thus every quotient ring of a Gorenstein ring of finite dimension admits a dualizing complex.

d) Let II be a bounded injective AA-complex. For II to be dualizing, it is necessary and sufficient that the complex of AmA_m-modules ImI_m be dualizing for every maximal ideal mm of AA.

e) Let II be a dualizing AA-complex, PP a projective AA-module of rank 1, nn an integer. The complex I⊗AP(n)I \otimes_A P(n) is dualizing.

f) Let I,JI, J be bounded injective AA-complexes, whose homology is of finite type, and let u:I→Ju : I \to J be a homology isomorphism; for JJ to be dualizing it is necessary and sufficient that II be so.

Solution

No solution has been written yet.

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