# Lecture 04 - Topological Spaces: Construction And Purpose (schuller's Geometric Anatomy Of Theoretical Physics)

• Uploaded by: Simon Rea
• January 2020
• PDF TXT

This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form.

### Overview

Download & View Lecture 04 - Topological Spaces: Construction And Purpose (schuller's Geometric Anatomy Of Theoretical Physics) as PDF for free.

### More details

• Words: 2,711
• Pages: 7
topological spaces: construction and purpose

4

topological spaces: construction and purpose

4.1 Topological spaces We will now discuss topological spaces based on our previous development of set theory. As we will see, a topology on a set provides the weakest structure in order to define the two very important notions of convergence of sequences to points in a set, and of continuity of maps between two sets. The definition of topology on a set is, at first sight, rather abstract. But on the upside it is also extremely simple. This definition is the result of a historical development, it is the simplest definition of topology that mathematician found to be useful. Definition. Let M be a set. A topology on M is a set O ⊆ P(M) such that: i) ∅ ∈ O and M ∈ O; T ii) {U, V} ⊆ O ⇒ {U, V} ∈ O; S iii) C ⊆ O ⇒ C ∈ O. The pair (M, O) is called a topological space. Remark 4.1. Unless |M| = 1, there are (usually many) different topologies O that one can choose on the set M. |M|

Number of topologies

1 2 3 4 5 6 7

1 4 29 355 6,942 209,527 9,535,241

Example 4.2. Let M = {a, b, c}. Then O = {∅, {a}, {b}, {a, b}, {a, b, c}} is a topology on M since: i) ∅ ∈ O and M ∈ O; T T ii) Clearly, for any S ∈ O, {∅, S} = ∅ ∈ O and {S, M} = S ∈ O. Moreover, {a} ∩ {b} = ∅ ∈ O, {a} ∩ {a, b} = {a} ∈ O, and {b} ∩ {a, b} = {b} ∈ O; S iii) Let C ⊆ O. If M ∈ C, then C = M ∈ O. If {a, b} ∈ C (or {a}, {b} ∈ C) but M ∈ / C, S then C = {a, b} ∈ O. If either {a} ∈ C or {b} ∈ C, but {a, b} ∈ / C and M ∈ / C, S S then C = {a} ∈ O or C = {b} ∈ O, respectively. Finally, if none of the above S hold, then C = ∅ ∈ O.

28

topological spaces: construction and purpose Example 4.3. Let M be a set. Then O = {∅, M} is a topology on M. Indeed, we have: i) ∅ ∈ O and M ∈ O; T T T ii) {∅, ∅} = ∅ ∈ O, {∅, M} = ∅ ∈ O, and {M, M} = M ∈ O; S S iii) If M ∈ C, then C = M ∈ O, otherwise C = ∅ ∈ O. This is called the chaotic topology and can be defined on any set. Example 4.4. Let M be a set. Then O = P(M) is a topology on M. Indeed, we have: i) ∅ ∈ P(M) and M ∈ P(M); T T ii) If U, V ∈ P(M), then {U, V} ⊆ M and hence {U, V} ∈ P(M); S S iii) If C ⊆ P(M), then C ⊆ M, and hence C ∈ P(M). This is called the discrete topology and can be defined on any set. We now give some common terminology regarding topologies. Definition. Let O1 and O2 be two topologies on a set M. If O1 ⊂ O2 , then we say that O1 is a coarser (or weaker) topology than O2 . Equivalently, we say that O2 is a finer (or stronger) topology than O1 . Clearly, the chaotic topology is the coarsest topology on any given set, while the discrete topology is the finest. Definition. Let (M, O) be a topological space. A subset S of M is said to be open (with respect to O) if S ∈ O and closed (with respect to O) if M \ S ∈ O. Notice that the notions of open and closed sets, as defined, are not mutually exclusive. A set could be both or neither, or one and not the other. Example 4.5. Let (M, O) be a topological space. Then ∅ is open since ∅ ∈ O. However, ∅ is also closed since M \ ∅ = M ∈ O. Similarly for M. Example 4.6. Let M = {a, b, c} and let O = {∅, {a}, {a, b}, {a, b, c}}. Then {a} is open but not closed, {b, c} is closed but not open, and {b} is neither open nor closed. We will now define what is called the standard topology on Rd , where: Rd := R | ×R× {z. . . × R} . d times

We will need the following auxiliary definition. Definition. For any x ∈ Rd and any r ∈ R+ := {s ∈ R | s > 0}, we define the open ball of radius r around the point x: qP  d d 2 Br (x) := y ∈ R | i=1 (yi − xi ) < r , where x := (x1 , x2 , . . . , xd ) and y := (y1 , y2 , . . . , yd ), with xi , yi ∈ R.

29

