Professional Documents
Culture Documents
6110 Midterm
6110 Midterm
Problem 1.6.30
Fix an ∈ (0, 1). We apply the result of Exercise 28 to guarantee the existence
of two intervals I1 , I2 such that m(−E ∩ I1 ) > (1 − )m(I1 ) and m(F ∩ I2 ) >
(1 − )m(I2 ). Without loss of generality suppose that m(I1 ) ≤ m(I2 ). This
means that we can translate I1 by some amount h so that it lies inside of I2 .
Let δ = m(I1 ), so that for 0 < |α| < δ we see that the interval
I1,|α| = (I1 + h + α) ∩ I2
must have m(I1,|α| ) = δ − α > (1 − )δ. As a result of this, we must have that
I1,|α| ∩ I2 6= ∅. Pick some x ∈ (I1,|α| ∩ I2 ) and observe that this means that
there is some u ∈ E and v ∈ F such that
x = v = −u + h + α
1
Ben Carriel Math 6110 Midterm Exam October 16, 2012
Problem 2.5.20
We want to show that if E ⊂ R2 is a Borel set, then for any y the slice E y is (a
parallel translate of) a Borel set in R. We begin by considering the following
C = {E ⊂ R2 | ∀y, E y is Borel}
Claim. C is a σ-algebra.
Proof. It is clear that C is non-empty; the open unit disk is in C, for instance.
Next we will see that C is closed under taking complements. Let E ∈ C, then
we know that for any y the set E y is Borel and that (E c )y = (E y )c must also
be Borel because the Borel sets are a σ-algebra. So E c ∈ C. Next, suppose that
{Ek }∞
k=1 is a countable collection of sets in C. We see that
∞
!y ∞
[ [
Ek = Eky
k=1 k=1
Then we use the fact that each of the Eky is Borel, and so their union must be
as well because the Borel sets are closed under countable union. Thus, C is a
σ-algebra.
Proof. We begin with the proof in the case of E being an open cube. We note
here that we must have E = (a, b) × (a + h, b + h) for some h > 0. We then
take the slice E y which is the same as (a, b) + y, where y ∈ R. Geometrically,
we simply have the line segment (a, b) translated in the y-direction a distance y.
Clearly, this is and open interval and hence, Borel. We then prove the claim for
the family of closed cubes. The proof is the same, we note that the slices E y of
a closed cube is now the closed interval,
T which can be written as the countable
intersection of intervals of the form n (a − 1/n, b + 1/n), and therefore is Borel.
We then use the fact that every open set in R2 can be written as the countable
S∞
union of almost disjoint closed cubes to see that we can write E = j=1 Qk ,
where each of the Qk is a closed cube. We then use the fact that each of the
Qk ∈ C and that C is closed under countable unions to see that E ∈ C.
Finally, we recall that the Borel sets is the smallest σ-algebra containing the
open sets. We have shown that C contains the open sets. And therefore, it
contains the Borel sets. This completes the proof.
2
Ben Carriel Math 6110 Midterm Exam October 16, 2012
Problem 3.5.6
For functions f : R → R we define
Z x+h
∗ 1
f+ (x) = sup |f (y)|dy
h>0 h x
Following the hint, we wish to apply Lemma 3.5 (Rising Sun Lemma) to the
function Z x
F (x) = |f (y)|dy − αx
0
We first observe that if x ∈ Eα+ then there is some h > 0 such that
Z
1
+xx+h |f (y)|dy > α
h
Z
+xx+h |f (y)|dy > hα
hα = hα + xα − xα = (x + h)α − xα
R R x+h R x+h
and note that because |f (y)| is increasing have x |f (y)|dy = 0 |f (y)|dy−
Rx
0
|f (y)|dy. So the inequality becomes
Z x+h Z x
|f (y)|dy − |f (y)|dy > (x + h)α − xα
0 0
Z x+h Z x
|f (y)|dy − (x + h)α > |f (y)|dy − xα
0 0
3
Ben Carriel Math 6110 Midterm Exam October 16, 2012
So that Z
1
m(Eα+ ) = |f (y)|dy
α +
Eα
4
Ben Carriel Math 6110 Midterm Exam October 16, 2012
Problem 3.5.10
Let {rn }∞
n=0 be an enumeration of the rationals. Consider the function
X
f (x) = 2−n
rn <x
= 2−m
5
Ben Carriel Math 6110 Midterm Exam October 16, 2012
Problem 3.5.32
We need to verify that the following
Proof. In the forward diretion we suppose that f is Lipschitz. This means that
|f (x) − f (y)| ≤ M |x − y|
for some M and all x, y ∈ R. Pick an > 0 and observe that δ = /M
immediately gives that
N
X N
X
|bj − aj | < δ implies |f (bj ) − f (aj )| <
j=0 j=1
so f is absolutely continuous. We then use this fact to apply Theorem 3.11 and
get that f must be differentiable almost everywhere. If x is a point for which
f 0 exists we observe that for any h > 0 we must have that
f (x + h) − f (x)
| |≤M
h
We then take the limit as h → 0 to see that |f 0 (x)| ≤ M whenever f 0 exists (i.e.
almost everywhere).
In the reverse direction, we have that f is absolutely continuous and |f 0 (x)| ≤
M almost everywhere. We apply Theorem 3.11 again to see that for any x, y ∈ R
with x ≤ y we have Z y
f (x) − f (y) = f 0 (t)dt
x
Taking the absolute value gives
Z y Z y Z y
f 0 (t)dt ≤ |f 0 (t)|dt ≤
|f (x) − f (y)| = M dt = M |x − y|
x x x
6
Ben Carriel Math 6110 Midterm Exam October 16, 2012
Problem 4.6.4
We are considering the space
∞
( )
X
2 2
` (Z) = (. . . , a−2 , a−1 , a0 , a1 , a2 , . . .) | ai ∈ C, |ak | < ∞
k=−∞
Note that we have used the inequality |ak +bk | ≤ 2 max{|ak |, |bk |}. Furthermore,
for any λ ∈ C
∞
X ∞
X ∞
X
|λak |2 = |λ|2 |ak |2 = |λ|2 |ak |2 < ∞
k=−∞ k=−∞ k=−∞
The fact that (a, b) = (b, a) follows from the symmetry in the inner product. To
see that (a, a) ≥ 0 for every a ∈ `2 , observe that
∞
X ∞
X
(a, a) = ak ak = |ak |2 ≥ 0
k=−∞ k=−∞
Because the last term is a sum of non-negative values. Now we check that
kak = (a, a)1/2 , which is straightforward because
∞
!1/2 ∞
!1/2
X X
(a, a)1/2 = ak ak = |ak |2 = kak
k=−∞ k=−∞
The next thing we have to verify is that kak = 0 if and only if a = 0. This
2 1/2
P∞ P∞
is clear because k=−∞ |ak | = 0 implies that k=−∞ |ak |2 = 0, which
7
Ben Carriel Math 6110 Midterm Exam October 16, 2012
is only possible if each of the terms |ak |2 = 0. This immediately gives that
|ak | = 0, so that means ak = 0 for every k. So a = 0.
Now we will prove the Cauchy-Schwartz inequality in `2 . Choose a, b ∈ `2 . In
the case that a and b are linearly dependent we have equality. So if a and b are
linearly independent we define
(a, b)
c=a− b
(b, b)
We then observe that
(a, b) (a, b)
(c, b) = a− b, b = (a, b) − (b, b) = 0
(b, b) (b, b)
So this means that c is orthogonal to b. We then apply the Pythagorean theorem
to a = (a,b)
(b,b) b + c to see
(a, b) 2 2 2
2
kak = kbk2 + kck2 = (a, b) + kck ≥ (a, b)
(b, b) kbk2 kbk2
So we multiply by kbk and take square roots to see that |(a, b)| ≤ kakkbk. The
triangle inequality follows immediately, the proof is exactly the same as the one
given on the bottom of page 158 in Stein and Shakarchi modulo a change of
variable, so we forgo it here.
We will now show that `2 is complete in the metric induced by the norm. Let
{ai }i∈Z be a Cauchy sequence in `2 . We can imagine that the elements of each
sequence ai are the rows of an infinite matrix with entries ai,j . We know that
the rows of this matrix all converge to unique limits in C. We also can get the
convergence of the columns by noting that for fixed k
|ai,k − aj,k |2 ≤ kai − aj k2 → 0
when we send min{i, j} → ∞ because {ai } is Cauchy. This means that each
column {ai,j }i∈Z converges to some unique limit bj ∈ C. We then set b =
{bj }j∈Z . It is clear from above that d(ai , b) → 0 as i → ∞. We now need to
show that b ∈ `2 . To show this, we need the following
Proof. Let {xn }n∈Z be a Cauchy sequence in `2 . Then for any > 0 we can
find N > 0 such that |n| > N implies kx|n| − xN k < . We then see that
kx|n| k ≤ kx|n| − xN k + kxN k < kxN k +
We then note that if |n| < N that if
M = max{kx−N +1 k, . . . , kx0 k, kx1 k, . . . , kxN −1 k}
As a result we have that kxn k ≤ max{M, kxN k + } < ∞, so {xn } is bounded
in the norm.
8
Ben Carriel Math 6110 Midterm Exam October 16, 2012
With the lemma in hand we can proceed to see that for any fixed j we have
an M such that
X∞
|ak,j |2 ≤ M 2
k=−∞
It is clear that SN (x) and x agree for all indices |k| ≤ N . We then see that
X
kSN (x) − xk = |xk |
|k|>N