Sums of submodules

Given any family of submodules of a given R-module M, is there a "smallest" submodule of M that contains them all? In other words, is there an analogue of the union operation in Set? Yes. It is called the sum of the family of submodules.


Sum of two submodules

Suppose N1 and N2 are two submodules of an R-module M. Let N1+N2 denote the set whose elements consist of all sums of the form n1+n2 where n1∈N1 and n2∈N2.[1] This set of elements is certainly a subset of the set of elements of M, and is easily seen to be a submodule. Since each submodule N1,N2 contains 0M, this submodule N1+N2 contains both N1 and N2. Finally, if P is any submodule of M that contains N1 and N2, then by closure under addition P must also contain N1+N2.

In other words, N1+N2 is the smallest submodule of M that contains N1 and N2. We call N1+N2 the sum of the submodules N1 and N2.


Sum of finitely many submodules

Now suppose N1,N2,…,Nk is a finite collection of submodules of M. As you might predict, the set of all sums of the form βˆ‘i=1kni with ni∈Ni is a submodule of M that contains the original submodules, and is the smallest such submodule of M. It is called the sum of the family of submodules N1,N2,…,Nk.


Sum of an arbitrary family of submodules

Most generally, suppose {Ns∣s∈S} is any family of submodules of M, indexed by some set S. The sum of this family of submodules is a submodule, denoted βˆ‘s∈SNs, and is the smallest submodule of M that contains every Ns in the family. As a set, it consists of all finite sums of the form βˆ‘s∈Sns.


What's really going on

Sums of submodules has a simple interpretation from the point of view of category theory. For each R-module M, let M be the category whose objects are the submodules N of M, and for which there is an arrow N1β†’N2 exactly when N1 is a submodule of N2. (In other words, the arrows in M correspond to the inclusion morphisms of submodules of M.) The sum of a family of submodules of M is then exactly the coproduct of the corresponding family of objects in M.


Direct sums of modules vs. sums of submodules

If you've read Direct sums of modules you might be wondering why there is a separate note on sums of submodules. Aren't the two notions the same? Sadly, no, but there's a reason for the suggestive name choice. Both constructions satisfy the "same" universal property, which is that of the general categorical coproduct, only they satisfy their universal properties in slightly different categories.

As discussed above, the sum of a family of submodules of a fixed module M is a coproduct in the associated category M. The analogous construction in Set is that of the union of a collection of subsets of a given set X.

A direct sum of arbitrary R-modules is a coproduct in the category Rβˆ’Mod. It is most closely analogous to the disjoint union in Set, and should be viewed as a module constructed "externally" from the original family of modules (which are not assumed to have any relationship or way to be compared).


Suggested next note

Direct products vs. direct sums vs. sums


  1. Note that this operation is "real" in that is is the additive operation in the given module M. It is a not a formal sum. β†©οΈŽ