15.2  The Tensor Product

The previous section ended with a wish: a space through which every bilinear map out of V×W becomes a linear map. This section grants it. The object is called the tensor product, and building it is the main technical work of the chapter — but the way we go about it matters more than the object itself, because the same three moves recur four more times, for the tensor algebra, the symmetric powers, the exterior powers and the Clifford algebra.

The three moves are: state what the object must do, in the form of a property of the maps out of it; prove that any two objects doing it are isomorphic by a unique isomorphism, using nothing but that property; and only then construct one, to know that the definition is not empty. The middle move is what licenses the word “the”. Theorem 15.2.1 below is written out at full length and is the template for the rest of the chapter, so it is worth reading twice.

Throughout, F is a field and all vector spaces are over F. No finite-dimensionality is assumed until we reach bases, where it is stated.

15.2.1. What the object has to do

Here is the goal, stated before its terms are defined. We want a space X and a bilinear map τ:V×W→X such that every bilinear map β out of V×W can be pushed through τ, and what comes out the other side is linear. Two demands hide in that sentence. There must be at least one way to push β through, or the property is useless; and at most one, or we cannot recover β from its linear shadow. So we ask for existence and uniqueness together.

A tensor product is the most efficient bilinear map out of V×W: every other one is it, followed by a single linear map.

Definition 15.2.1 (Tensor Product)

Let V and W be vector spaces over F. A tensor product of V and W is a pair (X,τ), where X is a vector space over F and τ:V×W→X is a bilinear map, satisfying:

  • (T1) (universal property) For every vector space Z over F and every bilinear map β:V×W→Z, there is a unique linear map β¯:X→Z with β¯∘τ=β.

In words, clause by clause. For every Z: the property is a demand about all targets at once, not about one favorite target. Every bilinear β: the arbitrary bilinear map is the input; nothing is assumed about it beyond Definition 15.1.1 with k=2. There is a unique linear β¯: exactly one, so both existence and uniqueness are being asserted. With β¯∘τ=β: this is an equality of functions on V×W, namely β¯(τ(v,w))=β(v,w) for all v,w. We say β factors through τ, and picture it as a triangle: the two routes from V×W to Z, one direct and one through X, give the same answer.

Notice what the definition does not say. It says nothing about the elements of X, nothing about a formula, and nothing about a basis: it is a statement purely about maps. That is deliberate, since a definition naming elements would depend on a construction, and there are several.

Warning. The definition does not say that every element of X has the form τ(v,w). It says that the values τ(v,w) are enough to determine a linear map on X — which, as we prove below, means they span X, not that they exhaust it. Sums of them are generally not of that form. This is the single most common misreading of the tensor product, and we return to it with a proof at the end of the section.

15.2.2. Any two tensor products are the same

Before building anything, we settle the word “the”. If two pairs both satisfy (T1), each one’s property produces a map to the other, and the composites have no choice but to be identities. This is the argument Chapter 14 used for the Clifford algebra (Proposition 14.12.1), and it is the argument we will use in four more sections.

Theorem 15.2.1 (Uniqueness of the Tensor Product)

Let V and W be vector spaces over F, and let (X,τ) and (X′,τ′) both be tensor products of V and W. Then there is a unique isomorphism φ:X→X′ with φ∘τ=τ′.

Idea. Three steps. ① Each pair’s universal property, applied with the other pair’s bilinear map as input, produces a linear map; so we get φ:X→X′ and ψ:X′→X at once, for free. ② Compose them. The composite ψφ is a linear self-map of X that does nothing to τ — and so is the identity. ③ The uniqueness half of (T1), applied with Z=X and β=τ, says there is only one linear self-map doing nothing to τ. So the two coincide. The uniqueness half is the engine; without it the argument produces two maps and no reason for them to be inverse.

Proof. Step 1. The map τ′:V×W→X′ is bilinear. Apply (T1) for (X,τ) with Z=X′ and β=τ′: there is a unique linear φ:X→X′ with φ∘τ=τ′. Symmetrically, applying (T1) for (X′,τ′) with Z=X and β=τ gives a unique linear ψ:X′→X with ψ∘τ′=τ.

Step 2. The composite ψφ:X→X is linear (Theorem 2.4.2 (a)), and (ψφ)∘τ=ψ∘(φ∘τ)=ψ∘τ′=τ. The identity idX is also linear and satisfies idX∘τ=τ.

Step 3. Apply (T1) for (X,τ) with Z=X and β=τ, which is bilinear by hypothesis. It says there is exactly one linear map X→X whose composite with τ is τ. Both ψφ and idX are such maps. Hence ψφ=idX. Swapping the roles of (X,τ) and (X′,τ′) gives φψ=idX′.

