The Kronecker product is an operation on two matrices that constructs a larger block matrix by multiplying every entry of the first matrix by the entire second matrix. Denoted , it is the coordinate representation of the tensor product of two linear maps. It is used throughout linear algebra, numerical computation, statistics, and quantum mechanics to express systems with a product structure. The operation is named after the German mathematician Leopold Kronecker.
Definition and example
Let be an matrix and a matrix over the same field, usually the real or complex numbers. Their Kronecker product is the matrix
Equivalently, its entries satisfy
For example, if
then
Unlike ordinary matrix multiplication, the Kronecker product requires no matching inner dimensions. Every pair of finite matrices over the same field has a Kronecker product.
Relationship to tensor products
Suppose represents a linear map , and represents a linear map . Their tensor product is the linear map
specified on elementary tensors by
After choosing a basis in each space and ordering the resulting product bases consistently, the matrix of this map is .
Thus, the abstract tensor product and the Kronecker product are closely related but not identical notions: the former is a construction involving vector spaces and maps, whereas the latter is an explicit matrix construction in chosen coordinates.
For column vectors and , the same notation gives a column vector . The fundamental action rule is
Elementary tensors span the tensor-product space, so this identity determines the action on every vector by linearity.
Algebraic properties
Bilinearity and associativity
The Kronecker product is linear in each argument:
and, for any scalar ,
The sums require matching dimensions. It is also associative:
Accordingly, repeated products such as need no parentheses under the standard indexing convention.
Mixed-product identity
One of its most useful properties is
provided and are defined. This identity converts multiplication of large structured matrices into multiplication of their smaller factors.
For square matrices and nonnegative integers , it implies
It also gives
where is the identity matrix.
Transposes, adjoints, and inverses
The transpose and conjugate transpose act separately on the factors:
If both factors are square and invertible, their inverses satisfy
Consequently, Kronecker products preserve orthogonality and unitarity when both factors have the corresponding property.
Noncommutativity and reordering
In general,
Nevertheless, the two products differ only by prescribed row and column permutations. There are permutation matrices and such that
When and are square, these can be chosen so that , making the two products similar. The permutation implements the exchange .
Rank, determinant, and spectral properties
The rank obeys
For square matrices of order and of order , the determinant is
and the trace satisfies
If and , with and nonzero, then
More generally, over the complex numbers the eigenvalues of , counted with algebraic multiplicity, are all pairwise products
This remains true even when the factors are not diagonalizable.
The nonzero singular values are likewise all pairwise products of the nonzero singular values of the factors, as follows from their singular value decompositions. In particular, the spectral norm satisfies
For square nonsingular factors, the spectral-norm condition number therefore satisfies
Thus, a structured representation can reduce computational costs without eliminating ill-conditioning; repeated products can amplify it.
If both factors are Hermitian positive semidefinite, their Kronecker product is also Hermitian positive semidefinite. If both are positive definite, so is their product.
Vectorization and matrix equations
The vectorization operator stacks a matrix’s columns into one column vector. Under this convention,
whenever the matrix products are defined.
For example, if is , is , and is , both sides are vectors of length . The transpose is an ordinary transpose even when entries are complex.
This identity turns equations involving unknown matrices into ordinary systems of linear equations. The Sylvester equation
with of order , of order , and of size , becomes
The transformed system is useful for theoretical analysis, although specialized algorithms often solve the original matrix equation without forming the larger coefficient matrix.
Vectorization conventions matter: stacking rows instead of columns changes the order of the Kronecker factors and the associated formulas.
Kronecker sums
For square matrices of order and of order , the Kronecker sum is commonly defined as
Its eigenvalues are all pairwise sums
Because its two summands commute, its matrix exponential factors as
Kronecker sums occur when a multidimensional operator is the sum of operators acting separately on individual coordinates. Some texts use a reversed ordering of the factors; the convention must therefore be checked.
Applications
Numerical differential equations
Discretizations of partial differential equations on tensor-product grids often produce Kronecker structure. For example, a two-dimensional discrete Laplace operator can be written, with a suitable ordering of grid values, as
where and are one-dimensional difference matrices.
This representation separates coordinate directions and supports efficient storage, spectral analysis, and solution methods. Curved domains, irregular grids, and nonseparable coefficients can weaken or destroy the exact structure.
Statistics and covariance modeling
A separable covariance matrix for observations indexed by two factors, such as location and time, has the form
under a compatible ordering. Individual covariances then factor into a temporal term and a spatial term.
Such models can greatly reduce storage and simplify likelihood calculations. Separability is a modeling restriction, however: a general space–time covariance need not admit a single Kronecker factorization.
Quantum mechanics
In quantum mechanics, the state space of a composite finite-dimensional system is a tensor product. If an operator acts only on the first subsystem, its action on the composite system is represented by
Operators acting independently on two subsystems are represented by . General states need not be single tensor products, and general operators need not be single Kronecker products; sums of such products are required to represent arbitrary operators.
Computational considerations and distinctions
If is and is , explicitly storing a dense requires entries. Keeping only the factors requires entries.
Multiplication can often be performed without constructing the product. If is , then
For two dense factors, this reduces a matrix–vector multiplication from order arithmetic operations to order , using ordinary matrix multiplication. If the factors are sparse, the number of nonzero entries satisfies
These savings apply when the operator is available in exact or useful approximate Kronecker form; an arbitrary large matrix need not have such a compact representation.
The Kronecker product should also be distinguished from the Hadamard product, which multiplies corresponding entries of equally sized matrices and preserves their dimensions. Ordinary matrix multiplication contracts a shared index; the Kronecker product instead retains both sets of indices, producing a larger matrix.