Inner product space

Template:Short description Template:Redirect

Geometric interpretation of the angle between two vectors defined using an inner product

Scalar product spaces, over any field, have "scalar products" that are symmetrical and linear in the first argument. Hermitian product spaces are restricted to the field of complex numbers and have "Hermitian products" that are conjugate-symmetrical and linear in the first argument. Inner product spaces may be defined over any field, having "inner products" that are linear in the first argument, conjugate-symmetrical, and positive-definite. Unlike inner products, scalar products and Hermitian products need not be positive-definite.

In mathematics, an inner product space (or, rarely, a Hausdorff pre-Hilbert spaceTemplate:Sfn Template:Sfn) is a real vector space or a complex vector space 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 <math>\langle a, b \rangle</math>. 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 dimension 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.<ref>Template:Cite journal</ref>

An inner product naturally induces an associated norm, (denoted <math>|x|</math> and <math>|y|</math> 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.Template:Sfn If an inner product space Template:Mvar is not a Hilbert space, it can be extended by completion to a Hilbert space <math>\overline{H}.</math> This means that <math>H</math> is a linear subspace of <math>\overline{H},</math> the inner product of <math>H</math> is the restriction of that of <math>\overline{H},</math> and <math>H</math> is dense in <math>\overline{H}</math> for the topology defined by the norm.Template:Sfn Template:Sfn

DefinitionEdit

In this article, Template:Math denotes a field that is either the real numbers <math>\R,</math> or the complex numbers <math>\Complex.</math> A scalar is thus an element of Template:Math. A bar over an expression representing a scalar denotes the complex conjugate of this scalar. A zero vector is denoted <math>\mathbf 0</math> for distinguishing it from the scalar Template:Math.

An inner product space is a vector space Template:Math over the field Template:Math together with an inner product, that is, a map <math display="block"> \langle \cdot, \cdot \rangle : V \times V \to F </math> that satisfies the following three properties for all vectors <math>x,y,z\in V</math> and all scalars Template:Nowrap

Conjugate symmetry: <math display=block>\langle x, y \rangle = \overline{\langle y, x \rangle}.</math> As <math display="inline"> a = \overline{a} </math> if and only if <math>a</math> is real, conjugate symmetry implies that <math>\langle x, x \rangle </math> is always a real number. If Template:Math is <math>\R</math>, conjugate symmetry is just symmetry.
Linearity in the first argument:<ref group="Note">By combining the linear in the first argument property with the conjugate symmetry property you get conjugate-linear in the second argument: <math display="inline"> \langle x,by \rangle = \langle x,y \rangle \overline{b} </math>. This is how the inner product was originally defined and is used in most mathematical contexts. A different convention has been adopted in theoretical physics and quantum mechanics, originating in the bra-ket notation of Paul Dirac, where the inner product is taken to be linear in the second argument and conjugate-linear in the first argument; this convention is used in many other domains such as engineering and computer science.</ref> <math display=block>

    \langle ax+by, z \rangle = a \langle x, z \rangle + b  \langle y, z \rangle.</math>

Positive-definiteness: if <math>x</math> is not zero, then <math display=block>

     \langle x, x \rangle > 0

</math> (conjugate symmetry implies that <math>\langle x, x \rangle</math> is real).

If the positive-definiteness condition is replaced by merely requiring that <math>\langle x, x \rangle \geq 0</math> for all <math>x</math>, then one obtains the definition of positive semi-definite Hermitian form. A positive semi-definite Hermitian form <math>\langle \cdot, \cdot \rangle</math> is an inner product if and only if for all <math>x</math>, if <math>\langle x, x \rangle = 0</math> then <math>x = \mathbf 0</math>.Template:Sfn

Basic propertiesEdit

In the following properties, which result almost immediately from the definition of an inner product, Template:Math and Template:Mvar are arbitrary vectors, and Template:Mvar and Template:Mvar are arbitrary scalars.

<math>\langle \mathbf{0}, x \rangle=\langle x,\mathbf{0}\rangle=0.</math>
<math> \langle x, x \rangle</math> is real and nonnegative.
<math>\langle x, x \rangle = 0</math> if and only if <math>x=\mathbf{0}.</math>
<math>\langle x, ay+bz \rangle= \overline a \langle x, y \rangle + \overline b \langle x, z \rangle.</math>
This implies that an inner product is a sesquilinear form.
<math>\langle x + y, x + y \rangle = \langle x, x \rangle + 2\operatorname{Re}(\langle x, y \rangle) + \langle y, y \rangle,</math> where <math>\operatorname{Re}</math>
denotes the real part of its argument.

Over <math>\R</math>, 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 <math display="block">\langle x + y, x + y \rangle = \langle x, x \rangle + 2\langle x, y \rangle + \langle y, y \rangle .</math>

NotationEdit

Several notations are used for inner products, including <math> \langle \cdot, \cdot \rangle </math>, <math> \left ( \cdot, \cdot \right ) </math>, <math> \langle \cdot | \cdot \rangle </math> and <math> \left ( \cdot | \cdot \right ) </math>, as well as the usual dot product.

Convention variantEdit

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. <math> \langle \cdot | \cdot \rangle </math>, where <math> \langle x | y \rangle := \left ( y, x \right ) </math>.

ExamplesEdit

Real and complex numbersEdit

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

The complex numbers <math>\Complex</math> are a vector space over <math>\Complex</math> that becomes an inner product space with the inner product <math display=block>\langle x, y \rangle := x \overline{y} \quad \text{ for } x, y \in \Complex.</math> Unlike with the real numbers, the assignment <math>(x, y) \mapsto x y</math> does Template:Em define a complex inner product on <math>\Complex.</math>

Euclidean vector spaceEdit

More generally, the real <math>n</math>-space <math>\R^n</math> with the dot product is an inner product space, an example of a Euclidean vector space. <math display=block> \left\langle

 \begin{bmatrix} x_1 \\ \vdots \\ x_n \end{bmatrix},
 \begin{bmatrix} y_1 \\ \vdots \\ y_n \end{bmatrix}

\right\rangle = x^\textsf{T} y = \sum_{i=1}^n x_i y_i = x_1 y_1 + \cdots + x_n y_n, </math> where <math>x^{\operatorname{T}}</math> is the transpose of <math>x.</math>

A function <math>\langle \,\cdot, \cdot\, \rangle : \R^n \times \R^n \to \R</math> is an inner product on <math>\R^n</math> if and only if there exists a symmetric positive-definite matrix <math>\mathbf{M}</math> such that <math>\langle x, y \rangle = x^{\operatorname{T}} \mathbf{M} y</math> for all <math>x, y \in \R^n.</math> If <math>\mathbf{M}</math> is the identity matrix then <math>\langle x, y \rangle = x^{\operatorname{T}} \mathbf{M} y</math> is the dot product. For another example, if <math>n = 2</math> and <math>\mathbf{M} = \begin{bmatrix} a & b \\ b & d \end{bmatrix}</math> is positive-definite (which happens if and only if <math>\det \mathbf{M} = a d - b^2 > 0</math> and one/both diagonal elements are positive) then for any <math>x := \left[x_1, x_2\right]^{\operatorname{T}}, y := \left[y_1, y_2\right]^{\operatorname{T}} \in \R^2,</math> <math display=block>\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.</math> As mentioned earlier, every inner product on <math>\R^2</math> is of this form (where <math>b \in \R, a > 0</math> and <math>d > 0</math> satisfy <math>a d > b^2</math>).

Complex coordinate spaceEdit

The general form of an inner product on <math>\Complex^n</math> is known as the Hermitian form and is given by <math display=block>\langle x, y \rangle = y^\dagger \mathbf{M} x = \overline{x^\dagger \mathbf{M} y},</math> where <math>M</math> is any Hermitian positive-definite matrix and <math>y^{\dagger}</math> is the conjugate transpose of <math>y.</math> 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 spaceEdit

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 <math>C([a, b])</math> of continuous complex valued functions <math>f</math> and <math>g</math> on the interval <math>[a, b].</math> The inner product is <math display=block>\langle f, g \rangle = \int_a^b f(t) \overline{g(t)} \, \mathrm{d}t.</math> This space is not complete; consider for example, for the interval Template:Closed-closed the sequence of continuous "step" functions, <math>\{ f_k \}_k,</math> defined by: <math display=block>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}</math>

