In topology and related branches of mathematics, a connected space is a topological space that cannot be represented as the union of two or more disjoint non-empty open subsets. Connectedness is one of the principal topological properties that are used to distinguish topological spaces.
A subset of a topological space ''X'' is a connected set if it is a connected space when viewed as a subspace of ''X''.
Some related but stronger conditions are path connected, simply connected, and n-connected. Another related notion is locally connected, which neither implies nor follows from connectedness.

Formal definition

A topological space ''X'' is said to be disconnected if it is the union of two disjoint non-empty open sets. Otherwise, ''X'' is said to be connected. A subset of a topological space is said to be connected if it is connected under its subspace topology. Some authors exclude the empty set (with its unique topology) as a connected space, but this article does not follow that practice. For a topological space ''X'' the following conditions are equivalent: #''X'' is connected, that is, it cannot be divided into two disjoint non-empty open sets. #''X'' cannot be divided into two disjoint non-empty closed sets. #The only subsets of ''X'' which are both open and closed (clopen sets) are ''X'' and the empty set. #The only subsets of ''X'' with empty boundary are ''X'' and the empty set. #''X'' cannot be written as the union of two non-empty separated sets (sets for which each is disjoint from the other's closure). #All continuous functions from ''X'' to $\backslash $ are constant, where $\backslash $ is the two-point space endowed with the discrete topology. Historically this modern formulation of the notion of connectedness (in terms of no partition of ''X'' into two separated sets) first appeared (independently) with N.J. Lennes, Frigyes Riesz, and Felix Hausdorff at the beginning of the 20th century. See for details.

Connected components

The maximal connected subsets (ordered by inclusion) of a non-empty topological space are called the connected components of the space. The components of any topological space ''X'' form a partition of ''X'': they are disjoint, non-empty, and their union is the whole space. Every component is a closed subset of the original space. It follows that, in the case where their number is finite, each component is also an open subset. However, if their number is infinite, this might not be the case; for instance, the connected components of the set of the rational numbers are the one-point sets (singletons), which are not open. Let $\backslash Gamma\_x$ be the connected component of ''x'' in a topological space ''X'', and $\backslash Gamma\_x\text{'}$ be the intersection of all clopen sets containing ''x'' (called quasi-component of ''x''.) Then $\backslash Gamma\_x\; \backslash subset\; \backslash Gamma\text{'}\_x$ where the equality holds if ''X'' is compact Hausdorff or locally connected.

Disconnected spaces

A space in which all components are one-point sets is called totally disconnected. Related to this property, a space ''X'' is called totally separated if, for any two distinct elements ''x'' and ''y'' of ''X'', there exist disjoint open sets ''U'' containing ''x'' and ''V'' containing ''y'' such that ''X'' is the union of ''U'' and ''V''. Clearly, any totally separated space is totally disconnected, but the converse does not hold. For example take two copies of the rational numbers Q, and identify them at every point except zero. The resulting space, with the quotient topology, is totally disconnected. However, by considering the two copies of zero, one sees that the space is not totally separated. In fact, it is not even Hausdorff, and the condition of being totally separated is strictly stronger than the condition of being Hausdorff.

Examples

* The closed interval $$

** Path connectedness **

A path-connected space is a stronger notion of connectedness, requiring the structure of a path. A path from a point ''x'' to a point ''y'' in a topological space ''X'' is a continuous function ''ƒ'' from the unit interval ,1to ''X'' with ''ƒ''(0) = ''x'' and ''ƒ''(1) = ''y''. A path-component of ''X'' is an equivalence class of ''X'' under the equivalence relation which makes ''x'' equivalent to ''y'' if there is a path from ''x'' to ''y''. The space ''X'' is said to be path-connected (or pathwise connected or 0-connected) if there is exactly one path-component, i.e. if there is a path joining any two points in ''X''. Again, many authors exclude the empty space (note however that by this definition, the empty space is not path-connected because it has zero path-components; there is a unique equivalence relation on the empty set which has zero equivalence classes).
Every path-connected space is connected. The converse is not always true: examples of connected spaces that are not path-connected include the extended long line ''L''* and the .
Subsets of the real line R are connected if and only if they are path-connected; these subsets are the intervals of R.
Also, open subsets of R^{''n''} or C^{''n''} are connected if and only if they are path-connected.
Additionally, connectedness and path-connectedness are the same for finite topological spaces.

