Notes on Complex Analysis
Export PDFGitHub

§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 ∀𝑖,𝑗∈𝐼,

⟨𝑒𝑖,𝑒𝑗⟩=𝛿𝑖𝑗={1if𝑖=𝑗0if𝑖≠𝑗.
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.1Corollary 10.2.4.1Corollary 10.2.4.1.

Theorem 10.2.3.

Let {𝑒𝑘}𝑘=1𝑛 be a finite orthonormal system in a Hilbert space 𝐻. Let 𝑈 be the span of the system. The distance between a vector 𝑥∈𝐻 and 𝑈, inf𝑣∈𝑈‖𝑥−𝑣‖, is given by

‖𝑥−𝑢‖=‖𝑥‖2−∑𝑘=1𝑛|⟨𝑥,𝑒𝑘⟩|2
where 𝑢∈𝑈 is the unique value that attains this minimal distance.
Proof.

Let

𝑢=∑𝑘=1𝑛⟨𝑥,𝑒𝑘⟩𝑒𝑘∈𝑈.

We aim to show this choice of 𝑢 is optimized. Firstly, we show 𝑥−𝑢 is orthogonal to 𝑈. For any 𝑗∈ℕ≤𝑛,

⟨𝑥−𝑢,𝑒𝑗⟩=⟨𝑥,𝑒𝑗⟩−⟨∑𝑘=1𝑛⟨𝑥,𝑒𝑘⟩𝑒𝑘,𝑒𝑗⟩=⟨𝑥,𝑒𝑗⟩−∑𝑘=1𝑛⟨𝑥,𝑒𝑘⟩⟨𝑒𝑘,𝑒𝑗⟩=⟨𝑥,𝑒𝑗⟩−∑𝑘=1𝑛⟨𝑥,𝑒𝑘⟩𝛿𝑘𝑗=0.

Moreover, for any 𝑣∈𝑈, by Theorem 10.1.28Theorem 10.1.28Theorem 10.1.28, since 𝑥−𝑣−(𝑥−𝑢)∈𝑈, the orthogonal decomposition of 𝑥−𝑣=𝑎+𝑏 (where 𝑎∈𝑈,𝑏∈𝑈⟂) is uniquely determined by 𝑎=𝑢−𝑣, 𝑏=𝑥−𝑢.

By Theorem 10.1.22Theorem 10.1.22Theorem 10.1.22,

‖𝑥−𝑣‖2=‖𝑢−𝑣‖2+‖𝑥−𝑢‖2≥‖𝑥−𝑢‖2,

proving the minimality of 𝑢. Moreover, the point 𝑢 is unique as equality is attained iff ‖𝑢−𝑣‖=0⟹𝑢=𝑣.

Then

‖𝑥−𝑢‖=‖𝑥‖2+‖𝑢‖2−2ℜ𝔢⟨𝑥,𝑢⟩=‖𝑥‖2+∑(𝑗,𝑘)∈ℕ≤𝑛2⟨⟨𝑥,𝑒𝑗⟩𝑒𝑗,⟨𝑥,𝑒𝑘⟩𝑒𝑘⟩−2∑𝑘=1𝑛ℜ𝔢⟨𝑥,⟨𝑥,𝑒𝑘⟩𝑒𝑘⟩=‖𝑥‖2+∑(𝑗,𝑘)∈ℕ≤𝑛2⟨𝑥,𝑒𝑗⟩⟨𝑥,𝑒𝑘⟩‾𝛿𝑗𝑘−2∑𝑘=1𝑛|⟨𝑥,𝑒𝑘⟩|2=‖𝑥‖2−∑𝑘=1𝑛|⟨𝑥,𝑒𝑘⟩|2.□

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 𝑥∈𝐻,

∑𝑖∈𝐼|⟨𝑥,𝑒𝑖⟩|2≤‖𝑥‖2,

where the left-hand side converges unconditionally: ∃𝑆≤‖𝑥‖2 such that for any 𝜀>0, ∃𝐼′⊆𝐼 countable such that for all (𝐼⊇)𝐼″⊇𝐼′ countable,

|∑𝑖∈𝐼″|⟨𝑥,𝑒𝑖⟩|2−𝑆|<𝜀.
Moreover, 𝑥 is orthogonal to all but countably many vectors in {𝑒𝑖}.
Proof.

For each 𝑚∈ℕ, let

𝐴𝑚={𝑒∈{𝑒𝑖}𝑖:|⟨𝑥,𝑒⟩|2>1𝑚}.

Then 𝐴𝑚 is a finite set, as otherwise

∑𝑒∈𝐴𝑚|⟨𝑥,𝑒⟩|2=∞,

contradicting Theorem 10.2.3Theorem 10.2.3Theorem 10.2.3. Let 𝐴=⋃𝑚∈ℕ𝐴𝑚, which is a countable set. Moreover, for any {𝑒𝑖}∋𝑒∉𝐴, |⟨𝑥,𝑒⟩|2≤inf𝑚∈ℕ1𝑚=0.

Therefore only a countable number of vectors in {𝑒𝑖}𝑖∈𝐼 are not orthogonal to 𝑥. Let 𝐴 be indexed by a sequence {𝑣𝑛}𝑛∈ℕ={𝑒𝑖𝑛}𝑛∈ℕ. By Theorem 10.2.3Theorem 10.2.3Theorem 10.2.3,

∑𝑛=1∞|⟨𝑥,𝑣𝑛⟩|2

has all partial sums bounded by ‖𝑥‖2; therefore the series converges to a limit 𝑆≤‖𝑥‖2 by the Monotone Convergence Theorem.

Since ∑𝑛=1∞|⟨𝑥,𝑣𝑛⟩|2=𝑆, for any 𝜀>0, ∃𝑁∈ℕ such that for all 𝑘≥𝑁, |∑𝑛=1𝑘|⟨𝑥,𝑣𝑛⟩|2−𝑆|<𝜀. Then let 𝐼′={𝑖𝑛}𝑛=1𝑁. Then for any 𝐼″⊇𝐼′ countable,

∑𝑖∈𝐼′|⟨𝑥,𝑒𝑖⟩|2≤∑𝑖∈𝐼″|⟨𝑥,𝑒𝑖⟩|2≤𝑆,

which implies

𝜀>|𝑆−∑𝑖∈𝐼′𝑘|⟨𝑥,𝑒𝑖⟩|2|≥|𝑆−∑𝑖∈𝐼″|⟨𝑥,𝑒𝑖⟩|2|≥0

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:

  1. For any 𝑥∈𝐻,

    ‖𝑥‖2=∑𝑖∈𝐼|⟨𝑥,𝑒𝑖⟩|2,

    and

    𝑥=∑𝑖∈𝐼⟨𝑥,𝑒𝑖⟩𝑒𝑖.
  2. Conversely, for any complex collection {𝛽𝑖}𝑖∈𝐼 such that

    ∑𝑖∈𝐼|𝛽𝑖|2<∞,

    then ∃!𝑥∈𝐻 such that ∀𝑖∈𝐼, ⟨𝑥,𝑒𝑖⟩=𝛽𝑖. Then

    ‖𝑥‖2=∑𝑖∈𝐼|𝛽𝑖|2,𝑥=∑𝑖∈𝐼𝛽𝑖𝑒𝑖

It is actually simpler to first prove Part 2Part 2Part 2.

Proof of Part 2Part 2Part 2 of Theorem 10.2.4Theorem 10.2.4Theorem 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.1Corollary 10.2.3.1Corollary 10.2.3.1. For each 𝑚∈ℕ, let

𝐴𝑚={𝛽∈{𝛽𝑖}𝑖∈𝐼:|𝛽𝑖|>1𝑚}.
Then 𝐴𝑚 is finite; otherwise ∑𝑖∈𝐼|𝛽𝑖|2≮∞. 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, 𝛽𝑖=0, which proves ⟨𝑥,𝑒𝑖⟩=𝛽𝑖 from orthogonality. Then in this case, the assertion ‖𝑥‖2=∑𝑖∈𝐼|𝛽𝑖|2 follows from Theorem 10.1.22Theorem 10.1.22Theorem 10.1.22.

If ⋃𝑚𝐴𝑚 is countable and indexed by {𝛽𝑖𝑗}𝑗∈ℕ, then for any 𝐾∈ℕ, let

𝑥𝐾=∑𝑗=1𝐾𝛽𝑖𝑗𝑒𝑖𝑗.

Then for 𝑁≥𝑀,

‖𝑥𝑁−𝑥𝑀‖2=‖∑𝑀+1𝑁𝛽𝑖𝑗𝑒𝑖𝑗‖2=∑𝑀+1𝑁|𝛽𝑖𝑗|2→0.(byTheorem 10.1.22Theorem 10.1.22Theorem 10.1.22)

Then {𝑥𝐾}𝐾 is a Cauchy sequence and hence converges to some 𝑥∈𝐻:

𝑥=∑𝑗=1∞𝛽𝑖𝑗𝑒𝑖𝑗.

Since |‖𝑥‖−‖𝑥𝑁‖|≤‖𝑥−𝑥𝑁‖→0, ‖𝑥𝑁‖2→‖𝑥‖2. Moreover, by Theorem 10.1.22Theorem 10.1.22Theorem 10.1.22,

‖𝑥𝑁‖2=∑𝑗=1𝑁|𝛽𝑖𝑗|2⟹‖𝑥‖2=∑𝑗=1∞|𝛽𝑖𝑗|2

by letting 𝑁→∞.

If there exists some other 𝑥̃ satisfying ⟨𝑥̃,𝑒𝑖⟩=𝛽𝑖, then ⟨𝑥−𝑥̃,𝑒𝑖⟩=0 for each 𝑖∈𝐼. By the completeness of {𝑒𝑖}𝑖∈𝐼, the only vector orthogonal to all vectors in the system is the zero vector, therefore 𝑥−𝑥̃=0⟹𝑥=𝑥̃. ⁠□

Proof of Part 1Part 1Part 1 of Theorem 10.2.4Theorem 10.2.4Theorem 10.2.4.

By Bessel’s Inequality, we have

∑𝑖∈𝐼|⟨𝑥,𝑒𝑖⟩|2≤‖𝑥‖2.

By Part 2Part 2Part 2 applied to 𝛽𝑖=⟨𝑥,𝑒𝑖⟩, ∃!𝑥̃ such that ∀𝑖∈𝐼,

⟨𝑥̃,𝑒𝑖⟩=⟨𝑥,𝑒𝑖⟩,(10.2.1)

given by 𝑥̃=∑𝑖=𝐼⟨𝑥,𝑒𝑖⟩𝑒𝑖. Then for this 𝑥̃,

‖𝑥̃‖2=∑𝑖∈𝐼|⟨𝑥,𝑒𝑖⟩|2.(10.2.2)

(10.2.1)(10.2.1)(10.2.1) gives that for each 𝑖∈𝐼, ⟨𝑥−𝑥̃,𝑒𝑖⟩=0. Then 𝑥−𝑥̃ is orthogonal to all vectors in a complete orthonormal system, and is therefore zero by definition. Thus 𝑥=𝑥̃, and by (10.2.2)(10.2.2)(10.2.2), we have

‖𝑥‖2=∑𝑖∈𝐼|⟨𝑥,𝑒𝑖⟩|2.□

Corollary 10.2.4.1.

Let 𝐻 be a Hilbert space such that there exists a complete orthonormal system {𝑒𝑖}𝑖∈𝐼. Then span{𝑒𝑖}𝑖∈𝐼 is dense in 𝐻, or in other words:

span{𝑒𝑖}𝑖‾=𝐻.
Proof.

By Riesz–Fischer (Theorem 10.2.4Theorem 10.2.4Theorem 10.2.4), any 𝑥∈𝐻,

𝑥=∑𝑖⟨𝑥,𝑒𝑖⟩𝑒𝑖,

implying that for any ∀𝜀>0, ∃𝐼′⊆𝐼 countable such that ∀𝐼″⊇𝐼′ countable,

‖∑𝑖∈𝐼″⟨𝑥,𝑒𝑖⟩𝑒𝑖−𝑥‖<𝜀2.

Moreover, ∃𝐼‴⊆𝐼′ finite such that

‖∑𝑖∈𝐼‴⟨𝑥,𝑒𝑖⟩𝑒𝑖−∑𝑖∈𝐼″⟨𝑥,𝑒𝑖⟩𝑒𝑖‖<𝜀2,

implying that

‖∑𝑖∈𝐼‴⟨𝑥,𝑒𝑖⟩𝑒𝑖−𝑥‖<𝜀.
Therefore, there exists a (finite) linear combination of orthonormal vectors in {𝑒𝑖} lying in any open ball centered at 𝑥 (by the arbitrariness of 𝜀). ⁠□

Remark.

The necessity of using closure or density comes from the observation that span appertains only to finite linear combinations, whereas in most cases we need a complete description of “countably infinite linear combinations.”

Example 10.2.5.

Let ℓ2={{𝛼𝑗}𝑗∈ℕ𝐿:∑𝑗=1∞|𝛼𝑗|2<∞} denote the set of all square-summable complex sequences. Then for 𝛼={𝛼𝑗}𝑗, 𝛽={𝛽𝑗}𝑗, define

⟨𝛼,𝛽⟩=∑𝑗=1∞𝛼𝑗𝛽𝑗‾.
Then ℓ2 is a vector space and a Hilbert space with the inner product ⟨𝛼,𝛽⟩ℓ2=∑𝑗=1∞𝛼𝑗𝛽𝑗‾ and associated norm ‖⋅‖ℓ2.

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.4Theorem 10.2.4Theorem 10.2.4), under the assumption that there exists any Hilbert space 𝐻 with an infinite countable complete orthonormal system, which we will first assume and justify later (in fact, there are many such spaces, such as the Bergman space 𝐴2(𝔻) and the Hardy space 𝐻2).

