Scribd
Upload
98 views

Math6338 hw1

The document provides solutions to 11 homework problems involving concepts in Hilbert spaces and linear algebra. Some key points addressed include: showing that the null space of a semi-inner product is a linear subspace; defining an inner product on a quotient space; properties of orthogonal projections; the Riesz representation theorem; and convergence of sequences and inner products in Hilbert spaces. The solutions involve applying definitions and theorems regarding inner product spaces, linear operators, orthogonality, and convergence.

Uploaded by

Ricardo E.
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
98 views

Math6338 hw1

The document provides solutions to 11 homework problems involving concepts in Hilbert spaces and linear algebra. Some key points addressed include: showing that the null space of a semi-inner product is a linear subspace; defining an inner product on a quotient space; properties of orthogonal projections; the Riesz representation theorem; and convergence of sequences and inner products in Hilbert spaces. The solutions involve applying definitions and theorems regarding inner product spaces, linear operators, orthogonality, and convergence.

Uploaded by

Ricardo E.
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Homework 1

1. Let u be a semi-inner product on H and put N = {x H : u(x, x) = 0}. Show that


(a) Show that N is a linear subspace of H;
(b) Show that if x + N, y + N u(x, y) for all x + N and y + N in the quotient space
H/N, then , is a well-dened inner product on H/N.
Solution: Part (a): It is easy to see that if x N then x N since u(x, x) =
||
2
u(x, x) = 0. To see that x, y N implies that x + y N, note that it suces
to show that u(x, y) = 0. But, this follows from Cauchy-Schwarz (which is true for
semi-inner products). By Cauchy-Schwarz we have that
|u(x, y)| u(x, x)
1
2
u(y, y)
1
2
= 0
with the last equality holding by x, y N. So we have that u(x, y) = 0, and similarly
u(y, x) = 0. Then note that
u(x + y, x + y) = u(x, x) + u(x, y) + u(y, x) + u(y, y) = 0.
So we have that x + y N too. These two facts imply the N is a linear subspace of H.
Part (b):
Note that the computations above imply that for n N and h H that u(n, h) =
u(h, n) = 0. Suppose that x
1
+ N = x
2
+ N and y
1
+ N = y
2
+ N in the space H/N,
i.e., we have that x
1
x
2
N and y
1
y
2
N. To show that the inner product is well
dened, we need to show that u(x
1
, y
1
) = u(x
2
, y
2
). Now observe
x
1
+ N, y
1
+ N = u(x
1
, y
1
) = u(x
2
+ x
1
x
2
, y
1
)
= u(x
2
, y
1
) + u(x
1
x
2
, y
1
)
= u(x
2
, y
2
+ y
1
y
2
) + u(x
1
x
2
, y
1
)
= u(x
2
, y
2
) + u(x
2
, y
1
y
2
) + u(x
1
x
2
, y
1
)
= u(x
2
, y
2
) = x
2
+ N, y
2
+ N .
Here, for the last equality, we used the fact just mentioned. This implies that the inner
product dened on the coset classes is well-dened.
It is easy to see that the pairing dened above is linear in each component. We also
have
x + N, x + N = u(x, x) 0
since u is a semi-inner product. Suppose that we have that,
x + N, x + N = u(x, x) = 0
then, by denition we have that x N and so x + N = N, and the nal condition for
an inner product is satised.
2. Let H be a Hilbert space and suppose that f, g H are linearly independent with
f = g = 1. Show that for all 0 < t < 1 that tf + (1 t)g < 1.
Solution: It is obvious that tf + (1 t)g t f + (1 t) g = 1, for all vectors
(regardless of linear independence). Suppose now that equality held for some 0 < t < 1.
Observe that
tf + (1 t)g
2
= t
2
+ (1 t)
2
+ t(1 t) f, g + t(1 t) g, f
= 1 2t + 2t
2
+ t(1 t) f, g + t(1 t) g, f .
Then we would have that
0 = tf + (1 t)g
2
1 = 2t(1 t) (Re f, g + 1) .
This implies that Re f, g = 1 since 0 < t < 1. This then gives that
1 = |Re f, g| |f, g| f g = 1.
So we have that |f, g| = 1 = f g, i.e., equality holds in the Cauchy-Schwarz
inequality. But, this then implies that f and g must be linearly dependent, which is a
contradiction to the hypothesis. Thus, we must have the strict inequality for all 0 < t < 1,
i.e.,
tf + (1 t)g < 1.
3. Let K be a non-empty linear subspace of a Hilbert space H. Show that K is dense in H
if and only if K

