A tensor product replaces a function of two variables by an additive function of one variable. Its defining relation moves a scalar from the right-hand action of the first factor to the left-hand action of the second. This is the operation that will represent functors between module categories.

6.1. A construction from relations

Definition 6.1. Balanced maps

Let \(B\) be a right \(R\)-module, \(M\) a left \(R\)-module, and \(A\) an abelian group. A function \(\beta:B\times M\to A\) is biadditive if it is additive in each variable. It is \(R\)-balanced if, in addition,

\[\beta(br,m)=\beta(b,rm)\quad(b\in B,\ r\in R,\ m\in M).\]

Alphabeta Math

Worked example for Definition 6.1

Counterexample: Biadditive does not mean balanced

For example, multiplication \(R\times R\to R\) is biadditive and balanced: \((br)m=b(rm)\). Over a noncommutative ring, one cannot interchange the two factors or move a scalar through the wrong side of an action.

Theorem 6.2. Construction and universal property

There is an abelian group \(B\otimes_R M\), with a balanced map \((b,m)\mapsto b\otimes m\), such that for every abelian group \(A\), composition with this map gives a bijection

\[\operatorname{Hom}_{\mathbb Z}(B\otimes_R M,A)\cong\{R\text{-balanced maps }B\times M\to A\}.\]

Every element of \(B\otimes_R M\) is a finite sum of elements \(b\otimes m\), called pure tensors. This universal property determines the tensor product up to a unique isomorphism preserving pure tensors.

Alphabeta Math: construction · universal property · uniqueness

Worked example for Theorem 6.2

Counterexample: Biadditive does not mean balanced

Proof.

Form the free abelian group \(F=\mathbb Z^{(B\times M)}\) from Theorem 5.8, with generator \([b,m]\) for each pair. Let \(L\subseteq F\) be the subgroup generated by all elements

\[ [b+b',m]-[b,m]-[b',m],\quad [b,m+m']-[b,m]-[b,m'],\quad [br,m]-[b,rm]. \]

The generated subgroup consists of finite integer linear combinations of these relations: such combinations form a subgroup containing the relations and lie in every subgroup containing them. Set \(B\otimes_R M=F/L\), and write \(b\otimes m\) for the class of \([b,m]\). The quotient laws in Chapter 5 make this an abelian group. The imposed relations give biadditivity and balancing. They also imply \(0\otimes m=b\otimes0=0\), \((-b)\otimes m=-(b\otimes m)\), and \(b\otimes(-m)=-(b\otimes m)\). Therefore the integer coefficients of a finite sum of generator classes can be absorbed into their first factors, proving the finite-sum assertion.

A function \(\beta:B\times M\to A\) extends uniquely to a homomorphism \(F\to A\), by the free abelian group property. It kills \(L\) precisely when it satisfies the three displayed types of relation. The quotient property then gives a unique homomorphism \(B\otimes_R M\to A\). This proves the bijection. Given any other object with this property, applying the property in both directions produces maps preserving the defining pairs. Their composites preserve every pure tensor, and hence every finite sum, so both composites are identities.

□

6.2. Bimodules produce functors

Proposition 6.3. Induced actions and functoriality

If \(B\) is an \(S\)-\(R\) bimodule, then \(B\otimes_R M\) is a left \(S\)-module by \(s(b\otimes m)=(sb)\otimes m\). Bimodule maps \(u:B\to B'\) and left-module maps \(f:M\to M'\) induce left \(S\)-module maps

\[u\otimes f:B\otimes_R M\longrightarrow B'\otimes_R M',\qquad b\otimes m\longmapsto u(b)\otimes f(m).\]

These operations form a bifunctor \((S\text{-}\mathrm{Mod}\text{-}R)\times(R\text{-}\mathrm{Mod})\to S\text{-}\mathrm{Mod}\), additive separately on morphisms. In particular, \(B\otimes_R-\) is an additive functor.

Alphabeta Math: induced actions · functoriality

