Inner product space

For the scalar product or dot product of coordinate vectors, see dot product.

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

Scalar Product Spaces, Inner Product Spaces, Hermitian Product Spaces.

Scalar Product Spaces, over any field, have "scalar products" that are symmetrical and linear in the first(by convention) 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(by convention). Inner Product Spaces may be defined over any field, having "inner products" that are linear in the first(by convention) argument, conjugate-symmetrical, and positive-definite. Unlike Inner Products, Scalar Products and Hermitian Products need not be positive-definite.

In linear algebra, an inner product space is a vector space with an additional structure called an inner product. This additional structure associates each pair of vectors in the space with a scalar quantity known as the inner product of the vectors. Inner products allow the rigorous introduction of intuitive geometrical notions such as the length of a vector or the angle between two vectors. They also provide the means of defining orthogonality between vectors (zero inner product). Inner product spaces generalize Euclidean spaces (in which the inner product is the dot product, also known as the scalar product) to vector spaces of any (possibly infinite) dimension, and are studied in functional analysis.

An inner product naturally induces an associated norm, thus an inner product space is also a normed vector space. A complete space with an inner product is called a Hilbert space. An (incomplete) space with an inner product is called a pre-Hilbert space, since its completion with respect to the norm induced by the inner product is a Hilbert space. Inner product spaces over the field of complex numbers are sometimes referred to as unitary spaces.

Definition

In this article, the field of scalars denoted $F$ is either the field of real numbers $R$ or the field of complex numbers $C$ .

Formally, an inner product space is a vector space $V$ over the field $F$ together with an inner product, i.e., with a map

\langle \cdot ,\cdot \rangle :V\times V\to F

that satisfies the following three axioms for all vectors $x,y,z\in V$ and all scalars $a\in F$ :^[1]^[2]

Conjugate symmetry:^{[Note 1]}

\langle x,y\rangle ={\overline {\langle y,x\rangle }}

Linearity in the first argument:

\langle ax,y\rangle =a\langle x,y\rangle

\langle x+y,z\rangle =\langle x,z\rangle +\langle y,z\rangle

Positive-definiteness:

\langle x,x\rangle \geq 0

\langle x,x\rangle =0\Leftrightarrow x=\mathbf {0}

Alternative definitions, notations and remarks

Some authors, especially in physics and matrix algebra, prefer to define the inner product and the sesquilinear form with linearity in the second argument rather than the first. Then the first argument becomes conjugate linear, rather than the second. In those disciplines we would write the product $\langle x,y\rangle$ as $\langle y|x\rangle$ (the bra–ket notation of quantum mechanics), respectively $y^{\dagger }x$ (dot product as a case of the convention of forming the matrix product $AB$ as the dot products of rows of $A$ with columns of $B$ ). Here the kets and columns are identified with the vectors of $V$ and the bras and rows with the dual vectors or linear functionals of the dual space $V *$ , with conjugacy associated with duality. This reverse order is now occasionally followed in the more abstract literature,^[3] taking $\langle x,y\rangle$ to be conjugate linear in $x$ rather than $y$ . A few instead find a middle ground by recognizing both $\langle \cdot ,\cdot \rangle$ and $\langle \cdot |\cdot \rangle$ as distinct notations differing only in which argument is conjugate linear.

There are various technical reasons why it is necessary to restrict the basefield to $R$ and $C$ in the definition. Briefly, the basefield has to contain an ordered subfield in order for non-negativity to make sense,^[4] and therefore has to have characteristic equal to 0 (since any ordered field has to have such characteristic). This immediately excludes finite fields. The basefield has to have additional structure, such as a distinguished automorphism. More generally any quadratically closed subfield of $R$ or $C$ will suffice for this purpose, e.g., the algebraic numbers, but when it is a proper subfield (i.e., neither $R$ nor $C$ ) even finite-dimensional inner product spaces will fail to be metrically complete. In contrast all finite-dimensional inner product spaces over $R$ or $C$ , such as those used in quantum computation, are automatically metrically complete and hence Hilbert spaces.

In some cases we need to consider non-negative semi-definite sesquilinear forms. This means that $\langle x,x\rangle$ is only required to be non-negative. We show how to treat these below.

Elementary properties

When $F = R$ , conjugate symmetry reduces to symmetry. That is, $\langle x,y\rangle =\langle y,x\rangle$ for $F = R$ ; while for $F = C$ , $\langle x,y\rangle$ is equal to the complex conjugate.

