The previous section ended with a wish: a space
through which every bilinear map out of 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, is
a field and all vector spaces are over . No
finite-dimensionality is assumed until we reach bases,
where it is stated.
What the
object has to do
Here is the goal, stated before its terms are
defined. We want a space and a bilinear map
such that every bilinear map out of 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 : every other one is it, followed by a single
linear map.
Definition
15.2.1 (Tensor Product)
Let and be vector spaces over
. A tensor
product of and
is a
pair ,
where is a vector
space over and
is a bilinear map, satisfying:
- (T1)
(universal property) For
every vector space over and
every bilinear map , there is a unique linear
map with .
In words, clause by clause. For every : 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
.
There is a unique linear :
exactly one, so both existence and uniqueness are being
asserted. With : this is an equality of
functions on , namely for all
.
We say
factors through , and picture it as a
triangle: the two routes from to , one direct and one
through , give the
same answer.
Notice what the definition does not
say. It says nothing about the elements of , 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 has the form . It says that the values
are enough to determine a
linear map on —
which, as we prove below, means they span , 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.
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 and be vector spaces over
, and let and both
be tensor products of and . Then there is a
unique isomorphism 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 and at once, for free. ②
Compose them. The composite is a linear
self-map of that
does nothing to — and so is the
identity. ③ The uniqueness half of (T1), applied with
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 is bilinear. Apply (T1) for
with
and
:
there is a unique linear with . Symmetrically, applying
(T1) for with and gives a unique linear
with .
Step 2. The composite is linear (Theorem 2.4.2 (a)),
and The identity is also linear and
satisfies .
Step 3. Apply (T1) for with and , which is
bilinear by hypothesis. It says there is exactly
one linear map whose composite with is . Both and are such maps.
Hence . Swapping the roles of and gives
.
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 and exists, we write it
, write
for ,
and call an element of the form
a simple tensor (also called a
pure or decomposable tensor). The
defining property then reads: every bilinear has a unique linear with .
Bilinearity of , rewritten in this
notation, gives the rules we compute with: The third line is the one to remember:
a scalar moves freely across the sign.
That is the whole reason
does not determine and .
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 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 (Exercise (B1: Finitely Supported Sequences)).
Definition
15.2.3 (Free Vector Space on a Set)
Let be a set
and a field. The
free vector space on over is a subset of the space of all functions
(Example (The Standard Vector Spaces)
(d)), with the pointwise operations. For , let be
the function with and for .
Lemma
15.2.2 (Universal Property of the Free Vector
Space)
Let be a set
and a field.
- (a) is a subspace of
, and is
a basis of it.
- (b) For
every vector space over and
every function — no
structure on is
assumed, since is
only a set — there is exactly one
linear map with
for all .
Proof.
- (a) We use Theorem 1.2.1. The
zero function vanishes everywhere, so it lies in . If vanish
outside the finite sets and , then vanishes outside
, which is
finite, and
vanishes outside .
So is a
subspace.
Each
lies in .
Spanning: if is nonzero exactly on the finite set
, then and take the same value at every
point of , hence
are equal. Independence: if for distinct , evaluate at to get . By Definition 1.5.1,
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:
imposes no
relations among the , 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 passes,
in exactly one way, to a linear map on (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 over , a tensor product of and exists.
Idea. Write down the symbols
as a basis of a huge space , one basis vector for
each pair of vectors — so at this stage
has no properties at all. The four
bilinearity rules are then four families of elements of
that we want to
be zero, so divide by the subspace they span. A bilinear
becomes a
linear map on 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 , regarded
as a set, and let be the free
vector space on it (Definition 15.2.3), with
basis . Let be the span of all elements of the
four forms taken over all , all , and all . A span is a
subspace, so is
one. Put where is the quotient map, which is linear
with kernel (Theorem 4.4.4).
is
bilinear. The element lies in
, so
applying and
using its linearity gives . 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
.
(T1), existence. Let be a vector space and
bilinear. Regarding as a
function on the set , Lemma 15.2.2 (b) gives a
unique linear with . It kills every
generator of : for
instance because is linear in its
first slot, and the other three families vanish by the
other three clauses of bilinearity. Since is linear and vanishes
on a spanning set of , it vanishes on (Theorem 2.1.4); that
is, . By Theorem 4.4.10
(a) there is exactly one linear
with , and then so .
(T1), uniqueness. Suppose is
linear with . Since is surjective and the
span , the elements span . On each of them, and agree, both
giving . Two linear maps that agree on a
spanning set agree everywhere, by Theorem 2.1.4. Hence
.
So
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
in this
book is derived from (T1), never from cosets of formal
sums — which is also why the identification 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 be a tensor product. Then .
Proof. Let , a subspace of , and let
be the inclusion, which is linear.
Restricting the codomain of gives a bilinear map
, ; it
is bilinear because is and because is a subspace, so the
identities hold already in . By (T1) with there is a linear
with . Then is a linear self-map
of with
, and so is . By the uniqueness
clause of (T1) with and , we get . Hence is surjective, so .
A basis
and a dimension
Now we can count. The prediction at the end of the
previous section was , and here it is,
with a basis attached.
Theorem
15.2.5 (Basis of a Tensor Product)
Let and be finite-dimensional,
with bases of and of . Then the simple tensors form a basis of . In particular .
Idea. Spanning is bilinearity:
expand both slots of a simple tensor and use Proposition 15.2.4.
Independence needs linear functionals on 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 .
Proof. Spanning. By Proposition 15.2.4 it
suffices to write each simple tensor in terms of the
listed ones. Let and . Expanding one slot at a time by
the rules following Definition 15.2.2,
Independence. Let and
be the bases of and dual to the given
ones, so and (Theorem 5.1.3). Fix and . The function is bilinear: freezing leaves ,
a scalar multiple of a linear functional, and
symmetrically. By (T1) there is a linear with ; in
particular .
Now suppose . Apply . By linearity the
left side becomes , and the
right side is .
Hence .
Since and were arbitrary, all
coefficients vanish.
So the listed
tensors form a basis, and .
This proves the theorem.
Aftermath: the count agrees. We
found in Theorem 15.1.2, and we
argued that a universal object would have to satisfy
, forcing . 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 be
vector spaces over . The map is an isomorphism of vector spaces. When , , and are finite-dimensional,
both sides have dimension .
Proof. lands where claimed:
is
bilinear, since freezing one slot of gives a linear map
and composing with the linear keeps it linear (Theorem 2.4.2 (a)). It
is linear in by
Theorem 2.4.2 (d),
which gives and .
It is surjective by the existence half of (T1) and
injective by the uniqueness half: if , then both
and the zero map
are linear maps composing with to give the zero
bilinear map, so , 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 when , viewed as a
one-dimensional space over itself? What is it when ?
Solution. For : by Theorem 15.2.5, and indeed
is an isomorphism , since
it carries a basis to the basis
. For : the dimension is , so . Both are the degenerate cases one
should be able to predict from the product formula, and
both come out right.
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: is the space of matrices, with
the simple tensor corresponding to the outer
product .
Theorem
15.2.7 ()
Let .
There is a unique linear map and it is an isomorphism, carrying to the matrix unit . Under , the simple
tensors correspond exactly to the matrices of rank at
most .
Proof. The map is bilinear: its entry is , and with frozen, and by Theorem 0.9.4 (2) and
(4); freezing is the same
computation (Exercise (B1: Determine which are multilinear)
(c)). By (T1) there is a unique linear with . On standard basis
vectors,
has a single in
position , so
.
By Theorem 15.2.5 the tensors form a basis of , and the
matrix units
form a basis of (Example (Standard Bases)
(c)). By Theorem 2.1.5 there is
a linear with . 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 nonzero is a
product of an and a matrix, so it has rank by Proposition 4.3.2;
and when or , of
rank . Conversely,
a matrix of rank
factors as
with and , again by Proposition 4.3.2,
and the zero matrix is . This proves the theorem.
Example
(Computing in )
Work in with standard bases
and .
- (a) Expand in the basis of Theorem 15.2.5, and write
the corresponding matrix.
- (b) Decide whether
is a simple tensor, and if so write
it as one.
- (c) Decide whether
is a
simple tensor.
Solution.
(a) Expanding one
slot at a time, The coefficient of is the entry of the
matrix, so
sends it to which is the outer product predicted by Theorem 15.2.7.
(b) The
coefficients give . Its second row is
times its first,
so every
minor vanishes and the rank is (Theorem 7.7.1). By Theorem 15.2.7, is simple. Factoring,
, so which expands back to .
(c) Here , whose first two columns
are independent, so its rank is . By Theorem 15.2.7, is not
simple. No amount of rewriting will turn it into a
single .
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 , the element is not a simple tensor, for any
field .
Idea. Two routes, and both are
worth having. The quick one: , of rank
, while simple
tensors have rank at most . The portable one:
suppose , hit it with the four coordinate
functionals
built in the proof of Theorem 15.2.5, and read
off four scalar equations that cannot all hold.
Proof. Suppose for some . Let be
the basis of dual to ,
and for let be the linear map
with ,
supplied by (T1) as in the proof of Theorem 15.2.5. Applying
to both
sides of gives that is, , , , and . From we get , so forces — and then . This contradiction shows that no
such exist, so is not simple.
Warning. A general element
of 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 , do not write
“define it on 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 ”. A later section meets
the same failure for elements of 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 and be finite-dimensional,
and
.
Then if and only if or
.
Proof. If , then
, using that a scalar
passes across . The case is
the same with the slots swapped.
Suppose and . By
Theorem 5.1.5 (a) there
are and with and
.
The map is
bilinear, so (T1) gives a linear with . Then , while . Hence
. This proves the proposition.
Warning. A product of
nonzero things can be zero in many algebraic settings,
but not here. It is tempting to expect to behave
like a ring with zero divisors, so that some
vanishes accidentally. It does not: Proposition 15.2.8 says
the only way to get is to feed in
. The zero
divisors appear one level later — in the algebras of the
following sections, where products of nonzero
sums of simple tensors can vanish.
A
simple tensor does not remember its factors
Proposition
15.2.9 (When Two Simple Tensors Agree)
Let and be finite-dimensional,
and let and with . Then if and only if there is a scalar with
and .
Idea. The “if” half is the scalar
rule. For “only if”, the danger is that points
somewhere new. Suppose it does; then
is independent, so there is a functional killing and not , and the
corresponding on
separates the two sides.
Proof. If
and , then , moving each scalar across .
Suppose . By Proposition 15.2.8 all
four vectors are nonzero. Suppose, for a contradiction,
that . Then
is linearly independent, so it extends to a basis of
(Theorem 1.6.5), and
the dual basis (Theorem 5.1.3) provides
with and . Since , Theorem 5.1.5 (a) provides
with
. By (T1) there is a linear with . Evaluating
both sides of , which is absurd. Hence
for some ,
and because
.
Then , so by bilinearity.
Since , Proposition 15.2.8 forces
, that is, . This proves the
proposition.
Warning. does not
mean and . Already , with different
factors on the two sides. So “the first factor of a
simple tensor” is not a well-defined
function: writing and then speaking of
“the of
” is an error.
What Proposition 15.2.9
salvages is that the lines and are
determined, which is exactly the information carried by
a rank-one matrix: its column space and its row
space.
Quick check. In , is
a
simple tensor?
Solution. No. Its matrix under
is , of determinant
, hence of
rank (Theorem 7.5.2). By Theorem 15.2.7 a simple
tensor would have rank at most . Note how little the
symmetry of the expression helps: being a sum of two
simple tensors is the generic situation, not a special
one.
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 in
terms of and
, and a
basis.
- (d) True or false:
every element of is of the form . Justify your answer.
- (e) True or false:
if then .
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 with bilinear such that for every
vector space and
every bilinear there is a unique linear
with (Definition 15.2.1).
(b) That any two
tensor products of and are isomorphic by a
unique isomorphism commuting with the two structure
maps. The uniqueness clause: it says
there is only one linear self-map composing with
to give , and since both
and
are such
maps, they are equal.
(c) , with
basis for bases of and of (Theorem 15.2.5).
(d) False. In
,
is
not simple (Example (A tensor that is not simple)).
(e) False as
stated: it says or (Proposition 15.2.8). For
instance for every .
(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 below, determine whether it is a
simple tensor. If it is, write it as ; if it is not, justify your answer.
Use the standard basis in both factors.
- (a) .
- (b) .
- (c) .
- (d) .
Solution. Throughout we use Theorem 15.2.7: is simple exactly when
the matrix , whose entry is the
coefficient of , has rank at most .
(a) . Row is times row and row is zero, so the rank is
. Factoring, , so which expands to the four given
terms.
(b) , of
rank . Not simple.
This is Example (A tensor that is not simple)
one size larger.
(c) has in positions and and zeros
elsewhere. Its top-left minor is , so its rank is
(Theorem 7.7.1). Not
simple.
(d) , of rank
. So is simple, and indeed
. 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) , . Compute .
- (b) , .
Compute for any .
- (c) , , for finite-dimensional.
Compute for a basis with dual
basis ,
assuming .
Solution.
(a) is the dot product,
bilinear by Example (Six two-slot functions)
(a). By (T1) there is a unique linear with . By linearity,
(b) Each entry of
is , linear
in each slot, so is bilinear and
(T1) applies. Then for every , so the induced
map kills every “diagonal” simple tensor without being
zero:
for .
(c) The
evaluation pairing is bilinear by Example (Seven functions of several vectors)
(f), so exists with . Hence This map is the contraction, and the answer
is a first
glimpse of a later section: it is the trace of a
rank-two projection.
Exercise
(B3: Dimensions and bases)
Let , , and be finite-dimensional
over , with , , and .
- (a) Find and
.
- (b) Find
and , and explain why they agree.
- (c) Let with basis and with basis . Write down a basis of and say which
basis vector corresponds to the matrix unit under .
Solution.
(a) by Theorem 15.2.5, and then
, applying the theorem
again to the pair .
(b) by Theorem 4.1.4,
and 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 tensors with and . Since , the basis vector
corresponding to is .
C. Going deeper
Exercise
(C1: The tensor product is commutative, up to a unique
isomorphism)
Let and be vector spaces over
.
- (a) Prove that there
is a unique linear map with for all , and
that it is an isomorphism.
- (b) Deduce that
when , where
means
applied
twice to .
- (c) Explain why the
argument in (a) never mentions a basis, and why that
matters.
Hint for (a): the map is bilinear; then
build the inverse the same way and use the uniqueness
clause of (T1).
Solution.
(a) The map , , is
bilinear, because is bilinear and
swapping the slots exchanges the two clauses of Definition 15.1.1. By (T1)
for
there is a unique linear with . Symmetrically,
(T1) for gives a unique linear with . Then
is a linear self-map of with ,
and so is the identity; by the uniqueness clause of (T1)
applied with and , the two agree, so .
Symmetrically .
Hence is an
isomorphism (Theorem 2.5.1).
(b) With , part (a) gives
, since both are the unique linear map
sending to . Hence .
(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 and be finite-dimensional
and let .
- (a) Prove that the
subspace depends only on , not on the chosen
factorization.
- (b) Prove the
corresponding statement for .
- (c) For and , identify these
two subspaces in terms of the matrix of Theorem 15.2.7, and say
why (a) and (b) are then statements you already
knew.
Solution.
(a) Suppose with . By Proposition 15.2.9 there
is with
. A nonzero scalar multiple spans the
same subspace, so . Hence the line is determined
by
alone.
(b) The same
proposition gives with , so .
(c) Under , corresponds to ,
a matrix of rank
(Theorem 15.2.7). Every
column of is a
scalar multiple of , and is nonzero, so ; every row is a multiple of
, so
. 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
itself, rather than its line, to be
recoverable.