topological spaces: construction and purpose qP d 2 Remark 4.7. The quantity i=1 (yi − xi ) is usually denoted by ky − xk2 , where k · k2 d is the 2-norm on R . However, the definition of a norm on a set requires the set to be equipped with a vector space structure (which we haven’t defined yet), while our construction does not. Moreover, our construction can be proven to be independent of the particular norm used to define it, i.e. any other norm will induce the same topological structure. Definition. The standard topology on Rd , denoted Ostd , is defined by: U ∈ Ostd :⇔ ∀ p ∈ U : ∃ r ∈ R+ : Br (p) ⊆ U. Of course, simply calling something a topology, does not automatically make it into a topology. We have to prove that Ostd as we defined it, does constitute a topology. Proposition 4.8. The pair (Rd , Ostd ) is a topological space. Proof.

i) First, we need to check whether ∅ ∈ Ostd , i.e. whether: ∀ p ∈ ∅ : ∃ r ∈ R+ : Br (p) ⊆ ∅ is true. This proposition is of the form ∀ p ∈ ∅ : Q(p), which was defined as being equivalent to: ∀ p : p ∈ ∅ ⇒ Q(p). However, since p ∈ ∅ is false, the implication is true independent of p. Hence the initial proposition is true and thus ∅ ∈ Ostd . Second, by definition, we have Br (x) ⊆ Rd independent of x and r, hence: ∀ p ∈ Rd : ∃ r ∈ R+ : Br (p) ⊆ Rd is true and thus Rd ∈ Ostd .

ii) Let U, V ∈ Ostd and let p ∈ U ∩ V. Then: p ∈ U ∩ V :⇔ p ∈ U ∧ p ∈ V and hence, since U, V ∈ Ostd , we have: ∃ r1 ∈ R+ : Br1 (p) ⊆ U

∃ r2 ∈ R+ : Br2 (p) ⊆ V.

Br (p) ⊆ Br2 (p) ⊆ V

Let r = min{r1 , r2 }. Then: Br (p) ⊆ Br1 (p) ⊆ U

and hence Br (p) ⊆ U ∩ V. Therefore U ∩ V ∈ Ostd . S iii) Let C ⊆ Ostd and let p ∈ C. Then, p ∈ U for some U ∈ C and, since U ∈ Ostd , we have: [ ∃ r ∈ R+ : Br (p) ⊆ U ⊆ C. Therefore, Ostd is indeed a topology on Rd .

30

topological spaces: construction and purpose 4.2 Construction of new topologies from given ones Proposition 4.9. Let (M, O) be a topological space and let N ⊂ M. Then: O|N := {U ∩ N | U ∈ O} ⊆ P(N) is a topology on N called the induced (subset) topology. Proof.

i) Since ∅ ∈ O and ∅ = ∅ ∩ N, we have ∅ ∈ O|N . Similarly, we have M ∈ O and N = M ∩ N, and thus N ∈ O|N .

ii) Let U, V ∈ O|N . Then, by definition: ∃S ∈ O : U = S∩N

∃ T ∈ O : V = T ∩ N.