Proof of Example 10.2.5Example 10.2.5Example 10.2.5 (with assumptions).

The space ℓ2 is trivially closed under scalar multiplication. To show additivity, or that

{𝛼𝑗}𝑗+{𝛽𝑗}𝑗={𝛼𝑗+𝛽𝑗}𝑗∈ℓ2

holds, notice that

∑𝑗=1∞|𝛼𝑗+𝛽𝑗|2≤2∑𝑗=1∞[|𝛼𝑗|2+|𝛽𝑗|2](byTheorem 10.1.18Theorem 10.1.18Theorem 10.1.18)

Observe that the product is well defined by the Cauchy–Schwarz Inequality:

lim sup𝑁→∞|∑𝑗=1𝑁𝛼𝑗𝛽𝑗‾|≤lim sup𝑁→∞∑𝑗=1𝑁|𝛼𝑗𝛽𝑗‾|≤lim sup𝑁→∞∑𝑗=1𝑁|𝛼𝑗|2∑𝑗=1𝑁|𝛽𝑗|2=‖𝛼‖‖𝛽‖,

and convergence follows from the Monotone Convergence Theorem. The verification of the other properties is rather simple. Observe that the associated norm is

‖𝛼‖ℓ2=∑𝑗=1∞|𝛼𝑗|2.

