15.3  Tensor Products of Maps

Section 02 built the space V⊗W. A construction on spaces is worth little until it acts on maps as well: the philosophy of the whole book has been objects first, then the maps between them. So given S:V→V′ and T:W→W′, we want a single map V⊗W→V′⊗W′ built from the two. This section builds it, computes its matrix, and discovers that the matrix is the Kronecker product of Chapter 8 — which pays both of the debts that Chapter 8 §04 left open. It ends with the identification V∗⊗W≅L(V,W), which every later section of the chapter uses.

15.3.1. A map on each factor gives a map on the product

The definition writes itself, and that is the danger. We want a map that sends v⊗w to Sv⊗Tw, so the temptation is to write

“Define (S⊗T)(v⊗w):=Sv⊗Tw, and extend linearly.”

Nothing in that sentence is a definition. Simple tensors span V⊗W (Proposition 15.2.4), but they do not exhaust it, and worse, the expression of an element as a combination of them is wildly non-unique: v⊗w=(2v)⊗(12w), and v⊗w+v⊗w′=v⊗(w+w′). A formula prescribed on simple tensors may therefore assign two different values to one element, and then it defines nothing at all. Here is a formula that really does fail. Try to define g:V⊗W→V by g(v⊗w):=v. Taking w=0 gives v⊗0=0 (Proposition 15.2.8), so g would have to send 0 to every v at once.

To build a map out of V⊗W, never write a formula on simple tensors: write down a bilinear map and let the universal property produce the linear one.

That is the discipline of this chapter, and applied here it costs three lines.

Theorem 15.3.1 (Tensor Product of Two Linear Maps)

Let V,V′,W,W′ be vector spaces over F, and let S∈L(V,V′) and T∈L(W,W′). Then there is exactly one linear map f:V⊗W→V′⊗W′ with f(v⊗w)=Sv⊗Tw for all v∈V and w∈W.

Idea. The assignment (v,w)↦Sv⊗Tw is bilinear, because S and T are linear and ⊗ is bilinear in its two slots. A bilinear map out of V×W is exactly what the universal property consumes, and what it returns is a unique linear map out of V⊗W. There is nothing else to check.

Proof. Define β:V×W→V′⊗W′ by β(v,w):=Sv⊗Tw. Fix w∈W. The map v↦Sv⊗Tw is the composite of S, which is linear, with the map u↦u⊗Tw, which is linear because the map ⊗:V′×W′→V′⊗W′ of Definition 15.2.1 is bilinear, hence linear in its first slot with the second slot held fixed. A composite of linear maps is linear (Theorem 2.4.2), so β is linear in its first argument. Fixing v instead and swapping the roles of the two slots gives linearity in the second. Hence β is bilinear.

By the universal property in Definition 15.2.1 there is a unique linear f:V⊗W→V′⊗W′ with f(v⊗w)=β(v,w)=Sv⊗Tw for all v,w. This proves both existence and uniqueness.

Uniqueness is what licenses a name.

Definition 15.3.1 (Tensor product of linear maps)

Let S∈L(V,V′) and T∈L(W,W′). The tensor product of S and T is the unique linear map S⊗T:V⊗W→V′⊗W′ of Theorem 15.3.1, characterized by (S⊗T)(v⊗w)=Sv⊗Tw(v∈V, w∈W).

The symbol ⊗ now has three jobs — a space, a vector, a map — and they agree: S⊗T applied to v⊗w is Sv⊗Tw, which is the only thing the notation could mean.

Examples.

  1. The identity. idV⊗idW sends v⊗w to v⊗w, and so does idV⊗W. Both are linear and both are the factorization of the same bilinear map, so idV⊗idW=idV⊗W by the uniqueness clause. Degenerate, and used in almost every proof below.
  2. Acting on one slot. S⊗idW sends v⊗w to Sv⊗w: it does S in the first slot and leaves the second alone. If V=W=F[x] and S=D is differentiation, D⊗id is “differentiate the first factor”.
  3. Scalars. For c,d∈F, (cidV)⊗(didW) sends v⊗w to cv⊗dw=cd(v⊗w), so it is cdidV⊗W. In particular a scalar may be moved from one slot to the other, which is the map-level shadow of cv⊗w=v⊗cw.
  4. Zero. If S=0, then (S⊗T)(v⊗w)=0⊗Tw=0, so S⊗T=0. The converse also holds; see Exercise (C1: When a tensor product of maps vanishes).

Non-example by minimal change. Keep S and T linear, but try to send v⊗w to Sv⊗Tw+v⊗w. This one is legitimate: the assignment (v,w)↦Sv⊗Tw+v⊗w is a sum of two bilinear maps, hence bilinear, and the universal property applies. What is not legitimate is (v,w)↦Sv⊗Tw+u0 for a fixed non-zero u0∈V′⊗W′: the added constant destroys linearity in each slot, so no linear map on V⊗W does this, and indeed the prescription contradicts itself at w=0. The exact clause that fails is bilinearity, and it fails for the same reason as in the map g above.

We will lean repeatedly on the following consequence of the uniqueness clause. It replaces the phrase “and extend linearly”, which we are not allowed to use.

Lemma 15.3.2 (Simple Tensors Determine a Map)

Let Z be a vector space over F and let f,g:V⊗W→Z be linear. If f(v⊗w)=g(v⊗w) for all v∈V and w∈W, then f=g.

Proof. Put β(v,w):=f(v⊗w). Since ⊗ is bilinear and f is linear, β is bilinear. By hypothesis β(v,w)=g(v⊗w) as well, so f and g are both linear maps factoring β through ⊗. The universal property of Definition 15.2.1 says there is only one such map. Hence f=g.

