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

Simply Connected Spaces

Graduate Depth 82 in the knowledge graph ☐ I know this ☆ Set as goal
6topics build on this
407prerequisites beneath it
See this on the map →
The Fundamental GroupConnected Components+1 more→→Covering Spaces
simply-connected trivial-fundamental-group contractible

Core Idea

A space is simply connected if it is path-connected and its fundamental group is trivial (every loop is homotopic to the constant loop). Intuitively, a simply connected space is path-connected with no 'holes.' Simply connected spaces form an important class in algebraic topology where global properties are heavily constrained by topology.

Explainer

From your prerequisite on the fundamental group, you know that π₁(X, x₀) records the homotopy classes of loops based at x₀ — loops that can be continuously deformed into each other are identified, and the group operation is concatenation of loops. A simply connected space is one where this group is trivial: π₁(X, x₀) = {e}, the group with one element. Combined with path-connectedness, this means every loop in X can be continuously contracted to a point.

The intuition is best built through examples. The plane ℝ² is simply connected: any loop drawn in the plane can be shrunk to a point without leaving the plane. The 2-sphere S² is also simply connected: any loop on a sphere can be pulled to the north pole. But the circle S¹ is not simply connected — a loop that goes around the circle once cannot be contracted to a point without leaving S¹. The fundamental group of S¹ is ℤ, with the integer recording how many times a loop winds around. Similarly, the torus T² = S¹ × S¹ has π₁ = ℤ × ℤ, capturing two independent types of non-contractible loops (going around the hole, and going through the hole). The "holes" that obstruct simple connectivity are 1-dimensional tunnels or punctures — removing a point from ℝ² creates a copy of ℝ² \ {0}, which deformation retracts to S¹ and so has π₁ = ℤ.

A subtlety: simple connectivity is specifically about 1-dimensional holes. A space can be simply connected yet still have interesting higher homotopy groups. The 2-sphere S² is simply connected (no 1-dimensional loops) but has nontrivial π₂ — there are 2-spheres worth of holes. The simply connected condition rules out the "simplest" kind of topological obstruction, which is why it appears as a hypothesis in many theorems. In complex analysis, the proof that every holomorphic function on a simply connected domain has an antiderivative, and Cauchy's theorem that loop integrals vanish, both hinge on simply connectivity: the absence of 1-dimensional holes is exactly what prevents line integrals from being path-dependent.

Simply connected spaces are the "nicely behaved" spaces for much of algebraic topology. Covering space theory is most transparent over a simply connected base: the universal cover of any connected, locally path-connected, semi-locally simply connected space is itself simply connected, and it is the "largest" covering space. The van Kampen theorem, which you will study next, computes fundamental groups by breaking a space into simpler pieces — and the pieces you want to be "invisible" to the fundamental group computation are exactly the simply connected ones. Simply connected spaces also arise in differential geometry (the Poincaré conjecture concerns which 3-manifolds are simply connected and topologically equivalent to the 3-sphere) and physics (gauge theories and the existence of potentials are constrained by the topology of configuration spaces).

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 → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Neighborhood Bases → Continuity in Topological Spaces → Homotopy of Continuous Maps → Homotopy of Paths → Path Connectedness → Homotopy of Paths → The Fundamental Group → Simply Connected Spaces

Longest path: 83 steps · 407 total prerequisite topics

Prerequisites (3)

Leads To (1)