Generators for modules and submodules

Submodule generated by a subset

Open up a book on abstract algebra, and you're likely to see the following definition:

Definition of submodule generated by a subset

Suppose M is an R-module and X is any collection of elements in M. The submodule of M generated by X is the collection of all finite R-linear combinations of elements in X. In other words, it is the subset of all elements of the form βˆ‘x∈Xrxx, where rx∈R, all but finitely many of which are zero.

This submodule is usually denoted RX, which is simultaneously understandable and horrible. It is the smallest submodule of M that contains the elements of X.

Of course, we should officially verify that the set RX is indeed a submodule of M, and that it truly is the smallest submodule of M that contains X. This would be relatively straightforward, but there is an alternate definition of RX that makes all of those properties immediate.

Consider the following equivalent definition, which uses our free module construction. By the universal property of the free module F(X), the set inclusion i:X→U(M) corresponds to a module morphism f:F(X)→M. The image of this morphism is a submodule of M that contains X. By the construction of the free module F(X), this image is exactly the set RX described above. Furthermore, if N is any submodule of M that contains X, then the inclusion j:X→U(N) corresponds to a module morphism g:F(X)→N, and again by the definition of F(X) the image of this morphism is RX. Thus RX is a submodule of N, making it the smallest submodule of M that contains X.


Generators for a given submodule

If N is a submodule of M, we say a subset of elements X generates N if N=RX. In this case, we call X a set of of generators (or a generating set) for N, and we say N is generated by X. In terms of elements, N is generated by X exactly when every n∈N can be expressed in the form n=βˆ‘x∈Xrxx for some rx∈R (all but finitely many zero); note that such an expression does not have to be unique.

If there exists a finite set X that generates N, then we say N is finitely generated.

If there exists a singleton set that generates N, then we say N is cyclic. In this case, this is equivalent to the existence of a single element n0∈N such that every element n∈N can be expressed in the form n=rn0 for some r∈N; as before, this expression does not have to be unique.

Connecting everything back to free modules once more, we see that N is generated by X exactly when the module morphism F(X)β†’N (corresponding to the inclusion Xβ†’U(N)) is surjective. The submodule N is cyclic exactly when there is a surjection F({βˆ™})β†’N, where {βˆ™} is a/the singleton set.


A word on relations

A common way to describe a group is to give a presentation, which consists of a list of generators together with their "fundamental" relations. We can make that concept clear in the context of modules.

Suppose M is a module. A subset X1 of M is a set of generators exactly when the corresponding module morphism Ο€1:F(X1)β†’M is surjective. Moreover, the kernel of this morphism captures all of the relations between those generators, as it consists exactly of every possible R-linear combination of the generators that equals zero (in M). We can now say that a set of "fundamental" relations on the generators is precisely a set X2 of generators for ker⁑(Ο€1). As before, this corresponds to a surjective module morphism F(X2)β†’ker⁑(Ο€1).

Composing this new module morphism with the inclusion of i:ker⁑(Ο€1)β†’F(X1), we then have a chain of morphisms

F(X2)β†’iβˆ˜Ο€2F(X2)β†’Ο€1M

with ker⁑(Ο€1)=im(iβˆ˜Ο€2). This is the start of an exact sequence of morphisms, something to be explored later.


Suggested next notes

Bimodules
Tensor Products I - Extending scalars
Exact sequences