Tensor product

From testwiki
Jump to navigation Jump to search

Template:Short description Template:For

In mathematics, the tensor product V⊗W of two vector spaces V and W (over the same field) is a vector space to which is associated a bilinear map V×W→V⊗W that maps a pair (v,w), where v∈V,w∈W, to an element of V⊗W denoted Template:Tmath.[1]

An element of the form v⊗w is called the tensor product of v and w. An element of V⊗W is a tensor, and the tensor product of two vectors is sometimes called an elementary tensor or a decomposable tensor. The elementary tensors span V⊗W in the sense that every element of V⊗W is a sum of elementary tensors. If bases are given for V and W, a basis of V⊗W is formed by all tensor products of a basis element of V and a basis element of W.

The tensor product of two vector spaces captures the properties of all bilinear maps in the sense that a bilinear map from V×W into another vector space Z factors uniquely through a linear map V⊗W→Z (see Template:Slink), i.e. the bilinear map is associated to a unique linear map from the tensor product V⊗W to Z.

Tensor products are used in many application areas, including physics and engineering. For example, in general relativity, the gravitational field is described through the metric tensor, which is a tensor field with one tensor at each point of the space-time manifold, and each belonging to the tensor product of the cotangent space at the point with itself.

Definitions and constructions

The tensor product of two vector spaces is a vector space that is defined up to an isomorphism. There are several equivalent ways to define it. Most consist of defining explicitly a vector space that is called a tensor product, and, generally, the equivalence proof results almost immediately from the basic properties of the vector spaces that are so defined.

The tensor product can also be defined through a universal property; see Template:Slink, below. As for every universal property, all objects that satisfy the property are isomorphic through a unique isomorphism that is compatible with the universal property. When this definition is used, the other definitions may be viewed as constructions of objects satisfying the universal property and as proofs that there are objects satisfying the universal property, that is that tensor products exist.

From bases

Let Template:Mvar and Template:Mvar be two vector spaces over a field Template:Mvar, with respective bases BV and Template:Tmath.

The tensor product V⊗W of Template:Mvar and Template:Mvar is a vector space that has as a basis the set of all v⊗w with v∈BV and Template:Tmath, regarded purely as symbols with no further meaning. This definition can be formalized in the following way (this formalization is rarely used in practice, as the preceding informal definition is generally sufficient): V⊗W is the set of functions from the Cartesian product BV×BW to Template:Mvar that have a finite number of nonzero values. The pointwise operations make V⊗W a vector space. The function that maps (v,w) to Template:Math and the other elements of BV×BW to Template:Math is denoted Template:Tmath.

The set {v⊗w∣v∈BV,w∈BW}, called the tensor product of the bases BV and Template:Tmath, is straightforwardly a basis of Template:Tmath.

Equivalently, we can define V⊗W to be the set of bilinear forms on V×W that are nonzero at only a finite number of elements of Template:Tmath. To see this, given (x,y)∈V×W and a bilinear form Template:Tmath, we can decompose x and y in the bases BV and BW as: x=∑v∈BVxvvandy=∑w∈BWyww, where only a finite number of xv's and yw's are nonzero, and find by the bilinearity of B that: B(x,y)=∑v∈BV∑w∈BWxvywB(v,w)

Hence, we see that the value of B for any (x,y)∈V×W is uniquely and totally determined by the values that it takes on Template:Tmath. This lets us extend the maps v⊗w defined on BV×BW as before into bilinear maps v⊗w:V×W→F , by letting: (v⊗w)(x,y):=∑v′∈BV∑w′∈BWxv′yw′(v⊗w)(v′,w′)=xvyw.

Then we can express any bilinear form B as a (potentially infinite) formal linear combination of the v⊗w maps according to: B=∑v∈BV∑w∈BWB(v,w)(v⊗w) making these maps similar to a Schauder basis for the vector space Hom(V,W;F) of all bilinear forms on Template:Tmath. To instead have it be a proper Hamel basis, it only remains to add the requirement that B is nonzero at an only a finite number of elements of Template:Tmath, and consider the subspace of such maps instead.

In either construction, the tensor product of two vectors is defined from their decomposition on the bases. More precisely, taking the basis decompositions of x∈V and y∈W as before: x⊗y=(∑v∈BVxvv)⊗(∑w∈BWyww)=∑v∈BV∑w∈BWxvywv⊗w.