No finite-dimensionality is needed, and no basis is chosen. With it, the algebra of ⊗ on maps is a formality.

Proposition 15.3.3 (Algebra of Tensor Products of Maps)

Let S,S1,S2∈L(V,V′), T,T1,T2∈L(W,W′) and c∈F. Let also R∈L(V′,V″) and U∈L(W′,W″). Then:

  • (a) (S1+S2)⊗T=S1⊗T+S2⊗T and S⊗(T1+T2)=S⊗T1+S⊗T2;
  • (b) (cS)⊗T=c(S⊗T)=S⊗(cT);
  • (c) (R⊗U)(S⊗T)=RS⊗UT;
  • (d) idV⊗idW=idV⊗W.

Proof. In each part both sides are linear maps out of V⊗W, so by Lemma 15.3.2 it suffices to compare their values at a simple tensor v⊗w.

  • (a) The left side gives (S1+S2)v⊗Tw=(S1v+S2v)⊗Tw, which equals S1v⊗Tw+S2v⊗Tw because ⊗ is additive in its first slot. That is the value of the right side. The second identity is the same argument in the other slot.

  • (b) (cS)v⊗Tw=(cSv)⊗Tw=c(Sv⊗Tw)=Sv⊗(cTw), where both outer equalities use bilinearity of ⊗.

  • (c) (R⊗U)((S⊗T)(v⊗w))=(R⊗U)(Sv⊗Tw)=RSv⊗UTw, which is the value of RS⊗UT.

  • (d) Done in Example 1.

Part (c) is the statement that ⊗ respects composition: it is functoriality, and we will see in a moment that it is the mixed product rule of Theorem 8.4.1 in disguise.

Two more structural facts are needed before §04 can speak of tensors with several slots. The first extends the universal property from two factors to any number, and the second says that the brackets do not matter.

For k≥2 define the iterated tensor product by V1⊗⋯⊗Vk:=(V1⊗⋯⊗Vk−1)⊗Vk, starting from V1 itself when k=1, and write v1⊗⋯⊗vk for (v1⊗⋯⊗vk−1)⊗vk. Multilinear maps of k arguments were defined in Definition 15.1.1.

Lemma 15.3.4 (Universal Property for k Factors)

Let V1,…,Vk and Z be vector spaces over F, and let β:V1×⋯×Vk→Z be multilinear. Then there is exactly one linear map β¯:V1⊗⋯⊗Vk→Z with β¯(v1⊗⋯⊗vk)=β(v1,…,vk) for all v1,…,vk. Moreover the tensors v1⊗⋯⊗vk span V1⊗⋯⊗Vk.

Idea. Induction on k, freezing the last argument. With vk held fixed, β is multilinear in the first k−1 arguments, so the inductive hypothesis converts it into a linear map on X=V1⊗⋯⊗Vk−1. Letting vk move again gives a bilinear map on X×Vk, and (T1) finishes. The spanning claim is the same induction.

Proof. For k=1 take β¯=β, which is linear, and the claim is trivial; for k=2 the statement is Definition 15.2.1 together with Proposition 15.2.4. Let k≥3 and assume the lemma for k−1. Put X:=V1⊗⋯⊗Vk−1.

Fix vk∈Vk. The map (v1,…,vk−1)↦β(v1,…,vk) is multilinear, so the inductive hypothesis gives a unique linear gvk:X→Z with gvk(v1⊗⋯⊗vk−1)=β(v1,…,vk).

The map X×Vk→Z, (x,vk)↦gvk(x), is bilinear. It is linear in x because each gvk is. For linearity in vk, fix vk,vk′∈Vk and c∈F: the linear maps gvk+cvk′ and gvk+cgvk′ agree at every v1⊗⋯⊗vk−1, because β is linear in its last argument, and those tensors span X by the inductive hypothesis; so the two maps are equal.

By Definition 15.2.1 there is a unique linear β¯ on X⊗Vk=V1⊗⋯⊗Vk with β¯(x⊗vk)=gvk(x); taking x=v1⊗⋯⊗vk−1 gives β¯(v1⊗⋯⊗vk)=β(v1,…,vk).

Finally, X⊗Vk is spanned by the simple tensors x⊗vk (Proposition 15.2.4), each x is a combination of v1⊗⋯⊗vk−1 by the inductive hypothesis, and ⊗ is linear in its first slot; so the k-fold tensors span. A linear map is determined by its values on a spanning set, which gives uniqueness of β¯.

Proposition 15.3.5 (Associativity of the Tensor Product)

Let U,V,W be vector spaces over F. There is a unique isomorphism α:(U⊗V)⊗W→U⊗(V⊗W) with α((u⊗v)⊗w)=u⊗(v⊗w) for all u,v,w.

Proof. The map (u,v,w)↦u⊗(v⊗w) is trilinear, since ⊗ is bilinear in each of its two uses. By Lemma 15.3.4 with k=3 there is a unique linear α on (U⊗V)⊗W with the stated values. Symmetrically, freezing the first argument instead and running the two-factor property twice produces a linear α′:U⊗(V⊗W)→(U⊗V)⊗W with α′(u⊗(v⊗w))=(u⊗v)⊗w. The composite α′α fixes every (u⊗v)⊗w, and those span by Lemma 15.3.4, so α′α=id; symmetrically αα′=id. Hence α is an isomorphism.

