A topological space is a pair (X,T), but henceforth we may omit mentioning T and simply say X is a topological space. Of course, T, a topology on X, is still there.
For a point p∈X we say that U is an open set around p if p∈U. This is just to help write more intuitive sentences.
Saying A is open is equivalent to saying A∈T. So we might simply use open sets to refer to the (sub)sets in the topology T. It is important to note that the concept of “open sets” is therefore dependent on the choice of topology T on X.
1 - Topological Spaces
Definition (Topological Space): A set X and a collection of subsets of X, (called open sets) T is a topological space if:
∅,X∈T
if Aα∈T is an arbitrary collection of open sets, for each α∈I (where I is any index set), ⋃α∈IAα∈T. That is, arbitrary union of open sets, is open.
Similarly, for a finite collection of open sets Ai∈T, the intersection ⋂i=1nAi∈T. That is, finite intersection of open sets are open.
Definition (Neighborhood): Given a topological space (X,T), and a point p∈X, then V is a neighborhood around p if there is an open set U around p that is contained in V. More formally, V is a neighborhood if p∈U⊂V⊂X, where U∈T. The set of all neighborhoods of p is denoted as N(p).
Definition (Metric Space): A set X with a distance function d:X×X→R+∪{0} is a metric space if:
d(x,y)=0⟺x=y (only identical points have zero distance).
d(x,y)=d(y,x) (symmetry of distance).
d(x,z)+d(z,y)≥d(x,y) (triangle inequality).
2 - Limit Points, Closed Sets, and Closure
Definition (Limit Point): Let (X,T) be a topological space and S⊂X. Then a point p∈X is a limit point of S if for all neighborhoods V around p, V has a non empty intersection with S, and contains points other than p. That is, for all V∈N(p), (V−{p})∩S=∅. The set of all limit points of S is denoted as LP(S).
Definition (Closed Set): Let (X,T) be a topological space and S⊂X. Then S is closed if it contains all its limit points. That is, LP(S)⊂S.
Closed and Open are NOT Opposites
This is something important to keep in mind. If a set is not closed, that doesn’t mean its open. And if a set is not open, it doesn’t mean that it is closed. It’s a weird case of English names not playing well with their corresponding math definitions.
For example, if (X,T) is a topological space, then X is open by definition (X∈T), However, X also contains all its limit points (X contains all points!) Hence X is also closed. It is both closed and open, or “clopen” (this is an actual term).
Define the standard topology on R where the open sets are unions of open intervals (a,b). Consider the set S=(0,1]. Clearly this set is not open, as no union of open intervals or finite intersection of open intervals can result in S. However, it is also not closed, as 0 is a limit point of S, but 0∈S. So this is an example of a set that is neither closed nor open in the standard topology on R.
Definition (Closure of a Set): Let X be a topological space and S⊂X. Then the closure of S written Sˉ is the union of S with all the limit points of S. That is, Sˉ=S∪LP(S).
Theorem: The closure of a set is closed. Let X be a topological space, and S⊂X. Then Sˉ=S∪LP(S) is closed.
Proof: Suppose S is not closed. Then there exists a point q∈LP(S) with q∈/S. In particular, q∈/LP(S), so there is an open set U around q such that (U−{q})∩S=∅. Since q∈/S, this says U∩S=∅.
Because q is a limit point of S, there is some p∈(U−{q})∩S. As U∩S=∅, we must have p∈LP(S). But U is also an open set around p, so it contains a point of S other than p, contradicting U∩S=∅. Thus S is closed. □
Theorem: The closure is the smallest containing closed set. Let X be a topological space and S⊂X. Then if E is a closed set such that S⊂E, then Sˉ⊂E. That is, any closed set that contains S must also contain its closure.
Proof: Since E is closed, E contains all its limit points. In particular, E contains all the limit points of S because E contains S. Therefore E contains Sˉ. □
Alternate Definition for Closed Sets
Let X be a topological space. Then E⊂X is closed if and only if X−E is open.
Proof: Well suppose E is closed, then any limit point of E is in E. Therefore, no point p∈X−E is a limit point of E. Hence, for each p∈X−E there exists a neighborhood Vp around p such that Vp∩E=∅. Equivalently, there exists an open set Up around each p such that Up∩E=∅. Hence ⋃p∈X−EUp=X−E. Hence X−E is open (it is a union of open sets).
Now suppose X−E is open, and (for the sake of contradiction) suppose q∗∈X−E is a limit point of E. Since X−E itself is an open set around q∗, it must contain a point e∈E other than q∗. But then e∈E∩(X−E), which is a contradiction. Hence no point outside E is a limit point of E, so E contains all its limit points and is closed. □
Note: whenever we have a definition of something, A := B iff (“def 1”), and then we also have A := B iff (“some condition”) we can alternatively take that condition itself as a definition, and recover the older definition as a theorem instead. That is to say, if we define closed sets as ones that contain all their limit points, we can show the theorem: E is closed iff its complement in X is open. Dually, we can define E is closed iff its complement in X is open, and recover E is closed iff it contains all its limit points as a theorem.
3 - Denseness, Subspace Topology, Covers, and Compactness
Definition (Denseness): If X is a topological space, then A⊂X is dense if Aˉ=X. Denseness of A is a nice property, because any point x∈X is either in A, or is a limit point of A.
Definition (Subspace Topology): Let (X,T) be a topological space and Y⊂X. Then inheriting the topology TY={U∩Y:U∈T}, (basically taking the intersection of all open sets with Y) defines a topological space (Y,TY). (It is left to the reader to verify that (Y,TY) satisfies the axioms of topology.)
Definition (Covers and Subcovers): Let X be a topological space, and S⊂X, then an open cover of S is a collection of open sets C={Uα:α∈I} such that S⊂⋃α∈IUα. If C′⊂C is also a cover of S, then C′ is a subcover of S. Note: subcover simply means picking some (maybe all) elements of the cover.
Definition (Compactness): Let X be a topological space and S⊂X. Then S is compact if for every open cover C(S) there exists a subcover C′(S)⊂C(S) such that the cardinality of C′ is finite.
4 - Bases, Sub-bases, and Generating Topologies
Definition (Basis for a Topology): Let (X,T) be a topological space. Then, a basis of this topology B⊂T is such that for every point x∈X and open set U around x, there exists a “basic open set” B∈B such that x∈B⊂U. Essentially, the basis is a subcollection of open sets, such that any open set is the union of some basis elements. The elements of the basis are called basic open sets.
(B1) Since X is itself an open set, for every x∈X, there exists a basic open set B around x.
(B2) For any two basic open sets B1,B2 if x∈B1∩B2 there exists B3⊂B1∩B2 around x. (this is because the (finite) intersections of open sets are open).
In fact, if there is no topology on X, but we have a collection of subsets B for which (B1) and (B2) hold, then we can generate a topology from arbitrary unions of elements of B. By induction on (B2) the generated topology is stable under finite intersection, and by (B1) X is part of the generated topology. And by the process of generation, the generated topology is also stable under arbitrary unions.
Finer and Coarser Topologies
Now, suppose T1 and T2 are both topologies on X, such that T1⊆T2. Then we say that T2 is finer than T1 and that T1 is coarser than T2.
The intuition is to take two copies of X, then grind it down, one finer than the other. Now, you identify clumps of both, to be the basis open sets. Indeed, I could make the coarser stone, with clumps of finer stones. So the arbitrary unions of coarser stones, can also be made by clumps of finer stone, however, having finer stone lets me make more intricate open sets, so naturally, the topology of the finer stone contains whatever the topology of the coarser stone, but not necessarily the other way around!
Proposition: If B1 is a basis for T1 and B2 is a basis for T2, such that T2 is finer than T1. Then, ∀x∈X and each B1∈B1 containing x, there is B2∈B2 such that x∈B2⊆B1! (this is actually an iff).
Proof: Suppose T2 is finer than T1. Let B1 be any basic open set in T1 and x any point in B1. Since T1⊆T2, B1 is open in T2. Because B2 is a basis for T2, there is some B2∈B2 such that x∈B2⊆B1.
Now, the other direction: let U∈T1, then, by the basis property, U=⋃α∈ΛBα′ where Bα′∈B1. Now for every xα∈Bα′, ∃B2xα∈B2 such that xα∈B2xα⊆Bα′. Therefore, ⋃α∈Λ⋃xα∈Bα′B2xα=U∈T2! i.e. T1⊆T2. □
Sub-basis
Let X be a set such that ∀x∈X, ∃S∈S for which x∈S. Such a collection of subsets of X, S is called the sub-basis for a topology.
Lemma: Let Bi,i=1 to n∈B be any finite collection of basic open sets. Then, for every x∈⋂i=1nBi, ∃Bx∗∈B, x∈Bx∗⊆⋂i=1nBi.
Proof: Indeed, the base case for an inductive argument is in the definition of a basic open set itself. ∀B1,B2∈B, ∀x∈B1∩B2, ∃B3 for which x∈B3⊆B1∩B2.
Now suppose the inductive hypothesis holds for some n≥2.
Now, let x∈⋂i=1n+1Bi. Indeed, x∈⋂i=1nBi, so ∃Bxn∈B such that x∈Bxn⊆⋂i=1nBi. But x∈Bn+1 too, hence, x∈Bxn∩Bn+1⊆⋂i=1n+1Bi.
Again due to the definition of basis of topology, ∃Bxn+1⊆Bxn∩Bn+1 such that x∈Bxn+1. Hence, x∈Bxn+1⊆⋂i=1n+1Bi. □
Theorem: Let X be a set, and B={Bα:α∈I} a collection of subsets of X satisfying the “basis” properties. Define T={⋃α∈ΛBα:Λ⊆I}, that is, T consists of unions over all subsets of the index set of B. Then T forms a topology on X.
Proof:
Closed under finite intersection: Let Ui,i=1 to n be a finite collection of elements of T, and hence each Ui=⋃αi∈ΛiBαi for some Λi⊆I.
j=1⋂nUj=j=1⋂nαj∈Λj⋃Bαj
Repeatedly applying set theory laws (which afaik its okay on uncountable unions too, like I know you can’t give an induction argument but still)
Indeed, from the previous lemma, ∀x∈Bα1∩Bα2⋯Bαn, ∃B(α1,α2⋯αn)x∈B, where x∈B(α1,α2⋯αn)x⊆(Bα1∩Bα2⋯Bαn). Hence
x∈⋂i=1nBαi⋃B(α1,α2⋯αn)x=j=1⋂nBαj
If the above argument looks sus to you, just realize the fact that each B(α1,α2,…αn)x for a given x in ⋂j=1nBαj, contains x, and also that each B(α1,α2,…αn)x is a subset of ⋂j=1nBαj.
And since its all unions, ⋂j=1nUj∈T, so T is closed under finite intersection.
Closed under arbitrary union: Now, let Uβ,β∈Δ be an arbitrary subcollection of T. Uβ=⋃αβ∈ΛβBαβ. Hence ⋃β∈ΔUβ=⋃β∈Δ⋃αβ∈ΛβBαβ∈T. So T is closed under arbitrary union.
Contains X and ∅: Finally since ⋃B∈BB=X, X∈T and similarly have ∅∈T. □
Sub-basis Generates a Basis
Let S be a collection of subsets of X that covers X (sub-basis), then B={⋂j=1nSj:n∈N,Sj∈S} the set of all finite subcollection intersections, forms a basis for a topology on X.
Proof:∀S∈S, S∈B, hence, ∀x∈X, ∃Sx∈B such that x∈Sx. Now, let B1,B2∈B. B1=⋂j=1mSj1, B2=⋂j=1nSj2. Let x∈B1∩B2, ∃Sx∈S such that x∈Sx. Hence x∈Sx∩B1∩B2 (this is a finite intersection of elements of S) hence indeed ∃Bx∗=Sx∩B1∩B2 for which x∈Bx∗⊆B1∩B2. □
5 - Continuous Maps
Definition (Continuous Maps on Topological Spaces): Let (X,ΘX) and (Y,ΘY) be topological spaces. A map f:X→Y is a homomorphism (continuous) if for any open subset V∈ΘY of Y, the pre image of V, f−1(V) is open in X, that is f−1(V)∈ΘX. (Note that since ∅ is always open in any topology, there is no need for our map to be surjective, if V is not hit by f at all, then its pre-image is empty and so we are okay.)
If f:X→Y is bijective, and both f,f−1 are continuous, then f is a topological isomorphism (called “Homeomorphism”).
Given three topological spaces X,Y,Z, if f:X→Y,g:Y→Z are both continuous, then g∘f:X→Z is continuous. For all VZ∈ΘZ, g−1(VZ)∈ΘY. Hence f−1(g−1(ΘZ))∈ΘX.
If f:X→Y is a continuous map, let S⊂X. If we put the subspace topology (inheriting from ΘX) on S, then the restriction f∣S:S→Y is continuous. Let V be any open set of Y. f−1∣S(V)=f−1(V)∩S. Since f−1(V) is open in X, by the definition of the subspace topology, f−1(V)∩S is open in S.
Continuity via Basis
Proposition: Let f:X→Y be a map between topological spaces X,Y, with BX,BY as the respective bases. f is continuous if and only if ∀bY∈BY, f−1(bY) is open in X. (not necessarily basic open in X).
Proof: The forward direction is trivial. If f is continuous, bY is an open set and f−1(bY) must be open.
So now, suppose that ∀bY∈BY, f−1(bY) is open in X. Let U be any open set in Y. U=⋃α∈ΛbYα, hence, f−1(U)=⋃α∈Λf−1(bYα) which is a union of open sets in X, and hence is open. □
Continuity via Sub-basis
Proposition: Let f:X→Y be a map between topological spaces X,Y. And let BY be a basis for the topology on Y, and SY a sub-basis that generates BY. f is continuous if and only if for each sY∈SY, f−1(sY) is open in X.
Proof: The forward direction is yet again trivial, each sY∈SY is indeed an open set in Y, so if f is continuous, f−1(sY) must be open in X. Now, suppose that for every sY∈SY, f−1(sY) is open in X. Let bY∈BY be any basic open set in Y. bY=⋂i=1nsYi. Hence f−1(bY)=⋂i=1nf−1(sYi) which is a finite intersection of open sets in X, and by the previous proposition, f is continuous. □
Some Basic Ideas
f:X→Y, if f is continuous, and we put a coarser topology on Y, it will still be continuous. If f is an open map defined: for all open sets U in X, f(U) is open in Y, if we put a coarser topology on X, f is still an open map.
6 - Disjoint Union and Quotient Topology
Disjoint Union
Let Λ be an index set, and {Aα:α∈Λ} a collection of sets. The disjoint union is defined as
α∈Λ∐Aα=α∈Λ⋃Aα×{α}
Indeed, if A=∐α∈ΛAα, we can recover any Aα∗ as the partition of A with part Aα∗={x:(x,α∗)∈A}. Cool!
Indeed, the canonical injections ια:Aα→A, x↦(x,α) are very helpful.
Quotient Topology
Let X be a topological space and ∼ an equivalence relation on X. Then there is a canonical topology (quotient), one where the map q:X→X/∼, the quotient projection map x↦[x] is continuous. Indeed q is surjective, and U is open in X/∼ if and only if q−1(U)={x∈X:[x]∈U} is open in X.
For any set X and any equivalence relation ∼, and the quotient set X/∼, we have a natural function, that sends each x∈X to its equivalence class [x]∈X/∼.
In particular, for some index set Λ, let Xα,α∈Λ denote the equivalence classes that partition X under ∼.
i.e. ⋃α∈ΛXα=X and Xα∩Xα′=∅ whenever α=α′. The quotient set is the set of the classes themselves, X/∼={Xα:α∈Λ}, and the natural projection sends x to the unique class [x] containing it.
One may choose a representative xα∗∈Xα for each class, but the representatives are not the elements of the quotient; the equivalence classes are.
If X is a topological space, what is the finest topology we can put on X/∼ for which q is continuous? Okay, put some topology T on X/∼ such that q is continuous. Then for any U∈T, it is clear that q−1(U) must be open in X. This means that any such T is a subcollection of M={U⊂X/∼:q−1(U)is open in X}. Now we only have to show that M is a topology on X/∼. It is clear that ∅,X/∼∈M. Now consider an arbitrary union of elements in M, V=⋃a∈AUa. Then, q−1(V)=q−1(⋃a∈AUa)=⋃a∈Aq−1(Ua). But each q−1(Ua) is open in X, so their union is also open in X. Thus q−1(V) is open in X, and hence V∈M; therefore M is closed under arbitrary unions. A very similar argument shows that M is closed under finite intersections. □
7 - Convergence and the Compact Convergence Topology
On Convergence
Consider a set E as the domain of some set of functions, targeted towards a metric space (Y,d). The sequence of functions f1,f2,… converges to f pointwise, if for every ϵ>0 and x∈E, there exists N(x,ϵ)∈N such that for n>N(x,ϵ), d(fn(x),f(x))<ϵ. The thing about pointwise convergence on E is that, the tail of the sequence that is epsilon close to f at an input x depends not only on epsilon but x as well.
On the other hand, f1,f2,… uniformly converges to f if for any ϵ>0, there exists N(ϵ) such that no matter what choice of x∈E, whenever n>N(ϵ), d(fn(x),f(x))<ϵ.
Definition (Compact Convergence): Let (X,T) be a topological space, (Y,d) a metric space, and XY the set of all functions from X to Y. A sequence of functions f1,f2,… in XY converges compactly to f in XY if for every compact subset K of X, the restriction of each fn to K uniformly converges to the restriction of f to K. That is, for every compact K⊂X and every ϵ>0, there is N(K,ϵ)∈N such that whenever n>N(K,ϵ), for all x∈K, d(fn(x),f(x))<ϵ.
Since the inequality holds for all x∈K, we can say that supx∈Kd(fn(x),f(x))<ϵ for all n>N(K,ϵ).
Stating the definition compactly (pun intended), for all compact K⊂X, limn→∞supx∈Kd(fn(x),f(x))=0.
In some sense, we want to put a topology on XY such that if fn⟶f (that is the sequence fn converges to f, both in XY as a topological space) if and only if fn compactly converges to f.
Take any compact set C⊂X, any ϵ>0 and f∈XY. Define the open ball / basis element given by:
BC(f,ϵ)={g∈XY:x∈Csupd(f(x),g(x))<ϵ}
Then, using κX to denote all nonempty compact subsets of X,
B={BC(f,ϵ):C∈κX,ϵ>0,f∈XY}.
We now have to verify that B is a basis, by (B1) and (B2). So (B1) basically states (in this context) that for each f∈XY there exists B∈B such that f∈B. Well, pick any compact C and ϵ>0. Clearly BC(f,ϵ)∈B, and f∈BC(f,ϵ) as d(f(x),f(x))=0<ϵ.
Lemma: If g∈BC(f,ϵ) and δc=ϵ−supx∈Cd(f(x),g(x)) then BC(g,δc)⊂BC(f,ϵ).
Proof: Let h∈BC(g,δc), then supx∈Cd(h(x),g(x))<ϵ−supx∈Cd(g(x),f(x)). Rearrange and use triangle inequality to get supx∈Cd(h(x),f(x))<ϵ. □
Let h∈BC(f,ϵ)∩BD(t,υ). As defined in the lemma, BC(h,δC)⊂BC(f,ϵ) and BD(h,δD)⊂BD(t,υ). It follows that BC∪D(h,min(δC,δD))⊂BC(f,ϵ)∩BD(t,υ) and contains h. (C,D are compact so C∪D is compact). Finally showing (B2).
Definition (Convergence of Sequences in Topological Spaces): A sequence xn converges to x (written xn⟶x) in a topological space X if for every neighborhood V around x, there exists N(V)∈N such that for all n>N(V), xn∈V.
Equivalently xn⟶x if and only if for each basis element B around x there exists N(B)∈N such that for all n>N(B), xn∈B.
Proof: If V is a neighborhood of x, then there is an open set U where x∈U⊂V. But U is the union of some basis elements, one of them has to contain x, call it B∗. So it’s sufficient to show that there is a tail of the sequence contained in B∗. But all basis elements B around x are themselves neighborhoods around x. So it is necessary to show that there is a tail of the sequence contained in any such B. □
Definition (Compact Convergence Topology): Let (X,T) be a topological space and (Y,d) be a metric space. The compact convergence topology on functions from X to Y, XY is the one generated by the following basis:
B={BC(f,ϵ):C∈κX,ϵ>0,f∈XY}.
Where
BC(f,ϵ)={g∈XY:x∈Csupd(f(x),g(x))<ϵ}
In this topology on XY, fn⟶f if and only if fn converges compactly to f.
Indeed, if fn→f, then for every compact C⊂X and every ϵ>0, the basic neighborhood BC(f,ϵ) contains all sufficiently large fn. Thus supx∈Cd(fn(x),f(x))<ϵ eventually.
Conversely, suppose fn converges compactly to f, and let BC(g,δ) be any basic neighborhood of f. Set r=supx∈Cd(f(x),g(x))<δ. Compact convergence gives N such that, for n>N, supx∈Cd(fn(x),f(x))<δ−r. The triangle inequality then gives supx∈Cd(fn(x),g(x))<δ, so fn∈BC(g,δ) eventually.
8 - Injectivity and Surjectivity
Two Views on Injectivity of Functions
1) Assuming A is nonempty, f:A→B is injective if and only if ∃g:B→A such that g∘f=idA (f has a left inverse). (Without the nonempty assumption, the unique map ∅→B is injective, but it has no left inverse when B is nonempty.)
Proof: Suppose g is the left inverse of f. Let a=a′∈A. Then, g(f(a))=g(f(a′)) (g(f(x))=x∀x∈A). This means that f(a)=f(a′); if they were equal, say f(a)=f(a′)=t, both g(f(a)) and g(f(a′)) would equal g(t), a contradiction.
Now suppose f is injective, pick a particular a∗∈A (any one will do). Construct g:B→A, b↦f−1({b}) if b∈f(A), a∗ if b∈/f(A). g is well defined as f is injective so f−1({b}) is always a singleton. Indeed g∘f(a)=a∀a∈A. □
2)f:A→B is injective iff ∀ sets Z and all functions α,α′:Z⟶A, f∘α=f∘α′⟹α=α′.
Proof: Choose Z={p} (any singleton) and make da:{p}→A∀a∈A, p↦a. Suppose ∀a,a′∈A, f∘da=f∘da′⟹da=da′. ⟹f(da(p))=f(da′(p))⟹da(p)=da′(p)⟹f(a)=f(a′)⟹a=a′.
Now suppose f is injective, and α,α′:Z→A is any two functions on any set. And suppose f∘α=f∘α′. Since f has a left inverse g, (g∘f)∘α=(g∘f)∘α′. Hence, idA∘α=idA∘α′ hence α=α′. □
Two Views on Surjectivity of Functions
3) Assuming the axiom of choice, f:A→B is surjective iff ∃g:B→A such that f∘g=idB (f has a right inverse).
Proof: Suppose f has a right inverse g. Let b∈B be an element of B. f∘g(b)=b. That is, ∃g(b)∈A : f(g(b))=b. Hence f is surjective.
Now suppose f is surjective, then f(A)=B. Hence ∀b∈B, f−1({b}) is non empty. So we can choose an element g(b)∈f−1({b}) and construct g. □
4)f:A→B is surjective iff ∀ sets Z and all functions α,α′:B→Z, α∘f=α′∘f⟹α=α′.
Proof: If f is surjective, and α∘f=α′∘f, use the right inverse g, so α∘(f∘g)=α′∘(f∘g)⟹α=α′. Now suppose whenever α∘f=α′∘f, α=α′. Choose Z={0,1} and, α:b↦0∀b∈B and α′(b)=0⟺b∈f(A) else 1. Indeed ∀a∈A, α(f(a))=α′(f(a))=0. But this means that α=α′. i.e. ∀b∈B, α(b)=0, α′(b)=0. Therefore B=f(A). □
9 - Homotopy Theory
Let X,Y be topological spaces, and f,g∈Mor(X,Y) (f,g are continuous maps from X to Y).
Then, f is homotopic to g, written f∼Hg if:
There exists a continuous map H:X×[0,1]STD→Y such that H(x,0)=f(x) and H(x,1)=g(x) for every x∈X.
If H:X×[0,1]⟶Y is a continuous map, where H(x,0)=f(x) and H(x,1)=g(x) then we call H the (a) homotopy map between f and g.
Indeed, ∼H is an equivalence relation on Mor(X,Y).
Reflexivity
f∼Hf. Choose H:X×[0,1]→Y as H(x,t)=f(x). Now, let VY be open in Y, then, H−1(VY)=f−1(VY)×[0,1]. But f is continuous. Hence f−1(VY) is open in X, and [0,1] is trivially open in [0,1]. Therefore, by definition of product topology, f−1(VY)×[0,1] is open in X×[0,1]. Indeed, H(x,0)=f(x) and H(x,1)=f(x) too.
We need some lemmas now:
Lemma 1 (Interval Change Map): For p<q, define the interval change map C[p,q]:X×[p,q]⟶X×[0,1] by C[p,q](x,t)=(x,q−pt−p). Then, C[p,q] is a homeomorphism.
Proof:
Bijectivity:(x,q−pt1−p)=(x,q−pt2−p)⟹x=x and t1=t2. For each (x,u)∈X×[0,1], C[p,q](x,(q−p)u+p)=(x,u).
Continuity: It is enough to check a basic open rectangle γ=VX×U, where VX is open in X and U=(⋃α∈Λ(aα,bα))∩[0,1] is open in [0,1].
Inverse Continuity: Similarly, it is enough to check a basic open rectangle γ=V×U in X×[p,q]. Its image under C[p,q] is a basic open rectangle in X×[0,1], since the affine map t↦(t−p)/(q−p) is a homeomorphism. Hence C[p,q]−1 is continuous. □
Lemma 2 (Cut-Paste): Let H,H∗:X×[0,1]⟶Y be continuous maps such that H(x,1)=H∗(x,0)∀x∈X. Then, the cut-paste function at p, written H[0,p]×pH∗[p,1] or simply H×pH∗ is the function
We claim that H×pH∗ is a continuous map from X×[0,1]⟶Y. Firstly, the map H×pH∗ is well defined, as H(C[0,p](x,p))=H∗(C[p,1](x,p))∀x∈X. Then, continuity follows by realizing that X×[0,p] and X×[p,1] are both closed in X×[0,1], (X is clopen in X, and [0,p] and [p,1] are both closed in [0,1], and product of closed sets are closed in the product topology). And then, we simply invoke the Gluing Lemma, which we will state and prove next. □
Gluing Lemma
Let P,Q be topological spaces, and suppose A,B⊆P are either both closed or both open, with A∪B=P. Let f:A→Q,g:B→Q be continuous maps such that whenever x∈A∩B, f(x)=g(x) (the maps agree). Then the glued map f∪g:P→Q, defined by
f∪g(x)={f(x)g(x)x∈Ax∈B
is also continuous.
Proof: First suppose A and B are closed. Let V be closed in Q. Since the domain is P=A∪B,
Now f−1(V) is closed in the subspace A, so f−1(V)=F1∩A for some closed F1⊆P. Similarly, g−1(V)=F2∩B for some closed F2⊆P. Because A and B are closed in P, both preimages are closed in P, and their finite union is closed. Hence f∪g is continuous.
If A and B are open, use the same argument with an open set V⊆Q: the two preimages are open in the open subspaces A and B, hence open in P, and their union is open. □
Lemma 3 (Interval Reversal): Define γ:X×[p,q]→X×[p,q] to be the interval reversal map γ(x,t)=(x,(p+q)−t). Then γ is continuous and bijective (homeomorphism even).
Proof: Proof is very similar to Lemma 1. So we won’t do it here. □
Transitivity
Let f,g,h:X→Y be continuous maps. f∼Hg, g∼H2h. Then, there exists a homotopy H∗ between f and h.
Indeed, H∗ can be chosen to be the cut paste map at 21, H1×21H2 from Lemma 2, which also shows continuity of this map.
Indeed H1×21H2(x,0)=f(x), H1×21H2(x,21)=g(x) and H1×21H2(x,1)=h(x), for every x∈X.
Symmetry
Let f,g:X→Y be continuous functions. Suppose f∼Hg then, there exists a homotopy H′ such that g∼H′f.
Indeed by Lemma 3, the interval reversal function γ[0,1]:X×[0,1]→X×[0,1] given by γ(x,t)=(x,(1−t)) is continuous. Indeed H′=H∘γ[0,1] is a continuous map X×[0,1]→Y. H′(x,0)=H(x,1)=g(x) and H′(x,1)=H(x,0)=f(x).
Cool! So indeed the homotopy relation is an equivalence on Mor(X,Y), so we have equivalence classes [f].
Composing Equivalence Classes of Maps under Homotopy
We need some more lemmas first.
Lemma 4: Let A,B,C be topological spaces, g1:A→B, g2:A→C. Now construct g:A→B×C, g(a)=(g1(a),g2(a)). (There is a product topology on B×C). g is continuous if and only if g1 and g2 are both continuous.
Proof: Let UB×UC be open in B×C, g−1(UB×UC)={a∈A:(g1(a),g2(a))∈UB×UC}. Indeed, g−1(UB×UC)={a∈A:g1(a)∈UB and g2(a)∈UC}. Therefore we get: g−1(UB×UC)=g1−1(UB)∩g2−1(UC). Indeed, the above equation holds for any UB open in B and any UC open in C.
Choose UB=B. Then ∀ open sets UC in C, g−1(B×UC)=g1−1(B)∩g2−1(UC). i.e. g−1(B×UC)=A∩g2−1(UC)=g2−1(UC) (pause and justify). Therefore it is necessary that g2 is continuous for g to be continuous.
Now choose UC=C then ∀ open UB in B, g−1(UB×C)=g1−1(UB)∩g2−1(C)=g1−1(UB)∩A=g1−1(UB). Therefore it is also necessary that g1 is continuous for g to be continuous.
If g1 and g2 are both continuous, then the preimage of every basic open rectangle is open: g−1(UB×UC)=g1−1(UB)∩g2−1(UC). Since such rectangles form a basis for the product topology, g is continuous. □
Lemma 5 (Id Projection Extension): Let f:A×B→C be a continuous map. The projection map ΠB:A×B→B, ΠB(a,b)=b is also continuous. The map f×ΠB:A×B→C×B, (a,b)↦(f(a,b),ΠB(a,b)) is continuous. (When A,B,C are topological spaces, and product topology on A×B and C×B.)
Proof: Follows trivially from Lemma 4. □
Theorem (Composing Equivalence Classes of Maps under Homotopy): Let X,Y,Z be topological spaces, put the quotient of homotopy relation on continuous maps between X and Y, and Y and Z. Now let [f]∈Mor(X,Y)/∼H and [g]∈Mor(Y,Z)/∼H. Then for any f′∈[f]∼H and g′∈[g]∼H, g′∘f′∈[g∘f]∼H.
Proof: Let H1:X×[0,1]→Y be a homotopy from f to f′. i.e. H1 is continuous, H1(x,0)=f(x) and H1(x,1)=f′(x)∀x∈X. Similarly let H2:Y×[0,1]→Z be a homotopy from g to g′. H2 is continuous, H2(y,0)=g(y), H2(y,1)=g′(y)∀y∈Y. Now consider the map H2∘(H1×Π[0,1]):X×[0,1]→Z. This map is continuous, (H1×Π[0,1] is continuous by Lemma 5).
Now, H2∘(H1×Π[0,1])(x,0)=H2(H1(x,0),0)=H2(f(x),0)=g(f(x)), and similarly, H2∘(H1×Π[0,1])(x,1)=g′(f′(x)). □
10 - Homotopy Equivalence of Topological Spaces
Definition: Let X,Y be topological spaces, then X is homotopy equivalent to Y, written X≃HY, if ∃ continuous maps f:X→Y and g:Y→X such that g∘f∼HidX, f∘g∼HidY.
Homotopy Equivalence is an Equivalence Relation
Recall that two topological spaces X,Y are homotopy equivalent if ∃f:X→Y and g:Y→X (both continuous) such that g∘f∼HidX, f∘g∼HidY. In such cases, we write X≃HY. We claim that this relation on topological spaces is indeed an equivalence.
Reflexive:X≃HX. Indeed, idX:X→X is a continuous map, not only homotopic but literally equal to idX.
Symmetry:X≃HY⟺Y≃HX (obvious from the definition itself).
Transitivity: Suppose X≃HY and Y≃HZ. We will repeatedly use the theorem on composition of homotopy equivalence classes on maps, which states that if g,f are continuous maps that are composable, and g∈[g]∼H, and f∈[f]∼H, then g∘f∈[g∘f]∼H.
(diagram: X⟶fY⟶gZ and Z⟶hY⟶kX)
h∘g∈[idY]∼H, hence (h∘g)∘f∈[idY∘f]∼H=[f]∼H. Therefore, k∘(h∘g)∘f∈[k∘f]∼H. But k∘f∈[idX]∼H, and by properties of equivalence classes, [k∘f]∼H=[idX]∼H. Finally, k∘h∘g∘f∈[idX]∼H.