Flat Modules, Direct Limits and Inverse Limits
Handbook guide to flat modules, direct limits and inverse limits with core definitions, structural results, reasoning methods and verification checks.
How the topic fits together
Flat Modules
This source section supplies the definitions, constructions and formal results used in this article. The sequence of results is preserved so later claims are not detached from their prerequisites.
Direct and Inverse Limits
This source section supplies the definitions, constructions and formal results used in this article. The sequence of results is preserved so later claims are not detached from their prerequisites.
Core definitions and structural results
The following cards retain the mathematical content of the source while condensing long proofs into verification strategies. Numerical examples are treated as examples, not universal requirements.
Theorem
If M is an arbitrary left R-module, then M can be embedded in an injective left R-module.
Proof / verification strategy: Use the universal or lifting property that defines the construction, then check naturality and the effect on exact sequences.
Definitions and Comments We have seen that an R-module M is projective iff
One has seen that an R-module M is projective iff its covariant hom functor is exact, and M is injective iffits contravariant hom functor is exact. It is natural to investigate the exactness of the tensor functor M ⊗R , and as before we avoid complications by assuming all rings commutative. Call M is flat if M ⊗R is exact. Since the tensor functor is right exact by (10.4.4), an equivalent statement is that if f : A →B is an injective R-module homomorphism, then 1 ⊗f : M ⊗A →M ⊗B is injective.
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Example Since Z2 ⊗Z
Since Z2 ⊗Z is not exact (Section 10.4, Problem 6), Z2 is not a flat Z-module. The next result is the analog for flat modules of property (10.5.4) of projective modules.
Proof / verification strategy: Treat this as an illustration of the surrounding definitions. Recompute the stated relations directly and keep the numerical or structural choices local to the example.
Proposition
The direct sum ⊕iMi is flat if and only if each Mi is flat.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Corollary
Every projective module, hence every free module, is flat.
Proof / verification strategy: Use the universal or lifting property that defines the construction, then check naturality and the effect on exact sequences.
Theorem
A Z-module is flat iffit is torsion-free.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Corollary
The additive group of rationals Q is a flat but not projective Z-module.
Proof / verification strategy: Use the universal or lifting property that defines the construction, then check naturality and the effect on exact sequences.
Definition
If f : R →S is a ring homomorphism and M is an S-module, one can create an R-module structure on M by rx = f(r)x, r ∈R, x ∈M. This is a base change by restriction of scalars. If f : R →S is a ring homomorphism and M is an R-module, one can make S ⊗R M into an S-module via s(s′ ⊗x) = ss′ ⊗x, s, s′ ∈S, x ∈M. This is a base change by extension of scalars.
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Definition
The R-algebra A is finitely generated if there are elements a1, . . . , an ∈A such that every element of A is a polynomial in the ai. Equivalently, the algebra homomorphism from the polynomial ring R[X1, . . . , Xn] →A determined by Xi →ai, i = 1, . . . , n, is surjective. Thus A is a quotient of the polynomial ring. It is important to note that if A is finitely generated as an R-module, then it is finitely generated as an R-algebra. [If a = r1a1 + · · · + rnan, then a is certainly a polynomial in the ai.]
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Direct Systems
Direct Systems A directed set is a partially ordered set I such that given any i, j ∈I, there exists k ∈I such that i ≤k and j ≤k. A typical example is the collection of finite subsets of a set, ordered by inclusion. If A and B are arbitrary finite subsets, then both A and B are contained in the finite set A ∪B. Now suppose I is a directed set and one has a collection of objects Ai, i ∈I, in a category C.
Proof / verification strategy: Partition the finite set into cosets or orbits, compare cardinalities, and use divisibility or stabiliser information to obtain the structural conclusion.
Direct Limits
Direct Limits Suppose that {Ai, h(i, j), i, j ∈I} is a direct system. The direct limit of the system will consist of an object A and morphisms αi : Ai →A. Just as with coproducts, we want to lift morphisms fj : Aj →B to a unique f : A →B, that is, fαj = fj for all j ∈I. But we require that the maps αj be compatible with the h(i, j), in other words, αjh(i, j) = αi whenever i ≤j.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Examples
1. A coproduct is a direct limit, as discussed above. In particular, a direct sum of modules is a direct limit. 2. Any module is the direct limit of its finitely generated submodules. [Use the direct system indicated in (10.9.1).] 3.
Proof / verification strategy: Treat this as an illustration of the surrounding definitions. Recompute the stated relations directly and keep the numerical or structural choices local to the example.
Theorem
If {Mi, h(i, j), i, j ∈I} is a direct system of R-modules, then the direct limit of the system exists.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Inverse Systems and Inverse Limits Inverse limits are dual to direct limits. An
Inverse Systems and Inverse Limits Inverse limits are dual to direct limits. An inverse system is defined as in (10.9.1), except that if i ≤j, then h(i, j) maps “backwards” from Aj to Ai. If we apply h(j, k) followed by h(i, j), we get h(i, k); as before, h(i, i) is the identity on Ai. The inverse limit of the inverse system {Ai, h(i, j), i, j ∈I} is an object A along with morphisms pi : A →Ai.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Theorem
If {Mi, h(i, j), i, j ∈I} is an inverse system of R-modules, then the inverse limit of the system exists.
Proof / verification strategy: Start from the stated definitions, prove each required implication or inclusion separately, and use the immediately preceding structural result where it shortens the argument.
Example
Recall from Section 7.9 that a p-adic integer can be represented as a0 + a1p + a2p2 + · · ·, where the ai belong to {0, 1, . . . , p −1}. If we discard all terms after ar−1pr−1, r = 1, 2, . . ., we get the ring Zpr. These rings form an inverse system; if x ∈Zps and r ≤s, we take h(r, s)x to be the residue of x mod pr. The inverse limit of this system is the ring of p-adic integers.
Proof / verification strategy: Treat this as an illustration of the surrounding definitions. Recompute the stated relations directly and keep the numerical or structural choices local to the example.
Definitions and Comments
Let G be an abelian group, and T the torsion subgroup of G (the elements of G of finite order). Then G/T is torsion-free, since n(x+T) = 0 implies nx ∈T, hence x ∈T. If p is a fixed prime, the primary component Gp associated with p consists of all elements whose order is a power of p. Note that Gp is a subgroup of G, for if pna = pmb = 0, n ≥m, then pn(a −b) = 0.
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Proposition
The torsion subgroup T is the direct sum of the primary components Gp, p prime.
Proof / verification strategy: Assume a non-trivial factorisation or divisibility relation and use degree, content, ideal or prime-divisibility constraints to force one factor to be a unit or to obtain a contradiction.
Definition
A Pr¨ufer group, also called a quasicyclic group and denoted by Z(p∞), is a p-primary component of Q/Z, the rationals mod 1. Since every element of Q/Z has finite order, it follows from (A10.2) that Q/Z = p Z(p∞). Now an element of Q/Z whose order is a power of p must be of the form a/pr + Z for some integer a and nonnegative integer r. It follows that the elements ar = 1/pr +Z, r = 1, 2, . . ., generate Z(p∞).
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Quick-reference relationships
Problem-solving workflow
Fix the coefficient ring and variance
State whether modules are left/right modules and whether a functor is covariant or contravariant.
Write the maps, not just the objects
Kernels, images, exactness and universal properties depend on the actual homomorphisms.
Use the appropriate universal property
Direct sums, products, tensor products, projectives, injectives and limits are best handled by their mapping property.
Check exactness at each position
Verify image equals kernel rather than relying on the appearance of a diagram.
Choose a resolution only when needed
Derived constructions should be tied to projective or injective resolutions and independence from the chosen resolution.
Test naturality and compatibility
For induced maps, ensure compositions and commutative squares behave as required.
Worked-solution emphasis from the supplied source
The supplied worked solutions for this section repeatedly test polynomial, degree, field, module, homomorphism, exact, injective, functor. These checks are used here as verification themes rather than copied as answer text.
The supplied worked solutions for this section repeatedly test order, subgroup, coset, kernel, ideal, quotient, polynomial, root. These checks are used here as verification themes rather than copied as answer text.
Common mistakes and boundary conditions
- Forgetting the coefficient ring when comparing modules.
- Assuming tensor product preserves every exact sequence.
- Confusing direct sum with direct product for infinite families.
- Reading exactness from a diagram without checking image equals kernel.
Verification checklist
- State the ambient algebraic structure and operation before applying a theorem.
- Record every hypothesis that controls the result: finiteness, commutativity, normality, primality, separability, exactness or other section-specific conditions.
- Distinguish a definition from a theorem that follows from it.
- Check whether a map is well-defined before using its kernel, image, inverse or induced map.
- Use a concrete example only as a check; do not promote an illustrative value or pattern to a universal rule.
- When a quotient, localisation or extension is constructed, identify the canonical map and what becomes equal, invertible or fixed.
Source coverage map
| Source section | Subject | PDF pages analysed |
|---|---|---|
| 10.8 | Flat Modules | 217–218 |
| 10.9 | Direct and Inverse Limits | 219–223 |
Related Mathematics pages
Source note: synthesised from the supplied abstract-algebra PDF. The complete 298-page file, including diagrams and worked solutions, was reviewed. Source-identifying author and bibliographic personal details are intentionally omitted. Formal proofs are condensed; the page does not claim requirements or values not supported by the supplied mathematics.