2023-02-12

200: Topological Path-Connected-ness of 2 Points Is Equivalence Relation

<The previous article in this series | The table of contents of this series | The next article in this series>

A description/proof of that topological path-connected-ness of 2 points is equivalence relation

Topics


About: topological space

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that topological path-connected-ness of 2 points is an equivalence relation.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Description


For any topological space, T, path-connected-ness of 2 points is an equivalence relation.


2: Proof


By the proposition that any 2 points are path-connected on any topological space if and only if there is a path that connects the 2 points on the topological space, we only need to cite a path on T in order to prove that 2 concerned points are path-connected.

For any point, pT, p and p are path-connected, because the curve, λ:[0,1]T, which constantly maps to p is a path.

For any points, p1,p2T, that are path-connected, p2 and p1 are path-connected, because there is a path, λ:[0,1]T, where λ(0)=p1 and λ(1)=p2, so, there is the path, λ:[0,1][0,1]T, where its 1st-half, [0,1][0,1], is r1r and its 2nd-half, [0,1]T, is λ, continuous as a compound of continuous maps, with λ(0)=p2 and λ(1)=p1.

For any points, p1,p2,p3T, such that p1 and p2 are path-connected and p2 and p3 are path-connected, there are paths, λ1:[0,21]T where λ1(0)=p1 and λ1(21)=p2 and λ2:[21,1]T where λ2(21)=p2 and λ2(1)=p3. Let us define λ:[0,1]T as λ|[0,21]=λ1 and λ|[21,1]=λ2. λ is continuous by the proposition that any map between topological spaces is continuous if the domain restriction of the map to each closed set of a finite closed cover is continuous, and λ(0)=p1 and λ(1)=p3. So, p1 and p3 are path-connected.


References


<The previous article in this series | The table of contents of this series | The next article in this series>