= {0}.
Solution: Let x K

and assume that K is dense in H. Since K is dense, there exists


a sequence {x
n
} K such that x x. We have that since x K

and x
n
K that
x
n
, x = 0.
By Problem 8 we have that x x, but this implies that x, x
2
= 0, or x = 0. This then
shows that K

= {0}.
Now suppose that K

= 0. If x K, then we have that x K and so x K

and
thus x = 0. This then implies that K

= {0}. Now we can decompose the Hilbert space


H = K K

= K and so K is dense in H. (Here one should use the machinery we


developed on projections).
4. For the Hilbert space H =
2
(N {0}),
(a) If || < 1, and L

h =

n=0

n
h
n
for all h H, nd the vector

h H such that
Lh = h,

h for all h H.
(b) What is the norm of the linear functional dened in part (b)?
Solution: It is easy to see that we have
|L

(h)| h

2
1
_
1 ||
2
.
Then L

is a bounded linear functional on


2
(N {0}), so by the Riesz representation
theorem, there exists a vector

h so that
L

(h) =
_
h,

h
_

2
.
From this equality, it is immediate that

h =
_
1, ,
2
, . . .
_
, and clearly belongs to
2
with
norm given by
_
_
_

h
_
_
_
2

2
=

k=0
||
2k
=
1
1 ||
2
.
Note that these computations also give that L

=
1

1||
2
.
5. Suppose that H is a Hilbert space over the real numbers R. Show that x = y implies
that
x + y, x y = 0.
Solution: We expand the inner product to nd
x + y, x y = x
2
y
2
x, y +y, x = x
2
y
2
since we are working in a real vector space. But, then the hypothesis that x = y
gives the result.
6. Show that in an inner product space H that
z x
2
+z y
2
=
1
2
x y
2
+ 2
_
_
_
_
z
1
2
(x + y)
_
_
_
_
2
.
This is called Apollonius Identity.
Solution: This is a straight forward computation: Just expand both sides. Exact details
left to the student.
7. If in a Hilbert space we have x
n
x and y
n
y, show that
x
n
, y
n
x, y .
Solution: Now that we have
|x
n
, y
n
x, y| = |x
n
, y
n
x
n
, y +x
n
, y x, y|
|x
n
, y
n
x
n
, y| +|x
n
, y x, y|
x
n
y
n
y +x
n
x y .
Now for the second term above, this clearly goes to zero since x
n
x. For the rst term,
note that since x
n
x, we have that x
n
x, so in particular, sup
n
x
n
< +.
Then we can simply conclude that this term goes to zero since y
n
y.
8. Show that y x
n
and x
n
x implies that x y.
Solution: Observe that
x, y = x, y x
n
, y = x x
n
, y
An application of Cauchy-Schwarz then gives
|x, y| x x
n
y .
But since x
n
x, we must have that |x, y| = 0, which gives the result.
9. Show that for a sequence {x
n
} in a Hilbert space that the conditions x
n
x and
x
n
, x x, x implies that x
n
x.
Solution:
x
n
x
2
= x
n

2
+x
2
x
n
, x x, x
n
.
This then clearly gives the result, the hypotheses imply that the right hand side goes to
zero.
10. Let {e
k
} be any orthonormal sequence in a Hilbert space H. Show that for any x, y H
that

k=1
|x, e
k
y, e
k
| x y
Solution: Note that by Bessels Inequality, we have that
x
2

k=1
|x, e
k
|
2
.
The result then follow easily from Cauchy-Schwarz,

k=1
|x, e
k
y, e
k
|
_

k=1
|x, e
k
|
2
_1
2
_

k=1
|y, e
k
|
2
_1
2
x y .
11. Show that an element x of a Hilbert space can not have too many Fourier coecients
x, e
k
that are big. Namely if {e
k
} is an orthonormal sequence, show that the number
N() of x, e
k
such that
|x, e
k
| >
must satisfy N() <
x
2

2
.
Solution: Note that by Bessels Inequality, we have that
x
2

k=1
|x, e
k
|
2
.
Now, if we sum over only those elements such that |x, e
k
| > , then we clearly have
N()
2

k:|x,e
k
|>
1

k=1
|x, e
k
|
2
x
2
.
Rearrangement gives the result.

You might also like