Homepage Solution manuals Terence Tao An Introduction to Measure Theory Exercise 1.6.21 (Besicovich covering lemma in one dimension)

Exercise 1.6.21 (Besicovich covering lemma in one dimension)

Let I1,,In be a finite family of open intervals in R (not necessarily disjoint). Show that there exist a subfamily I1,,Im of intervals such that

(i)
i=1nIn = j=1mIm; and
(ii)
Each point x R is contained in at most two of the Im.

Answers

Proof. Let F denote the family of open intervals I1,,In. Consider the subcollection F of all intervals in F that are not contained in the union of the other intervals, i.e.,

F := {I j F |Ij 1in;ijIj} .
(1)

Let m := #F and enumerate the elements of F by I1,,Im. We argue that at m, it is not possible for a point to be contained in three of the intervals and that i=1nIn = j=1mIm holds.

(i)
i=1nIi = j=1mIj;
To demonstrate that the former union is a subset of the latter, pick an arbitrary x i=1nIi, i.e., x Ii for 1 i n. If Ii is not contained in the union of other intervals I1,,Ii1,Ii+1,,In, then Ii = Ij for some 1 j m by construction and we are done. If that is again not the case, then Ii is contained in the union of some other intervals, i.e., x Ii2 for some i2i. If Ii2 satisfies the requirement of our refinement, then we are done. If not, we can find another set Ii3 for some i3i,i2. Continuing the argument in that manner, we must terminate at some 1 i n, latest at some ini,i2,,in1. The resulting set Ii cannot be contained in the union of the other intervals and must thus be equal to Ij for some 1 j m as desired.
The other direction follows directly from construction.
(ii)
Each point x R is contained in at most two of the Im.
Suppose for the sake of contradiction that x is contained in at least three refined intervals Ij1 = (a1,b1), Ij2 = (a2,b2) and Ij3 = (a3,b3). Our strategy is to look for two intervals with the widest combined radius.
PIC
Figure 1: Out of three intervals with a non-empty intersection, the union of two of the furthest lying is always going to contain the third one.

Let ai := min {a1,a2,a3} be the point residing furthest on the left, and let bj := max {b1,b2,b3} be the point residing furthest on the right. Then it is obvious that the associated intervals (ai,bi) (aj,bj) is going to contain the third interval, which has neither the point furthest to the left nor furthest to right. Thus, we arrive at a contradiction.

User profile picture
2021-12-23 15:58
Comments