From now on we drop the brackets and write U⊗V⊗W, with u⊗v⊗w for the element that both ways of bracketing name, and likewise for any number of factors.

15.3.2. The matrix of a tensor product of maps

Now we compute. A matrix needs ordered bases, and V⊗W has a basis indexed by pairs (i,k), so the whole content of the computation is which order we put the pairs in.

Order the basis vi⊗wk by dictionary order on the pair (i,k): the index of the first factor changes slowly, the index of the second factor runs fastest.

Definition 15.3.2 (The product basis, ordered)

Let B=(v1,…,vn) be an ordered basis of V and C=(w1,…,wq) an ordered basis of W. Write B⊗C for the basis (vi⊗wk) of V⊗W given by Theorem 15.2.5, ordered so that vi⊗wk occupies position (i−1)q+k(1≤i≤n, 1≤k≤q), that is, in the order v1⊗w1, …, v1⊗wq, v2⊗w1, …, vn⊗wq.

Division with remainder writes every position 1,…,nq as (i−1)q+k for exactly one pair, so this really is an ordering of the whole basis. It is the dictionary order on pairs, and it is the same rule that Chapter 8 used to label the rows and columns of a Kronecker product in the formula (∗) after Definition 8.4.1. That is not a coincidence, and the next theorem says why.

Theorem 15.3.6 (The Kronecker Product Is the Matrix of a Tensor Product of Maps)

Let V,V′,W,W′ be finite-dimensional vector spaces over F with ordered bases B=(v1,…,vn) of V,B′=(v1′,…,vm′) of V′,C=(w1,…,wq) of W,C′=(w1′,…,wp′) of W′. Let S∈L(V,V′) and T∈L(W,W′). Then, with the orderings of Definition 15.3.2 on both sides, [S⊗T]B⊗CB′⊗C′=[S]BB′⊗[T]CC′, the Kronecker product of Definition 8.4.1.

Idea. A matrix is read off column by column, and column (j,l) of the left side holds the coordinates of (S⊗T)(vj⊗wl)=Svj⊗Twl. Expanding Svj and Twl in their bases and multiplying out by bilinearity produces the coefficient aijbkl on vi′⊗wk′ — a product of one entry of each matrix. The entry formula (∗) of Chapter 8 says the Kronecker product puts exactly that number in exactly that place, provided the pairs are read in dictionary order. So the theorem is the entry formula and bilinearity, nothing more.

Proof. Write A=(aij)=[S]BB′∈Mm×n(F) and B=(bkl)=[T]CC′∈Mp×q(F), so that by Definition 4.1.1 Svj=∑i=1maijvi′,Twl=∑k=1pbklwk′. Fix j and l. Using Definition 15.3.1 and then bilinearity of ⊗ in each slot, (S⊗T)(vj⊗wl)=Svj⊗Twl=(∑iaijvi′)⊗(∑kbklwk′)=∑i=1m∑k=1paijbkl(vi′⊗wk′). By Definition 15.3.2, vj⊗wl is the basis vector in position (j−1)q+l of B⊗C, and vi′⊗wk′ is the basis vector in position (i−1)p+k of B′⊗C′. So the displayed expansion says that the entry of [S⊗T]B⊗CB′⊗C′ in row (i−1)p+k and column (j−1)q+l is aijbkl.

By the entry formula (∗) accompanying Definition 8.4.1, that is exactly the entry of A⊗B in the same position. Every row index of an mp×nq matrix is (i−1)p+k for exactly one pair (i,k), and every column index is (j−1)q+l for exactly one pair (j,l), so the two matrices agree in every position. This proves the theorem.

The ordering is the whole content, so it is worth being exact about it. Suppose we had ordered the product basis the other way, putting vi⊗wk in position (k−1)n+i, so that the second index changes slowly. Running the proof again, the entry in row (k−1)m+i and column (l−1)n+j is still aijbkl, which by (∗) is the entry of B⊗A in that position. So the other ordering gives [T]CC′⊗[S]BB′, the Kronecker product with the factors swapped — not the transpose, and not the same matrix. For square factors the two answers are related exactly as Proposition 8.4.2 says, by conjugating with the permutation matrix that relabels dictionary order into its reverse — which is precisely the change-of-coordinates matrix between the two orderings of the product basis. In the rectangular setting of Theorem 15.3.6 the relation is not a conjugation at all: the row and column relabelings are different permutations, so B⊗A=Pσ⊤(A⊗B)Pτ with two matrices, as Chapter 8 notes just after that proposition’s proof.

Warning. Do not reverse the two factors of the basis ordering. The theorem needs the index of the first tensor factor to be the slow one, matching Chapter 8’s dictionary order in (∗). With the fast and slow indices exchanged the matrix of S⊗T is [T]⊗[S]. For A=(1234) and B=(0110) these two differ in the (1,2) entry, which is a11b12=1 in the first and b11a12=0 in the second (the non-example after Definition 8.4.1).

Chapter 8’s two promises, paid. At Definition 8.4.1, Chapter 8 wrote that the symbol ⊗ “anticipates the tensor product of Chapter 15, of which this is the matrix version”. Theorem 15.3.6 is that statement, made precise and proved: the Kronecker product of two matrices is the matrix of the tensor product of the two maps they represent, taken in the product bases. At the end of the same section, Chapter 8 wrote that the Kronecker product is “the coordinate shadow of a basis-free construction: the tensor product of linear maps, in Chapter 15, whose matrix in suitable bases is exactly A⊗B”, and promised that “the dictionary order in (∗) will reappear there as an ordering of a basis vi⊗wk”. The suitable bases are B⊗C and B′⊗C′; the dictionary order has reappeared, as Definition 15.3.2; and the shadow is cast by S⊗T. The second promise gets a sharper payment at the end of this section, where the vec identity turns out to be this same theorem applied to a space of matrices.

