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

Topology of the Complex Plane

Graduate Depth 73 in the knowledge graph ☐ I know this ☆ Set as goal
818topics build on this
367prerequisites beneath it
See this on the map →
The Complex PlaneOpen Sets in Topological Spaces→→Complex Functions and MappingsConnected and Simply Connected Regions
topology open-sets neighborhoods

Core Idea

The complex plane inherits a metric topology from the Euclidean distance d(z, w) = |z - w|. Open sets are unions of open disks; closed sets are complements of open sets. This topology is what makes limits, continuity, and integration rigorous, and it is key for understanding domains of holomorphic functions and the structure of singularities.

Explainer

You already know the complex plane: every complex number z = x + iy corresponds to a point (x, y) in ℝ², and the modulus |z| = √(x² + y²) measures its distance from the origin. The distance between two complex numbers z and w is |z − w|, which is exactly the Euclidean distance between their corresponding points in the plane. This gives ℂ a metric — a notion of "closeness" — and from a metric, you can build a full topology.

An open disk of radius r centered at z₀ is the set D_r(z₀) = {z ∈ ℂ : |z − z₀| < r}, all points strictly within distance r of z₀. A set U ⊆ ℂ is called open if for every point z ∈ U, there exists some r > 0 such that the entire open disk D_r(z) is contained in U — informally, every point of U has some breathing room. The entire plane ℂ and the empty set are both open; the interior of any disk is open; a half-plane like {z : Re(z) > 0} is open. A closed set is one whose complement is open — equivalently, a set that contains all its boundary points. The closed disk {z : |z − z₀| ≤ r} is closed; the real axis {z : Im(z) = 0} is closed.

The reason topology matters for complex analysis is that holomorphic functions are always defined on *open* sets, never just at a single point. When we say "f is holomorphic on D," D must be an open connected set — called a domain. Openness ensures that at every point of D, f has a full neighborhood in which the complex derivative is defined. The requirement that D be connected (cannot be split into two disjoint open pieces) ensures the function hangs together as a single analytic entity; separate components could behave completely independently. Simply connected — roughly, a connected domain with no holes — is even stronger and is the hypothesis needed for Cauchy's theorem to guarantee that all closed-contour integrals vanish.

Topological vocabulary also classifies singularities. If f has a singularity at z₀ (a point where f is not holomorphic), the behavior of f in every open disk around z₀ determines the singularity type — removable, pole, or essential. The concept of a neighborhood (any open set containing z₀) is the language that makes "local behavior near z₀" precise. Every statement like "f is bounded near z₀" or "f extends continuously to z₀" implicitly refers to some neighborhood, and the topology of ℂ is what gives those statements mathematical content.

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

Longest path: 74 steps · 367 total prerequisite topics

Prerequisites (2)

Leads To (2)