This sequence is a Cauchy sequence for the norm induced by the preceding inner product, which does not converge to a Template:Em function.

Random variablesEdit

For real random variables <math>X</math> and <math>Y,</math> the expected value of their product <math display="block">\langle X, Y \rangle = \mathbb{E}[XY]</math> is an inner product.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref><ref>Template:Cite thesis</ref> In this case, <math>\langle X, X \rangle = 0</math> if and only if <math>\mathbb{P}[X = 0] = 1</math> (that is, <math>X = 0</math> almost surely), where <math>\mathbb{P}</math> denotes the probability of the event. This definition of expectation as inner product can be extended to random vectors as well.

Complex matricesEdit

The inner product for complex square matrices of the same size is the Frobenius inner product <math>\langle A, B \rangle := \operatorname{tr}\left(AB^\dagger\right)</math>. 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, <math display=block>\langle A, B \rangle = \operatorname{tr}\left(AB^\dagger\right) = \overline{\operatorname{tr}\left(BA^\dagger\right)} = \overline{\left\langle B,A \right\rangle}</math> Finally, since for <math>A</math> nonzero, <math>\langle A, A\rangle = \sum_{ij} \left|A_{ij}\right|^2 > 0 </math>, we get that the Frobenius inner product is positive definite too, and so is an inner product.