Example (Computing with a tensor product of maps)

Let S:F2→F2 and T:F3→F2 have matrices, in the standard bases, A=(2103),B=(10−1210). Compute (S⊗T)(e1⊗f2+e2⊗f3) directly from Definition 15.3.1, and again from the matrix of Theorem 15.3.6. Here (e1,e2) is the standard basis of F2 and (f1,f2,f3) that of F3.

Solution. Directly. Columns of A and B give Se1=2e1, Se2=e1+3e2, Tf2=e2 and Tf3=−e1. Hence (S⊗T)(e1⊗f2+e2⊗f3)=2e1⊗e2+(e1+3e2)⊗(−e1)=−e1⊗e1+2e1⊗e2−3e2⊗e1, using bilinearity of ⊗ in both slots.

By matrix. The domain basis, ordered as in Definition 15.3.2, is (e1⊗f1,e1⊗f2,e1⊗f3,e2⊗f1,e2⊗f2,e2⊗f3), so the input has coordinate column (0,1,0,0,0,1). By Theorem 15.3.6 the matrix of S⊗T is A⊗B=(20−210−142021000030−3000630), and multiplying it by that column gives (−1,2,−3,0). In the codomain basis (e1⊗e1,e1⊗e2,e2⊗e1,e2⊗e2) this is the same element as before.

15.3.3. What Chapter 8 was computing

Every property of the Kronecker product proved by entry-chasing in Chapter 8 is now a property of maps, and several of them become one-liners. We record the three that the rest of the chapter uses.

The mixed product rule comes first, because it is the one Chapter 8 called “the engine of everything that follows”.

Corollary 15.3.7 (The Mixed Product Rule Is Functoriality)

Let A∈Mm×n(F), C∈Mn×t(F), B∈Mp×q(F) and D∈Mq×u(F). Then (A⊗B)(C⊗D)=(AC)⊗(BD).

Proof. Let S,R,T,U be the linear maps with matrices A,C,B,D in the standard bases of the relevant spaces Fk. By Theorem 15.3.6, with all product bases ordered as in Definition 15.3.2, A⊗B and C⊗D are the matrices of S⊗T and R⊗U. By Theorem 4.1.2 the product of the matrices is the matrix of the composite (S⊗T)(R⊗U), which is SR⊗TU by Proposition 15.3.3 (c). Applying Theorem 15.3.6 once more, and Theorem 4.1.2 again to each factor, the matrix of SR⊗TU is (AC)⊗(BD).

This is Theorem 8.4.1 (c), which Chapter 8 proved by partitioning both matrices into conformable blocks and multiplying blockwise. The proof above says what the identity means: doing two things one after the other in each slot separately is the same as doing them one after the other in both slots at once. In the same way, the bilinearity of Theorem 8.4.1 (a) is parts (a) and (b) of Proposition 15.3.3, its associativity (b) is Proposition 15.3.5, and its inverse rule (e) is parts (c) and (d) together with invertibility of a composite.

Next, the numerical invariants.

Corollary 15.3.8 (Rank, Determinant and Trace of a Tensor Product of Maps)

Let V,V′,W,W′ be finite-dimensional over F, S∈L(V,V′), T∈L(W,W′). Then rank(S⊗T)=rankS⋅rankT. If moreover V=V′ and W=W′, with n=dim⁡V≥1 and m=dim⁡W≥1, then det(S⊗T)=(detS)m(detT)n,tr(S⊗T)=trS⋅trT.

Idea. For the rank, choose bases adapted to the two kernels: then S⊗T kills most product basis vectors and sends the remaining rankS⋅rankT of them to independent vectors. For the determinant, split S⊗T=(S⊗id)(id⊗T). The factor idV⊗T preserves each of the n subspaces vi⊗W and acts on each as T; the factor S⊗idW preserves each of the m subspaces V⊗wk and acts as S. So each factor is block diagonal with repeated blocks, and the exponents count the other space’s dimension, which is where the exponents come from. The trace we take from the matrix.

Proof. Rank. Let r=rankS and s=rankT. Choose a basis (v1,…,vn) of V whose last n−r vectors form a basis of kerS; this is possible by Theorem 1.8.2 applied to a basis of kerS, after reordering. Then Sv1,…,Svr span imS by Theorem 2.2.4, and being r=rankS spanning vectors of an r-dimensional space they form a basis of imS (Theorem 1.6.4). Choose a basis (w1,…,wm) of W the same way, so that Tw1,…,Tws is a basis of imT and Twl=0 for l>s.

By Theorem 2.2.4, im(S⊗T) is spanned by the vectors Svj⊗Twl, and those with j>r or l>s are 0. Extend (Sv1,…,Svr) to a basis of V′ and (Tw1,…,Tws) to a basis of W′ (Theorem 1.8.2). By Theorem 15.2.5 the products of these basis vectors form a basis of V′⊗W′; in particular the rs vectors Svj⊗Twl with j≤r, l≤s are linearly independent. They therefore form a basis of im(S⊗T), and rank(S⊗T)=rs.

