Difference between revisions of "Paths and loops in a topological space"

From Maths
Jump to: navigation, search
(Created page with "* This article aims towards defining the Fundamental group * The name of the page was chosen to make it distinct from paths and loops, which are terms in graph theory ==P...")
 
m
 
Line 26: Line 26:
 
** Note that {{M|a*(b*c)}} performs {{M|b}} and {{M|c}} at 4 times their normal speed and {{M|a}} at just double whereas:
 
** Note that {{M|a*(b*c)}} performs {{M|b}} and {{M|c}} at 4 times their normal speed and {{M|a}} at just double whereas:
 
** {{M|(a*b)*c}} performs {{M|a}} and {{M|b}} at 4x their normal speed and {{M|c}} at just double - these are clearly different paths - so we don't even have associativity
 
** {{M|(a*b)*c}} performs {{M|a}} and {{M|b}} at 4x their normal speed and {{M|c}} at just double - these are clearly different paths - so we don't even have associativity
 +
 +
==Constant path==
 +
The constant path (often denoted {{M|e:[0,1]\rightarrow X}} is a map where:
 +
* <math>\forall t\in[0,1]</math> we have <math>e(t)=x_0</math>
 +
 +
 +
Clearly this is a loop
  
 
==References==
 
==References==

Latest revision as of 19:36, 16 April 2015

  • This article aims towards defining the Fundamental group
  • The name of the page was chosen to make it distinct from paths and loops, which are terms in graph theory

Path in a topological space

A path in X is any continuous map p:[0,1]X[1].

Loop in a topological space

A path p is a loop if p(0)=p(1)

Loop based at

If p is a loop based at x0 if p(0)=p(1)=x0

Concatenating paths

Given two paths p0 and p1 in a topological space X with p0(1)=p1(1) we can obtain a new path by performing p0 first, followed by p1 in the same time by moving at double speed, this new path is called p0p1 and is defined as:

  • (p0p1)(t)={p0(2t)if t[0,12]p1(2t1)if t[12,1]
    this is fine to do as the functions agree when restricted to the intersection, that is to say when t=12 both "halves" agree

Note that:

  • If p0 and p1 are loops based at x0 then p0p1 is always defined and is itself a loop based at x0
  • p0p1p1p0 usually - which is really easy to see.
  • We can't define a group yet.
    • Note that a(bc) performs b and c at 4 times their normal speed and a at just double whereas:
    • (ab)c performs a and b at 4x their normal speed and c at just double - these are clearly different paths - so we don't even have associativity

Constant path

The constant path (often denoted e:[0,1]X is a map where:

  • t[0,1] we have e(t)=x0


Clearly this is a loop

References

  1. Jump up Introduction to topology - lecture notes nov 2013 - David Mond