2
$\begingroup$

Show that a subset $E$ of $R$ has measure zero iff there exists a sequence of intervals $\{I_{n}\}$ such that $a)\sum\ m(I_{n})<\infty; $ and $b)$ $x $ in $E$ implies $x$ lies in infinitely many $I_{n}$'s .

I am sorry for formatting, I am newcomer to this forum, most of the things seems pretty new to me.

I am comfortable proving one direction from right to left, where I use the Borel-Cantelli lemma to get the result.

While attempting left to right, we can easily get the covering of the set $E$ which has measure less than any chosen epsilon ( by def of outer measure). My problem is showing for each $x$ in $E$ lies in infinitely many of $I_{n}$'s. That is essentially proving $x$ belong to $\limsup I_{n}$ (I think). I can imagine $x$ lying in many of $I_{n}$ but I do not know how can I be rigorous on that point.

1 Answers 1

3

($\Rightarrow$): Suppose $mE = 0$. For any $\epsilon>0$, there exists a countable collection of intervals $\{I_n^\epsilon\}_n$ such that $E \subset \cap_n I_n^\epsilon$, and $\sum_n m I_n^\epsilon < \epsilon$. By choosing $\epsilon = \frac{1}{2^m}$, we have a countable collection of intervals for each $m$. The collection of intervals $\{I_n^{\frac{1}{2^m}}\}_{n,m}$ is countable, so we can relabel them as $\{J_n\}$. By construction, each element $x \in E$ lies in infinitely many $J_n$, and we have $\sum m J_n \leq \sum_m \frac{1}{2^m} = 1$.

($\Leftarrow$): Suppose a) & b) are true. Let $\phi(x) = \sum 1_{I_n}(x)$. By assumption, if $x \in E$, we have $\phi(x) = \infty$. However, $\int \phi \leq \sum m I_n < \infty$, and since $\infty \cdot m E \leq \int \phi$, we see that $m E = 0$.

Notes:

  1. For the 'only if' direction, note that for each $m$, the collection $\{I_n^{\frac{1}{2^m}}\}_{n}$ is a covering of $E$. The collection may be overlapping, and it is possible that the collection is the same for different values of $m$ (but the total interval length is $< \frac{1}{2^m}$).
  2. Here is an explicit formula for relabeling the $\{I_n^{\frac{1}{2^m}}\}_{n,m}$: If $k$ is a positive integer, let $p(k) = \lceil \sqrt{2k+\frac{1}{4}} - \frac{1}{2} \rceil$, and then let $n(k) = p(k)-(k-p(k))$, $m(k) = k-p(k)+1$. Then the mapping $k \mapsto (n(k),m(k))$ is a bijection between $\mathbb{N}$ and $\mathbb{N}^2$. (To see where the mapping $p$ came from, it is loosely an inverse of the mapping $n \mapsto \frac{1}{2}n(n+1)$.) So we let $J_k = I_{n(k)}^{\frac{1}{2^{m(k)}}}$.
  • 0
    can we say x in E lies in infinitely many (disjoint) $I_{n}$'s. Is it obvious from the proof you gave or we need to be more precise?2012-12-20
  • 0
    No, by definition a point cannot lie in two disjoint sets? For example, if $E=\{0\}$, then we may have $J_n = [-\frac{1}{n},\frac{1}{n}]$, and then $\cap_n J_n = \{0\}$. In this case if $x \in E$, then $x \in J_n$ for all $n$.2012-12-20
  • 0
    For my own curiosity, why would you want the sets to be disjoint?2012-12-20
  • 0
    Can you be more precise on relabeling the intervals. I am kind of confuse there.2012-12-20
  • 0
    I am sorry, I mean to say distinct not disjoint. I think those infinitely many intervals have to be distinct to be able to say the point x really belong to the infinitely many intervals. Am I correct?2012-12-20
  • 0
    I am trying to find a cute relabeling formula. However, you can imagine an infinite array of dots at points $(n,m)$ with $n,m$ being positive integers. Then draw diagonal lines through the dots and count this way. For example, $(1,1)$, then $(2,1),(1,2)$, then $(3,1),(2,2),(1,3)$, etc. This eventually hits all pairs exactly once. But my early morning brain is stumbling on the formula at the moment...2012-12-20
  • 0
    Humm, I think I used somehow similar method to show Cartesian product of rationals are countable. Having precise formula would be wonderful though. Thank a lot.2012-12-20
  • 0
    I have added an explicit formula above.2012-12-20
  • 0
    Sweet. Thanks you.2012-12-20
  • 0
    How do I do that? I am new here. I like to do that.2012-12-20
  • 0
    I mean literally I do, I don't know if I need to click something to tell this publicly.2012-12-20
  • 0
    Actually, I don't know, I have never asked a question. This might help? http://meta.math.stackexchange.com/questions/3286/how-do-i-accept-an-answer2012-12-20
  • 0
    Yea, I know now and I did. You are such a brilliant. I would not even ask anything If I were you. :).2012-12-20
  • 0
    Thanks Deepak, I am not, but I am glad to help!2012-12-20