Imagine that you have two paths, and . If it should happen that the terminal point of is the initial point of (that is, if ), then we can basically concatenate and into a new path . To do this formally we need to define , which means we have to reparameterize and a little bit. We’ll define so that it behaves as on [0, 1/2] and as on [1/2, 1] (notice this will be well-defined since we’re assuming the terminal point of is the initial point of ).

We will let the asterisk denote this concatenation operation: .

In the case that and are loops with the same basepoint, we’re just gluing the two loops together. In the image below the basepoint is represented by the red dot. We’re taking these two loops and gluing them together so that we first wind around the first loop (the one on the left) and then around the second loop.

Note that the red dot is the *same basepoint* for both loops, even though in our picture it doesn’t stay aligned (just for graphical convenience).

If , and are loops (with the same basepoint) and , we can show that . Letting be the homotopy taking to , we construct the homotopy by defining . This always behaves as on the “second half” of the loop, and deforms to on the first half. Of course, this also can be used to show that .

We can now use to help us form an operation on the homotopy classes of loops. We will simply define as . This operation is clearly associative, since our concatenation is associative. The identity element of this operation is the homotopy class of the constant function. Keeping in mind that these are loops, the constant function is the function that maps everything to the basepoint. Let denote this map. Then we have that , where the last equality follows from the fact that with we traverse twice as fast as normal, then just sit at the basepoint. This is homotopic to , and so and live in the same homotopy class.

Finally, our operation is invertible. To define the inverse operation we will take a loop and will let denote the reverse loop: . This reverse loop will have the same shape as the initial loop, but traverse the loop in the opposite direction. Now notice that can be compressed into the constant map by constructing a homotopy that traverses most of , then goes ahead and starts coming back through . This homotopy slowly reels back to the basepoint, which eventually turns it into the constant map. Since ( being the constant basepoint map), we have that , and similarly .

So, our operation is associtiative, has an identity, and is invertible, so we have a group of the homotopy classes of loops for a fixed basepoint. This is known as the *fundamental group* and is denoted , where is the space and is the basepoint. In the next post we’ll look at what happens when the basepoint changes.

[…] by path , then the reverse path connects and (symmetry); and the concatenation operation from last time gives us […]

Pingback by An Aside on Path Connectedness « Mathematics Prelims — March 18, 2009 @ 9:31 am |

[…] The Fundamental Group, Part 1 – Connecting Paths […]

Pingback by Topology, Geometry & Dynamics | Topology, Geometry & Dynamics — September 24, 2010 @ 4:57 pm |