Notice that conjugate symmetry implies that $\langle x,x\rangle$ is real for all $x$ , since we have:

\langle x,x\rangle ={\overline {\langle x,x\rangle }}.

Moreover, sesquilinearity (see below) implies that

\langle -x,x\rangle =-1\langle x,x\rangle ={\overline {-1}}\langle x,x\rangle =\langle x,-x\rangle .

Conjugate symmetry and linearity in the first variable gives

\langle x,ay\rangle ={\overline {\langle ay,x\rangle }}={\overline {a}}{\overline {\langle y,x\rangle }}={\overline {a}}\langle x,y\rangle

\langle x,y+z\rangle ={\overline {\langle y+z,x\rangle }}={\overline {\langle y,x\rangle }}+{\overline {\langle z,x\rangle }}=\langle x,y\rangle +\langle x,z\rangle ,

so an inner product is a sesquilinear form. Conjugate symmetry is also called Hermitian symmetry, and a conjugate symmetric sesquilinear form is called a Hermitian form. While the above axioms are more mathematically economical, a compact verbal definition of an inner product is a positive-definite Hermitian form.

In the case of $F = R$ , conjugate-symmetry reduces to symmetry, and sesquilinear reduces to bilinear. So, an inner product on a real vector space is a positive-definite symmetric bilinear form.

From the linearity property it is derived that $x = 0$ implies $\langle x,x\rangle =0,$ while from the positive-definiteness axiom we obtain the converse, $\langle x,x\rangle =0$ implies $x = 0$ . Combining these two, we have the property that $\langle x,x\rangle =0$ if and only if $x = 0$ .

Combining the linearity of the inner product in its first argument and the conjugate symmetry gives the following important generalization of the familiar square expansion:

\langle x+y,x+y\rangle =\langle x,x\rangle +\langle x,y\rangle +\langle y,x\rangle +\langle y,y\rangle .

Assuming the underlying field to be $R$ , the inner product becomes symmetric, and we obtain

\langle x\pm y,x\pm y\rangle =\langle x,x\rangle \pm 2\langle x,y\rangle +\langle y,y\rangle ,

The property of an inner product space $V$ that

\langle x+y,z\rangle =\langle x,z\rangle +\langle y,z\rangle ,

\langle x,y+z\rangle =\langle x,y\rangle +\langle x,z\rangle

is also known as additivity.

Examples

A simple example is the real numbers with the standard multiplication as the inner product

\langle x,y\rangle :=xy.

More generally, the real

n

-space

R n

with the dot product is an inner product space, an example of a Euclidean

n

-space.

\left\langle {\begin{bmatrix}x_{1}\\\vdots \\x_{n}\end{bmatrix}},{\begin{bmatrix}y_{1}\\\vdots \\y_{n}\end{bmatrix}}\right\rangle :=x^{\text{T}}y=\sum _{i=1}^{n}x_{i}y_{i}=x_{1}y_{1}+\cdots +x_{n}y_{n},

where

x T

is the transpose of

x

The general form of an inner product on $C n$ is known as the Hermitian form and is given by

\langle \mathbf {x} ,\mathbf {y} \rangle :=\mathbf {y} ^{\dagger }\mathbf {M} \mathbf {x} ={\overline {\mathbf {x} ^{\dagger }\mathbf {M} \mathbf {y} }},

where

M

is any Hermitian positive-definite matrix and

y †

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. Up to an orthogonal transformation it is a weighted-sum version of the dot product, with positive weights.

The article on Hilbert space 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 which induces an incomplete metric occurs with the space C([a, b]) of continuous complex valued functions on the interval $[a, b]$ . The inner product is

\langle f,g\rangle :=\int _{a}^{b}f(t){\overline {g(t)}}\,dt.

This space is not complete; consider for example, for the interval

[-1,1]

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 continuous function.

For real random variables $X$ and $Y$ , the expected value of their product

\langle X,Y\rangle :=\operatorname {E} (XY)

is an inner product. In this case, <X, X> = 0 if and only if Pr(X = 0) = 1 (i.e., X = 0 almost surely). This definition of expectation as inner product can be extended to random vectors as well.

For real matrices of the same size, $\langle A,B\rangle :=\mathrm {tr} (AB^{\text{T}})$ with transpose as conjugation

\left(\langle A,B\rangle =\langle B^{\text{T}},A^{\text{T}}\rangle \right)

is an inner product.