Worked example for Proposition 6.3

Proof.

For fixed \(s\in S\), the map \((b,m)\mapsto(sb)\otimes m\) is biadditive. It is balanced since \(s(br)=(sb)r\), and \(((sb)r)\otimes m=(sb)\otimes rm\). The universal property gives an additive operator on the tensor product. Checking on pure tensors shows \(1x=x\), \((ss')x=s(s'x)\), and \((s+s')x=sx+s'x\). Each identity holds on finite sums by additivity, so these are all left-module laws.

The formula involving \(u,f\) is biadditive and balanced because \(u(br)=u(b)r\) and \(f(rm)=rf(m)\). It therefore gives an additive map, and \(u(sb)=su(b)\) makes it \(S\)-linear. Identity maps and composites have the required formulas on pure tensors, so they agree everywhere. The same calculation gives \((u+v)\otimes f=(u\otimes f)+(v\otimes f)\) and \(u\otimes(f+g)=(u\otimes f)+(u\otimes g)\), proving separate additivity. Finally, if \(M\) is also an \(R\)-\(T\) bimodule, \( (b\otimes m)t=b\otimes(mt)\) is a well-defined right \(T\)-action by the same balanced-map check; it commutes with the left \(S\)-action on pure tensors and hence everywhere.

□

Taking \(u:B\to B'\) and \(f=1_M\) gives a natural transformation \(u\otimes1:B\otimes_R-\Rightarrow B'\otimes_R-\): its naturality square commutes because both composites take \(b\otimes m\) to \(u(b)\otimes f(m)\). Chapter 9 proves that every natural transformation between these functors arises this way.

6.3. Units and associativity

Theorem 6.4. Tensoring with the regular module

There are natural isomorphisms \(R\otimes_R M\cong M\), \(r\otimes m\mapsto rm\), and \(B\otimes_R R\cong B\), \(b\otimes r\mapsto br\). If \(B\) is an \(S\)-\(R\) bimodule, the latter is an isomorphism of \(S\)-\(R\) bimodules.

Alphabeta Math

Worked example for Theorem 6.4

Proof.

The two formulas are biadditive and balanced by the module associativity laws, so define additive maps. They preserve their stated actions by associativity and the bimodule compatibility law. Their inverses are \(m\mapsto1\otimes m\) and \(b\mapsto b\otimes1\). The first is \(R\)-linear because \(1\otimes rm=r\otimes m=r(1\otimes m)\); the second preserves both actions because \(sb\otimes1=s(b\otimes1)\) and \(br\otimes1=b\otimes r=(b\otimes1)r\). The composites are identities: \(1m=m\), \(b1=b\), \(1\otimes rm=r\otimes m\), and \(br\otimes1=b\otimes r\). These checks on pure tensors extend to finite sums. For maps of either factor the formulas commute directly with those maps, proving naturality.

□

Theorem 6.5. Associativity with the correct sides

Let \(C\) be a \(T\)-\(S\) bimodule, \(B\) an \(S\)-\(R\) bimodule, and \(M\) a left \(R\)-module. Then \(C\otimes_S B\) is a \(T\)-\(R\) bimodule, and there is a natural \(T\)-linear isomorphism

\[(C\otimes_S B)\otimes_R M\cong C\otimes_S(B\otimes_R M),\qquad(c\otimes b)\otimes m\longmapsto c\otimes(b\otimes m).\]

Alphabeta Math

Worked example for Theorem 6.5

Proof.

The bimodule actions follow from Proposition 6.3. To justify the displayed map, fix \(m\). The function \((c,b)\mapsto c\otimes(b\otimes m)\) is biadditive and \(S\)-balanced, since

\[cs\otimes(b\otimes m)=c\otimes(sb\otimes m).\]

It extends to an additive function of \(x\in C\otimes_S B\). Its dependence on \(m\) is additive: both sides of the additivity identity agree on every \(x=c\otimes b\), hence on every \(x\). It is \(R\)-balanced in \(x,m\), since \((br)\otimes m=b\otimes rm\), again first on generators and then on sums. A second application of the universal property gives the desired map.

For its inverse, fix \(c\) and use \((b,m)\mapsto(c\otimes b)\otimes m\). This is biadditive and \(R\)-balanced because \((c\otimes br)\otimes m=(c\otimes b)\otimes rm\). It extends to \(B\otimes_R M\), additively in \(c\), and is \(S\)-balanced because \(cs\otimes b=c\otimes sb\). The universal property supplies the inverse map. Both maps preserve the \(T\)-action by their formulas. Every element of either iterated tensor product is a finite sum of the displayed triple tensors, so the formulas prove their composites are identities. They commute with maps of \(C,B,M\) on those same generators, giving naturality.

□

Thus composing \(B\otimes_R-\) with \(C\otimes_S-\) corresponds to the bimodule \(C\otimes_S B\). No monoidal-category terminology is needed for this statement.

6.4. The properties that characterize tensor functors

Theorem 6.6. Tensoring preserves arbitrary coproducts

For every set-indexed family of left \(R\)-modules, the canonical \(S\)-linear map is an isomorphism:

\[\bigoplus_i(B\otimes_R M_i)\longrightarrow B\otimes_R\left(\bigoplus_i M_i\right),\qquad b\otimes m_i\longmapsto b\otimes\iota_i(m_i).\]

Alphabeta Math

Worked example for Theorem 6.6

Proof.

The structural maps \(1_B\otimes\iota_i\) combine to the displayed map by the coproduct property. Define its inverse on pairs by \((b,(m_i))\mapsto\sum_i j_i(b\otimes m_i)\), where \(j_i\) includes the \(i\)-th tensor factor into the direct sum. The finite support of \((m_i)\) makes this sum finite. The function is biadditive and \(R\)-balanced coordinatewise, so extends to the tensor product; it is \(S\)-linear by its formula. One composite fixes each \(j_i(b\otimes m_i)\); the other fixes \(b\otimes(m_i)\), since \((m_i)=\sum_i\iota_i(m_i)\). These elements generate the respective modules, proving both identity equations. The construction also covers the empty family, giving \(B\otimes_R0=0\).

□

Theorem 6.7. Tensoring preserves cokernels

If \(M\xrightarrow{f}N\xrightarrow{q}Q\to0\) is exact, then

\[B\otimes_R M\xrightarrow{1\otimes f}B\otimes_R N\xrightarrow{1\otimes q}B\otimes_R Q\longrightarrow0\]

is exact in \(S\text{-}\mathrm{Mod}\). Equivalently, tensoring preserves cokernels. This property is called right exactness.

Alphabeta Math

Worked example for Theorem 6.7

Proof.

By Proposition 5.5, we may identify \(Q\) with \(N/\operatorname{im}f\). Put \(D=(B\otimes_R N)/\operatorname{im}(1\otimes f)\), a left \(S\)-module. The map

\[(b,n+\operatorname{im}f)\longmapsto(b\otimes n)+\operatorname{im}(1\otimes f)\]

is well defined: replacing \(n\) by \(n+f(m)\) changes its value by the class of \(b\otimes f(m)\), which is zero in \(D\). It is biadditive and \(R\)-balanced by the tensor relations, so gives an \(S\)-linear map \(B\otimes_R Q\to D\). Conversely, \(1\otimes q\) kills \(\operatorname{im}(1\otimes f)\), hence descends to an \(S\)-linear map \(D\to B\otimes_R Q\). Their formulas are inverse on the generating tensors, so they are inverse everywhere. Under this isomorphism \(1\otimes q\) is the quotient projection onto \(D\). Its kernel is therefore \(\operatorname{im}(1\otimes f)\) and it is surjective, proving exactness and the cokernel property. Any categorical cokernel is uniquely isomorphic to this quotient, so the conclusion applies without choosing a particular quotient model.

□

Proposition 6.8. Reduction modulo two is tensoring

Write \(\mathbb F_2=\mathbb Z/2\mathbb Z\), viewed as an \(\mathbb F_2\)-\(\mathbb Z\) bimodule. For every abelian group \(M\), there is a natural \(\mathbb F_2\)-linear isomorphism

\[\mathbb F_2\otimes_{\mathbb Z}M\cong M/2M,\qquad \bar a\otimes m\longmapsto am+2M.\]

Here \(2M=\{2m:m\in M\}\) is a subgroup, and the quotient becomes an \(\mathbb F_2\)-module by \(\bar a(m+2M)=am+2M\).

Alphabeta Math

Worked example for Proposition 6.8

Proof.

The subgroup \(2M\) is closed under subtraction since \(2m-2n=2(m-n)\). In the quotient action, changing \(a\) by an even integer changes \(am\) by an element of \(2M\), and changing \(m\) by \(2n\) changes \(am\) by \(2an\). Thus the action is well defined, and its module laws descend from the integer action.

The displayed function on pairs is independent of the integer representative of \(\bar a\), is biadditive, and is balanced over \(\mathbb Z\) because \((ar)m=a(rm)\). It induces an \(\mathbb F_2\)-linear map from the tensor product. Define an inverse by \(m+2M\mapsto\bar1\otimes m\). This is well defined since \(\bar1\otimes2n=(\bar1\cdot2)\otimes n=0\); it is additive and \(\mathbb F_2\)-linear by balancing. One composite fixes every class \(m+2M\); the other takes \(\bar a\otimes m\) to \(\bar1\otimes am=\bar a\otimes m\). Pure tensors generate, so these are inverse maps. Every homomorphism \(f:M\to N\) satisfies \(f(2M)\subseteq2N\), and both maps commute with its induced quotient and tensor maps by their formulas, proving naturality.

□

Tensoring can destroy an injection. For \(B=\mathbb Z/2\mathbb Z\), tensor the injective map \(\mathbb Z\xrightarrow{2}\mathbb Z\). Under \(B\otimes_{\mathbb Z}\mathbb Z\cong B\), the induced map sends \(b\) to \(2b=0\). The group \(B\) is nonzero, so this map is not injective. Right exactness, rather than preservation of all short exact sequences, is the hypothesis used in Chapter 9.

A positive example is extension of scalars: a ring map \(R\to S\) gives the \(S\)-\(R\) bimodule of Chapter 5 and the functor \(S\otimes_R-\). For \(\mathbb R\to\mathbb C\), this takes \(\mathbb R^n\) to \(\mathbb C^n\): tensor preservation of finite sums reduces the assertion to \(\mathbb C\otimes_{\mathbb R}\mathbb R\cong\mathbb C\), already proved above.

Sources and further reading

Worked examples

Each example checks the hypotheses and the calculation for the linked statements. The links in the statements return here.

Worked example 1. Computing a tensor product of finite cyclic groups

Applies to: Definition 6.1, Theorem 6.2, Proposition 6.8.

Use \(R=\mathbb Z\), \(B=\mathbb Z/2\), \(M=\mathbb Z/6\). The map \(\beta(\bar a,\bar b)=\overline{ab}\in\mathbb Z/2\) is well defined, biadditive, and balanced because both \((an)b\) and \(a(nb)\) reduce to \(anb\). The tensor group is generated by \(u=\bar1\otimes\bar1\); \(2u=0\), and \(6u=0\) adds no relation. The balanced map sends \(u\) to \(\bar1\), so \(u\ne0\) and \(B\otimes M\cong\mathbb Z/2\). More explicitly any balanced map to an abelian group \(A\) is determined by an element \(a=\beta(\bar1,\bar1)\) killed by 2, and conversely such an \(a\) defines \(\beta(\bar r,\bar s)=rs a\). This is exactly \(\operatorname{Hom}(\mathbb Z/2,A)\), proving the universal property. The quotient \(M/2M\) has the same generator and relation, so the reduction isomorphism sends this \(u\) to \(\bar1+2M\).

Worked example 2. Scalar actions and units on an explicit tensor

Applies to: Proposition 6.3, Theorem 6.4.

Let \(S=\mathbb F_2,R=\mathbb Z,B=\mathbb F_2,M=\mathbb Z\). Then \(B\otimes M\cong\mathbb F_2\) by \(\bar a\otimes n\mapsto n\bar a\), with inverse \(\bar a\mapsto\bar a\otimes1\); balancing gives \(\bar a\otimes n=n\bar a\otimes1\). The left action is multiplication in \(\mathbb F_2\). For \(f(n)=3n\), \(1\otimes f\) sends the generator to \(\bar1\otimes3=\bar1\otimes1\); multiplication by 2 instead gives zero. Multiplying coefficients shows composition and addition of these induced maps agree with their tensor formulas. The other unit map \(\mathbb Z\otimes M\to M\), \(n\otimes m\mapsto nm\), has inverse \(m\mapsto1\otimes m\); the same balancing equation checks both composites and naturality.

Worked example 3. Reassociation and infinitely many summands

Applies to: Theorem 6.5, Theorem 6.6.

Take all rings to be \(\mathbb Z\), \(C=\mathbb Z/2,B=\mathbb Z/3,M=\mathbb Z\). Both bracketings vanish: \(\mathbb Z/2\otimes\mathbb Z/3\) is generated by \(u\) killed by 2 and 3, hence \(u=3u-2u=0\); tensoring \(B\) with \(\mathbb Z\) leaves \(B\). The reassociation therefore sends each \((\bar a\otimes\bar b)\otimes n\) to \(\bar a\otimes(\bar b\otimes n)=0\), a checked isomorphism even in a zero case.

For a nonzero coproduct computation, take \(B=\mathbb F_2\) and \(M_i=\mathbb Z\) for every positive integer. Both sides of Theorem 6.6 identify with finitely supported sequences of zeros and ones. The comparison takes the generator in position \(i\) to \(\bar1\otimes e_i\); its inverse sends \(\bar a\otimes(n_i)\) to \((\overline{a n_i})\). Finite support makes it well defined, and these formulas are inverse on generators. They verify arbitrary rather than only finite coproduct preservation in this example.

Worked example 4. Right exactness can lose an injection

Applies to: Theorem 6.7.

Tensor \(\mathbb Z\xrightarrow{6}\mathbb Z\to\mathbb Z/6\to0\) with \(\mathbb F_2\). The result is \(\mathbb F_2\xrightarrow0\mathbb F_2\xrightarrow1\mathbb F_2\to0\), whose image and kernel at the middle are both zero, and whose last map is onto. The cokernel is preserved. Yet the original multiplication by 6 was injective and its tensor map is not. The calculation therefore illustrates the exact conclusion of right exactness and why no extra zero should be inserted at the left.

Counterexamples and limits of the hypotheses

Each construction below refutes the explicitly stated stronger claim. It does not refute the related theorem with its original hypotheses.

Counterexample 1. Biadditive does not mean balanced

Related statements: Definition 6.1, Theorem 6.2.

Claim refuted. Every biadditive map out of two modules factors through their tensor product over the ring.

Proof.

Take \(R=\mathbb C\), the usual right and left modules \(B=M=\mathbb C\), and the target additive group \(A=\mathbb C\). The function \(\beta(z,w)=z\overline w\) is additive in each variable because complex conjugation preserves sums. However \(\beta(1\cdot i,1)=i\), while \(\beta(1,i\cdot1)=-i\), so it is not \(R\)-balanced. In \(\mathbb C\otimes_{\mathbb C}\mathbb C\), balancing identifies \(i\otimes1=1\otimes i\). A homomorphism with the proposed factorization would have to send this same tensor to both \(i\) and \(-i\), a contradiction. Biadditivity alone only supplies the relations for tensoring over \(\mathbb Z\); the chosen ring imposes additional relations.