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

Jordan Curve Theorem (Homological Proof)

Research Depth 112 in the knowledge graph ☐ I know this ☆ Set as goal
494prerequisites beneath it
See this on the map →
Singular Homology GroupsThe Mayer-Vietoris Sequence+2 more→
algebraic-topology jordan-curve-theorem separation applications

Core Idea

The Jordan curve theorem states that every simple closed curve in the plane R2 divides it into exactly two connected components (a bounded "inside" and an unbounded "outside"), with the curve as their common boundary. While intuitively obvious, the theorem is notoriously hard to prove for arbitrary continuous curves. The homological proof uses the Mayer-Vietoris sequence and the homology of S2 to establish the separation property, generalizing naturally to the Jordan-Brouwer separation theorem: any embedded Sn-1 in Sn separates Sn into exactly two components.

Explainer

The Jordan curve theorem (JCT) states that if C is a simple closed curve in R2 (the image of a continuous injection gamma : S1 -> R2), then R2 \ C has exactly two connected components, one bounded and one unbounded, and C is the common boundary of both. Equivalently, working in S2 = R2 union {infinity} (the one-point compactification), the complement S2 \ C has exactly two connected components. The theorem was stated by Jordan in 1887, and the first correct proof was given by Veblen in 1905. Modern proofs using homology are considerably cleaner.

The homological approach proves the more general Jordan-Brouwer separation theorem: if h : Sn-1 -> Sn is an embedding (a homeomorphism onto its image), then Sn \ h(Sn-1) has exactly two connected components. The proof uses Alexander duality, which relates the homology of the complement Sn \ K to the cohomology of the compact subspace K. Specifically, H_k(Sn \ K; Z) = Hn-k-1(K; Z) (with Cech cohomology for full generality). For K = h(Sn-1) = Sn-1: H_0(Sn \ Sn-1) = Hn-1(Sn-1) = Z (in reduced homology, this gives exactly two components). The full Alexander duality also shows H_k(Sn \ Sn-1) = 0 for k > 0, so each component is homologically trivial.

An alternative proof uses the Mayer-Vietoris sequence more directly. One version proceeds by induction, building up the simple closed curve from simpler arcs and using Mayer-Vietoris to track how the homology of the complement changes at each stage. The key step is showing that the complement of an arc (homeomorphic image of [0,1]) in Sn is connected and has trivial homology — i.e., arcs do not separate Sn. Then, decomposing S1 into two arcs and applying Mayer-Vietoris to the complement of their union gives the separation result.

The theorem has several important extensions and related results. The Schoenflies theorem (in dimension 2) strengthens the JCT by saying that the closure of each component is homeomorphic to a closed disk D2 — not just that there are two components, but that each component is "shaped like a disk." In higher dimensions (n >= 3), the Schoenflies theorem fails without additional hypotheses: the Alexander horned sphere is an embedding of S2 in S3 whose complement has two components, but one component is not simply connected (and hence not homeomorphic to a ball). This shows that the Jordan-Brouwer separation theorem (homological statement) generalizes cleanly, but the Schoenflies theorem (topological characterization of the components) requires additional conditions (such as the embedded sphere being "locally flat").

The homological proof of the Jordan curve theorem is a triumph of the algebraic topology method: a statement that is "intuitively obvious" for smooth curves but fiendishly difficult for arbitrary continuous curves becomes a straightforward computation when translated into the language of homology and Alexander duality. The proof treats all continuous curves uniformly and generalizes to all dimensions, demonstrating the power of homological methods for establishing topological facts that resist elementary proof techniques.

Practice Questions 4 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 → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Algebraic and Transcendental Elements → Splitting Fields → Finite Fields → Galois Groups → Fundamental Theorem of Galois Theory → Second Isomorphism Theorem for Groups → Direct Products of Groups → Classification of Finite Abelian Groups → Chain Complexes and the Boundary Operator → Exact Sequences in Homological Algebra → The Snake Lemma → Relative Homology and the Long Exact Sequence of a Pair → The Excision Theorem → The Mayer-Vietoris Sequence → Homology of Spheres → Higher Homotopy Groups → The Hurewicz Theorem → Degree Theory for Maps of Spheres → The Borsuk-Ulam Theorem → Jordan Curve Theorem (Homological Proof)

Longest path: 113 steps · 494 total prerequisite topics

Prerequisites (4)

Leads To (0)

No topics depend on this one yet.