|
|
|
|
simple tensor
|
(Definition)
|
|
|
The tensor product $U \otimes V$ of two vector spaces $U$ and $V$ is another vector space which is characterised by being universal for bilinear maps on $U \times V$ . As part of this package, there is an operation $\otimes$ on vectors such that
for all
and
, and the primary subject of this article is the image of that operation.
Definition 1 The element
 is said to be a simple tensor if there exist
 and
 such that
 .
More generally, the element
is said to be a simple tensor (with respect to the decomposition
of $W$ ) if there exist
for
such that
.
For this definition to be interesting, there must also be tensors which are not simple, and indeed most tensors aren't. In order to illustrate why, it is convenient to consider the tensor product of two finite-dimensional vector spaces
and
over some field $\K$ . In this case one can let
(the vector space of $m \times n$ matrices), since $\K^{m \times n}$ is isomorphic to any generic construction of $U \otimes V$ and the tensor product of two spaces is anyway only defined up to isomorphism. Furthermore considering elements of $U$ and $V$ as column vectors, the tensor product of vectors can be defined through \begin{equation*} \vek{u} \otimes \vek{v} = \vek{u} \cdot \vek{v}^{\mathrm{T}} \end{equation*}where $\cdot$ denotes the product of two matrices (in this case an $m \times 1$ matrix by a $1 \times n$ matrix). As a very concrete example of this, \begin{equation*} \begin{pmatrix} u_1 \\ u_2 \\ u_3 \end{pmatrix} \otimes \begin{pmatrix} v_1 \\ v_2 \\ v_3 \\ v_4 \end{pmatrix} = \begin{pmatrix} u_1v_1 & u_1v_2 & u_1v_3 & u_1v_4 \\ u_2v_1 & u_2v_2 & u_2v_3 & u_2v_4 \\ u_3v_1 & u_3v_2 & u_3v_3 & u_3v_4 \end{pmatrix} \text{.} \end{equation*}One reason the simple tensors in $U \otimes V$ cannot exhaust this space (provded
) is that there are essentially only $m+n-1$ degrees of freedom in the choice of a simple tensor, but $mn$ dimensions in the space $U \otimes V$ as a whole. Hence \begin{equation*} \K^m \otimes \K^n \neq \setOf{ \vek{u} \otimes \vek{v} }{ \vek{u} \in \K^m, \vek{v} \in \K^n} \qquad\text{when \(m,n \geqslant 2\).} \end{equation*} 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 from the theorem that $U \otimes V$ has a basis consisting of products of pairs of basis vectors.
Theorem 2 ( tensor product basis) Let $U$ and $V$ be vector spaces over $\K$ with bases $\{\vek{e}_i\}_{i \in I}$ and $\{\vek{f}_j\}_{j \in J}$ respectively. Then
is a basis for $U \otimes V$ .
Expressing some arbitrary
as a linear combination $$ \vek{w} = \sum_{r=1}^n \lambda_r(\vek{e}_{i_r} \otimes \vek{f}_{j_r}) $$ with respect to such a basis immediately produces the decomposition $$ \vek{w} = \sum_{r=1}^n (\lambda_r\vek{e}_{i_r}) \otimes \vek{f}_{j_r} $$ as a sum of simple tensors, but this decomposition is often far from optimally short. Let
and
. The tensor
is not simple, but as it happens the tensor
is simple. In general it is not trivial to find the simplest way of expressing a tensor as a sum of simple tensors, so there is a name for the length of the shortest such sum.
Definition 3 The rank of a tensor $\vek{w}$ is the smallest natural number $n$ such that
 for some set of $n$ simple tensors $\vek{w}_1$ , ..., $\vek{w}_n$ .
In particular, the zero tensor has rank $0$ , and all other simple tensors have rank $1$ .
Warning. There is an entirely different concept which is also called `the rank of a tensor', namely the number of components (factors) in the tensor product forming the space in which the tensor lives. This latter `rank' concept does not generalise `rank of a matrix'. The `rank' of Definition does generalise `rank of a matrix'. (It also generalises rank of a quadratic form.)
One area where the distinction between simple and non-simple tensors is particularly important is in Quantum Mechanics, because the state space of a pair of quantum systems is in general the tensor product of the state spaces of the component systems. When the combined state is a simple tensor
, then that state can be understood as though one subsystem has state $\vek{u}$ and the other state $\vek{v}$ , but when the combined state $\vek{w}$ is a non-simple tensor
then the full system cannot be understood by considering the two subsystems in isolation, even if there is no apparent interaction between them. This situation is often described by saying that the two subsystems are entangled, or using phrases such as ``either $U$ is in state $\vek{u}_1$ and $V$ is in state $\vek{v}_1$ , or else $U$ is in state $\vek{u}_2$ and $V$ is in state $\vek{v}_2$ .'' Entanglement is an important part of that which makes quantum systems different from
probabilistic classical systems. The physical interpretations are often mind-boggling, but the mathematical meaning is 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 $C$ cannot simply be replaced in the definition by two maps
that compute the `left' and `right' parts of $\Delta$ is that value of $\Delta$ may be entangled, in which case one left part $\Delta_L(c)$ and one right part $\Delta_R(c)$ cannot fully encode $\Delta(c)$ .
|
"simple tensor" is owned by lars_h.
|
|
(view preamble | get metadata)
Cross-references: right, maps, coalgebra, comultiplication, interpretations, classical systems, even, quantum systems, state space, number, natural number, length, combination, linear combination, basis, sums, finite, degrees of freedom, product, column vectors, isomorphism, isomorphic, matrices, field, finite-dimensional, tensors, decomposition, image, vectors, operation, bilinear maps, universal, vector spaces
There are 11 references to this entry.
This is version 2 of simple tensor, born on 2005-08-01, modified 2005-08-04.
Object id is 7282, canonical name is SimpleTensor.
Accessed 7121 times total.
Classification:
| AMS MSC: | 15A69 (Linear and multilinear algebra; matrix theory :: Multilinear algebra, tensor products) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|