# Difference between revisions of "Dot product"

Jump to navigation Jump to search

{{#invoke:Hatnote|hatnote}}Template:Main other

In mathematics, the dot product, or scalar product (or sometimes inner product in the context of Euclidean space), is an algebraic operation that takes two equal-length sequences of numbers (usually coordinate vectors) and returns a single number. This operation can be defined either algebraically or geometrically. Algebraically, it is the sum of the products of the corresponding entries of the two sequences of numbers. Geometrically, it is the product of the magnitudes of the two vectors and the cosine of the angle between them. The name "dot product" is derived from the centered dot· " that is often used to designate this operation; the alternative name "scalar product" emphasizes the scalar (rather than vectorial) nature of the result.

In three-dimensional space, the dot product contrasts with the cross product of two vectors, which produces a pseudovector as the result. The dot product is directly related to the cosine of the angle between two vectors in Euclidean space of any number of dimensions.

## Definition

The dot product is often defined in one of two ways: algebraically or geometrically. The geometric definition is based on the notions of angle and distance (magnitude of vectors). The equivalence of these two definitions relies on having a Cartesian coordinate system for Euclidean space.

In modern presentations of Euclidean geometry, the points of space are defined in terms of their Cartesian coordinates, and Euclidean space itself is commonly identified with the real coordinate space Rn. In such a presentation, the notions of length and angles are not primitive. They are defined by means of the dot product: the length of a vector is defined as the square root of the dot product of the vector by itself, and the cosine of the (non oriented) angle of two vectors of length one is defined as their dot product. So the equivalence of the two definitions of the dot product is a part of the equivalence of the classical and the modern formulations of Euclidean geometry.

### Algebraic definition

The dot product of two vectors a = [a1, a2, ..., an] and b = [b1, b2, ..., bn] is defined as:[1]

${\displaystyle {\mathbf {a} }\cdot {\mathbf {b} }=\sum _{i=1}^{n}a_{i}b_{i}=a_{1}b_{1}+a_{2}b_{2}+\cdots +a_{n}b_{n}}$

where Σ denotes summation notation and n is the dimension of the vector space. For instance, in three-dimensional space, the dot product of vectors [1, 3, −5] and [4, −2, −1] is:

{\displaystyle {\begin{aligned}\ [1,3,-5]\cdot [4,-2,-1]&=(1)(4)+(3)(-2)+(-5)(-1)\\&=4-6+5\\&=3.\end{aligned}}}

### Geometric definition

In Euclidean space, a Euclidean vector is a geometrical object that possesses both a magnitude and a direction. A vector can be pictured as an arrow. Its magnitude is its length, and its direction is the direction the arrow points. The magnitude of a vector A is denoted by ${\displaystyle \|\mathbf {A} \|}$. The dot product of two Euclidean vectors A and B is defined by[2]

${\displaystyle \mathbf {A} \cdot \mathbf {B} =\|\mathbf {A} \|\,\|\mathbf {B} \|\cos \theta ,}$

where θ is the angle between A and B.

In particular, if A and B are orthogonal, then the angle between them is 90° and

${\displaystyle \mathbf {A} \cdot \mathbf {B} =0.}$

At the other extreme, if they are codirectional, then the angle between them is 0° and

${\displaystyle \mathbf {A} \cdot \mathbf {B} =\|\mathbf {A} \|\,\|\mathbf {B} \|}$

This implies that the dot product of a vector A by itself is

${\displaystyle \mathbf {A} \cdot \mathbf {A} =\|\mathbf {A} \|^{2},}$

which gives

${\displaystyle \|\mathbf {A} \|={\sqrt {\mathbf {A} \cdot \mathbf {A} }},}$

the formula for the Euclidean length of the vector.

### Scalar projection and first properties

Scalar projection

The scalar projection (or scalar component) of a Euclidean vector A in the direction of a Euclidean vector B is given by

${\displaystyle A_{B}=\|\mathbf {A} \|\cos \theta }$

where θ is the angle between A and B.

In terms of the geometric definition of the dot product, this can be rewritten

${\displaystyle A_{B}=\mathbf {A} \cdot {\widehat {\mathbf {B} }}}$

where ${\displaystyle {\widehat {\mathbf {B} }}=\mathbf {B} /\|\mathbf {B} \|}$ is the unit vector in the direction of B.

Distributive law for the dot product

The dot product is thus characterized geometrically by[3]

${\displaystyle \mathbf {A} \cdot \mathbf {B} =A_{B}\|\mathbf {B} \|=B_{A}\|\mathbf {A} \|.}$

The dot product, defined in this manner, is homogeneous under scaling in each variable, meaning that for any scalar α,

${\displaystyle (\alpha \mathbf {A} )\cdot \mathbf {B} =\alpha (\mathbf {A} \cdot \mathbf {B} )=\mathbf {A} \cdot (\alpha \mathbf {B} ).}$

It also satisfies a distributive law, meaning that

${\displaystyle \mathbf {A} \cdot (\mathbf {B} +\mathbf {C} )=\mathbf {A} \cdot \mathbf {B} +\mathbf {A} \cdot \mathbf {C} .}$

These properties may be summarized by saying that the dot product is a bilinear form. Moreover, this bilinear form is positive definite, which means that ${\displaystyle \mathbf {A} \cdot \mathbf {A} }$ is never negative and is zero if and only if ${\displaystyle \mathbf {A} =\mathbf {0} .}$

### Equivalence of the definitions

If e1,...,en are the standard basis vectors in Rn, then we may write

{\displaystyle {\begin{aligned}\mathbf {A} &=[A_{1},\dots ,A_{n}]=\sum _{i}A_{i}\mathbf {e} _{i}\\\mathbf {B} &=[B_{1},\dots ,B_{n}]=\sum _{i}B_{i}\mathbf {e} _{i}.\end{aligned}}}

The vectors ei are an orthonormal basis, which means that they have unit length and are at right angles to each other. Hence since these vectors have unit length

${\displaystyle \mathbf {e} _{i}\cdot \mathbf {e} _{i}=1}$

and since they form right angles with each other, if i ≠ j,

${\displaystyle \mathbf {e} _{i}\cdot \mathbf {e} _{j}=0.}$

Now applying the distributivity of the geometric version of the dot product gives

${\displaystyle {\mathbf {A} }\cdot {\mathbf {B} }=\sum _{i}B_{i}({\mathbf {A} }\cdot {\mathbf {e} }_{i})=\sum _{i}B_{i}A_{i}}$

which is precisely the algebraic definition of the dot product. So the (geometric) dot product equals the (algebraic) dot product.

## Properties

The dot product fulfils the following properties if a, b, and c are real vectors and r is a scalar.[1][2]

1. Commutative:
${\displaystyle \mathbf {a} \cdot \mathbf {b} =\mathbf {b} \cdot \mathbf {a} .}$
which follows from the definition (θ is the angle between a and b):
${\displaystyle \mathbf {a} \cdot \mathbf {b} =\|\mathbf {a} \|\|\mathbf {b} \|\cos \theta =\|\mathbf {b} \|\|\mathbf {a} \|\cos \theta =\mathbf {b} \cdot \mathbf {a} }$
2. Distributive over vector addition:
${\displaystyle \mathbf {a} \cdot (\mathbf {b} +\mathbf {c} )=\mathbf {a} \cdot \mathbf {b} +\mathbf {a} \cdot \mathbf {c} .}$
3. Bilinear:
${\displaystyle \mathbf {a} \cdot (r\mathbf {b} +\mathbf {c} )=r(\mathbf {a} \cdot \mathbf {b} )+(\mathbf {a} \cdot \mathbf {c} ).}$
4. Scalar multiplication:
${\displaystyle (c_{1}\mathbf {a} )\cdot (c_{2}\mathbf {b} )=c_{1}c_{2}(\mathbf {a} \cdot \mathbf {b} )}$
5. Orthogonal:
Two non-zero vectors a and b are orthogonal if and only if ab = 0.
6. No cancellation:
Unlike multiplication of ordinary numbers, where if ab = ac, then b always equals c unless a is zero, the dot product does not obey the cancellation law:
If ab = ac and a0, then we can write: a ⋅ (bc) = 0 by the distributive law; the result above says this just means that a is perpendicular to (bc), which still allows (bc) ≠ 0, and therefore bc.
7. Derivative: If a and b are functions, then the derivative (denoted by a prime ′) of ab is a′ ⋅ b + ab.

### Application to the cosine law

Triangle with vector edges a and b, separated by angle θ.

{{#invoke:main|main}}

Given two vectors a and b separated by angle θ (see image right), they form a triangle with a third side c = ab. The dot product of this with itself is:

{\displaystyle {\begin{aligned}\mathbf {c} \cdot \mathbf {c} &=(\mathbf {a} -\mathbf {b} )\cdot (\mathbf {a} -\mathbf {b} )\\&=\mathbf {a} \cdot \mathbf {a} -\mathbf {a} \cdot \mathbf {b} -\mathbf {b} \cdot \mathbf {a} +\mathbf {b} \cdot \mathbf {b} \\&=a^{2}-\mathbf {a} \cdot \mathbf {b} -\mathbf {a} \cdot \mathbf {b} +b^{2}\\&=a^{2}-2\mathbf {a} \cdot \mathbf {b} +b^{2}\\c^{2}&=a^{2}+b^{2}-2ab\cos \theta \\\end{aligned}}}

which is the law of cosines.

## Triple product expansion

{{#invoke:main|main}}

This is a very useful identity (also known as Lagrange's formula) involving the dot- and cross-products. It is written as:[1][2]

${\displaystyle \mathbf {a} \times (\mathbf {b} \times \mathbf {c} )=\mathbf {b} (\mathbf {a} \cdot \mathbf {c} )-\mathbf {c} (\mathbf {a} \cdot \mathbf {b} )}$

which is easier to remember as "BAC minus CAB", keeping in mind which vectors are dotted together. This formula is commonly used to simplify vector calculations in physics.

## Physics

In physics, vector magnitude is a scalar in the physical sense, i.e. a physical quantity independent of the coordinate system, expressed as the product of a numerical value and a physical unit, not just a number. The dot product is also a scalar in this sense, given by the formula, independent of the coordinate system. Examples include:[4][5]

## Generalizations

### Complex vectors

For vectors with complex entries, using the given definition of the dot product would lead to quite different properties. For instance the dot product of a vector with itself would be an arbitrary complex number, and could be zero without the vector being the zero vector (such vectors are called isotropic); this in turn would have consequences for notions like length and angle. Properties such as the positive-definite norm can be salvaged at the cost of giving up the symmetric and bilinear properties of the scalar product, through the alternative definition[1]

${\displaystyle \mathbf {a} \cdot \mathbf {b} =\sum {a_{i}{\overline {b_{i}}}}}$

where bi is the complex conjugate of bi. Then the scalar product of any vector with itself is a non-negative real number, and it is nonzero except for the zero vector. However this scalar product is thus sesquilinear rather than bilinear: it is conjugate linear and not linear in b, and the scalar product is not symmetric, since

${\displaystyle \mathbf {a} \cdot \mathbf {b} ={\overline {\mathbf {b} \cdot \mathbf {a} }}.}$

The angle between two complex vectors is then given by

${\displaystyle \cos \theta ={\frac {\operatorname {Re} (\mathbf {a} \cdot \mathbf {b} )}{\|\mathbf {a} \|\,\|\mathbf {b} \|}}.}$

This type of scalar product is nevertheless useful, and leads to the notions of Hermitian form and of general inner product spaces.

### Inner product

{{#invoke:main|main}} The inner product generalizes the dot product to abstract vector spaces over a field of scalars, being either the field of real numbers ${\displaystyle \mathbb {R} }$ or the field of complex numbers ${\displaystyle \mathbb {C} }$. It is usually denoted by ${\displaystyle \langle \mathbf {a} \,,\mathbf {b} \rangle }$.

The inner product of two vectors over the field of complex numbers is, in general, a complex number, and is sesquilinear instead of bilinear. An inner product space is a normed vector space, and the inner product of a vector with itself is real and positive-definite.

### Functions

The dot product is defined for vectors that have a finite number of entries. Thus these vectors can be regarded as discrete functions: a length-Template:Mvar vector Template:Mvar is, then, a function with domain {k ∈ ℕ ∣ 1 ≤ kn}, and ui is a notation for the image of i by the function/vector u.

This notion can be generalized to continuous functions: just as the inner product on vectors uses a sum over corresponding components, the inner product on functions is defined as an integral over some interval axb (also denoted [a, b]):[1]

${\displaystyle \langle u,v\rangle =\int _{a}^{b}u(x)v(x)dx}$

Generalized further to complex functions ψ(x) and χ(x), by analogy with the complex inner product above, gives[1]

${\displaystyle \langle \psi ,\chi \rangle =\int _{a}^{b}\psi (x){\overline {\chi (x)}}dx.}$

### Weight function

Inner products can have a weight function, i.e. a function which weight each term of the inner product with a value.

### Dyadics and matrices

Matrices have the Frobenius inner product, which is analogous to the vector inner product. It is defined as the sum of the products of the corresponding components of two matrices A and B having the same size:

${\displaystyle {\mathbf {A} }:{\mathbf {B} }=\sum _{i}\sum _{j}A_{ij}{\overline {B_{ij}}}={\mathrm {tr} }({\mathbf {A} }^{*}{\mathbf {B} })={\mathrm {tr} }({\mathbf {A} }{\mathbf {B} }^{*}).}$
${\displaystyle {\mathbf {A} }:{\mathbf {B} }=\sum _{i}\sum _{j}A_{ij}B_{ij}={\mathrm {tr} }({\mathbf {A} }^{\mathrm {T} }{\mathbf {B} })={\mathrm {tr} }({\mathbf {A} }{\mathbf {B} }^{\mathrm {T} }).}$ (For real matrices)

Dyadics have a dot product and "double" dot product defined on them, see Dyadics (Product of dyadic and dyadic) for their definitions.

### Tensors

The inner product between a tensor of order n and a tensor of order m is a tensor of order n + m − 2, see tensor contraction for details.

## References

1. {{#invoke:citation/CS1|citation |CitationClass=book }}
2. {{#invoke:citation/CS1|citation |CitationClass=book }}
3. {{#invoke:citation/CS1|citation |CitationClass=book }}.
4. {{#invoke:citation/CS1|citation |CitationClass=book }}
5. {{#invoke:citation/CS1|citation |CitationClass=book }}