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

Connected and Simply Connected Regions

Graduate Depth 74 in the knowledge graph ☐ I know this ☆ Set as goal
29topics build on this
368prerequisites beneath it
See this on the map →
Topology of the Complex Plane→→Analytic ContinuationCauchy's Theorem
topology connectivity simply-connected

Core Idea

A region D is connected if it cannot be split into two disjoint non-empty open sets. A region is simply connected if every closed loop can be continuously shrunk to a point (equivalently, its fundamental group is trivial). Simply connected domains are crucial for Cauchy's theorem and ensuring that complex line integrals are path-independent.

Explainer

From topology of the complex plane, you know that open sets and neighborhoods define the basic structure of ℂ. Connectivity is the first topological property we extract from that structure. A region D ⊆ ℂ is connected if it cannot be partitioned into two disjoint non-empty open subsets — informally, D is "in one piece." Every point in D can be reached from every other point by a path staying inside D. The disk {|z| < 1} is connected; the set {|z| < 1} ∪ {|z| > 2} is not, because the two parts are disconnected from each other with no path between them.

Simple connectivity is a stronger condition. A connected region is simply connected if every closed curve in D can be continuously deformed (shrunk) to a point while staying within D. The intuition is that D has no holes. A disk is simply connected. An annulus {1 < |z| < 2} is connected but not simply connected, because a loop encircling the inner hole cannot be shrunk to a point without crossing the hole. The punctured plane ℂ\{0} is also not simply connected — a circle around the origin cannot be contracted.

Why does simple connectivity matter in complex analysis? When you integrate a complex function along a curve, the value can depend on the path — unless the domain is simply connected. In a simply connected domain, any two paths from point A to point B can be continuously deformed into each other, and for analytic functions, this deformation preserves the integral value. This is the geometric content behind path-independence. Cauchy's theorem (your next topic) will state this precisely: if f is analytic on a simply connected domain D, then ∮_C f(z) dz = 0 for every closed curve C in D. The simply connected condition ensures there is "nothing inside" the curve that could contribute a nonzero integral.

The canonical example where simple connectivity fails — and matters — is f(z) = 1/z on ℂ\{0}. Integrating around a circle enclosing the origin gives 2πi, not 0. The punctured plane has a hole at the origin, and the function 1/z detects that hole through integration. Simple connectivity is the condition that rules out such holes and guarantees that antiderivatives exist globally within the domain — a result that will underpin both Cauchy's integral formula and the definition of the complex logarithm.

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 → Topology of the Complex Plane → Connected and Simply Connected Regions

Longest path: 75 steps · 368 total prerequisite topics

Prerequisites (1)

Leads To (2)