245A, Notes 2: The Lebesgue integral

19 September, 2010 in math.CA, 245A - Real analysis | Tags: absolute integrability, Egorov's theorem, Lebesgue integration, Littlewood's three principles, Lusin's theorem

In the previous notes, we defined the Lebesgue measure ${m(E)}$ of a Lebesgue measurable set ${E \subset {\bf R}^d}$ , and set out the basic properties of this measure. In this set of notes, we use Lebesgue measure to define the Lebesgue integral

$\displaystyle \int_{{\bf R}^d} f(x)\ dx$

of functions ${f: {\bf R}^d \rightarrow {\bf C} \cup \{\infty\}}$ . Just as not every set can be measured by Lebesgue measure, not every function can be integrated by the Lebesgue integral; the function will need to be Lebesgue measurable. Furthermore, the function will either need to be unsigned (taking values on ${[0,+\infty]}$ ), or absolutely integrable.

To motivate the Lebesgue integral, let us first briefly review two simpler integration concepts. The first is that of an infinite summation

$\displaystyle \sum_{n=1}^\infty c_n$

of a sequence of numbers ${c_n}$ , which can be viewed as a discrete analogue of the Lebesgue integral. Actually, there are two overlapping, but different, notions of summation that we wish to recall here. The first is that of the unsigned infinite sum, when the ${c_n}$ lie in the extended non-negative real axis ${[0,+\infty]}$ . In this case, the infinite sum can be defined as the limit of the partial sums

$\displaystyle \sum_{n=1}^\infty c_n = \lim_{N \rightarrow \infty} \sum_{n=1}^N c_n \ \ \ \ \ (1)$

or equivalently as a supremum of arbitrary finite partial sums:

$\displaystyle \sum_{n=1}^\infty c_n = \sup_{A \subset {\bf N}, A \hbox{ finite}} \sum_{n \in A} c_n. \ \ \ \ \ (2)$

The unsigned infinite sum ${\sum_{n=1}^\infty c_n}$ always exists, but its value may be infinite, even when each term is individually finite (consider e.g. ${\sum_{n=1}^\infty 1}$ ).

The second notion of a summation is the absolutely summable infinite sum, in which the ${c_n}$ lie in the complex plane ${{\bf C}}$ and obey the absolute summability condition

$\displaystyle \sum_{n=1}^\infty |c_n| < \infty,$

where the left-hand side is of course an unsigned infinite sum. When this occurs, one can show that the partial sums ${\sum_{n=1}^N c_n}$ converge to a limit, and we can then define the infinite sum by the same formula (1) as in the unsigned case, though now the sum takes values in ${{\bf C}}$ rather than ${[0,+\infty]}$ . The absolute summability condition confers a number of useful properties that are not obeyed by sums that are merely conditionally convergent; most notably, the value of an absolutely convergent sum is unchanged if one rearranges the terms in the series in an arbitrary fashion. Note also that the absolutely summable infinite sums can be defined in terms of the unsigned infinite sums by taking advantage of the formulae

$\displaystyle \sum_{n=1}^\infty c_n = (\sum_{n=1}^\infty \hbox{Re}(c_n)) + i (\sum_{n=1}^\infty \hbox{Im}(c_n))$

for complex absolutely summable ${c_n}$ , and

$\displaystyle \sum_{n=1}^\infty c_n = \sum_{n=1}^\infty c_n^+ - \sum_{n=1}^\infty c_n^-$

for real absolutely summable ${c_n}$ , where ${c_n^+ := \max(c_n,0)}$ and ${c_n^- := \max(-c_n,0)}$ are the (magnitudes of the) positive and negative parts of ${c_n}$ .

In an analogous spirit, we will first define an unsigned Lebesgue integral ${\int_{{\bf R}^d} f(x)\ dx}$ of (measurable) unsigned functions ${f: {\bf R}^d \rightarrow [0,+\infty]}$ , and then use that to define the absolutely convergent Lebesgue integral ${\int_{{\bf R}^d} f(x)\ dx}$ of absolutely integrable functions ${f: {\bf R}^d \rightarrow {\bf C} \cup \{\infty\}}$ . (In contrast to absolutely summable series, which cannot have any infinite terms, absolutely integrable functions will be allowed to occasionally become infinite. However, as we will see, this can only happen on a set of Lebesgue measure zero.)

To define the unsigned Lebesgue integral, we now turn to another more basic notion of integration, namely the Riemann integral ${\int_a^b f(x)\ dx}$ of a Riemann integrable function ${f: [a,b] \rightarrow {\bf R}}$ . Recall from the prologue that this integral is equal to the lower Darboux integral

$\displaystyle \int_a^b f(x) = \underline{\int_a^b} f(x)\ dx := \sup_{g \leq f; g \hbox{ piecewise constant}} \hbox{p.c.} \int_a^b g(x)\ dx.$

(It is also equal to the upper Darboux integral; but much as the theory of Lebesgue measure is easiest to define by relying solely on outer measure and not on inner measure, the theory of the unsigned Lebesgue integral is easiest to define by relying solely on lower integrals rather than upper ones; the upper integral is somewhat problematic when dealing with “improper” integrals of functions that are unbounded or are supported on sets of infinite measure.) Compare this formula also with (2). The integral ${\hbox{p.c.} \int_a^b g(x)\ dx}$ is a piecewise constant integral, formed by breaking up the piecewise constant functions ${g, h}$ into finite linear combinations of indicator functions of intervals, and then measuring the length of each interval.

It turns out that virtually the same definition allows us to define a lower Lebesgue integral ${\underline{\int_{{\bf R}^d}} f(x)\ dx}$ of any unsigned function ${f: {\bf R}^d \rightarrow [0,+\infty]}$ , simply by replacing intervals with the more general class of Lebesgue measurable sets (and thus replacing piecewise constant functions with the more general class of simple functions). If the function is Lebesgue measurable (a concept that we will define presently), then we refer to the lower Lebesgue integral simply as the Lebesgue integral. As we shall see, it obeys all the basic properties one expects of an integral, such as monotonicity and additivity; in subsequent notes we will also see that it behaves quite well with respect to limits, as we shall see by establishing the two basic convergence theorems of the unsigned Lebesgue integral, namely Fatou’s lemma and the monotone convergence theorem.

Once we have the theory of the unsigned Lebesgue integral, we will then be able to define the absolutely convergent Lebesgue integral, similarly to how the absolutely convergent infinite sum can be defined using the unsigned infinite sum. This integral also obeys all the basic properties one expects, such as linearity and compatibility with the more classical Riemann integral; in subsequent notes we will see that it also obeys a fundamentally important convergence theorem, the dominated convergence theorem. This convergence theorem makes the Lebesgue integral (and its abstract generalisations to other measure spaces than ${{\bf R}^d}$ ) particularly suitable for analysis, as well as allied fields that rely heavily on limits of functions, such as PDE, probability, and ergodic theory.

Remark 1 This is not the only route to setting up the unsigned and absolutely convergent Lebesgue integrals. Stein-Shakarchi, for instance, proceeds slightly differently, beginning with the unsigned integral but then making an auxiliary stop at integration of functions that are bounded and are supported on a set of finite measure, before going to the absolutely convergent Lebesgue integral. Another approach (which will not be discussed here) is to take the metric completion of the Riemann integral with respect to the ${L^1}$ metric.

The Lebesgue integral and Lebesgue measure can be viewed as completions of the Riemann integral and Jordan measure respectively. This means three things. Firstly, the Lebesgue theory extends the Riemann theory: every Jordan measurable set is Lebesgue measurable, and every Riemann integrable function is Lebesgue measurable, with the measures and integrals from the two theories being compatible. Conversely, the Lebesgue theory can be approximated by the Riemann theory; as we saw in the previous notes, every Lebesgue measurable set can be approximated (in various senses) by simpler sets, such as open sets or elementary sets, and in a similar fashion, Lebesgue measurable functions can be approximated by nicer functions, such as Riemann integrable or continuous functions. Finally, the Lebesgue theory is complete in various ways; we will formalise this properly only in the next quarter when we study ${L^p}$ spaces, but the convergence theorems mentioned above already hint at this completeness. A related fact, known as Egorov’s theorem, asserts that a pointwise converging sequence of functions can be approximated as a (locally) uniformly converging sequence of functions. The facts listed here manifestations of Littlewood’s three principles of real analysis, which capture much of the essence of the Lebesgue theory.

— 1. Integration of simple functions —

Much as the Riemann integral was set up by first using the integral for piecewise constant functions, the Lebesgue integral is set up using the integral for simple functions.

Definition 1 (Simple function) A (complex-valued) simple function ${f: {\bf R}^d \rightarrow {\bf C}}$ is a finite linear combination

$\displaystyle f = c_1 1_{E_1} + \ldots + c_k 1_{E_k} \ \ \ \ \ (3)$

of indicator functions ${1_{E_i}}$ of Lebesgue measurable sets ${E_i \subset {\bf R}^d}$ for ${i=1,\ldots,k}$ , where ${k \geq 0}$ is a natural number and ${c_1,\ldots,c_k \in {\bf C}}$ are complex numbers. An unsigned simple function ${f: {\bf R}^d \rightarrow [0,+\infty]}$ , is defined similarly, but with the ${c_i}$ taking values in ${[0,+\infty]}$ rather than ${{\bf C}}$ .

It is clear from construction that the space ${\hbox{Simp}({\bf R}^d)}$ of complex-valued simple functions forms a complex vector space; also, ${\hbox{Simp}({\bf R}^d)}$ also closed under pointwise product ${f, g \mapsto fg}$ and complex conjugation ${f \mapsto \overline{f}}$ . In short, ${\hbox{Simp}({\bf R}^d)}$ is a commutative ${*}$ -algebra. Meanwhile, the space ${\hbox{Simp}^+({\bf R}^d)}$ of unsigned simple functions is a ${[0,+\infty]}$ -module; it is closed under addition, and under scalar multiplication by elements in ${[0,+\infty]}$ .

In this definition, we did not require the ${E_1,\ldots,E_k}$ to be disjoint. However, it is easy enough to arrange this, basically by exploiting Venn diagrams (or, to use fancier language, finite boolean algebras). Indeed, any ${k}$ subsets ${E_1,\ldots,E_k}$ of ${{\bf R}^d}$ partition ${{\bf R}^d}$ into ${2^k}$ disjoint sets, each of which is an intersection of ${E_i}$ or the complement ${{\bf R}^d \backslash E_i}$ for ${i=1,\ldots,k}$ (and in particular, is measurable). The (complex or unsigned) simple function is constant on each of these sets, and so can easily be decomposed as a linear combination of the indicator function of these sets. One easy consequence of this is that if ${f}$ is a complex-valued simple function, then its absolute value ${|f|: x \mapsto |f(x)|}$ is an unsigned simple function.

It is geometrically intuitive that we should define the integral ${\int_{{\bf R}^d} 1_E(x)\ dx}$ of an indicator function of a measurable set ${E}$ to equal ${m(E)}$ :

$\displaystyle \int_{{\bf R}^d} 1_E(x)\ dx = m(E).$

Using this and applying the laws of integration formally, we are led to propose the following definition for the integral of an unsigned simple function:

Definition 2 (Integral of a unsigned simple function) If ${f = c_1 1_{E_1} + \ldots + c_k 1_{E_k}}$ is an unsigned simple function, the integral ${\hbox{Simp} \int_{{\bf R}^d} f(x)\ dx}$ is defined by the formula

$\displaystyle \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx := c_1 m(E_1) + \ldots + c_k m(E_k),$

thus ${\hbox{Simp} \int_{{\bf R}^d} f(x)\ dx}$ will take values in ${[0,+\infty]}$ .

However, one has to actually check that this definition is well-defined, in the sense that different representations

$\displaystyle f = c_1 1_{E_1} + \ldots + c_k 1_{E_k} = c'_1 1_{E'_1} + \ldots + c'_{k'} 1_{E'_{k'}}$

of a function as a finite unsigned combination of indicator functions of measurable sets will give the same value for the integral ${\hbox{Simp} \int_{{\bf R}^d} f(x)\ dx}$ . This is the purpose of the following lemma:

Lemma 3 (Well-definedness of simple integral) Let ${k, k' \geq 0}$ be natural numbers, ${c_1,\ldots,c_k,c'_1,\ldots,c'_{k'} \in [0,+\infty]}$ , and let ${E_1,\ldots,E_k,E'_1,\ldots,E'_{k'} \subset {\bf R}^d}$ be Lebesgue measurable sets such that the identity

$\displaystyle c_1 1_{E_1} + \ldots + c_k 1_{E_k} = c'_1 1_{E'_1} + \ldots + c'_{k'} 1_{E'_{k'}} \ \ \ \ \ (4)$

holds identically on ${{\bf R}^d}$ . Then one has

$\displaystyle c_1 m(E_1) + \ldots + c_k m(E_k) = c'_1 m(E'_1) + \ldots + c'_{k'} m(E'_{k'}).$

Proof: We again use a Venn diagram argument. The ${k+k'}$ sets ${E_1,\ldots,E_k,E'_1,\ldots,E'_{k'}}$ partition ${{\bf R}^d}$ into ${2^{k+k'}}$ disjoint sets, each of which is an intersection of some of the ${E_1,\ldots,E_k,E'_1,\ldots,E'_{k'}}$ and their complements. We throw away any sets that are empty, leaving us with a partition of ${{\bf R}^d}$ into ${m}$ non-empty disjoint sets ${A_1,\ldots,A_m}$ for some ${0 \leq m \leq 2^{k+k'}}$ . As the ${E_1,\ldots,E_k,E'_1,\ldots,E'_k}$ are Lebesgue measurable, the ${A_1,\ldots,A_m}$ are too. By construction, each of the ${E_1,\ldots,E_k,E'_1,\ldots,E_{k'}}$ arise as unions of some of the ${A_1,\ldots,A_m}$ , thus we can write

$\displaystyle E_i = \bigcup_{j \in J_i} A_j$

and

$\displaystyle E'_{i'} = \bigcup_{j' \in J'_{i'}} A_{j'}$

for all ${i=1,\ldots,k}$ and ${i'=1,\ldots,k'}$ , and some subsets ${J_i, J'_{i'} \subset \{1,\ldots,m\}}$ . By finite additivity of Lebesgue measure, we thus have

$\displaystyle m(E_i) = \sum_{j \in J_i} m(A_j)$

and

$\displaystyle m(E'_{i'}) = \sum_{j \in J'_{i'}} m(A_{j})$

Thus, our objective is now to show that

$\displaystyle \sum_{i=1}^k c_i \sum_{j \in J_i} m(A_j) = \sum_{i'=1}^{k'} c'_{i'} \sum_{j \in J'_{i'}} m(A_{j}). \ \ \ \ \ (5)$

To obtain this, we fix ${1 \leq j \leq m}$ and evaluate (4) at a point ${x}$ in the non-empty set ${A_j}$ . At such a point, ${1_{E_i}(x)}$ is equal to ${1_{J_i}(j)}$ , and similarly ${1_{E'_{i'}}}$ is equal to ${1_{J'_{i'}}(j)}$ . From (4) we conclude that

$\displaystyle \sum_{i=1}^k c_i 1_{J_i}(j) = \sum_{i'=1}^{k'} c'_{i'} 1_{J'_{i'}}(j).$

Multiplying this by ${m(A_j)}$ and then summing over all ${j=1,\ldots,m}$ we obtain (5). $\Box$

We now make some important definitions that we will use repeatedly in the course:

Definition 4 (Almost everywhere and support) A property ${P(x)}$ of a point ${x \in {\bf R}^d}$ is said to hold (Lebesgue) almost everywhere in ${{\bf R}^d}$ , or for (Lebesgue) almost every point ${x \in {\bf R}^d}$ , if the set of ${x \in {\bf R}^d}$ for which ${P(x)}$ fails has Lebesgue measure zero (i.e. ${P}$ is true outside of a null set). We usually omit the prefix Lebesgue, and often abbreviate “almost everywhere” or “almost every” as a.e.

Two functions ${f, g: {\bf R}^d \rightarrow Z}$ into an arbitrary range ${Z}$ are said to agree almost everywhere if one has ${f(x)=g(x)}$ for almost every ${x \in {\bf R}^d}$ .

The support of a function ${f: {\bf R}^d \rightarrow {\bf C}}$ or ${f: {\bf R}^d \rightarrow [0,+\infty]}$ is defined to be the set ${\{x \in {\bf R}^d: f(x) \neq 0 \}}$ where ${f}$ is non-zero.

Note that if ${P(x)}$ holds for almost every ${x}$ , and ${P(x)}$ implies ${Q(x)}$ , then ${Q(x)}$ holds for almost every ${x}$ . Also, if ${P_1(x), P_2(x), \ldots}$ are an at most countable family of properties, each of which individually holds for almost every ${x}$ , then they will simultaneously be true for almost every ${x}$ , because the countable union of null sets is still a null set. Because of these properties, one can (as a rule of thumb) treat the almost universal quantifier “for almost every” as if it was the truly universal quantifier “for every”, as long as one is only concatenating at most countably many properties together, and as long as one never specialises the free variable ${x}$ to a null set. Observe also that the property of agreeing almost everywhere is an equivalence relation, which we will refer to as almost everywhere equivalence.

In later notes we will also see the notion of the closed support of a function ${f: {\bf R}^d \rightarrow {\bf C}}$ , defined as the closure of the support.

The following properties of the simple unsigned integral are easily obtained from the definitions:

Exercise 1 (Basic properties of the simple unsigned integral) Let ${f, g: {\bf R}^d \rightarrow [0,+\infty]}$ be simple unsigned functions.

(Unsigned linearity) We have
$\displaystyle \hbox{Simp} \int_{{\bf R}^d} f(x)+g(x)\ dx = \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx$

