Proof of Outer Lebesgue Measure Monotonicity and Subadditivity

  • MHB
  • Thread starter mathmari
  • Start date
  • Tags
    Measure
In summary, the conversation discusses a proof regarding the outer Lebesgue measure. The proof involves showing that the measure is an outer measure by demonstrating monotonicity and subadditivity. The proof also considers two cases, one where the measure is infinite and another where it is finite. By using the definition of infimum and the fact that any number greater than the infimum is not a lower bound, the proof shows that for every epsilon greater than 0, the measure is less than the sum of the individual measures plus epsilon. This proves that the outer Lebesgue measure is an outer measure.
  • #1
mathmari
Gold Member
MHB
5,049
7
Hey! :eek:

I am looking at the proof that the outer Lebesgue measure that is defined by $$m^*(A)=inf\{\sum_{n=1}^{\infty}v(R_n):A \subset\cup_{n=1}^{\infty}R_n , ( \text{ where } R_n \text{ are open rectangles}) \}$$ is actually an outer measure.

($v(R_n)$, the volume of R is the product of the lengths $I_j$.)

To show that it is an outer measure, we have to show the monotonicity and the subadditivity.

For the subadditivity:

If $A_n \subset \mathbb{R}$ then $$m^* \left ( \cup_{n=1}^{\infty} A_n\right ) \leq \sum_{n=1}^{\infty}m^*(A_n)$$

We suppose that $m^*(A_n)<+\infty, \forall n$.

Let $\epsilon>0$. Then for each $n$ there are rectangles $R_j^n,j=1,2,...$ such that $A_n \subset \cup_{j=1}^{\infty}R_j^n$ and $\sum_{j=1}^{\infty}v(R_j^n)<m^*(A_n)+\frac{\epsilon}{2^n}$.

Then $\cup_{n=1}^{\infty}A_n\subset\cup_{j,n}R_j^n$

$$\sum_{n=1}^{\infty}\sum_{j=1}^{\infty}v(R_j^n)<\sum_{n=1}^{\infty}m^*(A_n)+\epsilon$$

$$m^* \left ( \cup_{n=1}^{\infty}A_n \right ) \leq \sum_{j,n}v(R_j^n)<\sum_{n=1}^{\infty}m^*(A_n)+\epsilon \\ \Rightarrow m^* \left ( \cup_{n=1}^{\infty}A_n\right ) \leq \sum_{n=1}^{\infty}m^*(A_n)$$Could you explain me this proof??
 
Physics news on Phys.org
  • #2
mathmari said:
Hey! :eek:

I am looking at the proof that the outer Lebesgue measure that is defined by $$m^*(A)=inf\{\sum_{n=1}^{\infty}v(R_n):A \subset\cup_{n=1}^{\infty}R_n , ( \text{ where } R_n \text{ are open rectangles}) \}$$ is actually an outer measure.

($v(R_n)$, the volume of R is the product of the lengths $I_j$.)

To show that it is an outer measure, we have to show the monotonicity and the subadditivity.

For the subadditivity:

If $A_n \subset \mathbb{R}$ then $$m^* \left ( \cup_{n=1}^{\infty} A_n\right ) \leq \sum_{n=1}^{\infty}m^*(A_n)$$

We suppose that $m^*(A_n)<+\infty, \forall n$.

Let $\epsilon>0$. Then for each $n$ there are rectangles $R_j^n,j=1,2,...$ such that $A_n \subset \cup_{j=1}^{\infty}R_j^n$ and $\sum_{j=1}^{\infty}v(R_j^n)<m^*(A_n)+\frac{\epsilon}{2^n}$.

Then $\cup_{n=1}^{\infty}A_n\subset\cup_{j,n}R_j^n$

$$\sum_{n=1}^{\infty}\sum_{j=1}^{\infty}v(R_j^n)<\sum_{n=1}^{\infty}m^*(A_n)+\epsilon$$

$$m^* \left ( \cup_{n=1}^{\infty}A_n \right ) \leq \sum_{j,n}v(R_j^n)<\sum_{n=1}^{\infty}m^*(A_n)+\epsilon \\ \Rightarrow m^* \left ( \cup_{n=1}^{\infty}A_n\right ) \leq \sum_{n=1}^{\infty}m^*(A_n)$$Could you explain me this proof??

Hi mathmari,

The proof displayed is incomplete. Everything is fine until the last three lines of inequalities, where there is no explanation. There also are two cases to consider -- one which deals with $m^*(A_k) = +\infty$ for some $k$, and the other which you've displayed. If $m^*(A_k) = +\infty$ for some $k$, then suppose $\{R_j\}$ is an arbitrary covering of $\cup A_n$ by open rectangles. These rectangles also cover $A_k$, and thus $\sum_{j = 1}^\infty v(R_j) = +\infty$. This shows that $m^*(\cup_{n=1}^\infty A_n) = +\infty$.

Now let's go back to your case, where $m^*(A_n) < +\infty$ for all $n$. We want to show that $m^*(\cup_{n=1}^\infty A_n) \le \sum_{n=1}^\infty m^*(A_n)$, which is equivalent to showing

\(\displaystyle m^*(\cup_{n=1}^\infty A_n) \le \sum_{n=1}^\infty m^*(A_n) + \epsilon\) for all \(\displaystyle \epsilon > 0.\)

By definition of the infimum of a set $S \subset \Bbb R$, any number greater than $\inf S$ is not a lower bound for $S$. Keeping this in mind, we know that for every $\epsilon > 0$ and $n \in \Bbb N$, $m^*(A_n) + \frac{\epsilon}{2^n}$ is not a lower bound for the set