Vector spaces with formsEdit

On an inner product space, or more generally a vector space with a nondegenerate form (hence an isomorphism <math>V \to V^*</math>), 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 definitionsEdit

Norm properties Template:AnchorEdit

Every inner product space induces a norm, called its Template:Em, that is defined by <math display=block>\|x\| = \sqrt{\langle x, x \rangle}.</math> 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:

Template:Glossary Template:Term Template:Defn Template:Term Template:Defn

Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end

OrthogonalityEdit

Template:Glossary Template:Term Template:Defn{\|y\|^2}</math> minimizes <math>f</math> with value <math>f\left(s_0\right) = - \tfrac{|\langle x, y \rangle|^2}{\|y\|^2},</math> which is always non positive).

For a Template:Em inner product space <math>H,</math> a linear operator <math>T : V \to V</math> is identically <math>0</math> if and only if <math>x \perp T x</math> for every <math>x \in V.</math>Template:Sfn This is not true in general for real inner product spaces, as it is a consequence of conjugate symmetry being distinct from symmetry for complex inner products. A counterexample in a real inner product space is <math>T</math> a 90° rotation in <math>\mathbb{R}^2</math>, which maps every vector to an orthogonal vector but is not identically <math>0</math>. }} Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Anchor Template:Term Template:Defn Template:Glossary end

Real and complex parts of inner productsEdit

Suppose that <math>\langle \cdot, \cdot \rangle</math> is an inner product on <math>V</math> (so it is antilinear in its second argument). The polarization identity shows that the real part of the inner product is <math display=block>\operatorname{Re} \langle x, y \rangle = \frac{1}{4} \left(\|x + y\|^2 - \|x - y\|^2\right).</math>

If <math>V</math> is a real vector space then <math display=block>\langle x, y \rangle = \operatorname{Re} \langle x, y \rangle = \frac{1}{4} \left(\|x + y\|^2 - \|x - y\|^2\right)</math> and the imaginary part (also called the Template:Em) of <math>\langle \cdot, \cdot \rangle</math> is always <math>0.</math>

Assume for the rest of this section that <math>V</math> is a complex vector space. The polarization identity for complex vector spaces shows that <math display="block">\begin{alignat}{4} \langle x, \ y \rangle &= \frac{1}{4} \left(\|x + y\|^2 - \|x - y\|^2 + i\|x + iy\|^2 - i\|x - iy\|^2 \right) \\ &= \operatorname{Re} \langle x, y \rangle + i \operatorname{Re} \langle x, i y \rangle. \\ \end{alignat}</math>

