A metric space is disconnected if it admits disjoint nonempty open subsets whose union is the whole space.
Equations
Instances For
Definition 2.7: [Connected and disconnected metric spaces] Let (X, d) be a metric space. We
say that X is disconnected iff there exist disjoint non-empty open sets V and W in X such
that V ∪ W = X (equivalently, X contains a non-empty proper subset that is both closed and
open). We say that X is connected iff it is non-empty and not disconnected; the empty set is
declared neither connected nor disconnected.
Equations
Instances For
Definition 2.8: [Connected sets] Let (X, d) be a metric space and let Y ⊆ X. Equip Y
with the subspace metric. The subset Y is called connected if (Y, d_Y) is connected; it is
called disconnected if (Y, d_Y) is disconnected.
Equations
Instances For
A subset is disconnected when its subtype with the subspace metric is a disconnected metric space.
Equations
Instances For
Helper for Theorem 2.8: characterize disconnectedness via preconnectedness of the universe.
Helper for Theorem 2.8: connectedness of a metric space via connectedness of the universal set.
Helper for Theorem 2.8: connectedness of a subset of Real via IsConnected of the set.
Helper for Theorem 2.8: on Real, connectedness of a nonempty set is equivalent to order-connectedness.
Theorem 2.8: Let X be a nonempty subset of the real line. Then the following statements are
equivalent: (a) X is connected; (b) whenever x, y ∈ X and x < y, the interval [x, y] is
contained in X; (c) X is an interval.
Definition 2.9: Let (X, d) be a metric space and let E ⊆ X. The set E is path-connected
iff for every x, y ∈ E there exists a continuous function γ : [0, 1] → E with γ(0) = x and
γ(1) = y.
Equations
Instances For
Helper for Theorem 2.9: IsConnectedSubset is equivalent to IsConnected.
Helper for Theorem 2.9: continuous images preserve connectedness of sets.
Theorem 2.9: [Continuity preserves connectedness] Let f : X → Y be continuous between metric
spaces. If E is a connected subset of X, then f(E) is a connected subset of Y.
Theorem 2.10: [Intermediate value theorem] Let (X, d_X) be a metric space, let f : X → ℝ
be continuous, and let E ⊆ X be connected. For any a, b ∈ E and any y ∈ ℝ satisfying either
f(a) ≤ y ≤ f(b) or f(a) ≥ y ≥ f(b), there exists c ∈ E such that f(c) = y.
Helper for Theorem 2.11: in a discrete subspace, points within distance < 1/2 coincide.
Helper for Theorem 2.11: singleton subsets of a discrete subspace are open.
Theorem 2.11: in the discrete metric, any subset with at least two distinct points is disconnected (for the subspace topology).
Theorem 2.12: Let (X, d) be a connected metric space and let (Y, d_disc) be a metric space
equipped with the discrete metric d_disc(y1,y2)=0 if y1=y2 and d_disc(y1,y2)=1 otherwise.
For a function f : X → Y, the following are equivalent: (1) f is continuous; (2) f is
constant.
Proposition 2.20: every non-empty path-connected set in a metric space is connected.
Theorem 2.13: Let (X, d) be a metric space and let E ⊆ X be nonempty. If E is
path-connected, then the closure closure E of E is connected.
Proposition 2.21: Let (X, d) be a metric space and let E ⊆ X be connected. Then the
closure closure E is connected.
Relation on a metric space given by membership in a common connected subset.
Equations
- ConnectedInSubset X x y = ∃ (C : Set X), IsConnectedSubset X C ∧ x ∈ C ∧ y ∈ C
Instances For
The equivalence class of a point under ConnectedInSubset.
Equations
- ConnectedInSubsetClass X x = {y : X | ConnectedInSubset X x y}
Instances For
Helper for Proposition 2.22: ConnectedInSubset matches membership in the connected component.
Helper for Proposition 2.22: the equivalence class equals the connected component.
Helper for Proposition 2.22: ConnectedInSubset is an equivalence relation.
Proposition 2.22: Let (X, d) be a metric space. Define x ∼ y iff there exists a connected
subset C ⊆ X with x ∈ C and y ∈ C. Then ∼ is an equivalence relation on X. Moreover, for
each x ∈ X, the equivalence class [x] = {y ∈ X : y ∼ x} is connected and closed in X.