Bourbaki

Exercise 15, § 2

Algebra, X, p. 176

Let EE be a spectral sequence of A-modules, approaching a graded A-module G (Exercise 14). a) Suppose that E2p,q=0E_2^{p,q} = 0 for p<0p < 0. Now prove that the mappings αr\alpha_r induce for every qq injective A-homomorphisms:

E∞0,q→⋯→E30,q→E20,q E_{\infty}^{0,q} \to \cdots \to E_3^{0,q} \to E_2^{0,q}

whence, by composition with (β0q)−1(\beta^{0q})^{-1} and with the mapping of passing to the quotient, an A-homomorphism γq:Gq→E20,q\gamma^q : G^q \to E_2^{0,q}. b) Suppose that E2pq=0E_2^{pq} = 0 for q<0q < 0. Now prove that the mappings αr−1\alpha_r^{-1} induce surjective homomorphisms:

E2p,0→E3p,0→⋯→E∞p,0 E_2^{p,0} \to E_3^{p,0} \to \cdots \to E_{\infty}^{p,0}

whence by composition with βp,0\beta^{p,0} an A-homomorphism δp:E2p,0→Gp\delta^p : E_2^{p,0} \to G^p. c) Suppose that the hypotheses of a) and b) are satisfied, that is to say E2pq=0E_2^{pq} = 0 if p<0p < 0 or q<0q < 0. Now prove that the sequence

0→E21,0→δ1G1→γ1E10,1→d2E22,0→δ2G2 0 \to E_2^{1,0} \xrightarrow{\delta^1} G^1 \xrightarrow{\gamma^1} E_1^{0,1} \xrightarrow{d_2} E_2^{2,0} \xrightarrow{\delta^2} G^2

is exact. d) Suppose that E2pq=0E_2^{pq} = 0 if p>0p > 0 or q>0q > 0; define an exact sequence analogous to that of c). e) Suppose that there exist integers r,dr, d, with d⩾r⩾2d \geqslant r \geqslant 2, such that Erpq=0E_r^{pq} = 0 if p≠0,dp \neq 0, d. Define an exact sequence:

⋯→Erd,n−d→Gn→Er0,n→Erd,n+1−d→Gn+1→⋯ . \cdots \to E_r^{d,n-d} \to G^n \to E_r^{0,n} \to E_r^{d,n+1-d} \to G^{n+1} \to \cdots .

If analogously Erpq=0E_r^{pq} = 0 for q≠0,dq \neq 0, d, now prove that there exists an exact sequence:

⋯→Ern,0→Gn→Ern−d,d→Ern+1,0→⋯ . \cdots \to E_r^{n,0} \to G^n \to E_r^{n-d,d} \to E_r^{n+1,0} \to \cdots .

f) Suppose that E2pq=0E_2^{pq} = 0 if q≠0q \neq 0 (resp. p≠0p \neq 0). Now prove that the homomorphism

δn:E2n,0→Gn (resp. γn:Gn→E20,n) \delta^n : E_2^{n,0} \to G^n \text{ (resp. } \gamma^n : G^n \to E_2^{0,n})

is bijective for every nn.

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.