Exercises:Mond - Topology - 1
Contents
[hide]Section A
Section B
Exercises 6, 7 and 8 make use of the compact-to-Hausdorff theorem
Question 6
Part I
Find a surjective continuous mapping from [−1,1]⊂R to the unit circle, S1 such that it is injective except for that it sends −1 and 1 to the same point in S1. Definitions may be explicit or use a picture
Solution
We shall define f:[−1,1]→S1 to be such a map:- f:t↦(−sin(π(t+1))−cos(π(t+1))), this starts at the point (1,0) and goes anticlockwise around the circle of unit radius once.
- Note: I am not asked to show this is continuous, merely exhibit it.
- Note: The reason for the odd choice of sin for the x coordinate, and the minus signs is because my first choice was f:t↦(cos(π(t+1))sin(π(t+1))), however that didn't match up with the picture. The picture goes clockwise from the south pole, this would go anticlockwise from the east pole.
Part 2
Define an equivalence relation on [−1,1] by declaring −1∼1, use part 1 above and applying the topological version of passing to the quotient to find a continuous bijection: (:[−1,1]∼→S1)
Solution
We wish to apply passing to the quotient. Notice:
- we get π:[−1,1]→[−1,1]∼, π:x↦[x] automatically and it is continuous.
- we've already got a map, f, of the form (:[−1,1]→S1)
In order to use the theorem we must show:
- "f is constant on the fibres of π", that is:
- ∀x,y∈[−1,1][π(x)=π(y)⟹f(x)=f(y)]
- Proof:
- Let x,y∈[−1,1] be given
- Suppose π(x)≠π(y), by the nature of implies we do not care about the RHS of the implication, true or false, the implication holds, so we're done
- Suppose π(x)=π(y), we must show that this means f(x)=f(y)
- It is easy to see that if x∈(−1,1)⊂R then π(x)=π(y)⟹y=x
- By the nature of f being a function (only associating an element of the domain with one thing in the codomain) and having y=x we must have: f(x)=f(y)
- Suppose x∈{−1,1}, it is easy to see that then π(x)=π(y)⟹y∈{−1,1}
- But f(−1)=f(1) so, whichever the case, f(x)=f(y)
- It is easy to see that if x∈(−1,1)⊂R then π(x)=π(y)⟹y=x
- Let x,y∈[−1,1] be given
We may now apply the theorem to yield:
- a unique continuous map, ¯f:[−1,1]/∼→S1 such that f=¯f∘π
The question requires us to show this is a bijection, we must show that ˉf is both injective and surjective:
- Surjective: ∀y∈S1∃x∈[−1,1]∼[ˉf(x)=y]
- There are two ways to do this:
- Note that (from passing to the quotient) that if f is surjective, then the resulting ˉf is surjective.
- Or the long way of showing the definition of ˉf being a surjection, ∀y∈S1∃x∈[−1,1]∼[ˉf(x)=y]
- Let y∈S1 be given.
- Note that f is surjective, and f=ˉf∘π, thus ∃p∈[−1,1] such that p=f−1(y)=(ˉf∘π)−1(y)=π−1(ˉf−1(y)), thus π(p)=ˉf−1(y)
- Choose x∈[−1,1]/∼ to be π(p) where p∈[−1,1] exists by surjectivity of f and is such that f(p)=y
- Now ˉf(π(p))=f(p) (by definition of ˉf) and f(p)=y, as required.
- Let y∈S1 be given.
- There are two ways to do this:
- Injective:
- Let x,y∈[−1,1]∼ be given. We wish to show that ˉf(x)=ˉf(y)⟹x=y
- Suppose ˉf(x)≠ˉf(y), then we're done, as by the nature of logical implication we do not care about the right hand side.
- Note though, by the definition of ˉf being a function we cannot have x=y in this case! As a function must map each element of the domain to exactly one thing of the codomain. Anyway!
- Suppose ˉf(x)=ˉf(y), we must show that in this case we have x=y.
- By surjectivity of π:[−1,1]→[−1,1]∼ we see ∃a∈[−1,1][π(a)=x] and ∃b∈[−1,1][π(b)=y]
- Notice now we have ˉf(x)=ˉf(π(a)) and that (from the passing to the quotient part of obtaining ˉf) we have f=ˉf∘π, this means:
- ˉf(x)=ˉf(π(a))=f(a), we also have ˉf(y)=ˉf(π(b))=f(b) from the same thoughts, but using y and b instead of x and a.
- In particular: f(a)=f(b)
- Now we have two cases, a∈(−1,1) and a∈{−1,1}, we shall deal with them separately.
- We have f(a)=f(b), suppose a∈(−1,1)
- Recall that our very definition of f required it to be "almost injective", specifically that f|(−1,1):(−1,1)→S1 was injective (and that it was only "not injective" on the endpoints)
- As f is "injective in this range" we see that to have f(a)=f(b) means a=b (by injectiveness of f|(−1,1))
- As a=b we see y=π(b)=π(a)=x and conclude y=x - as required.
- We have f(a)=f(b), and this time a∈{−1,1} instead
- Again by definition of f, we recall f(−1)=f(1) - it maps the endpoints of [−1,1] to the same point in S1.
- To have f(a)=f(b) clearly means that b∈{−1,1} (regardless of what value a∈{−1,1} takes)
- But π(a)=[a]={−1,1} and also π(b)=[b]={−1,1}
- So we see y=π(b)={−1,1}=π(a)=x, explicitly: x=y, as required
- We have f(a)=f(b), suppose a∈(−1,1)
- We have shown that in either case x=y
- Notice now we have ˉf(x)=ˉf(π(a)) and that (from the passing to the quotient part of obtaining ˉf) we have f=ˉf∘π, this means:
- By surjectivity of π:[−1,1]→[−1,1]∼ we see ∃a∈[−1,1][π(a)=x] and ∃b∈[−1,1][π(b)=y]
- Suppose ˉf(x)≠ˉf(y), then we're done, as by the nature of logical implication we do not care about the right hand side.
- Since x,y∈[−1,1]∼ was arbitrary, we have shown this for all x,y. The very definition of ˉf being injective.
- Let x,y∈[−1,1]∼ be given. We wish to show that ˉf(x)=ˉf(y)⟹x=y
Thus ˉf is a bijection
Part 3
Show that [−1,1]/∼ is homeomorphic to S1
Solution
To apply the "compact-to-Hausdorff theorem" we require:
- A continuous bijection, which we have, namely ˉf:[−1,1]∼→S1
- the domain space, [−1,1]∼, to be compact, and
- the codomain space, S1, to be Hausdorff
We know the image of a compact set is compact, and that closed intervals are compact in R, thus [−1,1]/∼=π([1−,1]) must be compact. We also know R2 is Hausdorff and every subspace of a Hausdorff space is Hausdorff, thus S1 is Hausdorff.
We apply the theorem:
- ˉf is a homeomorphism
Question 7
Let D2 denote the closed unit disk in R2 and define an equivalence relation on D2 by setting x1∼x2 if ∥x1∥=∥x2∥=1 ("collapsing the boundary to a single point"). Show that D2∼ is homeomorphic to S2 - the sphere.
- Hint: first define a surjection (:D2→S2) mapping all of ∂D2 to the north pole. This may be defined using a good picture or a formula.
Solution
Definitions:
- H denotes the hemisphere in my picture.
- E:D2→H is the composition of maps in my diagram that take D2, double its radius, then embed it in R3 then "pop it out" into a hemisphere. We take it as obvious that it is a homeomorphism
- f′:H→S2, this is the map in the top picture. It takes the hemisphere and pulls the boundary/rim in (along the blue lines) to the north pole of the red sphere. f′(∂H)=(0,0,1)∈R3, it should be clear that for all x∈H−∂H that f′(x) is intended to be a point on the red sphere and that f′|H−∂H is injective. It is also taken as clear that f′ is surjective
- Note: Click the pictures for a larger version
- D2∼ and D2/∼ denote the quotient space, with this definition we get a canonical projection, π:D2→D2/∼ given by π:x↦[x] where [x] denotes the equivalence class of x
- Lastly, we define f:D2→S2 to be the composition of E and f′, that is: f:=f′∘E, meaning f:x↦f′(E(x))
The situation is shown diagramatically below:
Outline of the solution:
- We then want apply the passing to the quotient theorem to yield a commutative diagram:
- Lastly, we will show that ˉf is a homeomorphism using the compact-to-Hausdorff theorem
Solution body
First we must show the requirements for applying passing to the quotient are satisfied.
- We know already the maps involved are continuous and that π is a quotient map. We only need to show:
- f is constant on the fibres of π, which is equivalent to:
- ∀x,y∈D2[π(x)=π(y)⟹f(x)=f(y)]
- f is constant on the fibres of π, which is equivalent to:
- Let us show this remaining condition:
- Let x,y∈D2 be given.
- Suppose π(x)≠π(y), then by the nature of logical implication the implication is true regardless of f(x) and f(y)'s equality. We're done in this case.
- Suppose π(x)=π(y), we must show that in this case f(x)=y(y).
- Suppose x∈D2−∂D2 (meaning x∈D2 but x∉∂D2, ie − denotes relative complement)
- In this case we must have x=y, as otherwise we'd not have π(x)=π(y) (for x∈D2−∂D2 we have π(x)=[x]={x}, that is that the equivalence classes are singletons. So if π(x)=π(y) we must have π(y)=[y]={x}=[x]=π(x); so y can only be x)
- If x=y then by the nature of f being a function we must have f(x)=f(y), we're done in this case
- Suppose x∈∂D2 (the only case not covered) and π(x)=π(y), we must show f(x)=f(y)
- Clearly if x∈∂D2 and π(x)=π(y) we must have y∈∂D2.
- E(x) is mapped to the boundary/rim of H, as is E(y) and f′(any point on the rim of H)=(0,0,1)∈R3
- Thus f′(E(x))=f′(E(y)), but f′(E(x)) is the very definition of f(x), so clearly:
- f(x)=f(y) as required.
- Clearly if x∈∂D2 and π(x)=π(y) we must have y∈∂D2.
- Suppose x∈D2−∂D2 (meaning x∈D2 but x∉∂D2, ie − denotes relative complement)
- Let x,y∈D2 be given.
We may now apply the passing to the quotient theorem. This yields:
- A continuous map, ˉf:D2/∼→S2 where f=ˉf∘π
In order to apply the compact-to-Hausdorff theorem and show ˉf is a homeomorphism we must show it is continuous and bijective. We already have continuity (as a result of the passing-to-the-quotient theorem), we must show it is bijective.
We must show ˉf is both surjective and injective:
- Surjectivity: We can get this from the definition of ˉf, recall on the passing to the quotient (function) page that:
- if f is surjective then ˉf (or ˜f as the induced function is on that page) is surjective also
- I've already done it "the long way" once in this assignment, and I hope it is not frowned upon if I decline to do it again.
- if f is surjective then ˉf (or ˜f as the induced function is on that page) is surjective also
- Injectivity: This follows a similar to gist as to what we've done already to show we could apply "passing to the quotient" and for the other questions where we've had to show a factored map is injective. As before:
- Let x,y∈D2∼ be given.
- Suppose ˉf(x)≠ˉf(y) - then by the nature of logical implication we do not care about the RHS and are done regardless of x and y's equality
- Once again I note we must really have x≠y as if x=y then by definition of ˉf being a function we must also have ˉf(x)=ˉf(y), anyway!
- Suppose that ˉf(x)=ˉf(y), we must show that in this case x=y.
- Note that by surjectivity of π that: ∃a∈D2[π(a)=x] and ∃b∈D2[π(b)=y], so ˉf(x)=ˉf(π(a)) and ˉf(y)=ˉf(π(b)), also, as ˉf was the result of factoring, we have f=ˉf∘π, so we see ˉf(π(a))=f(a) and ˉf(π(b))=f(b), since ˉf(x)=ˉf(y) we get f(a)=f(b) and ˉf(π(a))=ˉf(π(b)) also.
- We now have 2 cases, a∈D2−∂D2 and a∈∂D2 respectively:
- Suppose a∈D2−∂D2
- As we have f(a)=f(b) we must have b=a, as if b≠a then f(b)≠f(a), because f|D2−∂D2:(D2−∂D2)→S2 is injective[Note 2] by construction
- If b=a then y=π(b)=π(a)=x so y=x as required (this is easily recognised as x=y)
- As we have f(a)=f(b) we must have b=a, as if b≠a then f(b)≠f(a), because f|D2−∂D2:(D2−∂D2)→S2 is injective[Note 2] by construction
- Suppose a∈∂D2
- Then to have f(a)=f(b) we must have b∈∂D2
- This means a∼b, and that means π(a)=π(b)
- But y=π(b) and x=π(a), so we arrive at: x=π(a)=π(b)=y, or x=y, as required.
- This means a∼b, and that means π(a)=π(b)
- Then to have f(a)=f(b) we must have b∈∂D2
- Suppose a∈D2−∂D2
- We now have 2 cases, a∈D2−∂D2 and a∈∂D2 respectively:
- Note that by surjectivity of π that: ∃a∈D2[π(a)=x] and ∃b∈D2[π(b)=y], so ˉf(x)=ˉf(π(a)) and ˉf(y)=ˉf(π(b)), also, as ˉf was the result of factoring, we have f=ˉf∘π, so we see ˉf(π(a))=f(a) and ˉf(π(b))=f(b), since ˉf(x)=ˉf(y) we get f(a)=f(b) and ˉf(π(a))=ˉf(π(b)) also.
- Suppose ˉf(x)≠ˉf(y) - then by the nature of logical implication we do not care about the RHS and are done regardless of x and y's equality
- Let x,y∈D2∼ be given.
We now know ˉf is a continuous bijection.
Noting that D2 is closed and bounded we can apply the Heine–Borel theorem to show D2 is compact. As π:D2→D2∼ is continuous (see quotient topology for information) we can use "the image of a compact set is compact" to conclude that D2∼ is compact.
A subspace of a Hausdorff space is a Hausdorff space, as S2 is a topological subspace of R3, S2 is Hausdorff.
We may now use the compact-to-Hausdorff theorem (as ˉf is a bijective continuous map between a compact space to a Hausdorff space) to show that ˉf is a homeomorphism
As we have found a homeomorphism between D2∼ and S2 we have shown they are homeomorphic, written:
- D2∼≅S2.
Question 8
Suppose that f:X→Y is a continuous function that is also surjective, and let ∼ denote the equivalence relation induced by f on X.
Show that if X is compact and Y is Hausdorff then X∼ is homeomorphic to Y.
Which theorem of group theory does this resemble?
Proof
Recall the result of question 5:
Using the linked theorem we instantly obtain:
- ˉf:X∼→Y that is a continuous bijection
- We must show this is a homeomorphism.
Suppose X is compact, then X∼ is compact also as the image of a compact set is compact and π:X→X∼ is continuous (see quotient topology for more details)
We then apply the "compact-to-Hausdorff theorem" which shows us that ˉf is actually a homeomorphism
This is similar to the first group isomorphism theorem (in the case the map is surjective) certainly in a categorical sense. The group theorem "factors through the kernel of the morphism" where as this "factors through the equivalence relation induced by the morphism" and they both yield an isomorphism (a homeomorphism is the term for a topological isomorphism. Here are diagrams:
- For any (surjective) group homomorphism φ:G→H (for arbitrary groups) we get a group isomorphism, ˉφ. , and,
- For any (surjective) continuous map, f:X→Y (for an arbitrary compact space X, and arbitrary Hausdorff space Y) we get a homeomorphism/topological isomorphism ˉf.
In both instances the "denominator" of the quotient depends on the map, factoring (as in passing to the quotient (function) is involved, rather than passing to the quotient (topology) and we get an isomorphism.
I hope this is the similarity that is expected.
Section C
Notes
- Jump up ↑ Technically a diagram is said to commute if all paths through it yield equal compositions, this means that we also require f=f′∘E, which we already have by definition of f!
- Jump up ↑ Actually:
- f|D2−∂D2:(D2−∂D2)→(S2−{(0,0,1)}) is bijective in fact!