So φ has a two-sided inverse and is a bijection, hence an isomorphism (Theorem 2.5.1). It is the unique isomorphism with φ∘τ=τ′, because (T1) already produced it as the unique linear map with that property, and an isomorphism is in particular linear. This proves the theorem.

Aftermath, and the template. Read the proof again with the names removed. It says: an object defined by a universal property is determined up to a unique isomorphism compatible with its structure map, because each object’s property hands you a comparison map, and the uniqueness clause forces the composites to be identities. Nothing in it used bilinearity, or vector spaces, or two factors. Sections 06, 07, 08 and 10 define the tensor algebra, the symmetric power, the exterior power and the Clifford algebra by universal properties of exactly this shape, and each time the uniqueness proof is these three steps with different letters. When you meet them, do not reread the argument; recognize it.

Because of Theorem 15.2.1 we may now speak of the tensor product and fix notation.

Definition 15.2.2 (Notation for Tensors)

When a tensor product of V and W exists, we write it V⊗W, write v⊗w for τ(v,w), and call an element of the form v⊗w a simple tensor (also called a pure or decomposable tensor). The defining property then reads: every bilinear β:V×W→Z has a unique linear β¯:V⊗W→Z with β¯(v⊗w)=β(v,w).

Bilinearity of τ, rewritten in this notation, gives the rules we compute with: (v+v′)⊗w=v⊗w+v′⊗w,v⊗(w+w′)=v⊗w+v⊗w′,(cv)⊗w=c(v⊗w)=v⊗(cw). The third line is the one to remember: a scalar moves freely across the ⊗ sign. That is the whole reason v⊗w does not determine v and w.

15.2.3. Building one: a free space modulo relations

Uniqueness is worthless if nothing satisfies (T1), so we construct a tensor product. The strategy is the one named in the chapter introduction: take a space in which the symbols v⊗w are completely unrelated, then divide out exactly the relations bilinearity demands. Both halves need a tool.

The first tool is a space with a basis indexed by an arbitrary set. It is the space of finitely supported functions, which Chapter 1 met for S=N (Exercise (B1: Finitely Supported Sequences)).

Definition 15.2.3 (Free Vector Space on a Set)

Let S be a set and F a field. The free vector space on S over F is F(S):={f:S→F : f(s)=0 for all but finitely many s}, a subset of the space FS of all functions S→F (Example (The Standard Vector Spaces) (d)), with the pointwise operations. For s∈S, let δs∈F(S) be the function with δs(s)=1 and δs(t)=0 for t≠s.

Lemma 15.2.2 (Universal Property of the Free Vector Space)

Let S be a set and F a field.

  • (a) F(S) is a subspace of FS, and {δs:s∈S} is a basis of it.
  • (b) For every vector space Z over F and every function g:S→Z — no structure on g is assumed, since S is only a set — there is exactly one linear map g¯:F(S)→Z with g¯(δs)=g(s) for all s∈S.

Proof.

  • (a) We use Theorem 1.2.1. The zero function vanishes everywhere, so it lies in F(S). If f,h∈F(S) vanish outside the finite sets A and B, then f+h vanishes outside A∪B, which is finite, and cf vanishes outside A. So F(S) is a subspace.

    Each δs lies in F(S). Spanning: if f∈F(S) is non-zero exactly on the finite set {s1,…,sr}, then f and ∑if(si)δsi take the same value at every point of S, hence are equal. Independence: if ∑iaiδsi=0 for distinct s1,…,sr, evaluate at sj to get aj=0. By Definition 1.5.1, {δs} is a basis, possibly infinite in the sense of Theorem 1.8.2.

  • (b) Immediate from (a) and Theorem 2.1.6, which prescribes a linear map arbitrarily on a basis, in one and only one way.

In words: a function on a set becomes a linear map on the free space, for free. That is the point of the construction, and the whole of it: F(S) imposes no relations among the δs, so nothing can obstruct a prescription.

The second tool is the quotient. Chapter 2 recorded exactly the statement we need: a linear map that kills a subspace U passes, in exactly one way, to a linear map on V/U (Theorem 4.4.10 (a)). We use it in the form “to define a map out of a quotient, define it upstairs and check it kills the relations”.

Theorem 15.2.3 (Existence of the Tensor Product)

For every pair of vector spaces V,W over F, a tensor product (X,τ) of V and W exists.