Let (using the assumption) 𝐻 be a Hilbert space (with ⟨⋅,⋅⟩𝐻, ‖⋅‖𝐻) with an infinite countable complete orthonormal system {𝑒𝑗}𝑗∈ℕ. For any 𝛼={𝛼𝑗}𝑗∈ℕ∈ℓ2, by the Riesz–Fischer Theorem (Theorem 10.2.4Theorem 10.2.4Theorem 10.2.4), there is a single 𝑥∈𝐻 such that

𝑥=∑𝑗𝛼𝑗𝑒𝑗,and⟨𝑥,𝑒𝑗⟩𝐻=𝛼𝑗∀𝑗∈ℕ.

Then the map

𝜑:ℓ2→𝐻given by𝜑:𝛼↦∑𝑗𝛼𝑗𝑒𝑗

is a bijection: the inverse is given by

𝜑−1:𝑥↦{⟨𝑥,𝑒𝑗⟩𝐻}𝑗∈ℕ.

The vector structure of 𝐻 is preserved under 𝜑. Moreover, 𝜑 is trivially additive and homogeneous, thus linear.

Therefore, it remains to show that the space ℓ2 is complete under the associated norm. Observe that 𝜑 preserves norms, since

‖𝑥‖2=∑𝑗=1∞|⟨𝑥,𝑒𝑗⟩𝐻|2=‖{⟨𝑥,𝑒𝑗⟩𝐻}𝑗∈ℕ‖2

