Path connectedness

Definition 337.1(Path connectedness).

Let be a metric space. Let . A path from to is a continuous function such that , . If there exists a path between and , the points are said to be path connected. is called path connected if every pair of points are path connected.

The relation induced by path connectedness is an equivalence relation.

Proposition 337.2.

Path connected connected.

Example 337.3.

Let be countable. Then, is path connected.
This follows from the fact that there are uncountably many disjoint paths between any two fixed points in ; for instance, there are uncountably many circles passing through any two given points.

Example 337.4.

Open balls in any NLS are path connected. Indeed, if , then for all ,

so . It follows that is a path between and .

40b7b9

Proposition 337.5.

Let be a NLS. If is open and connected, it is path connected.

Example 337.6.

Clearly, if is connected, any such that is connected - just apply Prp 329.1. Here’s an example where is path connected, is path connected, and is connected (but not path connected!):

Clearly, and are path connected. Suppose is a path from to . Let . We claim that there exists such that . If such an did not exist, we can construct a sequence such that and , yielding a contradiction.

Since is connected, we must have for some . For any such that , we have , a contradiction. Thus, there does not exist a path from to in .

486748