The Tensor Product of Modules

Executive summary

Right exact, and flat is the condition for more

The tensor product converts bilinear maps into linear ones: homomorphisms out of M ⊗ N correspond exactly to balanced bilinear maps from the pair. Being a left adjoint, it preserves colimits and is right exact; it fails to preserve injections, and the modules for which it does are the flat ones. Projective implies flat, flat implies torsion-free, and over a PID all three coincide for finitely generated modules.

Learning objectives

State the universal property of the tensor product.
Prove right exactness from the adjunction.
Give an example where tensoring destroys injectivity.
Define flatness and place it relative to projectivity.
Use extension of scalars.

Section 01Universal property and construction

For a right module M and a left module N over Λ, the tensor product is the abelian group generated by symbols m ⊗ n subject to bilinearity and the balancing relation mλ ⊗ n = m ⊗ λn. Its universal property:

Hom_ℤ(M ⊗_Λ N, P) ≅ Bilin_Λ(M, N; P)

Elements are not all simple tensors

A general element of M ⊗ N is a finite sum of simple tensors, and the representation is not unique. Defining a map on tensors requires checking it is well defined — in practice, defining it as a bilinear map and invoking the universal property, which is exactly what the property is for.

Standard computations
Tensor product	Result	Reason
ℤ/m ⊗ ℤ/n	ℤ/gcd(m, n)	Relations force divisibility
ℤ/m ⊗ ℤ	ℤ/m	ℤ is the unit
ℚ ⊗ ℤ/m	0	Every element is divisible by m in ℚ
ℚ ⊗ ℚ	ℚ	Localisation is idempotent
Λ ⊗_Λ N	N	The unit object

Section 02Right exactness and its failure

Tensoring 0 → ℤ →^×2 ℤ → ℤ/2 → 0 with ℤ/2 gives

ℤ/2 →^{×2 = 0} ℤ/2 → ℤ/2 → 0

The first map is zero rather than injective, so exactness fails on the left. The kernel ℤ/2 is Tor₁(ℤ/2, ℤ/2) — the first derived functor of tensor, appearing exactly where the injection was destroyed.

Right exactness is formal

Tensor is left adjoint to Hom, and left adjoints preserve colimits, hence cokernels. No computation is needed — right exactness is a consequence of the adjunction, and the same argument gives left exactness of Hom.

Section 03Flat modules

M is flat when M ⊗ − is exact. The hierarchy:

Stage 01FreeA direct sum of copies of Λ.
Stage 02ProjectiveA direct summand of a free module.
Stage 03FlatTensoring preserves injections.
Stage 04Torsion-freeOver a domain; strictly weaker than flat in general.

Where the implications are strict
Ring	Flat ⇒ projective?	Torsion-free ⇒ flat?
PID	For finitely generated, yes	Yes
General domain	No — ℚ is flat over ℤ, not projective	No
Noetherian local	For finitely generated, yes	Not in general
Any ring, finitely presented	Yes	—

ℚ is the standard example

ℚ is flat over ℤ because localisation is exact, but it is not projective — it is not a summand of a free abelian group. Flatness is genuinely weaker, and this example is worth carrying.

Section 04Extension of scalars

For a ring map Λ → Λ′, the functor Λ′ ⊗_Λ − carries Λ-modules to Λ′-modules and is left adjoint to restriction of scalars.

Use

Base change

Reduce a module modulo a prime, or extend a real representation to a complex one.

Use

Induced representations

For a subgroup H ≤ G, the functor ℤ[G] ⊗_ℤ[H] − is induction, adjoint to restriction — the source of Shapiro's lemma.

Use

Change of rings

Comparing derived functors before and after base change gives the change-of-rings spectral sequences.

ReferenceFrequently asked questions

Why must one module be a right module and the other a left module?

Because the balancing relation moves a scalar across the tensor sign, which requires it to act on the right of the first factor and the left of the second. Over a commutative ring the distinction dissolves and the result is again a module.

Is the tensor product commutative?

Over a commutative ring, yes, up to natural isomorphism. Over a non-commutative ring the expression N ⊗ M need not even be defined, since the sidedness would be wrong.

When does tensoring preserve infinite products?

Rarely. Tensor preserves coproducts always, being a left adjoint, but products only under finiteness conditions — typically when the module is finitely presented. This asymmetry recurs in universal coefficient arguments.

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 The Tensor Product of Modules. 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 The Tensor Product of Modules as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—right, flat, section, tensor, product—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 The Tensor Product of Modules?