MHB How Can One Prove the Besicovitch Covering Lemma for an Unbounded Set?

  • Thread starter Thread starter ArcanaNoir
  • Start date Start date
Click For Summary
The discussion focuses on proving the Besicovitch Covering Lemma for an unbounded set E in R^n using a collection of cubes. The goal is to establish a countable subcollection of cubes that covers E and includes the middle sections of the original cover, despite E being unbounded. A proposed strategy involves creating "layers" of cubes based on their sizes and selecting points in E that are spaced apart, although challenges arise in ensuring the correct distance and arrangement of these points. The original proof referenced only covers the centers of the cubes and assumes a bounded set, necessitating modifications for the unbounded case. Overall, the conversation highlights the complexities of adapting existing proofs to meet the specific requirements of the lemma.
ArcanaNoir
Messages
778
Reaction score
4
Let {Q} be a collection of cubes covering a set E in R^n. Prove that there is a countable sub collection {Q}' of these cubes which covers E and \cup {\frac{1}{2}Q} \subseteq \cup {Q}', and the number of cubes in the subcollection containing any given point of E is less than something depending only on the dimension.
Oh and the sup of the side lengths of the cubes is bounded, but E is not bounded.

\frac{1}{2}Q means the cube inside Q with side length 1/2 of the side length of Q.
In other words, the countable subcovering needs to cover the middle sections of the original cover.

I really like this proof Real Analysis - Emmanuele DiBenedetto - Google Books

But in this proof the set E is the centers of the cubes, so we only end up covering centers, not middle halves, and also E is bounded in that proof. My professor said I could modify this proof but I don't see how. *sad face* He also said the first half of my most recent attempt at this proof was badly written and the second half was worse. :(:(

The idea for dealing with the unbounded set E is to take "layers" of cubes which are about the same size. So something like sup{S(Q)}=R where S(Q) is the side length of Q and then (1-\epsilon)^kR< S(Q)\le R for the first layer, then take a maximal set of points in E which are some specific distance apart (this is a piece I messed up on, no matter what distance I separate my points by there is always some flaw in my choice). Then take the cubes containing those points and discard some cubes (which ones?). Rinse and repeat.

I tried doing some optimal arrangement of separated points around a specific point for the bound, but I was told I did that wrong too :( (that was the "worse" part apparently.)
 
Physics news on Phys.org
I see you've set your thread to SOLVED.
Did you get inspiration then? :rolleyes:
 

Similar threads

  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
6K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 44 ·
2
Replies
44
Views
6K