A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Connectedness: Definition and Examples

Graduate Depth 76 in the knowledge graph ☐ I know this ☆ Set as goal
27topics build on this
352prerequisites beneath it
See this on the map →
Closed Sets in Topological SpacesOpen Sets in Topological Spaces→→Connected ComponentsPath Connectedness+1 more
connectedness connected-spaces disconnected

Core Idea

A topological space is connected if it cannot be written as a union of two disjoint nonempty open sets. Equivalently, the only subsets that are both open and closed (clopen) are the empty set and the whole space. Connectedness captures the intuitive idea that a space is "in one piece." The real line ℝ is connected, but ℝ minus a point is not—removing any point splits it into two open rays. The continuous image of a connected space is connected, which is why the intermediate value theorem holds: a continuous function on a connected domain cannot skip values. Connectedness is a topological invariant preserved under homeomorphisms.

How It's Best Learned

Prove that ℝ is connected using the least upper bound property, then show ℚ is disconnected by exhibiting a clopen set. Working through these two cases builds a concrete understanding of the definition before moving to more exotic spaces.

Common Misconceptions

Connected does not mean path-connected. The topologist's sine curve is connected but not path-connected. Students also sometimes think removing a point always disconnects a space—this is true for ℝ but false for ℝ² (which remains connected after removing any single point).

Explainer

A topological space X is connected if it cannot be written as the union of two disjoint nonempty open sets. Equivalently, the only subsets of X that are both open and closed (clopen) are ∅ and X itself. If such a nontrivial partition X = U ∪ V with U, V disjoint, nonempty, and open does exist, then X is disconnected, and the pair (U, V) is called a separation or disconnection of X. Connectedness captures the intuition that the space is "in one piece" — there is no way to split it into two topologically isolated halves.

The real line ℝ with the standard topology is connected. The proof uses the least upper bound property: if ℝ = U ∪ V were a separation, take a point a ∈ U and b ∈ V with a < b, and consider s = sup(U ∩ [a, b]). Then s must belong to one of U or V, and in either case a contradiction arises because both U and V are open (an open set around s must extend past the boundary). This argument is essentially why the intermediate value theorem holds: continuous functions on connected spaces cannot "skip" values. If f : [a, b] → ℝ is continuous with f(a) < c < f(b), and f never equals c, then the preimages f⁻¹((−∞, c)) and f⁻¹((c, ∞)) would form a separation of [a, b], contradicting connectedness.

The rational numbers ℚ provide the canonical example of a disconnected space. Since √2 is irrational, the sets U = {q ∈ ℚ : q < √2} and V = {q ∈ ℚ : q > √2} are disjoint, nonempty, and together cover all of ℚ. Both are open in the subspace topology (each is the intersection of ℚ with an open ray in ℝ). So (U, V) is a separation, and ℚ is disconnected. The "hole" at √2 is what allows the split. This illustrates a general pattern: missing points can destroy connectedness. Removing a single point from ℝ disconnects it into two open rays, but removing a single point from ℝ² does not disconnect it — in two dimensions, paths can detour around the missing point.

Connectedness is preserved by continuous maps: if f : X → Y is continuous and X is connected, then f(X) is connected. This is a powerful and broadly applicable principle. It means that topological invariants defined via connectedness (such as the number of connected components) are preserved by homeomorphisms. It also provides a method for proving connectedness: to show a space is connected, exhibit it as the continuous image of a known connected space. Conversely, to show two spaces are not homeomorphic, show they have different numbers of connected components — or that removing a point disconnects one but not the other.

Connected does not imply path-connected. The topologist's sine curve — the closure of {(x, sin(1/x)) : x > 0} in ℝ² — is connected but not path-connected. No continuous path can traverse the infinitely oscillating accumulation near x = 0. In locally path-connected spaces (including most spaces arising in geometry and analysis), connectedness and path-connectedness coincide, but in general topology they are distinct concepts, with path-connectedness being strictly stronger.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Open Sets → Open Sets in Topological Spaces → Closed Sets in Topological Spaces → Connectedness: Definition and Examples

Longest path: 77 steps · 352 total prerequisite topics

Prerequisites (2)

Leads To (3)