This file defines real inner product space and proves its basic properties.
An inner product space is a vector space endowed with an inner product. It generalizes the notion of dot product in ℝ^n and provides the means of defining the length of a vector and the angle between two vectors. In particular vectors x and y are orthogonal if their inner product equals zero.
Existence of orthogonal projection onto nonempty complete subspace: Let u be a point in an inner product space, and let K be a nonempty complete subspace. Then there exists a unique v in K that minimizes the distance ∥u - v∥ to u. The point v is usually called the orthogonal projection of u onto K.
We decide to develop the theory of real inner product spaces and that of complex inner product spaces separately.
inner product space, norm, orthogonal projection
The Coq code is available at the following address: http://www.lri.fr/~sboldo/elfic/index.html
An inner product space is a real vector space with an additional operation called inner product. Inner product spaces over complex vector space will be defined in another file.
Expand inner (x + y) (x + y)
Expand inner (x - y) (x - y)
Parallelogram law
Cauchy–Schwarz inequality
An inner product naturally induces a norm.
Expand the square
Same lemma as above but in a different form
Expand the square
Same lemma as above but in a different form
Cauchy–Schwarz inequality with norm
An inner product space forms a normed group w.r.t. its associated norm.
An inner product space forms a normed space over reals w.r.t. its associated norm.
Existence of minimizers Let u be a point in an inner product space, and let K be a nonempty complete convex subset. Then there exists a unique v in K that minimizes the distance ∥u - v∥ to u.
Characterization of minimizers in the above theorem
Existence of minimizers. Let u be a point in an inner product space, and let K be a nonempty complete subspace. Then there exists a unique v in K that minimizes the distance ∥u - v∥ to u. This point v is usually called the orthogonal projection of u onto K.
Characterization of minimizers in the above theorem. Let u be a point in an inner product space, and let K be a nonempty subspace. Then point v minimizes the distance ∥u - v∥ if and only if for all w ∈ K, inner (u - v) w = 0 (i.e., u - v is orthogonal to the subspace K)