The map defined by <math>\langle x \mid y \rangle = \langle y, x \rangle</math> for all <math>x, y \in V</math> satisfies the axioms of the inner product except that it is antilinear in its Template:Em, rather than its second, argument. The real part of both <math>\langle x \mid y \rangle</math> and <math>\langle x, y \rangle</math> are equal to <math>\operatorname{Re} \langle x, y \rangle</math> but the inner products differ in their complex part: <math display="block">\begin{alignat}{4} \langle x \mid y \rangle &= \frac{1}{4} \left(\|x + y\|^2 - \|x - y\|^2 - i\|x + iy\|^2 + i\|x - iy\|^2 \right) \\ &= \operatorname{Re} \langle x, y \rangle - i \operatorname{Re} \langle x, i y \rangle. \\ \end{alignat}</math>

The last equality is similar to the formula expressing a linear functional in terms of its real part.

These formulas show that every complex inner product is completely determined by its real part. Moreover, this real part defines an inner product on <math>V,</math> considered as a real vector space. There is thus a one-to-one correspondence between complex inner products on a complex vector space <math>V,</math> and real inner products on <math>V.</math>

For example, suppose that <math>V = \Complex^n </math> for some integer <math>n > 0.</math> When <math>V</math> is considered as a real vector space in the usual way (meaning that it is identified with the <math>2 n-</math>dimensional real vector space <math>\R^{2n},</math> with each <math>\left(a_1 + i b_1, \ldots, a_n + i b_n\right) \in \Complex^n</math> identified with <math>\left(a_1, b_1, \ldots, a_n, b_n\right) \in \R^{2n}</math>), then the dot product <math>x \,\cdot\, y = \left(x_1, \ldots, x_{2n}\right) \, \cdot \, \left(y_1, \ldots, y_{2n}\right) := x_1 y_1 + \cdots + x_{2n} y_{2n}</math> defines a real inner product on this space. The unique complex inner product <math>\langle \,\cdot, \cdot\, \rangle</math> on <math>V = \C^n</math> induced by the dot product is the map that sends <math>c = \left(c_1, \ldots, c_n\right), d = \left(d_1, \ldots, d_n\right) \in \Complex^n</math> to <math>\langle c, d \rangle := c_1 \overline{d_1} + \cdots + c_n \overline{d_n}</math> (because the real part of this map <math>\langle \,\cdot, \cdot\, \rangle</math> is equal to the dot product).

Real vs. complex inner productsEdit

Let <math>V_{\R}</math> denote <math>V</math> considered as a vector space over the real numbers rather than complex numbers. The real part of the complex inner product <math>\langle x, y \rangle</math> is the map <math>\langle x, y \rangle_{\R} = \operatorname{Re} \langle x, y \rangle ~:~ V_{\R} \times V_{\R} \to \R,</math> which necessarily forms a real inner product on the real vector space <math>V_{\R}.</math> Every inner product on a real vector space is a bilinear and symmetric map.

For example, if <math>V = \Complex</math> with inner product <math>\langle x, y \rangle = x \overline{y},</math> where <math>V</math> is a vector space over the field <math>\Complex,</math> then <math>V_{\R} = \R^2</math> is a vector space over <math>\R</math> and <math>\langle x, y \rangle_{\R}</math> is the dot product <math>x \cdot y,</math> where <math>x = a + i b \in V = \Complex</math> is identified with the point <math>(a, b) \in V_{\R} = \R^2</math> (and similarly for <math>y</math>); thus the standard inner product <math>\langle x, y \rangle = x \overline{y},</math> on <math>\Complex</math> is an "extension" the dot product . Also, had <math>\langle x, y \rangle</math> been instead defined to be the Template:EquationNote <math>\langle x, y \rangle = x y</math> (rather than the usual Template:EquationNote <math>\langle x, y \rangle = x \overline{y}</math>) then its real part <math>\langle x, y \rangle_{\R}</math> would Template:Em be the dot product; furthermore, without the complex conjugate, if <math>x \in \C</math> but <math>x \not\in \R</math> then <math>\langle x, x \rangle = x x = x^2 \not\in [0, \infty)</math> so the assignment <math display="inline">x \mapsto \sqrt{\langle x, x \rangle}</math> would not define a norm.