** Arc connectedness **

A space ''X'' is said to be or if any two distinct points can be joined by an , which by definition is a path $f\; :,\; 1\backslash to\; X$ that is also a topological embedding. Explicitly, a path $f\; :,\; 1\backslash to\; X$ is called an if the surjective map $f\; :,\; 1\backslash to\; \backslash operatorname\; f$ is a homeomorphism, where its image $\backslash operatorname\; f\; :=\; f(,\; 1$ is endowed with the subspace topology induced on it by $X.$
Every Hausdorff space that is path-connected is also arc-connected. An example of a space which is path-connected but not arc-connected is provided by adding a second copy $0^$ of $0$ to the nonnegative real numbers $$_{1} space but not a Hausdorff space. The points $0^$ and $0$ can be connected by a path but not by an arc in this space.

** Local connectedness **

A topological space is said to be locally connected at a point ''x'' if every neighbourhood of ''x'' contains a connected open neighbourhood. It is locally connected if it has a base of connected sets. It can be shown that a space ''X'' is locally connected if and only if every component of every open set of ''X'' is open.
Similarly, a topological space is said to be if it has a base of path-connected sets.
An open subset of a locally path-connected space is connected if and only if it is path-connected.
This generalizes the earlier statement about R^{''n''} and C^{''n''}, each of which is locally path-connected. More generally, any topological manifold is locally path-connected.
Locally connected does not imply connected, nor does locally path-connected imply path connected. A simple example of a locally connected (and locally path-connected) space that is not connected (or path-connected) is the union of two separated intervals in $\backslash R$, such as $(0,1)\; \backslash cup\; (2,3)$.
A classical example of a connected space that is not locally connected is the so called topologist's sine curve, defined as $T\; =\; \backslash \; \backslash cup\; \backslash left\backslash $, with the Euclidean topology induced by inclusion in $\backslash R^2$.

** Set operations **

The intersection of connected sets is not necessarily connected.
The union of connected sets is not necessarily connected, as can be seen by considering $X=(0,1)\; \backslash cup\; (1,2)$.
Each ellipse is a connected set, but the union is not connected, since it can be partitioned to two disjoint open sets $U$ and $V$.
This means that, if the union $X$ is disconnected, then the collection $\backslash $ can be partitioned to two sub-collections, such that the unions of the sub-collections are disjoint and open in $X$ (see picture). This implies that in several cases, a union of connected sets necessarily connected. In particular:
# If the common intersection of all sets is not empty ($\backslash bigcap\; X\_i\; \backslash neq\; \backslash emptyset$), then obviously they cannot be partitioned to collections with disjoint unions. Hence ''the union of connected sets with non-empty intersection is connected''.
# If the intersection of each pair of sets is not empty ($\backslash forall\; i,j:\; X\_i\; \backslash cap\; X\_j\; \backslash neq\; \backslash emptyset$) then again they cannot be partitioned to collections with disjoint unions, so their union must be connected.
# If the sets can be ordered as a "linked chain", i.e. indexed by integer indices and $\backslash forall\; i:\; X\_i\; \backslash cap\; X\_\; \backslash neq\; \backslash emptyset$, then again their union must be connected.
# If the sets are pairwise-disjoint and the quotient space $X\; /\; \backslash $ is connected, then must be connected. Otherwise, if $U\; \backslash cup\; V$ is a separation of then $q(U)\; \backslash cup\; q(V)$ is a separation of the quotient space (since $q(U),\; q(V)$ are disjoint and open in the quotient space).
The set difference of connected sets is not necessarily connected. However, if $X\; \backslash supseteq\; Y$ and their difference $X\; \backslash setminus\; Y$ is disconnected (and thus can be written as a union of two open sets $X\_1$ and $X\_2$), then the union of $Y$ with each such component is connected (i.e. $Y\; \backslash cup\; X\_$ is connected for all $i$).
By contradiction, suppose $Y\; \backslash cup\; X\_$ is not connected. So it can be written as the union of two disjoint open sets, e.g. $Y\; \backslash cup\; X\_=Z\_\; \backslash cup\; Z\_$. Because $Y$ is connected, it must be entirely contained in one of these components, say $Z\_1$, and thus $Z\_2$ is contained in $X\_1$. Now we know that:
:$X=\backslash left(Y\; \backslash cup\; X\_\backslash right)\; \backslash cup\; X\_=\backslash left(Z\_\; \backslash cup\; Z\_\backslash right)\; \backslash cup\; X\_=\backslash left(Z\_\; \backslash cup\; X\_\backslash right)\; \backslash cup\backslash left(Z\_\; \backslash cap\; X\_\backslash right)$
The two sets in the last union are disjoint and open in $X$, so there is a separation of $X$, contradicting the fact that $X$ is connected.

** Theorems **

*Main theorem of connectedness: Let ''X'' and ''Y'' be topological spaces and let ''ƒ'' : ''X'' → ''Y'' be a continuous function. If ''X'' is (path-)connected then the image ''ƒ''(''X'') is (path-)connected. This result can be considered a generalization of the intermediate value theorem.
*Every path-connected space is connected.
*Every locally path-connected space is locally connected.
*A locally path-connected space is path-connected if and only if it is connected.
*The closure of a connected subset is connected. Furthermore, any subset between a connected subset and its closure is connected.
*The connected components are always closed (but in general not open)
*The connected components of a locally connected space are also open.
*The connected components of a space are disjoint unions of the path-connected components (which in general are neither open nor closed).
*Every quotient of a connected (resp. locally connected, path-connected, locally path-connected) space is connected (resp. locally connected, path-connected, locally path-connected).
*Every product of a family of connected (resp. path-connected) spaces is connected (resp. path-connected).
*Every open subset of a locally connected (resp. locally path-connected) space is locally connected (resp. locally path-connected).
*Every manifold is locally path-connected.
*Arc-wise connected space is path connected, but path-wise connected space may not be arc-wise connected
*Continuous image of arc-wise connected set is arc-wise connected.

Graphs

Graphs have path connected subsets, namely those subsets for which every pair of points has a path of edges joining them. But it is not always possible to find a topology on the set of points which induces the same connected sets. The 5-cycle graph (and any ''n''-cycle with ''n'' > 3 odd) is one such example. As a consequence, a notion of connectedness can be formulated independently of the topology on a space. To wit, there is a category of connective spaces consisting of sets with collections of connected subsets satisfying connectivity axioms; their morphisms are those functions which map connected sets to connected sets . Topological spaces and graphs are special cases of connective spaces; indeed, the finite connective spaces are precisely the finite graphs. However, every graph can be canonically made into a topological space, by treating vertices as points and edges as copies of the unit interval (see topological graph theory#Graphs as topological spaces). Then one can show that the graph is connected (in the graph theoretical sense) if and only if it is connected as a topological space.

** Stronger forms of connectedness **

There are stronger forms of connectedness for topological spaces, for instance:
* If there exist no two disjoint non-empty open sets in a topological space, ''X'', ''X'' must be connected, and thus hyperconnected spaces are also connected.
* Since a simply connected space is, by definition, also required to be path connected, any simply connected space is also connected. Note however, that if the "path connectedness" requirement is dropped from the definition of simple connectivity, a simply connected space does not need to be connected.
*Yet stronger versions of connectivity include the notion of a contractible space. Every contractible space is path connected and thus also connected.
In general, note that any path connected space must be connected but there exist connected spaces that are not path connected. The deleted comb space furnishes such an example, as does the above-mentioned topologist's sine curve.

** See also **

*Connected component (graph theory)
*Connectedness locus
*Extremally disconnected space
*Locally connected space
*''n''-connected
*Uniformly connected space
*Pixel connectivity

References

Further reading

* * * * . {{DEFAULTSORT:Connected Space Category:General topology Category:Properties of topological spaces

Formal definition

A topological space ''X'' is said to be disconnected if it is the union of two disjoint non-empty open sets. Otherwise, ''X'' is said to be connected. A subset of a topological space is said to be connected if it is connected under its subspace topology. Some authors exclude the empty set (with its unique topology) as a connected space, but this article does not follow that practice. For a topological space ''X'' the following conditions are equivalent: #''X'' is connected, that is, it cannot be divided into two disjoint non-empty open sets. #''X'' cannot be divided into two disjoint non-empty closed sets. #The only subsets of ''X'' which are both open and closed (clopen sets) are ''X'' and the empty set. #The only subsets of ''X'' with empty boundary are ''X'' and the empty set. #''X'' cannot be written as the union of two non-empty separated sets (sets for which each is disjoint from the other's closure). #All continuous functions from ''X'' to $\backslash $ are constant, where $\backslash $ is the two-point space endowed with the discrete topology. Historically this modern formulation of the notion of connectedness (in terms of no partition of ''X'' into two separated sets) first appeared (independently) with N.J. Lennes, Frigyes Riesz, and Felix Hausdorff at the beginning of the 20th century. See for details.

Connected components

The maximal connected subsets (ordered by inclusion) of a non-empty topological space are called the connected components of the space. The components of any topological space ''X'' form a partition of ''X'': they are disjoint, non-empty, and their union is the whole space. Every component is a closed subset of the original space. It follows that, in the case where their number is finite, each component is also an open subset. However, if their number is infinite, this might not be the case; for instance, the connected components of the set of the rational numbers are the one-point sets (singletons), which are not open. Let $\backslash Gamma\_x$ be the connected component of ''x'' in a topological space ''X'', and $\backslash Gamma\_x\text{'}$ be the intersection of all clopen sets containing ''x'' (called quasi-component of ''x''.) Then $\backslash Gamma\_x\; \backslash subset\; \backslash Gamma\text{'}\_x$ where the equality holds if ''X'' is compact Hausdorff or locally connected.

Disconnected spaces

A space in which all components are one-point sets is called totally disconnected. Related to this property, a space ''X'' is called totally separated if, for any two distinct elements ''x'' and ''y'' of ''X'', there exist disjoint open sets ''U'' containing ''x'' and ''V'' containing ''y'' such that ''X'' is the union of ''U'' and ''V''. Clearly, any totally separated space is totally disconnected, but the converse does not hold. For example take two copies of the rational numbers Q, and identify them at every point except zero. The resulting space, with the quotient topology, is totally disconnected. However, by considering the two copies of zero, one sees that the space is not totally separated. In fact, it is not even Hausdorff, and the condition of being totally separated is strictly stronger than the condition of being Hausdorff.

Examples

* The closed interval $$

Graphs

Graphs have path connected subsets, namely those subsets for which every pair of points has a path of edges joining them. But it is not always possible to find a topology on the set of points which induces the same connected sets. The 5-cycle graph (and any ''n''-cycle with ''n'' > 3 odd) is one such example. As a consequence, a notion of connectedness can be formulated independently of the topology on a space. To wit, there is a category of connective spaces consisting of sets with collections of connected subsets satisfying connectivity axioms; their morphisms are those functions which map connected sets to connected sets . Topological spaces and graphs are special cases of connective spaces; indeed, the finite connective spaces are precisely the finite graphs. However, every graph can be canonically made into a topological space, by treating vertices as points and edges as copies of the unit interval (see topological graph theory#Graphs as topological spaces). Then one can show that the graph is connected (in the graph theoretical sense) if and only if it is connected as a topological space.

References

Further reading

* * * * . {{DEFAULTSORT:Connected Space Category:General topology Category:Properties of topological spaces