Inner product space

s are a subset of normed vector spaces, which are a subset of metric spaces, which in turn are a subset of topological spaces.

Uses your system voice; voice and rate in settings.

≈ 16 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

s are a subset of normed vector spaces, which are a subset of metric spaces, which in turn are a subset of topological spaces. In mathematics, an inner product space is a real or complex vector space endowed with an operation called an inner product. The inner product of two vectors in the space is a scalar, often denoted with angle brackets such as in \langle a, b \rangle .

Inner products allow formal definitions of intuitive geometric notions, such as lengths, angles, and orthogonality (zero inner product) of vectors. Inner product spaces generalize Euclidean vector spaces, in which the inner product is the dot product or scalar product of Cartesian coordinates. Inner product spaces of infinite dimensions are widely used in functional analysis.

Inner product spaces over the field of complex numbers are sometimes referred to as unitary spaces. The first usage of the concept of a vector space with an inner product is due to Giuseppe Peano, in 1898. An inner product naturally induces an associated norm, (denoted |x| and |y| in the picture); so, every inner product space is a normed vector space.

If this normed space is also complete (that is, a Banach space) then the inner product space is a Hilbert space. If an inner product space is not a Hilbert space, it can be extended by completion to a Hilbert space \overline{H}.

This means that H is a linear subspace of \overline{H}, the inner product of H is the restriction of that of \overline{H}, and H is dense in \overline{H} for the topology defined by the norm. \langle \cdot \operatorname{,} \cdot \rangle : V \times V \to F that satisfies the following three properties for all vectors x,y,z\in V and all scalars Conjugate symmetry: \langle x, y \rangle = \overline{\langle y, x \rangle}. As a = \overline{a} if and only if a is real, conjugate symmetry implies that \langle x, x \rangle is always a real number.

If is \R , conjugate symmetry is just symmetry. Linearity in the first argument: \langle ax+by, z \rangle = a \langle x, z \rangle + b \langle y, z \rangle. Positive-definiteness: if x is not zero, then \langle x, x \rangle > 0 (conjugate symmetry implies that \langle x, x \rangle is real).

If the positive-definiteness condition is replaced by merely requiring that \langle x, x \rangle \geq 0 for all x , then one obtains the definition of positive semi-definite Hermitian form. A positive semi-definite Hermitian form \langle \cdot, \cdot \rangle is an inner product if and only if for all x , if \langle x, x \rangle = 0 then x = \mathbf 0 . \langle \mathbf{0}, x \rangle=\langle x,\mathbf{0}\rangle=0. \langle x, x \rangle is real and nonnegative. \langle x, x \rangle = 0 if and only if x=\mathbf{0}. \langle x, ay+bz \rangle= \overline a \langle x, y \rangle + \overline b \langle x, z \rangle , that is conjugate-linearity (for the 2nd argument).

This implies that an inner product is a sesquilinear form. \langle x + y, x + y \rangle = \langle x, x \rangle + 2\operatorname{Re}(\langle x, y \rangle) + \langle y, y \rangle, where \operatorname{Re} denotes the real part of its argument. Over \R , conjugate-symmetry reduces to symmetry, and sesquilinearity reduces to bilinearity.

Hence an inner product on a real vector space is a positive-definite symmetric bilinear form. The binomial expansion of a square becomes \langle x + y, x + y \rangle = \langle x, x \rangle + 2\langle x, y \rangle + \langle y, y \rangle .

Some authors, especially in physics and matrix algebra, prefer to define inner products and sesquilinear forms with linearity in the second argument rather than the first. Then the first argument becomes conjugate linear, rather than the second.

Bra–ket notation in quantum mechanics also uses slightly different notation, i.e. \langle \cdot | \cdot \rangle , where \langle x | y \rangle := \left ( y, x \right ) .

Real and complex numbers

Among the simplest examples of inner product spaces are \R and \Complex. The real numbers \R are a vector space over \R that becomes an inner product space with arithmetic multiplication as its inner product: \langle x, y \rangle := x y \quad \text{ for } x, y \in \R. The complex numbers \Complex are a vector space over \Complex that becomes an inner product space with the inner product \langle x, y \rangle := x \overline{y} \quad \text{ for } x, y \in \Complex.

Unlike with the real numbers, the assignment (x, y) \mapsto x y does define a complex inner product on \Complex.

Euclidean vector space