$\displaystyle + \hbox{Simp} \int_{{\bf R}^d} g(x)\ dx$

and

$\displaystyle \hbox{Simp} \int_{{\bf R}^d} c f(x)\ dx = c \times \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx$

for all ${c \in [0,+\infty]}$ .

(Finiteness) We have ${\hbox{Simp} \int_{{\bf R}^d} f(x)\ dx < \infty}$ if and only if ${f}$ is finite almost everywhere, and its support has finite measure.

(Vanishing) We have ${\hbox{Simp} \int_{{\bf R}^d} f(x)\ dx = 0}$ if and only if ${f}$ is zero almost everywhere.

(Equivalence) If ${f}$ and ${g}$ agree almost everywhere, then ${\hbox{Simp} \int_{{\bf R}^d} f(x)\ dx = \hbox{Simp} \int_{{\bf R}^d} g(x)\ dx}$ .

(Monotonicity) If ${f(x) \leq g(x)}$ for almost every ${x \in {\bf R}^d}$ , then ${\hbox{Simp} \int_{{\bf R}^d} f(x)\ dx \leq \hbox{Simp} \int_{{\bf R}^d} g(x)\ dx}$ .

(Compatibility with Lebesgue measure) For any Lebesgue measurable ${E}$ , one has ${\hbox{Simp} \int_{{\bf R}^d} 1_E(x)\ dx = m(E)}$ .

Furthermore, show that the simple unsigned integral ${f \mapsto \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx}$ is the only map from the space ${\hbox{Simp}^+({\bf R}^d)}$ of unsigned simple functions to ${[0,+\infty]}$ that obeys all of the above properties.

We can now define an absolutely convergent counterpart to the simple unsigned integral. This integral will be superceded by the absolutely Lebesgue integral, but we give it here as motivation for that more general notion of integration.

Definition 5 (Absolutely convergent simple integral) A complex-valued simple function ${f: {\bf R}^d \rightarrow {\bf C}}$ is said to be absolutely integrable if ${\hbox{Simp} \int_{{\bf R}^d} |f(x)|\ dx < \infty}$ . If ${f}$ is absolutely integrable, the integral ${\hbox{Simp} \int_{{\bf R}^d} f(x)\ dx}$ is defined for real signed ${f}$ by the formula

$\displaystyle \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx := \hbox{Simp} \int_{{\bf R}^d} f_+(x)\ dx - \hbox{Simp} \int_{{\bf R}^d} f_-(x)\ dx$

where ${f_+(x) := \max(f(x),0)}$ and ${f_-(x) := \max(-f(x),0)}$ (note that these are unsigned simple functions that are pointwise dominated by ${|f|}$ and thus have finite integral), and for complex-valued ${f}$ by the formula

$\displaystyle \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx := \hbox{Simp} \int_{{\bf R}^d} \hbox{Re} f(x)\ dx$

$\displaystyle + i \hbox{Simp} \int_{{\bf R}^d} \hbox{Im} f(x)\ dx.$

(Strictly speaking, this is an abuse of notation as we have now defined the simple integral ${\hbox{Simp} \int_{{\bf R}^d}}$ three different times, for unsigned, real signed, and complex-valued simple functions, but one easily verifies that these three definitions agree with each other on their common domains of definition, so it is safe to use a single notation for all three.)

Note from the preceding exercise that a complex-valued simple function ${f}$ is absolutely integrable if and only if it has finite measure support (since finiteness almost everywhere is automatic). In particular, the space ${\hbox{Simp}^{abs}({\bf R}^d)}$ of absolutely integrable simple functions is closed under addition and scalar multiplication by complex numbers, and is thus a complex vector space.

The properties of the unsigned simple integral then can be used to deduce analogous properties for the complex-valued integral:

Exercise 2 (Basic properties of the complex-valued simple integral) Let ${f, g: {\bf R}^d \rightarrow {\bf C}}$ be absolutely integrable simple functions.

(*-linearity) We have
$\displaystyle \hbox{Simp} \int_{{\bf R}^d} f(x)+g(x)\ dx = \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx$

$\displaystyle + \hbox{Simp} \int_{{\bf R}^d} g(x)\ dx$

and

$\displaystyle \hbox{Simp} \int_{{\bf R}^d} c f(x)\ dx = c \times \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx \ \ \ \ \ (6)$

for all ${c \in {\bf C}}$ . Also we have

$\displaystyle \hbox{Simp} \int_{{\bf R}^d} \overline{f}(x)\ dx = \overline{\hbox{Simp} \int_{{\bf R}^d} f(x)\ dx}.$

(Equivalence) If ${f}$ and ${g}$ agree almost everywhere, then ${\hbox{Simp} \int_{{\bf R}^d} f(x)\ dx = \hbox{Simp} \int_{{\bf R}^d} g(x)\ dx}$ .

(Compatibility with Lebesgue measure) For any Lebesgue measurable ${E}$ , one has ${\hbox{Simp} \int_{{\bf R}^d} 1_E(x)\ dx = m(E)}$ .

(Hints: Work out the real-valued counterpart of the linearity property first. To establish (6), treat the cases ${c>0, c=0, c=-1}$ separately. To deal with the additivity for real functions ${f,g}$ , start with the identity

$\displaystyle f + g = (f+g)_+ - (f+g)_- = (f_+-f_-) + (g_+-g_-)$

and rearrange the second inequality so that no subtraction appears.) Furthermore, show that the complex-valued simple integral ${f \mapsto \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx}$ is the only map from the space ${\hbox{Simp}^{abs}({\bf R}^d)}$ of absolutely integrable simple functions to ${{\bf C}}$ that obeys all of the above properties.

We now comment further on the fact that (simple) functions that agree almost everywhere, have the same integral. We can view this as an assertion that integration is a noise-tolerant operation: one can have “noise” or “errors” in a function ${f(x)}$ on a null set, and this will not affect the final value of the integral. Indeed, once one has this noise tolerance, one can even integrate functions ${f}$ that are not defined everywhere on ${{\bf R}^d}$ , but merely defined almost everywhere on ${{\bf R}^d}$ (i.e. ${f}$ is defined on some set ${{\bf R}^d \backslash N}$ where ${N}$ is a null set), simply by extending ${f}$ to all of ${{\bf R}^d}$ in some arbitrary fashion (e.g. by setting ${f}$ equal to zero on ${N}$ ). This is extremely convenient for analysis, as there are many natural functions (e.g. ${\frac{\sin x}{x}}$ in one dimension, or ${\frac{1}{|x|^\alpha}}$ for various ${\alpha > 0}$ in higher dimensions) that are only defined almost everywhere instead of everywhere (often due to “division by zero” problems when a denominator vanishes). While such functions cannot be evaulated at certain singular points, they can still be integrated (provided they obey some integrability condition, of course, such as absolute integrability), and so one can still perform a large portion of analysis on such functions.

In fact, in the subfield of analysis known as functional analysis, it is convenient to abstract the notion of an almost everywhere defined function somewhat, by replacing any such function ${f}$ with the equivalence class of almost everywhere defined functions that are equal to ${f}$ almost everywhere. Such classes are then no longer functions in the standard set-theoretic sense (they do not map each point in the domain to a unique point in the range, since points in ${{\bf R}^d}$ have measure zero), but the properties of various function spaces improve when one does this (various semi-norms become norms, various topologies become Hausdorff, and so forth). See these 245B lecture notes for further discussion.

Remark 2 The “Lebesgue philosophy” that one is willing to lose control on sets of measure zero is a perspective that distinguishes Lebesgue-type analysis from other types of analysis, most notably that of descriptive set theory, which is also interested in studying subsets of ${{\bf R}^d}$ , but can give completely different structural classifications to a pair of sets that agree almost everywhere. This loss of control on null sets is the price one has to pay for gaining access to the powerful tool of the Lebesgue integral; if one needs to control a function at absolutely every point, and not just almost every point, then one often needs to use other tools than integration theory (unless one has some regularity on the function, such as continuity, that lets one pass from almost everywhere true statements to everywhere true statements).

— 2. Measurable functions —

Much as the piecewise constant integral can be completed to the Riemann integral, the unsigned simple integral can be completed to the unsigned Lebesgue integral, by extending the class of unsigned simple functions to the larger class of unsigned Lebesgue measurable functions. One of the shortest ways to define this class is as follows:

Definition 6 (Unsigned measurable function) An unsigned function ${f: {\bf R}^d \rightarrow [0,+\infty]}$ is unsigned Lebesgue measurable, or measurable for short, if it is the pointwise limit of unsigned simple functions, i.e. if there exists a sequence ${f_1, f_2, f_3, \ldots: {\bf R}^d \rightarrow [0,+\infty]}$ of unsigned simple functions such that ${f_n(x) \rightarrow f(x)}$ for every ${x \in {\bf R}^d}$ .

This particular definition is not always the most tractable. Fortunately, it has many equivalent forms:

Lemma 7 (Equivalent notions of measurability) Let ${f: {\bf R}^d \rightarrow [0,+\infty]}$ be an unsigned function. Then the following are equivalent:

${f}$ is unsigned Lebesgue measurable.

${f}$ is the pointwise limit of unsigned simple functions ${f_n}$ (thus the limit ${\lim_{n \rightarrow \infty} f_n(x)}$ exists and is equal to ${f(x)}$ for all ${x \in {\bf R}^d}$ ).

${f}$ is the pointwise almost everywhere limit of unsigned simple functions ${f_n}$ (thus the limit ${\lim_{n \rightarrow \infty} f_n(x)}$ exists and is equal to ${f(x)}$ for almost every ${x \in {\bf R}^d}$ ).

${f}$ is the supremum ${f(x) = \sup_n f_n(x)}$ of an increasing sequence ${0 \leq f_1 \leq f_2 \leq \ldots}$ of unsigned simple functions ${f_n}$ , each of which are bounded with finite measure support.

For every ${\lambda \in [0,+\infty]}$ , the set ${\{ x \in {\bf R}^d: f(x) > \lambda \}}$ is Lebesgue measurable.

For every ${\lambda \in [0,+\infty]}$ , the set ${\{ x \in {\bf R}^d: f(x) \geq \lambda \}}$ is Lebesgue measurable.

For every ${\lambda \in [0,+\infty]}$ , the set ${\{ x \in {\bf R}^d: f(x) < \lambda \}}$ is Lebesgue measurable.

For every ${\lambda \in [0,+\infty]}$ , the set ${\{ x \in {\bf R}^d: f(x) \leq \lambda \}}$ is Lebesgue measurable.

For every interval ${I \subset [0,+\infty)}$ , the set ${f^{-1}(I) := \{ x\in {\bf R}^d: f(x) \in I \}}$ is Lebesgue measurable.

For every (relatively) open set ${U \subset [0,+\infty)}$ , the set ${f^{-1}(U) := \{ x \in {\bf R}^d: f(x) \in U \}}$ is Lebesgue measurable.

For every (relatively) closed set ${K \subset [0,+\infty)}$ , the set ${f^{-1}(K) := \{ x \in {\bf R}^d: f(x) \in K \}}$ is Lebesgue measurable.

Proof: (1.) and (2.) are equivalent by definition. (2.) clearly implies (3.). As every monotone sequence in ${[0,+\infty]}$ converges, (4.) implies (2.). Now we show that (3.) implies (5.). If ${f}$ is the pointwise almost everywhere limit of ${f_n}$ , then for almost every ${x \in {\bf R}^d}$ one has

$\displaystyle f(x) = \lim_{n \rightarrow \infty} f_n(x) = \limsup_{n \rightarrow \infty} f_n(x) = \inf_{N>0} \sup_{n\geq N} f_n(x).$

This implies that, for any ${\lambda}$ , the set ${\{ x \in {\bf R}^d: f(x) > \lambda \}}$ is equal to

$\displaystyle \bigcup_{M>0} \bigcap_{N>0} \{ x \in {\bf R}^d: \sup_{n \geq N} f_n(x) > \lambda + \frac{1}{M} \}$

outside of a set of measure zero; this set in turn is equal to

$\displaystyle \bigcup_{M>0} \bigcap_{N>0} \bigcup_{n \ge N} \{ x \in {\bf R}^d: f_n(x) > \lambda + \frac{1}{M} \}$

outside of a set of measure zero. But as each ${f_n}$ is an unsigned simple function, the sets ${\{ x \in {\bf R}^d: f_n(x) > \lambda + \frac{1}{M} \}}$ are Lebesgue measurable. Since countable unions or countable intersections of Lebesgue measurable sets are Lebesgue measurable, and modifying a Lebesgue measurable set on a null set produces another Lebesgue measurable set, we obtain (5.).

To obtain the equivalence of (5.) and (6.), observe that

