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

Connected Components

Graduate Depth 77 in the knowledge graph ☐ I know this ☆ Set as goal
6topics build on this
354prerequisites beneath it
See this on the map →
Connected SpacesConnectedness: Definition and Examples→→Connectivity and Connected ComponentsSocial Network Analysis
components equivalence-classes decomposition

Core Idea

The connected component of a point x is the largest connected subset containing x—formally, the union of all connected subsets that contain x. Connected components partition any topological space into maximal connected pieces, and they are always closed sets. This decomposition reveals the global structure of a space: a space is connected if and only if it has exactly one component. In totally disconnected spaces like the Cantor set, every component is a single point. The number and nature of connected components provide a coarse but powerful topological invariant.

How It's Best Learned

Draw examples: identify the components of the real line minus a few points, then of a union of disjoint circles. Move to the topologist's sine curve to see that components can be connected but not path-connected, sharpening the distinction.

Common Misconceptions

Students often assume connected components must be open—they are always closed but not necessarily open. Also, path-components and connected components can differ; path-connectedness is strictly stronger than connectedness.

Explainer

Given a topological space X, the connected component of a point x is the largest connected subset of X that contains x. Formally, it is the union of all connected subsets of X that contain x. Since any union of connected sets sharing a common point is connected, this union is itself connected and is maximal: no strictly larger connected subset of X contains x. Every point of X belongs to exactly one connected component, and distinct connected components are disjoint, so the connected components partition X into maximal connected pieces.

Connected components are always closed sets. To see why: the closure of a connected set is connected, so if C is the connected component of x, then the closure cl(C) is a connected set containing x. By maximality of C, we must have cl(C) ⊆ C, which means C = cl(C) — the component is closed. However, connected components are not necessarily open. In the rational numbers ℚ with the subspace topology from ℝ, every connected component is a single point (since between any two rationals lies an irrational, allowing a disconnection). These singletons are closed but not open in ℚ. Components are guaranteed to be open only when the space is locally connected — a separate condition beyond basic connectedness.

The component decomposition reveals the global structure of a space at a coarse level. A space is connected if and only if it has exactly one component. The real line minus two points, ℝ \ {0, 1}, has three components: (−∞, 0), (0, 1), and (1, ∞). At the other extreme, a totally disconnected space like the Cantor set has every component equal to a single point — the space is maximally fragmented. The number and nature of connected components form a topological invariant: homeomorphic spaces have the same component structure.

It is important to distinguish connected components from path-components. The path-component of x is the set of all points that can be joined to x by a continuous path. Every path-component is contained in a connected component, and in most familiar spaces (manifolds, CW complexes, locally path-connected spaces) the two notions coincide. But they can diverge: the topologist's sine curve — the closure of the graph of sin(1/x) for x > 0 — is connected (one connected component) but has two path-components, because no continuous path can cross the infinitely oscillating accumulation at the y-axis. This distinction matters in algebraic topology, where path-connectedness rather than connectedness is typically the relevant condition.

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 → Connected Components

Longest path: 78 steps · 354 total prerequisite topics

Prerequisites (2)

Leads To (2)