space
This article explores the space of functions whose integrals have a finite p-th norm. Such spaces are fundamental in many areas of mathematics, particularly in analysis, and they play crucial roles in various applications across physics, engineering, and probability.
Denote by the set of all -measurable functions for which is a -integrable function:
When considering the Lebesgue measure on or on a set the symbol are used without specifying the Lebesgue measure . In place of it is customary to write .
Commonly used values include , with being particularly important due to its Hilbert space structure.
A function is said to be essential bounded if there is a constant such that a.e. on . The greatest lower bound of such constants is called essential supremum of on , and is denoted by . The vector space of all function that are essentially bounded on is denote by with the norm
This section covers two most important inequality for spaces: Hölder's and Minkowski's inequalities.
HÖLDER INEQUALITY
Suppose that and . If and , then . Moreover,
or in the norm form
Proof. Let and let and . Since the exponential function is strictly convex,
with equality only if . Hence
The function is defined a.e. and measurable. If we set and then by previous inequality we get
Integrating we get
This is exactly Hölder's inequality.
THEOREM
Under the hypotheses of the Hölder inequality,
Proof. It comes from the following obvious inequality
An immediate corollary of Hölder’s inequality is the following Cauchy–Schwarz inequality
CAUCHY–SCHWARZ INEQUALITY
If , . Then and
To establish the Minkowski inequalities, we first introduce the following simple lemma.
LEMMA
If and , then
Proof. If , then equality holds. For , the function is convex on ; that is, its graph lies below the chord line joining the points and . Thus
from which the statement of lemma follows at once.
MINKOWSKI’S INEQUALITY
Let and let . Then and
or in the norm form
Proof.Consider the simple inequality
and integration over to find that
Since
from which we obtain by dividing previous inequality by
THEOREM
For , is a normed linear space
Proof. The Minkowski's inequality means that, whenever , the formula
defines a metric on , since the triangle inequality holds true
This is 2.16 Theorem from [Adams2003]
We want to show that the spaces , where are Banach spaces. In order to do it we need to prove that these spaces are complete, e.g. for every Cauchy sequences
exist a limit function inside .
THEOREM
The space , where , is complete with respect to the metric .
Let's prove this theorem.
First assume and let be a Cauchy sequence in . We can extract subsequence of such that
Let's define the monotonicly increasing sequence for as
and due to Minkowski's inequality for any
we get that is bounded in . Putting , we obtain
Hence a.e on and .
Our next goal is to prove that is a Cauchy sequence for almost every , and hence converges pointwise almost everywhere. For all
Therefore, is Cauchy sequence on real line, so it converges. Now we can define the limit
Since a.e, and . Then by Dominated Convergence Theorem,
For any there exists such that if , then . Hence, by Fatou's lemma
Thus as . Therefore is complete and so is a Banach space.
Finally, if is a Cauchy sequence in , then there exists a set having measure zero such that if , then for every
Therefore, converges uniformly on to a bounded function . Setting for , we have and as . Thus is also complete and a Banach space.
THEOREM
If , each Cauchy sequence in has a subsequence converging pointwise almost everywhere on .
This is 2.19 Theorem from [Adams2003]
Approximation is one of the basic tools in theory. Many statements are first proved for very simple functions and then extended to general functions by density. We begin with simple functions.
THEOREM
If , then the set of simple functions , where each is an element of the -algebra and , is dense in .
Proof. If , then is measurable; thus, there exists a sequence of simple functions, such that almost everywhere with
i.e., approximates from below.
For approximation sequence we get -a.e. and Since , the Dominated Convergence Theorem gives
Simple functions are useful for measure-theoretic arguments, but in analysis it is often more convenient to work with continuous functions. On , every function can in fact be approximated by continuous functions with compact support.
THEOREM
is dense in if .
Proof. Let . As we have seen in the previous theorem, there exists a nonnegative sequence of simple functions and some such that .
Since has compact support, it vanishes outside some bounded measurable set of finite measure. By Lusin's theorem, there exists such that
and
Therefore
Hence
This is 2.21 Theorem from [Adams2003]
In this section we assume that is open and that is Lebesgue measure.
THEOREM
If is open and , then is separable.
Proof. For let
Then is a compact subset of . Let be the set of all polynomials on having rational-complex coefficients, and let . is dense in . Moreover, is countable.
If and , there exists such that . If , then there exists in the set such that . It follows that
and so . Thus the countable set is dense in and is separable.
References
- [Adams2003]Adams and Fournier, Sobolev Spaces, 2003.