Idea. Write down the symbols v⊗w as a basis of a huge space P, one basis vector for each pair of vectors — so at this stage v⊗w has no properties at all. The four bilinearity rules are then four families of elements of P that we want to be zero, so divide by the subspace they span. A bilinear β becomes a linear map on P by Lemma 15.2.2, kills each relation because it is bilinear, and therefore passes to the quotient by Theorem 4.4.10. Uniqueness of the induced map is spanning: the cosets of the basis vectors span the quotient.

Proof. Let S=V×W, regarded as a set, and let P=F(S) be the free vector space on it (Definition 15.2.3), with basis {δ(v,w)}. Let R⊆P be the span of all elements of the four forms δ(v+v′,w)−δ(v,w)−δ(v′,w),δ(v,w+w′)−δ(v,w)−δ(v,w′),δ(cv,w)−cδ(v,w),  δ(v,cw)−cδ(v,w), taken over all v,v′∈V, all w,w′∈W and all c∈F. A span is a subspace, so R is one. Put X:=P/R,τ(v,w):=π(δ(v,w)), where π:P→P/R is the quotient map, which is linear with kernel R (Theorem 4.4.4).

τ is bilinear. The element δ(v+v′,w)−δ(v,w)−δ(v′,w) lies in R=kerπ, so applying π and using its linearity gives τ(v+v′,w)−τ(v,w)−τ(v′,w)=0. The other three families give, in the same way, additivity in the second slot and the two scalar rules. These are the clauses of Definition 15.1.1 for k=2.

(T1), existence. Let Z be a vector space and β:V×W→Z bilinear. Regarding β as a function on the set S, Lemma 15.2.2 (b) gives a unique linear b:P→Z with b(δ(v,w))=β(v,w). It kills every generator of R: for instance b(δ(v+v′,w)−δ(v,w)−δ(v′,w))=β(v+v′,w)−β(v,w)−β(v′,w)=0 because β is linear in its first slot, and the other three families vanish by the other three clauses of bilinearity. Since b is linear and vanishes on a spanning set of R, it vanishes on R (Theorem 2.1.4); that is, R⊆kerb. By Theorem 4.4.10 (a) there is exactly one linear β¯:X→Z with β¯∘π=b, and then β¯(τ(v,w))=β¯(π(δ(v,w)))=b(δ(v,w))=β(v,w), so β¯∘τ=β.

(T1), uniqueness. Suppose L:X→Z is linear with L∘τ=β. Since π is surjective and the δ(v,w) span P, the elements τ(v,w)=π(δ(v,w)) span X. On each of them, L and β¯ agree, both giving β(v,w). Two linear maps that agree on a spanning set agree everywhere, by Theorem 2.1.4. Hence L=β¯.

So (X,τ) satisfies (T1), which proves the theorem.

Aftermath. The construction is ugly and the object is not. That is normal for a universal property: the model is a scaffolding, and after this proof we never open it again. Every later fact about V⊗W in this book is derived from (T1), never from cosets of formal sums — which is also why the identification Fm⊗Fn≅Mm×n(F) below is legitimate as an alternative model, and much more pleasant to compute in.

One property is worth extracting at once, because we will use it constantly and because it is the second appearance of the self-map trick.

Proposition 15.2.4 (Simple Tensors Span)

Let (V⊗W,τ) be a tensor product. Then V⊗W=span{v⊗w:v∈V, w∈W}.

Proof. Let Y=span{v⊗w}, a subspace of V⊗W, and let j:Y→V⊗W be the inclusion, which is linear. Restricting the codomain of τ gives a bilinear map τY:V×W→Y, (v,w)↦v⊗w; it is bilinear because τ is and because Y is a subspace, so the identities hold already in Y. By (T1) with Z=Y there is a linear L:V⊗W→Y with L∘τ=τY. Then jL is a linear self-map of V⊗W with jLτ=jτY=τ, and so is id. By the uniqueness clause of (T1) with Z=V⊗W and β=τ, we get jL=id. Hence j is surjective, so Y=V⊗W.

Remark. That proof used no basis, no construction and no finite dimension — only (T1). It is the same three lines as Step 1 of Proposition 14.12.3’s proof in Chapter 14, where the generated subalgebra was shown to be everything. Once you see “a subobject that receives the structure map must be the whole thing”, you can reuse it verbatim.

15.2.4. A basis and a dimension

Now we can count. The prediction at the end of the previous section was dim⁡(V⊗W)=(dim⁡V)(dim⁡W), and here it is, with a basis attached.

Theorem 15.2.5 (Basis of a Tensor Product)

Let V and W be finite-dimensional, with bases (v1,…,vn) of V and (w1,…,wm) of W. Then the nm simple tensors vi⊗wj,1≤i≤n,1≤j≤m, form a basis of V⊗W. In particular dim⁡(V⊗W)=(dim⁡V)(dim⁡W).

