Next: Topology!!!!
Up: Analysis Notes
Previous: Applications of Arzela-Ascoli
Let
be a complete measure space. Let
. Then,
We also want to define
.
Given
,
Then,
For
, define
For
, define
Think of
as the set of functions on a two point space. Then, draw
Monday, 2-28-2005
Proof.
If

, let

and

. Then,
By the triangle inequality,
so
Therefore

and

. Taking the infinum over

and

, we establish Minkowski's Inequality for

.
We must use the following:
Fact: For any real numbers
and
, we have
Proof.
For
![$ s \in [0,1]$](img990.gif)
, we know
So.
Thus,
Rearranging,
WLOG, assume

. Then,
Recall that a function

is convex if
whenever

and
![$ \lambda \in [0,]1$](img1000.gif)
.
If
or
, then there is nothing to do, so suppose
are both nonzero. Put

and

. Then

. Put
and
Now,
Hence,
Taking

roots,

and the inequality is established.
Wednesday, 3-2-2005: Dr. Rammaha teaches
Let us agree that
be any measure space. Then, for
,

is measurable,
where
Because of the Minkowski inequality, it is now trivial to verify that
is a normed space for
.
Definition 5.3
Let
be a normed space and take a sequence
. We say the series
converges absolutely if
converges in
.
Theorem 24
A normed space
is complete if and only if every absolutely convergent series converges in
.
Proof.
Suppose

is very complete - every Cauchy sequence converges. Let

such that
is convergent - say to

. Let

be given. Then, there exists

such that
Set
Then, for all

, we have
(where the last step is by the triangle inequality).
So,

is Cauchy in

, which is complete. Hence,

converges to some point

. We write:
The converse is a bit more tricky. Let
such that
is Cauchy. For every
, there exists a strictly increasing sequence
such that
for all
(we can do this by the definition of a Cauchy sequence).
So, we have a subsequence
Set
and
Set
Also,
Hence,
Hence, by hypothesis,

converges to some point,

. So,
Then, given any

, there exists a

such that

for

and a

such that

for

and

. Hence, for any

,
Hence, the Cauchy sequence converges to

, and

is complete.
Theorem 25
Riesz-Fisher Theorem:
is a Banach space for all
.
Proof.
First, assume

. By the last theorem, we need to show every sequence

such that

is absolutely convergent, then

is convergent in

. So, let

such that
Define
Then,

is an increasing sequence on

with values in
![$ [0,\infty]$](img1077.gif)
. And so,
is measurable and
![$ g(x) \in [0,\infty]$](img1079.gif)
. Now, by the triangle (Minkowski) inequality,
I.e.,
So, by the Monotone Convergence Theorem, we have
Hence,
So,

. By an old theorem,

almost everywhere and so the series
is absolutely convergent for almost all

. Let

be the set on which

converges absolutely. Then, define
Then,
for all

and

is

-measurable. Note
So,

.
Finally, we note the following:
0 almost everywhere
and, for all

,
So, by the Dominated Convergence Theorem,
almost everywhere. Thus,
I.e.,
in

. This proves the completeness of

for

finite.
The case
. Let
be a Cauchy sequence. By the definition of
, for all
, there exists a set
such that
on
and where
. Similarly,
and so for all
, there exists a
such that
on

and where

. Now, for all

, set
Then,

. Also, we still have
and
on

. Now,

as

.
Therefore,

is uniformly Cauchy as

on

. Thus, there exists a function

such that

for all

. Then, set
Now, there exists

(using

uniformly on

) such that
So, for all

, we have
So,

. Now,
So,

in

. Hence,

is complete.
Monday, 3-7-2005:
History Young's original statement: Let
be continuous and strictly increasing. Let
. So,
is continuous and strictly increasing on
. Assume
. For
, set

and
Then, Young's Original Inequality says:
A special case of this inequality is with
where
. Here,
. So, the original inequality gives us that
Definition 5.4
Let
. We say
and
are Holder conjugates if
. Here, if
, then
is the Holder conjugate to
.
So, we get that

and

