simple tensor
The tensor product (http://planetmath.org/TensorProduct) \\PMlinkescapephrasetensor product of two vector spaces
and isanother vector space which is characterised by being universal
for bilinear maps on . As part of this package,there is an operation
on vectors such that for all and , and the primary subjectof this article is the image of that operation.
Definition 1.
The element is said to be asimple tensor if there exist and such that .
More generally, the element is said to be a simple tensor (with respect to thedecomposition of ) if thereexist for such that.
For this definition to be interesting, there must also be tensorswhich are not simple, and indeed most tensors aren’t. In order toillustrate why, it is convenient to consider the tensor product oftwo finite-dimensional vector spaces and over some field . In this case one can let (the vector space of matrices), since is isomorphic to any generic construction of and the tensor product of two spaces is anyway onlydefined up to isomorphism. Furthermore considering elements of and as column vectors
, the tensor product of vectors can bedefined through
where denotes the product of two matrices (in this case an matrix by a matrix). As a very concreteexample of this,
One reason the simple tensors in cannot exhaust thisspace (provded ) is that there are essentiallyonly degrees of freedom in the choice of a simple tensor, but dimensions (http://planetmath.org/Dimension2) in the space as a whole. Hence
How can one to understand the non-simple tensors, then? In general,they are finite sums of simple tensors. One way to see this is fromthe theorem that has a basis consisting of products ofpairs of basis vectors.
Theorem 2 (tensor product basis (http://planetmath.org/TensorProductBasis)).
Let and be vector spaces over with bases and respectively. Then is a basis for .
Expressing some arbitrary as a linearcombination
with respect to such a basis immediately produces the decomposition
as a sum of simple tensors, but this decomposition is often farfrom optimally short.Let and . The tensor is notsimple, but as it happens the tensor is simple. In general itis not trivial to find the simplest way of expressing a tensor asa sum of simple tensors, so there is a name for the length of theshortest such sum.
Definition 3.
The rank of a tensor is the smallest naturalnumber such that for some set of simple tensors , …, .
In particular, the zero tensor has rank , and all other simpletensors have rank .
-
Warning. There is an entirely different concept which is also called‘the rank of a tensor (http://planetmath.org/Tensor)’,namely the number of components
(factors) in the tensorproduct forming the space in which the tensor lives. This latter‘rank’ concept does not generalise‘rank of a matrix (http://planetmath.org/RankLinearMapping)’.The ‘rank’ of Definition 3 doesgeneralise ‘rank of a matrix’. (It also generalisesrank of a quadratic form (http://planetmath.org/Rank5).)
one way
One area where the distinction between simple and non-simple tensorsis particularly important is in Quantum Mechanics, because the statespace of a pair of quantum systems is in general the tensor productof the state spaces of the component systems. When the combined stateis a simple tensor , then thatstate can be understood as though one subsystem has state and the other state , but when the combined state is a non-simple tensor then the full system cannot beunderstood by considering the two subsystems in isolation, even ifthere is no apparent interaction between them. This situation isoften described by saying that the two subsystems areentangled, or using phrases such as “either is in state and is in state , or else is in state and is in state .”Entanglement is an important part of that which makes quantum systemsdifferent from probabilistic classical systems. The physicalinterpretations are often mind-boggling, but the mathematical meaningis no more mysterious than ‘non-simple tensor’.
Entanglement can also be a useful concept for understanding pure mathematics.One reason that the comultiplication of a coalgebra cannot simply be replaced in the definition by twomaps that compute the ‘left’and ‘right’ parts of is that value of may beentangled, in which case one left part and one rightpart cannot fully encode .