Tensor Products
The tensor product converts bilinear dependence on two vector spaces into ordinary linear dependence on one larger vector space. Its distinguished elements are the simple tensors , but the construction also contains arbitrary linear combinations of simple tensors.
For finite-dimensional spaces,
That multiplicative dimension is the first clue that a tensor product is not an ordered pair or a direct sum. This page develops the mathematical construction. The physical rule assigning tensor-product Hilbert spaces to distinguishable composite systems belongs to Tensor Products of Hilbert Spaces.
Why Bilinearity Is the Starting Point
Section titled “Why Bilinearity Is the Starting Point”Suppose a construction should combine and while remaining linear in either input when the other is fixed. It must obey
These relations have immediate consequences:
They also show that a scalar can be moved from one factor to the other:
Consequently, the factors of a nonzero simple tensor are not unique. For ,
The symbol therefore does not package two vectors as a literal ordered pair. It records their bilinear combination subject to these relations.
Algebraic Construction
Section titled “Algebraic Construction”One concrete construction begins with the free vector space generated by formal symbols for all . Quotient by the subspace generated by the bilinearity relations
The equivalence class of is denoted . This quotient is the algebraic tensor product .
The construction is characterized without reference to formal symbols by its universal property. Let
For every bilinear map , there is a unique linear map such that
Equivalently,
on simple tensors, and linearity determines its value on every tensor. This property is what makes the tensor product canonical: any two constructions with it are uniquely isomorphic in a way that preserves simple tensors.
Product Bases and Dimension
Section titled “Product Bases and Dimension”Let
be bases of and . Then
is a basis of . It has elements, so
If
bilinearity gives
Every tensor has a unique coordinate expansion
The coefficients depend on the chosen product basis, just as vector coordinates depend on a basis. The tensor itself does not.
Simple and Nonsimple Tensors
Section titled “Simple and Nonsimple Tensors”A nonzero tensor is simple, decomposable, or rank one when it can be written as . Most tensors are not simple.
In chosen bases, collect the coefficients of into the matrix
If , then
so has matrix rank one. Conversely, every rank-one coefficient matrix factors as and therefore defines a simple tensor. Thus, for nonzero ,
For example,
has coefficient matrix
Therefore
By contrast, has coefficient matrix and is not simple. The minimum number of simple tensors needed in a bipartite decomposition equals the rank of . This is the entry point to Singular Value Decomposition and Schmidt Decomposition as Linear Algebra.
Inner Products
Section titled “Inner Products”If and are finite-dimensional inner-product spaces, define the inner product first on simple tensors by
and extend sesquilinearly. In particular,
If and are orthonormal, then
The product basis is therefore orthonormal. For
one has
In finite dimensions no further completion is needed. In infinite dimensions, the algebraic tensor product is generally incomplete in this norm; its completion is the Hilbert-space tensor product.
Tensor Products of Linear Maps
Section titled “Tensor Products of Linear Maps”Let
be linear maps. Their tensor product is the unique linear map
defined by
Well-definedness follows from the universal property because is bilinear.
Compatible tensor-product maps obey
If and are invertible, unitary, Hermitian, or positive, then inherits the corresponding property, with the qualification that the tensor product of two Hermitian operators is Hermitian but need not be positive unless both spectra have compatible signs.
Local-factor maps commute:
This identity is algebraic; it does not assert that all physical operations on separated subsystems can be implemented independently.
Spectral and Trace Identities
Section titled “Spectral and Trace Identities”If and , then
When eigenbases exist, the eigenvalues of are all products , counted with multiplicity. In finite dimensions,
If is and is , then
These formulas include algebraic multiplicities. They are particularly useful for checking symbolic and numerical constructions.
Kronecker Product Matrices
Section titled “Kronecker Product Matrices”Choose ordered bases of and , then choose an ordering of the product basis. With the lexicographic convention
the matrix of is the Kronecker product
For example, if
then
Changing the product-basis ordering conjugates this matrix by a permutation matrix. The abstract operator is unchanged, but coordinate arrays and code must use the same convention.
Factor Order and Canonical Isomorphisms
Section titled “Factor Order and Canonical Isomorphisms”Tensor products are associative and symmetric up to canonical isomorphism, not literal equality. The associator sends
and the swap map sends
These maps justify suppressing parentheses when factor order is otherwise clear. They do not justify silently reversing factors. In coordinates, the swap is represented by a nontrivial permutation matrix, often called a commutation matrix.
Tensor products distribute over direct sums:
But is not generally isomorphic to : their dimensions are multiplicative and additive, respectively. See Direct Sums.
Dual Spaces and Linear Maps
Section titled “Dual Spaces and Linear Maps”In finite dimensions there are natural isomorphisms
Under the second isomorphism, a simple tensor corresponds to the rank-one map
This identification explains why outer products, rank-one operators, and two-index coefficient arrays are manifestations of the same tensor structure. In infinite dimensions the analogous identifications require topological qualifications and are not automatic for arbitrary bounded operators.
Subsystem Notation
Section titled “Subsystem Notation”When factors are labeled and , write
and keep labels on ambiguous vectors and identities:
Compact notation such as
is safe only after the factor order has been declared. Likewise, writing as shorthand for is convenient only when the ambient space is unambiguous.
The notation is mathematical. The statement that a physical composite has state space is a composition postulate; see Tensor Products in Core Formalism. Site-wide ordering conventions are collected in Tensor-Product Ordering.
Numerical Representation
Section titled “Numerical Representation”Tensor-product dimensions grow multiplicatively. If factors each have dimension , the full dimension is , and a dense operator has entries. This growth is structural, not an implementation accident.
For reliable computation:
- record the factor order and product-basis order explicitly;
- distinguish row-major and column-major reshaping conventions;
- test a Kronecker implementation on basis vectors;
- exploit sparse and structured tensor products;
- apply local operators by reshaping and contracting when possible instead of forming the full matrix;
- compare abstract identities before comparing flattened arrays;
- track whether complex conjugation is required by a dual or adjoint.
A reshape is not itself a basis-independent operation. It becomes meaningful only after dimensions and index ordering have been specified.
Common Mistakes
Section titled “Common Mistakes”- Treating as an ordered pair .
- Assuming every tensor is simple.
- Expanding but omitting the cross terms.
- Forgetting that scalar factors can move between tensor factors.
- Confusing the abstract tensor product with one Kronecker coordinate matrix.
- Reversing factor order without applying the swap isomorphism.
- Writing on a composite space without the required identity factors.
- Comparing flattened arrays produced by different basis-order conventions.
- Assuming a direct sum and a tensor product describe the same composition.
- Using the finite-dimensional dual-space identities without topological qualifications in infinite dimensions.
Exercises
Section titled “Exercises”-
Let have basis and have basis . Expand
in the product basis and give its coefficient matrix.
Solution
Set . Bilinearity gives
With rows indexed by and columns by , the coefficient matrix is
It has rank one, as expected for a simple tensor.
-
Determine which of the following tensors are simple:
Solution
Their coefficient matrices are
The first matrix has rank one and factors as
Hence
The second matrix has rank two, so is not simple.
-
Prove that both local-factor products equal :
by checking simple tensors. Why is that sufficient?
Solution
For every and , set and abbreviate
Then
In the reverse order,
The two linear maps agree on every simple tensor. Simple tensors span , so the maps agree everywhere.
- Let have eigenvalues and , and let have eigenvalues , , and , with eigenbases in both spaces. List the eigenvalues of , compute its trace, and verify the trace-product identity.
Solution
The product eigenvectors have eigenvalues
Their sum is
Separately,
so
References
Section titled “References”- S. Axler, Linear Algebra Done Right, 3rd ed., Springer, 2015.
- S. Roman, Advanced Linear Algebra, 3rd ed., Springer, 2008.
- W. H. Greub, Multilinear Algebra, 2nd ed., Springer, 1978.
- R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, 1991.
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2010.