Projective Modules over a Principal Ideal Domain

Executive summary

Every submodule of a free module is free

Over a principal ideal domain the theory becomes as explicit as linear algebra. Submodules of free modules are free, so projective and free coincide, and every module has a projective resolution of length at most one. Finitely generated modules decompose into a free part and a torsion part with a canonical list of invariant factors. This is why abelian groups — modules over ℤ — are the standard proving ground for the whole subject.

Learning objectives

State the structure theorem for finitely generated modules over a PID.
Explain why projective and free coincide over a PID.
Construct the canonical length-one projective resolution.
Relate invariant factors to elementary divisors.
Explain the consequence that Extⁿ and Tor_n vanish for n > 1.

Section 01Submodules of free modules

Over a PID, every submodule of a free module is free, with rank at most that of the ambient module. For finitely generated modules the proof is a straightforward induction; the general case needs transfinite methods but the statement is the same.

Two immediate consequences

First, projective equals free, since a direct summand of a free module is a submodule of it. Second, the kernel of any map from a free module is free — so a projective resolution can be stopped after one step. Both facts fail over general rings, and recovering them is what much of the later theory is about.

Section 02The structure theorem

Every finitely generated module over a PID R decomposes as

M ≅ R^r ⊕ R/(d₁) ⊕ … ⊕ R/(d_k), d₁ | d₂ | … | d_k

with r the rank and the d_i the invariant factors, unique up to units. Splitting each cyclic factor into prime powers gives the elementary divisors — the same module, presented differently.

Reading the decomposition
Feature	Meaning
r > 0	The module has a free part; it is not torsion
k = 0	The module is free of rank r
r = 0	The module is torsion — finite when R = ℤ
d₁ a unit	That factor is trivial and is discarded
All d_i prime powers of one prime	The module is p-primary

The same computation as Smith normal form

Presenting M by generators and relations gives a matrix over R; its Smith normal form has the invariant factors on the diagonal. The structure theorem and the normal form are two statements of one algorithm.

Section 03Short resolutions and vanishing

AlgorithmThe canonical resolution over a PIDin: a module over a PID → out: a length-one projective resolution

Choose a surjection ε: F₀ ↠ M with F₀ free.
Set F₁ = ker ε. Free, because submodules of free modules over a PID are free.
The sequence 0 → F₁ → F₀ → M → 0 is a projective resolution of length 1.
Hence Extⁿ(M, −) = 0 and Tor_n(M, −) = 0 for all n ≥ 2.

Why abelian groups are the standard example

Over ℤ everything above holds, so Ext and Tor reduce to a single group each and are computable by hand. Every general theorem in this subject should be tested against ℤ first — if it fails there, it fails everywhere.

ReferenceFrequently asked questions

Does the structure theorem need finite generation?

Yes. Infinitely generated modules over ℤ can be complicated — the additive group of the rationals is torsion-free but not free, and divisible groups behave quite differently. The clean decomposition is a finitely generated phenomenon.

Are invariant factors or elementary divisors preferable?

Invariant factors form a divisibility chain and are what Smith normal form produces directly; elementary divisors separate the primes and are better for questions localised at one prime. They carry identical information.

What is a hereditary ring?

One in which every submodule of a projective module is projective, equivalently of global dimension at most 1. PIDs and Dedekind domains are the standard examples, and hereditary is exactly the hypothesis that makes higher Ext and Tor vanish.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Projective Modules over a Principal Ideal Domain. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Projective Modules over a Principal Ideal Domain as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—projective, modules, structure, free, theorem—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Projective Modules over a Principal Ideal Domain?