by Riesz–Fischer (Theorem 10.2.4Theorem 10.2.4Theorem 10.2.4).

Therefore, since any Cauchy sequence {𝛼𝑛}𝑛 in ℓ2 gives a Cauchy sequence {𝜑(𝛼𝑛)}𝑛⊆𝐻 with a single accumulation point 𝑥∈𝐻; from ‖𝜑(𝛼𝑛)−𝑥‖𝐻<𝜀 (𝑛>𝑁 for some 𝑁), we obtain ‖𝜑−1(𝜑(𝛼𝑛)−𝑥)‖=‖𝛼𝑛−𝜑−1(𝑥)‖<𝜀. Therefore, {𝛼𝑛}𝑛 converges to 𝜑−1(𝑥), and thus ℓ2 is complete. ⁠□

Example 10.2.6.

Let 𝐴2(𝔻) be the Bergman space on 𝔻. With

⟨𝑓,𝑔⟩=∬𝔻𝑓(𝑧)𝑔(𝑧)‾d𝑥d𝑦,
𝐴2(𝔻) is a Hilbert space by Example 10.1.15Example 10.1.15Example 10.1.15. Then show that {𝑧↦𝑗+1π𝑧𝑗}𝑗∈0∞ is a countable complete orthonormal system for 𝐴2(𝔻).
Solution to Example 10.2.6Example 10.2.6Example 10.2.6.

