Exercise 6, § 3
Algebra, X, p. 180
Bourbaki marks this one as harder than the rest.
Let be a left -module. One calls presentation of length or -presentation of an exact sequence
where is a free left -module (). One says that the presentation is finite if all the are free modules of finitely generated type.
If is a finitely generated left -module, one denotes by the supremum (finite or equal to ) of the integers such that possesses a finite -presentation. If is not of finite type, one sets .
a) Let be an exact sequence of left -modules. Then one has .
b) Let be a finite -presentation of ; if , now prove that is a finitely generated -module (use exercise 5, b)).
c) Now prove that, under the hypotheses of a), one has
(If ), now prove by induction on that , reasoning as in a) and using b).)
d) Now prove that, under the hypotheses of a), one has
(Same method as in c). Deduce that, if , then .
e) Deduce from a), c) and d) that, if , one has
In particular, in order that admit a finite presentation it is necessary and sufficient that this be so for and .
f) Let be two submodules of an -module . Suppose that and admit a finite presentation. In order that admit a finite presentation, it is necessary and sufficient that be of finite type.
Solution
No solution has been written yet.