Idea. Spanning is bilinearity: expand both slots of a simple tensor and use Proposition 15.2.4. Independence needs linear functionals on V⊗W that pick out one coefficient — and (T1) manufactures functionals out of bilinear forms, while Theorem 5.1.3 supplies all the bilinear forms we could want, namely (x,y)↦φp(x)ψq(y).

Proof. Spanning. By Proposition 15.2.4 it suffices to write each simple tensor in terms of the listed ones. Let v=∑iaivi and w=∑jbjwj. Expanding one slot at a time by the rules following Definition 15.2.2, v⊗w=(∑iaivi)⊗(∑jbjwj)=∑i,jaibj(vi⊗wj).

Independence. Let (φ1,…,φn) and (ψ1,…,ψm) be the bases of V∗ and W∗ dual to the given ones, so φp(vi)=δpi and ψq(wj)=δqj (Theorem 5.1.3). Fix p and q. The function βpq:V×W→F,βpq(x,y)=φp(x)ψq(y), is bilinear: freezing y leaves ψq(y)φp, a scalar multiple of a linear functional, and symmetrically. By (T1) there is a linear fpq:V⊗W→F with fpq(x⊗y)=φp(x)ψq(y); in particular fpq(vi⊗wj)=δpiδqj.

Now suppose ∑i,jcij(vi⊗wj)=0. Apply fpq. By linearity the left side becomes ∑i,jcijδpiδqj=cpq, and the right side is 0. Hence cpq=0. Since p and q were arbitrary, all coefficients vanish.

So the nm listed tensors form a basis, and dim⁡(V⊗W)=nm. This proves the theorem.

Aftermath: the count agrees. In Theorem 15.1.2 we found dim⁡M(V,W;Z)=(dim⁡Z)(dim⁡V)(dim⁡W), and we argued that a universal object X would have to satisfy dim⁡L(X,Z)=dim⁡M(V,W;Z), forcing dim⁡X=(dim⁡V)(dim⁡W). Theorem 15.2.5 delivers exactly that number, and the agreement is not a coincidence — it is the universal property, counted. Here is the statement behind it.

Corollary 15.2.6 (Bilinear Maps Are Linear Maps on the Tensor Product)

Let V,W,Z be vector spaces over F. The map Ξ:L(V⊗W,Z)→M(V,W;Z),L↦L∘τ, is an isomorphism of vector spaces. When V, W and Z are finite-dimensional, both sides have dimension (dim⁡Z)(dim⁡V)(dim⁡W).

Proof. Ξ lands where claimed: L∘τ is bilinear, since freezing one slot of τ gives a linear map and composing with the linear L keeps it linear (Theorem 2.4.2 (a)). It is linear in L by Theorem 2.4.2 (d), which gives (L1+L2)∘τ=L1τ+L2τ and (cL)∘τ=c(Lτ). It is surjective by the existence half of (T1) and injective by the uniqueness half: if Lτ=0, then both L and the zero map are linear maps composing with τ to give the zero bilinear map, so L=0, and Theorem 2.2.3 applies. The dimension count is Theorem 15.1.2 on one side and Theorem 4.1.4 together with Theorem 15.2.5 on the other.

Quick check. What is V⊗W when W=F, viewed as a one-dimensional space over itself? What is it when W={0}?

Solution. For W=F: dim⁡(V⊗F)=(dim⁡V)⋅1=dim⁡V by Theorem 15.2.5, and indeed v↦v⊗1 is an isomorphism V→V⊗F, since it carries a basis (vi) to the basis (vi⊗1). For W={0}: the dimension is 0, so V⊗{0}={0}. Both are the degenerate cases one should be able to predict from the product formula, and both come out right.

15.2.5. Coordinates: the tensor product of coordinate spaces

An abstract object is easier to trust once it has a concrete model. For coordinate spaces there is a very good one: Fm⊗Fn is the space of m×n matrices, with the simple tensor x⊗y corresponding to the outer product xy⊤.

Theorem 15.2.7 (Fm⊗Fn≅Mm×n(F))

Let m,n≥1. There is a unique linear map Θ:Fm⊗Fn→Mm×n(F),Θ(x⊗y)=xy⊤, and it is an isomorphism, carrying ei⊗fj to the matrix unit Eij. Under Θ, the simple tensors correspond exactly to the matrices of rank at most 1.

