Skip to main content
replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link

No - take $(\mathcal{P}(\mathbb{N}), \tau)$ where $\tau = \{\emptyset\}\cup\{A\subseteq\mathbb{N}: \mathbb{N}\setminus A \text{ is finite}\}$. Clearly, every two non-empty open sets have non-empty intersection, so the space is hyperconnected, but is not path-connected, see this postthis post.

No - take $(\mathcal{P}(\mathbb{N}), \tau)$ where $\tau = \{\emptyset\}\cup\{A\subseteq\mathbb{N}: \mathbb{N}\setminus A \text{ is finite}\}$. Clearly, every two non-empty open sets have non-empty intersection, so the space is hyperconnected, but is not path-connected, see this post.

No - take $(\mathcal{P}(\mathbb{N}), \tau)$ where $\tau = \{\emptyset\}\cup\{A\subseteq\mathbb{N}: \mathbb{N}\setminus A \text{ is finite}\}$. Clearly, every two non-empty open sets have non-empty intersection, so the space is hyperconnected, but is not path-connected, see this post.

removed "it", which was grammatically wrong
Source Link

No - take $(\mathcal{P}(\mathbb{N}), \tau)$ where $\tau = \{\emptyset\}\cup\{A\subseteq\mathbb{N}: \mathbb{N}\setminus A \text{ is finite}\}$. Clearly, every two non-empty open sets have non-empty intersection, so it the space is hyperconnected, but is not path-connected, see this post.

No - take $(\mathcal{P}(\mathbb{N}), \tau)$ where $\tau = \{\emptyset\}\cup\{A\subseteq\mathbb{N}: \mathbb{N}\setminus A \text{ is finite}\}$. Clearly, every two non-empty open sets have non-empty intersection, so it the space is hyperconnected, but is not path-connected, see this post.

No - take $(\mathcal{P}(\mathbb{N}), \tau)$ where $\tau = \{\emptyset\}\cup\{A\subseteq\mathbb{N}: \mathbb{N}\setminus A \text{ is finite}\}$. Clearly, every two non-empty open sets have non-empty intersection, so the space is hyperconnected, but is not path-connected, see this post.

Rollback to Revision 1
Source Link
Ramiro de la Vega
  • 11.5k
  • 1
  • 45
  • 56

No - take $(\mathcal{P}(\mathbb{N}), \tau)$ where $\tau = \{A\subseteq\mathbb{N}: \mathbb{N}\setminus A \text{ is finite}\}$$\tau = \{\emptyset\}\cup\{A\subseteq\mathbb{N}: \mathbb{N}\setminus A \text{ is finite}\}$. Clearly, every two non-empty open sets have non-empty intersection, so it the space is hyperconnected, but is not path-connected, see this post.

No - take $(\mathcal{P}(\mathbb{N}), \tau)$ where $\tau = \{A\subseteq\mathbb{N}: \mathbb{N}\setminus A \text{ is finite}\}$. Clearly, every two non-empty open sets have non-empty intersection, so it the space is hyperconnected, but is not path-connected, see this post.

No - take $(\mathcal{P}(\mathbb{N}), \tau)$ where $\tau = \{\emptyset\}\cup\{A\subseteq\mathbb{N}: \mathbb{N}\setminus A \text{ is finite}\}$. Clearly, every two non-empty open sets have non-empty intersection, so it the space is hyperconnected, but is not path-connected, see this post.

Source Link
Loading