are Holder conjugates
This is the statement we'd like to prove.
Proof.
(Young's Inequality)
If

, then eq.
2 is trivial. Suppose

- then
2 is equivalent to
Setting

. Then

and
2 is equivalent to
and equality holds if and only if

.
Set
Note,
i.e.,

has a global maximum at

and so
and equality holds if and only if

.
Remark: Let
and
and
(i.e.,
and
are Holder conjugates.) Take
and
and
. Note that
. From eq. 2, we have
Rewriting, this is
Example: Take
.
Proof.
If

or

, then

-almost everywhere or

-almost everywhere, and eq.
3 is trivial. Also, if

or

, then eq.
3 is again trivial. So, we assume that

.
So, eq.
3 is equivalent to
 |
(4) |
Let
Then, by Young's Inequality,
This holds

-almost everywhere, with equality if and only if
By integrating, we have:
So, we get
Wednesday, 3-9-2005:
Proposition 5.1
For
, the set
is dense in
.
Proof.
As

, each element in the sum is in

, so

. Let

. Find a sequence of simple functions

such that

and

pointwise. Writing these functions in standard form,

, the condition that

shows that

, so

. Also,
Hence, by the DCT,

, and

.
Remark: A similar result is true for
.
Definition 5.5
Let
be normed spaces over
and let
be a linear map. We say that
is a bounded linear map if
If
is bounded, we define
Example: Let
$f$ is bounded and has derivatives of all orders
. For
, let
. Then
is a normed space. Define
by
. Then
isn't bounded. Reason:
. So,
but
.
Proposition 5.2
Let
be normed spaces and
a linear map. The following are equivalent.
- (a)
is continuous at 0.
- (b)
is continuous.
- (c)
is bounded.
Proof.

is trivial.

Suppose

and

. Then,

, so by hypotheses,

, i.e.,

.

(Prove the contrapositive). Suppose

isn't bounded. Then

such that

, yet

. Then,

so

in

. But,

, so

does not converge to zero. Hence,

isn't continuous at 0
so

isn't continuous.
Finally, suppose that (c) holds. Let

. Then,
Hence,

. As

so

is continuous at 0
.
Remark:
If
is a bounded linear transformation, then
,
.
Definition 5.6
Linear Functional:
Let
be a normed space. A linear functional is a linear map
and is bounded if it is bounded as a linear transformation.
Example:
Let
and suppose
are Holder conjugates. Let
and fixed
. Define
By Holder's inequality,
is a linear functional on
and
Dividing by
, we get that
. Taking the sup over
, we get that
is bounded and
.
Friday, 3-11-2005:
(Aside on notation:)

counting measure
That is,
Actually, when
, we get equality for any measure and equality also holds when
and
is semifinite.
Proof.
For

:
We have
Put

. Then,
Therefore,

. Moreover,
Put
where

satisfies
Notice that

is measurable. Then

and
Hence,

. We leave the other cases for the interested reader. When

,

and take

. Then

and
Proof.
First assume that

is a finite measure. Define

for

. Then,

. Let

be a disjoint union and let

satisfy

and

. Let
Note that the series converges in

:
Now, we are in a finite measure so the right hand side always exists. By the continuity theorem, we get that this term goes to zero. Hence, the partial sums converge in

, so the whole series converge in

.
Then
Hence,

is absolutely convergent and

. Hence,

is a complex measure.
If

, then

,
Hence,

. By the Radon-Nikodym theorem, there exists a function

such that
By linearity, if

is a simple function,

. As simple functions are dense in

and

is continuous, we see this holds for all

.
We next show that

. Write

, where
Let

be a sequence of simple functions with

and

. Because the measure is finite, we conclude that each

is integrable.
Then,

and when

,
so
Therefore,
By the Monotone Convergence Theorem, we can take the limit to get that

and

. By our previous work,

, so

.
We now establish uniqueness:
Let

and
for all

. Then,
for all

. Take

(

is finite), so
Hence,

almost everywhere.
We now finish the proof for (b). When

, argue as before to obtain

such that
Let

(if

, then we really have nothing to do). Let
Note that

. Put
Then,
and
Therefore,
Taking the sup over possible values of

, we get that
i.e.,

. Uniqueness follows similarly. Hence, this completes the theorem for the case of a finite measure.
Wednesday, 3-23-2005:
We now proceed from the finite case to the
-finite case.
Write
where
and
. Consider the linear functional
on
defined by
Note that

is bounded since
This also shows that

.
By our previous work, there exists a unique

such that
and

.
But,
by the uniqueness assumption.
Define

by
if

. We have

and thus

pointwise. Further,
Therefore,

and

. Finally, for

, put

. Then

pointwise and
by Holder's Inequality. By the DCT:
since

and by the continuity of

. Uniqueness of

follows from the uniqueness of

.
This shows the theorem holds for

and

-finite.
Now if
and
is
-finite, argue as above to obtain unique
and construct
as well. Then,
for all
, and hence
.
Now, let
be an arbitrary measure.
For each set
with
of
-finite measure, let
be such that
Notice that if

and

are both of

-finite measure and

, then

and
Let
So

. Let

be a sequence of

-finite measure such that

. Set
Then

is of

-finite measure. Since

for all

, and

for all

, we have

.
If

and

has

-finite measure, then

, so

too.
Also,

extends

and so
Therefore,

almost everywhere on

and

almost everywhere.
Finally, for

,
is of

-finite measure. So, take

. Thus,
Thus, if

, we get
Next: Topology!!!!
Up: Analysis Notes
Previous: Applications of Arzela-Ascoli
2005-04-15