Determinant. By Proposition 15.3.3 (c) and (d), S⊗T=(S⊗idW)(idV⊗T), so det(S⊗T)=det(S⊗idW)det(idV⊗T) by Theorem 7.5.8. Fix bases B of V and C of W and use the ordering of Definition 15.3.2. For each i, the subspace vi⊗W:=span(vi⊗w1,…,vi⊗wm) is carried into itself by idV⊗T, which acts on it as T does on W; and V⊗W is the direct sum of these n subspaces, because their bases together form the basis B⊗C. Consecutive blocks of the ordering are exactly these subspaces, so [idV⊗T]B⊗CB⊗C=[T]CC⊕⋯⊕[T]CC⏟n blocks, whose determinant is (detT)n by Theorem 8.1.4 (d) and induction on the number of blocks. The same argument for S⊗idW, using instead the m subspaces V⊗wk, gives det(S⊗idW)=(detS)m. (This time the relevant basis vectors are not consecutive in the ordering of Definition 15.3.2, so reorder the basis to make them so; matrices of one operator in two bases are similar, by Theorem 4.2.3, hence have the same determinant, by Corollary 7.5.7.) Multiplying the two gives the formula.

Trace. By Theorem 15.3.6 the matrix of S⊗T in B⊗C is [S]BB⊗[T]CC, so by Definition 4.5.2 and Theorem 8.4.3 (b), tr(S⊗T)=trS⋅trT.

These are parts (a), (c) and (b) of Theorem 8.4.3, transported to operators. Two remarks on what has changed. First, the exponents in the determinant formula are no longer something to memorize: detS appears to the power dim⁡W because S⊗idW runs S once on each of the dim⁡W copies of V inside V⊗W. Second, the proof of the trace formula above is still a computation in a basis. There is a genuinely basis-free reason, and §04 gives it. The determinant, too, has a basis-free explanation, which has to wait for the top exterior power in §09.

Warning. Most operators on V⊗W are not of the form S⊗T. The operators that are of this form are heavily constrained: by Corollary 15.3.8 their rank is a product rs with r≤dim⁡V and s≤dim⁡W. Take V=W=F2, so dim⁡(V⊗W)=4, and let P be any operator on V⊗W of rank 3, for instance the projection onto the span of the first three basis vectors of Definition 15.3.2. Then 3=rs with r,s∈{0,1,2} is impossible, so P≠S⊗T for every S and T. The maps S⊗T do span L(V⊗W), which is a different and weaker statement; this is the same distinction as between simple tensors and general tensors in §02.

Quick check. Let S∈L(V) and T∈L(W) with dim⁡V=3 and dim⁡W=2, and suppose detS=2 and detT=−1. What are det(S⊗T) and det(T⊗S), where the second is an operator on W⊗V?

Solution. By Corollary 15.3.8, det(S⊗T)=(detS)dim⁡W(detT)dim⁡V=22(−1)3=−4. For T⊗S the roles swap, giving (detT)dim⁡V(detS)dim⁡W=(−1)322=−4 as well. The two agree, as they must: a determinant is a product of scalars, and the exponent always belongs to the other factor’s dimension. The tempting wrong answer, (detS)3(detT)2=8, puts each map’s own dimension in its exponent.

15.3.4. Maps as tensors

We come to the identification that the rest of the chapter runs on. A functional φ∈V∗ and a vector w∈W together determine a linear map V→W: measure with φ, then scale w by the answer. That recipe is bilinear in (φ,w), which is now a reflex: it must come from a linear map on V∗⊗W.

Theorem 15.3.9 (Tensors Are Maps)

Let V and W be finite-dimensional vector spaces over F. There is a unique linear map Θ:V∗⊗W→L(V,W),Θ(φ⊗w)(v)=φ(v)w, and it is an isomorphism. Moreover, for R∈L(V0,V) and U∈L(W,W0) with V0,W0 finite-dimensional, Θ((R′⊗U)(ξ))=UΘ(ξ)R(ξ∈V∗⊗W), where R′:V∗→V0∗ is the dual map of Definition 5.4.1 and the Θ on the left is the one for the pair (V0,W0).

Idea. Existence is the universal property again. For bijectivity, count: both sides have dimension dim⁡V⋅dim⁡W, so it is enough to see that Θ carries a basis onto a basis. It carries φj⊗wi to the map whose matrix is the matrix unit Eij, and the matrix units are a basis. The last formula is the statement that Θ turns the tensor product of maps into composition on the two sides; it is checked on simple tensors.

Proof. Existence and uniqueness. For fixed φ and w, the assignment v↦φ(v)w is linear, so it is an element φ⋅w of L(V,W). The map (φ,w)↦φ⋅w is bilinear: for every v, (φ+ψ)(v)w=φ(v)w+ψ(v)w,φ(v)(w+w′)=φ(v)w+φ(v)w′,(cφ)(v)w=cφ(v)w=φ(v)(cw), and two maps agreeing at every v are equal. By Definition 15.2.1 there is a unique linear Θ with Θ(φ⊗w)=φ⋅w.

Bijectivity. Let B=(v1,…,vn) be a basis of V with dual basis B∗=(φ1,…,φn) (Definition 5.1.3), and C=(w1,…,wm) a basis of W. By Theorem 15.2.5 the products φj⊗wi form a basis of V∗⊗W, of size nm. Now Θ(φj⊗wi) sends vk to φj(vk)wi=δjkwi, so it sends vj to wi and every other basis vector to 0. By Definition 4.1.1 its matrix is the matrix unit Eij. The matrix units form a basis of Mm×n(F) (Example (Standard Bases)) and T↦[T]BC is an isomorphism (Theorem 4.1.4), so the nm maps Θ(φj⊗wi) form a basis of L(V,W).

