Arithmetic operations  


In mathematics, a product is the result of multiplication, or an expression that identifies objects (numbers or variables) to be multiplied, called factors. 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 an integer, the product is called a multiple.
The order in which real or complex numbers are multiplied has no bearing on the product; this is known as the commutative law of multiplication. When matrices or members of various other associative algebras are multiplied, the product usually depends on the order of the factors. Matrix multiplication, for example, is noncommutative, 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 different algebraic structures.
Main article: Multiplication 
Originally, a product was and is still the result of the multiplication of two or more numbers. For example, 15 is the product of 3 and 5. The fundamental theorem of arithmetic states that every composite number is a product of prime numbers, that is unique up to the order of the factors.
With the introduction mathematical notation and variables at the end of the 15th century, it became common to consider the multiplication of numbers that are either unspecified (coefficients and parameters), or to be found (unknowns). These multiplications that cannot be effectively performed are called products. For example, in the linear equation the term denotes the product of the coefficient and the unknown
Later and essentially from the 19th century on, new binary operations have been introduced, which do not involve numbers at all, and have been called products; for example, the dot product. Most of this article is devoted to such nonnumerical products.
See also: Multiplication § Product of a sequence 
The product operator for the product of a sequence is denoted by the capital Greek letter pi Π (in analogy to the use of the capital Sigma Σ as summation 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 the empty product, and is equal to 1.
Commutative rings have a product operation.
Main article: Residue class 
Residue classes in the rings can be added:
and multiplied:
Main article: Convolution 
Two functions from the reals to itself can be multiplied in another way, called the convolution.
If
then the integral
is well defined and is called the convolution.
Under the Fourier transform, convolution becomes pointwise function multiplication.
Main article: Polynomial ring 
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.
Main article: Scalar multiplication 
By the very definition of a vector space, one can form the product of any scalar with any vector, giving a map .
Main article: Scalar product 
A scalar product is a bilinear map:
with the following conditions, that for all .
From the scalar product, one can define a norm by letting .
The scalar product also allows one to define an angle between two vectors:
In dimensional Euclidean space, the standard scalar product (called the dot product) is given by:
Main article: Cross product 
The cross product of two vectors in 3dimensions is a vector perpendicular to the two factors, with length equal to the area of the parallelogram spanned by the two factors.
The cross product can also be expressed as the formal^{[a]} determinant:
Main article: Function composition 
A linear mapping can be defined as a function f between two vector spaces V and W with underlying field F, satisfying^{[3]}
If one only considers finite dimensional vector spaces, then
in which b_{V} and b_{W} denote the bases of V and W, and v_{i} denotes the component of v on b_{V}^{i}, and Einstein summation convention is applied.
Now we consider the composition of two linear mappings between finite dimensional vector spaces. Let the linear mapping f map V to W, and let the linear mapping g map W to U. Then one can get
Or in matrix form:
in which the irow, jcolumn element of F, denoted by F_{ij}, is f^{j}_{i}, and G_{ij}=g^{j}_{i}.
The composition of more than two linear mappings can be similarly represented by a chain of matrix multiplication.
Main article: Matrix product 
Given two matrices
their product is given by
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 a basis of U, be a basis of V and be a basis of W. In terms of this basis, let be 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.
Main article: Tensor product 
Given two finite dimensional vector spaces V and W, the tensor product of them can be defined as a (2,0)tensor satisfying:
where V^{*} and W^{*} denote the dual spaces of V and W.^{[4]}
For infinitedimensional vector spaces, one also has the:
The tensor product, outer product and Kronecker 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 previouslyfixed basis, whereas the tensor product is usually given in its intrinsic definition. The outer product is simply the Kronecker product, limited to vectors (instead of matrices).
In general, whenever one has two mathematical objects that can be combined in a way that behaves like a linear algebra tensor product, then this can be most generally understood as the internal product of a monoidal 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 the class of all things (of a given type) that have a tensor product.
Other kinds of products in linear algebra include:
In set theory, a Cartesian product is a mathematical operation which returns a set (or product set) from multiple sets. That is, for sets A and B, the Cartesian product A × B is the set of all ordered pairs (a, b)—where a ∈ A and b ∈ B.^{[5]}
The class of all things (of a given type) that have Cartesian products is called a Cartesian category. Many of these are Cartesian closed categories. Sets are an example of such objects.
The empty product on numbers and most algebraic structures has the value of 1 (the identity element of multiplication), just like the empty 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 in logic, set theory, computer programming and category theory.
Products over other kinds of algebraic structures include:
A few of the above products are examples of the general notion of an internal product in a monoidal category; the rest are describable by the general notion of a product 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, see product (category theory), which describes how to combine two objects of some kind to create an object, possibly of a different kind. But also, in category theory, one has: