| |
| Algebraic topology |
« View previous topic :: View next topic » |
| Author |
Message
|
| JaneBennet |
Posted: Fri Jul 04, 2008 6:19 am Post subject: Algebraic topology |
|
|
 Forum Ph.D.

Joined: 06 Apr 2008 Posts: 792
|
Warning: This thread may be pretty heavy going for some; please ignore it if you don’t feel up to it.
Let be defined by for each . Then as t varies continuously from 0 to 1, p(t) moves continuously from (1,0) to (−1,0) along the upper semicircle of the unit circle centred at the origin. We say that p is a path in from (1,0) to (−1,0). In general:
Definition 1: If a and b are points in a topological space X, a path in X from a to b is a continuous function such that p(0) = a and p(1) = b. If a = b, the path p is called a loop at a.
Properties of paths:
(i) If p is a path as defined above, the inverse path of p is the path in X from b to a defined by for each .
(ii) Let p be a path from a to b and q be a path from b to c. Note that p(1) = b = q(0). The product path of p and q is the path from a to c defined as follows:
The fact that p*q is continuous is due to a result in general topology sometimes called the “pasting lemma”ť:
Lemma 1: Let A and B be closed subsets of a topological space X such that , and suppose and are continuous functions to a topological space Y such that f(x) = g(x) for all x ∊ A ∩ B. Then the function where h(x) = f(x) if x ∊ A and h(x) = g(x) if x ∊ B is continuous.
(iii) The constant loop mapping all points in [0,1] to a is called the null path at a.
Exercise 1: Let p be a path from a to b, q be a path from b to c, and r be a path from c to d in X. If or , explain why is NOT equal to . _________________
A problem worthy of attack
Proves its worth by fighting back.
(Piet Hein)
Did You Know?
Fact of the day: Homotopy
Last edited by JaneBennet on Thu Aug 07, 2008 3:49 am; edited 4 times in total |
|
| Back to top |
|
 |
| JaneBennet |
Posted: Fri Jul 04, 2008 8:23 am Post subject: |
|
|
 Forum Ph.D.

Joined: 06 Apr 2008 Posts: 792
|
Now let’s return to the example at the beginning of the previous post: the path . If we set q(t) = −p(t) for each t ∊ [0,1], we have another path from (1,0) to (−1,0) in ℝ2, this one the lower semicircle of the same unit circle.
And now, for each s ∊ [0,1], let’s define a mapping by for all t ∊ [0,1]. Notice that f0(t) = p(t) and f1(t) = q(t) for all t ∊ [0,1]. So f0 is the path p and f1 is the path q, and for each s ∊ [0,1] fs is a path tracing out a semiellipse. (When s = ˝, the semiellipse is degenerate, being the straight line from (1,0) to (−1,0).)
What happens is that as s varies continously from 0 to 1, the path p is continously deformed into q via the various intermediate paths fs.
In general, continuous functions between topological spaces (not just paths) can be continuously deformed into one other in this way (if certain conditions hold). This is the basis of homotopy theory.
Definition 2: Let X and Y be topological spaces and continuous functions. Then f is said to be homotopic to g (written ) iff
(i) given any s ∊ [0,1], there exists a continuous function with f0 = f and f1 = g, and
(ii) there exists a continuous function such that F(x,s) = fs(x) for each x ∊ X, s ∊ [0,1].
The function F is called a homotopy from f to g.
Notes:
(i) The existence of intermediate continuous functions fs for all s ∊ [0,1] does not mean that f ≃ g – the “deformation”ť process still has to be carried out smoothly. This is what the continuous function F ensures.
(ii) If X is homeomorphic to Y and each intermediate fs is a homeomorphism from X to Y, f is said to be isotopic to g, and the function F is called an isotopy from f to g.
(iii) The class of all continuous functions from X to Y is denoted Hom(X,Y). This class can be regarded as a category (see Guitarist’s excellet thread on category theory) with continuous functions as objects and homotopies as morphisms; the isomorphisms of this category are then the isotopies of Hom(X,Y).
Exercise 2: Prove that the relation “is homotopic to”ť is an equivalence relation on Hom(X,Y). (You will need to use the “pasting lemma”ť (Lemma 1) to prove transitivity.) _________________
A problem worthy of attack
Proves its worth by fighting back.
(Piet Hein)
Did You Know?
Fact of the day: Homotopy
Last edited by JaneBennet on Thu Aug 07, 2008 4:05 am; edited 4 times in total |
|
| Back to top |
|
 |
