An inner product space is a vector space H with an inner product ⟨⋅,⋅⟩:H×H→C satisfying:
⟨x,x⟩≥0 with equality iff x=0.
⟨x,y⟩=⟨y,x⟩.
⟨αx+βy,z⟩=α⟨x,z⟩+β⟨y,z⟩.
Every inner product induces a norm: ∥x∥=⟨x,x⟩.
Example 1.Cn with ⟨x,y⟩=∑i=1nxiyi.
Example 2.L2(μ) with ⟨f,g⟩=∫fgdμ.
2.2 Orthogonality
Vectors x,y∈H are orthogonal (written x⊥y) if ⟨x,y⟩=0.
Theorem 2.1 (Pythagorean Theorem). If x⊥y, then ∥x+y∥2=∥x∥2+∥y∥2.
Theorem 2.2 (Parallelogram Law). In any inner product space:
∥x+y∥2+∥x−y∥2=2∥x∥2+2∥y∥2
Theorem 2.3 (Polarization Identity). In a complex inner product space:
⟨x,y⟩=41(∥x+y∥2−∥x−y∥2+i∥x+iy∥2−i∥x−iy∥2)
Theorem 2.4 (Cauchy-Schwarz Inequality).∣⟨x,y⟩∣≤∥x∥⋅∥y∥ with equality iff x and y are linearly dependent.
2.3 Hilbert Spaces
A Hilbert space is a complete inner product space.
Theorem 2.5 (Orthogonal Projection). Let M be a closed subspace of a Hilbert space H. For every x∈H, there exists a unique y∈M (the orthogonal projection of x onto M) such that x−y⊥M. We write y=PM(x).
Theorem 2.6 (Orthogonal Decomposition). If M is a closed subspace of H, then H=M⊕M⊥, where M⊥={x∈H:x⊥M}.
2.4 Orthonormal Bases
A set {ei}i∈I⊆H is an orthonormal system if ⟨ei,ej⟩=δij.
Theorem 2.7 (Bessel”s Inequality). If {ei}i=1n is an orthonormal set, then ∑i=1n∣⟨x,ei⟩∣2≤∥x∥2.
Theorem 2.8. A Hilbert space is separable if and only if it admits a countable orthonormal basis.
Theorem 2.9 (Parseval’s Identity). If {en} is an orthonormal basis for H, then for every x∈H:
∥x∥2=∑n=1∞∣⟨x,en⟩∣2andx=∑n=1∞⟨x,en⟩en
2.5 Riesz Representation Theorem
Theorem 2.10 (Riesz Representation). Let H be a Hilbert space. For every bounded linear functional φ∈H∗, there exists a unique y∈H such that φ(x)=⟨x,y⟩ for all x∈H. Moreover, ∥φ∥H∗=∥y∥H.
Proof. If φ=0, take y=0. Otherwise, ker(φ) is a closed subspace, so H=ker(φ)⊕ker(φ)⊥. Take z∈ker(φ)⊥ with ∥z∥=1. Then y=φ(z)⋅z satisfies φ(x)=⟨x,y⟩ for all x. Uniqueness follows from the polarization identity. ■
Corollary 2.11. Every Hilbert space is isometrically isomorphic to its dual: H≅H∗ (anti-linearly).