A point of a Lebesgue measurable set
is called the Lebesgue density point of
if
where
denotes the open ball of radius
about
; in some sense this means that
takes 100% of the space about
. In general, if the limit above exists (regardless of whether it’s equal to 1 or not), we call it’s value the Lebesgue density of
at
, denoted by
. Fixing any Lebesgue measurable set
, there’s a theorem called Lebesgue density theorem which states that for almost every
we have either
or
. The theorem looks reasonable if we think of simple shapes in space, for example if
is a closed filled square in
, then the interior points have density
while the points in the complement have density 0, and the points on the boundary have measure density
, but the boundary of the square is a measure zero in
. Restricting our attention to
and thinking about it for the favorite set in real analysis, Cantor set, it’ll still make sense, because the Cantor set after all has measure zero itself, so those fractions are zero for all of the radii
and point
. Now one might wonder to twist the situation more by thinking about the fat Cantor set
; where the set now has some mass in contrast with the Cantor set. Then how do the density and non-density points (i.e. points where that limit is either not equal to 1 or it doesn’t exist) of
look like? The fat Cantor set contains some easy to find Lebesgue non-density points: the boundary points of the open intervals that we remove at each step have density
, let such points in
be denoted by
.
Question: Is there any point in that is a non-density point of
?
The answer is Yes.
Let’s use a number system for representing the points of the fat Cantor set, which is similar to the representation
for points of the normal Cantor set in the ternary system, in the sense that we make a tree out of our fat Cantor set and each digit
or
will correspond to moving left or right in the tree. Then in this way each sequence
represents exactly one point of our Cantor set, because the points in the set described by
can be obtained by intersecting a sequence of nested closed (hence compact) intervals, which is non empty, and further that the intervals are shrinking, hence denoting exactly a point. So for example, in our system, the number
is the right-most point of
. And it’s easy to see that the boundary points of
correspond to eventually-constant sequences of
.
We now begin the construction of a desired point . We consider the natural numbers
, and
and we want to construct a point
such that for a subsequence
of
‘s. Start with
and at first add
-many
‘s in the beginning of the name of
so that we can be sure that any point in
whose first
-many digits are
(will be using the notation
for them), is close enough to the right-most possible point of
(call it
) which ensures
(this is possible because the right half of the interval
contains no points in
, meaning that
, so if
is close enough to
, we can have the intended inequality). So any number of the form
is working for
. Let’s increment
to
. Now it’s possible that any number of the aforementioned form also works for
, meaning that for any such
we have
; if that happened at any
, increment
another time. If
for all of the
, meaning that we can increment
indefinitely, then already any point in
that is not a boundary point is an ideal point; so as boundary points correspond to eventually-constant
-numbers, we can for example set the rest of the digits of
as alternating between
and
every other time. So now assume that we can’t increment
indefinitely and there is some
such that not for all
we have
. Surely we can remedy that by adding more
‘s at the beginning of our current general form for
, but if we keep doing that with all
‘s, then the point
we are constructing would become the right-most boundary point, which we have wanted to avoid. So whenever
is not always
, it’s a good time to make an alteration in our general form. Now if we let
to be the left-most point of
, (which is just the left boundary point of the right-most interval at the
-level of the construction of the fat Cantor set where
intervals are present), we check whether
is empty or not; if it’s non empty then increment
again and evaluate
again; this incrementation eventually stops at some
, calling it
, because
is an endpoint. When
, we proceed to add
-many
‘s to our general form so that (by a similar argument as above) for any
, we have
close enough to
and hence
. And we proceed in the same manner, adding
-many
‘s,
-many
‘s, etc.
So after iterating once through the numbers , we have built a subsequence
and a point
such that
, showing that either
does not exists or it’s
.
Let me know if you have any other proofs!
For LaTeX in the comments, please use the syntax $latex followed by a space and your formula, and then closing by another $.
Discover more from Investigations in Forms
Subscribe to get the latest posts sent to your email.