| bit4bit |
Posted: Fri Jul 04, 2008 9:34 am Post subject: Re: Algebraic topology |
|
|
 Forum Ph.D.

Joined: 14 Jul 2007 Posts: 623
|
Thanks for posting this. I followed it this far:
| JaneBennet wrote: |
(ii) Let p be a path from a to b and q be a path from b to c. Note that p(1) = b = q(0). The product path of p and q is the path p*q from a to c defined as follows:
The fact that p*q is continuous is due to a result in general topology sometimes called the “pasting lemma”: |
Can you elaborate on the definition in LaTeX and what it means? t looks like a new operation to me. I understand that p(1)=q(0), and that the two paths combine to make a new path, but not the LaTeX expression.
Thanks _________________ Chance favours the prepared mind. |
|
| Back to top |
|
 |
| JaneBennet |
Posted: Fri Jul 04, 2008 9:47 am Post subject: |
|
|
 Forum Ph.D.

Joined: 06 Apr 2008 Posts: 792
|
I made a slight mistake with my equation, silly me.
I have fixed it now; the LHS should be p*q(t). ( is a function .) _________________
A problem worthy of attack
Proves its worth by fighting back.
(Piet Hein)
Did You Know?
Fact of the day: Homotopy
Last edited by JaneBennet on Thu Aug 07, 2008 3:52 am; edited 2 times in total |
|
| Back to top |
|
 |
| bit4bit |
Posted: Fri Jul 04, 2008 10:13 am Post subject: |
|
|
 Forum Ph.D.

Joined: 14 Jul 2007 Posts: 623
|
So basically the notation for the product path is just listing the 'component' paths p(t) and q(t), making up the overall path p*q(t)?
Why not just write the upper path, p, as p(t) 0≤t≤1, and the lower path, q, as q(t) 0≤t≤1 ?
What if there were a third path s(t) from c to d. would you write it as:
p*q*s(t) =
p(t) 0≤t≤1
q(t) 0≤t≤1
s(t) 0≤t≤1
(but with the curly bracket)? _________________ Chance favours the prepared mind. |
|
| Back to top |
|
 |
| JaneBennet |
Posted: Fri Jul 04, 2008 11:02 am Post subject: |
|
|
 Forum Ph.D.

Joined: 06 Apr 2008 Posts: 792
|
| bit4bit wrote: |
| Why not just write the upper path, p, as p(t) 0≤t≤1, and the lower path, q, as q(t) 0≤t≤1 ? |
Well, no. You can only do paths p and q separately. If you do them together, the function p*q won’t be well defined. p*q means: do path p first, then q.
You see, t is a variable that goes continuously from 0 to 1. As it does so, the path p traces out a continuous “route”ť in the topological space X from a to b. Similarly the path q traces out a continuous “route”ť in X from b to c.
Now suppose you want to get from a to c. Since the path p ends at b and the path q starts at b, you can make your journey via b using paths p and q. But there’s a catch: you still have to make your journey as t moves from 0 to 1 – no faster, no slower. So, what do you do? Well, the trick is to move twice as fast as you would if you were just taking path p or path q alone!
So if you go through path p twice as fast, you’ll reach b at t = ½ rather than t = 1. This will leave you time to go through path q, moving at the same double speed, and get to c when t hits 1. This is why you have p(2t) rather than p(t) in the formula for the product path – because you want to move at double speed. Same for q – except that for q, you start at t = ½ rather than 0, so the formula is q(2(t−½)) = q(2t−1) instead.
Similarly if you have three paths. But note Exercise 1: the product of paths is not associative!  _________________
A problem worthy of attack
Proves its worth by fighting back.
(Piet Hein)
Did You Know?
Fact of the day: Homotopy
Last edited by JaneBennet on Thu Aug 07, 2008 4:07 am; edited 2 times in total |
|
| Back to top |
|
 |
| Guitarist |
Posted: Fri Jul 04, 2008 12:17 pm Post subject: |
|
|
Forum Ph.D.

Joined: 08 Jun 2005 Posts: 716
|
Jane: Good thread you have going here. Homotopy theory is a lot of fun.
Keep it coming! |
|
| Back to top |
|
 |