We thus have: U ∩ V = (S ∩ N) ∩ (T ∩ N) = (S ∩ T ) ∩ N. Since S, T ∈ O and O is a topology, we have S ∩ T ∈ O and hence U ∩ V ∈ O|N . iii) Let C := {Sα | α ∈ A} ⊆ O|N . By definition, we have: ∀ α ∈ A : ∃ Uα ∈ O : Sα = Uα ∩ N. Then, using the notation: [

Sα :=

[

C=

[

{Sα | α ∈ A}

α∈A

and De Morgan’s law, we have: [ α∈A

Sα =

[

(Uα ∩ N) =

α∈A

Since O is a topology, we have Thus O|N is a topology on N.

S

α∈A Uα

 [

 Uα ∩ N.

α∈A

∈ O and hence

S

C ∈ O|N .

Example 4.10. Consider (R, Ostd ) and let: N = [−1, 1] := {x ∈ R | −1 6 x 6 1}. Then (N, Ostd |N ) is a topological space. The set (0, 1] is clearly not open in (R, Ostd ) since (0, 1] ∈ / Ostd . However, we have: (0, 1] = (0, 2) ∩ [−1, 1] where (0, 2) ∈ Ostd and hence (0, 1] ∈ Ostd |N , i.e. the set (0, 1] is open in (N, Ostd |N ).

31

topological spaces: construction and purpose Definition. Let (A, OA ) and (B, OB ) be topological spaces. Then the set OA×B defined implicitly by: U ∈ OA×B :⇔ ∀ p ∈ U : ∃ (S, T ) ∈ OA × OB : S × T ⊆ U is a topology on A × B called the product topology. Remark 4.11. This definition can easily be extended to n-fold cartesian products: U ∈ OA1 ×...×An :⇔ ∀ p ∈ U : ∃ (S1 , . . . , Sn ) ∈ OA1 × . . . × OAn : S1 × . . . × Sn ⊆ U. Remark 4.12. Using the previous definition, one can check that the standard topology on Rd satisfies: Ostd = OR×R×...×R . | {z } d times

Therefore, a more minimalistic definition of the standard topology on Rd would consist in defining Ostd only for R (i.e. d = 1) and then extending it to Rd by the product topology. 4.3 Convergence Definition. Let M be a set. A sequence (of points) in M is a function q : N → M. Definition. Let (M, O) be a topological space. A sequence q in M is said to converge against a limit point a ∈ M if: ∀ U ∈ O : a ∈ U ⇒ ∃ N ∈ N : ∀ n > N : q(n) ∈ U. Remark 4.13. An open set U of M such that a ∈ U is called an open neighbourhood of a. If we denote this by U(a), then the previous definition of convergence can be rewritten as: ∀ U(a) : ∃ N ∈ N : ∀ n > N : q(n) ∈ U. Example 4.14. Consider the topological space (M, {∅, M}). Then every sequence in M converges to every point in M. Indeed, let q be any sequence and let a ∈ M. Then, q converges against a if: ∀ U ∈ {∅, M} : a ∈ U ⇒ ∃ N ∈ N : ∀ n > N : q(n) ∈ U. This proposition is vacuously true for U = ∅, while for U = M we have q(n) ∈ M independent of n. Therefore, the (arbitrary) sequence q converges to the (arbitrary) point a ∈ M.

32

topological spaces: construction and purpose Example 4.15. Consider the topological space (M, P(M)). Then only definitely constant sequences converge, where a sequence is definitely constant with value c ∈ M if: ∃ N ∈ N : ∀ n > N : q(n) = c. This is immediate from the definition of convergence since in the discrete topology all singleton sets (i.e. one-element sets) are open. Example 4.16. Consider the topological space (Rd , Ostd ). Then, a sequence q : N → Rd converges against a ∈ Rd if: ∀ ε > 0 : ∃ N ∈ N : ∀ n > N : kq(n) − ak2 < ε. 1 Example 4.17. Let M = R and let q = 1 − n+1 . Then, since q is not almost constant, it is not convergent in (R, P(R)), but it is convergent in (R, Ostd ).

4.4 Continuity Definition. Let (M, OM ) and (N, ON ) be topological spaces and let φ : M → N be a map. Then, φ is said to be continuous (with respect to the topologies OM and ON ) if: ∀ S ∈ ON , preimφ (S) ∈ OM , where preimφ (S) := {m ∈ M : φ(m) ∈ S} is the pre-image of S under the map φ. Informally, one says that φ is continuous if the pre-images of open sets are open. Example 4.18. If M is equipped with the discrete topology, or N with the chaotic topology, then any map φ : M → N is continuous. Indeed, let S ∈ ON . If OM = P(M) (and ON is any topology), then we have: preimφ (S) = {m ∈ M : φ(m) ∈ S} ⊆ M ∈ P(M) = OM . If instead ON = {∅, N} (and OM is any topology), then either S = ∅ or S = N and thus, we have: preimφ (∅) = ∅ ∈ OM and preimφ (N) = M ∈ OM . Example 4.19. Let M = {a, b, c} and N = {1, 2, 3}, with respective topologies: OM = {∅, {b}, {a, c}, {a, b, c}}

and

ON = {∅, {2}, {3}, {1, 3}, {2, 3}, {1, 2, 3}},

and let φ : M → N by defined by: φ(a) = 2,

φ(b) = 1,

φ(c) = 2.

Then φ is continuous. Indeed, we have: preimφ (∅) = ∅, preimφ ({1, 3}) = {b},

preimφ ({2}) = {a, c}, preimφ ({2, 3}) = {a, c},

and hence preimφ (S) ∈ OM for all S ∈ ON .

preimφ ({3}) = ∅, preimφ ({1, 2, 3}) = {a, b, c},

33

topological spaces: construction and purpose Example 4.20. Consider (Rd , Ostd ) and (Rs , Ostd ). Then φ : Rd → Rs is continuous with respect to the standard topologies if it satisfies the usual ε-δ definition of continuity: ∀ a ∈ Rd : ∀ ε > 0 : ∃ δ > 0 : ∀ 0 < kx − ak2 < δ : kφ(x) − φ(a)k2 < ε. Definition. Let (M, OM ) and (N, ON ) be topological spaces. A bijection φ : M → N is called a homeomorphism if both φ : M → N and φ−1 : N → M are continuous. Remark 4.21. Homeo(morphism)s are the structure-preserving maps in topology. If there exists a homeomorphism φ between (M, OM ) and (N, ON ): φ

M

N φ−1

then φ provides a one-to-one pairing of the open sets of M with the open sets of N. Definition. If there exists a homeomorphism between two topological spaces (M, OM ) and (N, ON ), we say that the two spaces are homeomorphic or topologically isomorphic and ∼ top (N, ON ). we write (M, OM ) = ∼ top (N, ON ), then M = ∼ set N. Clearly, if (M, OM ) = Remark 4.22. Unlike for sets, there isn’t yet a classification of topological spaces. That is, nobody has been able to determine a set of properties such that if two topological spaces agree on this set of properties, then they are homeomorphic.

34

January 2020 35
January 2020 25
January 2020 31
January 2020 44
January 2020 22
January 2020 34

January 2020 35
January 2020 36
January 2020 34
November 2019 38
January 2020 32
January 2020 42
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}