Proof. The map (x,y)↦xy⊤ is bilinear: its (i,j) entry is xiyj, and with y frozen, (x+x′)y⊤=xy⊤+x′y⊤ and (cx)y⊤=c(xy⊤) by Theorem 0.9.4 (2) and (4); freezing x is the same computation (Exercise (B1: Determine which are multilinear) (c)). By (T1) there is a unique linear Θ with Θ(x⊗y)=xy⊤. On standard basis vectors, eifj⊤ has a single 1 in position (i,j), so Θ(ei⊗fj)=Eij.

By Theorem 15.2.5 the mn tensors ei⊗fj form a basis of Fm⊗Fn, and the mn matrix units form a basis of Mm×n(F) (Example (Standard Bases) (c)). By Theorem 2.1.5 there is a linear Ψ:Mm×n(F)→Fm⊗Fn with Ψ(Eij)=ei⊗fj. Then ΨΘ and ΘΨ are linear maps fixing a basis, hence are the identities by the uniqueness half of Theorem 2.1.5. So Θ is an isomorphism.

For the last claim, a non-zero xy⊤ is a product of an m×1 and a 1×n matrix, so it has rank 1 by Proposition 4.3.2; and xy⊤=0 when x=0 or y=0, of rank 0. Conversely, a matrix A of rank 1 factors as A=xy⊤ with x∈Fm and y⊤∈M1×n(F), again by Proposition 4.3.2, and the zero matrix is 0⊗0. This proves the theorem.

Example (Computing in F2⊗F3)

Work in F2⊗F3 with standard bases (e1,e2) and (f1,f2,f3).

  • (a) Expand (e1+2e2)⊗(3f1−f2) in the basis of Theorem 15.2.5, and write the corresponding matrix.
  • (b) Decide whether t=e1⊗f1+2e1⊗f2+3e2⊗f1+6e2⊗f2 is a simple tensor, and if so write it as one.
  • (c) Decide whether u=e1⊗f1+e2⊗f2 is a simple tensor.

Solution.

  • (a) Expanding one slot at a time, (e1+2e2)⊗(3f1−f2)=3e1⊗f1−e1⊗f2+6e2⊗f1−2e2⊗f2. The coefficient of ei⊗fj is the (i,j) entry of the matrix, so Θ sends it to (3−106−20)=(12)(3−10), which is the outer product predicted by Theorem 15.2.7.

  • (b) The coefficients give Θ(t)=(120360). Its second row is 3 times its first, so every 2×2 minor vanishes and the rank is 1 (Theorem 7.7.1). By Theorem 15.2.7, t is simple. Factoring, Θ(t)=(1,3)⊤(1,2,0), so t=(e1+3e2)⊗(f1+2f2), which expands back to t.

  • (c) Here Θ(u)=(100010), whose first two columns are independent, so its rank is 2. By Theorem 15.2.7, u is not simple. No amount of rewriting will turn it into a single v⊗w.

15.2.6. Three things a tensor is not

Part (c) above is not a curiosity; it is the central negative fact about tensor products, and the first of three misreadings worth naming before they happen.

Not every tensor is simple

Example (A tensor that is not simple)

In F2⊗F2, the element u=e1⊗e1+e2⊗e2 is not a simple tensor, for any field F.

Idea. Two routes, and both are worth having. The quick one: Θ(u)=I2, of rank 2, while simple tensors have rank at most 1. The portable one: suppose u=v⊗w, hit it with the four coordinate functionals fpq built in the proof of Theorem 15.2.5, and read off four scalar equations that cannot all hold.

Proof. Suppose u=v⊗w for some v,w∈F2. Let (φ1,φ2) be the basis of (F2)∗ dual to (e1,e2), and for p,q∈{1,2} let fpq:F2⊗F2→F be the linear map with fpq(x⊗y)=φp(x)φq(y), supplied by (T1) as in the proof of Theorem 15.2.5. Applying fpq to both sides of u=v⊗w gives vpwq=fpq(u)=δp1δq1+δp2δq2, that is, v1w1=1, v2w2=1, v1w2=0 and v2w1=0. From v1w1=1 we get v1≠0, so v1w2=0 forces w2=0 — and then v2w2=0≠1. This contradiction shows that no such v,w exist, so u is not simple.

Warning. A general element of V⊗W is a sum of simple tensors, not a simple tensor. Proposition 15.2.4 says the simple tensors span; Example (A tensor that is not simple) says they do not exhaust. A statement proved only for simple tensors is therefore proved for nothing until you extend it by linearity — which is legitimate precisely when the statement is about a linear map, and illegitimate when it is about, say, ranks or products. Whenever you want to define something on V⊗W, do not write “define it on v⊗w and extend”: use (T1), which is that move done correctly.

