Path-connected sets and path components

[3/100%]
Show
LaTeX

A space XX is called path connected if, given x,y∈Xx, y \in X, there is a continuous map f:[0,1]→Xf : [0, 1] \to X (called a path in XX) with f(0)=xf(0) = x and f(1)=yf(1) = y. We say that the path connects xx to yy.

Define a relation on XX by x∼yx \sim y if there is a path connecting xx to yy.

Show that the relation x∼yx \sim y as defined above is an equivalence relation.

?

Show that a union of path connected sets with a point in common is path connected.

?
Remark.
?

Let zz be the common point. Then show that given x,yx, y in the union, we can find a path that joins them by using paths in individual path connected spaces that join xx to zz and join zz to yy.

Problem 1.9.46 from Lawson T. "Topology: A Geometric Approach" [Law06]More problems in Section 1.9 "Supplementary exercises"

Consider the space X=A∪BX = A \cup B, where A={(x,sin⁡1/x):0<x≤1}A = \left\{ (x, \sin 1/x) : 0 < x \leq 1\right\} and B={(0,y):−1≤y≤1}B = \left\{ (0, y) : -1 \leq y \leq 1\right\} (the topologist's sine curve; see the figure in Exercise 1.9.44). We show here that A∪BA \cup B is not path connected. Suppose A∪BA \cup B were path connected. Let f:[0,1]→A∪Bf : [0, 1] \to A \cup B be a path with f(0)=(0,0)f(0) = (0, 0) and f(1)=(1,sin⁡1)f(1) = (1, \sin 1). Consider the set S={t:f([0,t])⊂B}S = \left\{ t : f([0, t]) \subset B\right\}. Let p:R2→Rp : \mathbb {R}^{2} \to \mathbb {R} be p(x,y)=xp(x, y) = x.

?
(a)

Show that SS is nonempty, is bounded from above, and has a least upper bound u<1u < 1.

(b)

Show that u∈Su \in S.

(c)

Show that there is a neighborhood Nf(u)N_{f(u)} of f(u)f(u) consisting of an infinite number of separated arcs, and a neighborhood NuN_u of uu with f(Nu)⊂Nf(u)f(N_u) \subset N_{f(u)}.

(d)

Show that there is u1>uu_1 > u, u1∈Nuu_1 \in N_u with pf(u1)>0pf(u_1) > 0.

(e)

Show that there are disjoint open sets U,V⊂Nf(u)U, V \subset N_{f(u)} with f(u)∈Uf(u) \in U, f(u1)∈Vf(u_1) \in V, and U∪V=Nf(u)U \cup V = N_{f(u)}; that is, Nf(u)N_{f(u)} is separated by U,VU, V.

(f)

By looking at f∣[u,u1]f|_{[u, u_1]}, arrive at a contradiction.

References

[Law06] Lawson T. Topology: A Geometric Approach. Oxford University Press, 2006.