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
- For the empty set we must have
, the zero module - For the singleton set we likely have
I mentioned that we will eventually see that left adjoints commute with colimits; e.g., disjoint unions in
This inspired us to realize that only possible definition of
We then briefly outlined:
- The
-module structure on - The arrow function of the functor
, i.e., how each set map should be sent to an -module morphism - A set map
sending each element to the "basis element" (which is the formal sum with coefficient for and for all other elements of ). These set maps are the components of the unit of the adjunction - The map that takes each module morphism
to a set map - The inverse map that takes each set map
to a module morphism
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:
- what it means for a module to be free
- the submodule generated by a subset
- what it means for a subset to generate
- what it means for a module to be cyclic
Concepts
Free modules
Examples of free modules
Generators for modules and submodules
References
- Dummit & Foote, Abstract Algebra: Section 10.3