The next examples show that although real and complex inner products have many properties and results in common, they are not entirely interchangeable. For instance, if <math>\langle x, y \rangle = 0</math> then <math>\langle x, y \rangle_{\R} = 0,</math> but the next example shows that the converse is in general Template:Em true. Given any <math>x \in V,</math> the vector <math>i x</math> (which is the vector <math>x</math> rotated by 90°) belongs to <math>V</math> and so also belongs to <math>V_{\R}</math> (although scalar multiplication of <math>x</math> by <math>i = \sqrt{-1}</math> is not defined in <math>V_{\R},</math> the vector in <math>V</math> denoted by <math>i x</math> is nevertheless still also an element of <math>V_{\R}</math>). For the complex inner product, <math>\langle x, ix \rangle = -i \|x\|^2,</math> whereas for the real inner product the value is always <math>\langle x, ix \rangle_{\R} = 0.</math>

If <math>\langle \,\cdot, \cdot\, \rangle</math> is a complex inner product and <math>A : V \to V</math> is a continuous linear operator that satisfies <math>\langle x, A x \rangle = 0</math> for all <math>x \in V,</math> then <math>A = 0.</math> This statement is no longer true if <math>\langle \,\cdot, \cdot\, \rangle</math> is instead a real inner product, as this next example shows. Suppose that <math>V = \Complex</math> has the inner product <math>\langle x, y \rangle := x \overline{y}</math> mentioned above. Then the map <math>A : V \to V</math> defined by <math>A x = ix</math> is a linear map (linear for both <math>V</math> and <math>V_{\R}</math>) that denotes rotation by <math>90^{\circ}</math> in the plane. Because <math>x</math> and <math>A x</math> are perpendicular vectors and <math>\langle x, Ax \rangle_{\R}</math> is just the dot product, <math>\langle x, Ax \rangle_{\R} = 0</math> for all vectors <math>x;</math> nevertheless, this rotation map <math>A</math> is certainly not identically <math>0.</math> In contrast, using the complex inner product gives <math>\langle x, Ax \rangle = -i \|x\|^2,</math> which (as expected) is not identically zero.

Orthonormal sequencesEdit

Template:See also

Let <math>V</math> be a finite dimensional inner product space of dimension <math>n.</math> Recall that every basis of <math>V</math> consists of exactly <math>n</math> linearly independent vectors. Using the Gram–Schmidt process we may start with an arbitrary basis and transform it into an orthonormal basis. That is, into a basis in which all the elements are orthogonal and have unit norm. In symbols, a basis <math>\{e_1, \ldots, e_n\}</math> is orthonormal if <math>\langle e_i, e_j \rangle = 0</math> for every <math>i \neq j</math> and <math>\langle e_i, e_i \rangle = \|e_a\|^2 = 1</math> for each index <math>i.</math>

This definition of orthonormal basis generalizes to the case of infinite-dimensional inner product spaces in the following way. Let <math>V</math> be any inner product space. Then a collection <math display=block>E = \left\{ e_a \right\}_{a \in A}</math> is a Template:Em for <math>V</math> if the subspace of <math>V</math> generated by finite linear combinations of elements of <math>E</math> is dense in <math>V</math> (in the norm induced by the inner product). Say that <math>E</math> is an Template:Em for <math>V</math> if it is a basis and <math display=block>\left\langle e_{a}, e_{b} \right\rangle = 0</math> if <math>a \neq b</math> and <math>\langle e_a, e_a \rangle = \|e_a\|^2 = 1</math> for all <math>a, b \in A.</math>

Using an infinite-dimensional analog of the Gram-Schmidt process one may show:

Theorem. Any separable inner product space has an orthonormal basis.

Using the Hausdorff maximal principle and the fact that in a complete inner product space orthogonal projection onto linear subspaces is well-defined, one may also show that

Theorem. Any complete inner product space has an orthonormal basis.