The smallest number of simple tensors needed to write a given tensor is a genuine invariant, and for coordinate spaces Theorem 15.2.7 identifies it: it is the rank of the corresponding matrix. So “not simple” means “rank at least 2”. A later section meets the same failure for elements of Λ2V that are not wedges of two vectors, and the closing section meets it again under the name entanglement.

A simple tensor vanishes only for an obvious reason

Proposition 15.2.8 (When a Simple Tensor Is Zero)

Let V and W be finite-dimensional, v∈V and w∈W. Then v⊗w=0 if and only if v=0 or w=0.

Proof. (⇐) If v=0, then v⊗w=(0⋅0)⊗w=0(0⊗w)=0, using that a scalar passes across ⊗. The case w=0 is the same with the slots swapped.

(⇒) Suppose v≠0 and w≠0. By Theorem 5.1.5 (a) there are φ∈V∗ and ψ∈W∗ with φ(v)=1 and ψ(w)=1. The map (x,y)↦φ(x)ψ(y) is bilinear, so (T1) gives a linear f:V⊗W→F with f(x⊗y)=φ(x)ψ(y). Then f(v⊗w)=1≠0, while f(0)=0. Hence v⊗w≠0. This proves the proposition.

Warning. A product of non-zero things can be zero in many algebraic settings, but not here. It is tempting to expect V⊗W to behave like a ring with zero divisors, so that some v⊗w vanishes accidentally. It does not: Proposition 15.2.8 says the only way to get 0 is to feed in 0. The zero divisors appear one level later — in the algebras of the following sections, where products of non-zero sums of simple tensors can vanish.

A simple tensor does not remember its factors

Proposition 15.2.9 (When Two Simple Tensors Agree)

Let V and W be finite-dimensional, and let v,v′∈V and w,w′∈W with v⊗w≠0. Then v⊗w=v′⊗w′ if and only if there is a scalar c≠0 with v′=cv and w′=c−1w.

Idea. The “if” half is the scalar rule. For “only if”, the danger is that v′ points somewhere new. Suppose it does; then (v,v′) is independent, so there is a functional killing v and not v′, and the corresponding f on V⊗W separates the two sides.

Proof. (⇐) If v′=cv and w′=c−1w, then v′⊗w′=(cv)⊗(c−1w)=cc−1(v⊗w)=v⊗w, moving each scalar across ⊗.

(⇒) Suppose v⊗w=v′⊗w′≠0. By Proposition 15.2.8 all four vectors are non-zero. Suppose, for a contradiction, that v′∉span(v). Then (v,v′) is linearly independent, so it extends to a basis of V (Theorem 1.6.5), and the dual basis (Theorem 5.1.3) provides φ∈V∗ with φ(v)=0 and φ(v′)=1. Since w′≠0, Theorem 5.1.5 (a) provides ψ∈W∗ with ψ(w′)=1. By (T1) there is a linear f:V⊗W→F with f(x⊗y)=φ(x)ψ(y). Evaluating both sides of v⊗w=v′⊗w′, 0=φ(v)ψ(w)=f(v⊗w)=f(v′⊗w′)=φ(v′)ψ(w′)=1, which is absurd. Hence v′=cv for some c∈F, and c≠0 because v′≠0.

Then v⊗w=(cv)⊗w′=v⊗(cw′), so v⊗(w−cw′)=0 by bilinearity. Since v≠0, Proposition 15.2.8 forces w−cw′=0, that is, w′=c−1w. This proves the proposition.

Warning. v⊗w=v′⊗w′ does not mean v=v′ and w=w′. Already 2v⊗w=v⊗2w, with different factors on the two sides. So “the first factor of a simple tensor” is not a well-defined function: writing t=v⊗w and then speaking of “the v of t” is an error. What Proposition 15.2.9 salvages is that the lines span(v) and span(w) are determined, which is exactly the information carried by a rank-one matrix: its column space and its row space.

Quick check. In R2⊗R2, is e1⊗e2+e2⊗e1 a simple tensor?

Solution. No. Its matrix under Θ is (0110), of determinant −1≠0, hence of rank 2 (Theorem 7.5.2). By Theorem 15.2.7 a simple tensor would have rank at most 1. Note how little the symmetry of the expression helps: being a sum of two simple tensors is the generic situation, not a special one.

15.2.7. Exercises

A. Check your understanding

Exercise (A1)
  • (a) State the universal property (T1) of the tensor product, with every quantifier.
  • (b) What does Theorem 15.2.1 assert, and which clause of (T1) makes the composites identities?
  • (c) Give dim⁡(V⊗W) in terms of dim⁡V and dim⁡W, and a basis.
  • (d) True or false: every element of V⊗W is of the form v⊗w. Justify your answer.
  • (e) True or false: if v⊗w=0 then v=0. Justify your answer.
  • (f) Explain in one sentence why the tensor product is not defined by a formula for its elements.

