Jordan Curve Theorem for polygons (Diestel, Theorem 4.1.1)
OpenDiestelGraphTheory.jordan_curve_polygonLet be a polygon, i.e. a union of finitely many straight line segments that is homeomorphic to the unit circle. Then has exactly two regions (classes of points linked by polygonal arcs avoiding ), and
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.
import Mathlib import Definitions.Def_DiestelGraphTheory_PolygonalArc
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 DiestelGraphTheoryRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Work in the plane with its product (= Euclidean) topology.
Let be a polygon, meaning: for some and closed non-degenerate straight segments with , and (subspace topology) is homeomorphic to the Euclidean unit circle .
Let . Its regions are the sets
where an arc between and is a finite union of closed non-degenerate straight segments that is the image of a topological embedding with , .
The theorem asserts both:
- the set of regions has cardinality exactly (in particular it is finite — the cardinality used would be for an infinite set, so the value rules that out);
- for every region of , its topological frontier in equals :
The hypothesis is satisfiable (e.g. the boundary of a triangle).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.