| JaneBennet |
Posted: Fri Jul 04, 2008 5:56 pm Post subject: |
|
|
 Forum Ph.D.

Joined: 06 Apr 2008 Posts: 792
|
Yeah, I intend to develop the thread at least up to the definition of fundamental group. (Maybe further if I feel up to it.)
Anyway, I’ve reviewed the material that I need and found that there is one very important result I need which I have to mention now. The proof is anything but straightforward.
Theorem 1: Let p, q and r be paths as described in Exercise 1. Then .
Proof: From the definition of product path, we have the following:
So you can see why and are not equal in general: with the former path, you go twice as quickly from a to b and twice as slowly from c to d as with the latter. There’s the answer to Exercise 1. (Did you get it?)
The two paths are nevertheless homotopic. So what might a homotopy be? Well, I have the answer in my book (A First Course in Algebraic Topology by B.K. Lahiri) so I can tell you what it is:
Goodness me! I’d never have come up with that one myself in a million years.  _________________
A problem worthy of attack
Proves its worth by fighting back.
(Piet Hein)
Did You Know?
Fact of the day: Homotopy
Last edited by JaneBennet on Thu Aug 07, 2008 4:08 am; edited 6 times in total |
|
| Back to top |
|
 |
| Guitarist |
Posted: Sat Jul 05, 2008 3:01 am Post subject: |
|
|
Forum Ph.D.

Joined: 08 Jun 2005 Posts: 716
|
| Help!!! Jane your photobucket images don't render for me. Wht? |
|
| Back to top |
|
 |
| JaneBennet |
Posted: Sat Jul 05, 2008 3:39 am Post subject: |
|
|
 Forum Ph.D.

Joined: 06 Apr 2008 Posts: 792
|
It’s working fine for me.  _________________
A problem worthy of attack
Proves its worth by fighting back.
(Piet Hein)
Did You Know?
Fact of the day: Homotopy
Last edited by JaneBennet on Thu Aug 07, 2008 4:08 am; edited 1 time in total |
|
| Back to top |
|
 |
| bit4bit |
Posted: Sat Jul 05, 2008 5:57 am Post subject: |
|
|
 Forum Ph.D.

Joined: 14 Jul 2007 Posts: 623
|
| JaneBennet wrote: |
Well, no. You can only do paths p and q separately. If you do them together, the function p*q won’t be well defined. p*q means: do path p first, then q.
You see, t is a variable that goes continuously from 0 to 1. As it does so, the path p traces out a continuous “route” in the topological space X from a to b. Similarly the path q traces out a continuous “route” in X from b to c.
Now suppose you want to get from a to c. Since the path p ends at b and the path q starts at b, you can make your journey via b using paths p and q. But there’s a catch: you still have to make your journey as t moves from 0 to 1 – no faster, no slower. So, what do you do? Well, the trick is to move twice as fast as you would if you were just taking path p or path q alone!
So if you go through path p twice as fast, you’ll reach b at t = ½ rather than t = 1. This will leave you time to go through path q, moving at the same double speed, and get to c when t hits 1. This is why you have p(2t) rather than p(t) in the formula for the product path – because you want to move at double speed. Same for q – except that for q, you start at t = ½ rather than 0, so the formula is q(2(t−½)) = q(2t−1) instead.
Similarly if you have three paths. But note Exercise 1: the product of paths is not associative!  |
Thanks Jane, I got it now. _________________ Chance favours the prepared mind. |
|
| Back to top |
|
 |
| JaneBennet |
Posted: Sat Jul 05, 2008 11:50 am Post subject: |
|
|
 Forum Ph.D.

Joined: 06 Apr 2008 Posts: 792
|
You’re welcome, bit4bit.
Now let’s explore some properties of null paths. Recall that a null path at a ∊ X is the constant path where for all t ∊ [0,1].
Theorem 2: For any paths p in X, and .
Proof: Take where
Then F is a homotopy from p*εp(1) to p.
Similarly, where
is a homotopy from εp(0)*p to p.
Theorem 3: and .
Proof: Note that
Now, what trick is it this time? Well, I can tell you:
That’s the homotopy that does the job.
To prove the other case, replace p by in the above, noting that and . Hmm, this will do for the next exercise.
Exercise 3: (i) Show that for any path p in X. (ii) Prove that if p and q are homotopic paths, then their inverse paths are homotopic. _________________
A problem worthy of attack
Proves its worth by fighting back.
(Piet Hein)
Did You Know?
Fact of the day: Homotopy
Last edited by JaneBennet on Thu Aug 07, 2008 4:09 am; edited 1 time in total |
|
| Back to top |
|
 |
