Search results
Jump to navigation
Jump to search
Page title matches
- In [[topology]], a '''connected space''' is a [[topological space]] in which there is no (non-trivial) [[subset]] The image of a connected space under a [[continuous map]] is again connected.3 KB (379 words) - 13:22, 6 January 2013
- #REDIRECT [[Connected space#Path-connected space]]50 bytes (5 words) - 16:01, 8 December 2008
- 126 bytes (19 words) - 17:26, 8 December 2008
- 265 bytes (32 words) - 17:28, 8 December 2008
- 851 bytes (136 words) - 17:26, 8 December 2008
Page text matches
- #REDIRECT [[Connected space#Path-connected space]]50 bytes (5 words) - 16:01, 8 December 2008
- #REDIRECT [[Connected space#Connected component]]49 bytes (5 words) - 16:00, 8 December 2008
- #REDIRECT [[Connected space#Totally disconnected space]]56 bytes (6 words) - 16:00, 8 December 2008
- #REDIRECT [[Connected space#Hyperconnected space]]50 bytes (5 words) - 03:19, 27 December 2008
- #REDIRECT [[Connected space#Hyperconnected space]]50 bytes (5 words) - 16:55, 31 December 2008
- * An indiscrete space is [[connected space|connected]].766 bytes (106 words) - 16:04, 4 January 2013
- * A discrete space is [[connected space|connected]] if and only if it has at most one point.872 bytes (125 words) - 15:57, 4 January 2013
- In [[topology]], a '''connected space''' is a [[topological space]] in which there is no (non-trivial) [[subset]] The image of a connected space under a [[continuous map]] is again connected.3 KB (379 words) - 13:22, 6 January 2013
- #REDIRECT [[Connected space]]29 bytes (3 words) - 16:01, 8 December 2008
- * [[Connected space|connected]], indeed [[hyperconnected space|hyperconnected]];1,007 bytes (137 words) - 22:52, 17 February 2009
- * [[Connected space|connected]], indeed [[hyperconnected space|hyperconnected]];1,004 bytes (134 words) - 22:48, 17 February 2009
- {{r|Connected space}}523 bytes (68 words) - 16:00, 11 January 2010
- * [[Connected space|Connectedness]].2 KB (265 words) - 07:44, 4 January 2009
- {{r|Connected space}}1 KB (169 words) - 19:54, 11 January 2010
- ; Connectedness: {{Main|Connected space}}<math>X</math> is ''[[Connected space|connected]]'' if given any two ''disjoint'' open sets <math>U</math> and <m ; Path-connectedness: <math>X</math> is ''[[Path-connected space|path-connected]]'' if for any pair <math>x,y \in X</math> there exists a pa15 KB (2,586 words) - 16:07, 4 January 2013