Hence imΘ contains a basis of L(V,W), so Θ is surjective (Theorem 2.2.4). Since dim⁡(V∗⊗W)=nm=dim⁡L(V,W), Theorem 2.3.1 gives nullityΘ=0, so Θ is injective (Theorem 2.2.3). Therefore Θ is an isomorphism.

Naturality. Both ξ↦Θ((R′⊗U)ξ) and ξ↦UΘ(ξ)R are linear in ξ, so by Lemma 15.3.2 it suffices to check them at ξ=φ⊗w. On the left, (R′⊗U)(φ⊗w)=R′φ⊗Uw, and for v∈V0, Θ(R′φ⊗Uw)(v)=(R′φ)(v)Uw=φ(Rv)Uw, using Definition 5.4.1. On the right, (UΘ(φ⊗w)R)(v)=U(φ(Rv)w)=φ(Rv)Uw by linearity of U. The two agree.

Warning. Finite dimension is a hypothesis, not decoration. The map Θ is defined and injective for any V and W, but it is surjective only onto the maps of finite rank: Θ(∑t=1Nφt⊗wt) has image inside span(w1,…,wN), so its rank is at most N. On V=W=F[x], the identity map has infinite rank and is therefore not Θ(ξ) for any ξ∈V∗⊗V. Everything below uses the finite-dimensional statement.

The letter Θ is deliberate: taking V=Fn and W=Fm and using the dual basis to identify (Fn)∗ with Fn, this Θ is the isomorphism Fm⊗Fn≅Mm×n(F) of Theorem 15.2.7, with the two factors written in the order that makes the source a space of maps rather than of matrices. Section 02’s model was the special case; this is the general statement.

Two uses of the theorem, immediately. First, it names the matrix units: under Θ, the map with matrix Eij is the tensor φj⊗wi, so a matrix is a sum ∑i,jaijφj⊗wi. Note the index order — the functional carries the column index, the vector the row index — and compare it with Chapter 8’s vectorization, which stacks columns.

Second, the naturality formula is the vec identity.

Example (The vec identity, read as a tensor product of maps)

Let A∈Mk×m(F) and B∈Mn×l(F), and let Ψ:Mm×n(F)→Mk×l(F),X↦AXB, which is linear. Identify Mm×n(F) with L(Fn,Fm) and Mk×l(F) with L(Fl,Fk). Explain why Theorem 8.4.4, vec(AXB)=(B⊤⊗A)vecX, is Theorem 15.3.6 applied to Ψ.

Solution. Let R:Fl→Fn and U:Fm→Fk be the maps with matrices B and A in the standard bases. Under the identification, Ψ becomes the map L(Fn,Fm)→L(Fl,Fk) sending T to UTR, so by the naturality clause of Theorem 15.3.9 it corresponds, through Θ, to R′⊗U:(Fn)∗⊗Fm→(Fl)∗⊗Fk. Order the basis of (Fn)∗⊗Fm as in Definition 15.3.2, using the dual standard basis (φ1,…,φn) first and the standard basis (e1,…,em) second. Then φj⊗ei sits in position (j−1)m+i, and Θ(φj⊗ei)=Eij. By Definition 8.4.2, vecEij=e(j−1)m+i. So vec is the coordinate map of this ordered basis: the dictionary order with the column index slow is exactly the order in which vectorization stacks the columns.

Now apply Theorem 15.3.6. The matrix of R′ in the dual standard bases is B⊤, because the matrix of a dual map is the transpose (Theorem 5.4.2), and the matrix of U is A. Hence the matrix of R′⊗U in the product bases above is B⊤⊗A. Reading that equality of matrices through the coordinate map vec gives vec(AXB)=(B⊤⊗A)vecX, which is Theorem 8.4.4.

For a numerical check, take A=(1201) and B=(301−1). Writing the four images AEijB in the order E11,E21,E12,E22 and stacking the four columns vec(AEijB) side by side gives (3612030100−1−2000−1), which is B⊤⊗A written out.

So the transpose in the vec identity, which Chapter 8 had to warn readers not to get wrong, is not a bookkeeping accident: it is there because Ψ multiplies X on the right by B, and right multiplication is precomposition, which reverses arrows. The dual map is what reverses them, and the matrix of a dual map is a transpose. That is the sharper form of Chapter 8’s second promise, and it is why the wrong guesses A⊗B⊤ and B⊗A are wrong.

15.3.5. Exercises

A. Check your understanding

Exercise (A1)
  • (a) State the defining property of S⊗T, and say why writing “(S⊗T)(v⊗w)=Sv⊗Tw, extended linearly” is not by itself a definition.
  • (b) Let dim⁡V=3, dim⁡W=4, dim⁡V′=2, dim⁡W′=5. What are the sizes of [S]BB′, [T]CC′ and [S⊗T]B⊗CB′⊗C′?
  • (c) In the ordering of Definition 15.3.2 with dim⁡V=3 and dim⁡W=4, which basis vector of V⊗W sits in position 7?
  • (d) True or false: every operator on V⊗W is of the form S⊗T. Justify your answer.
  • (e) State Theorem 15.3.9, including its hypothesis, and say what Θ(φ⊗w) does to a vector v.