The two previous theorems raise the question of whether all inner product spaces have an orthonormal basis. The answer, it turns out is negative. This is a non-trivial result, and is proved below. The following proof is taken from Halmos's A Hilbert Space Problem Book (see the references).Template:Citation needed

Proof

Recall that the dimension of an inner product space is the cardinality of a maximal orthonormal system that it contains (by Zorn's lemma it contains at least one, and any two have the same cardinality). An orthonormal basis is certainly a maximal orthonormal system but the converse need not hold in general. If <math>G</math> is a dense subspace of an inner product space <math>V,</math> then any orthonormal basis for <math>G</math> is automatically an orthonormal basis for <math>V.</math> Thus, it suffices to construct an inner product space <math>V</math> with a dense subspace <math>G</math> whose dimension is strictly smaller than that of <math>V.</math>

Let <math>K</math> be a Hilbert space of dimension <math>\aleph_0.</math> (for instance, <math>K = \ell^2(\N)</math>). Let <math>E</math> be an orthonormal basis of <math>K,</math> so <math>|E| = \aleph_0.</math> Extend <math>E</math> to a Hamel basis <math>E \cup F</math> for <math>K,</math>where <math>E \cap F = \varnothing.</math> Since it is known that the Hamel dimension of <math>K</math> is <math>c,</math> the cardinality of the continuum, it must be that <math>|F| = c.</math>

Let <math>L</math> be a Hilbert space of dimension <math>c</math> (for instance, <math>L = \ell^2(\R)</math>). Let <math>B</math> be an orthonormal basis for <math>L</math> and let <math>\varphi : F \to B</math> be a bijection. Then there is a linear transformation <math>T : K \to L</math> such that <math>T f = \varphi(f)</math> for <math>f \in F,</math> and <math>Te = 0</math> for <math>e \in E.</math>

Let <math>V = K \oplus L</math> and let <math>G = \{ (k, T k) : k \in K \}</math> be the graph of <math>T.</math> Let <math>\overline{G}</math> be the closure of <math>G</math> in <math>V</math>; we will show <math>\overline{G} = V.</math> Since for any <math>e \in E</math> we have <math>(e, 0) \in G,</math> it follows that <math>K \oplus 0 \subseteq \overline{G}.</math>

Next, if <math>b \in B,</math> then <math>b = T f</math> for some <math>f \in F \subseteq K,</math> so <math>(f, b) \in G \subseteq \overline{G}</math>; since <math>(f, 0) \in \overline{G}</math> as well, we also have <math>(0, b) \in \overline{G}.</math> It follows that <math>0 \oplus L \subseteq \overline{G},</math> so <math>\overline{G} = V,</math> and <math>G</math> is dense in <math>V.</math>

Finally, <math>\{(e, 0) : e \in E \}</math> is a maximal orthonormal set in <math>G</math>; if <math display=block>0 = \langle (e, 0), (k, Tk) \rangle = \langle e, k \rangle + \langle 0, Tk \rangle = \langle e, k \rangle</math> for all <math>e \in E</math> then <math>k = 0,</math> so <math>(k, Tk) = (0, 0)</math> is the zero vector in <math>G.</math> Hence the dimension of <math>G</math> is <math>|E| = \aleph_0,</math> whereas it is clear that the dimension of <math>V</math> is <math>c.</math> This completes the proof.

Parseval's identity leads immediately to the following theorem:

Theorem. Let <math>V</math> be a separable inner product space and <math>\left\{e_k\right\}_k</math> an orthonormal basis of <math>V.</math> Then the map <math display=block>x \mapsto \bigl\{\langle e_k, x \rangle\bigr\}_{k \in \N}</math> is an isometric linear map <math>V \rightarrow \ell^2</math> 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 <math>\ell^2</math> 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 <math>V</math> be the inner product space <math>C[-\pi, \pi].</math> Then the sequence (indexed on set of all integers) of continuous functions <math display=block>e_k(t) = \frac{e^{i k t}}{\sqrt{2 \pi}}</math> is an orthonormal basis of the space <math>C[-\pi, \pi]</math> with the <math>L^2</math> inner product. The mapping <math display=block>f \mapsto \frac{1}{\sqrt{2 \pi}} \left\{\int_{-\pi}^\pi f(t) e^{-i k t} \, \mathrm{d}t \right\}_{k \in \Z}</math> is an isometric linear map with dense image.

Orthogonality of the sequence <math>\{ e_k \}_k</math> follows immediately from the fact that if <math>k \neq j,</math> then <math display=block>\int_{-\pi}^\pi e^{-i (j - k) t} \, \mathrm{d}t = 0.</math>

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 Template:Em, follows from the fact that the sequence has a dense algebraic span, this time in the space of continuous periodic functions on <math>[-\pi, \pi]</math> with the uniform norm. This is the content of the Weierstrass theorem on the uniform density of trigonometric polynomials.

Operators on inner product spacesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Several types of linear maps <math>A : V \to W</math> between inner product spaces <math>V</math> and <math>W</math> are of relevance:

Template:Em: <math>A : V \to W</math> is linear and continuous with respect to the metric defined above, or equivalently, <math>A</math> is linear and the set of non-negative reals <math>\{ \|Ax\| : \|x\| \leq 1\},</math> where <math>x</math> ranges over the closed unit ball of <math>V,</math> is bounded.
Template:Em: <math>A : V \to W</math> is linear and <math>\langle Ax, y \rangle = \langle x, Ay \rangle</math> for all <math>x, y \in V.</math>
Template:Em: <math>A : V \to W</math> satisfies <math>\|A x\| = \|x\|</math> for all <math>x \in V.</math> A Template:Em (resp. an Template:Em) 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 <math>A</math> is an isometry if and only if <math>\langle Ax, Ay \rangle = \langle x, y \rangle</math> for all <math>x, y \in V.</math> All isometries are injective. The Mazur–Ulam theorem establishes that every surjective isometry between two Template:Em normed spaces is an affine transformation. Consequently, an isometry <math>A</math> between real inner product spaces is a linear map if and only if <math>A(0) = 0.</math> Isometries are morphisms between inner product spaces, and morphisms of real inner product spaces are orthogonal transformations (compare with orthogonal matrix).
Template:Em: <math>A : V \to W</math> 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.<ref>Template:Harvnb</ref>

GeneralizationsEdit

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 productsEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} If <math>V</math> is a vector space and <math>\langle \,\cdot\,, \,\cdot\, \rangle</math> a semi-definite sesquilinear form, then the function: <math display=block>\|x\| = \sqrt{\langle x, x\rangle}</math> makes sense and satisfies all the properties of norm except that <math>\|x\| = 0</math> does not imply <math>x = 0</math> (such a functional is then called a semi-norm). We can produce an inner product space by considering the quotient <math>W = V / \{x : \|x\| = 0\}.</math> The sesquilinear form <math>\langle \,\cdot\,, \,\cdot\, \rangle</math> factors through <math>W.</math>

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 formsEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Alternatively, one may require that the pairing be a nondegenerate form, meaning that for all non-zero <math>x \neq 0</math> there exists some <math>y</math> such that <math>\langle x, y \rangle \neq 0,</math> though <math>y</math> need not equal <math>x</math>; in other words, the induced map to the dual space <math>V \to V^*</math> 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 Template:Em 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 <math>V \to V^*</math>) and thus hold more generally.

Related productsEdit

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 <math>1 \times n</math> Template:Em with an <math>n \times 1</math> vector, yielding a <math>1 \times 1</math> matrix (a scalar), while the outer product is the product of an <math>m \times 1</math> vector with a <math>1 \times n</math> covector, yielding an <math>m \times n</math> 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 Template:Em 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 <math>W \times V^* \to \hom(V, W)</math> 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 <math>V^* \times V \to F</math> 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 Template:Em (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 Template:Em (alternatively, Template:Em). The inner product is more correctly called a Template:Em product in this context, as the nondegenerate quadratic form in question need not be positive definite (need not be an inner product).

NotesEdit

Template:Reflist

ReferencesEdit