Bourbaki

Exercise 11, § 7

Algebra, X, p. 201

Bourbaki marks this one as harder than the rest.

Assume that the bigebra BB admits an inversion ii (cf. III, p. 198, exercise 4). Let MM and NN be BB-modules. The kk-module M⊗kNM \otimes_k N (resp. Homk(M,N)\mathrm{Hom}_k(M, N)) has a natural structure of B⊗kBB \otimes_k B-module (resp. B⊗kB∘B \otimes_k B^\circ-module); it is provided with the structure of BB-module deduced from the homomorphism c (resp. (1B⊗i)∘c(1_B \otimes i) \circ c).

a) Now prove that the homomorphism uu (exercise 10) defines a graded homomorphism of degree zero

∪:H′(B,γ;Homk(M,N))⊗kH′(B,γ;M)→H′(B,γ;N). \cup : H'(B, \gamma; \mathrm{Hom}_k(M, N)) \otimes_k H'(B, \gamma; M) \to H'(B, \gamma; N).

b) Let 0→M→Rn→...→R1→k→00 \to M \to R_n \to ... \to R_1 \to k \to 0 be an exact sequence of BB-modules, with RiR_i projective (1≤i≤n)(1 \leq i \leq n); let θ\theta be its class in ExtBn(k,M)=Hn(B,γ;M)\mathrm{Ext}_B^n(k, M) = H^n(B, \gamma; M). Now prove that, for p≥1p \geq 1, the mapping x↦x∪θx \mapsto x \cup \theta is a kk-isomorphism from Hp(B,γ;Homk(M,N))H^p(B, \gamma; \mathrm{Hom}_k(M, N)) onto Hp+n(B,γ;N)H^{p+n}(B, \gamma; N).

(Prove that this mapping factors through

Hp(B,γ;Homk(M,N))→ExtBp(M,N)→θExtBp+n(k,N) H^p(B, \gamma ; \mathrm{Hom}_k(M, N)) \to \mathrm{Ext}_B^p(M, N) \xrightarrow{\theta} \mathrm{Ext}_B^{p+n}(k, N)

c) Let GG be a group, NN a Z(G)\mathbf{Z}^{(G)}-module. Let FF be a free group, p:F→Gp : F \to G a surjective homomorphism, R=Ker (p)R = \mathrm{Ker}\,(p), R‾=R/(R,R)\overline{R} = R/(R, R), F‾=F/(R,R)\overline{F} = F/(R, R). The extension R‾→F‾→G\overline{R} \to \overline{F} \to G defines a class ε∈H2(G,R‾)\varepsilon \in H^2(G, \overline{R}); prove that the mapping x↦x∪εx \mapsto x \cup \varepsilon from Hp(G,HomZ(R‾,N))H^p(G, \mathrm{Hom}_\mathbf{Z}(\overline{R}, N)) into Hp+2(G,N)H^{p+2}(G, N) is an isomorphism for p⩾1p \geqslant 1 (use exercise 3, d), p. 179).

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.