\(\displaystyle S_n := \{\sum_{j = 1}^\infty v(R_{j,n})\, |\, \text{$R_{j,n}$ are open rectangles such that $A_n \subset \cup_{j=1}^\infty R_{j,n}$}\}.\)

Therefore, for each $n$, there exists a covering $\{R_{j,n}\}_{j= 1}^\infty$ of $A_n$ by open rectangles such that

\(\displaystyle \sum_{j=1}^\infty v(R_{j,n}) < m^*(A_n) + \frac{\epsilon}{2^n}.\)

Since $\cup_{j=1}^\infty R_{j,n} \supset A_n$ for all $n$, we have $\cup_{j,n} R_{j,n} \supset \cup_{n = 1}^\infty A_n$. Hence, by definition of $m^*(\cup_{n = 1}^\infty A_n)$ and the previous inequality,

\(\displaystyle m^*(\cup_{n=1}^\infty A_n) \le \sum_{j,n} v(R_{j,n}) = \sum_{n = 1}^\infty \sum_{j = 1}^\infty m^*(A_n) \le \sum_{n = 1}^\infty \left(m^*(A_n) + \frac{\epsilon}{2^n}\right) = \sum_{n = 1}^\infty m^*(A_n) + \epsilon.\)

Since $\epsilon$ was arbitrary, the result follows.
 
Last edited:
  • #3
(Happy)(Happy)(Happy)(Happy)
Euge said:
Hi mathmari,

The proof displayed is incomplete. Everything is fine until the last three lines of inequalities, where there is no explanation. There also are two cases to consider -- one which deals with $m^*(A_k) = +\infty$ for some $k$, and the other which you've displayed. If $m^*(A_k) = +\infty$ for some $k$, then suppose $\{R_j\}$ is an arbitrary covering of $\cup A_n$ by open rectangles. These rectangles also cover $A_k$, and thus $\sum_{j = 1}^\infty v(R_j) = +\infty$. This shows that $m^*(\cup_{n=1}^\infty A_n) = +\infty$.

Now let's go back to your case, where $m^*(A_n) < +\infty$ for all $n$. We want to show that $m^*(\cup_{n=1}^\infty A_n) \le \sum_{n=1}^\infty m^*(A_n)$, which is equivalent to showing

\(\displaystyle m^*(\cup_{n=1}^\infty A_n) \le \sum_{n=1}^\infty m^*(A_n) + \epsilon\) for all \(\displaystyle \epsilon > 0.\)

By definition of the infimum of a set $S \subset \Bbb R$, any number greater than $\inf S$ is not a lower bound for $S$. Keeping this in mind, we know that for every $\epsilon > 0$ and $n \in \Bbb N$, $m^*(A_n) + \frac{\epsilon}{2^n}$ is not a lower bound for the set

\(\displaystyle S_n := \{\sum_{j = 1}^\infty v(R_{j,n})\, |\, \text{$R_{j,n}$ are open rectangles such that $A_n \subset \cup_{j=1}^\infty R_{j,n}$}\}.\)

Therefore, for each $n$, there exists a covering $\{R_{j,n}\}_{j= 1}^\infty$ of $A_n$ by open rectangles such that

\(\displaystyle \sum_{j=1}^\infty v(R_{j,n}) < m^*(A_n) + \frac{\epsilon}{2^n}.\)

Since $\cup_{j=1}^\infty R_{j,n} \supset A_n$ for all $n$, we have $\cup_{j,n} R_{j,n} \supset \cup_{n = 1}^\infty A_n$. Hence, by definition of $m^*(\cup_{n = 1}^\infty A_n)$ and the previous inequality,

\(\displaystyle m^*(\cup_{n=1}^\infty A_n) \le \sum_{j,n} v(R_{j,n}) = \sum_{n = 1}^\infty \sum_{j = 1}^\infty m^*(A_n) \le \sum_{n = 1}^\infty \left(m^*(A_n) + \frac{\epsilon}{2^n}\right) = \sum_{n = 1}^\infty m^*(A_n) + \epsilon.\)

Since $\epsilon$ was arbitrary, the result follows.

I understand! Thank you very much for the explanation! (Happy)
 

FAQ: Proof of Outer Lebesgue Measure Monotonicity and Subadditivity

What is the definition of outer Lebesgue measure?

The outer Lebesgue measure is a measure of the size or length of a set in Euclidean space. It is defined as the infimum of the sum of the lengths of all coverings of the set by open intervals.

What is the significance of proving monotonicity and subadditivity for outer Lebesgue measure?

Proving monotonicity and subadditivity for outer Lebesgue measure is important because it ensures that the measure has desirable properties and is consistent with our intuitive understanding of size and length. Without these properties, the measure may not accurately reflect the size of sets in Euclidean space.

How is monotonicity defined for outer Lebesgue measure?

Monotonicity for outer Lebesgue measure means that the measure of a set A is less than or equal to the measure of its superset B, if A is a subset of B. This property ensures that adding more elements to a set does not decrease its measure.

What is subadditivity for outer Lebesgue measure?

Subadditivity for outer Lebesgue measure means that the measure of the union of two sets is less than or equal to the sum of their individual measures. This property ensures that the measure of a combined set is not greater than the sum of its parts.

How are monotonicity and subadditivity proven for outer Lebesgue measure?

Monotonicity and subadditivity are typically proven using the Carathéodory criterion, which involves showing that the outer measure of a set is equal to the infimum of sums of covers by open intervals. This can be done by constructing appropriate covers and using properties of outer measure such as countable subadditivity.

Similar threads

Replies
4
Views
1K
Replies
1
Views
2K
Replies
2
Views
2K
Replies
4
Views
1K
Replies
11
Views
914
Replies
44
Views
6K
Replies
4
Views
1K
Back
Top