This definition is quite clearly derived from the coefficients of B(v,w) in the expansion by bilinearity of B(x,y) using the bases BV and Template:Tmath, as done above. It is then straightforward to verify that with this definition, the map ⊗:(x,y)↦x⊗y is a bilinear map from V×W to V⊗W satisfying the universal property that any construction of the tensor product satisfies (see below).

If arranged into a rectangular array, the coordinate vector of x⊗y is the outer product of the coordinate vectors of x and Template:Tmath. Therefore, the tensor product is a generalization of the outer product, that is, an abstraction of it beyond coordinate vectors.

A limitation of this definition of the tensor product is that, if one changes bases, a different tensor product is defined. However, the decomposition on one basis of the elements of the other basis defines a canonical isomorphism between the two tensor products of vector spaces, which allows identifying them. Also, contrarily to the two following alternative definitions, this definition cannot be extended into a definition of the tensor product of modules over a ring.

As a quotient space

A construction of the tensor product that is basis independent can be obtained in the following way.

Let Template:Mvar and Template:Mvar be two vector spaces over a [[field (mathematics)|field Template:Mvar]].

One considers first a vector space Template:Mvar that has the Cartesian product V×W as a basis. That is, the basis elements of Template:Mvar are the pairs (v,w) with v∈V and Template:Tmath. To get such a vector space, one can define it as the vector space of the functions V×W→F that have a finite number of nonzero values and identifying (v,w) with the function that takes the value Template:Math on (v,w) and Template:Math otherwise.

Let Template:Mvar be the linear subspace of Template:Mvar that is spanned by the relations that the tensor product must satisfy. More precisely, Template:Mvar is spanned by the elements of one of the forms:

(v1+v2,w)−(v1,w)−(v2,w),(v,w1+w2)−(v,w1)−(v,w2),(sv,w)−s(v,w),(v,sw)−s(v,w),

where Template:Tmath, w,w1,w2∈W and Template:Tmath.

Then, the tensor product is defined as the quotient space:

V⊗W=L/R,

and the image of (v,w) in this quotient is denoted Template:Tmath.

It is straightforward to prove that the result of this construction satisfies the universal property considered below. (A very similar construction can be used to define the tensor product of modules.)

Universal property

Universal property of tensor product: if Template:Math is bilinear, there is a unique linear map Template:Math that makes the diagram commutative (that is, Template:Math).

In this section, the universal property satisfied by the tensor product is described. As for every universal property, two objects that satisfy the property are related by a unique isomorphism. It follows that this is a (non-constructive) way to define the tensor product of two vector spaces. In this context, the preceding constructions of tensor products may be viewed as proofs of existence of the tensor product so defined.

A consequence of this approach is that every property of the tensor product can be deduced from the universal property, and that, in practice, one may forget the method that has been used to prove its existence.

The "universal-property definition" of the tensor product of two vector spaces is the following (recall that a bilinear map is a function that is separately linear in each of its arguments):

The tensor product of two vector spaces Template:Mvar and Template:Mvar is a vector space denoted as Template:Tmath, together with a bilinear map φ:(v,w)↦v⊗w from V×W to Template:Tmath, such that, for every bilinear map Template:Tmath, there is a unique linear map Template:Tmath, such that h=h~∘φ (that is, h(v,w)=h~(v⊗w) for every v∈V and Template:Tmath).

Linearly disjoint

Like the universal property above, the following characterization may also be used to determine whether or not a given vector space and given bilinear map form a tensor product.Template:Sfn

Template:Math theorem

For example, it follows immediately that if Template:Tmath and Template:Tmath, where m and n are positive integers, then one may set Z=ℂmn and define the bilinear map as T:ℂm×ℂn→ℂmn(x,y)=((x1,…,xm),(y1,…,yn))↦(xiyj)j=1,…,ni=1,…,m to form the tensor product of X and Template:Tmath.Template:Sfn Often, this map T is denoted by ⊗ so that x⊗y=T(x,y).