$\displaystyle \{ x \in {\bf R}^d: f(x) \geq \lambda \} = \bigcap_{\lambda' \in {\bf Q}^+: \lambda' < \lambda} \{ x \in {\bf R}^d: f(x) > \lambda' \}$

for ${\lambda \in (0,+\infty]}$ and

$\displaystyle \{ x \in {\bf R}^d: f(x) > \lambda \} = \bigcup_{\lambda' \in {\bf Q}^+: \lambda' > \lambda} \{ x \in {\bf R}^d: f(x) \geq \lambda' \}$

${\lambda \in [0,+\infty)}$ , where ${{\bf Q}^+ := {\bf Q} \cap [0,+\infty]}$ are the non-negative rationals. The claim then easily follows from the countable nature of ${{\bf Q}^+}$ (treating the extreme cases ${\lambda = 0, +\infty}$ separately if necessary). A similar argument lets one deduce (5.) or (6.) from (9.).

The equivalence of (5.), (6.) with (7.), (8.) comes from the observation that ${\{ x \in {\bf R}^d: f(x) \leq \lambda \}}$ is the complement of ${\{ x \in {\bf R}^d: f(x) > \lambda \}}$ , and ${\{ x \in {\bf R}^d: f(x) < \lambda \}}$ is the complement of ${\{ x \in {\bf R}^d: f(x) \geq \lambda \}}$ . A similar argument shows that (10.) and (11.) are equivalent.

By expressing an interval as the intersection of two half-intervals, we see that (9.) follows from (5.)-(8.), and so all of (5.)-(9.) are now shown to be equivalent.

Clearly (10.) implies (7.), and hence (5.)-(9.). Conversely, because every open set in ${[0,+\infty)}$ is the union of countably many open intervals in ${[0,+\infty)}$ , (9.) implies (10.).

The only remaining task is to show that (5.)-(11.) implies (4.). Let ${f}$ obey (5.)-(11.). For each positive integer ${n}$ , we let ${f_n(x)}$ be defined to be the largest integer multiple of ${2^{-n}}$ that is less than or equal to ${\min(f(x),n)}$ when ${|x| \leq n}$ , with ${f_n(x) := 0}$ for ${|x| > n}$ . From construction it is easy to see that the ${f_n: {\bf R}^d \rightarrow [0,+\infty]}$ are increasing and have ${f}$ as their supremum. Furthermore, each ${f_n}$ takes on only finitely many values, and for each non-zero value ${c}$ it attains, the set ${f_n^{-1}(c)}$ takes the form ${f^{-1}(I_c) \cap \{ x \in {\bf R}^d: |x| \leq n \}}$ for some interval or ray ${I_c}$ , and is thus measurable. As a consequence, ${f_n}$ is a simple function, and by construction it is bounded and has finite measure support. The claim follows. $\Box$

With these equivalent formulations, we can now generate plenty of measurable functions:

Exercise 3

Show that every continuous function ${f: {\bf R}^d \rightarrow [0,+\infty]}$ is measurable.

Show that every unsigned simple function is measurable.

Show that the supremum, infimum, limit superior, or limit inferior of unsigned measurable functions is unsigned measurable.

Show that an unsigned function that is equal almost everywhere to an unsigned measurable function, is itself measurable.

Show that if a sequence ${f_n}$ of unsigned measurable functions converges pointwise almost everywhere to an unsigned limit ${f}$ , then ${f}$ is also measurable.

If ${f: {\bf R}^d \rightarrow [0,+\infty]}$ is measurable and ${\phi: [0,+\infty] \rightarrow [0,+\infty]}$ is continuous, show that ${\phi \circ f: {\bf R}^d \rightarrow [0,+\infty]}$ is measurable.

If ${f, g}$ are unsigned measurable functions, show that ${f+g}$ and ${fg}$ are measurable.

In view of part (4.) of the above exercise, one can define the concept of measurability for an unsigned function that is only defined almost everywhere on ${{\bf R}^d}$ , rather than everywhere on ${{\bf R}^d}$ , by extending that function arbitrarily to the null set where it is currently undefined.

Exercise 4 Let ${f: {\bf R}^d \rightarrow [0,+\infty]}$ . Show that ${f}$ is a bounded unsigned measurable function if and only if ${f}$ is the uniform limit of bounded simple functions.

Exercise 5 Show that an unsigned function ${f: {\bf R}^d \rightarrow [0,+\infty]}$ is a simple function if and only if it is measurable and takes on at most finitely many values.

Exercise 6 Let ${f: {\bf R}^d \rightarrow [0,+\infty]}$ be an unsigned measurable function. Show that the region ${\{ (x,t) \in {\bf R}^d \times {\bf R}: 0 \leq t \leq f(x) \}}$ is a measurable subset of ${{\bf R}^{d+1}}$ . (There is a converse to this statement, but we will wait until later notes to prove it, once we have the Fubini-Tonelli theorem available to us.)

Remark 3 Lemma 7 tells us that if ${f: {\bf R}^d \rightarrow [0,+\infty]}$ is measurable, then ${f^{-1}(E)}$ is Lebesgue measurable for many classes of sets ${E}$ . However, we caution that it is not necessarily the case that ${f^{-1}(E)}$ is Lebesgue measurable if ${E}$ is Lebesgue measurable. To see this, we let ${C}$ be the Cantor set

$\displaystyle C := \{ \sum_{j=1}^\infty a_j 3^{-j}: a_j \in \{0,2\} \hbox{ for all } j\}$

and let ${f: {\bf R} \rightarrow [0,+\infty]}$ be the function defined by setting

$\displaystyle f(x) := \sum_{j=1}^\infty 2 b_j 3^{-j}$

whenever ${x \in [0,1]}$ is not a terminating binary decimal, and so has a unique binary expansion ${x = \sum_{j=1}^\infty b_j 2^{-j}}$ for some ${b_j \in\{0,1\}}$ , and ${f(x) := 0}$ otherwise. We thus see that ${f}$ takes values in ${C}$ , and is bijective on the set ${A}$ of non-terminating decimals in ${[0,1]}$ . Using Lemma 7, it is not difficult to show that ${f}$ is measurable. On the other hand, by modifying the construction from the previous notes, we can find a subset ${F}$ of ${A}$ which is non-measurable. If we set ${E := f(F)}$ , then ${E}$ is a subset of the null set ${C}$ and is thus itself a null set; but ${f^{-1}(E) = F}$ is non-measurable, and so the inverse image of a Lebesgue measurable set by a measurable function need not remain Lebesgue measurable.

However, in later notes we will see that it is still true that ${f^{-1}(E)}$ is Lebesgue measurable if ${E}$ has a slightly stronger measurability property than Lebesgue measurability, namely Borel measurability.

Now we can define the concept of a complex-valued measurable function. As discussed earlier, it will be convenient to allow for such functions to only be defined almost everywhere, rather than everywhere, to allow for the possibility that the function becomes singular or otherwise undefined on a null set.

Definition 8 (Complex measurability) An almost everywhere defined complex-valued function ${f: {\bf R}^d \rightarrow {\bf C}}$ is Lebesgue measurable, or measurable for short, if it is the pointwise almost everywhere limit of complex-valued simple functions.

As before, there are several equivalent definitions:

Exercise 7 Let ${f: {\bf R}^d \rightarrow {\bf C}}$ be an almost everywhere defined complex-valued function. Then the following are equivalent:

${f}$ is measurable.

${f}$ is the pointwise almost everywhere limit of complex-valued simple functions.

The (magnitudes of the) positive and negative parts of ${\hbox{Re}(f)}$ and ${\hbox{Im}(f)}$ are unsigned measurable functions.

${f^{-1}(U)}$ is Lebesgue measurable for every open set ${U \subset {\bf C}}$ .

${f^{-1}(K)}$ is Lebesgue measurable for every closed set ${K \subset {\bf C}}$ .

From the above exercise, we see that the notion of complex-valued measurability and unsigned measurability are compatible when applied to a function that takes values in ${[0,+\infty) = [0,+\infty] \cap {\bf C}}$ everywhere (or almost everywhere).

Exercise 8

Show that every continuous function ${f: {\bf R}^d \rightarrow {\bf C}}$ is measurable.

Show that a function ${f: {\bf R}^d \rightarrow {\bf C}}$ is simple if and only if it is measurable and takes on at most finitely many values.

Show that a complex-valued function that is equal almost everywhere to an measurable function, is itself measurable.

Show that if a sequence ${f_n}$ of complex-valued measurable functions converges pointwise almost everywhere to an complex-valued limit ${f}$ , then ${f}$ is also measurable.

If ${f: {\bf R}^d \rightarrow {\bf C}}$ is measurable and ${\phi: {\bf C} \rightarrow {\bf C}}$ is continuous, show that ${\phi \circ f: {\bf R}^d \rightarrow {\bf C}}$ is measurable.

If ${f, g}$ are measurable functions, show that ${f+g}$ and ${fg}$ are measurable.

Exercise 9 Let ${f: [a,b] \rightarrow {\bf R}}$ be a Riemann integrable function. Show that if one extends ${f}$ to all of ${{\bf R}}$ by defining ${f(x)=0}$ for ${x \not \in [a,b]}$ , then ${f}$ is measurable.

— 3. Unsigned Lebesgue integrals —

We are now ready to integrate unsigned measurable functions. We begin with the notion of the lower unsigned Lebesgue integral, which can be defined for arbitrary unsigned functions (not necessarily measurable):

Definition 9 (Lower unsigned Lebesgue integral) Let ${f: {\bf R}^d \rightarrow [0,+\infty]}$ be an unsigned function (not necessarily measurable). We define the lower unsigned Lebesgue integral ${\underline{\int_{{\bf R}^d}} f(x)\ dx}$ to be the quantity

$\displaystyle \underline{\int_{{\bf R}^d}} f(x)\ dx := \sup_{0 \leq g \leq f; g \hbox{ simple}} \hbox{Simp} \int_{{\bf R}^d} g(x)\ dx$

where ${g}$ ranges over all unsigned simple functions ${g: {\bf R}^d \rightarrow [0,+\infty]}$ that are pointwise bounded by ${f}$ .

One can also define the upper unsigned Lebesgue integral

$\displaystyle \overline{\int_{{\bf R}^d}} f(x)\ dx := \inf_{h \geq f; h \hbox{ simple}} \hbox{Simp} \int_{{\bf R}^d} h(x)\ dx$

but we will use this integral much more rarely. Note that both integrals take values in ${[0,+\infty]}$ , and that the upper Lebesgue integral is always at least as large as the lower Lebesgue integral.

In the definition of the lower unsigned Lebesgue integral, ${g}$ is required to be bounded by ${f}$ pointwise everywhere, but it is easy to see that one could also require ${g}$ to just be bounded by ${f}$ pointwise almost everywhere without affecting the value of the integral, since the simple integral is not affected by modifications on sets of measure zero.

The following properties of the lower Lebesgue integral are easy to establish:

Exercise 10 (Basic properties of the lower Lebesgue integral) Let ${f, g: {\bf R}^d \rightarrow [0,+\infty]}$ be unsigned functions (not necessarily measurable).

(Compatibility with the simple integral) If ${f}$ is simple, then ${\underline{\int_{{\bf R}^d}} f(x)\ dx = \overline{\int_{{\bf R}^d}} f(x)\ dx = \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx}$ .

(Monotonicity) If ${f \leq g}$ pointwise almost everywhere, then ${\underline{\int_{{\bf R}^d}} f(x)\ dx \leq \underline{\int_{{\bf R}^d}} g(x)\ dx}$ and ${\overline{\int_{{\bf R}^d}} f(x)\ dx \leq \overline{\int_{{\bf R}^d}} g(x)\ dx}$ .

(Homogeneity) If ${c \in [0,+\infty)}$ , then ${\underline{\int_{{\bf R}^d}} cf(x)\ dx = c \underline{\int_{{\bf R}^d}} f(x)\ dx}$ .

(Equivalence) If ${f, g}$ agree almost everywhere, then ${\underline{\int_{{\bf R}^d}} f(x)\ dx = \underline{\int_{{\bf R}^d}} g(x)\ dx}$ and ${\overline{\int_{{\bf R}^d}} f(x)\ dx = \overline{\int_{{\bf R}^d}} g(x)\ dx}$ .

(Superadditivity) ${\underline{\int_{{\bf R}^d}} f(x)+g(x)\ dx \geq \underline{\int_{{\bf R}^d}} f(x)\ dx + \underline{\int_{{\bf R}^d}} g(x)\ dx}$ .

(Subadditivity of upper integral) ${\overline{\int_{{\bf R}^d}} f(x)+g(x)\ dx \leq \overline{\int_{{\bf R}^d}} f(x)\ dx + \overline{\int_{{\bf R}^d}} g(x)\ dx}$

(Divisibility) For any measurable set ${E}$ , one has ${\underline{\int_{{\bf R}^d}} f(x)\ dx = \underline{\int_{{\bf R}^d}} f(x) 1_E(x)\ dx + \underline{\int_{{\bf R}^d}} f(x) 1_{{\bf R}^d \backslash E}(x)\ dx}$ .

(Horizontal truncation) As ${n \rightarrow \infty}$ , ${\underline{\int_{{\bf R}^d}} \min(f(x),n)\ dx}$ converges to ${\underline{\int_{{\bf R}^d}} f(x)\ dx}$ .

(Vertical truncation) As ${n \rightarrow \infty}$ , ${\underline{\int_{{\bf R}^d}} f(x) 1_{|x| \leq n}\ dx}$ converges to ${\underline{\int_{{\bf R}^d}} f(x)\ dx}$ . Hint: From Exercise 11 of Notes 1, we have ${m( E \cap \{ x: |x| \leq n \}) \rightarrow m(E)}$ for any measurable set ${E}$ .

(Reflection) If ${f+g}$ is a simple function that is bounded with finite measure support (i.e. it is absolutely integrable), then ${\hbox{Simp} \int_{{\bf R}^d} f(x)+g(x)\ dx = \underline{\int_{{\bf R}^d}} f(x)\ dx + \overline{\int_{{\bf R}^d}} g(x)\ dx}$ .

Do the horizontal and vertical truncation properties hold if the lower Lebesgue integral is replaced with the upper Lebesgue integral?

Now we restrict attention to measurable functions.

Definition 10 (Unsigned Lebesgue integral) If ${f: {\bf R}^d \rightarrow [0,+\infty]}$ is measurable, we define the unsigned Lebesgue integral ${\int_{{\bf R}^d} f(x)\ dx}$ of ${f}$ to equal the lower unsigned Lebesgue integral ${\underline{\int_{{\bf R}^d}} f(x)\ dx}$ . (For non-measurable functions, we leave the unsigned Lebesgue integral undefined.)

One nice feature of measurable functions is that the lower and upper Lebesgue integrals can match, if one also assumes some boundedness:

Exercise 11 Let ${f: {\bf R}^d \rightarrow [0,+\infty]}$ be measurable, bounded, and vanishing outside of a set of finite measure. Show that the lower and upper Lebesgue integrals of ${f}$ agree. (Hint: use Exercise 4.) There is a converse to this statement, but we will defer it to later notes. What happens if ${f}$ is allowed to be unbounded, or is not supported inside a set of finite measure?

This gives an important corollary:

Corollary 11 (Finite additivity of the Lebesgue integral) Let ${f, g: {\bf R}^d \rightarrow [0,+\infty]}$ be measurable. Then ${\int_{{\bf R}^d} f(x)+g(x)\ dx = \int_{{\bf R}^d} f(x)\ dx + \int_{{\bf R}^d} g(x)\ dx}$ .

Proof: From the horizontal truncation property and a limiting argument, we may assume that ${f, g}$ are bounded. From the vertical truncation property and another limiting argument, we may assume that ${f, g}$ are supported inside a bounded set. From Exercise 11, we now see that the lower and upper Lebesgue integrals of ${f}$ , ${g}$ , and ${f+g}$ agree. The claim now follows by combining the superadditivity of the lower Lebesgue integral with the subadditivity of the upper Lebesgue integral. $\Box$

In later notes we will improve this finite additivity property for the unsigned Lebesgue integral further, to countable additivity; this property is also known as the monotone convergence theorem.

Exercise 12 (Upper Lebesgue integral and outer Lebesgue measure) Show that for any set ${E \subset {\bf R}^d}$ , ${\overline{\int_{{\bf R}^d}} 1_E(x)\ dx = m^*(E)}$ . Conclude that the upper and lower Lebesgue integrals are not necessarily additive if no measurability hypotheses are assumed.

Exercise 13 (Area interpretation of integral) If ${f: {\bf R}^d \rightarrow [0,+\infty]}$ is measurable, show that ${\int_{{\bf R}^d} f(x)\ dx}$ is equal to the ${d+1}$ -dimensional Lebesgue measure of the region ${\{ (x,t) \in {\bf R}^d \times {\bf R}: 0 \leq t \leq f(x) \}}$ . (This can be used as an alternate, and more geometrically intuitive, definition of the unsigned Lebesgue integral; it is a more convenient formulation for establishing the basic convergence theorems, but not quite as convenient for establishing basic properties such as additivity.) (Hint: use Exercise 22 from Notes 1.)

Exercise 14 Show that the Lebesgue integral ${f \mapsto \int_{{\bf R}^d} f(x)\ dx}$ is the only map from measurable unsigned functions ${f: {\bf R}^d \rightarrow [0,+\infty]}$ to ${[0,+\infty]}$ that obeys the following properties for measurable ${f, g: {\bf R}^d \rightarrow [0,+\infty]}$ :

(Compatibility with the simple integral) If ${f}$ is simple, then ${\int_{{\bf R}^d} f(x)\ dx = \hbox{Simp} \int_{{\bf R}^d} f(x)\ dx}$ .

(Finite additivity) ${\int_{{\bf R}^d} f(x)+g(x)\ dx = \int_{{\bf R}^d} f(x)\ dx + \int_{{\bf R}^d} g(x)\ dx}$ .

(Horizontal truncation) As ${n \rightarrow \infty}$ , ${\int_{{\bf R}^d} \min(f(x),n)\ dx}$ converges to ${\int_{{\bf R}^d} f(x)\ dx}$ .

(Vertical truncation) As ${n \rightarrow \infty}$ , ${\int_{{\bf R}^d} f(x) 1_{|x| \leq n}\ dx}$ converges to ${\int_{{\bf R}^d} f(x)\ dx}$ .

Exercise 15 (Translation invariance) Let ${f: {\bf R}^d \rightarrow [0,+\infty]}$ be measurable. Show that ${\int_{{\bf R}^d} f(x+y)\ dx = \int_{{\bf R}^d} f(x)\ dx}$ for any ${y \in {\bf R}^d}$ .

Exercise 16 (Linear change of variables) Let ${f: {\bf R}^d \rightarrow [0,+\infty]}$ be measurable, and let ${T: {\bf R}^d \rightarrow {\bf R}^d}$ be an invertible linear transformation. Show that ${\int_{{\bf R}^d} f(T^{-1}(x))\ dx = |\det T| \int_{{\bf R}^d} f(x)\ dx}$ , or equivalently ${\int_{{\bf R}^d} f(T x)\ dx = \frac{1}{|\det T|} \int_{{\bf R}^d} f(x)\ dx}$ .

Exercise 17 (Compatibility with the Riemann integral) Let ${f: [a,b] \rightarrow [0,+\infty]}$ be Riemann integrable. If we extend ${f}$ to ${{\bf R}}$ by declaring ${f}$ to equal zero outside of ${[a,b]}$ , show that ${\int_{\bf R} f(x)\ dx = \int_a^b f(x)\ dx}$ .

We record a basic inequality, known as Markov’s inequality, that asserts that the Lebesgue integral of an unsigned measurable function controls how often that function can be large:

Lemma 12 (Markov’s inequality) Let ${f: {\bf R}^d \rightarrow [0,+\infty]}$ be measurable. Then for any ${0 < \lambda < \infty}$ , one has

$\displaystyle m( \{ x \in {\bf R}^d: f(x) \geq \lambda \} ) \leq \frac{1}{\lambda} \int_{{\bf R}^d} f(x)\ dx.$

Proof: We have the trivial pointwise inequality

$\displaystyle \lambda 1_{\{ x \in {\bf R}^d: f(x) \geq \lambda \}} \leq f(x).$

From the definition of the lower Lebesgue integral, we conclude that

$\displaystyle \lambda m( \{ x \in {\bf R}^d: f(x) \geq \lambda \} ) \leq \int_{{\bf R}^d} f(x)\ dx$

and the claim follows. $\Box$

By sending ${\lambda}$ to infinity or to zero, we obtain the following important corollary:

Exercise 18 Let ${f: {\bf R}^d \rightarrow [0,+\infty]}$ be measurable.

Show that if ${\int_{{\bf R}^d} f(x)\ dx < \infty}$ , then ${f}$ is finite almost everywhere. Give a counterexample to show that the converse statement is false.

Show that ${\int_{{\bf R}^d} f(x)\ dx = 0}$ if and only if ${f}$ is zero almost everywhere.

Remark 4 The use of the integral ${\int_{{\bf R}^d} f(x)\ dx}$ to control the distribution of ${f}$ is known as the first moment method. One can also control this distribution using higher moments such as ${\int_{{\bf R}^d} |f(x)|^p\ dx}$ for various values of ${p}$ , or exponential moments such as ${\int_{{\bf R}^d} e^{tf(x)}\ dx}$ or the Fourier moments ${\int_{{\bf R}^d} e^{itf(x)}\ dx}$ for various values of ${t}$ ; such moment methods are fundamental to probability theory.

— 4. Absolute integrability —

Having set out the theory of the unsigned Lebesgue integral, we can now define the absolutely convergent Lebesgue integral.

Definition 13 (Absolute integrability) An almost everywhere defined measurable function ${f: {\bf R}^d \rightarrow {\bf C}}$ is said to be absolutely integrable if the unsigned integral

$\displaystyle \|f\|_{L^1({\bf R}^d)} := \int_{{\bf R}^d} |f(x)|\ dx$

is finite. We refer to this quantity ${\|f\|_{L^1({\bf R}^d)}}$ as the ${L^1({\bf R}^d)}$ norm of ${f}$ , and use ${L^1({\bf R}^d)}$ or ${L^1({\bf R}^d \rightarrow {\bf C})}$ to denote the space of absolutely integrable functions. If ${f}$ is real-valued and absolutely integrable, we define the Lebesgue integral ${\int_{{\bf R}^d} f(x)\ dx}$ by the formula

$\displaystyle \int_{{\bf R}^d} f(x)\ dx := \int_{{\bf R}^d} f_+(x)\ dx - \int_{{\bf R}^d} f_-(x)\ dx \ \ \ \ \ (7)$

where ${f_+ := \max(f,0)}$ , ${f_- := \max(-f,0)}$ are the magnitudes of the positive and negative components of ${f}$ (note that the two unsigned integrals on the right-hand side are finite, as ${f_+, f_-}$ are pointwise dominated by ${|f|}$ ). If ${f}$ is complex-valued and absolutely integrable, we define the Lebesgue integral ${\int_{{\bf R}^d} f(x)\ dx}$ by the formula

$\displaystyle \int_{{\bf R}^d} f(x)\ dx := \int_{{\bf R}^d} \hbox{Re} f(x)\ dx + i \int_{{\bf R}^d} \hbox{Im} f(x)\ dx$

where the two integrals on the right are interpreted as real-valued absolutely integrable Lebesgue integrals. It is easy to see that the unsigned, real-valued, and complex-valued Lebesgue integrals defined in this manner are compatible on their common domains of definition.

Note from construction that the absolutely integrable Lebesgue integral extends the absolutely integrable simple integral, which is now redundant and will not be needed any further in the sequel.

Remark 5 One can attempt to define integrals for non-absolutely-integrable functions, analogous to the improper integrals ${\int_0^\infty f(x)\ dx := \lim_{R \rightarrow \infty} \int_0^R f(x)\ dx}$ or the principal value integrals ${p.v. \int_{-\infty}^\infty f(x)\ dx := \lim_{R \rightarrow \infty} \int_{-R}^R f(x)\ dx}$ one sees in the classical one-dimensional Riemannian theory. While one can certainly generate any number of such extensions of the Lebesgue integral concept, such extensions tend to be poorly behaved with respect to various important operations, such as change of variables or exchanging limits and integrals, so it is usually not worthwhile to try to set up a systematic theory for such non-absolutely-integrable integrals that is anywhere near as complete as the absolutely integrable theory, and instead deal with such exotic integrals on an ad hoc basis.

From the pointwise triangle inequality ${|f(x)+g(x)| \leq |f(x)|+|g(x)|}$ , we conclude the ${L^1}$ triangle inequality

$\displaystyle \|f+g\|_{L^1({\bf R}^d)} \leq \|f\|_{L^1({\bf R}^d)} + \|g\|_{L^1({\bf R}^d)} \ \ \ \ \ (8)$

for any almost everywhere defined measurable ${f, g: {\bf R}^d \rightarrow {\bf C}}$ . It is also easy to see that

$\displaystyle \|c f\|_{L^1({\bf R}^d)} = |c| \|f\|_{L^1({\bf R}^d)}$

for any complex number ${c}$ . As such, we see that ${L^1({\bf R}^d \rightarrow {\bf C})}$ is a complex vector space. (The ${L^1}$ norm is then a seminorm on this space, but we will not need to discuss norms and seminorms in detail until 245B.) From Exercise 18 we make the important observation that a function ${f \in L^1({\bf R}^d \rightarrow {\bf C})}$ has zero ${L^1}$ norm, ${\|f\|_{L^1({\bf R}^d)}=0}$ , if and only if ${f}$ is zero almost everywhere.

Given two functions ${f, g \in L^1({\bf R}^d \rightarrow {\bf C})}$ , we can define the ${L^1}$ distance ${d_{L^1}(f,g)}$ between them by the formula

$\displaystyle d_{L^1}(f,g) := \|f-g\|_{L^1({\bf R}^d)}.$

Thanks to (8), this distance obeys almost all the axioms of a metric on ${L^1({\bf R}^d)}$ , with one exception: it is possible for two different functions ${f, g \in L^1({\bf R}^d \rightarrow {\bf C})}$ to have a zero ${L^1}$ distance, if they agree almost everywhere. As such, ${d_{L^1}}$ is only a semi-metric (also known as a pseudo-metric) rather than a metric. However, if one adopts the convention that any two functions that agree almost everywhere are considered equivalent (or more formally, one works in the quotient space of ${L^1({\bf R}^d)}$ by the equivalence relation of almost everywhere agreement, which by abuse of notation is also denoted ${L^1({\bf R}^d)}$ ), then one recovers a genuine metric. (Later on, we will establish the important fact that this metric makes the (quotient space) ${L^1({\bf R}^d)}$ a complete metric space, a fact known as the ${L^1}$ Riesz-Fischer theorem; this completeness is one of the main reasons we spend so much effort setting up Lebesgue integration theory in the first place.)

The linearity properties of the unsigned integral induce analogous linearity properties of the absolutely convergent Lebesgue integral:

Exercise 19 (Integration is linear) Show that integration ${f \mapsto \int_{{\bf R}^d} f(x)\ dx}$ is a (complex) linear operation from ${L^1({\bf R}^d)}$ to ${{\bf C}}$ . In other words, show that

$\displaystyle \int_{{\bf R}^d} f(x) + g(x)\ dx = \int_{{\bf R}^d} f(x)\ dx + \int_{{\bf R}^d} g(x)\ dx$

and

$\displaystyle \int_{{\bf R}^d} cf(x)\ dx = c\int_{{\bf R}^d} f(x)\ dx$

for all absolutely integrable ${f, g: {\bf R}^d \rightarrow {\bf C}}$ and complex numbers ${c}$ . Also establish the identity

$\displaystyle \int_{{\bf R}^d} \overline{f(x)}\ dx = \overline{\int_{{\bf R}^d} f(x)\ dx},$

which makes integration not just a linear operation, but a *-linear operation.

Exercise 20 Show that Exercises 15, 16, and 17 also hold for complex-valued, absolutely integrable functions rather than for unsigned measurable functions.

Exercise 21 (Absolute summability is a special case of absolute integrability) Let ${(c_n)_{n \in {\bf Z}}}$ be a doubly infinite sequence of complex numbers, and let ${f: {\bf R} \rightarrow {\bf C}}$ be the function

$\displaystyle f(x) := \sum_{n \in {\bf Z}} c_n 1_{[n,n+1)}(x) = c_{\lfloor x \rfloor}$

where ${\lfloor x \rfloor}$ is the greatest integer less than ${x}$ . Show that ${f}$ is absolutely integrable if and only if the series ${\sum_{n \in {\bf Z}} c_n}$ is absolutely convergent, in which case one has ${\int_{\bf R} f(x)\ dx = \sum_{n \in {\bf Z}} c_n}$ .

We can localise the absolutely convergent integral to any measurable subset ${E}$ of ${{\bf R}^d}$ . Indeed, if ${f: E \rightarrow {\bf C}}$ is a function, we say that ${f}$ is measurable (resp. absolutely integrable) if its extension ${\tilde f: {\bf R}^d \rightarrow {\bf C}}$ is measurable (resp. absolutely integrable), where ${\tilde f(x)}$ is defined to equal ${f(x)}$ when ${x \in E}$ and zero otherwise, and then we define ${\int_E f(x)\ dx := \int_{{\bf R}^d} \tilde f(x)\ dx}$ . Thus, for instance, the absolutely integrable analogue of Exercise 17 tells us that

$\displaystyle \int_a^b f(x)\ dx = \int_{[a,b]} f(x)\ dx$

for any Riemann-integrable ${f: [a,b] \rightarrow {\bf C}}$ .

Exercise 22 If ${E, F}$ are disjoint measurable subsets of ${{\bf R}^d}$ , and ${f: E \cup F \rightarrow {\bf C}}$ is absolutely integrable, show that

$\displaystyle \int_E f(x)\ dx = \int_{E \cup F} f(x) 1_E(x)\ dx$

and

$\displaystyle \int_E f(x)\ dx + \int_F f(x)\ dx = \int_{E \cup F} f(x)\ dx.$

We will study the properties of the absolutely convergent Lebesgue integral in more detail in later notes, as a special case of the more general Lebesgue integration theory on abstract measure spaces. For now, we record one very basic inequality:

Lemma 14 (Triangle inequality) Let ${f \in L^1({\bf R}^d \rightarrow {\bf C})}$ . Then

$\displaystyle |\int_{{\bf R}^d} f(x)\ dx| \leq \int_{{\bf R}^d} |f(x)|\ dx.$

Proof: If ${f}$ is real-valued, then ${|f| = f_+ + f_-}$ and the claim is obvious from (7). When ${f}$ is complex-valued, one cannot argue quite so simply; a naive mimicking of the real-valued argument would lose a factor of ${2}$ , giving the inferior bound

$\displaystyle |\int_{{\bf R}^d} f(x)\ dx| \leq 2\int_{{\bf R}^d} |f(x)|\ dx.$

To do better, we exploit the phase rotation invariance properties of the absolute value operation and of the integral, as follows. Note that for any complex number ${z}$ , one can write ${|z|}$ as ${z e^{i\theta}}$ for some real ${\theta}$ . In particular, we have

$\displaystyle |\int_{{\bf R}^d} f(x)\ dx| = e^{i\theta} \int_{{\bf R}^d} f(x)\ dx = \int_{{\bf R}^d} e^{i\theta} f(x)\ dx$

for some real ${\theta}$ . Taking real parts of both sides, we obtain

$\displaystyle |\int_{{\bf R}^d} f(x)\ dx| = \int_{{\bf R}^d} \hbox{Re}( e^{i\theta} f(x) )\ dx.$

Since ${\hbox{Re}(e^{i\theta} f(x)) \leq |e^{i\theta} f(x)| = |f(x)|}$ , we obtain the claim. $\Box$

— 5. Littlewood’s three principles —

Littlewood’s three principles are informal heuristics that convey much of the basic intuition behind the measure theory of Lebesgue. Briefly, the three principles are as follows:

Every (measurable) set is nearly a finite sum of intervals;
Every (absolutely integrable) function is nearly continuous; and
Every (pointwise) convergent sequence of functions is nearly uniformly convergent.

Various manifestations of the first principle were given in the previous set of notes (and specifically, in Exercises 7 and 14 of those notes). We now discuss the second principle. Define a step function to be a finite linear combination of indicator functions of boxes.

Theorem 15 (Approximation of ${L^1}$ functions) Let ${f \in L^1({\bf R}^d)}$ and ${\epsilon > 0}$ .

There exists an absolutely integrable simple function ${g}$ such that ${\|f-g\|_{L^1({\bf R}^d)} \leq \epsilon}$ .

There exists a step function ${g}$ such that ${\|f-g\|_{L^1({\bf R}^d)} \leq \epsilon}$ .

There exists a continuous, compactly supported ${g}$ such that ${\|f-g\|_{L^1({\bf R}^d)} \leq \epsilon}$ .

To put things another way, the absolutely integrable simple functions, the step functions, and the continuous, compactly supported functions are all dense subsets of ${L^1({\bf R}^d)}$ with respect to the ${L^1({\bf R}^d)}$ (semi-)metric. Much later in the course (in 245C), we will see that a similar statement holds if one replaces continuous, compactly supported functions with smooth, compactly supported functions, also known as test functions; this is an important fact for the theory of distributions.

Proof: We begin with part (1.). When ${f}$ is unsigned, we see from the definition of the lower Lebesgue integral that there exists an unsigned simple function ${g}$ such that ${g \leq f}$ (so, in particular, ${g}$ is absolutely integrable) and

$\displaystyle \int_{{\bf R}^d} g(x)\ dx \geq \int_{{\bf R}^d} f(x)\ dx - \epsilon,$

which by linearity implies that ${\|f-g\|_{L^1({\bf R}^d)} \leq \epsilon}$ . This gives (1.) when ${f}$ is unsigned. The case when ${f}$ is real-valued then follows by splitting ${f}$ into positive and negative parts (and adjusting ${\epsilon}$ as necessary), and the case when ${f}$ is complex-valued then follows by splitting ${f}$ into real and imaginary parts (and adjusting ${\epsilon}$ yet again).

To establish part (2.), we see from (1.) and the triangle inequality in ${L^1}$ that it suffices to show this when ${f}$ is an absolutely integrable simple function. By linearity (and more applications of the triangle inequality), it then suffices to show this when ${f=1_E}$ is the indicator function of a measurable set ${E \subset {\bf R}^d}$ of finite measure. But then, by Exercise 14 of Notes 1, such a set can be approximated (up to an error of measure at most ${\epsilon}$ ) by an elementary set, and the claim follows.

To establish part (3.), we see from (2.) and the argument from the preceding paragraph that it suffices to show this when ${f = 1_E}$ is the indicator function of a box. But one can then establish the claim by direct construction. Indeed, if one makes a slightly larger box ${F}$ that contains the closure of ${E}$ in its interior, but has a volume at most ${\epsilon}$ more than that of ${E}$ , then one can directly construct a piecewise linear continuous function ${g}$ supported on ${F}$ that equals ${1}$ on ${E}$ (e.g. one can set ${g(x) = \max(1 - R \hbox{dist}(x,E),0)}$ for some sufficiently large ${R}$ ; one may also invoke Urysohn’s lemma, which we wil cover in 245B). It is then clear from construction that ${\|f-g\|_{L^1({\bf R}^d)} \leq \epsilon}$ as required. $\Box$

This is not the only way to make Littlewood’s second principle manifest; we return to this point shortly. For now, we turn to Littlewood’s third principle. We recall three basic ways in which a sequence ${f_n: {\bf R}^d \rightarrow {\bf C}}$ of functions can converge to a limit ${f: {\bf R}^d \rightarrow {\bf C}}$ :

(Pointwise convergence) ${f_n(x) \rightarrow f(x)}$ for every ${x \in {\bf R}^d}$ .
(Pointwise almost everywhere convergence) ${f_n(x) \rightarrow f(x)}$ for almost every ${x \in {\bf R}^d}$ .
(Uniform convergence) For every ${\epsilon > 0}$ , there exists ${N}$ such that ${|f_n(x)-f(x)| \leq \epsilon}$ for all ${n \geq N}$ and all ${x \in {\bf R}^d}$ .

Uniform convergence implies pointwise convergence, which in turn implies pointwise almost everywhere convergence.

We now add a fourth mode of convergence, that is weaker than uniform convergence but stronger than pointwise convergence:

Definition 16 (Locally uniform convergence) A sequence of functions ${f_n: {\bf R}^d \rightarrow {\bf C}}$ converges locally uniformly to a limit ${f: {\bf R}^d \rightarrow {\bf C}}$ if, for every bounded subset ${E}$ of ${{\bf R}^d}$ , ${f_n}$ converges uniformly to ${f}$ on ${E}$ . In other words, for every bounded ${E \subset {\bf R}^d}$ and every ${\epsilon > 0}$ , there exists ${N > 0}$ such that ${|f_n(x) - f(x)| \leq \epsilon}$ for all ${n \geq N}$ and ${x \in E}$ .

Remark 6 At least as far as ${{\bf R}^d}$ is concerned, an equivalent definition of local uniform convergence is: ${f_n}$ converges locally uniformly to ${f}$ if, for every point ${x_0 \in {\bf R}^d}$ , there exists an open neighbourhood ${U}$ of ${x_0}$ such that ${f_n}$ converges uniformly to ${f}$ on ${U}$ . The equivalence of the two definitions is immediate from the Heine-Borel theorem. More generally, the adverb “locally” in mathematics is usually used in this fashion; a propery ${P}$ is said to hold locally on some domain ${X}$ if, for every point ${x_0}$ in that domain, there is an open neighbourhood of ${x_0}$ in ${X}$ on which ${P}$ holds.

One should caution, though, that on domains on which the Heine-Borel theorem does not hold, the bounded-set notion of local uniform convergence is not equivalent to the open-set notion of local uniform convergence (though, for locally compact spaces, one can recover equivalence if one replaces “bounded” by “compact”).

Example 1 The functions ${x \mapsto x/n}$ on ${{\bf R}}$ for ${n=1,2,\ldots}$ converge locally uniformly (and hence pointwise) to zero on ${{\bf R}}$ , but do not converge uniformly.

Example 2 The partial sums ${\sum_{n=0}^N \frac{x^n}{n!}}$ of the Taylor series ${e^x = \sum_{n=0}^\infty \frac{x^n}{n!}}$ converges to ${e^x}$ locally uniformly (and hence pointwise) on ${{\bf R}}$ , but not uniformly.

Example 3 The functions ${f_n(x) := \frac{1}{nx} 1_{x>0}}$ for ${n=1,2,\ldots}$ (with the convention that ${f_n(0)=0}$ ) converge pointwise everywhere to zero, but do not converge locally uniformly.

From the preceding example, we see that pointwise convergence (either everywhere or almost everywhere) is a weaker concept than local uniform convergence. Nevertheless, a remarkable theorem of Egorov, which demonstrates Littlewood’s third principle, asserts that one can recover local uniform convergence as long as one is willing to delete a set of small measure:

Theorem 17 (Egorov’s theorem) Let ${f_n: {\bf R}^d \rightarrow {\bf C}}$ be a sequence of measurable functions that converge pointwise almost everywhere to another function ${f: {\bf R}^d \rightarrow {\bf C}}$ , and let ${\epsilon > 0}$ . Then there exists a Lebesgue measurable set ${A}$ of measure at most ${\epsilon}$ , such that ${f_n}$ converges locally uniformly to ${f}$ outside of ${A}$ .

Note that Example 3 demonstrates that the exceptional set ${A}$ in Egorov’s theorem cannot be taken to have zero measure, at least if one uses the bounded-set definition of local uniform convergence from Definition 16. (If one instead takes the “open neighbourhood” definition, then the sequence in Example 3 does converge locally uniformly on ${{\bf R} \backslash \{0\}}$ in the open neighbourhood sense, even if it does not do so in the bounded-set sense. On a domain such as ${{\bf R}^d \backslash A}$ , bounded-set locally uniform convergence implies open-neighbourhood locally uniform convergence, but not conversely, so for the purposes of applying Egorov’s theorem, the distinction is not too important since one has local uniform convergence in both senses.)

Proof: By modifying ${f_n}$ and ${f}$ on a set of measure zero (that can be absorbed into ${A}$ at the end of the argument) we may assume that ${f_n}$ converges pointwise everywhere to ${f}$ , thus for every ${x \in {\bf R}^d}$ and ${m > 0}$ there exists ${N \geq 0}$ such that ${|f_n(x)-f(x)| \leq 1/m}$ for all ${n \geq N}$ . We can rewrite this fact set-theoretically as

$\displaystyle \bigcap_{N=0}^\infty E_{N,m} = \emptyset$

for each ${m}$ , where

$\displaystyle E_{N,m} := \{ x \in {\bf R}^d: |f_n(x)-f(x)| > 1/m \hbox{ for some } n \geq N \}.$

It is clear that the ${E_{N,m}}$ are Lebesgue measurable, and are decreasing in ${N}$ . Applying downward monotone convergence (Exercise 9 of Notes 1) we conclude that, for any radius ${R>0}$ , one has

$\displaystyle \lim_{N \rightarrow \infty} m( E_{N,m} \cap B(0,R) ) = 0.$

(The restriction to the ball ${B(0,R)}$ is necessary, because the downward monotone convergence property only works when the sets involved have finite measure.) In particular, for any ${m \geq 1}$ , we can find ${N_m}$ such that

$\displaystyle m( E_{N,m} \cap B(0,m) ) \leq \frac{\epsilon}{2^m}$

for all ${N \geq N_m}$ .

Now let ${A := \bigcup_{m=1}^\infty E_{N_m,m} \cap B(0,m)}$ . Then ${A}$ is Lebesgue measurable, and by countable subadditivity, ${m(A) \leq \epsilon}$ . By construction, we have

$\displaystyle |f_n(x)-f(x)| \leq 1/m$

whenever ${m \geq 1}$ , ${x \in {\bf R}^d \backslash A}$ , ${|x| \leq m}$ , and ${n \geq N_m}$ . In particular, we see for any ball ${B(0,m_0)}$ with an integer radius, ${f_n}$ converges uniformly to ${f}$ on ${B(0,m_0) \backslash A}$ . Since every bounded set is contained in such a ball, the claim follows. $\Box$

Remark 7 Unfortunately, one cannot in general upgrade local uniform convergence to uniform convergence in Egorov’s theorem. A basic example here is the moving bump example ${f_n := 1_{[n,n+1]}}$ on ${{\bf R}}$ . This sequence converges pointwise (and locally uniformly) to the zero function ${f \equiv 0}$ . However, for any ${0 < \epsilon < 1}$ and any ${n}$ , we have ${|f_n(x) - f(x)| > \epsilon}$ on a set of measure ${1}$ , namely on the interval ${[n,n+1]}$ . Thus, if one wanted ${f_n}$ to converge uniformly to ${f}$ outside of a set ${A}$ , then that set ${A}$ has to contain a set of measure ${1}$ . In fact, it must contain the intervals ${[n,n+1]}$ for all sufficiently large ${n}$ and must therefore have infinite measure.

However, if all the ${f_n}$ and ${f}$ were supported on a fixed set ${E}$ of finite measure (e.g. on a ball ${B(0,R)}$ ), then the above “escape to horizontal infinity” cannot occur, it is easy to see from the above argument that one can recover uniform convergence (and not just locally uniform convergence) outside of a set of arbitrarily small measure.

We now use Theorem 15 to give another version of Littlewood’s second principle, known as Lusin’s theorem:

Theorem 18 (Lusin’s theorem) Let ${f: {\bf R}^d \rightarrow {\bf C}}$ be absolutely integrable, and let ${\epsilon > 0}$ . Then there exists a Lebesgue measurable set ${E \subset {\bf R}^d}$ of measure at most ${\epsilon}$ such that the restriction of ${f}$ to the complementary set ${{\bf R}^d \backslash E}$ is continuous on that set.

Caution: this theorem does not imply that the unrestricted function ${f}$ is continuous on ${{\bf R}^d \backslash E}$ . For instance, the absolutely integrable function ${1_{\bf Q}: {\bf R} \rightarrow {\bf C}}$ is nowhere continuous, so is certainly not continuous on ${{\bf R} \backslash E}$ for any ${E}$ of finite measure; but on the other hand, if one deletes the measure zero set ${E := {\bf Q}}$ from the reals, then the restriction of ${f}$ to ${{\bf R} \backslash E}$ is identically zero and thus continuous.

Proof: By Theorem 15, for any ${n \geq 1}$ one can find a continuous, compactly supported function ${f_n}$ such that ${\|f-f_n\|_{L^1({\bf R}^d)} \leq \epsilon/4^n}$ (say). By Markov’s inequality, that implies that ${|f(x)-f_n(x)| \leq 1/2^{n}}$ for all ${x}$ outside of a Lebesgue measurable set ${E_n}$ of measure at most ${\epsilon/2^{n}}$ . Letting ${E := \bigcup_{n=1}^\infty E_n}$ , we conclude that ${E}$ is Lebesgue measurable with measure at most ${\epsilon}$ , and ${f_n}$ converges uniformly to ${f}$ outside of ${E}$ . But the uniform limit of continuous functions is continuous. We conclude that the restriction ${f}$ to ${{\bf R}^d \backslash E}$ is continuous, as required. $\Box$

Exercise 23 Show that the hypothesis that ${f}$ is absolutely integrable in Lusin’s theorem can be relaxed to being locally absolutely integrable (i.e. absolutely integrable on every bounded set), and then relaxed further to that of being measurable (but still finite everywhere or almost everywhere). (To achieve the latter goal, one can replace ${f}$ locally with a horizontal truncation ${f 1_{|f| \leq n}}$ ; alternatively, one can replace ${f}$ with a bounded variant, such as ${\frac{f}{(1+|f|^2)^{1/2}}}$ .)

Exercise 24 Show that a function ${f: {\bf R}^d \rightarrow {\bf C}}$ is measurable if and only if it is the pointwise almost everywhere limit of continuous functions ${f_n: {\bf R}^d \rightarrow {\bf C}}$ . (Hint: if ${f: {\bf R}^d \rightarrow {\bf C}}$ is measurable and ${n \geq 1}$ , show that there exists a continuous function ${f_n: {\bf R}^d \rightarrow {\bf C}}$ for which the set ${\{ x \in B(0,n): |f(x)-f_n(x)| \geq 1/n \}}$ has measure at most ${\frac{1}{2^n}}$ . You may find Exercise 25 below to be useful for this.) Use this (and Egorov’s theorem) to give an alternate proof of Lusin’s theorem for arbitrary measurable functions.

Remark 8 This is a trivial but important remark: when dealing with unsigned measurable functions such as ${f: {\bf R}^d \rightarrow [0,+\infty]}$ , then Lusin’s theorem does not apply directly because ${f}$ could be infinite on a set of positive measure, which is clearly in contradiction with the conclusion of Lusin’s theorem (unless one allows the continuous function to also take values in the extended non-negative reals ${[0,+\infty]}$ with the extended topology). However, if one knows already that ${f}$ is almost everywhere finite (which is for instance the case when ${f}$ is absolutely integrable), then Lusin’s theorem applies (since one can simply zero out ${f}$ on the null set where it is infinite, and add that null set to the exceptional set of Lusin’s theorem).

Remark 9 By combining Lusin’s theorem with inner regularity (Exercise 13 from Notes 1) and the Tietze extension theorem (which we will cover in 245B), one can conclude that every measurable function ${f: {\bf R}^d \rightarrow {\bf C}}$ agrees (outside of a set of arbitrarily small measure) with a continuous function ${g: {\bf R}^d \rightarrow {\bf C}}$ .

Exercise 25 (Littlewood-like principles) The following facts are not, strictly speaking, instances of any of Littlewood’s three principles, but are in a similar spirit.

(Absolutely integrable functions almost have bounded support) Let ${f: {\bf R}^d \rightarrow {\bf C}}$ be an absolutely integrable function, and let ${\epsilon > 0}$ . Show that there exists a ball ${B(0,R)}$ outside of which ${f}$ has an ${L^1}$ norm of at most ${\epsilon}$ , or in other words that ${\int_{{\bf R}^d \backslash B(0,R)} |f(x)|\ dx \leq \epsilon}$ .

(Measurable functions are almost locally bounded) Let ${f: {\bf R}^d \rightarrow {\bf C}}$ be a measurable function supported on a set of finite measure, and let ${\epsilon > 0}$ . Show that there exists a measurable set ${E \subset {\bf R}^d}$ of measure at most ${\epsilon}$ outside of which ${f}$ is locally bounded, or in other words that for every ${R > 0}$ there exists ${M < \infty}$ such that ${|f(x)| \leq M}$ for all ${x \in B(0,R) \backslash E}$ .

As with Remark 8, it is important in the second part of the exercise that ${f}$ is known to be finite everywhere (or at least almost everywhere); the result would of course fail if ${f}$ was, say, unsigned but took the value ${+\infty}$ on a set of positive measure.

109 comments

Comments feed for this article

19 September, 2010 at 7:54 pm

David Roberts

typo: “but much as the theory of Lebesgue measure is easiest to define by relying solely on outer measure and noton inner measure…”

[Corrected, thanks – T.]

19 September, 2010 at 7:59 pm

David Roberts

And exercises 1 and 2 (and to a lesser extent definition 5) have not typeset properly: the equations break the bounding box and are cut off.

[Corrected, thanks – T.]

20 September, 2010 at 12:07 am

Bo Jacoby

“$latex{c_n^+ := \max(c_n,0)}$ and $latex{c_n^- := \max(-c_n,0)}$ are the positive and negative parts of $latex{c_n}$” means “$latex{c_n^+ := \max(c_n,0)}$ and $latex{-c_n^- := \min(c_n,0)}$ are the positive and negative parts of {c_n}”. ($latex{c_n^-}$ is neither negative nor part of $Latex{c_n}$).

[Reworded slightly – T.]

20 September, 2010 at 4:42 am

Thomas

The end of the proof of Theorem 15 appears to have gone awry. [Corrected, thanks – T.]

20 September, 2010 at 6:47 pm

Anonymous

in definition 1, is $k \geq 1$ or $k \geq 0$ ?

thanks

20 September, 2010 at 6:59 pm

Terence Tao

It doesn’t matter much for this definition (either way, 0 will be a simple function).

21 September, 2010 at 3:42 am

Real Analysis (=Measure Theory) by Terence Tao « UGroh's Weblog

[…] Prolog: Grundfragen und Jordansche Maß Lecture 1: Das Lebesguesche Maß. Lecture 2: Das Lebesguesche Integral […]

21 September, 2010 at 12:30 pm

Mark Schwarzmann

Another possible definition of the unsigned Lebesgue integral arises from its interpretation as the area (or n-dimensional volume, in general) under the graph of a function. Formally, if $f:\mathbb{R}^n \to \mathbb{R}$ is a non-negative measurable function, one may define the integral of $f$ on $\mathbb{R}^n$ as the $n+1$ -dimensional Lebesgue measure of the set $\{ (\mathbf{x},y) \in \mathbb{R}^{n+1} : 0 \le y < f (\mathbf{x}) \}$ , where $x \in \mathbb{R}^n$ and $y \in \mathbb{R}$. For this definition, the basic limit theorems of the Lebesgue integral (the monotone convergence theorem and Fatou's lemma) follow readily from the corresponding theorems for sets, though other properties of the integral are admittedly more difficult to establish.

[A comment added to Exercise 13 to reflect this – T.]

22 September, 2010 at 7:01 am

Laurent

Very nice series of posts, thank you!
In the proof of Egorov’s theorem, it seems that $E_{N,m}$ should be defined to be the complement of what it is defined to be.

[Corrected, thanks – T.]

25 September, 2010 at 10:59 pm

245A, Notes 3: Integration on abstract measure spaces, and the convergence theorems « What’s new

[…] now define the unsigned integral, similarly to what was done for the unsigned Lebesgue integral in Notes 2: Definition 11 Let be a measure space, and let be measurable. Then we define the unsigned […]

6 October, 2010 at 10:41 pm

Anonymous

Dear Prof. Tao

Thanks for the nice posts!

I have a question regarding the definition of the simple function: It is defined to take finite many values (i=1,…k in Def. 1). I can see it is sufficient for the theory (e.g., the lower Lebesgue integral is taken to be the supremum of the integral of simple function). But would it be problematic if we allow k go to infinity in the Definition 1?

Thanks!

11 October, 2010 at 7:58 am

Terence Tao

Well, I suppose one could consider functions that take countably many values; given that the measure is countably additive, one would imagine that much of the theory for finitely-valued functions would carry over to countably-valued functions. But simple functions are in any event just a stepping stone to the integration of arbitrary unsigned measurable functions, which can take uncountably many values, so it’s not clear what advantage would be gained by making simple functions less simple.

9 October, 2010 at 7:44 am

chandrasekhar

Respected Sir,

Instead of using the ” \rightarrow” symbol for getting $\rightarrow$ just use “\to” for getting the same symbol, thereby saving time!

10 October, 2010 at 11:12 pm

Brent Nelson

In exercise 19, one of the complex constants ‘c’ should be moved inside the integral.

[Corrected, thanks – T.]

12 October, 2010 at 9:53 pm

Brent Nelson

In part (5) of exercise 7, the U should be changed to a K. In definition 10, you say that the unsigned Lebesgue integral is equal to the lower unsigned Lebesgue integral, but you use the notation for the upper unsigned Lebesgue integral. [Corrected, thanks – T.]

16 October, 2010 at 8:29 pm

245A, Notes 5: Differentiation theorems « What’s new

[…] integrable, and let be arbitrary. Applying Littlewood’s second principle (Theorem 15 from Notes 2) to the absolutely integrable function , we can find a continuous, compactly supported function […]

24 October, 2010 at 1:21 am

Anonymous

Hi Prof. Tao,

I have a question of Exercise 4. Why f is a bounded unsigned measurable function if it is uniform limit of simple function.
What if we take f_n equals infinity, and it is a simple function and uniformly convergent to f which also equals infinity.

[Oops, I had omitted the requirement that the simple functions must also be bounded. Fixed now – T.]

24 October, 2010 at 10:55 pm

Mark Schwarzmann

Another fact in the spirit of Littlewood’s three principles is that every absolutely integrable function nearly vanishes at infinity (that is, outside a set of arbitrarily small measure).

[A good point! I’ve added a final exercise to the notes to draw attention to this (and also to the related fact that a function that is finite a.e. is almost locally bounded.]

25 October, 2010 at 7:19 pm

Hossein Naderi

Dear Professor Tao,

I had a quick question on excersice 4 (The more difficult direction), why would boundedness of f as a measureable function cause uniform instead of pointwise convergence of simple functions?
Thank you in advance,
Hossein

25 October, 2010 at 8:19 pm

Terence Tao

To approximate arbitrary measurable functions by (bounded) simple functions, one has to perform two operations: vertical truncation and discretisation. (Horizontal truncation is not necessary because we are not requiring the simple functions to have finite measure support.) The latter would lead to uniform convergence, but the former does not, which is why one only has pointwise convergence in the arbitrary case. But in the bounded case, one does not need to perform vertical truncation, only discretisation, and this recovers the uniform convergence.

25 October, 2010 at 8:46 pm

Hossein Naderi

Thank you Professor Tao,

I got it. Really appreciate your help.
Hossein

17 November, 2010 at 9:56 am

Qiang

Dear Prof. Tao

In Remark 3, the second sentence should be … if $E$ is NOT Lebesgue measurable… [Actually, I think the sentence is correct as it stands – T.]

1 December, 2010 at 3:21 pm

Anonymous

Prof. Tao,
In your route to setting up the unsigned and absolutely convergent Lebesgue integrals, could you explain what are the advantages for allowing the unsigned simple functions to be unbounded, say, $f:\mathbb{R}^{d}\rightarrow [0,+\infty]$ instead of $f:\mathbb{R}^{d}\rightarrow [0,+\infty)$ ? In many of the proofs of your notes, you truncate the simple functions because it can be unbounded by the definition. What if you just “define” that the unsigned simple functions are bounded? Then does your route to setting up the Lebesgue integrals still work?

1 December, 2010 at 4:17 pm

Terence Tao

Yes, this is an alternate way to proceed. It moves some minor difficulties elsewhere; for instance, showing that two functions have the same integral if they differ on a set of measure zero becomes very slightly more difficult if simple functions are required to be finite-valued.

16 December, 2010 at 4:28 am

245A, Notes 2: The Lebesgue integral « mathTHÍCHinTOÁNmyHỌCbrain

[…] the partial sums converge to a limit, and we can then define the infinite sum by the same formula (1) as in the unsigned case, though now the sum takes values in rather than . The absolute summability […]

28 December, 2010 at 7:32 am

Anonymous

Dear professor Tao,

(actually I don’t know how you would like to be called)

I believe there is a mistake in the proof of lemma 7 (and I’m sorry if it is my mistake), more precisely in the statement (3) => (5).

If you take $f_n$ to be constant and equal to $\frac{1}{n}$ , clearly $f_n \rightarrow 0$ pointwise. Take $\lambda = 0$ . For a fixed $N$ the set $\bigcup{n \ge N} \{f_n(x) > \lambda\}$ is the whole $\mathbb{R}^d$ , so that the intersection of these sets is $\mathbb{R}^d$ , while the set of values for each $f(x) > 0$ is empty, which shows the sets are in general different, isn’t it?

[Corrected, thanks – T.]

29 December, 2010 at 2:27 pm

Anonymous

Professor Tao,

In Lemma 7, how do you know the set $\left\{ x \in \mathcal{R}^d: f_n(x) > \lambda + \frac{1}{M} \right\}$ , for simple functions $f_n$ , is Lebesgue measurable?

Thanks.

31 December, 2010 at 1:29 pm

Anonymous

Anonymous (above me),

by definition simple functions have finite image. Therefore, for any constant $c$ , $f^{-1}(]c, \infty[)$ is the union of a finite number of measurable sets, each of them being $f^{-1}(t)$ for some constant $t$ . And each of that sets is measurable by definition.

Dear professor Tao,

(I still don’t know how you would like to be called)

In exercise 10.3, of course remembering that $f$ is not necessarily simple, I wonder if the tricky part to which you refered is not showing the equality for $c = \infty$ , for the lower integral. It seems that the upper integral case is just about proving that a countable partition of a set with nonzero exterior measure yields some sets of nonzero exterior measure. Isn’t it?

If I am correct, could you please include some hints?

12 January, 2011 at 7:05 pm

Anonymous

Dear professor and readers,

actually I think there is a counter example to exercise 10.3, for $c = \infty$ (which is of course a non-measurable function $f$ . That is, there is $f: X \rightarrow [0, \infty]$ such that $\int cf \not= c\int f$ .

Suppose we have found sets $A_1, A_2, ...$ such that $\bigcup_{i=1}^{\infty} A_i = [0, 1]$ but each $A_1 \cup A_2 \cup ... A_n$ contains no (measurable) set of positive measure. Take $f = \sum \frac{1_{A_i}}{i}$ . Any nonnegative simple function that is pointwise smaller than or equals to $f$ which is $\geq 1/n$ in a set of positive measure induces a subset of $A_1 \cup ... \cup A_n$ with positive measure, which cannot exist. Thus $f$ has a null integral, while $cf$ is infinite in $[0, 1]$ , and we get our example.

To find such sets, take $V$ to be a Vitali set, i.e., a set which contains exactly one number in each coset $t + \mathbb{Q}$ of the group $\mathbb{R} / \mathbb{Q}$ . If $(q_n)_{n \in \mathbb{N}}$ is an enumeration of $\mathbb{Q}$ , choose $A_n = (V + q_n) \cap [0, 1]$ .

A subset of $[0, 1]$ contains no set of positive measure if and only if its complement is not contained in any set of measure smaller than 1. This is the same as saying that it has outer measure 1, by outer regularity (each measurable set is contained in open sets which approximate its measure arbitrarily much).

Thus, we ought to prove that $A_{n + 1} \cup A_{n + 2} ...$ has outer measure 1. Here there is a result similar to Lebesgue differentiation theorem (see notes 5, and more precisely exercise 24; but the needed result is here: http://www.artofproblemsolving.com/Forum/viewtopic.php?f=67&t=381857). Given $\epsilon$ and set $S$ of positive outer measure, there is an interval $I$ such that the density $\frac{\mu^*(S \cap I)}{\mu(I)}$ is $\geq 1 - \epsilon$ . By $\sigma$ -subadditivity we may suppose $S$ bounded, so that we can cover it by open intervals whose total measure is $\leq 1 + \epsilon$ , and the result is not hard.

We already know that $V$ has positive outer measure (exercise 25, notes 1), so that there are intervals $I$ where $V$ has a high density. Because $\mathbb{Q}$ is dense in $\mathbb{R}$ , even if we ignore a finite set of points, for each interval $J \subset [0, 1]$ such that $|I| = |J|$ , there is an $A_m$ which has high density at $J$, even if we require $m \geq n$ . Furthermore, roughly speaking, it is possible to choose small $I$ and $J$ s, so that $\bigcup_{m \geq n}$ has arbitrarily high density, and to cover $[0, 1]$ with these $J$ s. The result follows.

Thank you!

13 January, 2011 at 3:18 am

Terence Tao

Hmm, you’re right; I’ve amended the exercise accordingly.

12 September, 2011 at 5:31 pm

Anonymous

Could someone explain why Em,n is lebesgue measurable (in proof of egorov thm)

23 February, 2016 at 6:45 pm

Joe Li

Since fn is, then so is f (pointwise limit), then so is fn – f, then so si |fn-f|, then so is Em,n.

30 September, 2011 at 11:36 am

Gandhi Viswanathan

Dear Professor Tao,

In Definition 5 above there is a minor typo:

“…to be absolutely integrable of Simp….” should be “…to be absolutely integrable if Simp….”

This typo is also in Definition 1.3.6 of the PDF version of you book on measure theory (which, along with your other books, I am greatly enjoying reading).

[Corrected, thanks – T.]

6 March, 2012 at 5:44 pm

Rex

Stein/Shakarchi’s Real Analysis requires that their simple functions have finite measure support, whereas here you do not adopt any such condition. Is there any advantage gained by making this additional hypothesis for simple functions?

6 March, 2012 at 7:06 pm

Terence Tao

See Remark 1. It does not matter too much what route one takes to the Lebesgue integral, as one has to deal with a fixed set of technical issues, such as horizontal and vertical truncation, additivity, convergence theorems, etc., at some point in the construction. However, the order in which these issues are encountered can depend on what route one selects.

11 December, 2012 at 4:59 pm

Jack

For the Riemann integration, I saw many times that people use $\int_a^b$ and $\int_{[a,b]}$ interchangeably where $-\infty<a<b<+\infty$ . Is this always justifiable? Also, I saw people use $\int_{-\infty}^{+\infty}$ when they mean $\int_{{\Bbb R}}$ . But $\int_{-\infty}^{+\infty}$ is very ambiguous. It can have at least 3 meanings: 1. $\int_{-\infty}^{+\infty}=\int_{-\infty}^a+\int_{a}^{+\infty}$ ; 2. $\int_{-\infty}^{+\infty}=\lim_{a\to\infty}\lim_{b\to\infty}\int_a^b$ ; 3. $\int_{-\infty}^{+\infty}=\lim_{b\to\infty}\int_b^b$ which is called the principal value. I'm confused which one is supposed to be used. As I understand, 3 is used since 1 and 2 is not always defined and when 1 and 2 are defined, 3 should gives the same result. How can one know whether $\int_{-\infty}^{+\infty}$ means $\int_{\Bbb R}$ or the improper integral?

11 December, 2012 at 5:20 pm

Terence Tao

Different texts have different conventions, but personally I use $\int_a^b$ for the Riemann integral (with the sign convention $\int_b^a = -\int_a^b$ ) and $\int_{[a,b]}$ for the Lebesgue integral (with the two being of course compatible when integrating continuous functions; see Exercise 17 above).

For improper Riemann integrals such as $\int_{-\infty}^\infty f(x)\ dx$ , there is no ambiguity if the integrand is either non-negative or absolutely convergent (as then one can use the Lebesgue theory to show that all the different interpretations you mention agree), but otherwise if one wants to be fully rigorous, one does indeed have to specify the precise interpretation of the integral. (Assuming that the author is sufficiently careful, though, this should indeed be the case when encountering improper integrals in a rigorous mathematical context. In looser contexts, such as in calculations done in engineering or physics, these issues might be glossed over, although in most cases one can find some way to make rigorous sense of the integrals appearing in such calculations (though in some cases one has to use the theory of distributions or some regularisation of the integral (e.g. zeta regularisation), rather than the Riemann or Lebesgue theory of integration, to do so).)

11 December, 2012 at 7:15 pm

Anonymous

I’m a little bit confused that in your PCM article “differential forms and integration”, you distinguish $\int^b_a$ and $\int_{[a,b]}$ in the Riemann integral setting. According to that article, $\int_a^b f(x)dx$ is a signed definite integral and $\int_{[a,b]}f(x)dx$ is an unsigned definite integral which can be generalized to integration on a measure space. Are these notations in that article interpreted differently from those in your comment?

11 December, 2012 at 8:15 pm

Terence Tao

No, the interpretations in that article and in this blog post are the same (see previous comment about the sign convention). In particular, the signed definite integral and unsigned definite integral are linked in one dimension by the identities $\int_a^b = \int_{[a,b]}$ and $\int_b^a = -\int_{[a,b]}$ for $a<b$ (when restricting attention to integrating continuous functions, at least).

The quickest way to define integration on forms is indeed by using the connection with the Riemann or Lebesgue integral on a coordinate chart, combined with a suitable partition of unity, as the definition (but then one has to check that the definition is independent of the choice of chart). It is however also possible to define integration of a form without reference to coordinates, for instance by triangulating the manifold and performing a Riemann sum construction directly.

9 January, 2013 at 4:37 pm

Jack

Regarding the proof of Lemma 7, (3)–>(5), why would one need to introduce the $M$ in the proof? Can one use only the Lebesgue measurability of $\{x\in{\bf R}^d:f_n(x)>\lambda\}$ to do the proof?

9 January, 2013 at 7:22 pm

Terence Tao

No, this is not sufficient, because if one only knows that $\sup_{n \geq N} f_n(x) > \lambda$ for all $N$ , then it could be possible that $\lim\sup f_n(x)$ is equal to $\lambda$ , rather than being greater than $\lambda$ .

10 January, 2013 at 7:06 am

Jack

In Lemma 7, one has the equivalence between “pointwise convergence” and “almost every convergence”. But generally this is not true. I don’t see why. After all, (3)–>(2) is not obvious (3–>5–>4–>2). What’s the essential reason for this equivalence? To what extend can one generalize it?

10 January, 2013 at 7:14 am

Jack

If one only want (4)–>(2), can one drop the assumption “bounded with finite measure support”? I don’t see where this is used in the proof.

13 January, 2013 at 11:49 am

Jack

Regarding Lemma 7, in the proof of (5.)-(11.) implying (4.), the construction of $f_n$ seems rather artificial. Could you elaborate the intuition of such construction?

19 January, 2013 at 3:18 pm

Jack

Regarding Exercise 10.8, hint for the unbounded case?

21 January, 2013 at 9:52 am

Jack

It can be done by doing the simple function case and then dealing with “=” by proving “ $\leq$ ” and “ $\geq$ ” respectively.

I still don’t know how the claim in Exercise 10.3 can fail when $c=+\infty$ . Is it possible to find a counterexample without using anything related to axiom of choice (Or does one have to use it)?

30 January, 2013 at 9:04 am

Jack

I don’t quite understand the remark after Egorov’s Theorem.

“On a domain such as ${\bf R}^d \backslash A$ , bounded-set locally uniform convergence implies open-neighbourhood locally uniform convergence, but not conversely”

In Remark 6, it is pointed out that these two definition are equivalent and it fails when the domain is where the Heine-Borel theorem does not hold.

In the wikipidia article (http://en.wikipedia.org/wiki/Heine%E2%80%93Borel_theorem), the Heine-Borel theorem holds for any subset $S\subset{\bf R}^d$ . (So it should also hold for ${\bf R}^d \backslash A$ . )

I’m lost… What do I miss here?

30 January, 2013 at 9:51 am

Terence Tao

The notion of a closed set in the relative topology of ${\bf R}^d \backslash A$ is not the same as the notion of a closed set in the larger space ${\bf R}^d$ ; a subset of ${\bf R}^d \backslash A$ can be closed in the former sense but not in the latter. (For instance, $(1,2]$ is closed in ${\bf R} \backslash \{1\}$ – it contains all its limit points in that space – but not in ${\bf R}$ ). So the Heine-Borel theorem need not be inherited by non-closed subpaces of ${\bf R}^d$ ; for instance $(1,2]$ is closed and bounded in ${\bf R} \backslash \{1\}$ but fails to be compact.)

30 January, 2013 at 6:04 pm

Jack

OK. It is the relative topology that is used. There is still something I don’t fully understand about the “immediate equivalence” you mentioned in Remark 6.

In ${\bf R}^d$ , bounded-set notion implies open-neighborhood definition since one can take a bounded open disk center on any $x\in{\bf R}^d$ . But in order to use Heine-Borel to show that the open-neighborhood definition implies the bounded-set one, I think one needs to take closure of a given bounded set first (which renders a compact set, i.e., closed and bounded) and then use the finite open cover properties. It follows that the open-neighborhood definition implies a compact-set definition (replacing “bounded” with “compact”). Hence the bounded-set definition implies the compact-set one. But boundedness would not imply compactness.

I somehow messe up. There must be something wrong here…

(P.S. I thinks the last sentence “since one local uniform convergence in both senses”, which is not in the textbook, in the remark paragraph after Egorov’s theorem, misses some words.)

31 January, 2013 at 6:53 am

Jack

“thinks”—>”think”

Gah, I don’t notice that I asked a silly question until I try to write down everything. Something is true (say, uniform convergence here) on a bounded set is definitely true on a compact set. And thus the compact-set definition is a weaker one than those two (bounded-set and open-neighborhood ones).

4 February, 2013 at 9:22 am

Jack

Regarding Exercise 6, one can first show that it is true for any simple functions and then the bounded unsigned measurable functions (by Exercise 4 where one can use the uniform limit). This is the Trick 3 in the notes (https://terrytao.wordpress.com/2010/10/21/245a-problem-solving-strategies/). But how can one pass back to the general case where $f$ can be unbounded? I don’t see how one can write an unbounded measurable function as a limit/decomposition of a bounded function. (One might use Lemma 7.2 to approximate an unbounded function, but the limit is not uniform…)

19 February, 2013 at 10:20 am

Anonymous

If one uses MCT to prove the linearity of the integration, for example in Corollary 11, should that be viewed as invalid circular proof?

5 May, 2013 at 9:02 pm

Luqing Ye

Dear Prof.Tao,

I think there is a problem to the definition 1(Simple function).I think the domain of a simple function $f$ should not be $\mathbf{R}^d$ ,but should be $\bigcup_{1\leq i\leq k}E_i$ …

6 May, 2013 at 2:57 am

Shen Zeng

The definition is correct. Where do you see a problem?

6 May, 2013 at 6:29 am

Luqing Ye

I think only when $\mathbf{R}^d=\bigcup_{1\leq i\leq k}E_i$ then the definition would be correct,otherwise,let $x_0\in \mathbf{R}^d\backslash (\bigcup_{1\leq i\leq k}E_i)$ ,then $f(x_0)$ would be meaningless.

6 May, 2013 at 6:37 am

Luqing Ye

…Forgive me.I am wrong.The definition is right.……

I have a wrong understanding about indicator function…I didn’t think clearly.

Dear Shen Zeng,last time I have a stupid question about support function,then you appeared.This time I have a stupid question about support function again then you appear again.…

7 May, 2013 at 5:46 am

Luqing Ye

I think a Riemann measurable function can be defined as follows,which is defined in a way similar to Lebesgue measurable function:

1.First,I define Riemann-simple function.This is very similar to Lebesgue-simple function(Definition 1),except that for all $1\leq i\leq k$ , $E_i$ is Jordan measurable instead of Lebesgue measurable.And there is another difference,Riemann-simple function is from $\mathbf{R}^d$ to $[0,+\infty)$ ,but a Lebesgue-simple function is from $\mathbf{R}^d$ to $[0,+\infty]$ .

2.Then I define Riemann measurable function to be a function which can be uniformly approximated by Riemann-simple function.

I think a function is Riemann measurable function iff it is Riemann integrable,i.e,it is coherent with the standard definition.

7 May, 2013 at 8:06 am

Luqing Ye

A remark to exercise 4:

It is amazing to see that when $f$ is bounded,then $f$ can be uniformly approximated by a list of simple functions.Although this theorem is just a easy consequence of Hein-Borel finite covering theorem and supremum principle….Regard a simple function as a finite number of points in the vertical direction,then everything will be OK.

This means when $f$ is bounded,we can also define a measurable function $f$ by means of approximation uniformly by a list of simple functions…

So the only purpose of defining a measurable function $f$ by means of approximation pointwise by a list of simple functions is to deal with the case when $f$ is unbounded…

7 May, 2013 at 9:16 am

Luqing Ye

A remark to exercise 6:

I think exercise 6 is a good exercise.Let me guess how Lebesgue created the concept of measurable function.

Firstly,Lebesgue created the Lebesgue measurable set,which is a generalization of Jordan measurable set.I think if there is no such thing as Jordan measurable set in the mathematics,Lebesgue will not discover his measurable set easily.

Then it is evident that we should let a simple function to be measurable.Then,what should we do?

It seems that Lebesgue used an idea which is similar to analytic continuation(I havn’t learned analytic continuation,I only heard this vocabulary,so hope I am not wrong).Because the countable union and countable intersection of Lebesgue measurable set is also Lebesgue measurable,so Lebesgue defined a measurable function to be countable “intersection” and “union” of simple functions,which is exactly a function which can be point wise approximated by simple functions.No less,no more,the concept of measurable function is created exactly suited to our needs!

8 May, 2013 at 12:58 am

Luqing Ye

A remark to Remark 3:

In constructing the L-masurable function $f$ which turns a L-measure 0 set $E$ into L-unmeasurable set $f^{-1}(E)$ ,I think the order preserving property is very important.

To express more explicitly,There is an order preserving bijective map from the Cantor set to $[0,1]\backslash \{k\frac{1}{2^n}:\forall n\in\mathbf{N}^+,\forall 0\leq k\leq 2^n\}$ .This order preverving property is essential to the measurability of $f$ .

In fact,this example shows the intuitive procedure that we can project an umeasurable set into a null set,this projection is order preserving and bejective.

10 May, 2013 at 3:08 am

Luqing Ye

A remark to Exercise 10(Basic properties of the lower Lebesgue
integral).

Exercise 10 consists of ten properties.However,I think another
important property should be mentioned,I call this property “Property
11:The principle of correspondence and optimization”,which is invented
by me :-}

Now I describe the principle of correspondence and optimization in
detail.I think the principle of correspondence and optimazation is the
hidden mechanism for property 2,3,5,6,10 in exercise 10.

First I decribe the principle of correspondence and optimization in general.Let $A$ be
a system,let $B$ be another system.For any state $P_A$ in system $A$ ,there always exists a state $P_B$ in system $B$ correspoinding to
state $P_A$ ,then we say that system $A$ is more crude than system $B$ ,or,equivalently,system $B$ is more sophisticated than system $A$ .

If any one of the two systems is more sophisticated than the
other,then we call these two system equi-sophisticated.

Now let me explain the reason why I use the word sophisticate.If for
any state in $A$ ,there is always a state in $B$ correspoinding to
it,but for any state in $B$ ,there is not neccessarily a state in $A$
that correspoinding to that state in $B$ ,then we can regard
system $A$
equi-sophisticated to part of the system $B$ ,suppose that $A$ is equi-sophisticated to
$B'\subseteq B$ .So the remaining of $B$ has the potential to be more
optimized then $A$ ,just like Pareto improvement in economy.so we call $B$ is more sophisticated than $A$ .

To explain my general dicussion ,now we look at a concrete
example.Let’s see property 10 in exercise 10 for example.This property
is stated as follows:

(Reflection) If $f+g$ is a simple function that is bounded with
finite measure support (i.e. it is absolutely integrable), then $\hbox{Simp} \int_{{\bf R}^d} f(x)+g(x)\ dx = \underline{\int_{{\bf R}^d}} f(x)\ dx + \overline{\int_{{\bf R}^d}} g(x)\ dx$ .

Let system $A$ be the set of simple functions $\{f_{A}:f_{A}(x)\leq f(x)\}$ ,Let system $B$ be the set of simple functions
$\{g_B:g_B(x)\geq g(x)\}$ . For any simple function $f_{A}$ in system
$A$ ,it is easy to verify that $f+g-f_A$ is a simple function in system
$B$ .And for any simple function in system $B$ ,it is easy to verify
that $f+g-f_B$ is a simple function in system $A$ .So system $A$ is
more sophisticated than system $B$ ,and system $B$ is more sophisticated than system $A$ ,so they are equi-sophisticated.So $\hbox{Simp} \int_{{\bf R}^d} f(x)+g(x)\ dx = \underline{\int_{{\bf R}^d}} f(x)\ dx + \overline{\int_{{\bf R}^d}} g(x)\ dx$ .

Let’s look at property 5 in exercise 10 for another example.

(Superadditivity) $\underline{\int_{{\bf R}^d}} f(x)+g(x)\ dx \geq \underline{\int_{{\bf R}^d}} f(x)\ dx + \underline{\int_{{\bf R}^d}} g(x)\ dx$ .

Let system $A$ be the set of simple functions $\{f_{A}:f_{A}(x)\leq f(x)\}$ ,let system $B$ be the set of simple functions
$\{g_B:g_B(x)\leq g(x)\}$ .Let $C$ be the set of simple functions
$\{f_C:f_C(x)\leq f(x)+g(x)\}$ .It is easy to verify that $\forall f_A\in A,g_B\in B$ , $f_A+g_B$ must be in $C$ .But for any $f_C\in C$ ,it
is not necessarily that there exists $f_A\in A,g_B\in B$ ,such that
$f_C=f_A+f_B$ (Why?),so $\underline{\int_{{\bf R}^d}} f(x)+g(x)\ dx \geq \underline{\int_{{\bf R}^d}} f(x)\ dx + \underline{\int_{{\bf R}^d}} g(x)\ dx$ .

10 May, 2013 at 10:25 am

Luqing Ye

Dear Prof.Tao,

In exercise 10,(9),(Vertical truncation),in the hint,you say:”From Exercise 9 of Notes 1, we have $m( E \cap \{ x: |x| \leq n \}) \rightarrow m(E)$ for any measurable set $E$ . ”

But I can’t see anything special about Exercise 9 of Notes 1(Jordan measurable sets are Lebesgue measurable),Instead,I think it is monotone convergence theorem of measurable sets that plays the central role…

[Corrected, thanks – T.]

11 May, 2013 at 11:11 am

Luqing Ye

A remark to Exercise 10,(8)(Horizontal truncation) .

I think the property of Horizontal truncation should also make use of monetone convergence theorem of measurable sets,which is similar to Vertical truncation.

The only difference is that Horizontal truncation make use of the monetone convergence theorem of measurable sets in the perpendicular to X direction,but the Vertical trucation make use of the monetone convergence theorem of measurable sets in the perpendicular to Y direction.

11 May, 2013 at 10:14 am

Luqing Ye

A generalization to exercise 10,(5),(6).(5) and (6) is stated as
follows:

(Superadditivity) $\underline{\int_{{\bf R}^d}} f(x)+g(x)\ dx \geq \underline{\int_{{\bf R}^d}} f(x)\ dx + \underline{\int_{{\bf R}^d}} g(x)\ dx$ .

(Subadditivity of upper integral) $\overline{\int_{{\bf R}^d}} f(x)+g(x)\ dx \leq \overline{\int_{{\bf R}^d}} f(x)\ dx + \overline{\int_{{\bf R}^d}} g(x)\ dx$ .

In order to generalize,let me introduce some new definitions first.Let
$f: {\bf R}^d \rightarrow [0,+\infty]$ be an unsigned function
(not necessarily measurable). We define the lower unsigned integral
$\#\underline{\int_{{\bf R}^d}} f(x)\ dx$ to be the quantity

$\displaystyle \#\underline{\int_{{\bf R}^d}} f(x)\ dx := \sup_{0 \leq g \leq f; g ~\hbox{is~ unsined~measurable}}\int_{{\bf R}^d} g(x)\ dx$ .

where $g$ ranges over all unsigned measurable functions $g: {\bf R}^d \rightarrow [0,+\infty]$ that are pointwise bounded by
$f$ .

One can also define the upper unsigned Lebesgue integral

$\displaystyle \#\overline{\int_{{\bf R}^d}} f(x)\ dx := \inf_{h \geq f; h ~\hbox{is~measurable}}\int_{{\bf R}^d} h(x)\ dx$ .

With this definition,now I think we can say that

(additivity) $\#\underline{\int_{{\bf R}^d}} f(x)+g(x)\ dx \geq \#\underline{\int_{{\bf R}^d}} f(x)\ dx + \#\underline{\int_{{\bf R}^d}} g(x)\ dx$ .

(additivity of upper integral) $\#\overline{\int_{{\bf R}^d}} f(x)+g(x)\ dx \leq\#\overline{\int_{{\bf R}^d}} f(x)\ dx + \#\overline{\int_{{\bf R}^d}} g(x)\ dx$ .

In fact,I think the proof is easy with the help of Exercise 11,and
Exercise 10,(5),(6).

11 May, 2013 at 11:15 am

Luqing Ye

A remark to exercise 11:

Now I answer the question left in exercise 11:

I think that if $f$ is allowed to be unbounded, or is not supported inside a set of finite measure,then the lower Lebesgue integral and upper Lebesgue integral of $f$ still agree.

In order to prove this ,I think I should make use of the Verticle truncation and Horizontal truncation in Exercise 10.

12 May, 2013 at 8:37 am

Luqing Ye

A solution to Exercise 12 (Upper Lebesgue integral and outer Lebesgue measure).

Prove that :

Show that for any set $E \subset {\bf R}^d, \overline{\int_{{\bf R}^d}} 1_E(x)\ dx = m^*(E)$ .

For any set $E\in\mathbf{R}^d$ ,let the set $A$ be $\{U:U~\mbox{is}~\mbox{open},E\subseteq U\}$ .Denote the intersection of all the elements of $A$ to be $\bigcap A$ .It is easy to verify that $\bigcap A$ is a measurable set,and $m(\bigcap A)=m*(E)$ .

And it is easy to verify that $\overline{\int_{{\bf R}^d}} 1_E(x)\ dx=m(\bigcap A)$ .Done.

13 May, 2013 at 1:13 am

Luqing Ye

A remark to Exercise 14:

I think the property of finite additivity is not neccessary.Finite additivity implies monotonicity:It is monotonicity that is actually used.

For unsigned measurable function $f,g$ ,if for almost every point $x$ , $f(x)\leq g(x)$ ,then $\int_{\mathbf{R}^d}f(x)\leq \int_{\mathbf{R}^d}g(x)$ .

This is the property of monotonicity.I think if monotonnicity replace finite additivity,then the Exercise still holds.

As for the Horizontal and and Vertical truncation,their usage is to extend the L-integral of finite support and bounded function $f$ to infinite in both the Horizontal and Vertical direction.

16 May, 2013 at 8:06 am

Luqing Ye

A question comes to me when I was trying to solve Exercise 16(Linear change of variables).

When $f:[a,b]\to [0,+\infty)$ is Riemann integrable,suppose the
Riemann integration of $f$ on the interval $[a,b]$ is
$\mathbf{Riemann}\int_{[a,b]}f(x)dx$ .Let $\{m_0,\cdots,m_n\}$ be a set
of partitioning point of the interval $[a,b]$ ,and $m_0=a,m_n=b$ .
$x_i$ be an arbitrary real number in the interval $[m_i,m_{i+1}]$ ,then
it is easy to verify that $\displaystyle \sum_{i=0}^{n-1}f(x_i)(m_{i+1}-m_i)\to \mathbf{Riemann}\int_{[a,b]}f(x)dx$ when $\forall 0\leq j\leq n-1$ , $m_{j+1}-m_j\to 0$ .

There is a similar result to Lebesgue integration.When
$f:\mathbf{R}\to [0,+\infty]$ is Lebesgue measurable,suppose the
Lebesgue integration of $f$ on the set $\mathbf{R}$ is
$\mathbf{Lebesgue}\int_{[a,b]}f(x)dx$ .Let
$G_1,G_2,\cdots,G_n,\cdots$ be a sequence of measurable sets,and that
$\bigcup_{j=1}^{\infty}G_i=\mathbf{R}$ .Now, $\forall j\in\mathbf{N}^{+}$ ,let $m(G_j)\to 0$ .And let $x_i$ be an arbitrary
real number on the set $G_i$ .Do we have
$\sum_{i=1}^{\infty}f(x_i)m(G_i)\to \mathbf{Lebesgue}\int_{\mathbf{R}}f(x)dx$ when $\forall j\in\mathbf{N}^{+}$ , $m(G_j)\to 0$ ?

Once I solve this question(Maybe this question is wrong),then Exercise 16 can be easily solved.

16 May, 2013 at 8:11 am

Luqing Ye

I lose an additonal hypothythese,now I add it: $\forall i\neq j$ , $G_i\bigcap G_j=\emptyset$ .

18 May, 2013 at 1:04 am

Luqing Ye

When I was solving lemma 12(Markov’s inequality),a problem came into my mind，prove or disprove it:

Let $f:\mathbf{R}\to\mathbf{R}$ be Lebesgue measurable,and which is pointwise approximated by simple functions $f_1,f_2,\cdots,f_n,\cdots$ .For any real number $a$ and positive real number $\varepsilon$ ,there exists positive integer $k$ such that $\displaystyle |m({x:f_k(x)>=a})-m({x:f(x)>=a})|<\varepsilon$ .

22 May, 2013 at 1:21 am

Luqing Ye

Fistly I fix this question.I should have added the additional hypothythese that $m(x:f_k(x)\geq a)$ should be finite.

Now I disprove this question after it is fixed.The counterexample is in Remark 7—— moving bump.I think moving bump is an interesting example,it is as matter of fact a relationship between the reality and potential. $f\equiv 0$ is approximated by $f_n:= 1_{[n,n+1]}$ ,this is the reality.But $f\equiv 0$ can be approxiamted by $f_n=0$ ,this is the potential.

So if I change my question in this way,then it will be true:

Let $f:\mathbf{R}\to\mathbf{R}$ be Lebesgue measurable,then there
exists a sequence of simple functions $f_1,f_2,\cdots,f_n,\cdots$
which convergent pointwise to $f$ ,such that for any real number $a$ and positive real number $\varepsilon$ which makes $m(x:f_k(x)\geq a)$ finite,there exists positive integer k such that $\displaystyle |m({x:f_k(x)\geq a})-m({x:f(x)\geq a})|\leq \varepsilon$ .

19 May, 2013 at 9:23 am

Luqing Ye

A remark to Lemma 14 (Triangle inequality) .

I enjoy Mr.Tao’s proof of this lemma very much.It is a beautiful,elegant proof!I love this proof very much!

In fact,I prove it in somewhat different way,first,I approximate $f$ by simple functions,then I prove the triangle inequality for simple functions.

But Mr.Tao’s proof is really an amazing proof,in fact,Mr.Tao’s proof has a strong geometric meaning,that is,the smallest path between twp point is a line,because any curve (or polyline) through the two points can project on the line,and the function of projection can only make the length shorter !

Especially I enjoy the formula

$\displaystyle |\int_{{\bf R}^d} f(x)\ dx| = e^{i\theta} \int_{{\bf R}^d} f(x)\ dx = \int_{{\bf R}^d} e^{i\theta} f(x)\ dx$

This formula strongly reminds me of Fourier transform(Which I only learned from Mr.Tao’s Analysis II),so I think this formula combined with my geometric meaning will give me a very vivid geometric meaning about Fourier transform!

21 May, 2013 at 3:45 am

Luqing Ye

A remark to Theorem 17 (Egorov’s theorem):

I proved this theorem myself.Now I provide my general idea for proving this theorem.For sake of convenience,I take $f$ as a function from $\mathbf{R}$ to $\mathbf{R}$ .

For any point $x_0\in\mathbf{R}^d$ ,and any $\varepsilon>0$ , If $f$ is bounded on $(x_0-\varepsilon,x_0+\varepsilon)$ ,then let it be.

If $f$ is not bounded on $(x_0-\varepsilon,x_0+\varepsilon)$ ,then let $\varepsilon$ be as small
as possible,if when $\varepsilon>0$ is small enough so that $f$
becomes bounded on $(x_0-\varepsilon,x_0+\varepsilon)$ ,then let it be,in such case,we call $x_0$ as “not real infinity point”.If
$\varepsilon$ becomes “arbitrarily” small but $f$ still keeps unbounded on $(x_0-\varepsilon,x_0+\varepsilon)$ ,then just let $\varepsilon$ be small enough,in this case,we call $x_0$ as “real infinity point”.

In doing so,we will separate all those open interval in $\mathbf{R}^d$ on which $f$ tends to infinity,and because we let $\varepsilon$ be small enough,the region we separated has measure as small as
possible(Why?hint:consider the trick give yourself an epsilon of room
https://terrytao.wordpress.com/2009/02/28/tricks-wiki-give-yourself-an-epsilon-of-room/).

Now we consider those open interval on which $f$ is bounded.According to https://terrytao.wordpress.com/2010/09/19/245a-notes-2-the-lebesgue-integral/#comment-228116 It is easy to verify that on those interval, $f_n$ converges uniformly to $f$ .

So the Egorov’s theorem is proved!

22 May, 2013 at 7:31 am

Luqing Ye

A remark to Egolov’s theorem:

My above comment prove Egolov’s theorem,however,my writing is bad,and
lose several key point.

In my opinion,the key words of proving Egolov’s theorem is “localize
and minimize”.We localize the region on which $f$ tends to infinity so as to make use of the downward monotone convergence theorem(In order to manage it successfully,we must make use of the regularity of $f$ ,because $f$ can be pointwise approximated by a sequence measurable functions,so $f$ itself must be measurable.Measurable function is lovely,it is very regular,i.e,it can be pointwise approximated by simple functions),after that,we use the trick “give yourself an epsilon of room”,to minimize the region on which $f$ tends to infinity.

We also localize the region on which $f$ is bounded,to avoid such case as “escape to horizontal infinity” happen.

22 May, 2013 at 5:10 am

Luqing Ye

Dear Professor Tao,

I think Exercise 4 is wrong,it says:

Exercise 4 Let $f: \mathbf {R}^d \rightarrow [0,+\infty]$ . Show that $f$ is a bounded unsigned measurable function if and only if $f$ is the uniform limit of bounded simple functions.

A counterexample is the moving bump in Remark 7…

In order to repair,I think $f$ should be bounded in two directions,both horizontal and vertical.

22 May, 2013 at 5:21 am

Luqing Ye

I have to say sorry again because it is my fault.It is the distinction between the potential and reality.

Now I understand that In exercise 4, $f$ is the uniform limit of bounded simple function means there EXISTS a sequence of bounded simple functions which approximated uniformly to $f$ …So the counterexample moving bump is no longer a counterexample,because $f=0$ can be approximated uniformly by $f_n=0$ .

22 May, 2013 at 10:36 am

Luqing Ye

A remark to Lusin’s theorem:

I prove Lusin’s theorem myself,because I don’t like to see proofs provided by other people.

Theorem 18 (Lusin’s theorem) Let $f: \mathbf{R} \rightarrow \mathbf{R}\bigcup\{\infty\}$ be measurable,and finite almost
everywhere, and let $\epsilon > 0$ . Then there exists a Lebesgue
measurable set $E \subset {\bf R}^d$ of measure at most $\epsilon$ such that the restriction of $f$ to the complementary set ${\bf R}^d \backslash E$ is continuous on that set.

Proof:For sake of convenience we ignore the measure zero set,let we
assume that $f$ is finite everywhere and measurable.Suppose that $f$ is pointwise approximated by a sequence of simple functions
$f_1,f_2,\cdots,f_n,\cdots$ .According to Egorov’s theorem,for any
given $\varepsilon_1>0$ ,there exists a measurable $A\subset \mathbf{R}$ such that $m(A)\leq\varepsilon_1$ ,and such that $f$ can be locally uniformly approximated by $f_n$ .

There is little difference between a simple function and a finite
linear combination of indicator functions on boxes.In fact, $\displaystyle \mbox{simple function}+\mbox{vanishing function}$
$\displaystyle =\mbox{a finite linear combination of indicator function on}$ $\displaystyle \mbox{at most countable numbers of elementary sets}$ , where a vanishing function means a function whose
support set has measure zero.

So it in fact does no harm to assume that $\forall i\in \mathbf{N}^{+},f_i$ is a finite linear combination of indicator
functions on at most countable numbers of elementary box(Why it does
no harm?).

Suppose that the support set of $f_i$ is $\bigcup_{h=1}^{\infty}(S_h)$ ,where $\forall h\in\mathbf{N}^{+}$ , $S_h$
is an elementary box who has positive measure.And $\forall k\neq k$ , $S_k$ and $S_j$ are almost disjoint.

Now $\forall h\in\mathbf{N}^{+}$ ,we take $S_h=[a,b]$ (or
$(a,b),[a,b),(a,b]$ ),we cut a very small fraction of $S_h$ out,which is denoted by $S_{h,out}$ ,whose measure is $\varepsilon_h$ ,after cut $S_{h,out}$ , $S_h\backslash S_{h,out}=(c,d)$ is still an elementary box,and such that $a<c<d<b$ .

By using the trick "give yourself an epsilon of room",we can let
$\sum_{h\in\mathbf{N}^{+}}\varepsilon_h$ as small as possible.

So after this operation,the support set of $f_i$ becomes
$\bigcup_{h=1}^{\infty}(S_h\backslash S_{h,out})$ ,and we let $f_i$ be restricted on $\bigcup_{h=1}^{\infty}(S_h\backslash S_{h,out})$ .After $f_i$ is restricted,it can be easily be verified that $f_i$ is continuous.

It is easy to verify that a if a sequence of continuous function convergent locally uniformly to a function,then that function is also continuous.

So Lusin's theorem is proved!

23 May, 2013 at 5:55 am

Luqing Ye

A remark to Egorov’s theorem:

A generalization of this theorem is stated as follows,but it is not true:

(A false generalization of Egorov’s theorem) Let $f_n: {\bf R}^d \rightarrow {\bf C}$ be a sequence of measurable functions that converge pointwise almost everywhere to another function $f: {\bf R}^d \rightarrow {\bf C}\bigcup\{\infty\}$ , and let $\epsilon > 0$ . Then there exists a Lebesgue measurable set $A$ of measure at most $\epsilon$ , such that $f_n$ converges locally uniformly to $f$ outside of $A$ ,and $f$ can not reach $\infty$ outside of $A$ .

Because if $f$ is from $\mathbf{R}^d$ to $\mathbf{C}\bigcup\{\infty\}$ ,then in the process of the proof, $\displaystyle \bigcap_{N=0}^\infty E_{N,m} = \emptyset$ will not hold.

9 June, 2014 at 7:32 am

Anonymous

“the upper integral is somewhat problematic when dealing with “improper” integrals of functions that are unbounded or are supported on sets of infinite measure.”

Could you give an example to explain your remark above? (What “problem” are you refering to?)

10 June, 2014 at 7:27 am

Terence Tao

The upper integral of, say, $\int_{-\infty}^\infty e^{-\pi x^2}\ dx$ , will be infinite (if one insists on only using finitely many pieces for the partition). Similarly for $\int_0^1 x^{-1/2}\ dx$ .

12 June, 2014 at 8:33 am

Anonymous

“To obtain the equivalence of (5.) and (6.), observe that

$\displaystyle \{ x \in {\bf R}^d: f(x) \geq \lambda \} = \bigcap_{\lambda' \in {\bf Q}^+: \lambda' < \lambda} \{ x \in {\bf R}^d: f(x) > \lambda' \}$

for ${\lambda \in (0,+\infty]}$ and

$\displaystyle \{ x \in {\bf R}^d: f(x) > \lambda \} = \bigcup_{\lambda' \in {\bf Q}^+: \lambda' > \lambda} \{ x \in {\bf R}^d: f(x) \geq \lambda' \}$

${\lambda \in [0,+\infty)}$ , where ${{\bf Q}^+ := {\bf Q} \cap [0,+\infty]}$ are the non-negative rationals. ”

——————————
In the first formula, if one uses ${\bf Q}$ instead of ${\bf Q}^+$ , then it seems that the formula works for $\lambda=0$ also.

In the second formula, why doesn’t it work when $\lambda=+\infty$ ? (the LHS is an empty set and the RHS is an empty union…)

[The formulae work at these endpoints also. -T.]

12 June, 2014 at 1:16 pm

Anonymous

In the first formula, when $\lambda=0$ , I think it doesn’t work? The left hand side is equal to ${\bf R}^d$ but the RHS is an empty intersection (unless one replaces ${\bf Q}^+$ with ${\bf Q}$ ). Or is it a convention that an empty intersection is indeed ${\bf R}^d$ ?

12 June, 2014 at 2:31 pm

Terence Tao

That would be the appropriate convention in this case: http://math.stackexchange.com/questions/370188/empty-intersection-and-empty-union . In any event, one does not need to consider these endpoint cases for the application at hand.

13 June, 2014 at 8:21 am

Anonymous

I’m trying to get the formula in the proof of Lemma 7:

the set ${\{ x \in {\bf R}^d: f(x) > \lambda \}}$ is equal to

$\displaystyle \bigcup_{M>0} \bigcap_{N>0} \{ x \in {\bf R}^d: \sup_{n \geq N} f_n(x) > \lambda + \frac{1}{M} \}$

Since $\{f>\lambda\}=\bigcup_{M>0}{\{f>\lambda+1/M\}}$ , it suffices to show that

$\displaystyle \bigcap_{N>0} \{ x \in {\bf R}^d: \sup_{n \geq N} f_n(x) > \lambda + \frac{1}{M} \}=\left\{\inf_{N>0}\sup_{n\geq N}f_n>\lambda+\frac{1}{M}\right\}$

One direction is obvious:

$\displaystyle \bigcap_{N>0} \{ x \in {\bf R}^d: \sup_{n \geq N} f_n(x) > \lambda + \frac{1}{M} \}\supset\left\{\inf_{N>0}\sup_{n\geq N}f_n>\lambda+\frac{1}{M}\right\}$

since

$\displaystyle \inf_{N>0}\sup_{n\geq N}f_n\leq \sup_{n\geq N} f_n$

for all $N>0$ . But the other direction is not:

$\displaystyle \bigcap_{N>0} \{ x \in {\bf R}^d: \sup_{n \geq N} f_n(x) > \lambda + \frac{1}{M} \}$

only implies that

$\displaystyle \inf_{N>0}\sup_{n\geq N}f_n\geq\lambda+\frac{1}{M}$ .

Where do I do wrong?

13 June, 2014 at 8:27 am

Terence Tao

The reduction in your “suffices to show that” gives away too much, and is indeed false in general; you should focus on proving the original identity instead. Note that $x \geq \lambda+\frac{1}{M}$ implies that $x > \lambda$ .

31 August, 2014 at 12:43 am

Thomas Dybdahl Ahle

Why is the union over $\frac{1}{M}$ s even necessary? Couldn’t we use just an intersection?

31 August, 2014 at 8:52 am

Terence Tao

The intersection is too small. Consider for instance the example when $\lambda = 0$ and $f(x)=f_n(x) = \frac{1}{10}$ for all $n \geq 1$ and $x \in {\bf R}^d$ . Then

$\{ x \in {\bf R}^d: f(x) > \lambda \} = {\bf R}^d$

but

$\bigcap_{M=1}^\infty \bigcap_{N=1}^\infty \{x \in {\bf R}^d: \hbox{sup}_{n \geq N} f_n(x) > \lambda + \frac{1}{M} \} = \emptyset$

as one can see by considering what happens when $M \leq 10$ .

31 August, 2014 at 9:39 am

Thomas Dybdahl Ahle

I’m sorry, I didn’t write that clearly. What I meant was that elsewhere in the book (I think) we do limsup’s with just $\bigcap\bigcup$ and not like here where we end up with $\bigcup\bigcap\bigcup$ .

Equivalently, it seems to me that

$\bigcup_{M>0}\bigcap_{N>0} \{x \in {\bf R}^d: \hbox{sup}_{n \geq N} f_n(x) > \lambda + \frac{1}{M} \} = \bigcap_{N>0} \{x \in {\bf R}^d: \hbox{sup}_{n \geq N} f_n(x) > \lambda\}$

By some argument of monotone convergence?

31 August, 2014 at 12:48 pm

Terence Tao

This is not correct; for instance, if $f_n(x) = 1/n$ and $\lambda=0$ , then the right-hand side is ${\bf R}^d$ but the left-hand side is empty. However, the right-hand side is equal to $\bigcap_{N>0} \bigcup_{M>0} \{ x \in {\bf R}^d: \sup_{n \geq N} f_n(x) > \lambda + \frac{1}{M} \}$ .

31 August, 2014 at 2:59 pm

Thomas Dybdahl Ahle

Ah! The sharp inequality is not preserved by the “limit” so we add an “infinitesimal” on the right hand side using $\frac{1}{M}$ !
Ingenious. Thank you very much, you are a great inspiration.

22 June, 2014 at 6:29 pm

Anonymous

Do you have a hint for the “only if part” for Exercise 4?

24 June, 2014 at 1:28 pm

Question

For Exercise 4, Using the simple functions (without being truncated vertically, i.e., $f_n$ being the largest $c\dot 2^{-n}$ less than or equal to $\min (f(x),n)$ ) defined in the last step of the proof of Lemma 7, one has the desired sequence of simple functions.

I don’t see what strategy one should use in

https://terrytao.wordpress.com/2010/10/21/245a-problem-solving-strategies/

It seems that one can take the “finite measure support” out from (4) in Lemma 7. Are simple functions with finite measure support of special interest in application? Isn’t “uniform convergence” preferable?

27 June, 2014 at 12:44 pm

Anonymous

Could you give a hint for Ex 14?

If I don’t understand it wrong, the “uniqueness of the Lebesgue integral” means the following:

Let $L$ be a operator such that

– $Lf=Simp \int f$ when $f$ is simple
– $L(f+g)=Lf+Lg$ for any measurable functions f and g
– $\displaystyle \lim_n L(\min(f,n))=Lf$
– $\displaystyle \lim_n L(f1_{|x|\leq n})=Lf$

Show that $Lf=\int f$ for any Lebesgue measurable functions.

$Lf=\int f$ is immediately true when $f$ is simple. How can one past the case of simple functions the to general cases?

29 August, 2014 at 5:08 am

Anonymous

The (real) Lebesgue measurable functions are $({\mathcal L},{\mathcal B}_{\bf R})$ measurable by definition. What if one considers the $({\mathcal L},{\mathcal L})$ measurable functions only?

For doing integration of functions $f:(X,{\mathcal M})\to(Y,{\mathcal N})$ , why is it enough to use Borel measure in the target space?

29 August, 2014 at 8:26 am

Terence Tao

For the purposes of integration theory, the range $(Y,{\mathcal N})$ and domain $(X,{\mathcal M})$ are treated quite differently (in contrast to the more category-theoretic areas of mathematics, in which the domain and range of a morphism are consciously treated on a very equal footing). In particular, the range needs the structure of a complete vector space in order to have any sensible (linear) integration theory. (There are some nonlinear generalisations of the integration concept, but they usually fit better with the more classical Riemann theory of integration than the Lebesgue theory.)

One way to think of a $({\mathcal L}, {\mathcal B}_{\bf R})$ -measurable function is as the pointwise limit of simple functions (finite linear combinations of indicator functions of measurable sets). This ties in with the underlying intuition of Lebesgue integration as coming from “horizontally” slicing up the graph of a function (as opposed to Riemann integration, which is focused instead on “vertically” slicing up the graph).

Strengthening the measurability requirement by placing the Lebesgue sigma algebra, rather than the Borel sigma algebra, on the range leads to some pathologies, for instance the very natural function $x \mapsto (x,0)$ from $({\bf R}, {\mathcal L})$ to $({\bf R}^2, {\mathcal L}^2)$ is now a non-measurable function! (if $E$ is a non-measurable subset of ${\bf R}$ , then $E \times \{0\}$ is a null set and is thus Lebesgue measurable, but not Borel measurable in ${\bf R}^2$ .) One can achieve similar pathologies in one-dimension by using an essentially bijective map between, say, the unit interval and the Cantor set.

12 June, 2016 at 5:47 pm

Anonymous

This is a follow up question. When doing probability theory, why Borel measurable functions, namely, $(\mathcal{B}_{\bf R},\mathcal{B}_{\bf R})$ -measurable functions, are used (as random variables), instead of the Lebesgue measurable functions, namely, $(\mathcal{L},\mathcal{B})_{\bf R}$ .

12 June, 2016 at 9:02 pm

Terence Tao

The property of completeness of a sigma-algebra turns out to not be so useful in probability theory (which tries to ignore the set-theoretic structure of the sample space as much as possible). On the other hand, some technical measure-theoretic constructions, such as disintegration of measure (used to construct conditional expectations) and the Kolmogorov extension theorem are more convenient to state using Borel sigma algebras (particularly if one is working with standard Borel spaces). So there are some slight advantages in probability theory with sticking with Borel sigma algebras throughout, though I doubt there would be much harm in trying to work instead with Lebesgue sigma algebras if one so desired.

15 June, 2016 at 11:51 am

Anonymous

While it is better to use $(\mathcal{B}_{\bf R},\mathcal{B}_{\bf R})$ -measurable functions in probability theory, for what reasons would one need $(\mathcal{L},\mathcal{B}_{\bf R})$ -measurable functions in general integration theory (for instance, when working in PDE, $(\mathcal{L},\mathcal{B}_{\bf R})$ -measurable functions are used instead of the $(\mathcal{B}_{\bf R},\mathcal{B}_{\bf R})$ -measurable ones)?

15 June, 2016 at 8:20 pm

Terence Tao

I don’t think it makes much difference in PDE; one often works in function spaces in which one identifies functions which agree almost everywhere, in which case there is no difference between Lebesgue measurable functions and Borel measurable functions. The distinction is certainly important in descriptive set theory, and in certain classical areas of Fourier analysis (e.g. in describing exactly the set of divergence of some Fourier series is). I think there are also some advantages to working in a complete sigma algebra in geometric measure theory, though I can’t think of a concrete such example immediately (other than that it makes it easier to verify that a set is measurable – e.g. it would be enough to show that the outer measure vanishes).

25 September, 2014 at 11:46 am

Integral Bounds In Latex

[…] 245a, notes 2: the lebesgue integral | what’s new […]

28 December, 2015 at 8:44 pm

Anonymous

In Exercise 10 (8), should it be “vertical truncation”? It is not consistent with Notes 3 Exercise 34 (9).

[Notes 3 changed -T.]

23 February, 2016 at 6:55 pm

Joe Li

Dear Prof. Tao and all the readers,

I don’t quite understand some detail of the proof of Lusin’s theorem.

Why we control the measure of A by $\epsilon/2$ instead of $\epsilon$ ? What is the relation between $A$ and $E$ ? And how local uniform limits play any role?

I think that if we control $m(A)<\epsilon$ , then we are almost done. Since $f_n$ , which is continuous, uniformly converges to $f$ outside of $A$ , then $f$ is continuous outside of $A$ , problem solved. What wrong with this?

24 February, 2016 at 9:58 am

Terence Tao

Sorry, this was a remnant from an earlier version of the post where I also addressed the locally integrable case (but this was pushed to an exercise). The proof has been replaced by the more natural one you indicate.

24 February, 2016 at 12:12 am

Hi Terry,
What do you think about this breakthrough in Fourier analysis
http://arxiv.org/abs/1602.05384

18 May, 2016 at 6:45 am

Anonymous

For the linear transformation $x\mapsto -x$ , one has from calculus

$\displaystyle \int_a^bf(-x)\ dx=-\int_{-a}^{-b} f(y)\ dy=\int_{-b}^{-a}f(y)\ dy$

which looks rather different from Exercise 16. Is this a contradiction?

18 May, 2016 at 7:59 am

Terence Tao

This is the signed definite integral $\int_a^b f(x)\ dx$ , which differs from the unsigned definite integral $\int_{[a,b]} f(x)\ dx$ for $b<a$ in precisely the fashion indicated. See this previous article of mine for some comparison between the two.

27 September, 2016 at 10:52 am

246A, Notes 2: complex integration | What's new

[…] as the Lebesgue integral. The precise definition of this integral is a little complicated (see e.g. this previous post), but roughly speaking the idea is to approximate by simple functions for some coefficients and […]

23 October, 2016 at 6:54 pm

coupon_clipper

I’m having trouble with Exercise 10.8 and 10.9 (horizontal and vertical truncation properties of the lower Lebesgue integral). In particular, I can’t figure out which other theorems can help me out here since $f$ isn’t even necessarily measurable and therefore neither is $f^{-1}([0,n])$ for instance. Can I have a hint?

[ $f$ may not be measurable, but the simple functions lying underneath it are. See also the general advice at https://terrytao.wordpress.com/2010/10/21/245a-problem-solving-strategies/ . -T.]

24 October, 2016 at 9:36 am

coupon_clipper

Got it. Thanks so much Terry! Not only do you post this text for free, but you even answer questions on it!

	David Ricketts on The blue-eyed islanders puzzle…
	Anonymous on The blue-eyed islanders puzzle…
	Maths student on The spectral theorem and its c…
	user777 on Matrix identities as derivativ…
	stickerstransfers on The blue-eyed islanders puzzle…
	nmks on The blue-eyed islanders puzzle…
	Anonymous on The blue-eyed islanders puzzle…
	Terence Tao on The spectral theorem and its c…
	Math student on The spectral theorem and its c…
	elienasrallah on Soft analysis, hard analysis,…
	nmks on The blue-eyed islanders puzzle…
	blogauthor on What are some useful, but litt…
	Small tutorial to in… on What are some useful, but litt…
	test \| raylesstrees on What are some useful, but litt…
	blogauthor on What are some useful, but litt…

245A, Notes 2: The Lebesgue integral

Recent Comments

Articles by others

Diversions

Mathematics

Selected articles

Software

The sciences

Top Posts

Archives

Categories

The Polymath Blog

109 comments

Leave a Reply Cancel reply

For commenters

245A, Notes 2: The Lebesgue integral

Share this:

Like this:

Recent Comments

Articles by others

Diversions

Mathematics

Selected articles

Software

The sciences

Top Posts

Archives

Categories

The Polymath Blog

109 comments

Leave a Reply Cancel reply

For commenters