Bourbaki

Exercise 19, § 8

Algebra, X, p. 204

Bourbaki marks this one as harder than the rest.

a) Let nn be an integer ⩾0\geqslant 0, (Mα)α∈I(M_\alpha)_{\alpha \in I} an inductive system of AA-modules, MM its limit. Assume that Card(I)⩽ℵn\mathrm{Card}(I) \leqslant \aleph_n (E, III, p. 87, Exercise 10) and that there exists an integer rr such that dpA(Mα)⩽r\mathrm{dp}_A(M_\alpha) \leqslant r for every α∈I\alpha \in I. Now prove that one has dpA(M)⩽r+n+1\mathrm{dp}_A(M) \leqslant r + n + 1 (reason by induction on nn, using Exercise 18, a) and Exercise 17).

b) Assume that every left ideal of AA is generated by a family of elements of cardinal ⩽ℵn\leqslant \aleph_n. Prove that one has dpA(M)⩽dplA(M)+n+1\mathrm{dp}_A(M) \leqslant \mathrm{dpl}_A(M) + n + 1 for every AA-module MM generated by a family of elements of cardinal ⩽ℵn\leqslant \aleph_n. Deduce the inequalities

dh(A)⩽td(A)+n+1and∣dh(A)−dh(A∘)∣⩽n+1. \mathrm{dh}(A) \leqslant \mathrm{td}(A) + n + 1 \quad \text{and} \quad |\mathrm{dh}(A) - \mathrm{dh}(A^\circ)| \leqslant n + 1 .
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.