§10.2 Orthonormal Systems of a Hilbert Space
10.2 Orthonormal Systems of a Hilbert Space
We first aim to provide a generalization of bases which will serve useful in generalizing vector spaces to infinite dimensions.
Definition 10.2.1 (Orthonormal System).
Let be a Hilbert space. Let be any set. A set is an orthonormal system iff ,
Generally one is concerned only with the cases where is finite or when is countably infinite (), although here we will consider the generalization to uncountable sets as it follows in the same way.Definition 10.2.2 (Completeness of an Orthonormal System).
An orthonormal system in a Hilbert space is complete iff there exists no nonzero vector orthogonal to all vectors in the system.The definition of completeness is intuitive: it means that there is no other nonzero vector that can be appended to the system while maintaining the orthogonality condition.
The orthonormal then generalizes the concept of a “basis” for finite-dimensional vector spaces. This will be made explicit in Corollary 10.2.4.1.
Theorem 10.2.3.
Let be a finite orthonormal system in a Hilbert space . Let be the span of the system. The distance between a vector and , , is given by
where is the unique value that attains this minimal distance.Proof.
Let
We aim to show this choice of is optimized. Firstly, we show is orthogonal to . For any ,
Moreover, for any , by Theorem 10.1.28, since , the orthogonal decomposition of (where ) is uniquely determined by , .
By Theorem 10.1.22,
proving the minimality of . Moreover, the point is unique as equality is attained iff .
Then
Therefore, one then derives
Corollary 10.2.3.1 (Bessel’s Inequality).
Let be a Hilbert space and let be an orthonormal system. Then for ,
where the left-hand side converges unconditionally: such that for any , countable such that for all countable,
Moreover, is orthogonal to all but countably many vectors in .Proof.
For each , let
Then is a finite set, as otherwise
contradicting Theorem 10.2.3. Let , which is a countable set. Moreover, for any , .
Therefore only a countable number of vectors in are not orthogonal to . Let be indexed by a sequence . By Theorem 10.2.3,
has all partial sums bounded by ; therefore the series converges to a limit by the Monotone Convergence Theorem.
Since , for any , such that for all , . Then let . Then for any countable,
which implies
and the assertion follows.
Then we may provide the following generalization of the Parseval’s Theorem from Fourier analysis:
Theorem 10.2.4 (Riesz–Fischer).
Let be a Hilbert space and let be a complete orthonormal system. Then:
For any ,
and
Conversely, for any complex collection such that
then such that , . Then
It is actually simpler to first prove Part 2.
Proof of Part 2 of Theorem 10.2.4.
Claim.
At most a countable number of are nonzero.Proof of the claim.
This is essentially the same argument as used before with Corollary 10.2.3.1. For each , let
Then is finite; otherwise . Moreover the union of all for is a countable set and contains all nonzero ‘s. If is finite , then letting
we see that and for all other ’s, , which proves from orthogonality. Then in this case, the assertion follows from Theorem 10.1.22.
If is countable and indexed by , then for any , let
Then for ,
Then
Since
by letting
If there exists some other
Proof of Part 1Part 1 Part 1 of Theorem 10.2.4Theorem 10.2.4 Theorem 10.2.4 .
By Bessel’s Inequality, we have
By Part 2
given by
(10.2.1)
Corollary 10.2.4.1.
Let
Proof.
By Riesz–Fischer (Theorem 10.2.4
implying that for any
Moreover,
implying that
Remark.
The necessity of using closure or density comes from the observation thatExample 10.2.5.
Let
We will not immediately state a full proof. In proving completeness, one could obviously write out the Cauchy sequences and prove that they converge. However, there is indeed an elegant method that uses the Riesz–Fischer Theorem (Theorem 10.2.4
Proof of Example 10.2.5Example 10.2.5 Example 10.2.5 (with assumptions).
The space
holds, notice that
Observe that the product is well defined by the Cauchy–Schwarz Inequality:
and convergence follows from the Monotone Convergence Theorem. The verification of the other properties is rather simple. Observe that the associated norm is
Let (using the assumption)
Then the map
is a bijection: the inverse is given by
The vector structure of
Therefore, it remains to show that the space
by Riesz–Fischer (Theorem 10.2.4
Therefore, since any Cauchy sequence
Example 10.2.6.
Let
Solution to Example 10.2.6Example 10.2.6 Example 10.2.6 .
For any
Moreover, for
Therefore, the set
Therefore it is an orthonormal system. Moreover, completeness follows naturally, because if there exists
(Then one could use this space in Example 10.2.5
Definition 10.2.7 (Separability).
A metric spaceProposition 10.2.8.
A Hilbert spaceProof.
(Forward implication)
Let
be a countable dense subset. Then describing𝑆 ⊆ 𝐻 with a sequence𝑆 , we may then construct another sequence{ 𝑠 𝑗 } recursively:{ 𝑢 𝑗 } 𝑗 - Let
be the first nonzero element𝑢 1 in𝑠 𝑘 1 .{ 𝑠 𝑗 } - Assuming a linearly independent set
, choose{ 𝑢 𝑗 } 𝑗 < 𝑘 to be the first nonzero element in𝑢 𝑘 not in{ 𝑠 𝑗 } .span { 𝑢 𝑗 } 𝑗 < 𝑘 - If such a
ever does not exist, then end the process thereat. In this case𝑢 𝑘 already densely spansspan { 𝑢 𝑗 } 𝑗 < 𝑘 , is complete by Proposition 10.1.12𝐻 , and consequently hence spansProposition 10.1.12 Proposition 10.1.12 .𝐻
Then
densely spans{ 𝑢 𝑗 } 𝑗 . Applying the Gram–Schmidt process then gives an orthonormal system which also densely spans𝐻 , namely𝐻 .{ 𝑒 𝑗 } 𝑗 Suppose, for contradiction, that there exists a nonzero
such that𝑥 ∈ 𝐻 for every𝑥 ⟂ 𝑒 𝑗 . Then𝑗 .𝑥 ⟂ span { 𝑒 𝑗 } 𝑗 Since
is dense inspan { 𝑒 𝑗 } 𝑗 , there exists a sequence𝐻 such that{ 𝑦 𝑛 } ⊆ span { 𝑒 𝑗 } 𝑗 . By continuity of the inner product (Theorem 10.1.11𝑦 𝑛 → 𝑥 ),Theorem 10.1.11 Theorem 10.1.11 ‖ 𝑥 ‖ 2 = ⟨ 𝑥 , 𝑥 ⟩ = lim 𝑛 → ∞ ⟨ 𝑥 , 𝑦 𝑛 ⟩ = 0 , because
for every⟨ 𝑥 , 𝑦 𝑛 ⟩ = 0 . Hence𝑛 , contradicting our choice of𝑥 = 0 . Therefore𝑥 is complete.{ 𝑒 𝑗 } 𝑗 - Let
(Converse)
Letting
({ 𝑒 𝑗 } 𝑗 ∈ ℕ < 𝐾 ) be the complete orthonormal system, the set𝐾 ∈ ℕ ∪ { ∞ } 𝑆 = { ∑ 𝑗 = 1 𝑘 𝛼 𝑗 𝑒 𝑖 𝑗 : 𝑘 ∈ ℕ < 𝐾 , ( ∀ 𝑗 ∈ ℕ ≤ 𝑘 ) 𝑖 𝑗 ∈ ℕ < 𝐾 , 𝛼 𝑗 ∈ ℚ + i ℚ } , is a countable set. Indeed, for each fixed
, the cardinality of𝑘 { ∑ 𝑗 = 1 𝑘 𝛼 𝑗 𝑒 𝑖 𝑗 : ∀ 𝑗 ∈ ℕ ≤ 𝑘 , 𝑖 𝑗 ∈ ℕ < 𝐾 , 𝛼 𝑗 ∈ ℚ + i ℚ } does not exceed that of
, which is countable. Then the union of all such sets forℕ < 𝐾 𝑘 × ( ℚ + i ℚ ) 𝑘 is a countable union of countable sets, hence countable.𝑘 ∈ ℕ < 𝐾 Moreover, we can show that it is dense in
:𝐻 , we know from the proof Riesz–Fischer (Theorem 10.2.4∀ 𝑥 ∈ 𝐻 ) that it can be written asTheorem 10.2.4 Theorem 10.2.4 𝑥 = ∑ 𝑗 ∈ ℕ < 𝐾 𝛽 𝑗 𝑒 𝑗 , ( 𝛽 𝑗 = ⟨ 𝑥 , 𝑒 𝑗 ⟩ ) , which may be approximated with an error under
by𝜀 2 . By the density of rationals, each∑ 𝑗 = 1 𝑘 𝛽 𝑗 𝑒 𝑗 may be approximated by some𝛽 𝑗 , such that𝛼 𝑗 ∈ ℚ + i ℚ Then| 𝛼 𝑗 − 𝛽 𝑗 | < 𝜀 2 𝑘 . ‖ 𝑥 − ∑ 𝑗 = 1 𝑘 𝛼 𝑗 𝑒 𝑗 ‖ ≤ ‖ 𝑥 − ∑ 𝑗 = 1 𝑘 𝛽 𝑗 𝑒 𝑗 ‖ + ‖ ∑ 𝑗 = 1 𝑘 ( 𝛽 𝑗 − 𝛼 𝑗 ) 𝑒 𝑗 ‖ < 𝜀 . Since
lies in∑ 𝑗 = 1 𝑘 𝛼 𝑗 𝑒 𝑗 , the density follows from the arbitrariness of𝑆 .𝜀 □
We then conclude with the following technical result.
Theorem 10.2.9.
LetProof.
By Proposition 10.2.8
In fact, the span of
Then