UMD Analysis Qualifying Exam/Jan08 Real
Contents |
[edit] Problem 1
|
Suppose that |
[edit] Solution 1
[edit] L^1 implies integral of tail end of function goes to zero
![\begin{align}
\lim_{M\rightarrow \infty} \int_{[-M,M]} |f| &=\int_{\mathbb{R}} |f|\\
\lim_{M\rightarrow \infty} \int_{[-M,M]} |f| - \underbrace{\int_{\mathbb{R}} |f|}_{<\infty \mbox { since } f \in L^1} &= 0\\
\int_{\mathbb{R}} |f| - \lim_{M \rightarrow \infty} \int_{[-M,M]} |f| &= 0 \\
\lim_{M \rightarrow \infty} \int_{[-M,M]^c} |f| &= 0
\end{align}
\!\,](http://upload.wikimedia.org/wikibooks/en/math/7/9/e/79e5e32eb6c1e27f56736a5380b1063d.png)
[edit] Assume Not
Suppose
. Then,

or

Without loss of generality, we can assume the first one, i.e.,
(see remark below to see why this)
Note that
can be written as
![\forall \epsilon >0 \left[ \exists M >0 \left[ \forall x > M \left[ |f(x)| < \epsilon\right]\right]\right] \!\,](http://upload.wikimedia.org/wikibooks/en/math/e/2/6/e26b095e7fbbaa489b2fec0b6fda613c.png)
Then, the negation of the above statement gives
![\exists \epsilon_0 >0 [ \forall M >0 [ \exists x_0 > M [ |f(x_0)| > \epsilon_0 ]]] \!\,](http://upload.wikimedia.org/wikibooks/en/math/1/e/4/1e4706f9e2e3cc9e0a147f613b211969.png)
[edit] Apply Uniform Continuity
Because of the uniform continuity, for the
there is a
such that
,
whenever 
Then, if
, by Triangle Inequality, we have

which implies
,
whenever 
[edit] Construct Contradiction
Let
be a number greater than
. Note that
and
do not depend on
. With this in mind, note that
![\int_{[-M,M]^C} |f|> \int_{x_0}^{x_0+\delta(\epsilon_0)} |f| > \frac{\epsilon_0}{2} \delta(\epsilon_0) \qquad \mbox{(*)} \!\,](http://upload.wikimedia.org/wikibooks/en/math/e/f/6/ef6131f84f089ac1c69b14cab74219b9.png)
Then,
![0=\lim_{M \rightarrow \infty} \int_{[-M,M]^C} |f| \geq \frac{\epsilon_0}{2} \delta(\epsilon_0) \!\,](http://upload.wikimedia.org/wikibooks/en/math/d/c/5/dc5581fa647f8eef94371fda10364aca.png)
which is a huge contradiction.
Therefore,

Remark If we choose to work with the assumption that
, then in (*), we just need to work with

instead of the original one
[edit] Solution 1 (Alternate)
By uniform continuity, for all
, there exists
such that for all
,
if
Assume for the sake of contradiction there exists
such that for all
, there exists
such that
and
.
Let
, then there exists
such that
and
.
Let
, then there exists
such that
and
.
Let
, then there exists
such that
and
.
So we have
with
if
and
for all
and for all
.
In other words, we are choosing disjoint subintervals of the real line that are of length
, centered around each
for
, and separated by at least
.
Hence,

which contradicts the assumption that
.
Therefore, for all
there exists
such that for all
,
i.e.
[edit] Problem 3
|
Suppose
|
[edit] Solution 3
By absolute continuity, Fatou's Lemma, and hypothesis we have

Hence
a.e.
From the fundamental theorem of calculus, for all
,
i.e.
is a constant
.
Assume for the sake of contradiction that
, then
.
which contradicts the hypothesis
. Hence,
i.e.
for all 
[edit] Problem 5
|
Suppose that |
[edit] Problem 5a
|
Show that it is a metric linear space with the metric
|
[edit] Solution 5a
[edit] "One-half" triangle inequality
First, for all
,

Taking square roots of both sides of the inequality yields,
[edit] L^1/2 is Linear Space
Hence for all
,

Hence,
is a linear space.
[edit] L^1/2 is Metric Space
[edit] Non-negativity
Since
,
[edit] Zero Distance
[edit] Triangle Inequality
Also, for all
,

From
and
, we conclude that
is a metric space.
[edit] Problem 5b
|
Show that with this metric |
[edit] Solution 5b
For
,
By induction, we then have for all
and all 
[edit] Work with Subsequence of Cauchy Sequence
We can equivalently prove completeness by showing that a subsequence of a Cauchy sequence converges.
[edit] Claim
If a subsequence of a Cauchy sequence converges, then the Cauchy sequence converges.
[edit] Proof
[edit] Construct a subsequence
Choose
such that for all
,
[edit] Setup telescoping sum
Rewrite
as a telescoping sum (successive terms cancel out) i.e.
.
The triangle inequality implies,
which means the sequence
is always dominated by the sequence on the right hand side of the inequality.
[edit] Define a sequence {g}_m
Let
, then
and
.
In other words,
is a sequence of increasing, non-negative functions. Note that
, the limit of
as
, exists since
is increasing. (
is either a finite number
or
.)
Also,

Hence, for all 
[edit] Apply Monotone Convergence Theorem
By the Monotone Convergence Theorem,

Hence,
[edit] Apply Lebesgue Dominated Convergence Theorem
From the Lebesgue dominated convergence theorem,

where the last step follows since 
Hence,

i.e.
is complete.
This page may need to be 



is absolutely continuous on
, and 


.
is the set of all equivalence classes of measurable functions for which

.

is complete.


.

.