Norms on inner product spaces

A linear space with a norm such as:

\|x\|_{p}=\left(\sum _{i=1}^{\infty }\left|\xi _{i}\right|^{p}\right)^{\frac {1}{p}}\qquad x=\left\{\xi _{i}\right\}\in \ell ^{p},p\neq 2,

is a normed space but not an inner product space, because this norm does not satisfy the parallelogram equality required of a norm to have an inner product associated with it.^[5]^[6]

However, inner product spaces have a naturally defined norm based upon the inner product of the space itself that does satisfy the parallelogram equality:

\|x\|={\sqrt {\langle x,x\rangle }}.

This is well defined by the nonnegativity axiom of the definition of inner product space. The norm is thought of as the length of the vector $x$ . Directly from the axioms, we can prove the following:

Cauchy–Schwarz inequality: for $x$ , $y$ elements of $V$

|\langle x,y\rangle |\leq \|x\|\cdot \|y\|

with equality if and only if

x

and

y

are linearly dependent. This is one of the most important inequalities in mathematics. It is also known in the Russian mathematical literature as the Cauchy–Bunyakovsky–Schwarz inequality.

Orthogonality: The geometric interpretation of the inner product in terms of angle and length, motivates much of the geometric terminology we use in regard to these spaces. Indeed, an immediate consequence of the Cauchy–Schwarz inequality is that it justifies defining the angle between two non-zero vectors $x$ and $y$ in the case $F = R$ by the identity

\operatorname {angle} (x,y)=\arccos {\frac {\langle x,y\rangle }{\|x\|\cdot \|y\|}}.

We assume the value of the angle is chosen to be in the interval

[0, π]

. This is in analogy to the situation in two-dimensional Euclidean space.

In the case

F = C

, the angle in the interval

[0, π/2]

is typically defined by

\operatorname {angle} (x,y)=\arccos {\frac {|\langle x,y\rangle |}{\|x\|\cdot \|y\|}}.

Correspondingly, we will say that non-zero vectors

x

and

y

V

are orthogonal if and only if their inner product is zero.

Homogeneity: for $x$ an element of $V$ and $r$ a scalar

\|r\cdot x\|=|r|\cdot \|x\|.

The homogeneity property is completely trivial to prove.

Triangle inequality: for $x$ , $y$ elements of $V$

\|x+y\|\leq \|x\|+\|y\|.

The last two properties show the function defined is indeed a norm.

Because of the triangle inequality and because of axiom 2, we see that ||·|| is a norm which turns

V

into a normed vector space and hence also into a metric space. The most important inner product spaces are the ones which are complete with respect to this metric; they are called Hilbert spaces. Every inner product

V

space is a dense subspace of some Hilbert space. This Hilbert space is essentially uniquely determined by

V

and is constructed by completing

V

Pythagorean theorem: Whenever $x$ , $y$ are in V and ⟨x, y⟩ = 0, then

\|x\|^{2}+\|y\|^{2}=\|x+y\|^{2}.

The proof of the identity requires only expressing the definition of norm in terms of the inner product and multiplying out, using the property of additivity of each component.

The name Pythagorean theorem arises from the geometric interpretation of this result as an analogue of the theorem in synthetic geometry. Note that the proof of the Pythagorean theorem in synthetic geometry is considerably more elaborate because of the paucity of underlying structure. In this sense, the synthetic Pythagorean theorem, if correctly demonstrated, is deeper than the version given above.

An induction on the Pythagorean theorem yields:

If x₁, ..., x_n are orthogonal vectors, that is, $\langle x_{j},x_{k}\rangle =0$ for distinct indices $j$ , $k$ , then

\sum _{i=1}^{n}\|x_{i}\|^{2}=\left\|\sum _{i=1}^{n}x_{i}\right\|^{2}.

In view of the Cauchy-Schwarz inequality, we also note that

\langle \cdot ,\cdot \rangle

is continuous from

V \times V

F

. This allows us to extend Pythagoras' theorem to infinitely many summands:

Parseval's identity: Suppose $V$ is a complete inner product space. If {x_k} are mutually orthogonal vectors in $V$ then

\sum _{i=1}^{\infty }\|x_{i}\|^{2}=\left\|\sum _{i=1}^{\infty }x_{i}\right\|^{2},

provided the infinite series on the left is convergent. Completeness of the space is needed to ensure that the sequence of partial sums

S_{k}=\sum _{i=1}^{k}x_{i},

