Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Jordan Curve Theorem for polygons (Diestel, Theorem 4.1.1)

Open
DiestelGraphTheory.jordan_curve_polygon

by tiago duque marques · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-theoryplanar-graphs

Let P⊆R2P\subseteq\mathbb R^2P⊆R2 be a polygon, i.e. a union of finitely many straight line segments that is homeomorphic to the unit circle. Then R2∖P\mathbb R^2\setminus PR2∖P has exactly two regions (classes of points linked by polygonal arcs avoiding PPP), and

∂O=Pfor each region O of R2∖P.\partial O = P \quad\text{for each region } O \text{ of } \mathbb R^2\setminus P.∂O=Pfor each region O of R2∖P.

This is the topological fact on which the theory of plane graphs in Diestel's Chapter 4 rests: it is used to show that cycles separate the plane and that edges on cycles lie on the frontier of two faces.

Formalization Note The number of regions is Nat.card of the set of regions, so the statement also asserts that this set is finite.

Preamble
import Mathlib
import Definitions.Def_DiestelGraphTheory_PolygonalArc
Formal statement
namespace DiestelGraphTheory
theorem jordan_curve_polygon (P : Set (ℝ × ℝ)) (hP : IsPolygon P) :
    Nat.card (regions Pᶜ) = 2 ∧ ∀ O ∈ regions Pᶜ, frontier O = P := by sorry
end DiestelGraphTheory
Source
R. Diestel, Graph Theory, 6th ed., Springer GTM 173 (2025), https://diestel-graph-theory.com/basic.html (free preview of Ch. 4-5). Theorem 4.1.1, p. 95.
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Work in the plane R2=R×R\mathbb{R}^2=\mathbb{R}\times\mathbb{R}R2=R×R with its product (= Euclidean) topology.

Let P⊆R2P\subseteq\mathbb{R}^2P⊆R2 be a polygon, meaning: P=S0∪⋯∪Sk−1P=S_0\cup\dots\cup S_{k-1}P=S0​∪⋯∪Sk−1​ for some k∈Nk\in\mathbb{N}k∈N and closed non-degenerate straight segments Si={pi+t(qi−pi):0≤t≤1}S_i=\{p_i+t(q_i-p_i):0\le t\le 1\}Si​={pi​+t(qi​−pi​):0≤t≤1} with pi≠qip_i\ne q_ipi​=qi​, and PPP (subspace topology) is homeomorphic to the Euclidean unit circle {(x,y):x2+y2=1}\{(x,y):x^2+y^2=1\}{(x,y):x2+y2=1}.

Let O=R2∖PO=\mathbb{R}^2\setminus PO=R2∖P. Its regions are the sets

Ra={ b∈O: b=a or there is an arc between a and b contained in O },a∈O,R_a=\{\,b\in O:\ b=a \ \text{or there is an arc between } a \text{ and } b \text{ contained in } O\,\},\qquad a\in O,Ra​={b∈O: b=a or there is an arc between a and b contained in O},a∈O,

where an arc between aaa and bbb is a finite union of closed non-degenerate straight segments that is the image of a topological embedding φ:[0,1]→R2\varphi:[0,1]\to\mathbb{R}^2φ:[0,1]→R2 with φ(0)=a\varphi(0)=aφ(0)=a, φ(1)=b\varphi(1)=bφ(1)=b.

The theorem asserts both:

  1. the set {Ra:a∈O}\{R_a: a\in O\}{Ra​:a∈O} of regions has cardinality exactly 222 (in particular it is finite — the cardinality used would be 000 for an infinite set, so the value 222 rules that out);
  2. for every region RRR of R2∖P\mathbb{R}^2\setminus PR2∖P, its topological frontier in R2\mathbb{R}^2R2 equals PPP:
∂R=P.\partial R = P.∂R=P.

The hypothesis is satisfiable (e.g. the boundary of a triangle).

Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by tiago duque marques · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me