# Loops

## Definitions

In topology, a (parametrised, oriented) loop in a space $X$ is a map (a morphism in an appropriate category of spaces) to $X$ from the circle ${S}^{1}=ℝ/ℤ$. A loop at $a$ is a loop $f$ such that $f\left(k\right)=a$ for any (hence every) integer $k$. An unparametrised loop is an equivalence class of loops, such that $f$ and $g$ are equivalent if there is an increasing automorphism $\varphi$ of ${S}^{1}$ such that $g=f\circ \varphi$. An unoriented loop is an equivalence class of loops such that $f$ is equivalent to $\left(x↦f\left(-x\right)\right)$. A Moore loop has domain $ℝ/nℤ$ for some natural number (or possibly any real number) $n$. All of these variations can be combined, of course. (A Moore loop at $a$ has $f\left(kn\right)=a$ instead of $f\left(k\right)=a$. Also, a Moore loop for $n=0$ is simply a point, so possibly there is a better way to define this to avoid making this exception. Finally, there is not much difference between unparametrised loops and unparametrised Moore loops, since we may interpret $\left(t↦nt\right)$ as a reparametrisation $\varphi$.)

In graph theory, a loop is an edge whose endpoints are the same vertex. Actually, this is a special case of the above, if we interpret ${S}^{1}$ as the graph with $1$ vertex and $1$ edge; in this way, the other variations become meaningful. In this context, a Moore loop is called a cycle. (However, as the only directed graph automorphism of ${S}^{1}$ is the identity, parametrisation is trivial for directed graphs and equivalent to orientation for undirected graphs.)

Every loop may be interpreted as a path. Sometimes a loop, say at $a$, is defined to be a path from $a$ to $a$. However, this is correct only in certain contexts. In graph theory, it's incorrect, but only because of terminological conventions; the idea is sound. In continuous spaces, it is also correct. However, in smooth spaces, it is not correct, since the derivatives at the endpoints should also agree; the same holds in many other more structured contexts.

## Concatenation

Given two Moore loops $f$ and $g$ at $a$, the concatenation of $f$ and $g$ is a Moore loop $f;g$ or $g\circ f$ at $a$. If the domain of $f$ is $ℝ/mℤ$ and the domain of $g$ is $ℝ/nℤ$, then the domain of $f;g$ is $ℝ/\left(m+n\right)ℤ$, and

$\left(f;g\right)\left(x\right)≔\left\{\begin{array}{cc}f\left(x\right)& \phantom{\rule{1em}{0ex}}x\le m\\ g\left(m+x\right)& \phantom{\rule{1em}{0ex}}x\ge m.\end{array}$(f ; g)(x) \coloneqq \left \{ \array { f(x) & \quad x \leq m \\ g(m+x) & \quad x \geq m .} \right .

In this way, we get a monoid of Moore loops in $X$ at $a$, with concatenation as multiplication. This monoid may called the Moore loop monoid?.

Often we are more interested in a quotient monoid of the Moore loop monoid. If we use unparametrised loops (in which case we may use loops with domain ${S}^{1}$ if we wish), then we get the unparametrised loop monoid?. If $X$ is a smooth space, then we may additionally identify loops related through a thin homotopy to get the loop group. Finally, if $X$ is a continuous space and we identify loops related through any (basepoint-preserving) homotopy, then we get the fundamental group of $X$.

See looping and delooping for more.

Revised on September 17, 2011 10:02:18 by Toby Bartels (71.31.209.1)