Solution.

  • (a) S⊗T is the unique linear map V⊗W→V′⊗W′ with (S⊗T)(v⊗w)=Sv⊗Tw for all v,w (Definition 15.3.1). The quoted phrase is not a definition because a general element of V⊗W is a sum of simple tensors in many different ways, so a prescription on simple tensors may be inconsistent; v⊗0=0 already forces consistency conditions. What makes it work is that (v,w)↦Sv⊗Tw is bilinear, so Definition 15.2.1 supplies the map.

  • (b) 2×3, 5×4, and 10×12 (Theorem 15.3.6: an m×n and a p×q matrix give an mp×nq one).

  • (c) With q=4, position 7=(i−1)⋅4+k forces i=2, k=3. So it is v2⊗w3.

  • (d) False. By Corollary 15.3.8, rank(S⊗T)=rankS⋅rankT. With dim⁡V=dim⁡W=2, an operator of rank 3 on the 4-dimensional space V⊗W cannot have its rank factored as a product of two integers each at most 2.

  • (e) For V,W finite-dimensional, there is a unique linear Θ:V∗⊗W→L(V,W) with Θ(φ⊗w)(v)=φ(v)w, and it is an isomorphism. So Θ(φ⊗w) measures v with φ and scales w by the result.

B. Practice

Exercise (B1: A tensor product of maps, two ways)

Let S:Q2→Q2 and T:Q2→Q3 have matrices, in the standard bases, A=(1−120),B=(1002−11).

  • (a) Write down [S⊗T]B⊗CB′⊗C′ for the standard bases, ordered as in Definition 15.3.2.
  • (b) Compute (S⊗T)(e1⊗e2−e2⊗e1) directly from Definition 15.3.1.
  • (c) Check (b) against (a) by multiplying the matrix by the coordinate column of the input.

Solution.

  • (a) By Theorem 15.3.6 the matrix is A⊗B, of size 6×4: A⊗B=(10−10020−2−111−120000400−2200).

  • (b) The columns of A give Se1=e1+2e2 and Se2=−e1; the columns of B give Te1=f1−f3 and Te2=2f2+f3, where (f1,f2,f3) is the standard basis of Q3. Hence (S⊗T)(e1⊗e2−e2⊗e1)=(e1+2e2)⊗(2f2+f3)−(−e1)⊗(f1−f3)=e1⊗f1+2e1⊗f2+4e2⊗f2+2e2⊗f3, where the e1⊗f3 terms cancel: +1 from the first product and −1 from the second.

  • (c) The input has coordinates (0,1,−1,0) in the basis (e1⊗e1,e1⊗e2,e2⊗e1,e2⊗e2). Multiplying gives (1,2,0,0,4,2), which in the basis (e1⊗f1,e1⊗f2,e1⊗f3,e2⊗f1,e2⊗f2,e2⊗f3) is exactly the answer to (b).

Exercise (B2: Invariants without multiplying matrices)

Let S∈L(V) and T∈L(W) over R, with dim⁡V=4, dim⁡W=3, rankS=2, rankT=3, trS=5, trT=−2, detT=6.

  • (a) Find rank(S⊗T) and nullity(S⊗T).
  • (b) Find tr(S⊗T).
  • (c) Find det(S⊗T). Justify the value from the ranks alone.
  • (d) Find tr(S⊗idW) and tr(idV⊗T), and check that their product is not tr(S⊗T) in general by comparing with (b).

Solution.

  • (a) By Corollary 15.3.8, rank(S⊗T)=2⋅3=6. Since dim⁡(V⊗W)=12 by Theorem 15.2.5, Theorem 2.3.1 gives nullity(S⊗T)=12−6=6.

  • (b) tr(S⊗T)=5⋅(−2)=−10.

  • (c) rankS=2<4=dim⁡V, so S is not invertible and detS=0 by Theorem 3.4.4 and Definition 7.5.1. Hence det(S⊗T)=03⋅64=0. Directly: rank(S⊗T)=6<12, so S⊗T is not invertible.

  • (d) tr(S⊗idW)=trS⋅tridW=5⋅3=15 and tr(idV⊗T)=4⋅(−2)=−8, using trid=(dim)⋅1 from Theorem 4.5.3. Their product is −120≠−10. There is no contradiction: S⊗T is the composite of the two, and the trace of a composite is not the product of the traces.

Exercise (B3: Which statements hold?)

Let V,W be finite-dimensional over F. Determine which of the following hold for all S,S1,S2∈L(V) and T∈L(W). Justify your answer.

  • (a) (S1S2)⊗T=(S1⊗T)(S2⊗T).
  • (b) (S1S2)⊗T2=(S1⊗T)(S2⊗T).
  • (c) S⊗T=0 implies S=0 or T=0.
  • (d) S⊗idW and idV⊗T commute.
  • (e) If S and T are invertible, so is S⊗T, with inverse S−1⊗T−1.

Solution.

  • (a) Fails. By Proposition 15.3.3 (c) the right side is S1S2⊗T2, and with S1=S2=idV and T=2idW over Q the two sides are 2id and 4id on V⊗W, by Example 3 after Definition 15.3.1.

  • (b) Holds: it is exactly Proposition 15.3.3 (c).

  • (c) Holds. If S≠0 and T≠0, then rankS≥1 and rankT≥1, so rank(S⊗T)≥1 by Corollary 15.3.8, and S⊗T≠0.

  • (d) Holds. By Proposition 15.3.3 (c) and (d), both composites equal S⊗T.

  • (e) Holds. By Proposition 15.3.3 (c) and (d), (S⊗T)(S−1⊗T−1)=idV⊗idW=idV⊗W, and likewise in the other order.

C. Going deeper

Exercise (C1: When a tensor product of maps vanishes)

