|
|
|
|
is path connected if is countable
|
(Theorem)
|
|
|
We use
simply as an example; an analogous proof will work for any
.
Proof. Suppose that
 is countable.
 can be written as the disjoint union
where the last two sets are open (as  is continuous), non-empty (as  is onto) and disjoint. Since pathwise connected is the same as connected for Hausdorff spaces, we have that
 is not path connected, contradicting the theorem. 
|
Anyone with an account can edit this entry. Please help improve it!
" is path connected if is countable" is owned by silverfish.
|
|
(view preamble)
Cross-references: Hausdorff spaces, connected, disjoint, open, disjoint union, uncountable, onto, continuous, completes, centre, radius, circle, distance, contain, meet, lines, straight, strategy, point, fix, path connected, subset, countable
This is version 2 of is path connected if is countable, born on 2006-08-09, modified 2006-08-23.
Object id is 8234, canonical name is MathbbR2SetminusCIsPathConnectedIfCIsCountable.
Accessed 774 times total.
Classification:
| AMS MSC: | 54D05 (General topology :: Fairly general properties :: Connected and locally connected spaces ) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|