More generally, the real n -space \R^n with the dot product is an inner product space, an example of a Euclidean vector space. \left\langle \begin{bmatrix} x_1 \\ \vdots \\ x_n \end{bmatrix}, \begin{bmatrix} y_1 \\ \vdots \\ y_n \end{bmatrix} \right\rangle = x^\operatorname{T} y = \sum_{i=1}^n x_i y_i = x_1 y_1 + \cdots + x_n y_n, where x^{\operatorname{T}} is the transpose of x. A function \langle \,\cdot, \cdot\, \rangle : \R^n \times \R^n \to \R is an inner product on \R^n if and only if there exists a symmetric positive-definite matrix \mathbf{M} such that \langle x, y \rangle = x^{\operatorname{T}} \mathbf{M} y for all x, y \in \R^n. If \mathbf{M} is the identity matrix then \langle x, y \rangle = x^{\operatorname{T}} \mathbf{M} y is the dot product. For another example, if n = 2 and \mathbf{M} = \begin{bmatrix} a & b \\ b & d \end{bmatrix} is positive-definite (which happens if and only if \det \mathbf{M} = a d - b^2 > 0 and one/both diagonal elements are positive) then for any x := \left[x_1, x_2\right]^{\operatorname{T}}, y := \left[y_1, y_2\right]^{\operatorname{T}} \in \R^2, \langle x, y \rangle = x^{\operatorname{T}} \mathbf{M} y = \left[x_1, x_2\right] \begin{bmatrix} a & b \\ b & d \end{bmatrix} \begin{bmatrix} y_1 \\ y_2 \end{bmatrix} = a x_1 y_1 + b x_1 y_2 + b x_2 y_1 + d x_2 y_2.

As mentioned earlier, every inner product on \R^2 is of this form (where b \in \R, a > 0 and d > 0 satisfy a d > b^2 ).

Complex coordinate space

The general form of an inner product on \Complex^n is known as the Hermitian form and is given by \langle x, y \rangle = y^\dagger \mathbf{M} x = \overline{x^\dagger \mathbf{M} y}, where M is any Hermitian positive-definite matrix and y^{\dagger} is the conjugate transpose of y. For the real case, this corresponds to the dot product of the results of directionally-different scaling of the two vectors, with positive scale factors and orthogonal directions of scaling. It is a weighted-sum version of the dot product with positive weights—up to an orthogonal transformation.

Hilbert space

The article on Hilbert spaces has several examples of inner product spaces, wherein the metric induced by the inner product yields a complete metric space. An example of an inner product space which induces an incomplete metric is the space C([a, b]) of continuous complex valued functions f and g on the interval [a, b]. The inner product is \langle f, g \rangle = \int_a^b f(t) \overline{g(t)} \, \mathrm{d}t. This space is not complete; consider for example, for the interval the sequence of continuous "step" functions, \{ f_k \}_k, defined by: f_k(t) = \begin{cases} 0 & t \in [-1, 0] \\ 1 & t \in \left[\tfrac{1}{k}, 1\right] \\ kt & t \in \left(0, \tfrac{1}{k}\right) \end{cases} This sequence is a Cauchy sequence for the norm induced by the preceding inner product, which does not converge to a function.

Random variables

For real random variables X and Y, the expected value of their product \langle X, Y \rangle = \mathbb{E}[XY] is an inner product. In this case, \langle X, X \rangle = 0 if and only if \mathbb{P}[X = 0] = 1 (that is, X = 0 almost surely), where \mathbb{P} denotes the probability of the event. This definition of expectation as inner product can be extended to random vectors as well.

Complex matrices

The inner product for complex square matrices of the same size is the Frobenius inner product \langle A, B \rangle := \operatorname{tr}\left(AB^\dagger\right) . Since trace and transposition are linear and the conjugation is on the second matrix, it is a sesquilinear operator.

We further get Hermitian symmetry by, \langle A, B \rangle = \operatorname{tr}\left(AB^\dagger\right) = \overline{\operatorname{tr}\left(BA^\dagger\right)} = \overline{\left\langle B,A \right\rangle} Finally, since for A nonzero, \langle A, A\rangle = \sum_{ij} \left|A_{ij}\right|^2 > 0 , we get that the Frobenius inner product is positive definite too, and so is an inner product.

Vector spaces with forms

On an inner product space, or more generally a vector space with a nondegenerate form (hence an isomorphism V \to V^* ), vectors can be sent to covectors (in coordinates, via transpose), so that one can take the inner product and outer product of two vectors—not simply of a vector and a covector.

Basic results, terminology, and definitions

\|x\| = \sqrt{\langle x, x \rangle}. With this norm, every inner product space becomes a normed vector space. So, every general property of normed vector spaces applies to inner product spaces. In particular, one has the following properties:

