Continuous Path
High school
A path is a way of moving continuously from one point to another, described by the position $\gamma(s)$ at each value of a parameter $s$ that goes from $0$ to $1$.
Undergraduate (topology)
Consider a topological space $X$. A path in $X$ is a continuous function
\[\gamma : [0, 1] \to X.\]The points $\gamma(0)$ and $\gamma(1)$ are the start and the end of the path.
Examples
Examples
-
The half circle $\gamma$ is a continuous path from $(1, 0)$ to $(-1, 0)$, because $\gamma$ is a continuous function from $[0, 1]$ to $\reals^2$.
Non-examplesThings that may be mistaken for examples of this term.
-
✗ The vertex sequence $a, b, a$ in the triangle graph with vertices $a$, $b$, $c$ and edges $\setdef{a, b}$, $\setdef{b, c}$, $\setdef{c, a}$ UndergraduateThe vertex sequence $a, b, a$ is not a continuous path, because it is not a continuous function from $[0, 1]$ to a topological space.
-
✗ The vertex sequence $a, b, c$ in the triangle graph with vertices $a$, $b$, $c$ and edges $\setdef{a, b}$, $\setdef{b, c}$, $\setdef{c, a}$ UndergraduateThe vertex sequence $a, b, c$ is not a continuous path, because it is a finite list of vertices, not a continuous function from $[0, 1]$ to a topological space.
Properties
- Every path is a curve, parametrized by the interval $[0, 1]$.
- A space is path connected if every two points of the space are joined by a path.
Notes
In graph theory, a path is a sequence of distinct vertices joined by edges, which is a different object; see continuous path vs. path in a graph.
In physics and everyday speech, the “path” of a moving object usually means the set of points that the object passes through, which is the orbit in the language of dynamical systems.
Distinctions involving this term
- Path: Continuous Path vs. Path in a Graph: “Path” has two common meanings, one in topology and one in graph theory. A continuous path is a continuous function $\gamma : [0, 1] \to X$ into a topological space $X$, so a continuous path passes through infinitely many points, unless the path stays at one point. A path in a graph is a finite sequence of distinct vertices such that each pair of consecutive vertices is joined by an edge.