| JaneBennet |
Posted: Sun Jul 06, 2008 4:04 pm Post subject: |
|
|
 Forum Ph.D.

Joined: 06 Apr 2008 Posts: 792
|
| Guitarist wrote: |
| Help!!! Jane your photobucket images don't render for me. Wht? |
It shouldn’t be a problem now. I’ve edited my posts and rewritten much of my stuff in TeX mode!
Next topic: Relative homotopy and equivalent paths.  _________________
A problem worthy of attack
Proves its worth by fighting back.
(Piet Hein)
Did You Know?
Fact of the day: Homotopy
Last edited by JaneBennet on Thu Aug 07, 2008 4:09 am; edited 1 time in total |
|
| Back to top |
|
 |
| JaneBennet |
Posted: Sat Jul 12, 2008 12:36 pm Post subject: |
|
|
 Forum Ph.D.

Joined: 06 Apr 2008 Posts: 792
|
Definition 2: Let and . If for all , then is called a homotopy from f to g relative to A iff H is a homotopy from f to g such that for all .
If f is homotopic to g relative to A, we’ll write .
In particular, if are paths such that and , then p are q are said to be equivalent iff they are homotopic relative to , i.e. iff .
We come now to something very important.
Let X be a topological space and a be a fixed point in X. Consider the set of all paths starting and ending at a (i.e. all loops at a). Define a relation ~ on this set by p and q are equivalent. Then ~ is an equivalence relation (cf Exercise 2); write to for the equivalence class containing the path p, and denote the set of all equivalence classes by .
Now we define a binary operation * on as follows:
In other words, the “product”ť of the equivalence classes of two paths shall be the equivalence class of the product path. The very first question we have to ask is: is this operation well defined? In other words, will we get the same result for the operation even if we take different paths as “representatives”ť for the same equivalence classes?
And the answer this is … yes! The operation is well defined thanks to the following:
Theorem 4: Let p and q be equivalent paths from a to b in the topological space X (so and ). Similarly, let r and s be equivalent paths from b to c in X. Then . _________________
A problem worthy of attack
Proves its worth by fighting back.
(Piet Hein)
Did You Know?
Fact of the day: Homotopy
Last edited by JaneBennet on Thu Aug 07, 2008 4:11 am; edited 2 times in total |
|
| Back to top |
|
 |
| JaneBennet |
Posted: Sat Jul 12, 2008 2:31 pm Post subject: |
|
|
 Forum Ph.D.

Joined: 06 Apr 2008 Posts: 792
|
Proof of Theorem 4: Let be homotopies relative to {0,1} between p and q and between r and s respectively. Thus, for all , we have the following:
Now let be defined as follows:
Note that so H is well defined and continuous at .
Now let’s check that we have everything else.
Hence H is a homotopy from to . Let’s verify that it’s a homotopy relative to {0,1}.
And so it is. The theorem is proved.
Very important note:
If p and q (likewise r and s) are only homotopic, not equivalent, the above proof will not work. This is because H may then not be continuous (or even well defined) at . Indeed, it is false that : the homotopies must be relative to {0,1}. Here is an example to show why.
Let and let be as we’ve defined in the opening post of this thread: . Now let , , . Then p and q are homotopic, but not equivalent; similarly for r and s. Now is the path tracing out the unit circle centred at (0,0) while traces out the unit circle centred at (0,2). It is clear that . The former “encloses”ť the point (0,0), which is not in X, so there is no way it can be continuously deformed into a path that doesn’t “enclose”ť (0,0). _________________
A problem worthy of attack
Proves its worth by fighting back.
(Piet Hein)
Did You Know?
Fact of the day: Homotopy
Last edited by JaneBennet on Thu Aug 07, 2008 4:12 am; edited 1 time in total |
|
| Back to top |
|
 |
|
|
|
 |
Goto page 1, 2 Next |
Page 1 of 2 |
|
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum
|
|
|
|