which is easily shown to be a Cauchy sequence, is convergent.

Parallelogram law: for $x$ , $y$ elements of $V$ ,

\|x+y\|^{2}+\|x-y\|^{2}=2\|x\|^{2}+2\|y\|^{2}.

The Parallelogram law is, in fact, a necessary and sufficient condition for the existence of a scalar product corresponding to a given norm. If it holds, the scalar product is defined by the polarization identity:

\|x+y\|^{2}=\|x\|^{2}+\|y\|^{2}+2\Re \langle x,y\rangle .

which is a form of the law of cosines.

Orthonormal sequences

Let $V$ be a finite dimensional inner product space of dimension $n$ . Recall that every basis of $V$ consists of exactly $n$ 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 $\textstyle {\{e_{1},\ldots ,e_{n}\}}$ is orthonormal if $\textstyle \langle e_{i},e_{j}\rangle =0$ if $\textstyle i\neq j$ and $\textstyle \langle e_{i},e_{i}\rangle =\|e_{i}\|=1$ for each i.

This definition of orthonormal basis generalizes to the case of infinite-dimensional inner product spaces in the following way. Let $V$ be any inner product space. Then a collection

E=\left\{e_{\alpha }\right\}_{\alpha \in A}

is a basis for $V$ if the subspace of $V$ generated by finite linear combinations of elements of $E$ is dense in $V$ (in the norm induced by the inner product). We say that $E$ is an orthonormal basis for $V$ if it is a basis and

\left\langle e_{\alpha },e_{\beta }\right\rangle =0

if $\textstyle \alpha \neq \beta$ and $\textstyle \langle e_{\alpha },e_{\alpha }\rangle =\|e_{\alpha }\|=1$ for all $\textstyle \alpha ,\beta \in A$ .

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

Theorem. Any separable inner product space $V$ 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 $V$ 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).

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 as we shall see, the converse need not hold. Observe that if

G

is a dense subspace of an inner product space

H

, then any orthonormal basis for

G

is automatically an orthonormal basis for

H

. Thus, it suffices to construct an inner product space

H

with a dense subspace

G

whose dimension is strictly smaller than that of

H

Let $K$ be a Hilbert space of dimension $\aleph _{0}$ (for instance, $K = ℓ 2 (N)$ ). Let $E$ be an orthonormal basis of $K$ , so $|E|=\aleph _{0}$ . Extend $E$ to a Hamel basis $E\cup F$ for $K$ , where $E\cap F=\emptyset$ . Since it is known that the Hamel dimension of $K$ is $c$ , the cardinality of the continuum, it must be that $|F|=c$ .

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

Let $H=K\oplus L$ and let $G=\{(k,Tk):k\in K)\}$ be the graph of $T$ . Let ${\bar {G}}$ be the closure of $G$ in $H$ ; we will show ${\bar {G}}=H$ . Since for any $e\in E$ we have $(e,0)\in G$ , it follows that $K\oplus 0\subset {\bar {G}}$ .

Next, if $b\in B$ , then $b=Tf$ for some $f\in F\subset K$ , so $(f,b)\in G\subset {\bar {G}}$ ; since $(f,0)\in {\bar {G}}$ as well, we also have $(0,b)\in {\bar {G}}$ . It follows that $0\oplus L\subset {\bar {G}}$ , so ${\bar {G}}=H$ , and $G$ is dense in $H$ .

Finally, $\{(e,0):e\in E\}$ is a maximal orthonormal set in $G$ ; if

0=\langle (e,0),(k,Tk)\rangle =\langle e,k\rangle +\langle 0,Tk\rangle =\langle e,k\rangle

for all $e\in E$ then certainly $k=0$ , so $(k,Tk)=(0,0)$ is the zero vector in $G$ . Hence the dimension of $G$ is $|E|=\aleph _{0}$ , whereas it is clear that the dimension of $H$ is $c$ . This completes the proof.

Parseval's identity leads immediately to the following theorem:

Theorem. Let $V$ be a separable inner product space and {e_k}_k an orthonormal basis of $V$ . Then the map

x\mapsto \{\langle e_{k},x\rangle \}_{k\in \mathbb {N} }

is an isometric linear map $V \to ℓ 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 $ℓ 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^{ikt}}{\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^{-ikt}\,dt\right\}_{k\in \mathbb {Z} }

is an isometric linear map with dense image.