As another example, suppose that ℂS is the vector space of all complex-valued functions on a set S with addition and scalar multiplication defined pointwise (meaning that f+g is the map s↦f(s)+g(s) and cf is the map Template:Tmath). Let S and T be any sets and for any f∈ℂS and Template:Tmath, let f⊗g∈ℂS×T denote the function defined by Template:Tmath. If X⊆ℂS and Y⊆ℂT are vector subspaces then the vector subspace Z:=span⁡{f⊗g:f∈X,g∈Y} of ℂS×T together with the bilinear map: X×Y→Z(f,g)↦f⊗g form a tensor product of X and Template:Tmath.Template:Sfn

Properties

Dimension

If Template:Math and Template:Math are vector spaces of finite dimension, then V⊗W is finite-dimensional, and its dimension is the product of the dimensions of Template:Math and Template:Math.

This results from the fact that a basis of V⊗W is formed by taking all tensor products of a basis element of Template:Math and a basis element of Template:Math.

Associativity

The tensor product is associative in the sense that, given three vector spaces Template:Tmath, there is a canonical isomorphism:

(U⊗V)⊗W≅U⊗(V⊗W),

that maps (u⊗v)⊗w to Template:Tmath.

This allows omitting parentheses in the tensor product of more than two vector spaces or vectors.

Commutativity as vector space operation

The tensor product of two vector spaces V and W is commutative in the sense that there is a canonical isomorphism:

V⊗W≅W⊗V,

that maps v⊗w to Template:Tmath.

On the other hand, even when Template:Tmath, the tensor product of vectors is not commutative; that is Template:Tmath, in general.

Template:Anchor The map x⊗y↦y⊗x from V⊗V to itself induces a linear automorphism that is called a Template:Vanchor. More generally and as usual (see tensor algebra), let V⊗n denote the tensor product of Template:Mvar copies of the vector space Template:Mvar. For every permutation Template:Mvar of the first Template:Mvar positive integers, the map:

x1⊗⋯⊗xn↦xs(1)⊗⋯⊗xs(n)

induces a linear automorphism of Template:Tmath, which is called a braiding map. This determines a right action of the symmetric group Sn on V⊗n.

Tensor product of linear maps

Template:Redirect Given a linear map Template:Tmath, and a vector space Template:Mvar, the tensor product:

f⊗W:U⊗W→V⊗W

is the unique linear map such that:

(f⊗W)(u⊗w)=f(u)⊗w.

The tensor product W⊗f is defined similarly.

Given two linear maps f:U→V and Template:Tmath, their tensor product:

f⊗g:U⊗W→V⊗Z

is the unique linear map that satisfies:

(f⊗g)(u⊗w)=f(u)⊗g(w).

One has:

f⊗g=(f⊗Z)∘(U⊗g)=(V⊗g)∘(f⊗W).

In terms of category theory, this means that the tensor product is a bifunctor from the category of vector spaces to itself.[2]

If Template:Mvar and Template:Mvar are both injective or surjective, then the same is true for all above defined linear maps. In particular, the tensor product with a vector space is an exact functor; this means that every exact sequence is mapped to an exact sequence (tensor products of modules do not transform injections into injections, but they are right exact functors).

By choosing bases of all vector spaces involved, the linear maps Template:Math and Template:Math can be represented by matrices. Then, depending on how the tensor v⊗w is vectorized, the matrix describing the tensor product f⊗g is the Kronecker product of the two matrices. For example, if Template:Math, and Template:Math above are all two-dimensional and bases have been fixed for all of them, and Template:Math and Template:Math are given by the matrices: A=[a1,1a1,2a2,1a2,2],B=[b1,1b1,2b2,1b2,2], respectively, then the tensor product of these two matrices is: [a1,1a1,2a2,1a2,2]⊗[b1,1b1,2b2,1b2,2]=[a1,1[b1,1b1,2b2,1b2,2]a1,2[b1,1b1,2b2,1b2,2]a2,1[b1,1b1,2b2,1b2,2]a2,2[b1,1b1,2b2,1b2,2]]=[a1,1b1,1a1,1b1,2a1,2b1,1a1,2b1,2a1,1b2,1a1,1b2,2a1,2b2,1a1,2b2,2a2,1b1,1a2,1b1,2a2,2b1,1a2,2b1,2a2,1b2,1a2,1b2,2a2,2b2,1a2,2b2,2].

The resultant rank is at most 4, and thus the resultant dimension is 4. Template:Em here denotes the tensor rank i.e. the number of requisite indices (while the matrix rank counts the number of degrees of freedom in the resulting array).Template:Clarification needed Template:Tmath.