Solution.

  • (a) A pair (X,τ) with τ:V×W→X bilinear such that for every vector space Z and every bilinear β:V×W→Z there is a unique linear β¯:X→Z with β¯∘τ=β (Definition 15.2.1).

  • (b) That any two tensor products of V and W are isomorphic by a unique isomorphism commuting with the two structure maps. The uniqueness clause: it says there is only one linear self-map X→X composing with τ to give τ, and since both ψφ and idX are such maps, they are equal.

  • (c) (dim⁡V)(dim⁡W), with basis (vi⊗wj) for bases (vi) of V and (wj) of W (Theorem 15.2.5).

  • (d) False. In F2⊗F2, e1⊗e1+e2⊗e2 is not simple (Example (A tensor that is not simple)).

  • (e) False as stated: it says v=0 or w=0 (Proposition 15.2.8). For instance v⊗0=0 for every v.

  • (f) Because a formula would require choosing a construction, and the object is characterized by what maps out of it do, not by what its elements look like; different constructions give different-looking elements and the same space up to a unique isomorphism.

B. Practice

Exercise (B1: Simple or not)

For each element of F3⊗F3 below, determine whether it is a simple tensor. If it is, write it as v⊗w; if it is not, justify your answer. Use the standard basis (e1,e2,e3) in both factors.

  • (a) t1=e1⊗e2−2e1⊗e3+3e3⊗e2−6e3⊗e3.
  • (b) t2=e1⊗e1+e2⊗e2+e3⊗e3.
  • (c) t3=e1⊗e2+e2⊗e1.
  • (d) t4=0.

Solution. Throughout we use Theorem 15.2.7: t is simple exactly when the matrix Θ(t), whose (i,j) entry is the coefficient of ei⊗ej, has rank at most 1.

  • (a) Θ(t1)=(01−200003−6). Row 3 is 3 times row 1 and row 2 is zero, so the rank is 1. Factoring, Θ(t1)=(1,0,3)⊤(0,1,−2), so t1=(e1+3e3)⊗(e2−2e3), which expands to the four given terms.

  • (b) Θ(t2)=I3, of rank 3. Not simple. This is Example (A tensor that is not simple) one size larger.

  • (c) Θ(t3) has 1 in positions (1,2) and (2,1) and zeros elsewhere. Its top-left 2×2 minor is 0⋅0−1⋅1=−1≠0, so its rank is 2 (Theorem 7.7.1). Not simple.

  • (d) Θ(t4)=0, of rank 0≤1. So t4 is simple, and indeed 0=0⊗0. The degenerate case is simple for a boring reason, and it is worth keeping in the statement of Theorem 15.2.7.

Exercise (B2: Inducing maps from bilinear maps)

In each case, a bilinear map is given. Use (T1) to produce the induced linear map on the tensor product, and compute the requested value.

  • (a) β:F2×F2→F, β(x,y)=x1y1+x2y2. Compute β¯(e1⊗e1+e2⊗e2).
  • (b) β:Fn×Fn→Mn(F), β(x,y)=xy⊤−yx⊤. Compute β¯(v⊗v) for any v.
  • (c) β:V∗×V→F, β(φ,v)=φ(v), for V finite-dimensional. Compute β¯(φ1⊗v1+φ2⊗v2) for a basis (vi) with dual basis (φi), assuming dim⁡V≥2.

Solution.

  • (a) β is the dot product, bilinear by Example (Six two-slot functions) (a). By (T1) there is a unique linear β¯ with β¯(x⊗y)=x1y1+x2y2. By linearity, β¯(e1⊗e1+e2⊗e2)=β¯(e1⊗e1)+β¯(e2⊗e2)=1+1=2.

  • (b) Each entry of xy⊤−yx⊤ is xiyj−yixj, linear in each slot, so β is bilinear and (T1) applies. Then β¯(v⊗v)=vv⊤−vv⊤=0 for every v, so the induced map kills every “diagonal” simple tensor without being zero: β¯(e1⊗e2)=E12−E21≠0 for n≥2.

  • (c) The evaluation pairing is bilinear by Example (Seven functions of several vectors) (f), so β¯:V∗⊗V→F exists with β¯(φ⊗v)=φ(v). Hence β¯(φ1⊗v1+φ2⊗v2)=φ1(v1)+φ2(v2)=1+1=2. This map is the contraction, and the answer 2 is a first glimpse of a later section: it is the trace of a rank-two projection.

Exercise (B3: Dimensions and bases)