Orthogonality

{{defn| Two vectors x and y are said to be , often written x \perp y, if their inner product is zero, that is, if \langle x, y \rangle = 0. This happens if and only if \|x\| \leq \|x + s y\| for all scalars s, and if and only if the real-valued function f(s) := \|x + s y\|^2 - \|x\|^2 is non-negative.

(This is a consequence of the fact that, if y \neq 0 then the scalar s_0 = - \tfrac{\overline{\langle x, y \rangle}}{\|y\|^2} minimizes f with value f\left(s_0\right) = - \tfrac Parseval's identity leads immediately to the following theorem: Theorem. Let V be a separable inner product space and \left\{e_k\right\}_k an orthonormal basis of V. Then the map x \mapsto \bigl\{\langle e_k, x \rangle\bigr\}_{k \in \N} is an isometric linear map V \rightarrow \ell^2 with a dense image.

This theorem can be regarded as an abstract form of Fourier series, in which an arbitrary orthonormal basis plays the role of the sequence of trigonometric polynomials. Note that the underlying index set can be taken to be any countable set (and in fact any set whatsoever, provided \ell^2 is defined appropriately, as is explained in the article Hilbert space).

In particular, we obtain the following result in the theory of Fourier series: Theorem. Let V be the inner product space C[-\pi, \pi]. Then the sequence (indexed on set of all integers) of continuous functions e_k(t) = \frac{e^{i k t}}{\sqrt{2 \pi}} is an orthonormal basis of the space C[-\pi, \pi] with the L^2 inner product.

The mapping f \mapsto \frac{1}{\sqrt{2 \pi}} \left\{\int_{-\pi}^\pi f(t) e^{-i k t} \, \mathrm{d}t \right\}_{k \in \Z} is an isometric linear map with dense image. Orthogonality of the sequence \{ e_k \}_k follows immediately from the fact that if k \neq j, then \int_{-\pi}^\pi e^{-i (j - k) t} \, \mathrm{d}t = 0.

Normality of the sequence is by design, that is, the coefficients are so chosen so that the norm comes out to 1. Finally the fact that the sequence has a dense algebraic span, in the , follows from the fact that the sequence has a dense algebraic span, this time in the space of continuous periodic functions on [-\pi, \pi] with the uniform norm.

This is the content of the Weierstrass theorem on the uniform density of trigonometric polynomials.

Operators on inner product spaces

Several types of linear maps A : V \to W between inner product spaces V and W are of relevance: : A : V \to W is linear and continuous with respect to the metric defined above, or equivalently, A is linear and the set of non-negative reals \{ \|Ax\| : \|x\| \leq 1\}, where x ranges over the closed unit ball of V, is bounded. : A : V \to W is linear and \langle Ax, y \rangle = \langle x, Ay \rangle for all x, y \in V. : A : V \to W satisfies \|A x\| = \|x\| for all x \in V. A (resp. an ) is an isometry that is also a linear map (resp. an antilinear map). For inner product spaces, the polarization identity can be used to show that A is an isometry if and only if \langle Ax, Ay \rangle = \langle x, y \rangle for all x, y \in V. All isometries are injective.

The Mazur–Ulam theorem establishes that every surjective isometry between two normed spaces is an affine transformation. Consequently, an isometry A between real inner product spaces is a linear map if and only if A(0) = 0.

Isometries are morphisms between inner product spaces, and morphisms of real inner product spaces are orthogonal transformations (compare with orthogonal matrix). : A : V \to W is an isometry which is surjective (and hence bijective). Isometrical isomorphisms are also known as unitary operators (compare with unitary matrix).

From the point of view of inner product space theory, there is no need to distinguish between two spaces which are isometrically isomorphic. The spectral theorem provides a canonical form for symmetric, unitary and more generally normal operators on finite dimensional inner product spaces. A generalization of the spectral theorem holds for continuous normal operators in Hilbert spaces.

Generalizations

Any of the axioms of an inner product may be weakened, yielding generalized notions. The generalizations that are closest to inner products occur where bilinearity and conjugate symmetry are retained, but positive-definiteness is weakened.

Degenerate inner products

If V is a vector space and \langle \,\cdot\,, \,\cdot\, \rangle a semi-definite sesquilinear form, then the function: \|x\| = \sqrt{\langle x, x\rangle} makes sense and satisfies all the properties of norm except that \|x\| = 0 does not imply x = 0 (such a functional is then called a semi-norm). We can produce an inner product space by considering the quotient W = V / \{x : \|x\| = 0\}.

The sesquilinear form \langle \,\cdot\,, \,\cdot\, \rangle factors through W. This construction is used in numerous contexts. The Gelfand–Naimark–Segal construction is a particularly important example of the use of this technique. Another example is the representation of semi-definite kernels on arbitrary sets.

Nondegenerate conjugate symmetric forms

Alternatively, one may require that the pairing be a nondegenerate form, meaning that for all non-zero x \neq 0 there exists some y such that \langle x, y \rangle \neq 0, though y need not equal x ; in other words, the induced map to the dual space V \to V^* is injective. This generalization is important in differential geometry: a manifold whose tangent spaces have an inner product is a Riemannian manifold, while if this is related to nondegenerate conjugate symmetric form the manifold is a pseudo-Riemannian manifold.

By Sylvester's law of inertia, just as every inner product is similar to the dot product with positive weights on a set of vectors, every nondegenerate conjugate symmetric form is similar to the dot product with weights on a set of vectors, and the number of positive and negative weights are called respectively the positive index and negative index. Product of vectors in Minkowski space is an example of indefinite inner product, although, technically speaking, it is not an inner product according to the standard definition above.

Minkowski space has four dimensions and indices 3 and 1 (assignment of "+" and "−" to them differs depending on conventions). Purely algebraic statements (ones that do not use positivity) usually only rely on the nondegeneracy (the injective homomorphism V \to V^* ) and thus hold more generally.

The term "inner product" is opposed to outer product (tensor product), which is a slightly more general opposite. Simply, in coordinates, the inner product is the product of a 1 \times n with an n \times 1 vector, yielding a 1 \times 1 matrix (a scalar), while the outer product is the product of an m \times 1 vector with a 1 \times n covector, yielding an m \times n matrix.

The outer product is defined for different dimensions, while the inner product requires the same dimension. If the dimensions are the same, then the inner product is the of the outer product (trace only being properly defined for square matrices). In an informal summary: "inner is horizontal times vertical and shrinks down, outer is vertical times horizontal and expands out".

More abstractly, the outer product is the bilinear map W \times V^* \to \hom(V, W) sending a vector and a covector to a rank 1 linear transformation (simple tensor of type (1, 1)), while the inner product is the bilinear evaluation map V^* \times V \to F given by evaluating a covector on a vector; the order of the domain vector spaces here reflects the covector/vector distinction. The inner product and outer product should not be confused with the interior product and exterior product, which are instead operations on vector fields and differential forms, or more generally on the exterior algebra.

As a further complication, in geometric algebra the inner product and the (Grassmann) product are combined in the geometric product (the Clifford product in a Clifford algebra) – the inner product sends two vectors (1-vectors) to a scalar (a 0-vector), while the exterior product sends two vectors to a bivector (2-vector) – and in this context the exterior product is usually called the (alternatively, ). The inner product is more correctly called a product in this context, as the nondegenerate quadratic form in question need not be positive definite (need not be an inner product).

Bibliography

Zamani, A.; Moslehian, M.S.; & Frank, M. (2015) "Angle Preserving Mappings", Journal of Analysis and Applications 34: 485 to 500

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378159611 under CC BY-SA 4.0; modifications have been made.

Words in each sectionOrthogonalityOrthogonalityOrthogonality: 430 words430Related productsRelated productsRelated products: 330 words330Euclidean vector spaceEuclidean vector spaceEuclidean vector space: 301 words301Operators on inner prod…Operators on inner product spacesOperators on inner product spaces: 291 words291Nondegenerate conjugate…Nondegenerate conjugate symmetric formsNondegenerate conjugate symmetric forms: 226 words226Hilbert spaceHilbert spaceHilbert space: 154 words154Complex matricesComplex matricesComplex matrices: 110 words110Degenerate inner produc…Degenerate inner productsDegenerate inner products: 110 words110Real and complex numbersReal and complex numbersReal and complex numbers: 102 words102Complex coordinate spaceComplex coordinate spaceComplex coordinate space: 97 words97Random variablesRandom variablesRandom variables: 71 words71Vector spaces with formsVector spaces with formsVector spaces with forms: 53 words53BibliographyBibliographyBibliography: 44 words44Basic results, terminol…Basic results, terminology, and definitionsBasic results, terminology, and definitions: 38 words38GeneralizationsGeneralizationsGeneralizations: 34 words34
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001378159611 · captured 2026-10-03 · ledger · version history

Cite this page as: encyclopegia.org, “Inner product space”, snapshot enwiki-001378159611. https://encyclopegia.org/a/inner-product-space

Sources cited in this revision

6 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.