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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrincipal Ideal DomainsUnique Factorization DomainsPolynomial RingsField ExtensionsAlgebraic and Transcendental ElementsSplitting FieldsFinite FieldsGalois GroupsFundamental Theorem of Galois TheorySecond Isomorphism Theorem for GroupsDirect Products of GroupsClassification of Finite Abelian GroupsChain Complexes and the Boundary OperatorExact Sequences in Homological AlgebraThe Snake LemmaRelative Homology and the Long Exact Sequence of a PairThe Excision TheoremThe Mayer-Vietoris SequenceHomology of SpheresHigher Homotopy GroupsThe Hurewicz TheoremDegree Theory for Maps of SpheresThe Borsuk-Ulam TheoremJordan Curve Theorem (Homological Proof)

Longest path: 113 steps · 494 total prerequisite topics

Prerequisites (4)

Leads To (0)

No topics depend on this one yet.