A continuous map induces a homomorphism on fundamental groups
- The definition is a little messy and due to the clutter doesn't show the most important part:
- φ∗([f]):=[φ∘f]
- Note: this page is the proof of the fundamental group homomorphism induced by a continuous map being 1) a map, and 2) a group homomorphism. See that page for the definition.
Contents
[hide]Statement
Let (X,J) and (Y,K) be topological spaces, let φ:X→Y be a continuous map and let p∈X serve as the base point for the fundamental group of X at p, π1(X,p). Then[1]:
- φ∗:π1(X,p)→π1(Y,φ(p)) defined by φ∗:[f]↦[φ∘f] is a homomorphism of the fundamental groups of X and Y
Caveat:We are implicitly claiming it is well defined: as we do not have f when we write [f], to obtain f we must look at the inverse relation of the canonical projection, P−1X([f]) in the notation developed next, giving us a set of all things equivalent to f and for any of these φ∗ must yield the same result.
- φ∗ is called the homomorphism induced by the continuous map φ
Formal definition
With our situation we automatically have the following (which do not use their conventional symbols):
- PX:Ω(X,p)→π1(X,p)[Note 1][Note 2] is the canonical projection of the equivalence relation
- i.e. PX:f↦[f]∈Ω(X,p)((⋅)≃(⋅) (rel {0,1}));
- PY:Ω(Y,φ(p))→π1(Y,φ(p)) is the canonical projection as above but for Y, and
- Mφ:Ω(X,p)→Ω(Y,φ(p)) by M:f↦(φ∘f) is the core of the definition, the map taking loops to their images
In this case we claim that[1]:
- φ∗(α):=PY(Mφ(P−1X(α))) is an unambiguous (i.e. is well-defined) definition and is a group homomorphism.
- It is called the homomorphism induced by the continuous map φ
See next
It would be better to look at the fundamental group homomorphism induced by a continuous map page, this is just a proof, but if not:
- TODO: Expand on this, link to the identity property and the composition property on page 197.6 of[1]
Proof
We use the context of the formal definition. Before we show "the map" is a group homomorphism we must show it actually is a map, as it is defined.
Remember that when we write [f] that there are many choices of map, say g such that [g]=[f], we must check it is well defined, which as usual means:
- factoring is in play.
Then we show it is a group homomorphism, ie:
- ∀a,b∈π1(X,p)[φ∗(a⋅b)=φ∗(a)⋅φ∗(b)]
Well-definedness of φ∗
We wish to factor to yield the map ¯Mφ as shown on the right. To apply the theorem we must first show:
- ∀f,g∈Ω(X,p)[(PX(f)=PX(g))⟹ (PY(Mφ(f))=PY(Mφ(g)))]
Proof:
- Let f,g∈Ω(X,p) be given
- Suppose that PX(f)≠PX(g) - then by the nature of logical implication we're done, we do not care about the truth or falsity of the RHS
- Suppose that PX(f)=PX(g) - then we must show that in this case PY(Mφ(f))=PY(Mφ(g))
- We have PX(f)=PX(g), that means:
- f≃g (rel {0,1})
- By the composition of end-point-preserving-homotopic paths with a continuous map yields end-point-preserving-homotopic paths, this means:
- (φ∘f)≃(φ∘g) (rel {0,1})
- By the composition of end-point-preserving-homotopic paths with a continuous map yields end-point-preserving-homotopic paths, this means:
- f≃g (rel {0,1})
- Thus PX(f)=PX(g)⟹(φ∘f)≃(φ∘g) (rel {0,1})
- Furthermore (φ∘f)≃(φ∘g) (rel {0,1}) is exactly the definition of [φ∘f]=[φ∘g] (i.e. PY(φ∘f)=PY(φ∘g)) (which are obviously in π1(Y,φ(p)) of course)
- Next let us simplify the RHS:
- PY(Mφ(f))
- =PY(φ∘f)
- =[φ∘f]
- PY(Mφ(g))
- =PY(φ∘g)
- =[φ∘g]
- PY(Mφ(f))
- We have already shown that we have [φ∘f]=[φ∘g] from the LHS
- We have PX(f)=PX(g), that means:
- So the entire thing boiled down to:
- Since f,g∈Ω(X,p) we arbitrary we have shown it for all.
Thus we may define ¯Mφ:π1(X,p)→π1(Y,φ(p)) unambiguously by ¯Mφ:α↦PY(Mφ(P−1X(α))) - it doesn't matter which representative of P−1X(α) we take.
This justifies the notation ¯Mφ:[f]↦[φ∘f] - as it doesn't matter whuch f we take to represent the [[equivalence class] [f].
Group homomorphism
We want to show that:
- ∀[f],[g]∈π1(X,p)[φ∗([f]⋅[g])=φ∗([f])⋅φ∗([g])]
We will do this by operating on the left-hand-side (LHS) and the right-hand-side (RHS) separately.
- Let [f],[g]∈π1(X,p) be given.
- We now operate on the LHS and RHS:
- The LHS:
- φ∗([f]⋅[g])
- =φ∗([f∗g]) (by the operation of the fundamental group) - note that ∗ here denotes loop concatenation of course.
- =[φ∘(f∗g)] (by definition of φ∗)
- φ∗([f]⋅[g])
- The RHS:
- φ∗([f])⋅φ∗([g])
- =[φ∘f]⋅[φ∘g]
- =[(φ∘f)∗(φ∘g)]
- φ∗([f])⋅φ∗([g])
- The LHS:
- Now we must show they're equal.
- Using the definition of loop concatenation we see LHS=φ∘({f(2t)for t∈[0,12]g(2t−1)for t∈[12,1])={φ(f(2t))for t∈[0,12]φ(g(2t−1)for t∈[12,1]
- Also using the definition of loop concatenation we see RHS={φ(f(2t))for t∈[0,12]φ(g(25−1))for t∈[12,1]
- Clearly these are the same
- We now operate on the LHS and RHS:
- Since [f],[g]∈π1(X,p) were arbitrary we have shown this for all. As required.
Template:Proofreading of proof required
Notes
- Jump up ↑ πX is not used for the canonical projection because π is already in play as the fundamental group. Although it wouldn't lead to ambiguous writings, it's not helpful
- Jump up ↑ Recall that Ω(X,p) is the set of all loops in X based at p∈X. There is an operation, loop concatenation, but it isn't a monoid or even a semigroup yet! As concatenation is not associative
References
- Stub pages
- XXX Todo
- Theorems
- Theorems, lemmas and corollaries
- Topology Theorems
- Topology Theorems, lemmas and corollaries
- Topology
- Algebraic Topology Theorems
- Algebraic Topology Theorems, lemmas and corollaries
- Algebraic Topology
- Homotopy Theory Theorems
- Homotopy Theory Theorems, lemmas and corollaries
- Homotopy Theory