Having a path between two points is an equivalence relation and the equivalence classes are called the path components of .
The set of path components is . If then is path connected.
Path component map
Proposition
Given a map , get a well define function:
and it satisfies:
If and are maps then
Proof
Firstly, well defined:
Find
Then so
(1) Say . Then for any we have a path , so .
The (2) and (3) are apparently directly from definitions.