Bourbaki

Exercise 17, § 2

Algebra, II, p. 186

Bourbaki marks this one as harder than the rest.

a) Let M, N, M’, N’ be four submodules of a module E, such that M∩N=M′∩N′=PM \cap N = M' \cap N' = P. Now prove that one has

M=(M+(N∩M′))∩(M+(N∩N′)). M = (M + (N \cap M')) \cap (M + (N \cap N')).
Deduce that if M is irreducible in E, one necessarily has P=M′∩NP = M' \cap N or P=N′∩NP = N' \cap N. b) Let (Ni)1≤i≤n(N_i)_{1 \leq i \leq n} be a finite family of submodules of E irreducible in E, and let M be its intersection. Now prove that if (Pj)1≤j≤m(P_j)_{1 \leq j \leq m} is a finite family of submodules of E such that M=⋂jPjM = \bigcap_j P_j, then, for every index i such that 1≤i≤n1 \leq i \leq n, there exists an index φ(i)\varphi(i) such that 1≤φ(i)≤m1 \leq \varphi(i) \leq m and such that, if one sets Ni′=⋂k≠iNkN'_i = \bigcap_{k \neq i} N_k, one has M=Pφ(i)∩Ni′M = P_{\varphi(i)} \cap N'_i (use a)). Deduce that if none of the PjP_j contains the intersection of the PkP_k of index ≠j\neq j, one has m≤nm \leq n (replace successively the NiN_i by suitable PjP_j, using the preceding result). Conclude that two irreducible decompositions of M in E, one of which is finite, necessarily have the same number of terms (cf. II, p. 188, Exercise 23).

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.