Advanced linear algebra turns linear maps into structural invariants. Bases and matrices are coordinates; the underlying map or module is the object. Canonical forms are useful because they expose invariants that do not depend on a particular basis. This page consolidates the relevant material from the supplied algebra source into a stand-alone handbook chapter.
Learning pathAdvanced Linear Algebra
LevelAdvanced
FormatHandbook guide
Read time12 min
Executive summary
This chapter develops modules over principal ideal domains as part of a connected advanced-algebra learning sequence. The emphasis is on definitions, hypotheses, structural results and repeatable methods rather than historical narrative.
The source material is theorem-rich. Accordingly, the handbook presentation separates vocabulary from results and then adds a verification workflow so that each statement can be applied safely. Mathematical examples in the source are treated as examples, not as universal rules.
Problem-solving workflow
Identify the field or coefficient ring and the vector space or module.
Choose bases only after deciding what structure should be preserved.
Represent the map by a matrix and track how the matrix changes under a basis change.
Use invariant subspaces, cyclic decomposition or elementary divisors to reduce the problem.
Read structural information from the resulting normal or canonical form.
Translate the matrix conclusion back into a basis-independent statement.
Core definitions
Definition
Let M be an R-module. If m ∈M, then its order ideal (or annihilator) is ann(m) = {r ∈R : rm = 0}. We say that m has finite order (or is a torsion1 element) if ann(m) ̸= {0}; otherwise, m has infinite order. When a commutative ring R is regarded as a module over itself, its identity 1 has infinite order, for ann(1) = {0}. Modules over PIDs Order ideals generalize the group-theoretic notion of the order of an element. Recall that if G is an additive abelian group, then an element g ∈G has finite order if ng = 0 for some positive integer n, while g has order d if d is the smallest positive integer with dg = 0. On the other hand, ann(g) is an ideal in Z and, as any nonzero ideal in Z, it is generated by the smallest positive integer in it. Thus, the order ideal ann(g) = (d), the principal ideal generated by the order d of g. In Proposition 7.12, we proved that if M = ⟨m⟩is a cyclic R-module, where R is any commutative ring, then M ∼= R/I. The ideal I in this corollary is ker ϕ, where ϕ : R →M is the map r ↦rm, so that I = ann(m), and ⟨m⟩∼= R/ ann(m).
Definition
If R is a domain and M is an R-module, then M is torsion if t M = M, while M is torsion-free if t M = {0}.
Definition
Let R be a PID and M be an R-module. If P = (p) is a nonzero prime ideal in R, then M is (p)-primary if, for each m ∈M, there is n ≥1 with pnm = 0. If M is any R-module, then its (p)-primary component is MP = {m ∈M : pnm = 0 for some n ≥1}. If we do not want to specify the prime P, we may write that a module is primary (instead of P-primary). It is clear that primary components are submodules. All of the coming theorems in this section were first proved for abelian groups and, later, generalized to modules over PIDs.
Definition
If M is a P-primary R-module, where R is a PID, then the elementary divisors of M are the ideals (pn+1), each repeated with multiplicity UP(n, M). If M is a finitely generated torsion R-module, then its elementary divisors are the elementary divisors of all its primary components. The next definition is motivated by Corollary 5.30: If G is a finite abelian group with elementary divisors {p ei j i }, then |G| = → i j p ei j i .
Definition
If M is a finitely generated torsion R-module, where R is a PID, and if M = R/(c1) ⊕R/(c2) ⊕· · · ⊕R/(ct), where t ≥1 and c1 | c2 | · · · | ct, then (c1), (c2), . . . , (ct) are called the invariant factors of M.
Definition
If G is an abelian group, then dG is the subgroup generated by all the divisible subgroups of G.
Definition
An abelian group G is reduced if dG = {0}; that is, G has no nonzero divisible subgroups. We have just shown that G/dG is always reduced. The reader should compare the roles of the maximal divisible subgroup dG of a group G with that of tG, its torsion subgroup: Modules over PIDs G is torsion if tG = G and it is torsion-free if tG = {0}; G is divisible if dG = G and it is reduced if dG = {0}. The following group has some remarkable properties.
Definition
If D is a divisible abelian group, define δ∞(D) = dimQ(D/t D) and, for all primes p, δp(D) = dimFp(D[p]).
Principal results and structural facts
Key result
Let M and M′ be R-modules, where R is a domain. (i) M/tM is torsion-free. (ii) If M ∼= M′, then t M ∼= t M′ and M/t M ∼= M′/t M′.
Key result
(i) If R is a PID, then every finitely generated R-module M is a direct sum M = t M ⊕F, where F is a finitely generated free R-module. (ii) If M and M′ are finitely generated R-modules, where R is a PID, then M ∼= M′ if and only if t M ∼= t M′ and rank(M/t M) = rank(M′/t M′).
Key result
If R is a PID, then every submodule H of a free R-module F is itself free, and rank(H) ≤rank(F). In particular, every projective R-module H is free.
Key result
(i) Every torsion abelian group G is a direct sum of its p-primary components: G = p G p. (ii) Every torsion R-module M, where R is a PID, is a direct sum of its P-primary components: M = P MP.
Key result
If R is a PID, then every finitely generated module M is a direct sum of cyclic modules in which each cyclic summand is either primary or is isomorphic to R.
Key result
Every finitely generated abelian group is a direct sum of cyclic groups, each of prime power order or infinite. When are two finitely generated modules M and M′ over a PID isomorphic? Before stating the next lemma, recall that M/pM is a vector space over R/(p), and we define d(M) = dim(M/pM). In particular, d(pM) = dim(pM/p2M) and, more generally, d(pn M) = dim(pn M/pn+1M).
Key result
If M and M′ are P-primary R-modules, where R is a PID, then M ∼= M′ if and only if UP(n, M) = UP(n, M′) for all n ≥0.
Key result
If R is a PID, then every finitely generated torsion R-module M is a direct sum of cyclic modules M = R/(c1) ⊕R/(c2) ⊕· · · ⊕R/(ct), where t ≥1 and c1 | c2 | · · · | ct.
Key result
computes the exponent of a finitely generated torsion module over a PID; it is the last invariant factor (ct). Modules over PIDs
Key result
If R is a PID, then two finitely generated Rmodules are isomorphic if and only if their torsion submodules have the same invariant factors and their free parts have the same rank.
Key result
(i) For any abelian group G, the subgroup dG is the unique maximal divisible subgroup of G. (ii) Every abelian group G is a direct sum G = dG ⊕R, where d R = {0}. Hence, R ∼= G/dG has no nonzero divisible subgroups.
Key result
If G and H are divisible p-primary abelian groups, then G ∼= H if and only if G[p] ∼= H[p].
Key result
Let k be an algebraically closed field, let k× be its multiplicative group, and let T be the torsion subgroup of k×. (i) If k has characteristic 0, then T ∼= Q/Z, and k× ∼= (Q/Z) ⊕V , where V is a vector space over Q. (ii) If k has prime characteristic p, then T ∼= q̸=p Z(q∞). If k is the algebraic closure of Fp, then5 k× ∼= q̸=p Z(q∞).
Key result
Let T : V →V be a linear transformation on a vector space V over a field k. If X and Y are bases of V , then there is a nonsingular matrix P with entries in k so that Y [T ]Y = P ( X[T ]X ) P−1. Conversely, if B = P AP−1, where B, A, and P are n × n matrices with entries in k and P is nonsingular, then there is a linear transformation T : kn →kn and bases X and Y of kn such that B = Y [T ]Y and A = X[T ]X. We now consider how to determine whether two given matrices are similar; that is, whether they arise from the same linear transformation. 6There exist infinite nonabelian groups all of whose proper subgroups are finite.
Source-grounded examples
Worked source example
If k is a field, how many k[x]-modules are there of order (x −1)3(x + 1)2? By the primary decomposition, every k[x]-module of order (x −1)3(x + 1)2 is the direct sum of primary modules of order (x −1)3 and (x + 1)2, respectively. There are three modules of order (x −1)3, described by the elementary divisors (x −1, x −1, x −1), (x −1, (x −1)2), and (x −1)3; there are two modules of order (x + 1)2, described by the elementary divisors (x + 1, x + 1) and (x + 1)2. Therefore, to isomorphism, there are six modules of order (x −1)3(x + 1)2. ◀
Worked source example
We displayed the elementary divisors of k[x]-modules of order (x −1)3(x + 1)2 in Example 9.16; here are their invariant factors. Elementary divisors ↔ Invariant factors (x −1, x −1, x −1, x + 1, x + 1) ↔x −1 | (x −1)(x + 1) | (x −1)(x + 1) (x −1, (x −1)2, x + 1, x + 1) ↔(x −1)(x + 1) | (x −1)2(x + 1) ((x −1)3, x + 1, x + 1) ↔x + 1 | (x −1)3(x + 1) (x −1, x −1, x −1, (x + 1)2) ↔x −1 | x −1 | (x −1)(x + 1)2 (x −1, (x −1)2, (x + 1)2) ↔x −1 | (x −1)2(x + 1)2 ((x −1)3, (x + 1)2) ↔(x −1)3(x + 1)2 ◀
How to reason with these results
Most advanced-algebra problems become manageable when the representation is separated from the invariant structure. Begin with the definition, then decide whether the problem is asking for an elementwise calculation, a statement about a morphism, or a classification up to isomorphism. That choice determines the correct proof language.
When a theorem gives a structural conclusion, do not jump directly to the conclusion. Write the hypotheses next to the object you are studying and check them one by one. If a hypothesis fails, either strengthen the object, pass to a quotient or localisation where the theorem applies, or use a more elementary argument.
For computational work, record each transformation together with the equivalence relation it preserves. In algebra, row operations, similarity, quotienting, localisation and isomorphism preserve different kinds of information. A calculation is useful only when the preserved structure matches the question.
Common failure modes
Failure mode
Control
Confusing a linear map with one particular matrix representing it.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Changing basis on only the domain or codomain when similarity requires a coordinated change.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Assuming diagonalisation when the polynomial or field conditions do not permit it.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Ignoring characteristic-dependent behaviour.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Treating canonical-form calculations as mere row reduction without tracking the allowed equivalence relation.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Verification checklist
The ambient set, ring, field, group, module or category has been stated.
Every operation and map used is well-defined in that setting.
The hypotheses of each structural result have been checked before use.
Representatives, coordinates or generators have not been confused with the underlying object.
Existence and uniqueness have been separated where both matter.
The final result has been checked against the original defining relation or universal property.
Quick questions
What should I identify first in a problem about modules over principal ideal domains?
Start with the ambient algebraic structure, its operation or maps, and the exact hypotheses. Most incorrect solutions begin by using a familiar rule that is not valid in the stated structure.
How should definitions be used in proofs?
Expand the definition at the point where it becomes useful. Definitions are not background prose; they are the conditions that determine what must be proved and which implications are available.
When is a structural theorem safer than direct calculation?
Use a structural theorem when its hypotheses are satisfied and the calculation would otherwise depend on arbitrary coordinates, representatives or generators. The theorem usually identifies an invariant that survives those choices.
How can a final answer be checked?
Substitute the result back into the defining relation, verify any required closure or map property, and check edge cases such as zero, the identity, the empty object or degenerate quotients where relevant.
Connections within the handbook
Source basis: supplied advanced algebra reference. Source-identifying authorship, publisher information, acknowledgements and biographical material are intentionally omitted. Mathematical terminology and results are retained in handbook form.
