Solutions
Homework 2
MTHE / MATH 335 — Winter 2026
Problem 1: Projection Theorem
In class, we stated the following theorem.
Theorem (Projection Theorem) Let be a Hilbert space and a subspace of . Consider the problem:
(i) A necessary and sufficient condition for to be the minimizing element in so that
is that, be orthogonal ; that is
If exists, such an is unique.
(ii) Let be a Hilbert space and a closed subspace of . For any vector , there is a unique vector satisfying (1).
Prove the theorem by visiting your class notes or the online notes.
Problem 2: Application of the Projection Theorem
Recall a problem that we solved in class on projection to a subspace. We now modify that problem with the minimization of
for some , over all such that
a) State the problem as a Projection problem by identifying the Hilbert space, and the projected subspace.
b) Compute the solution, that is find the minimizing .
Hint: Note here that the projected subspace is different.
Problem 3: Orthonormal Sequences
Show that the family of complex exponentials in :
forms an orthonormal sequence. This sequence is used for the Fourier expansion of functions in .
Problem 4: Convergence in a Hilbert Space
Let be a sequence of orthonormal vectors in a Hilbert space . Let be a sequence of vectors in . Show that this sequence converges to a vector if and only if
Problem 5: Orthonormal Sequences and Unique Representations
Let be a Hilbert space, and a complete orthonormal sequence in . That is, the only element in the Hilbert space which is orthogonal to each of the vectors is the null vector.
Show that there is a unique representation for every in terms of linear expansions involving the sequence .
Problem 6: Separability
Show that is separable.
Problem 7: A More General Projection Theorem
Theorem: Let be a closed subspace of a Hilbert space . Let be a fixed element in and let be a subset such that (also called a linear variety of ). Then there is a unique vector of minimum norm. Furthermore, is orthogonal to .
The following is an application of this result. Let . Consider the following optimization problem:
such that
where is an matrix , with rank and a symmetric, positive definite matrix.
Show that, using the Projection Theorem, the optimal minimizing is given by:
Problem 8: Gram-Schmidt Procedure (Matlab Assignment)
Using Matlab (or any other program), generate a (function) code named GramSchmidtProcedure, which takes as input a fixed number of linearly independent vectors and generates a family of orthonormal vectors as a result. Apply your code to the following problem:
Let
Generate a sequence of orthonormal vectors which span the same space that is spanned by .