Bourbaki

Exercise 6, § 3

Algebra, X, p. 180

Bourbaki marks this one as harder than the rest.

Let MM be a left AA-module. One calls presentation of length nn or nn-presentation of MM an exact sequence

Ln→Ln−1→⋯→L1→L0→M→0 L_n \to L_{n-1} \to \cdots \to L_1 \to L_0 \to M \to 0

where LiL_i is a free left AA-module (0⩽i⩽n0 \leqslant i \leqslant n). One says that the presentation is finite if all the LiL_i are free modules of finitely generated type.

If MM is a finitely generated left AA-module, one denotes by λ(M)\lambda(M) the supremum (finite or equal to +∞+\infty) of the integers n⩾0n \geqslant 0 such that MM possesses a finite nn-presentation. If MM is not of finite type, one sets λ(M)=−1\lambda(M) = -1.

a) Let 0→P→N→M→00 \to P \to N \to M \to 0 be an exact sequence of left AA-modules. Then one has λ(N)⩾inf⁡(λ(P),λ(M))\lambda(N) \geqslant \inf (\lambda(P), \lambda(M)).

b) Let Ln→dnLn−1→⋯→L0→M→0L_n \xrightarrow{d_n} L_{n-1} \to \cdots \to L_0 \to M \to 0 be a finite nn-presentation of MM; if λ(M)>n\lambda(M) > n, now prove that Ker⁡(dn)\operatorname{Ker}(d_n) is a finitely generated AA-module (use exercise 5, b)).

c) Now prove that, under the hypotheses of a), one has

λ(M)⩾inf⁡(λ(N),λ(P)+1) \lambda(M) \geqslant \inf (\lambda(N), \lambda(P) + 1)

(If n⩽inf⁡(λ(N),λ(P)+1)n \leqslant \inf (\lambda(N), \lambda(P) + 1)), now prove by induction on nn that λ(M)⩾n\lambda(M) \geqslant n, reasoning as in a) and using b).)

d) Now prove that, under the hypotheses of a), one has

λ(P)⩾inf⁡(λ(N),λ(M)−1) \lambda(P) \geqslant \inf (\lambda(N), \lambda(M) - 1)

(Same method as in c). Deduce that, if λ(N)=+∞\lambda(N) = +\infty, then λ(M)=λ(P)+1\lambda(M) = \lambda(P) + 1.

e) Deduce from a), c) and d) that, if N=M⊕PN = M \oplus P, one has

λ(N)=inf⁡(λ(M),λ(P)) \lambda(N) = \inf (\lambda(M), \lambda(P))

In particular, in order that NN admit a finite presentation it is necessary and sufficient that this be so for MM and PP.

f) Let N1,N2N_1, N_2 be two submodules of an AA-module MM. Suppose that N1N_1 and N2N_2 admit a finite presentation. In order that N1+N2N_1 + N_2 admit a finite presentation, it is necessary and sufficient that N1∩N2N_1 \cap N_2 be of finite type.

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.