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

Connected Spaces

College Depth 73 in the knowledge graph ☐ I know this ☆ Set as goal
53topics build on this
343prerequisites beneath it
See this on the map →
Open Sets in Topological Spaces→→Connected ComponentsConnected Components+3 more
connected connectivity

Core Idea

A space is connected if it is not the disjoint union of two nonempty open sets. Connected spaces have no gaps. Continuous images of connected spaces are connected.

Explainer

Your study of open sets gave you a language for describing topology in terms of neighborhoods and openness rather than distance. Connectedness is one of the first global properties that language can express — it answers the question: is this space "in one piece"? The formal definition is a negation: a topological space X is connected if it cannot be written as X = U ∪ V where U and V are both open, both nonempty, and disjoint. If such a partition exists, X is disconnected — it has been split into two completely separate open pieces with no overlap and nothing between them.

The real line ℝ with its standard topology is connected. Any open interval (a, b) is connected. But consider ℝ minus a single point: ℝ \ {0} = (−∞, 0) ∪ (0, ∞). These two pieces are both open in ℝ, nonempty, and disjoint — a valid disconnection. The intuition is that removing a single point "cuts" the line into two disconnected halves. The integers ℤ with the discrete topology (where every subset is open) are also disconnected: {0} and ℤ \ {0} form a valid disconnection. In the discrete topology every single-point set is both open and closed, and any space with more than one point is immediately disconnected.

One of the most powerful facts about connectedness is its preservation under continuous maps. If f: X → Y is continuous and X is connected, then f(X) — the image — is connected. This theorem has a celebrated corollary you might recognize from calculus: the intermediate value theorem. The argument runs as follows. The real line segment [0, 1] is connected. A continuous function f: [0, 1] → ℝ maps it to a connected subset of ℝ. Connected subsets of ℝ are intervals (a theorem in its own right). So f([0, 1]) is an interval — meaning f takes all intermediate values between f(0) and f(1). The IVT is just connectedness in disguise.

Understanding what makes a space disconnected often matters as much as knowing when it is connected. A space is disconnected precisely when it has a clopen subset — a set that is simultaneously open and closed, other than the empty set and the whole space. In a connected space, the only clopen sets are ∅ and X itself. This characterization is useful for proofs: to show X is connected, assume U is clopen and show it must be ∅ or X. The connected components — the maximal connected subsets of a space — partition every topological space and generalize this idea to spaces that have multiple pieces.

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

Longest path: 74 steps · 343 total prerequisite topics

Prerequisites (1)

Leads To (5)