Today’s problem is a commonly appearing exercise in the theory of
spaces.
Problem: Let
be a finite measure space, and let
for all
Show that
Solution: Let’s first understand intuitively why this might be true. As
the parts where
start contributing more to the
-norm of
(since
gets very large for large
and
) while the parts where
contribute less and less to the norm. Thus, we would expect that in the limit as
the part that will contribute to the norm is the largest value of
or in other words, the essential supremum
It also suggests that for this problem, instead of thinking horizontally, that it is instead helpful to think vertically, i.e. in terms of the sets ![]()
Now for a formal proof. We prove the existence and value of the limit by showing both
and
By Hölder’s inequality with
and
we have
![]()
For the other direction, we recall the decomposition
![]()
![]()
![]()
Remark 1: By interpolation theorems, it suffices to take
for any
for the statement of the problem to hold, since then
for any
Remark 2: This result still holds true if
The only issue in our argument is now the application of Hölder’s, which only works on finite measure spaces. In this case, we can instead use the following trick, taking
to be large enough so that
:
![]()
![]()