Tensor product
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
This article is actively undergoing a major edit for a little while. To help avoid edit conflicts, please do not edit this page while this message is displayed. This page was last edited at 00:35, 4 May 2021 (UTC) (3 years ago) – this estimate is cached, . Please remove this template if this page hasn't been edited for a significant time. If you are the editor who added this template, please be sure to remove it or replace it with {{Under construction}} between editing sessions. |
In mathematics, the tensor product V ⊗ W of two vector spaces V and W (over the same field) is a vector space wich can be thought of as the space of all tensors that can be built from vectors from its constituent spaces using an additional operation which can be considered as a generalization and abstraction of the outer product. Because of the connection with tensors, which are the elements of a tensor product, tensor products find uses in many areas of application including in physics and engineering, though the full theoretical mechanics of them described below may not be commonly cited there. For example, in general relativity, the gravitational field is described through the metric tensor, which is a field (in the sense of physics) of tensors, one at each point in the space-time manifold, and each of which lives in the tensor self-product of tangent spaces TxM at its point of residence on the manifold (such a collection of tensor products attached to another space is called a tensor bundle).
Tensors in finite dimensions, and the outer product
The concept of tensor product generalizes the idea of forming tensors from vectors using the outer product, which is an operation that can be defined in finite-dimensional vector spaces using matrices: given two vectors v and w written in terms of components, i.e.
and
their outer or Kronecker product is given by
or, in terms of elements, the i'j-th component is
. The matrix formed this way corresponds naturally to a tensor, where such is understood as a multilinear functional, by sandwiching it with matrix multiplication between a vector and its dual, or transpose:
It is important to note that the tensor, as written, takes two dual vectors - this is an important point that will be dealt with later. In the case of finite dimensions, there is not a strong distinction between a space and its dual, however, it does matter in infinite dimensions and, moreover, getting the regular-vs-dual part right is essential to ensuring that the idea of tensors being developed here corresponds correctly to other senses in which they are viewed, such as in terms of transformations, which is common in physics.
The tensors constructed this way generate a vector space themselves when we add and scale them in the natural componentwise fashion and, in fact, all multilinear functionals of the type given can be written as some sum of outer products, which we may call pure tensors or simple tensors. This is sufficient to define the tensor product when we can write vectors and transformations in terms of matrices, however, to get a fully general operation, a more abstract approach will be required. Especially, we would like to isolate the "essential features" of the tensor product without having to specify a particular basis for its construction, and that is what we will do in the following sections.
Baby step towards the abstract tensor product: the free vector space
The first step we will consider involves introducing something called a "free vector space" over a given set. The thrust behind this idea basically consists of what we said in the last point: since a tensor can be written by the double sum
the most natural way to approach this problem is somehow to figure out how we can "forget" about the specific choice of bases and that are used here. In mathematics, the way we "forget" about representational details of something is to establish an identification that tells us that two different things that are to be considered representations of the same thing are in fact such, i.e. which, given those says either "yes, they are" or "no, they aren't", and then "lump together" all representations as constituting the "thing represented" without reference to any one in particular by packaging them all together into a single set. In formal terms, we first build an equivalence relation, and then take the quotient set by that relation.
But before we can do that, we first need to develop what we are going to take the equivalence relation over. The way we do that is to approach this the other way around, from the "bottom up": since we are not guaranteed a, at least constructible, basis when starting from arbitrary vector spaces, we might instead try to start by guaranteeing we have one—that is, we will start first by considering a "basis", on its own, as given, and then building the vector space on top. To that end, we accomplish the following: suppose that is some set, which we could call an abstract basis set. Now consider all formal expressions of the form
of arbitrary, but finite, length and for which are scalars and are members of . Intuitively, this is a linear combination of the basis vectors in the usual sense of expanding an element of a vector space. We call this a "formal expression" because technically it is illegal to multiply since there is no defined multiplication operation by default on an arbitrary set and arbitrary field of scalars. Instead, we will "pretend" (similar to defining the imaginary numbers) that this refers to something, and then will go about manipulating it according to the rules we expect for a vector space, e.g. the sum of two such strings using the same sequence of members of is
where we have used the associative, commutative, and distributive laws to rearrange the first sum into the second. Continuing this way for scalar multiples and all different-length combinations of vectors allows us to build up a vector addition and scalar multiplication on this set of formal expressions, and we call it the free vector space over , writing . Note that the elements of , considered as length-one formal expressions with coefficient 1 out front, form a Hamel basis for this space.
The tensor product expression is then abstracted by considering that if and represent "abstract basis vectors" from two sets and , i.e. that "" and "", then pairs of these in the Cartesian product , i.e. are taken as standing for the tensor products . (Note that the tensor products in the expression are in some sense "atomic", i.e. additions and scalar multiplications do not split them up into anything else, so we can replace them with something different without altering the mathematical structure.) With such an identification, we can thus define the tensor product of two free vector spaces and as being something (yet to be decided) that is isomorphic to .
Using the free vector space to "forget" about the basis
The above definition will work for any vector space in which we can specify a basis, since we can just rebuild it as the free vector space over that basis: the above construction exactly mirrors how you represent vectors via the Hamel basis construction by design. In effect, we haven't gained anything ... until we do this.
Now, we are not assuming access to bases for vector spaces and that we want to form the tensor product of. Instead, we will take all of and as "basis" to build up the tensors. This is the next best thing and the one thing we are guaranteed to be able to do, regardless of any concerns in finding a specific basis; this corresponds to adding together arbitrary outer products of arbitrary vectors in the last part of the "Intuitive motivation" section. The only difference here is that if we use the free vector space construction and form the obvious , it will have many redundant versions of what should be the same tensor; going back to our basisful case if we consider the example where in the standard basis, we may consider that the tensor formed by the vectors and , i.e.
could also be represented by other sums, such as the sum using individual basic tensors , e.g.
These, while equal expressions in the concrete case, would correspond to distinct elements of the free vector space , namely
in the first case and
in the second case. Thus we must condense them—this is where the equivalence relation comes into play. The trick to building it is to note that given any vector in a vector space, it is always possible to represent it as the sum of two other vectors and not equal to the original. If nothing else, let be any vector and then take —which also shows that if we are given one vector and then a second vector, we can write the first vector in terms of the second together with a suitable third vector (indeed in many ways—just consider scalar multiples of the second vector in the same subtraction.).
This is useful to us because the outer product satisfies the following linearity properties, which can be proven by simple algebra on the corresponding matrix expressions:
If we want to relate the outer product to, say, , we can use the first relation above together with a suitable expression of as a sum of some vector and some scalar multiple of .
Equality between two concrete tensors is then obtained if using the above rules will permit us to rearrange one sum of outer products into the other by suitably decomposing vectors—regardless of if we have a set of actual basis vectors. Applying that to our example above, we see that of course we have
for which substitution in
gives us
and judicious use of the distributivity properties lets us rearrange to the desired form. Likewise, there is a corresponding "mirror" manipulation in terms of the free vector space elements and , , etc., and this finally leads us to the formal definition of the tensor product.
The definition of the abstract tensor product
The abstract tensor product of two vector spaces and over a common base field is the quotient vector space
where is the equivalence relation of formal equality generated by assuming that, for each and taken as formal expressions in the free vector space , the following hold:
- Identity.
- Symmetry. implies
- Transitivity. and implies
- Distributivity. and
- Scalar multiples. and
and then testing equivalence of generic formal expressions through suitable manipulations based thereupon.[citation needed] Arithmetic is defined on the tensor product by choosing representative elements, applying the arithmetical rules, and finally taking the equivalence class. Moreover, given any two vectors and , the equivalence class is denoted .
Properties
Notation
Elements of V ⊗ W are often referred to as tensors, although this term refers to many other related concepts as well.[1] If v belongs to V and w belongs to W, then the equivalence class of (v, w) is denoted by v ⊗ w, which is called the tensor product of v with w. In physics and engineering, this use of the "⊗" symbol refers specifically to the outer product operation; the result of the outer product v ⊗ w is one of the standard ways of representing the equivalence class v ⊗ w.[2] An element of V ⊗ W that can be written in the form v ⊗ w is called a pure or simple tensor. In general, an element of the tensor product space is not a pure tensor, but rather a finite linear combination of pure tensors. For example, if v1 and v2 are linearly independent, and w1 and w2 are also linearly independent, then v1 ⊗ w1 + v2 ⊗ w2 cannot be written as a pure tensor. The number of simple tensors required to express an element of a tensor product is called the tensor rank (not to be confused with tensor order, which is the number of spaces one has taken the product of, in this case 2; in notation, the number of indices), and for linear operators or matrices, thought of as (1, 1) tensors (elements of the space V ⊗ V∗), it agrees with matrix rank.
Dimension
Given bases {vi} and {wj} for V and W respectively, the tensors {vi ⊗ wj} form a basis for V ⊗ W. Therefore, if V and W are finite-dimensional, the dimension of the tensor product is the product of dimensions of the original spaces; for instance Rm ⊗ Rn is isomorphic to Rmn.
Tensor product of linear maps
The tensor product also operates on linear maps between vector spaces. Specifically, given two linear maps S : V → X and T : W → Y between vector spaces, the tensor product of the two linear maps S and T is a linear map
defined by
In this way, the tensor product becomes a bifunctor from the category of vector spaces to itself, covariant in both arguments.[3]
If S and T are both injective, surjective or (in the case that V, X, W, and Y are normed vector spaces or topological vector spaces) continuous, then S ⊗ T is injective, surjective or continuous, respectively.
By choosing bases of all vector spaces involved, the linear maps S and T can be represented by matrices. Then, depending on how the tensor is vectorized, the matrix describing the tensor product S ⊗ T is the Kronecker product of the two matrices. For example, if V, X, W, and Y above are all two-dimensional and bases have been fixed for all of them, and S and T are given by the matrices
respectively, then the tensor product of these two matrices is
The resultant rank is at most 4, and thus the resultant dimension is 4. Note that rank 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). Note .
A dyadic product is the special case of the tensor product between two vectors of the same dimension.
Universal property
In the context of vector spaces, the tensor product and the associated bilinear map are characterized up to isomorphism by a universal property regarding bilinear maps. (Recall that a bilinear map is a function that is separately linear in each of its arguments.) Informally, is the most general bilinear map out of .
The vector space and the associated bilinear map have the property that any bilinear map from to any vector space factors through uniquely. By saying " factors through uniquely", we mean that there is a unique linear map such that .
This characterization can simplify proofs about the tensor product. For example, the tensor product is symmetric, meaning there is a canonical isomorphism:
To construct, say, a map from to , it suffices to give a bilinear map that maps to . Then the universal property of means factors into a map . A map in the opposite direction is similarly defined, and one checks that the two linear maps and are inverse to one another by again using their universal properties.
The universal property is extremely useful in showing that a map to a tensor product is injective. For example, suppose we want to show that is isomorphic to . Since all simple tensors are of the form , and hence all elements of the tensor product are of the form by additivity in the first coordinate, we have a natural candidate for an isomorphism given by mapping to , and this map is trivially surjective.
Showing injectivity directly would involve somehow showing that there are no non-trivial relationships between and for , which seems daunting. However, we know that there is a bilinear map given by multiplying the coordinates together, and the universal property of the tensor product then furnishes a map of vector spaces which maps to , and hence is an inverse of the previously constructed homomorphism, immediately implying the desired result. Note that, a priori, it is not even clear that this inverse map is well-defined, but the universal property and associated bilinear map together imply this is the case.
Similar reasoning can be used to show that the tensor product is associative, that is, there are natural isomorphisms
Therefore, it is customary to omit the parentheses and write .
The category of vector spaces with tensor product is an example of a symmetric monoidal category.
The universal-property definition of a tensor product is valid in more categories than just the category of vector spaces. Instead of using multilinear (bilinear) maps, the general tensor product definition uses multimorphisms.[4]
Tensor powers and braiding
Let n be a non-negative integer. The nth tensor power of the vector space V is the n-fold tensor product of V with itself. That is
A permutation σ of the set {1, 2, ..., n} determines a mapping of the nth Cartesian power of V as follows:
Let
be the natural multilinear embedding of the Cartesian power of V into the tensor power of V. Then, by the universal property, there is a unique isomorphism
such that
The isomorphism τσ is called the braiding map associated to the permutation σ.
Product of tensors
For non-negative integers r and s a type (r, s) tensor on a vector space V is an element of
Here V∗ is the dual vector space (which consists of all linear maps f from V to the ground field K).
There is a product map, called the (tensor) product of tensors[5]
It is defined by grouping all occurring "factors" V together: writing vi for an element of V and fi for an element of the dual space,
Picking a basis of V and the corresponding dual basis of V∗ naturally induces a basis for Tr
s(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 F and G are two covariant tensors of orders m and n respectively (i.e. F ∈ T 0
m, and G ∈ T 0
n), then the components of their tensor product are given by[6]
Thus, the components of the tensor product of two tensors are the ordinary product of the components of each tensor. Another example: let U be a tensor of type (1, 1) with components Uαβ, and let V be a tensor of type (1, 0) with components V γ. Then
and
Tensors equipped with their product operation form an algebra, called the tensor algebra.
Evaluation map and tensor contraction
For tensors of type (1, 1) there is a canonical evaluation map
defined by its action on pure tensors:
More generally, for tensors of type (r, s), with r, s > 0, there is a map, called tensor contraction,
(The copies of V and V* on which this map is to be applied must be specified.)
On the other hand, if V is finite-dimensional, there is a canonical map in the other direction (called the coevaluation map)
where v1, ..., vn is any basis of V, and vi∗ is its dual basis. This map does not depend on the choice of basis.[7]
The interplay of evaluation and coevaluation can be used to characterize finite-dimensional vector spaces without referring to bases.[8]
Adjoint representation
The tensor product may be naturally viewed as a module for the Lie algebra End(V) by means of the diagonal action: for simplicity let us assume r = s = 1, then, for each u ∈ End(V),
where u∗ in End(V∗) is the transpose of u, that is, in terms of the obvious pairing on V ⊗ V∗,
- .
There is a canonical isomorphism given by
Under this isomorphism, every u in End(V) may be first viewed as an endomorphism of and then viewed as an endomorphism of End(V). In fact it is the adjoint representation ad(u) of End(V).
Relation of tensor product to Hom
Given two finite dimensional vector spaces U, V over the same field K, denote the dual space of U as U*, and the K-vector space of all linear maps from U to V as Hom(U,V). There is an isomorphism,
defined by an action of the pure tensor on an element of ,
Its "inverse" can be defined using a basis and its dual basis as in the section "Evaluation map and tensor contraction" above:
This result implies
which automatically gives the important fact that forms a basis for where are bases of U and V.
Furthermore, given three vector spaces U, V, W the tensor product is linked to the vector space of all linear maps, as follows:
This is an example of adjoint functors: the tensor product is "left adjoint" to Hom.
Tensor products of modules over a ring
The tensor product of two modules A and B over a commutative ring R is defined in exactly the same way as the tensor product of vector spaces over a field:
where now F(A × B) is the free R-module generated by the cartesian product and G is the R-module generated by the same relations as above.
More generally, the tensor product can be defined even if the ring is non-commutative. In this case A has to be a right-R-module and B is a left-R-module, and instead of the last two relations above, the relation
is imposed. If R is non-commutative, this is no longer an R-module, but just an abelian group.
The universal property also carries over, slightly modified: the map φ : A × B → A ⊗R B defined by (a, b) ↦ a ⊗ b is a middle linear map (referred to as "the canonical middle linear map".[9]); that is, it satisfies:[10]
The first two properties make φ a bilinear map of the abelian group A × B. For any middle linear map ψ of A × B, a unique group homomorphism f of A ⊗R B satisfies ψ = f ∘ φ, 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
where is a free abelian group over and G is the subgroup of generated by relations
The universal property can be stated as follows. Let G be an abelian group with a map that is bilinear, in the sense that
Then there is a unique map such that for all and .
Furthermore, we can give a module structure under some extra conditions:
- If A is a (S,R)-bimodule, then is a left S-module where .
- If B is a (R,S)-bimodule, then is a right S-module where .
- If A is a (S,R)-bimodule and B is a (R,T)-bimodule, then is a (S,T)-bimodule, where the left and right actions are defined in the same way as the previous two examples.
- If R is a commutative ring, then A and B are (R,R)-bimodules where and . By 3), we can conclude is a (R,R)-bimodule.
Computing the tensor product
For vector spaces, the tensor product V ⊗ W is quickly computed since bases of V of W immediately determine a basis of V ⊗ W, as was mentioned above. For modules over a general (commutative) ring, not every module is free. For example, Z/nZ is not a free abelian group (Z-module). The tensor product with Z/nZ is given by
More generally, given a presentation of some R-module M, that is, a number of generators mi ∈ M, i ∈ I together with relations
the tensor product can be computed as the following cokernel:
Here NJ = ⨁j ∈ J N, and the map NJ → NI is determined by sending some n ∈ N in the jth copy of NJ to aji n (in NI). Colloquially, this may be rephrased by saying that a presentation of M gives rise to a presentation of M ⊗R N. 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 R-modules M1 → M2, the tensor product
is not usually injective. For example, tensoring the (injective) map given by multiplication with n, n : Z → Z with Z/nZ yields the zero map 0 : Z/nZ → Z/nZ, 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
Let R be a commutative ring. The tensor product of R-modules applies, in particular, if A and B are R-algebras. In this case, the tensor product A ⊗R B is an R-algebra itself by putting
For example,
A particular example is when A and B are fields containing a common subfield R. The tensor product of fields is closely related to Galois theory: if, say, A = R[x] / f(x), where f is some irreducible polynomial with coefficients in R, the tensor product can be calculated as
where now f is interpreted as the same polynomial, but with its coefficients regarded as elements of B. In the larger field B, the polynomial may become reducible, which brings in Galois theory. For example, if A = B is a Galois extension of R, then
is isomorphic (as an A-algebra) to the Adeg(f).
Eigenconfigurations of tensors
Square matrices with entries in a field represent linear maps of vector spaces, say , and thus linear maps of projective spaces over . If is nonsingular then is well-defined everywhere, and the eigenvectors of correspond to the fixed points of . The eigenconfiguration of consists of points in , provided is generic and is algebraically closed. The fixed points of nonlinear maps are the eigenvectors of tensors. Let be a -dimensional tensor of format with entries lying in an algebraically closed field of characteristic zero. Such a tensor defines polynomial maps and with coordinates
Thus each of the coordinates of is a homogeneous polynomial of degree in . The eigenvectors of are the solutions of the constraint
and the eigenconfiguration is given by the variety of the minors of this matrix.[11]
Other examples of tensor products
Tensor product of Hilbert spaces
Hilbert spaces generalize finite-dimensional vector spaces to countably-infinite dimensions. The tensor product is still defined; it is the tensor product of Hilbert spaces.
Topological tensor product
When the basis for a vector space is no longer countable, then the appropriate axiomatic formalization for the vector space is that of a topological vector space. The tensor product is still defined, it is the topological tensor product.
Tensor product of graded vector spaces
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
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 quadratic forms
Tensor product of multilinear forms
Given two multilinear forms and on a vector space over the field their tensor product is the multilinear form
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
Tensor product of line bundles
Tensor product of fields
Tensor product of graphs
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 V, the exterior product is defined as
Note that when the underlying field of V does not have characteristic 2, then this definition is equivalent to
The image of in the exterior product is usually denoted and satisfies, by construction, . Similar constructions are possible for (n factors), giving rise to , the nth exterior power of V. The latter notion is the basis of differential n-forms.
The symmetric algebra is constructed in a similar manner, from the symmetric product
More generally
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
).
Note that 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
- Dyadic product – Second order tensor in vector algebra
- Extension of scalars
- Monoidal category – Category admitting tensor products
- Tensor algebra – Universal construction in multilinear algebra
- Tensor contraction – Operation in mathematics and physics
- Topological tensor product – Tensor product constructions for topological vector spaces
Notes
- ^ See Tensor or Tensor (intrinsic definition).
- ^ This similar to how the engineering use of "" specifically returns the remainder, one of the many elements of the equivalence class.
- ^ Hazewinkel, Michiel; Gubareni, Nadezhda Mikhaĭlovna; Gubareni, Nadiya; Kirichenko, Vladimir V. (2004). Algebras, rings and modules. Springer. p. 100. ISBN 978-1-4020-2690-4.
- ^ "Archived copy". Archived from the original on 2017-09-02. Retrieved 2017-09-02.
{{cite web}}
: CS1 maint: archived copy as title (link)[user-generated source] - ^ Bourbaki (1989), p. 244 defines the usage "tensor product of x and y", elements of the respective modules.
- ^ 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.
- ^ "The Coevaluation on Vector Spaces". The Unapologetic Mathematician. 2008-11-13. Archived from the original on 2017-02-02. Retrieved 2017-01-26.
- ^ See Compact closed category.
- ^ Hungerford, Thomas W. (1974). Algebra. Springer. ISBN 0-387-90518-9.
- ^
Chen, Jungkai Alfred (Spring 2004), "Tensor product" (PDF), Advanced Algebra II (lecture notes), National Taiwan University, archived (PDF) from the original on 2016-03-04
{{citation}}
: CS1 maint: location missing publisher (link) - ^ Abo, H.; Seigal, A.; Sturmfels, B. (2015). "Eigenconfigurations of Tensors". arXiv:1505.05729.
- ^ Tu, L. W. (2010). An Introduction to Manifolds. Universitext. Springer. p. 25. ISBN 978-1-4419-7399-3.
References
- Bourbaki, Nicolas (1989). Elements of mathematics, Algebra I. Springer-Verlag. ISBN 3-540-64243-9.
- Gowers, Timothy. "How to lose your fear of tensor products".
- Grillet, Pierre A. (2007). Abstract Algebra. Springer Science+Business Media, LLC. ISBN 978-0387715674.
- Halmos, Paul (1974). Finite dimensional vector spaces. Springer. ISBN 0-387-90093-4.
- Hungerford, Thomas W. (2003). Algebra. Springer. ISBN 0387905189.
- Lang, Serge (2002), Algebra, Graduate Texts in Mathematics, vol. 211 (Revised third ed.), New York: Springer-Verlag, ISBN 978-0-387-95385-4, MR 1878556, Zbl 0984.00001
- Mac Lane, S.; Birkhoff, G. (1999). Algebra. AMS Chelsea. ISBN 0-8218-1646-2.
- Aguiar, M.; Mahajan, S. (2010). Monoidal functors, species and Hopf algebras. CRM Monograph Series Vol 29. ISBN 978-0-8218-4776-3.
- "Bibliography on the nonabelian tensor product of groups".