1

Aaagain, I fail to understand the trivial:

Using compactness argument it is straightforward to show: $$\lambda^{*}([a,b]) \geq b-a$$ And everything is OK.

But, regarding $\lambda^{*}([a,b]) \leq b-a$, Cohn says:

For any closed bounded interval $[a,b] \subset \mathbb{R}$ it is easy to see that $\lambda^{*}([a,b]) \leq b-a$ (cover $[a,b]$ with sequences of open intervals in which the first interval is barely larger than $[a,b]$, and the sum of the lengths of the other intervals is very small).

From this hint I should be able to arrive at $\lambda^{*}([a,b]) < b-a + \epsilon$, for arbitrary $\epsilon >0$, but I don't understand how..

Help?

user76568
  • 4,542

1 Answers1

1

The simplest solution is to cover your your interval $[a,b]$ with just $1$ interval $(a-\frac\varepsilon2,b+\frac\varepsilon2)$ of length $b-a+\varepsilon.$ That's why it's trivial.

If you definition is needlessly restrictive and requires infinitely many open intervals, set empty sets for the remaining intervals.

If your definition of an interval is needlessly restrictive, you can cover your set like this $$\left(a-\frac\varepsilon4,b+\frac\varepsilon4\right)\cup\bigcup_{n=3}^\infty\left(-\frac\varepsilon{2^n},\frac\varepsilon{2^n}\right)$$ of total length $b-a+\frac\varepsilon2+\sum\limits_{n=2}^\infty\frac\varepsilon{2^n}=b-a+\frac\varepsilon2+\frac\varepsilon2=b-a+\varepsilon$.

Maybe now you see why is it stupid to not allow what I suggest.

user2345215
  • 16,422
  • Thanks. But note that It's not my definition, and I will not call It stupid, because I do not yet know if these restrictions are in fact useful or not. My ""guess"" is that they are useful. – user76568 Mar 07 '14 at 18:00