Tensor Products and Multilinear Maps
One-line statement: The tensor product is the universal vector space through which all bilinear maps out of factor uniquely as linear maps. Key result in words: Multilinear algebra is linearized — every multilinear map becomes an ordinary linear map on a single tensor space, turning analysis of -fold linear dependence into the study of one big vector space. Where it applies: Differential geometry (tensor fields), representation theory, quantum mechanics (entanglement), homological algebra, algebraic geometry, machine learning (tensor decompositions). Who/when: Roots in Grassmann (1844) and Ricci–Levi-Civita (1900); abstracted by Whitney, Bourbaki, and category theory in the 20th century.
Bilinearity is not preservation of structure under a single operation — a bilinear map fails to be a homomorphism of vector spaces because but is not additive jointly. The tensor product is the precise device that records exactly the relations forced by bilinearity and no more. It is the "freest" target: you build the largest space in which obeys only the bilinear identities, then every other bilinear map is a quotient of this universal one. The slogan: tensor products turn bilinear maps into linear maps.
Formal Statement
Let be vector spaces over a field . A map is multilinear (-linear) if it is linear in each argument separately: for each , with all other arguments fixed,
Derivation hint: this is just copies of the single-variable linearity condition, one per slot, with all other slots frozen. For this is bilinear. The set of all -linear maps is a vector space, denoted or .
A tensor product of and is a pair consisting of a vector space and a bilinear map , written , satisfying the universal property: for every vector space and every bilinear map , there exists a unique linear map with
Derivation hint: this is the factorization ; uniqueness comes because simple tensors span , so is determined on a spanning set. We write . The defining bilinear identities are
Derivation hint: these follow from requiring itself to be bilinear; they are the only relations imposed in the free construction below.
Let be the free vector space on the set (basis = all pairs ). Let be the subspace spanned by all elements
Derivation hint: each generator of is "the failure of bilinearity"; quotienting kills exactly those failures. Then define
Derivation hint: the quotient map sends the formal pair to its class; the relations are precisely those of equation [3], so is bilinear and universal by the universal property of free objects and quotients.
The tensor product exists and is unique up to unique isomorphism: if and both satisfy the universal property, there is a unique linear isomorphism with . Moreover, if is a basis of and is a basis of , then is a basis of . Hence in finite dimensions
Derivation hint: the basis claim follows from the construction in [5] plus the universal property; dimension is the cardinality of the product index set . There is a canonical isomorphism
Derivation hint: send a bilinear to its unique factorization ; this map is linear and invertible by the universal property — it is the categorical meaning of "tensor product is left adjoint to Hom".
Why It Holds / Derivation
Step 1. Suppose and both satisfy the universal property. Since is bilinear, by universality of there is a unique linear with , i.e. .
Step 2. Symmetrically, since is bilinear, universality of yields a unique linear with .
Step 3. Consider . It satisfies , so and are two linear maps factoring the bilinear map through . By the uniqueness clause of the universal property, . Symmetrically .
Step 4. Hence is the unique isomorphism intertwining the universal maps.
∎Step 1 (Spanning). Any , give, by bilinearity [3], . Since simple tensors span (true in the construction [5]), the span.
Step 2 (Independence). For each pair define the bilinear map by (coordinate extraction). By universality there is a linear with .
Step 3. Suppose . Apply : for all . Hence linear independence.
∎:::proof[The Hom-tensor adjunction, equation [7]] Step 1. Define by , the factorization guaranteed by [2]. Linearity of : agrees with on simple tensors, hence everywhere.
Step 2. Define by . This is bilinear in since is.
Step 3. , so . And is the unique factorization of , which is itself. So .
Grassmann's Ausdehnungslehre (Theory of Extension, 1844, revised 1862) introduced the exterior (Grassmann) product and the conceptual seed of multilinear algebra decades before the tensor formalism crystallized. Working in near-total obscurity as a Gymnasium teacher in Stettin, he developed an algebra of "extensive quantities" — what we now recognize as elements of exterior and tensor algebras — including the alternating product . His work was so far ahead of its notation that few contemporaries understood it; only after Ricci-Curbastro and Levi-Civita's "absolute differential calculus" (tensor analysis, c. 1900) and its dramatic use by Einstein in general relativity did the full architecture of multilinear algebra gain recognition. The modern universal-property definition is due to the categorical reformulation by Bourbaki and others in the mid-20th century.
Building Intuition
Think of as the place where you can multiply vectors from different spaces without choosing coordinates. You cannot "multiply" a velocity vector by a force vector inside — the product lives in a larger -dimensional space, and the entries are exactly the components. A cleaner mental model: matrices when , . A simple tensor is the rank-one matrix (outer product). A general element is any matrix, written as a sum of rank-one pieces. The minimal number of summands is the matrix rank — and this is the prototype for the deep notion of tensor rank in higher orders. Bilinearity of corresponds to the fact that . The universal property is the abstract way of saying: to define a linear map out of , it suffices and is necessary to specify a bilinear map on . You never need to check what happens on general sums — only on the building blocks , and only that the bilinear relations are respected.
Worked Examples
Given: with basis , and with basis . Compute in the basis and as a matrix.
Step 1. Expand by bilinearity [3]:
Step 2. Distribute: coefficients are .
- , ,
- , ,
Step 3. As the outer product matrix (rows indexed by , columns by ):
This matrix has rank 1, confirming is a simple tensor (dimensionless coefficients).
Given: . Decide whether for some .
Step 1. As a matrix, (the identity).
Step 2. A simple tensor corresponds to a rank-1 matrix , whose determinant is (any outer product has linearly dependent columns).
Step 3. But , so has matrix rank .
Step 4. Therefore cannot be written as a single .
This is exactly the maximally entangled Bell state up to normalization — the prototype of quantum entanglement.
Common Misconceptions
Pitfall 1: "Every element of is ." False. Simple tensors only span ; the generic element is a sum, and (Example 2) need not collapse to a single term. The minimal number of terms is the tensor rank.
Pitfall 2: "." That is the direct sum . For tensor product the dimension multiplies: (equation [6]).
Pitfall 3: "." Only after choosing the swap isomorphism ; these are different spaces and the elements are not literally equal. The braiding is canonical but nontrivial (it is the source of symmetric vs. exterior algebra).
Pitfall 4: Forgetting the field. depends on . For example (real dimension 4), whereas (dimension 1 over ).
Over a non-field ring the tensor product can fail to be exact. Consider -modules. The injection is injective, but tensoring with gives
which is the zero map, hence not injective. So is only right exact, not exact; its failure is measured by . Over a field this never happens (all modules are free/flat), which is exactly why the clean dimension count [6] holds for vector spaces but not for general modules.
Connections
The tensor product is the hub of multilinear algebra and threads into many areas:
- <span class="wiki-link-missing">Exterior Algebra</span>: is the quotient of by the subspace generated by with a repeated factor; it linearizes alternating multilinear maps (determinants, differential forms).
- <span class="wiki-link-missing">Symmetric Algebra</span>: linearizes symmetric multilinear maps (polynomials).
- <span class="wiki-link-missing">Dual Space and Bilinear Forms</span>: in finite dimensions, and bilinear forms on .
- <span class="wiki-link-missing">Category Theory and Adjoint Functors</span>: equation [7] expresses the adjunction , making a symmetric monoidal category.
- <span class="wiki-link-missing">Tensor Fields on Manifolds</span>: pointwise tensor products of tangent and cotangent spaces give the global tensor bundle in differential geometry.
Real-World Applications
Historical Development
Subtleties & Limits
Tensor rank and complexity. While matrix rank (order-2 tensors) is computable by Gaussian elimination, for order the situation is wild:
- Computing tensor rank is NP-hard (Håstad, 1990) over and .
- Rank depends on the field: a real tensor can have higher rank over than over .
- Border rank vs. rank: a tensor can be a limit of rank- tensors without itself having rank (the set of bounded-rank tensors is not closed), which underlies fast matrix multiplication.
- Matrix multiplication exponent : the bilinear map is a tensor whose (border) rank growth determines ; whether is a major open problem. Strassen's 1969 algorithm exploits that the multiplication tensor has rank .
- Maximal and generic ranks of tensor spaces are unknown in general dimensions; even the maximal rank of involves subtle algebraic geometry (secant varieties of Segre embeddings).
See Also
Exterior Algebra · Symmetric Algebra · Dual Space and Bilinear Forms · Universal Properties in Algebra · Tensor Fields on Manifolds · Category Theory and Adjoint Functors · Homological Algebra and Tor · Representation Theory of Lie Algebras