How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
For a topological space the following agree: no separation exists, the only clopen subsets are and , and every continuous map to the two-point discrete space is constant
Statement
Let be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let carry the discrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Call a map constant when for all .
1. The following four conditions are equivalent.
- (a) is connected: no separation of exists (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets).
- (b) The only clopen subsets of are and .
- (c) Every continuous map is constant (Continuity of a map of topological spaces at a point and globally).
- (d) The only subsets of with empty boundary are and (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).
2. For with the subspace topology (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace), is a connected subset of if and only if the only subsets of that are clopen in are and , if and only if every continuous map is constant.
Claim 2 is claim 1 applied to the space and is stated separately because it is the form used in every later proof on this page: a connected set is tested by showing that a continuous two-valued function on it cannot take both values.
Facts & Assumptions
Given: A topological space and the two-point discrete space .
A separation of is a pair of open, nonempty, disjoint sets with ; is connected when none exists; a subset carries the subspace topology and is connected when it is connected as a space (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).
A set is closed exactly when its complement is open, clopen when it is both open and closed; and are clopen (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).
Every subset of is open, hence also closed; the subsets of are , , and (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
A map is continuous exactly when the preimage of every open set is open, equivalently exactly when the preimage of every closed set is closed (For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and , clauses (b) and (c), and Continuity of a map of topological spaces at a point and globally).
and ; is open exactly when and closed exactly when (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).
Proof
If is clopen with and , then and are both open by [A2], both nonempty, disjoint, and their union is ; so is a separation of .
If is continuous, then and are clopen in , since and are both open and closed in by [A3] and preimages of open sets are open and of closed sets closed by [A4].
If is a separation of , then taking the value on and on is a well-defined function, because and are disjoint and cover by [A1]; it is continuous, because the preimages of , , , are , , , , all open by [A1] and [A2], so [A4] and [A3] apply; and it is not constant, because and are nonempty.
For the conditions and " is clopen" agree: by [A5] says , which together with forces , that is open and closed; conversely if is clopen then and .
(a) implies (b): if (b) fails there is a clopen , and step 1.1 turns it into a separation of , so (a) fails.
(b) implies (c): let be continuous; by step 1.2 the set is clopen, hence by (b) it is or ; in the first case takes only the value and in the second only the value , so is constant.
(c) implies (a): if (a) fails there is a separation of , and step 1.3 produces a continuous that is not constant, so (c) fails.
(b) and (d) are the same condition, by step 1.4 applied to each subset of .
Steps 2.1, 2.2 and 2.3 give (a) implies (b) implies (c) implies (a), so (a), (b) and (c) are equivalent, and step 2.4 adjoins (d); this is claim 1.
Claim 2 is claim 1 applied to the topological space , whose connectedness is by [A1] the definition of being a connected subset of .
Remarks
-
Which clause is used where. Clause (c) is the workhorse: it converts a connectedness claim into a statement about functions, so it composes with continuous maps and with unions, which is what makes the theorems after it short. Clause (b) is the one to use when a candidate clopen set is already in hand. Clause (d) is stated because a boundary computation is often the quickest route in a concrete space.
-
Why and not an arbitrary discrete space. Any discrete space with at least two points would serve for clause (c), since a non-constant map into it composes with a retraction onto two of its points. Fixing avoids having to say which two, and every use below needs no more.
-
The empty space satisfies all four clauses. Its only subset is , which is clopen and has empty boundary; the unique map is constant vacuously; and no separation exists, since a separation needs a nonempty piece. So the convention of Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets is consistent with every clause here rather than being an exception to them.
Depends on
- Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- Continuity of a map of topological spaces at a point and globally
- For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and $f(\overline{A}) \subseteq \overline{f(A)}$
- Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace
- Interior, closure, boundary, exterior, derived set and isolated point in a topological space
Used by
- In the subspace of ℝ² made of the vertical unit segments over 1/(n+1) together with the two points (0,0) and (0,1), the component of (0,0) is a singleton while its quasicomponent is {(0,0), (0,1)} Counterexample
- ℝ^ℕ in the box topology is disconnected, the bounded and the unbounded sequences forming a separation, although every factor is connected and the product topology is connected Counterexample
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies placed in the connectedness hierarchy Example
- A connected, locally path-connected space is path-connected, because its path components are open Theorem
- A continuous image of a connected space is connected, and connectedness is a topological property Theorem
- A union of connected subspaces with a point in common is connected, and so is a union of a family in which every member meets a fixed connected member Theorem
- Every quasicomponent is a closed union of components, so each component is contained in a quasicomponent, and the quasicomponents partition the space Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 49 results over 18 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Connected space (Wikipedia) (standard reference, not scraped)