-1

How can I show that a set is pathwise-connected?

Tom
  • 91
  • Please read this post and the others there for information on writing a good question for this site. In particular, people will be more willing to help if you [edit] your question to include some motivation, and an explanation of your own attempts. – Lord_Farin Oct 10 '15 at 10:07
  • 1
    I guess this holds only if you drop the word "either" – Hagen von Eitzen Oct 10 '15 at 10:46
  • If you wanted to ask the question with "or" rather than "either - or" (as suggested in the previous comment), then there already are several posts about this question. See here or here. – Martin Sleziak Oct 10 '15 at 11:37

1 Answers1

2

Hint: consider polygonal paths parallel to the axes.

Giovanni
  • 6,569