Let V,V′,W,W′ be finite-dimensional over F, S∈L(V,V′) and T∈L(W,W′).

  • (a) Prove that S⊗T=0 if and only if S=0 or T=0.
  • (b) Prove that ker(S⊗idW)=kerS⊗W, meaning the span of all v⊗w with v∈kerS.
  • (c) Deduce nullity(S⊗idW)=nullityS⋅dim⁡W, and check it against Corollary 15.3.8.

Solution.

  • (a) (⇐) If S=0, then (S⊗T)(v⊗w)=0⊗Tw=0 for all v,w, so S⊗T=0 by Lemma 15.3.2. Likewise if T=0. (⇒) Suppose S≠0 and T≠0. Then rankS≥1 and rankT≥1, so rank(S⊗T)=rankS⋅rankT≥1 by Corollary 15.3.8, and S⊗T≠0.

  • (b) (⊇) For v∈kerS and w∈W, (S⊗idW)(v⊗w)=0⊗w=0; a kernel is a subspace (Theorem 2.2.1), so it contains the span of these elements. (⊆) Choose a basis (v1,…,vn) of V whose last n−r vectors span kerS, where r=rankS, and such that Sv1,…,Svr are independent (as in the proof of Corollary 15.3.8). Let (w1,…,wq) be a basis of W and let z=∑j,lcjlvj⊗wl lie in the kernel. Then 0=(S⊗idW)(z)=∑j≤r∑lcjlSvj⊗wl, and the vectors Svj⊗wl with j≤r are linearly independent by Theorem 15.2.5, after extending (Sv1,…,Svr) to a basis of V′. Hence cjl=0 for all j≤r, so z is a combination of the vj⊗wl with j>r, all of which lie in kerS⊗W.

  • (c) By (b) and Theorem 15.2.5 applied to kerS and W, nullity(S⊗idW)=dim⁡kerS⋅dim⁡W=nullityS⋅dim⁡W. Consistency: Corollary 15.3.8 gives rank(S⊗idW)=rankS⋅dim⁡W, and adding the two gives (rankS+nullityS)dim⁡W=dim⁡V⋅dim⁡W=dim⁡(V⊗W), as Theorem 2.3.1 requires.

Exercise (C2: Rank-one maps and simple tensors)

Let V,W be finite-dimensional over F and let Θ be the isomorphism of Theorem 15.3.9.

  • (a) Prove that Θ(ξ) has rank at most 1 if and only if ξ is a simple tensor φ⊗w.
  • (b) Deduce that “not every tensor is simple” (§02) says exactly that not every linear map has rank at most 1, and identify the tensor corresponding to idV in a basis.
  • (c) Let dim⁡V=dim⁡W=2. Exhibit ξ∈V∗⊗W that is not simple, by exhibiting a map of rank 2.

Solution.

  • (a) (⇐) Θ(φ⊗w) sends every v into span(w), so its image has dimension at most 1. (⇒) Suppose R:=Θ(ξ) has rank at most 1. If R=0, then ξ=0=0⊗0 since Θ is injective. Otherwise imR=span(w) for some w≠0, so for each v there is a unique scalar φ(v) with Rv=φ(v)w; uniqueness and linearity of R make φ linear, so φ∈V∗. Then R=Θ(φ⊗w), and ξ=φ⊗w because Θ is injective.

  • (b) By (a) and bijectivity of Θ, the non-simple tensors in V∗⊗W correspond exactly to the maps of rank at least 2. Taking W=V with basis B=(v1,…,vn) and dual basis (φ1,…,φn), the matrix of idV is In=∑iEii, so idV=Θ(∑i=1nφi⊗vi). For n≥2 this has rank n≥2, hence is not simple. For n=2 it is the witness φ1⊗v1+φ2⊗v2, which is Example (A tensor that is not simple) read through Θ.

  • (c) Take ξ=φ1⊗w1+φ2⊗w2 for bases (v1,v2) of V and (w1,w2) of W. Then Θ(ξ) sends v1↦w1 and v2↦w2, so it has rank 2, and by (a) ξ is not simple.

Exercise (C3: Reproving the swap)

Let V and W be finite-dimensional over F with ordered bases B and C.

  • (a) Prove that there is a unique isomorphism τ:V⊗W→W⊗V with τ(v⊗w)=w⊗v.
  • (b) Prove that τ(S⊗T)=(T⊗S)τ for all S∈L(V), T∈L(W).
  • (c) Deduce Proposition 8.4.2: for A∈Mn(F) and B∈Mm(F) there is a permutation matrix P with B⊗A=P−1(A⊗B)P, and identify P.

Hint for (c): think of τ as renaming basis vectors rather than as moving them.

Solution.

  • (a) The map (v,w)↦w⊗v is bilinear, so Definition 15.2.1 gives a unique linear τ with τ(v⊗w)=w⊗v. The same construction with the roles swapped gives σ:W⊗V→V⊗W with σ(w⊗v)=v⊗w. Then στ fixes every simple tensor, so στ=id by Lemma 15.3.2, and likewise τσ=id. Hence τ is an isomorphism.

  • (b) Both sides are linear maps out of V⊗W, so by Lemma 15.3.2 compare at v⊗w: the left gives τ(Sv⊗Tw)=Tw⊗Sv, and the right gives (T⊗S)(w⊗v)=Tw⊗Sv.

  • (c) Let S,T be the operators on Fn,Fm with matrices A,B. Both B⊗C and τ−1(C⊗B) are orderings of the same basis of Fn⊗Fm, differing by the permutation σ that sends position (k−1)n+i to position (i−1)m+k — the direction matters, since σ is not an involution unless n=m — and let P be its matrix, which is exactly the Pσ built in the proof of Proposition 8.4.2.

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.