Cantor Set

See Lecture 19 - Cantor Set:

We construct the Cantor Set in the following way:
C0=[0,1]
C1=[0,13]∪[23,1]=C0∖(13,23)
C2=C1∖((19,29)∪(79,89))
And so on:

Notice that:
C0⊃C1⊃C2⊃…
We define the final set as:
C=⋂i=0∞Ci
What is in C? Well notice that:
0,1,13,23,⋯∈C
C has all the endpoints each of the form:
m3n∈C
So does this imply that C is countably infinite? Consider instead asking how much length of the interval is there. We have C0 has a length of 1:

  • The first step removes 1/3 of the length.
  • The second step removes 2/9 of the length
  • The next removes 4/27 of the length
  • ...
    We remove:
    13+29+⋯=13(1+23+(23)2+…)
    This is a geometric series:
    =13⋅11−23=1
    So this implies that C should have no length. Maybe it is indeed countably infinite?

Another Perspective

Let x∈C. Construct a sequence of $0s and $1s as follows (the example uses the case where x=79∈C):
79:101―=101111111…
Where the first digit says:

  • 1 if it is in the right sub-interval after the first cut
  • 0 if it is in the left sub-interval after the first cut

We repeat this process for each cut, adding digits. As another example:
19:001―=0011111111…
Now consider an arbitrary sequence of these digits. We want to do Cantor's Diagonalization Method to try to construct some new digit that isn't in the list:
(b1,b2,b3,…)
We can change the first digit of b1, the second of b2, the third of b3, and so on to make a new digit x.

Another way of thinking of this is that each Ci⊇Ci+1. This implies that we can use the Ciswiththe[[8College/84SeniorYear/841Fall/RealAnalysisI(MATH412)/TextbookNotes/1TheRealNumbers/Theorems/NestedIntervalProperty∥NestedIntervalProperty]]toshowthat:
\exists x \in \bigcap_{i=1}^{\infty} C_{i} = C
$
But in both cases, there are uncountable many such sequences! So then C must not be countable.

Dimensions of A Set

To set the stage, consider a 0-dimensional object, 1-dimensional object, ...

The idea from geometry is if you multiply an n-dimensional object by c, then the area/volume/... of that object is scaled by cn. In this case c=3 so it magnifies by 3n.

For the case of Cantor's set is if we scale each line by 3:

So somehow we had some n-dimensional object, scaled by 3, where the area/volume/length here got scaled by 2! Not 3 as we expected. Here:
size⋅2=3n⇒n=log3⁡(2)
So somehow we have fractional dimension. This is where the word fractal comes from (fracttional dimension). This brings us into talking about the start of the new section:

Topology of R

Recall the definition of the Epsilon-Neighborhood of x:

ε-neighborhood of a

Vε(a)=(a−ε,a+ε)={x∈R||x−a|<ε}

open set

Let U⊆R. Then U is open if:
∀x∈U∃ε>0(Vε(x)⊆U)
ie: each x∈U has some ε-neighborhood contained in U.

Example: (a,b)

(a,b) is open.

Since choose ε=min(|x−a|,|x−b|) implies that Vε(x)⊆(a,b).

By constrast if we considered even a one-sided interval like (a,b] then it is NOT open:

Notice if $x = b$ then any $\varepsilon > 0$ would have some element in $V_\varepsilon(b)$ be outside the interval.

See also Union & Intersection of Collections of Open Sets.

Connecting it to Sequences

Definition

Let A⊆R and x∈R. Then
x is a limit point of A if every Epsilon-Neighborhood of x intersects A at a point other than x. Namely:
∀ε>0(Vε(x)∩A≠{x}∧∅)

For example, if A=(a,b], then what are the limit points of A? The limit points of A are:
=a,b

Alternative Definition of Limit Point

Alternative Definition of Limit Point

Let A⊂R and x∈R. Then x is a limit point of A iff ∃(an):
an∈A∖{x}
for all n and an→x.

Proof

(⇒): Suppose x is a limit point of A. Let's apply a sequence of neighborhoods such that we can construct an. To do this, let n∈N. Then choose:
an∈(V1n(x)∖{x})∩A
we claim that an→x. To prove this via the definition let ϵ>0. Choose N∈N such that 1N<ϵ. Then suppose n≥N then:
|an−x|<1n(an∈V1n(x))≤1N<ϵ
(⇐): Suppose ∃an where an∈A−{x} for all n and that an→x. Let ϵ>0 so that Vϵ(x) is an epsilon-neighborhood of x. We want to show that (Vϵ(x)−{x})∩A≠∅. We can choose a N∈N such that:
|an−x|<ϵ
by the definition and that an→x. Then definitely |aN−x|<ϵ, so then N∈Vϵ(x). Furthermore clearly aN∈A while aN≠x so then aN∈(Vϵ(x)−{x})∩A is not empty as desired.

☐

To illustrate this, consider:
A={1n|n∈N}
Then the set of all limit points of A is just {0}. Notice other points like 12 are not in this set since there's no sequence of numbers constructing from the set cannot approach 12.

Another example is when A=Q. The set of limit points of A are now R.