Outer measure of a closed interval .... Axler, Result 2.14 ....

Click For Summary
SUMMARY

The discussion centers on the proof of Result 2.14 from Sheldon Axler's book, "Measure, Integration & Real Analysis," specifically in Chapter 2 regarding measures. The proof establishes that for an arbitrary collection of open intervals covering the closed interval [a, b], the inequality $$\sum_{k=1}^{\infty} l(I_k) \geq b - a$$ confirms that the outer measure of the interval satisfies $$\mid [a, b] \mid \geq b - a$$. This conclusion is critical as it demonstrates that the outer measure is a lower bound for the length of the interval.

PREREQUISITES
  • Understanding of outer measure as defined in measure theory
  • Familiarity with the concept of open intervals and their lengths
  • Knowledge of induction proofs in mathematical analysis
  • Basic grasp of infimum and supremum in the context of sets
NEXT STEPS
  • Study the definitions and properties of outer measure in detail
  • Review the concept of open intervals and their lengths in measure theory
  • Learn about induction proofs and their applications in mathematical analysis
  • Explore the implications of infimum and supremum in the context of measure theory
USEFUL FOR

Mathematicians, students of real analysis, and anyone studying measure theory who seeks a deeper understanding of the properties of outer measures and their proofs.

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Sheldon Axler's book: Measure, Integration & Real Analysis ... and I am focused on Chapter 2: Measures ...

I need help with the proof of Result 2.14 ...

Result 2.14 and its proof read as follows:
Axler - Result  2.14- outer measure of a closed interval .png


In the above proof by Axler we read the following:

" ... ... We will now prove by induction on n that the inclusion above implies that $$ \sum_{ k = 1 }^n l(I_k) \ \geq b - a$$This will then imply that $$\sum_{ k = 1 }^{ \infty } l(I_k) \geq \sum_{ k = 1 }^n l(I_k) \ \geq b - a$$, completing the proof that $$\mid [a, b] \mid \ \geq b - a$$. ... ... "Can someone please explain exactly why $$\sum_{ k = 1 }^{ \infty } l(I_k) \ \geq \sum_{ k = 1 }^n l(I_k) \ \geq b - a$$ completes the proof that $$\mid [a, b] \mid \ \geq b - a$$. ... ...

Indeed ... can someone please show, formally and rigorously, that $$\sum_{ k = 1 }^{ \infty } l(I_k) \ \geq \sum_{ k = 1 }^n l(I_k) \ \geq b - a$$ implies that $$\mid [a, b] \mid \geq b - a$$. ... ...
Help will be much appreciated ... ...

Peter=============================================================================================================

Readers of the above post may be assisted by access to Axler's definition of the length of an open interval and his definition of outer measure ... so I am providing access to the relevant text ... as follows:
Axler - Defn 2.1 & 2.2 .png

Hope that helps ...

Peter
 
Last edited:
Physics news on Phys.org
Hi Peter,

According to the author, it has been established that $\vert [a,b]\vert \leq b-a.$ Hence, it only remains to show that $\vert [a,b]\vert \geq b-a.$ Since $\{I_{k}\}_{k=1}^{\infty}$ is an arbitrary collection of open intervals that covers $[a,b]$, this proof establishes the fact that $b-a$ is a lower bound for the set $\left\{\sum_{k=1}^{\infty}l(I_{k})\,:\, I_{1}, I_{2},\ldots \text{ are open intervals such that } A\subset\bigcup_{k=1}^{\infty}I_{k} \right\}.$ Since the infimum is the greatest lower bound, it follows that $$b-a\leq\inf{\left\{\sum_{k=1}^{\infty}l(I_{k})\,:\, I_{1}, I_{2},\ldots \text{ are open intervals such that } A\subset\bigcup_{k=1}^{\infty}I_{k} \right\}} =\vert[a,b]\vert\leq b-a.$$
 
Last edited:
Thanks GJA ...

Really appreciate your help ...

Peter
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
2K