A tensor product turns a bilinear map into a linear map. For vector spaces over the same field , its elements are finite sums of pure tensors , subject to bilinearity:
The scalar belongs to ; writing makes this choice explicit. These rules preserve separate linearity while allowing arbitrary linear combinations of products.[ref]
For a concrete example, take , with basis vectors in the first copy and in the second. The four tensor-product basis elements are
The pure tensor made from and expands to
Each basis vector in one factor can interact with each basis vector in the other. This is why dimensions multiply; the tensor-product coefficient matrix displays these four interactions as a two-by-two grid.
The tensor product is different from the Cartesian product . With componentwise vector addition and scalar multiplication, the latter contains pairs and has dimension . The map is bilinear, generally neither linear on that Cartesian product nor injective nor surjective. In our example, , and ; the separability of a tensor explains why some outputs cannot be reached at all. Both spaces happen to have dimension four when , but this coincidence does not identify their structures.
For a bilinear map , there is exactly one linear map satisfying . Equivalently, , where . The universal property of a tensor product concerns the vector space together with this distinguished bilinear map.[ref]
Here is a complete calculation over the real numbers. Define the bilinear map
Its values on pairs of basis vectors determine on the four tensor-product basis elements:
Consequently, for ,
For and , the direct calculation gives . Using the expansion of instead gives . The linear map also handles a nonseparable tensor such as : , even though no single pair has .
Figure 1.
A bilinear calculation factors through one linear map on four tensor coefficients
. Details.
A short proof uses a tensor-product basis: assign and extend by linearity. Expanding both inputs verifies by bilinearity; the assigned values on a basis force uniqueness. More generally, every multilinear map factors uniquely through a linear map from . This lets formulas involving several inputs define linear maps without choosing coordinates; tensor contraction uses the evaluation pairing between a vector and a covector.
If and are bases of finite-dimensional vector spaces over , then the products form a basis of . There is one independent coordinate for every pair of indices.[ref]
For a proof outline, bilinearity expands each pure tensor as
so these products form a spanning set. For linear independence, take the coordinate functionals from the two dual bases. The bilinear map induces a linear functional on the tensor product, satisfying . Applying it to a proposed zero linear combination selects just , forcing every coefficient to vanish. Thus dimensions multiply, rather than add. This finite-dimensional count includes a zero factor, whose tensor product has dimension zero.
After choosing ordered bases, identify a tensor with its matrix . This is a linear isomorphism between and the vector space of -by- matrices: each tensor-product basis element becomes the matrix with one entry equal to one and all others zero. In particular, a pure tensor has the outer product coefficient formula
Here on the right denote column coordinate vectors. The identification depends on the chosen bases, while the tensor itself does not. Over the complex numbers, the same formula uses the ordinary transpose , with no complex conjugation; replacing it by the conjugate transpose would conjugate the scalar in the second input, violating bilinearity.
Figure 1.
A pure tensor has an outer-product coefficient grid, while the identity grid needs two pure tensors
. Details.
In a two-factor tensor product over a field, a pure tensor is also called a separable or decomposable tensor: it can be expressed as one product . Every tensor is a finite sum of pure tensors, but a sum need not itself be a pure tensor.[ref]
For finite-dimensional vector spaces, the tensor-product coefficient matrix gives a decisive test: a nonzero tensor is a pure tensor exactly when its matrix rank is one. Indeed, every column of is a scalar multiple of . Conversely, if all columns of a nonzero matrix are multiples of one nonzero column , collect their multipliers in to obtain . The zero tensor is also a pure tensor, for example , but its matrix rank is zero.
In , the tensor
is nonseparable: its matrix rank is two and its determinant is one, whereas . Directly, trying requires and . The first two equations force all four scalars nonzero, contradicting the others. In contrast, products sharing a factor do combine: . Thus being written as two summands alone does not establish nonseparability.
The two-factor tensor rank is the smallest number of pure tensors whose sum equals , with zero allowed as the empty sum. For two finite-dimensional vector spaces over the same field, it equals the matrix rank of the tensor-product coefficient matrix. A sum of outer products has column space contained in the span of their first factors, so its matrix rank is at most . Conversely, choose a basis for the column space, express each column in that basis, and collect the coefficients into row vectors . This yields , hence a sum of pure tensors.
The pure tensor therefore has two-factor tensor rank one, whereas has two-factor tensor rank two. Both have two factors: the number of factors and the minimum number of product summands are different counts. Over the real numbers, the singular value decomposition supplies a useful decomposition , with one nonzero term per matrix rank. The two-factor rank equality does not extend to three or more factors by merely choosing one matrix layout.
The tensor algebra of a vector space is the graded algebra
with multiplication given by concatenation of tensors.
The truncated tensor algebra discards products of degree greater than . Its multiplication is . Every element with scalar part is invertible by a finite geometric series in its positive-degree part. Truncated exponential and logarithm are finite polynomials.
The nth tensor power is the iterated tensor product of modules .
The tensor square is the second tensor power . Over a field of characteristic different from two it decomposes as the direct sum of the symmetric square and exterior square.
The symmetric algebra is the quotient of by the ideal generated by . It is graded by symmetric powers:
The nth symmetric power is the quotient of that identifies tensors differing by a permutation of their factors. Equivalently, over characteristic zero it is the subspace of symmetric tensors.
In the symmetric power of the defining unitary group representation, diagonal torus weights are indexed by nonnegative integer tuples summing to , with one monomial per weight space. Torus averaging extracts a monomial from any nonzero invariant complex subspace. The complexified Lie algebra acts by on the symmetric algebra. Whenever , the displayed action moves one unit of degree from to with nonzero coefficient. Finite transfers connect every degree- monomial, so the subspace is the entire representation. The case is the one-dimensional trivial representation. This proof needs neither the Weyl character formula nor the Weyl dimension formula.
The three-dimensional irreducible representation of SU(2) has weights . Thus the character of its th symmetric power is . Its weight has multiplicity for . Subtracting adjacent weight multiplicities gives one copy of each . The invariant subspace is one-dimensional for even and zero for odd .
For eigenvalues of a finite-order linear action, its symmetric power characters satisfy . The denominator is the alternating generating polynomial of its exterior power characters.
The symmetric square is the quotient of by , and records symmetric tensors of rank two.
For , contraction with the invariant symmetric bilinear form splits off the trivial line in the symmetric square of the defining special orthogonal group representation. Its null space is the traceless symmetric square. It contains a highest-weight vector of weight , and the Weyl dimension formula gives , exactly its dimension. Complete reducibility of compact-group representations therefore makes that null space irreducible. The entire symmetric square is reducible because of the invariant line.
For , , the symmetric square splits into an invariant line and its irreducible traceless part of highest weight . The exterior square of the defining orthogonal representation is the adjoint module of highest weight . For , the exterior square splits instead into highest weights and . This exception reflects that so4 Lie algebra is semisimple but not simple.
Over every field, including characteristic two, there is a natural isomorphism
The middle summand maps to the mixed product . Monomial bases prove bijectivity, and the Leibniz rule makes the map equivariant for Lie algebra representations.
For the defining real representation of , the symmetric square splits as a scalar trace plus symmetric trace-free tensors: . The trace projection is , so the second summand has dimension .
For the trace-free summand is an irreducible real group representation. To see this, diagonalize a nonzero symmetric trace-free matrix in a nonzero invariant subspace. Two diagonal entries differ. Infinitesimal rotation in their plane yields a nonzero symmetric off-diagonal matrix; rotations carry it to every coordinate pair, and a rotation through produces a difference of two diagonal entries. These off-diagonal matrices and diagonal differences span all symmetric trace-free matrices, so the invariant subspace is the whole summand. For , its dimension is 299, the third-level nontrivial multiplet of the lowest levels of a fully transverse ND bosonic string.

Ancestors (6)

  1. Multilinear algebra
  2. Linear algebra
  3. Algebra
  4. Area of mathematics
  5. Mathematics
  6. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)