| Arithmetic operations | |||||||||||||||||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||||||||||||||||
Inmathematics, aproduct is the result ofmultiplication, or anexpression that identifiesobjects (numbers orvariables) to be multiplied, calledfactors. For example, 21 is the product of 3 and 7 (the result of multiplication), and is the product of and (indicating that the two factors should be multiplied together).When one factor is aninteger, the product is called amultiple.
The order in whichreal orcomplex numbers are multiplied has no bearing on the product; this is known as thecommutative law of multiplication. Whenmatrices or members of various otherassociative algebras are multiplied, the product usually depends on the order of the factors.Matrix multiplication, for example, is non-commutative, and so is multiplication in other algebras in general as well.
There are many different kinds of products in mathematics: besides being able to multiply just numbers, polynomials or matrices, one can also define products on many differentalgebraic structures.
Originally, a product was and is still the result of the multiplication of two or morenumbers. For example,15 is the product of3 and5. Thefundamental theorem of arithmetic states that everycomposite number is a product ofprime numbers, that is uniqueup to the order of the factors.
With the introduction ofmathematical notation andvariables at the end of the 15th century, it became common to consider the multiplication of numbers that are either unspecified (coefficients andparameters), or to be found (unknowns). These multiplications that cannot be effectively performed are calledproducts. For example, in thelinear equation the term denotes theproduct of the coefficient and the unknown
Later and essentially from the 19th century on, newbinary operations have been introduced, which do not involve numbers at all, and have been calledproducts; for example, thedot product. Most of this article is devoted to such non-numerical products.
The product operator for theproduct of a sequence is denoted by the capital Greek letterpiΠ (in analogy to the use of the capital SigmaΣ assummation symbol).[1] For example, the expression is another way of writing.[2]
The product of a sequence consisting of only one number is just that number itself; the product of no factors at all is known as theempty product, and is equal to 1.
Commutative rings have a product operation.
Residue classes in the rings can be added:
and multiplied:

Two functions from the reals to itself can be multiplied in another way, called theconvolution.
If
then the integral
is well defined and is called the convolution.
Under theFourier transform, convolution becomes point-wise function multiplication.
The product of two polynomials is given by the following:
with
There are many different kinds of products in linear algebra. Some of these have confusingly similar names (outer product,exterior product) with very different meanings, while others have very different names (outer product, tensor product, Kronecker product) and yet convey essentially the same idea. A brief overview of these is given in the following sections.
By the very definition of a vector space, one can form the product of any scalar with any vector, giving a map.
Ascalar product is a bi-linear map:
with the following conditions, that for all.
From the scalar product, one can define anorm by letting.
The scalar product also allows one to define an angle between two vectors:
In-dimensionalEuclidean space, the standard scalar product (called thedot product) is given by:
Thecross product of two vectors in 3-dimensions is a vector perpendicular to the two factors, with length equal to the area of theparallelogram spanned by the two factors.
The cross product can also be expressed as theformal[a]determinant:
A linear mapping can be defined as a functionf between two vector spacesV andW with underlying fieldF, satisfying[3]
If one only considers finite dimensional vector spaces, then
in whichbV andbW denote thebases ofV andW, andvi denotes thecomponent ofv onbVi, andEinstein summation convention is applied.
Now we consider the composition of two linear mappings between finite dimensional vector spaces. Let the linear mappingf mapV toW, and let the linear mappingg mapW toU. Then one can get
Or in matrix form:
in which thei-row,j-column element ofF, denoted byFij, isfji, andGij=gji.
The composition of more than two linear mappings can be similarly represented by a chain of matrix multiplication.
Given twomatrices with real-valued entries, in and in (the number of columns of must match the number of rows of), their product is a matrix in whose entries are given by a sum of pairwise products of the entries in the corresponding row of and column of:
There is a relationship between the composition of linear functions and the product of two matrices. To see this, let r = dim(U), s = dim(V) and t = dim(W) be the (finite)dimensions of vector spaces U, V and W. Let be abasis of U, be a basis of V and be a basis of W. In terms of this basis, letbe the matrix representing f : U → V and be the matrix representing g : V → W. Then
is the matrix representing.
In other words: the matrix product is the description in coordinates of the composition of linear functions.
Given two finite dimensional vector spacesV andW, the tensor product of them can be defined as a (2,0)-tensor satisfying:
whereV* andW* denote thedual spaces ofV andW.[4]
For infinite-dimensional vector spaces, one also has the:
The tensor product,outer product andKronecker product all convey the same general idea. The differences between these are that the Kronecker product is just a tensor product of matrices, with respect to a previously-fixed basis, whereas the tensor product is usually given in itsintrinsic definition. The outer product is simply the Kronecker product, limited to vectors (instead of matrices).
In general, whenever one has two mathematicalobjects that can be combined in a way that behaves like a linear algebra tensor product, then this can be most generally understood as theinternal product of amonoidal category. That is, the monoidal category captures precisely the meaning of a tensor product; it captures exactly the notion of why it is that tensor products behave the way they do. More precisely, a monoidal category is theclass of all things (of a giventype) that have a tensor product.
Other kinds of products in linear algebra include:
Inset theory, aCartesian product is amathematical operation which returns aset (orproduct set) from multiple sets. That is, for setsA andB, the Cartesian productA ×B is the set of allordered pairs(a, b)—wherea ∈A andb ∈B.[5]
The class of all things (of a giventype) that have Cartesian products is called aCartesian category. Many of these areCartesian closed categories. Sets are an example of such objects.
Theempty product on numbers and mostalgebraic structures has the value of 1 (theidentity element of multiplication), just like theempty sum has the value of 0 (the identity element of addition). However, the concept of the empty product is more general, and requires special treatment inlogic,set theory,computer programming andcategory theory.
Products over other kinds ofalgebraic structures include:
A few of the above products are examples of the general notion of aninternal product in amonoidal category; the rest are describable by the general notion of aproduct in category theory.
All of the previous examples are special cases or examples of the general notion of a product. For the general treatment of the concept of a product, seeproduct (category theory), which describes how to combine twoobjects of some kind to create an object, possibly of a different kind. But also, in category theory, one has: