Lecture 21 - More Definitions on Topology

We defined:

Isolated Point

A point aA is an isolated point of A if it is not a Limit Point of A. Namely, ε>0(Vε(a)A={x}).

The definition here is to avoid the case in the limit pointer where we have the sequence (a,a,a,), since that is technically a limit point.

You can think of having some space between a and all the contiguous points of A.

It's literally isolated! For more definitions:

Closed (Toplogical)

A set FR is closed if it contains its Limit Points.

Closure

AR The closure of A is:
A=A{x|x is a limit point of A}

We then presented the following theorem:

Closure implies Cauchy Sequences

A is Closed (Toplogical) ifff every Cauchy Sequence in A converges to a point in A.

Proof

See 32 Open and Closed Sets Practice#3.2.5:

3.2.5

Closure implies Cauchy Sequences

A is Closed (Toplogical) ifff every Cauchy Sequence in A converges to a point in A.

Proof

(): Suppose A is closed, so then A contains it's limit points. Let (xn)A be a Cauchy Sequence. Then (xn) converges by being Cauchy. Say it converges to x, then since A is closed then xA as required since A contains its limit points, which are equivalent to the limits of the convergent sequences of A.

(): Suppose (xn)A where (xn)x (ie: the sequence (xn) is Cauchy because it converges) where xA. We need to show that A contains it's limit points.

Let be a limit point of A. We want to show that A. Since is a limit point of A then equivalently there is some sequence of points in A{} where it converges to . Denote this sequence (an)A{} where (an). then since all convergent sequences in A converge to a point in A then A.

See some examples at Lecture 21 - More Definitions on Topology#Examples.

This implies that, for example, The Density of Q in R can be reformulated as:

(Density of Q in R, via Sequences)

For every yR then (xn)Q as a Sequence such that it converges to y.

This suggests that we can always find some rational approximation for a real number, no matter what!

Examples

Let a<b. Then

  1. [a,b] is closed.
  2. For xR, then {x} is closed (the limit points are only x which is in the set).
  3. R is definitely closed (any limit point is a real number)
Theorem

Let AR. Then A (the closure of A) is the smallest closed set containing A.

The proof isn't super trivial, since we might accidentally throw in too many points.

Proof

If L is the set of limit points of A, then it is immediately clear that A contains the limit points of A. There is still something more to prove, that because taking the union of L with A then we could potentially produce some new limit points of A. See 32 Open and Closed Sets Practice#3.2.7 for practice on this.

Now any closed set containing A must contain L as well. This shows that A=AL is the smallest closed set containing L.

Some Notes on Open/Closed

While gramatically we may think open/closed here implies they are opposites, that isn't the case. There are cases where a set may be neither open nor closed such as:

(a,b]

Another example would be:

{1n|nN}

Some sets can be both open and closed. Some examples are:

In the HW we show that these are the only two sets that are subsets of R that do this.

Complement Ac

If AR then:
Ac=RA

See Closed Implies Complement is Open (Vice Versa) for an application of this.

Theorem

Let AR. Then A is open iff Ac (the Complement) is Closed (Toplogical). This is the same as saying that A is closed iff Ac is open.

Proof

(): Suppose A is open. Let's show Ac is closed.

Let x be a limit point of Ac. We want to show that xAc, so assume for contradiction that xA, so then ϵ>0 where Vϵ(x)A. But then for any sequence of points in Ac, no element can be within ϵ distance of A, so x cannot be a limit point of A. This is a contradiction, so xA.

(): Suppose Ac is closed. Let yA. Then y is not a limit point of Ac. Then ϵ>0 such that:
Vϵ(y)Ac=
But if that's the case then Vϵ(y)A as desired.

Theorem

An arbitrary insersection of Closed (Toplogical) sets is closed.
A finite union of closed sets is closed.

Proof

Apply DeMorgan's Law with Closed Implies Complement is Open (Vice Versa) and use an induction. See also Union & Intersection of Collections of Open Sets for a similar proof.

compact set, compactness

Let KR. K is compact if every Sequence of points in K has a subsequence which converges to a point kK.

Some examples include:

  1. Let a<b. Then [a,b] is compact. Why? If I have a sequence of points (xn)[a,b] for all nN then nN then axnb. This means the sequence is bounded. So then apply the Balzano-Weierstrass Theorem to get that there a convergent subsequence (xnk) that converges.

    But for each kN then axnkb still. We know (xnk) is convergent, so say (xnk)x so by the Limits and Order (Order Limit Theorem) then axb. We know x[a,b] as a result.

  2. As a counter example R is not compact. The sequence of numbers:
    (1,2,3,4,)R
    has no convergent subsequence.

Nested Compact Set Property

If:
K1K2
are nested, compact, nonempty sets. Then:
n=1Kn

Sketch of the proof:

Notice nN then let xnKn. Note x1K1, x2K2K1, x3K3x3K2x3K1, and so on. Then each xnK1. Therefore, then a convergent subsequence (xni) where x=limixniK1

Now xn1Kn1K1 since n11. Similarly xn2Kn2K2 since n22. In general xniKi for all i since nii. Now:
x=limixni=(xn2,xn3,)K2

We can repeat this process, where the next step shows:
x=limixniKi
so xKi for all i so then their intersection is non-empty.

Proof

For each nN pick a point xnKn. Because the compact sets are nested then (xn)K1 and by the definition of compactness then there is a convergent subsequence (xnk) whose limit xK1.

But you can repeat this process for each Kn. To show this use a particular n0N so the terms in the sequence (xn)Kn0 when nn0, ignoring the finite number of terms at the start. Thus then the same subsequence (xnk)Kn0, so then x is a limit of each (xnk)Kn0. Since n0 was arbitrary then xn=1Kn.

This idea is similar to the Nested Interval Property, except it works with generic sets.