A dyadic product is the special case of the tensor product between two vectors of the same dimension.

General tensors

Template:See also For non-negative integers Template:Math and Template:Math a type (r,s) tensor on a vector space Template:Math is an element of: Tsr(V)=V⊗⋯⊗V⏟r⊗V∗⊗⋯⊗V∗⏟s=V⊗r⊗(V∗)⊗s. Here V∗ is the dual vector space (which consists of all linear maps Template:Math from Template:Math to the ground field Template:Math).

There is a product map, called the Template:Em:Template:Refn Tsr(V)⊗KTs′r′(V)→Ts+s′r+r′(V).

It is defined by grouping all occurring "factors" Template:Math together: writing vi for an element of Template:Math and fi for an element of the dual space: (v1⊗f1)⊗(v'1)=v1⊗v'1⊗f1.

If Template:Math is finite dimensional, then picking a basis of Template:Math and the corresponding dual basis of V∗ naturally induces a basis of Tsr(V) (this basis is described in the article on Kronecker products). In terms of these bases, the components of a (tensor) product of two (or more) tensors can be computed. For example, if Template:Math and Template:Math are two covariant tensors of orders Template:Math and Template:Math respectively (i.e. F∈Tm0 and Template:Tmath), then the components of their tensor product are given by:[3] (F⊗G)i1i2⋯im+n=Fi1i2⋯imGim+1im+2im+3⋯im+n.

Thus, the components of the tensor product of two tensors are the ordinary product of the components of each tensor. Another example: let Template:Math be a tensor of type Template:Math with components Template:Tmath, and let Template:Math be a tensor of type (1,0) with components Template:Tmath. Then: (U⊗V)αβγ=UαβVγ and: (V⊗U)μνσ=VμUνσ.

Tensors equipped with their product operation form an algebra, called the tensor algebra, which is graded by the order of a tensor.

Evaluation map and tensor contraction

For tensors of type Template:Math there is a canonical evaluation map: V⊗V∗→K defined by its action on pure tensors: v⊗f↦f(v).

More generally, for tensors of type Template:Tmath, with Template:Math, there is a map, called tensor contraction: Tsr(V)→Ts−1r−1(V). (The copies of V and V∗ on which this map is to be applied must be specified.)

On the other hand, if V is Template:Em, there is a canonical map in the other direction (called the coevaluation map): {K→V⊗V∗λ↦∑iλvi⊗vi∗ where v1,…,vn is any basis of Template:Tmath, and vi∗ is its dual basis. This map does not depend on the choice of basis.[4]

The interplay of evaluation and coevaluation can be used to characterize finite-dimensional vector spaces without referring to bases.[5]

Adjoint representation

The tensor product Tsr(V) may be naturally viewed as a module for the Lie algebra End(V) by means of the diagonal action: for simplicity let us assume Template:Tmath, then, for each Template:Tmath, u(a⊗b)=u(a)⊗b−a⊗u∗(b), where u∗∈End(V∗) is the transpose of Template:Math, that is, in terms of the obvious pairing on Template:Tmath, ⟨u(a),b⟩=⟨a,u∗(b)⟩.

There is a canonical isomorphism T11(V)→End(V) given by: (a⊗b)(x)=⟨x,b⟩a.

Under this isomorphism, every Template:Math in End(V) may be first viewed as an endomorphism of T11(V) and then viewed as an endomorphism of Template:Tmath. In fact it is the adjoint representation Template:Math of Template:Tmath.

Linear maps as tensors

Given two finite dimensional vector spaces Template:Math, Template:Math over the same field Template:Math, denote the dual space of Template:Math as Template:Math, and the Template:Math-vector space of all linear maps from Template:Math to Template:Math as Template:Math. There is an isomorphism: U∗⊗V≅Hom(U,V), defined by an action of the pure tensor f⊗v∈U∗⊗V on an element of Template:Tmath, (f⊗v)(u)=f(u)v.

Its "inverse" can be defined using a basis {ui} and its dual basis {ui∗} as in the section "Evaluation map and tensor contraction" above: {Hom(U,V)→U∗⊗VF↦∑iui∗⊗F(ui).

This result implies: dim⁡(U⊗V)=dim⁡(U)dim⁡(V), which automatically gives the important fact that {ui⊗vj} forms a basis of U⊗V where {ui},{vj} are bases of Template:Math and Template:Math.

Furthermore, given three vector spaces Template:Math, Template:Math, Template:Math the tensor product is linked to the vector space of all linear maps, as follows: Hom(U⊗V,W)≅Hom(U,Hom(V,W)). This is an example of adjoint functors: the tensor product is "left adjoint" to Hom.

Tensor products of modules over a ring

Template:Main The tensor product of two modules Template:Math and Template:Math over a commutative ring Template:Math is defined in exactly the same way as the tensor product of vector spaces over a field: A⊗RB:=F(A×B)/G, where now F(A×B) is the [[Free module|free Template:Math-module]] generated by the cartesian product and Template:Math is the Template:Math-module generated by these relations.

More generally, the tensor product can be defined even if the ring is non-commutative. In this case Template:Math has to be a right-Template:Math-module and Template:Math is a left-Template:Math-module, and instead of the last two relations above, the relation: (ar,b)∼(a,rb) is imposed. If Template:Math is non-commutative, this is no longer an Template:Math-module, but just an abelian group.

The universal property also carries over, slightly modified: the map φ:A×B→A⊗RB defined by (a,b)↦a⊗b is a middle linear map (referred to as "the canonical middle linear map"[6]); that is, it satisfies:[7] φ(a+a′,b)=φ(a,b)+φ(a′,b)φ(a,b+b′)=φ(a,b)+φ(a,b′)φ(ar,b)=φ(a,rb)

The first two properties make Template:Math a bilinear map of the abelian group Template:Tmath. For any middle linear map ψ of Template:Tmath, a unique group homomorphism Template:Math of A⊗RB satisfies Template:Tmath, and this property determines φ within group isomorphism. See the main article for details.

Tensor product of modules over a non-commutative ring

Let A be a right R-module and B be a left R-module. Then the tensor product of A and B is an abelian group defined by: A⊗RB:=F(A×B)/G where F(A×B) is a free abelian group over A×B and G is the subgroup of F(A×B) generated by relations: ∀a,a1,a2∈A,∀b,b1,b2∈B, for all r∈R:(a1,b)+(a2,b)−(a1+a2,b),(a,b1)+(a,b2)−(a,b1+b2),(ar,b)−(a,rb).

The universal property can be stated as follows. Let G be an abelian group with a map q:A×B→G that is bilinear, in the sense that: q(a1+a2,b)=q(a1,b)+q(a2,b),q(a,b1+b2)=q(a,b1)+q(a,b2),q(ar,b)=q(a,rb).

Then there is a unique map q‾:A⊗B→G such that q‾(a⊗b)=q(a,b) for all a∈A and Template:Tmath.

Furthermore, we can give A⊗RB a module structure under some extra conditions:

  1. If A is a (S,R)-bimodule, then A⊗RB is a left S-module, where Template:Tmath.
  2. If B is a (R,S)-bimodule, then A⊗RB is a right S-module, where Template:Tmath.
  3. If A is a (S,R)-bimodule and B is a (R,T)-bimodule, then A⊗RB is a (S,T)-bimodule, where the left and right actions are defined in the same way as the previous two examples.
  4. If R is a commutative ring, then A and B are (R,R)-bimodules where ra:=ar and Template:Tmath. By 3), we can conclude A⊗RB is a (R,R)-bimodule.

Computing the tensor product

For vector spaces, the tensor product V⊗W is quickly computed since bases of Template:Math of Template:Math immediately determine a basis of Template:Tmath, as was mentioned above. For modules over a general (commutative) ring, not every module is free. For example, Template:Math is not a free abelian group (Template:Math-module). The tensor product with Template:Math is given by: M⊗𝐙𝐙/n𝐙=M/nM.

More generally, given a presentation of some Template:Math-module Template:Math, that is, a number of generators mi∈M,i∈I together with relations: ∑j∈Jajimi=0,aij∈R, the tensor product can be computed as the following cokernel: M⊗RN=coker⁡(NJ→NI)

Here Template:Tmath, and the map NJ→NI is determined by sending some n∈N in the Template:Mathth copy of NJ to aijn (in Template:Tmath). Colloquially, this may be rephrased by saying that a presentation of Template:Math gives rise to a presentation of Template:Tmath. This is referred to by saying that the tensor product is a right exact functor. It is not in general left exact, that is, given an injective map of Template:Math-modules Template:Tmath, the tensor product: M1⊗RN→M2⊗RN is not usually injective. For example, tensoring the (injective) map given by multiplication with Template:Math, Template:Math with Template:Math yields the zero map Template:Math, which is not injective. Higher Tor functors measure the defect of the tensor product being not left exact. All higher Tor functors are assembled in the derived tensor product.

Tensor product of algebras

Template:Main Let Template:Math be a commutative ring. The tensor product of Template:Math-modules applies, in particular, if Template:Math and Template:Math are [[Algebra (ring theory)|Template:Math-algebras]]. In this case, the tensor product A⊗RB is an Template:Math-algebra itself by putting: (a1⊗b1)⋅(a2⊗b2)=(a1⋅a2)⊗(b1⋅b2). For example: R[x]⊗RR[y]≅R[x,y].

A particular example is when Template:Math and Template:Math are fields containing a common subfield Template:Math. The tensor product of fields is closely related to Galois theory: if, say, Template:Math, where Template:Math is some irreducible polynomial with coefficients in Template:Math, the tensor product can be calculated as: A⊗RB≅B[x]/f(x) where now Template:Math is interpreted as the same polynomial, but with its coefficients regarded as elements of Template:Math. In the larger field Template:Math, the polynomial may become reducible, which brings in Galois theory. For example, if Template:Math is a Galois extension of Template:Math, then: A⊗RA≅A[x]/f(x) is isomorphic (as an Template:Math-algebra) to Template:Tmath.

Eigenconfigurations of tensors

Square matrices A with entries in a field K represent linear maps of vector spaces, say Template:Tmath, and thus linear maps ψ:ℙn−1→ℙn−1 of projective spaces over Template:Tmath. If A is nonsingular then ψ is well-defined everywhere, and the eigenvectors of A correspond to the fixed points of Template:Tmath. The eigenconfiguration of A consists of n points in Template:Tmath, provided A is generic and K is algebraically closed. The fixed points of nonlinear maps are the eigenvectors of tensors. Let A=(ai1i2⋯id) be a d-dimensional tensor of format n×n×⋯×n with entries (ai1i2⋯id) lying in an algebraically closed field K of characteristic zero. Such a tensor A∈(Kn)⊗d defines polynomial maps Kn→Kn and ℙn−1→ℙn−1 with coordinates: ψi(x1,…,xn)=∑j2=1n∑j3=1n⋯∑jd=1naij2j3⋯jdxj2xj3⋯xjdfor i=1,…,n

Thus each of the n coordinates of ψ is a homogeneous polynomial ψi of degree d−1 in Template:Tmath. The eigenvectors of A are the solutions of the constraint: rank(x1x2⋯xnψ1(𝐱)ψ2(𝐱)⋯ψn(𝐱))≤1 and the eigenconfiguration is given by the variety of the 2×2 minors of this matrix.[8]

Other examples of tensor products

Topological tensor products

Template:Main

Hilbert spaces generalize finite-dimensional vector spaces to arbitrary dimensions. There is an analogous operation, also called the "tensor product," that makes Hilbert spaces a symmetric monoidal category. It is essentially constructed as the metric space completion of the algebraic tensor product discussed above. However, it does not satisfy the obvious analogue of the universal property defining tensor products;[9] the morphisms for that property must be restricted to Hilbert–Schmidt operators.[10]

In situations where the imposition of an inner product is inappropriate, one can still attempt to complete the algebraic tensor product, as a topological tensor product. However, such a construction is no longer uniquely specified: in many cases, there are multiple natural topologies on the algebraic tensor product.

Tensor product of graded vector spaces

Template:Main

Some vector spaces can be decomposed into direct sums of subspaces. In such cases, the tensor product of two spaces can be decomposed into sums of products of the subspaces (in analogy to the way that multiplication distributes over addition).

Tensor product of representations

Template:Main

Vector spaces endowed with an additional multiplicative structure are called algebras. The tensor product of such algebras is described by the Littlewood–Richardson rule.

Tensor product of algebraic fields

Given two fields that are algebraic extensions of a common base field, their tensor product over the base field is again algebraic over the base field. Specifically, it is the algebraic extension generated by the products of the generators of the original two fields.Template:Cn For example, the tensor product over the rational numbers of ℚ[2] and ℚ[3] is generated by 1⋅1=1, 1⋅2=2, 1⋅3=3, and 2⋅3=6, and can be denoted ℚ[2,3].

Tensor product of quadratic forms

Template:Main

Tensor product of multilinear forms

Given two multilinear forms f(x1,…,xk) and g(x1,…,xm) on a vector space V over the field K their tensor product is the multilinear form:[11] (f⊗g)(x1,…,xk+m)=f(x1,…,xk)g(xk+1,…,xk+m).

This is a special case of the product of tensors if they are seen as multilinear maps (see also tensors as multilinear maps). Thus the components of the tensor product of multilinear forms can be computed by the Kronecker product.

Tensor product of sheaves of modules

Template:Main

Tensor product of line bundles

Template:Main

Template:See also

Tensor product of fields

Template:Main

Tensor product of graphs

Template:Main It should be mentioned that, though called "tensor product", this is not a tensor product of graphs in the above sense; actually it is the category-theoretic product in the category of graphs and graph homomorphisms. However it is actually the Kronecker tensor product of the adjacency matrices of the graphs. Compare also the section Tensor product of linear maps above.

Monoidal categories

The most general setting for the tensor product is the monoidal category. It captures the algebraic essence of tensoring, without making any specific reference to what is being tensored. Thus, all tensor products can be expressed as an application of the monoidal category to some particular setting, acting on some particular objects.

Quotient algebras

A number of important subspaces of the tensor algebra can be constructed as quotients: these include the exterior algebra, the symmetric algebra, the Clifford algebra, the Weyl algebra, and the universal enveloping algebra in general.

The exterior algebra is constructed from the exterior product. Given a vector space Template:Math, the exterior product V∧V is defined as: V∧V:=V⊗V/{v⊗v∣v∈V}.

When the underlying field of Template:Math does not have characteristic 2, then this definition is equivalent to: V∧V:=V⊗V/{v1⊗v2+v2⊗v1∣(v1,v2)∈V2}.

The image of v1⊗v2 in the exterior product is usually denoted v1∧v2 and satisfies, by construction, Template:Tmath. Similar constructions are possible for V⊗…⊗V (Template:Math factors), giving rise to Template:Tmath, the Template:Mathth exterior power of Template:Math. The latter notion is the basis of [[differential form|differential Template:Math-forms]].

The symmetric algebra is constructed in a similar manner, from the symmetric product: V⊙V:=V⊗V/{v1⊗v2−v2⊗v1∣(v1,v2)∈V2}.

More generally: SymnV:=V⊗…⊗V⏟n/(…⊗vi⊗vi+1⊗…−…⊗vi+1⊗vi⊗…)

That is, in the symmetric algebra two adjacent vectors (and therefore all of them) can be interchanged. The resulting objects are called symmetric tensors.

Tensor product in programming

Array programming languages

Array programming languages may have this pattern built in. For example, in APL the tensor product is expressed as ○.× (for example A ○.× B or A ○.× B ○.× C). In J the tensor product is the dyadic form of */ (for example a */ b or a */ b */ c).

J's treatment also allows the representation of some tensor fields, as a and b may be functions instead of constants. This product of two functions is a derived function, and if a and b are differentiable, then a */ b is differentiable.

However, these kinds of notation are not universally present in array languages. Other array languages may require explicit treatment of indices (for example, MATLAB), and/or may not support higher-order functions such as the Jacobian derivative (for example, Fortran/APL).

See also

Template:Wiktionary

Notes

Template:Reflist

References

Template:Tensors

  1. ↑ Introduction to the Tensor Product
  2. ↑ Template:Cite book
  3. ↑ Analogous formulas also hold for contravariant tensors, as well as tensors of mixed variance. Although in many cases such as when there is an inner product defined, the distinction is irrelevant.
  4. ↑ Template:Cite web
  5. ↑ See Dualizable object.
  6. ↑ Template:Cite book
  7. ↑ Template:Citation
  8. ↑ Template:Cite arXiv
  9. ↑ Template:Cite web
  10. ↑ Template:Cite book
  11. ↑ Template:Cite book