From Conway's Complex Analysis, page 17, 2.2.5:(adsbygoogle = window.adsbygoogle || []).push({});

Suppose [tex]F \subseteq X[/tex] is closed and connected. If a,b are in F and e > 0, then there exists [tex]a = z_0,z_1,...,z_n = b[/tex] such that [tex]d(z_{k-1},z_k) < e[/tex] for k in {1,...,n}.

I don't see the answer to this off the top of my head.. anyone else see it? Is this a special case of a more general idea?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Connectedness problem

Loading...

Similar Threads - Connectedness problem | Date |
---|---|

A Maximization problem using Euler Lagrange | Feb 2, 2018 |

A Maximization Problem | Jan 31, 2018 |

I A question about Vector Analysis problems | Oct 4, 2017 |

Connectedness of coordinates with one rational point | Dec 15, 2008 |

Local path-connectedness v. path-connectedness | May 12, 2008 |

**Physics Forums - The Fusion of Science and Community**