For any 𝑗, 𝑧↦𝑧𝑗∈𝐴2(𝔻), so

∞>‖𝑧↦𝑧𝑗‖=∬𝔻|𝑧|2𝑗d𝑥d𝑦=∫01∫−ππ𝑟2𝑗𝑟d𝜃d𝑟=2π𝑟2𝑗+22𝑗+2|01=π𝑗+1.

Moreover, for 𝑗≠𝑘,

⟨𝑧↦𝑧𝑗,𝑧↦𝑧𝑘⟩=∬𝔻𝑧𝑗𝑧‾𝑘d𝑥d𝑦=∫01∫−ππ𝑟𝑗ei𝑗𝜃𝑟𝑘e−i𝑘𝜃𝑟d𝜃d𝑟=∫01𝑟𝑗+𝑘+1d𝑟∫−ππei𝜃(𝑗−𝑘)d𝜃=0.

Therefore, the set {𝑧↦𝑗+1π𝑧𝑗}𝑗∈0∞ satisfies the orthogonality condition, and

⟨𝑧↦𝑗+1π𝑧𝑗,𝑧↦𝑗+1π𝑧𝑗⟩=1∀𝑗∈ℤ≥0.

Therefore it is an orthonormal system. Moreover, completeness follows naturally, because if there exists 𝑓∈𝐴2(𝔻) such that 𝑓⟂𝑧↦𝑗+1π𝑧𝑗 for each 𝑗, then writing 𝑓(𝑧)=∑𝑛=0∞𝑎𝑛𝑧𝑛, we get

