2023-02-26

219: Path-Connected Topological Component Is Open and Closed on Locally Path-Connected Topological Space

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

A description/proof of that path-connected topological component is open and closed on locally path-connected topological space

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 any path-connected topological component is open and closed on any locally path-connected topological space.

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 locally path-connected topological space, T, any path-connected component, T1T, is open and closed.


2: Proof


Around any point, pT1, there are a neighborhood, pNpT, and a path-connected neighborhood, pNpNp. NpT1, because each point on Np is path-connected with p on Np, so, also on T, by the proposition that any 2 points that are path-connected on any topological subspace are path-connected on any larger subspace. So, T1 is open by the local criterion for openness.

Suppose that T1 was not closed. While the closure T1 would be closed, there would be a point, pT1 and pT1. By the proposition that the closure of any subset is the union of the subset and the accumulation points set of the subset, p would be an accumulation point of T1. For any neighborhood of p, Np, there would be a path-connected neighborhood, pNpNp. As p would be an accumulation point of T1, Np would contain a point of T1, so, p would be path-connected with the point of T1 on Np, and would be so on T, by the proposition that any 2 points that are path-connected on any topological subspace are path-connected on any larger subspace. So, p would be in T1, a contradiction. So, T1 is closed.


References


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