Orthogonality of the sequence {e_k}_k follows immediately from the fact that if k ≠ j, then

\int _{-\pi }^{\pi }e^{-i(j-k)t}\,dt=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 inner product norm, 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$ from an inner product space $V$ to an inner product space $W$ are of relevance:

Continuous linear maps, i.e., $A$ is linear and continuous with respect to the metric defined above, or equivalently, $A$ is linear and the set of non-negative reals ${‖ Ax ‖}$ , where $x$ ranges over the closed unit ball of $V$ , is bounded.
Symmetric linear operators, i.e., $A$ is linear and $\langle Ax,y\rangle =\langle x,Ay\rangle$ for all $x$ , $y$ in $V$ .
Isometries, i.e., $A$ is linear and $\langle Ax,Ay\rangle =\langle x,y\rangle$ for all $x$ , $y$ in $V$ , or equivalently, $A$ is linear and $‖ Ax ‖ = ‖ x ‖$ for all $x$ in $V$ . All isometries are injective. Isometries are morphisms between inner product spaces, and morphisms of real inner product spaces are orthogonal transformations (compare with orthogonal matrix).
Isometrical isomorphisms, i.e., $A$ 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 ,\cdots \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

Main article: Pseudo-Euclidean space

Alternatively, one may require that the pairing be a nondegenerate form, meaning that for all non-zero $x$ 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 nonzero 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.

Related products

The term "inner product" is opposed to outer product, which is a slightly more general opposite. Simply, in coordinates, the inner product is the product of a 1×n covector with an n×1 vector, yielding a 1×1 matrix (a scalar), while the outer product is the product of an m×1 vector with a 1×n covector, yielding an m×n matrix. Note that 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 trace of the outer product (trace only being properly defined for square matrices).

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

In a quip: "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 \operatorname {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 exterior (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 "outer (alternatively, wedge) product". The inner product is more correctly called a scalar product in this context, as the nondegenerate quadratic form in question need not be positive definite (need not be an inner product).

Notes

↑ A bar over an expression denotes complex conjugation.

References

↑ P. K. Jain, Khalil Ahmad (1995). "5.1 Definitions and basic properties of inner product spaces and Hilbert spaces". Functional analysis (2nd ed.). New Age International. p. 203. ISBN 81-224-0801-X.
↑ Eduard Prugovec̆ki (1981). "Definition 2.1". Quantum mechanics in Hilbert space (2nd ed.). Academic Press. pp. 18 ff. ISBN 0-12-566060-X.
↑ Emch, Gerard G. (1972). Algebraic methods in statistical mechanics and quantum field theory. New York: Wiley-Interscience. ISBN 978-0-471-23900-0.
↑ Finkbeiner, Daniel T. (2013), Introduction to Matrices and Linear Transformations, Dover Books on Mathematics (3rd ed.), Courier Dover Publications, p. 242, ISBN 9780486279664 .
↑ P. K. Jain, Khalil Ahmad (1995). "Example 5". Cited work. p. 209. ISBN 81-224-0801-X.
↑ Karen Saxe (2002). Beginning functional analysis. Springer. p. 7. ISBN 0-387-95224-1.

Sources

Axler, Sheldon (1997). Linear Algebra Done Right (2nd ed.). Berlin, New York: Springer-Verlag. ISBN 978-0-387-98258-8.
Emch, Gerard G. (1972). Algebraic methods in statistical mechanics and quantum field theory. Wiley-Interscience. ISBN 978-0-471-23900-0.
Young, Nicholas (1988). An introduction to Hilbert space. Cambridge University Press. ISBN 978-0-521-33717-5.

Linear algebra

Basic concepts	Scalar Vector Vector space Scalar multiplication Vector projection Linear span Linear map Linear projection Linear independence Linear combination Basis Column space Row space Dual space Orthogonality Kernel Eigenvalues and eigenvectors Outer product Inner product space Dot product Transpose Gram–Schmidt process Linear equations

Vector algebra	Cross product Triple product Seven-dimensional cross product

Multilinear algebra	Geometric algebra Exterior algebra Bivector Multivector

Matrices	Block Decomposition Invertible Minor Multiplication Rank Transformation Cramer's rule Gaussian elimination

Numerical	Floating point Matrix Laboratory Numerical stability Basic Linear Algebra Subprograms (BLAS) Sparse matrix Comparison of linear algebra libraries Comparison of numerical analysis software

This article is issued from Wikipedia - version of the 10/9/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.