2025-10-09

This following is a very brief summary of what happened in class on 2025-10-09.

We began by considering the possibility of a left adjoint to the forgetful functor U:R-Mod→Set. First, we described the properties such an adjoint would need to have. We then carried out an analysis of what properties F(X) would need to possess for some particular sets. We quickly deduced that:

I mentioned that we will eventually see that left adjoints commute with colimits; e.g., disjoint unions in Set, direct sums in R-Mod. Once we know this, we can immediately deduce that for any set X we must have

F(X)≃F(⨆x∈X{x})≃⨁x∈XF({x})≃⨁x∈XR

This inspired us to realize that only possible definition of F(X) must be ⨁x∈XR. In the language of "formal sums," this means that the set of elements of F(X) is the set of all finite, formal R-linear combinations of elements of X. We called F(X) the free module on X.

We then briefly outlined:

For most of these items, we explicitly defined the maps, but then simply noted what one would need to check. (I promise that none of those things we skipped actually checking are very devious or interesting!)

We ended by defining:

Concepts


Free modules
Examples of free modules
Generators for modules and submodules

References