⟨𝑓,𝑧↦𝑗+1π𝑧𝑗⟩=0=∬𝔻(∑𝑛=0∞𝑎𝑛𝑧𝑛)(𝑗+1π𝑧𝑗)‾d𝑥d𝑦=𝑗+1π∫01∫−ππ∑𝑛=0∞𝑎𝑛𝑟𝑛+𝑗+1ei(𝑛−𝑗)𝜃d𝜃d𝑟(uniform convergence in𝜃)=𝑗+1π∫01∑𝑛=0∞∫−ππ𝑎𝑛𝑟𝑛+𝑗+1ei(𝑛−𝑗)𝜃d𝜃d𝑟=𝑗+1π∫01∑𝑛=0∞𝑎𝑛𝑟𝑛+𝑗+1{ei(𝑛−𝑗)𝜃i(𝑛−𝑗)|−ππif𝑛≠𝑗2πif𝑛=𝑗d𝑟=2π(𝑗+1)∫01𝑎𝑗𝑟2𝑗+1d𝑟=𝑎𝑗π𝑗+1,
meaning that for each 𝑗∈ℤ≥0, 𝑎𝑗=0; then the only function orthogonal to every function in the system is the zero function. ⁠□

(Then one could use this space in Example 10.2.5Example 10.2.5Example 10.2.5.)

Definition 10.2.7 (Separability).

A metric space (𝑋,𝑑) is said to be separable iff it has a countable dense subset.

Proposition 10.2.8.

A Hilbert space 𝐻 is separable iff it has a complete countable orthonormal system.
Proof.
  1. (Forward implication)

    Let 𝑆⊆𝐻 be a countable dense subset. Then describing 𝑆 with a sequence {𝑠𝑗}, we may then construct another sequence {𝑢𝑗}𝑗 recursively:

    • Let 𝑢1 be the first nonzero element 𝑠𝑘1 in {𝑠𝑗}.
    • 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 span{𝑢𝑗}𝑗<𝑘 already densely spans 𝐻, is complete by Proposition 10.1.12Proposition 10.1.12Proposition 10.1.12, and consequently hence spans 𝐻.

    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 span{𝑒𝑗}𝑗 is dense in 𝐻, there exists a sequence {𝑦𝑛}⊆span{𝑒𝑗}𝑗 such that 𝑦𝑛→𝑥. By continuity of the inner product (Theorem 10.1.11Theorem 10.1.11Theorem 10.1.11),

    ‖𝑥‖2=⟨𝑥,𝑥⟩=lim𝑛→∞⟨𝑥,𝑦𝑛⟩=0,

    because ⟨𝑥,𝑦𝑛⟩=0 for every 𝑛. Hence 𝑥=0, contradicting our choice of 𝑥. Therefore {𝑒𝑗}𝑗 is complete.

  2. (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 ℕ<𝐾𝑘×(ℚ+iℚ)𝑘, which is countable. Then the union of all such sets for 𝑘∈ℕ<𝐾 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.4Theorem 10.2.4Theorem 10.2.4) that it can be written as

    𝑥=∑𝑗∈ℕ<𝐾𝛽𝑗𝑒𝑗,(𝛽𝑗=⟨𝑥,𝑒𝑗⟩),

    which may be approximated with an error under 𝜀2 by ∑𝑗=1𝑘𝛽𝑗𝑒𝑗. By the density of rationals, each 𝛽𝑗 may be approximated by some 𝛼𝑗∈ℚ+iℚ, such that |𝛼𝑗−𝛽𝑗|<𝜀2𝑘. Then

    ‖𝑥−∑𝑗=1𝑘𝛼𝑗𝑒𝑗‖≤‖𝑥−∑𝑗=1𝑘𝛽𝑗𝑒𝑗‖+‖∑𝑗=1𝑘(𝛽𝑗−𝛼𝑗)𝑒𝑗‖<𝜀.

    Since ∑𝑗=1𝑘𝛼𝑗𝑒𝑗 lies in 𝑆, the density follows from the arbitrariness of 𝜀. □

We then conclude with the following technical result.

Theorem 10.2.9.

Let 𝐻 be a separable Hilbert space and let 𝐾⊆𝐻 be a Hilbert subspace. Then 𝐾 is separable.
Proof.

By Proposition 10.2.8Proposition 10.2.8Proposition 10.2.8, 𝐻 has a complete countable orthonormal basis {𝑒𝑗}𝑗. Projecting each 𝑒𝑗 onto 𝐾 by using the orthogonal decomposition (Theorem 10.1.28Theorem 10.1.28Theorem 10.1.28) gives a set {𝑢𝑗} in 𝐾.

In fact, the span of {𝑢𝑗} is dense in 𝐾: for any 𝜀>0,𝑥∈𝐾, there exists 𝑦∈span{𝑒𝑗}𝑗 such that ‖𝑦−𝑥‖<𝜀. Projecting 𝑦−𝑥 onto 𝐾 gives a vector 𝑣 satisfying ‖𝑣‖≤‖𝑦−𝑥‖ (by Theorem 10.1.22Theorem 10.1.22Theorem 10.1.22, the Pythagorean theorem); and moreover, 𝑣=𝑦𝑝−𝑥 (where 𝑦𝑝 is the projection of 𝑦 onto 𝐾). Moreover, 𝑦𝑝 is a linear combination of elements in {𝑢𝑗}, and is within 𝜀 from 𝑥. Then the density follows from arbitrariness.

Then 𝐾 is separable. ⁠□