Let V, W and U be finite-dimensional over F, with dim⁡V=3, dim⁡W=4 and dim⁡U=2.

  • (a) Find dim⁡(V⊗W) and dim⁡((V⊗W)⊗U).
  • (b) Find dim⁡L(V⊗W,U) and dim⁡M(V,W;U), and explain why they agree.
  • (c) Let V=F3 with basis (e1,e2,e3) and W=F4 with basis (f1,…,f4). Write down a basis of V⊗W and say which basis vector corresponds to the matrix unit E23 under Θ.

Solution.

  • (a) dim⁡(V⊗W)=3⋅4=12 by Theorem 15.2.5, and then dim⁡((V⊗W)⊗U)=12⋅2=24, applying the theorem again to the pair (V⊗W,U).

  • (b) dim⁡L(V⊗W,U)=(dim⁡U)dim⁡(V⊗W)=2⋅12=24 by Theorem 4.1.4, and dim⁡M(V,W;U)=2⋅3⋅4=24 by Eq. 15.1.1. They agree because Corollary 15.2.6 exhibits an isomorphism between the two spaces; the equality of numbers is that isomorphism, counted.

  • (c) The 12 tensors ei⊗fj with 1≤i≤3 and 1≤j≤4. Since Θ(ei⊗fj)=Eij, the basis vector corresponding to E23 is e2⊗f3.

C. Going deeper

Exercise (C1: The tensor product is commutative, up to a unique isomorphism)

Let V and W be vector spaces over F.

  • (a) Prove that there is a unique linear map σ:V⊗W→W⊗V with σ(v⊗w)=w⊗v for all v,w, and that it is an isomorphism.
  • (b) Deduce that σ2=id when V=W, where σ2 means σ applied twice to V⊗V.
  • (c) Explain why the argument in (a) never mentions a basis, and why that matters.

Hint for (a): the map (v,w)↦w⊗v is bilinear; then build the inverse the same way and use the uniqueness clause of (T1).

Solution.

  • (a) The map V×W→W⊗V, (v,w)↦w⊗v, is bilinear, because ⊗ is bilinear and swapping the slots exchanges the two clauses of Definition 15.1.1. By (T1) for V⊗W there is a unique linear σ with σ(v⊗w)=w⊗v. Symmetrically, (T1) for W⊗V gives a unique linear σ′:W⊗V→V⊗W with σ′(w⊗v)=v⊗w. Then σ′σ is a linear self-map of V⊗W with (σ′σ)(v⊗w)=v⊗w, and so is the identity; by the uniqueness clause of (T1) applied with Z=V⊗W and β=τ, the two agree, so σ′σ=id. Symmetrically σσ′=id. Hence σ is an isomorphism (Theorem 2.5.1).

  • (b) With V=W, part (a) gives σ′=σ, since both are the unique linear map sending v⊗w to w⊗v. Hence σ2=σ′σ=id.

  • (c) Every step used only (T1) and the bilinearity of ⊗. So the argument works for infinite-dimensional spaces, where Theorem 15.2.5 is unavailable, and it produces a canonical isomorphism, whereas a basis-dependent construction would give one isomorphism per basis and no reason to prefer any of them.

Exercise (C2: Recovering the factors from a simple tensor)

Let V and W be finite-dimensional and let t=v⊗w≠0.

  • (a) Prove that the subspace span(v)⊆V depends only on t, not on the chosen factorization.
  • (b) Prove the corresponding statement for span(w)⊆W.
  • (c) For V=Fm and W=Fn, identify these two subspaces in terms of the matrix Θ(t) of Theorem 15.2.7, and say why (a) and (b) are then statements you already knew.

Solution.

  • (a) Suppose t=v⊗w=v′⊗w′ with t≠0. By Proposition 15.2.9 there is c≠0 with v′=cv. A non-zero scalar multiple spans the same subspace, so span(v′)=span(v). Hence the line is determined by t alone.

  • (b) The same proposition gives w′=c−1w with c−1≠0, so span(w′)=span(w).

  • (c) Under Θ, t corresponds to A=vw⊤, a matrix of rank 1 (Theorem 15.2.7). Every column of A is a scalar multiple of v, and A is non-zero, so col(A)=span(v); every row is a multiple of w⊤, so row(A)=span(w⊤). Thus (a) and (b) say that a matrix has a well-defined column space and row space, which Chapter 2 established long ago. The tensor language adds nothing here except the reason the statement looks surprising: it is surprising only if one expects v itself, rather than its line, to be recoverable.

Found a typo or a mistake? Report it, or read this page’s source

The text of this book is licensed under CC BY-NC-SA 4.0.