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

Connected Components

College Depth 74 in the knowledge graph ☐ I know this ☆ Set as goal
7topics build on this
344prerequisites beneath it
See this on the map →
Connected Spaces→→Simply Connected Spaces
connected-components decomposition

Core Idea

The connected component of a point x is the maximal connected subset containing x. Connected components partition X into connected pieces. A space is connected iff it has one component. Component spaces are topological invariants; they classify spaces into their 'pieces.' Connected components of the identity in topological groups are normal subgroups.

Explainer

You already know what it means for a topological space to be connected: it cannot be written as a union of two disjoint nonempty open sets. Now the natural follow-up question is: what if the space *isn't* connected? How do we systematically decompose it into its connected "pieces"? That is exactly what connected components formalize.

The connected component of a point x is defined as the union of all connected subsets of X that contain x. This is always well-defined because the union of connected sets that share a common point is itself connected — so the union is still connected, and it is the largest such set. Every point belongs to exactly one component, so the components partition X: every point is in precisely one piece, and no two pieces overlap. If X is already connected, there is just one component — all of X. At the other extreme, if X carries the discrete topology (every subset is open), each singleton {x} is its own component, and the space has as many pieces as it has points.

A useful example: take ℝ and remove the rationals. The resulting space of irrationals is totally disconnected — every connected component is a single point. Between any two irrationals there is a rational, which has been removed, so no interval of irrationals can be connected (any two-point subset can be separated by choosing a rational between them). Compare this to ℝ itself, which is connected (one component), or to a figure-eight graph, which is connected, or to two disjoint circles, which has two components. Counting components is a rough but useful measure of a space's "connectivity."

Connected components are topological invariants: any homeomorphism between spaces must map components of one space bijectively onto components of the other. This makes the number of components a tool for distinguishing spaces — if two spaces have different numbers of components, no homeomorphism between them exists. In topological groups — structures that are simultaneously groups and topological spaces, with the group operations continuous — the connected component of the identity element is always a normal subgroup. This connects topological structure to algebraic structure and is a foundational fact in the theory of Lie groups, where the component of the identity is often the most important part of the group.

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

Longest path: 75 steps · 344 total prerequisite topics

Prerequisites (1)

Leads To (1)