jostpuur
- 2,112
- 19
Assumptions: f:[a,b]\to\mathbb{R} is some measurable function, and M is some constant. We assume that the function has the following property:
<br /> [x,x']\subset [a,b]\quad\implies\quad |f(x')-f(x)|\leq M(x'-x)<br />
The claim: The function also has the property
<br /> m^*(f([a,b]))\leq M(b-a)<br />
I'm not sure if this is supposed to be easy, true or something else. It has been some time since I last thought about measure theory.
Some thoughts on the proof: It looks like we need the definition of the outer measure. So if we fix some \epsilon >0, then we have some intervals I_1,I_2,I_3\ldots such that
<br /> f([a,b])\subset \bigcup_{n=1}^{\infty} I_n<br />
<br /> \sum_{n=1}^{\infty} m(I_n) < m^*(f([a,b])) + \epsilon<br />
The goal would be to prove something like
<br /> \sum_{n=1}^{\infty} m(I_n) \lesssim M(b-a)<br />
How to get there? We know
<br /> [a,b] \subset\bigcup_{n=1}^{\infty} f^{-1}(I_n)<br />
but the preimages are not intervals, so I don't see how to use this for anything.
<br /> [x,x']\subset [a,b]\quad\implies\quad |f(x')-f(x)|\leq M(x'-x)<br />
The claim: The function also has the property
<br /> m^*(f([a,b]))\leq M(b-a)<br />
I'm not sure if this is supposed to be easy, true or something else. It has been some time since I last thought about measure theory.
Some thoughts on the proof: It looks like we need the definition of the outer measure. So if we fix some \epsilon >0, then we have some intervals I_1,I_2,I_3\ldots such that
<br /> f([a,b])\subset \bigcup_{n=1}^{\infty} I_n<br />
<br /> \sum_{n=1}^{\infty} m(I_n) < m^*(f([a,b])) + \epsilon<br />
The goal would be to prove something like
<br /> \sum_{n=1}^{\infty} m(I_n) \lesssim M(b-a)<br />
How to get there? We know
<br /> [a,b] \subset\bigcup_{n=1}^{\infty} f^{-1}(I_n)<br />
but the preimages are not intervals, so I don't see how to use this for anything.
Last edited: