Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Jordan–Schönflies extension for plane curves

Statement

Assume the Axiom of Choice. For Jordan curves C and C′ in R2, every homeomorphism h:C→C′ extends to a homeomorphism H:R2→R2 that maps the bounded and unbounded complementary components of C to the corresponding components of C′. In particular each closed bounded Jordan region is a closed 2-disk.

Facts & Assumptions

Given: Jordan curves C,C′⊂R2 with bounded complementary components D and D′; the square Q=[−1,1]2 with boundary S=∂Q; a homeomorphism u:C→S; and the Axiom of Choice.

[A1]

The Axiom of Choice is The Axiom of Choice: every family of nonempty sets has a choice function, equivalently every product of nonempty sets is nonempty. Full AC yields the countable instance ACω and the finite-multiple instance ACω,fin (AC implies DC implies countable choice). The exact uses below are: the Jordan–Brouwer separation theorem [F1]; the countable selection, one for each q∈Q2∩D, of a nearest point a(q)∈C, which supplies the countable anchor set A of step 1.2; the countable instance of the sequential criterion for continuity quoted in [L2] and applied in step 10.1; and the countable and finite-multiple selections of the refinement scheme of step 7.1. The enumerations of Q2, of its subset Q2∩D and of the countable anchor set A are fixed in advance, and the per-stage anchors are chosen as the first elements of that fixed enumeration, so the scheme itself introduces no further selection.

[F1]

Jordan–Brouwer separation: under AC, for an embedding Sn−1↪Rn with n≥2 there are exactly two complementary components, one bounded and one unbounded, with the curve as their common boundary (Jordan–Brouwer separation).

[F3]

Hybrid finite plane graph facts: if a finite 2-connected graph is drawn in the plane by simple arcs meeting only at common endpoints, one cycle is drawn as a Jordan curve and every other edge is a simple polygonal arc whose relative interior lies in the bounded component of the complement of that cycle, then every component of the drawing's complement has a graph cycle as its boundary and V−E+F=2 (Finite plane graph ear and face facts).

[F4]

Every finite connected graph has a spanning tree, and every finite 2-connected graph with at least three vertices has an ear decomposition starting from any specified cycle (Finite plane graph ear and face facts).

[L2]

Metric and continuity conventions: continuity of maps of topological spaces (Continuity of a map of topological spaces at a point and globally); homeomorphisms and embeddings (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological); open balls (Open ball, closed ball and sphere in a metric space) and the Euclidean spaces Rn with their metrics (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it); continuous images of compact sets are compact (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism); sums, products, absolute values, maxima and quotients of continuous real functions are continuous (Sums, products, absolute values, finite maxima and minima, and quotients of continuous real-valued maps on a topological space are continuous where defined); the radial normalisation x↦x/∥x∥2 is continuous off the origin (Radial normalisation x↦x/∥x∥2 is continuous on Rn∖{0}); maps on a finite closed cover that agree on overlaps paste (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous); unit spheres Sn−1 and closed balls (Euclidean spheres and closed balls as subspaces of Rn); projections of a product are continuous and a map into a product is continuous once its components are (A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice); and for metric spaces sequential continuity is equivalent to continuity (Metric continuity characterisations, with countable choice for the sequential converse), the latter under the countable instance of AC declared in [A1].

[L3]

A region of the complement of A⊆R2 is a connected component of R2∖A, and its frontier is the intersection of the closures of the set and its complement (Regions of the complement of a planar set and their frontiers); every connected component of an open subset of Rn is open in Rn and polygonally connected (Every connected component of an open subset of Rn is open and polygonally connected).

[L4]

Polygonal arcs are images of injective piecewise affine parametrizations of [0,1], polygons are simple closed polygonal curves, and polygonal paths and polygonal connectedness are the corresponding notions (Polygonal arcs and polygons as non-self-intersecting finite unions of line segments in R2, Polygonal paths and polygonally connected subsets of Rn); every straight segment gives a continuous polygonal path (A finite concatenation of straight segments in Rn is a continuous path).

Proof

technique · direct

Given: Jordan curves C,C′ with bounded complementary components D,D′, the square Q=[−1,1]2 with boundary S, a homeomorphism u:C→S, and AC.

1.1A1F1L1L2

Assume AC [A1]. By [F1] the complement of the Jordan curve C has exactly two components, the bounded D and the unbounded E, with Fr⁡(D)=Fr⁡(E)=C, and D‾=D∪C is closed and bounded, hence compact by [L1]; write D′ for the bounded component of R2∖C′. Put Q=[−1,1]2 and S=∂Q. Reduction: it suffices to prove that for every Jordan curve C and every homeomorphism u:C→S there is a homeomorphism u‾:D‾→Q with u‾∣C=u. Indeed, a Jordan curve is by definition the image of an embedding γ of the unit circle [L2], so γ−1:C→S1 is a homeomorphism [L2]; the map g(x)=x/max⁡(∣x1∣,∣x2∣) carries S1 homeomorphically onto S, because its two components are quotients of continuous functions by the nonvanishing continuous function x↦max⁡(∣x1∣,∣x2∣) [L2], it maps S1 onto S, and its inverse is the radial normalisation y↦y/∥y∥2 restricted to S, continuous by [L2]; hence φ=g∘γ−1:C→S is a homeomorphism. Given h:C→C′, apply the square statement to u=ψ∘h:C→S and to ψ:C′→S, where ψ is any homeomorphism onto S, obtaining homeomorphisms Φ:D‾→Q and Ψ:D′‾→Q; then Ψ−1∘Φ is a homeomorphism D‾→D′‾ agreeing with h on C. The second clause follows from the same reduction with C′=S1: every closed bounded Jordan region D‾ is then homeomorphic to the closed unit disk B‾2(0,1).

1.2A1F1L1L2L3L4L5

For q∈D the continuous function y↦∣q−y∣ on the nonempty compact set C attains a minimum at some a(q)∈C [L1]; then r:=∣q−a(q)∣>0 because q∉C, and B(q,r)∩C=∅; the convex ball B(q,r) is connected and contains q∈D, so it lies in the single component of R2∖C containing q, namely D. Call p∈C strongly accessible if B(q,r)⊆D for some q∈D with ∣q−p∣=r; every nearest point a(q) is strongly accessible, and if p=a(q), v=(q−p)/r and w is a unit vector with ⟨v,w⟩>1/2, then for every 0<t<r one has ∣p+tw−q∣2=r2+t2−2tr⟨v,w⟩<r2+t(t−r)<r2, so the whole open cone of short segments p+tw lies in B(q,r)⊆D and meets C only at p. Let A:={a(q):q∈Q2∩D}, a countable set. A is dense in C: given p∈C and ε>0, choose y∈D with ∣y−p∣<ε/4 (possible since p∈Fr⁡(D) and D is open) and then q∈Q2 with ∣q−y∣<ε/4 by density of the rationals in each coordinate [L5]; then ∣p−q∣<ε/2 and ∣p−a(q)∣≤∣p−q∣+∣q−a(q)∣≤2∣p−q∣<ε, because a(q) is nearest to q. Finally, for distinct a,b∈A the two cone segments at a and b have interior points in the region D, which is polygonally connected [L3], so joining those interior points by a polygonal arc and extracting a simple subpath [L4] produces a simple polygonal arc P with endpoints a,b, relative interior in D and P∩C={a,b}.

1.3F1L1L2L3L4

Crosscut splitting. Let J be a Jordan curve with bounded region V, and let P be a simple polygonal arc with distinct endpoints p,q∈J and relative interior in V; let A1,A2 be the two closed arcs of J from p to q and put Ji=Ai∪P. Then R2∖(J∪P) has exactly three regions, with frontiers J,J1,J2; in particular V∖P has exactly two components, with frontiers J1 and J2. Proof. Each Ji is a Jordan curve: pasting parametrizations of Ai and P at their common endpoints gives a continuous bijection from the circle onto Ji, which is a homeomorphism because the circle is compact and Ji is a Hausdorff subspace of the plane, and Ji is compact and hence closed [L1, L4]. Let W be the region of R2∖J other than V, and let Zi be the region of R2∖Ji containing W, whose companion region Yi has frontier Ji by [F1]. Every point of J∖Ji has a ball missing Ji and meeting W, hence lies in Zi; so Yi misses J, and being connected it lies in a single region of R2∖J, necessarily V because it is not W. For each i, the frontier of Yi contains the open arc Ai∖{p,q}. At a point of that arc away from P, a small ball misses J3−i and meets W, hence meets Z3−i. Since the ball also meets Yi, and Yi avoids J3−i and is connected, Yi⊆Z3−i. Thus Y1∩Y2=∅. At a point x interior to P take a small ball B⊆V meeting J∪P only in the local subarc of P. If x lies in a straight segment, this is a diameter; if x is a polygonal bend, an explicit piecewise-linear local homeomorphism straightens its two incident rays to a diameter. The two resulting local sectors of B∖P are connected and avoid J∪P, and for each i the two local sectors lie one in Zi and one in Yi, since x lies in the frontier of both Zi and Yi; no local sector lies in both Y1 and Y2, so one local sector lies in Y1 and the other in Y2. Every component N of V∖P meets Y1∪Y2: otherwise its closure in V would be disjoint from P∖{p,q}, making N closed in V and, being a component of the open set V∖P, also open in R2 hence in V [L3], so N=V, contradicting that the nonempty set P∖{p,q} lies in V and misses N; choose x∈cl⁡V(N)∩(P∖{p,q}) and take a fresh local ball B centered at x as above; then N meets B∖P⊆Y1∪Y2. Finally each Yi is closed in V∖P, since its frontier is Ji, so a connected N meeting Y1∪Y2 lies in Y1 or in Y2; hence V∖P=Y1⊔Y2 is exactly the two components, while W is a region of R2∖(J∪P) with frontier J, so there are exactly three regions with the stated frontiers.

2.1step 1.2step 1.3L2L3L4

Initial matched pair. Fix C and u. Choose a,b∈A in the relative interiors of two arcs of C cut out by the four points u−1 of the corners of Q, such that u(a) and u(b) lie in the relative interiors of two opposite sides of S; this is possible because A is dense in C (step 1.2) and only finitely many points are forbidden. Subdivide C at those six points and S at the four corners together with u(a),u(b), matching the subdivisions by u. By step 1.2 there is a polygonal crosscut P of D from a to b; let P′ be the closed straight segment from u(a) to u(b), whose relative interior P∘′ lies in Q∘ because the endpoints are distinct boundary points of the convex square Q lying on opposite sides. By step 1.3 applied to (C,P) and to (S,P′), the closed domains D‾ and Q are each divided into exactly two closed cells whose common part is P, respectively P′; writing A1,A2 for the two boundary paths from a to b on C and R1,R2 for the two components of D∖P, one has Ri‾∩C=Ai, and for the corresponding sides Ri′ of Q∖P′ one has Ri′‾∩S=u(Ai). A cellulation of D‾, respectively of Q, is a finite partition of the closed domain into cells --- vertices (single points), edges (open arcs) and faces (open connected sets) --- obtained from this initial decomposition by finitely many applications of the constructors (i) edge subdivision: insert a point in the relative interior of an edge, replacing the edge by the two edges and the new vertex; and (ii) face split: choose a face R and two distinct vertices on its boundary, insert a polygonal arc with endpoints at those vertices and relative interior in R, and replace R by that interior and the two components the arc cuts off. Cells contained in C, respectively S, are outer and the remaining cells inner; every inner edge is a simple polygonal arc with relative interior in D, respectively Q∘; the carrier of a point is the cell containing it; σ⪯τ means σ⊆τ‾; and the closed star St⁡(σ) is the union of the closures of the cells τ with σ⪯τ. A matched pair is a cellulation of D‾, a cellulation of Q, and a homeomorphism g of the two 1-skeletons carrying every vertex and edge to its counterpart and restricting to u on C; a matched cellulation is a matched pair whose two skeletons are 2-connected and whose inner parts ∣G∣∖C and ∣G′∣∖S are connected. To apply a constructor to a matched pair is to apply it simultaneously on both sides: a subdivision inserts corresponding interior points via g, hence via u on outer edges, and a split inserts corresponding crosscuts between corresponding vertices and extends g over them. The initial pair is a matched cellulation: its skeleton is the six-vertex boundary cycle together with the inner edge P, a theta graph with branch vertices a,b and three internally disjoint arcs, hence 2-connected with connected inner part, and g is u on C and any homeomorphism P→P′ fixing endpoints.

3.1step 1.3step 2.1L1L2L3L4

Cell geometry. For every cellulation built from the initial decomposition of step 2.1 by the constructors: (a) the open cells partition the closed domain and every closed cell is the disjoint union of the open cells it contains; (b) if an open cell meets the closure of a cell then it is contained in that cell; (c) every face is the interior of a Jordan curve assembled from closed cells --- its boundary cycle --- every boundary cycle contains an inner edge, and every outer edge lies on exactly one boundary cycle; (d) distinct faces are incomparable under ⪯. Proof by induction along the constructor sequence. At the initial stage the closure identities Ri‾=Ri∪P∪Ai supplied by step 1.3 give (a)--(c): the cells below Ri are the cells of the path Ai and of the crosscut P, the cells below an edge are its two endpoints, the two boundary paths meet only in a and b, every boundary cycle contains the inner edge P or P′, and each outer edge lies on exactly one boundary path. An edge subdivision replaces e‾ by e1‾∪e2‾, which meet in the new vertex; the only old closed cells that can contain a new cell are e‾ and the cells τ‾ with e⪯τ, by the old frontier property, so (a) and (b) persist, no face changes, and a boundary cycle that contained e as an inner edge retains an inner subedge. A face split applies step 1.3 inside the Jordan region bounded by the face's boundary cycle: if the inserted crosscut has endpoints x,y splitting that cycle into the two closed paths B1,B2, then the closure identities Vi‾=Vi∪P0∪Bi give (a)--(c) for the new cells, each of the two new boundary cycles contains the inner crosscut P0, and every outer edge of the split face lies on exactly one of B1,B2. For (d) suppose R⪯T for distinct faces; then R is disjoint from T by (a), so R⊆T‾∖T, and every point of the Jordan curve T‾∖T is a limit of points of the nonempty open set T, so R would meet T, a contradiction.

4.1step 2.1step 3.1L2L3

Order, parents, stars and correspondence. (a) ⪯ is a partial order. (b) Every cell produced by a constructor lies in the closure of a unique ⪯-least old cell, its parent: for a subdivision the subdivided edge, for its three new cells; for a split the split face, for the crosscut's interior and the two new faces; each unchanged cell is its own parent. (c) A closed cell meets C, respectively S, if and only if it has an outer subcell. (d) In a matched pair the cell bijection σ↦σ′ preserves ⪯, outerness and parents, so that σ‾ meets C exactly when σ′‾ meets S, and so that St⁡(σ)∩St⁡(τ)≠∅ exactly when St⁡(σ′)∩St⁡(τ′)≠∅. (e) Every cell is a subcell of a face, so St⁡(σ) is the union of the closures of the faces above σ; if each of those closed faces has diameter <η, then diam⁡St⁡(σ)<2η. (f) Parents preserve ⪯, so St⁡(σ+)⊆St⁡(σ) whenever σ is the parent of σ+, and the parent of the carrier of a point is its carrier at the previous stage: the closed stars of a fixed point shrink weakly under refinement. Proof. (a) Reflexivity and transitivity are immediate, and antisymmetry follows as in step 3.1(d): if σ≠τ with σ⪯τ⪯σ then each lies in the closure of the other minus itself, which is impossible for a vertex, because that set is empty; for an edge, because only vertices lie in its closure minus itself, and those are excluded by the vertex case; and for two distinct faces, by step 3.1(d). (b) As in step 3.1, every old closed cell other than the subdivided edge, respectively the split face, is a union of other open cells and hence disjoint from the open cell containing the new cells, so the parent relations are exactly those listed. (c) Inner vertices and edges lie in D, respectively Q∘, and faces are disjoint from C and S, so a closed cell meeting C, respectively S, contains a point whose carrier is outer, and the frontier property makes that carrier a subcell; the converse is immediate. (d) Each constructor creates its new cells with the same subcell relations and the same outer status on both sides, and the parent rule of (b) is combinatorial, so induction along the shared constructor sequence proves the preservation; for the star criterion, a point of St⁡(σ)∩St⁡(τ) lies in α‾∩β‾ for cells α⪰σ and β⪰τ, and its carrier is by (b) a common subcell of α and β, so the corresponding target cells have a common subcell and the target stars meet, and symmetrically. (e) Every cell is a subcell of a face: initially every cell lies in R1‾ or R2‾; a subdivision's new cells lie in the closure of the subdivided edge, which is below a face by the induction hypothesis; and a split's new cells are the crosscut, below both new faces, and the two new faces. If τ⪰σ and τ⪯R with R a face, then τ‾⊆R‾, so the star is the union of the closures of the faces above σ; every such closed face contains σ, so choosing x∈σ shows that any two points of the star are within 2η of each other through x. (f) In each constructor all new cells share one parent and every surviving cell is its own parent; a relation between two new cells holds on both sides, relations with surviving cells are inherited, and if an old σ lies below a new τ then τ‾⊆ρ‾ for the parent ρ, so σ⪯ρ, while a new cell below a surviving old cell is excluded by (b). For the carriers, if x has carrier σ before and σ+ after a constructor, then σ+⊆σ‾ by (b), so par⁡(σ+)⪯σ, while x∈par⁡(σ+)‾ forces σ⪯par⁡(σ+); antisymmetry gives equality.

5.1step 3.1step 4.1L1L2L4

Local sectors and face access. Let G be the skeleton of one of our cellulations, and let x∈∣G∣ be a point not on C when G is the source skeleton, and an arbitrary point of ∣G∣ when G is the target skeleton. A small closed disk B about x meets G in finitely many straight radial segments with pairwise distinct directions: this is clear for the finitely many polygonal arcs making up G that pass through x, while the arcs not through x are avoided by a small disk, and in the source case B can moreover be chosen meeting C in the empty set because C is compact and disjoint from a neighbourhood of x [L1]. Hence B∖G is a union of open convex sectors, each connected and disjoint from G, and each sector lies in a single face. If F is a face whose closure contains x, then some sector meets F, and a short segment from x into that sector meets G only at x and otherwise lies in F; in the target case the sector is connected, meets Q∘, which is a union of faces, and misses S, hence lies in Q∘ and in F. Consequently every face is accessible from each of its boundary points by a straight polygonal segment, at every boundary point off C on the source side and at every boundary point including points of S on the target side.

6.1step 1.2step 1.3step 3.1step 4.1step 5.1F3F4L1L3L4

Finite transfer. Let (G0,G0′) be a matched cellulation with skeleton homeomorphism g. (a) If H⊇G0 is a finite 2-connected plane graph with outer cycle C, all new edges polygonal with relative interiors in D, and ∣H∣∖C connected, then the refinement G0→H can be reproduced on the target: there is a matched cellulation extending the pair whose source skeleton is H. (b) Symmetrically from the target side, provided every new inner edge meeting S has exactly one endpoint on S, at a fresh point of u(A) that becomes a boundary vertex with exactly one incident new inner edge. Proof. First pass to a common subdivision so that the old skeleton is a subgraph of the new one, transferring each new point on an old edge by the edge parametrization, which is u on outer edges; in (b) every fresh anchor is inserted into the outer cycle first. Repeat [F4] proof step 1.2 from the whole current 2-connected subgraph G0: an unused component with only one attachment would make that attachment a cut vertex of H, so a shortest path through it between two distinct attachments is an ear; an unused edge whose endpoints already lie in G0 is a one-edge ear. Each addition consumes an unused edge, hence a finite rooted-ear decomposition starts at G0. We transfer those ears one at a time; an ear is inserted by a single face split preceded by at most two subdivisions, to make its endpoints vertices, and followed by one subdivision for each internal vertex, so every intermediate stage satisfies steps 3.1 and 4.1 whether or not its inner part is momentarily disconnected. The relative interior of the next ear Q0 is connected and disjoint from the current skeleton, hence lies in a single current face F by step 3.1(a); the current source and target graphs satisfy the hybrid hypothesis of [F3], since one cycle is drawn as the Jordan curve C, respectively the polygon S, and every other edge is a simple polygonal arc with relative interior in the bounded component, so [F3] certifies that the boundary of F is a graph cycle, a Jordan curve containing the ear's endpoints v,w; let F∗ be the corresponding face on the other side. In case (a) the points v∗,w∗ corresponding to v,w lie on the skeleton off S or on S as images of boundary vertices already present, and are accessible from F∗ by step 5.1. In case (b) an endpoint of the reproduced crosscut is either an inner skeleton point, accessible by step 5.1, or a fresh anchor a∈A, where the open cone of short straight segments from step 1.2 can be shrunk, using that the rest of the skeleton is at positive distance from a [L1], until its short segments avoid the rest of the skeleton and lie in the unique current source face incident with a: that face is F∗, because a was inserted as a boundary vertex incident with exactly one face, every outer edge lying on exactly one boundary cycle by step 3.1(c), and a is an endpoint of no later splitting crosscut, since all later new inner edges meeting C are spokes at fresh anchors. Now join v∗,w∗ by a polygonal crosscut of F∗, which exists because F∗ is a region and hence polygonally connected [L3], and use step 1.3 to split both faces by the two corresponding crosscuts, extending g over Q0 by a homeomorphism fixing the endpoints. After the last ear the prescribed-side skeleton is the given graph, and the reproduced skeleton is 2-connected, because it grew from the 2-connected old skeleton by subdivisions and by adding paths with distinct endpoints, which preserves 2-connectivity; it also has connected inner part, which is homeomorphic to ∣H∣∖C under g. Hence the final pair is a matched cellulation.

7.1A1step 1.2step 1.3step 4.1step 6.1F4L1L5

The refinement scheme. Fix an enumeration of Q2 in which every point occurs infinitely often and let B be the set of its members lying in D, again enumerated with every point occurring infinitely often; put εn=2−n, r(p)=dist⁡∞(p,C), and at stage n choose sn=sn(bn) generically in (r(bn)−min⁡(r(bn)/2,εn),r(bn)−min⁡(r(bn)/4,εn/2)) and let Wn(bn) be the closed coordinate square of that radius about bn; then Wn(bn)⊆D and r(bn)−sn<εn. Claim: starting from any matched cellulation (G0,G0′) there is a sequence (Gn,Gn′) of matched cellulations such that diam⁡St⁡Gn(x)→0 for every x∈D and diam⁡St⁡Gn′(σn′(x))→0 uniformly in x, where σn(x) is the carrier of x and σn′(x) its corresponding target cell; moreover every anchor used keeps an incident inner edge at all later stages, the set A∞ of anchors used is dense in C, and u(A∞) is dense in S. Stage n starts from (Gn−1,Gn−1′) and has four parts. (i) The old matched source skeleton H contains the outer Jordan cycle C, is 2-connected, and H\C is connected (Step 2.1/6.1 invariant). Every bounded face of H has an inner edge on its boundary (Step 3.1(c)). Put W=W_n(b_n). The generic radius excludes the finitely many horizontal and vertical levels supporting old polygonal edge subsegments; the radius bounds just stated put W compactly inside D and ensure every fixed source point lies in int W for infinitely many repeats of a sufficiently close b_n. Subdivide W into a rectangular grid of sufficiently small squares, choosing interior mesh line offsets generically as well. No grid edge, including ∂W, then shares a nondegenerate segment with any of the finitely many old polygonal inner edges; polygonal intersections are finite, and the grid misses the wild outer C because W⊂D. The grid 1-skeleton K is 2-connected. Proof: start with one square's 4-cycle; order remaining squares by an edge-adjacency spanning tree. Each new square shares at least one full edge with the preceding square union. Therefore the intersection of its boundary 4-cycle with the old 1-skeleton contains an edge. Each component of the complement of that intersection in the 4-cycle is an open path whose two endpoints are distinct old vertices; the shared full edge rules out the same-endpoint loop case. Its closure is a rooted ear, including the case of one new edge. Subdivide at any extra old corner contacts before adding the ear paths. This covers one, two adjacent, two opposite, three, or all four shared edges, and preserves 2-connectivity. Finite subdivisions at old-grid crossings preserve it. If K meets H in at least two distinct points, the union H∪K is 2-connected: after deleting any vertex, both surviving graphs are connected and at least one other common point remains. All contacts are inside D, so their inner parts connect. If K meets H in exactly one point, K minus that point lies in one bounded Jordan face F of H; if K∩H is empty, all of K lies in one bounded face F. In either case choose a free point y on an inner edge of ∂F. Choose a free open grid-edge point p of K\H inside F, away from its finite intersections with H, and choose the free old-inner-edge point y away from all vertices. Endpoint collars enter F at both points. Polygonal connectivity of F gives a path between the collars; perturb its finitely many segments generically so it misses every vertex of K and crosses its edges transversely, and erase loops. The initial subpath from y to its first K contact ends in a free open grid edge, lies otherwise in F\K, and is the desired simple connector. This justifies the free-edge endpoint rather than assuming an arbitrary first-contact path has one. In the one-contact case, choose p and y distinct from that contact; the extra connector makes the union 2-connected by the deletion test and joins the inner parts. In the zero-contact case, thicken a compact interior segment of the connector to a narrow ribbon within the same component of F\K; its two long sides are disjoint connectors with distinct K/H endpoints. Deleting any vertex leaves one surviving attachment, so the union is 2-connected, and the inner parts connect. Endpoint collars exist because all edges here are polygonal and the disjoint nonincident finite pieces have positive distance; face openness and polygonal connectedness give the connector. The free inner edge exists by Step 3.1(c), so no connector is allowed to terminate solely on C. Before invoking the rooted-ear transfer, split all but one of every finite family of parallel edges in the overlaid graph at a new free interior point. The resulting abstract graph is simple; these degree-two subdivisions preserve the deletion test for 2-connectivity, preserve connectedness after removing C, and leave every grid line geometrically present. No loop edge is created by the transverse overlay. Treat the extra subdivision points as vertices of H_n in the transfer, and choose them off the fresh-boundary-spoke edges so Step 6.1(b) is unchanged. The resulting H_n contains every grid line and ∂W. Thus every source face incident to a point in int W lies within one small grid rectangle (its complement cannot cross any grid line or ∂W), giving the desired source-star diameter estimate. The graph is 2-connected and its inner part connected, so it meets Step 6.1(a)'s exact transfer hypotheses. (ii) Transfer the source refinement to the target by step 6.1(a). (iii) Let S be the target polygonal boundary. Choose at least two distinct fresh anchors a_1,a_2 (the ε_n/4 boundary mesh in fact gives many more). Choose λ close to 1 and the inner grid-line levels generically so neither the core boundary ∂(λQ) nor its internal mesh shares a segment with an old polygonal inner edge. A radial spoke at anchor a can share a segment with an old edge only when an old edge lies on the same ray from the square centre; the finite old edge set excludes only finitely many such anchor points, so the dense allowable anchor set still supplies the required ε_n/4 mesh. Take the fine core grid K inside λQ and one radial spoke from each a_j to its distinct point λa_j on the core boundary, subdividing at all finite meetings with the old target inner skeleton H'. The union S∪K∪spokes is 2-connected: S and K are cycles-containing 2-connected graphs joined by at least two internally disjoint spokes with distinct endpoints; deleting a vertex leaves a surviving spoke and both surviving graph pieces connected. Its union with old H' is 2-connected because they contain the full outer S. But 2-connectivity alone does not imply the required (new graph)\S is connected: if K/spokes miss H' off S, their inner parts remain separate. In that case the connected new inner core with its spoke interiors is disjoint from H'\S, so it lies entirely in one component F of the complement of H'; because it contains the core inside S, F is a bounded old face. Its frontier has a free inner H' edge by Step 3.1(c). Choose free open edge points y on this old inner edge and p on a new inner core edge inside F. Endpoint collars enter F at both. Join them by a polygonal path in F, perturb finitely many segments to avoid all graph vertices and be transverse to new edges, then retain the initial subpath from y to its first new-edge contact. That contact is a free open edge point; loop erasure gives a simple connector in one face of the full overlaid arrangement. Thus its interior misses every existing edge, it joins the old and new inner parts, and it cannot harm 2-connectivity. If K/spokes meet H' at an inner point, no extra connector is needed. All new inner edges meeting S are still exactly the single spokes at the fresh anchors, meeting Step 6.1(b)'s boundary condition. Before the Step 6.1 transfer, subdivide all but one edge in each parallel-endpoint family of the finite overlay at a fresh inner point, making the abstract graph simple without changing its geometric trace, 2-connectivity, inner connectivity or fresh S-anchor spokes. For the target-star estimate, a spoke-bounded collar sector has diameter at most the diameter of its outer S-arc plus twice its radial thickness. Choose the anchor spacing and λ with strict total margin below ε_n; the core cells have diameter below the remaining margin. Overlay subdivisions only shrink these cells, so every resulting target face-star has diameter < ε_n. (iv) Transfer back by step 6.1(b), obtaining (Gn,Gn′). The alternation shrinks both sides. On the target, all new faces lie in core mesh cells or spoke-bounded collar sectors of diameter below εn by the strict anchor-spacing and radial-thickness bound just proved; later overlays only subdivide them, so diam⁡St⁡Gn′(σn′(x))<2εn uniformly by step 4.1(e),(f). On the source, fix x∈D and d=r(x)>0. Pick b∈B with ∣b−x∣∞<d/8 and use its infinitely many repetitions at indices n with εn<d/8. Then x∈int⁡Wn(bn); every source face incident with x has a parent face in the pre-pullback grid overlay whose closure contains x. That parent face cannot cross a grid line or ∂Wn, so it lies in one rectangle of diameter below εn. Hence diam⁡St⁡Gn(x)<2εn, and later stars shrink by step 4.1(f). The stage-n anchors cut S into arcs of diameter below εn/4, so their union is dense in S, and its inverse image is dense in C because u is a homeomorphism. Choices are finite or from the fixed enumerations.

8.1step 3.1step 4.1step 7.1L1L2L3

The interior map. For x∈D put Tn(x)=St⁡Gn′(σn′(x)). These sets are nonempty and compact, and by steps 4.1(f) and 7.1 they are nested with diam⁡Tn(x)→0; hence their intersection is a single point: it is nonempty because a decreasing sequence of nonempty compact sets has nonempty intersection, since otherwise the open complements would cover the compact set T1(x), finitely many of them would cover it, and for the largest index N occurring one would have TN(x)=∅, a contradiction; and it contains at most one point because two points of the intersection would be at distance at most diam⁡Tn(x) for every n. Define F(x) by {F(x)}=⋂nTn(x). Then F is a homeomorphism D→Q∘, and F=gn on Gn∩D for every n. Agreement: if x∈GN∩D and n≥N, the skeleton map carries the carrier of x onto the corresponding cell, so gN(x)=gn(x)∈Tn(x) and F(x)=gN(x). Continuity: given x and η, choose n with diam⁡Tn(x)<η; in the stage-n star neighbourhood of x, the complement of the union of the closed cells not containing x, shrunk into D, every point z has carrier above the carrier of x, so by step 4.1(d) Tn(z)⊆Tn(x) and ∣F(z)−F(x)∣<η. Interior image: for n with the source star of x smaller than dist⁡(x,C), the corresponding target star misses S by step 4.1(d), so F(x)∈Q∘. Injectivity: if F(x)=F(y) then the target stars of x and y meet at every stage, hence so do the source stars by step 4.1(d), and a common point gives ∣x−y∣≤diam⁡St⁡Gn(x)+diam⁡St⁡Gn(y)→0. Surjectivity: the skeleton points off S are dense in Q∘, since at every stage every face has diameter less than εn and its boundary cycle contains an inner edge by step 3.1(c); given y∈Q∘, take skeleton points yk→y off S, corresponding at a late common stage to points xk∈D; for n with the target star of y off S, the finitely many source closed cells corresponding to the supercells of the carrier of y form a compact set K⊆D, and for large k the points yk lie in the star neighbourhood of y, so xk∈K; by [L1] a subsequence converges to some x∈K⊆D, and by continuity and agreement F(x)=y. Cells map to cells: F=gn on inner vertices and edges; for a face R one has F(R)⊆R′‾ by step 4.1(e), and F(R)⊆R′ because a value on the target skeleton would have a source preimage in D at which F agrees with gn, contradicting injectivity; conversely a preimage in D of a point of R′ has a face carrier R0 with F(R0) meeting R′, so R0=R and F(R)=R′. Inverse continuity: given y=F(x) and η, choose n with the source star of x smaller than η and take the target star neighbourhood V of y; for z∈V∩Q∘ the target carrier of y lies below the carrier of z, so by step 4.1(d) the source carrier of x lies below that of F−1(z), whence F−1(z)∈St⁡Gn(x) and ∣F−1(z)−x∣<η.

9.1step 1.3step 4.1step 7.1step 8.1L2L3L4

Skeleton crosscuts and corresponding sides. For distinct a,b∈A∞ occurring in a common stage there is a crosscut P of D from a to b inside that stage's skeleton whose image P′=g(P) is a crosscut of Q∘ from u(a) to u(b); and if U1,U2 are the two components of D∖P labelled by Ui‾∩C=Ai and U1′,U2′ the two components of Q∘∖P′ labelled by Ui′‾∩S=u(Ai), then F(Ui)=Ui′. Proof. Put X=∣G∣∖C, a connected set. If some inner edge has both endpoints on C, then its relative interior is open and closed in X and hence equals X, and its endpoints are exactly a and b, since each anchor is incident with an inner edge at every later stage; take that edge as P. Otherwise let Λ be the subgraph consisting of the vertices and edges entirely in D; attaching to each component of Λ the half-open relative interiors of the edges with exactly one endpoint on C partitions X into clopen pieces, one per component of Λ, so Λ meets every component of X and is therefore connected, and it is nonempty because the retained inner edge at the boundary anchor a has an interior endpoint that is a vertex of Λ; the union of Λ with the two edges at a and b is connected and meets C exactly in {a,b}, and a simple graph path from a to b inside it is a polygonal crosscut. The image under the skeleton homeomorphism is simple, meets S exactly in u(a),u(b) and is polygonal in Q∘. For the sides, F is a homeomorphism agreeing with g on P∩D, so it maps the components of D∖P onto the components of Q∘∖P′; to identify the labels, choose c∈A∞ in the relative interior of the boundary arc Ai at a stage containing P,c and an inner edge e at c; a short initial subarc J of e with c removed avoids U3−i‾, whose intersection with C is A3−i, and avoids P, so J⊆Ui; its image g(J), short enough, lies in Ui′, and F=g on J, so the labels match.

10.1A1step 1.1step 7.1step 8.1step 9.1L1L2

Boundary continuity and the square extension. Extend F to u‾:D‾→Q by u‾=u on C. Then u‾ is a homeomorphism, so the square statement of step 1.1 holds. Proof. u‾ is a bijection because F:D→Q∘ and u:C→S are bijections; it is continuous on D and on C, and we verify sequential continuity at each p∈C, which suffices by [L2]. Suppose xk→p with xk∈D but u‾(xk)↛u(p); passing to a subsequence, which is legitimate by the Bolzano–Weierstrass property of the bounded set Q [L1], we may suppose u‾(xk)→q≠u(p); then q∈S, because a limit q∈Q∘ would give xk=F−1(u‾(xk))→F−1(q)∈D by continuity of the inverse homeomorphism F−1 (step 8.1), contradicting xk→p∉D. Let r=u−1(q)≠p. Since A∞ is dense in C (step 7.1), choose a,b∈A∞, distinct from p and r, that separate p from r on C, and take them in a common finite stage; step 9.1 gives crosscuts P,P′. Let U1 be the side of D∖P whose closure meets C in the closed arc A1 containing p in its relative interior, so that r lies in the other arc A2. The crosscut P meets C only in a,b and U2‾∩C=A2, so both P and U2‾ have positive distance from p; hence all xk sufficiently close to p lie in U1, and their images lie in U1′ by step 9.1, so the limit q lies in U1′‾, whose intersection with S is u(A1); but q=u(r) with r in the relative interior of A2, a contradiction. Thus u‾ is a continuous bijection from the compact space D‾ onto the Hausdorff space Q, hence a homeomorphism [L1].

11.1step 1.1step 10.1F1L1L2L3

The exterior. First note the pointed form of the square statement: for Jordan curves C,C′ and interior points z∈D, z′∈D′, every homeomorphism f:C→C′ has an extension to a homeomorphism D‾→D′‾ carrying z to z′. Indeed, choose homeomorphisms Φ:D‾→Q and Ψ:D′‾→Q by steps 1.1 and 10.1, with Φ∣C=ψ∘f and Ψ∣C′=ψ, where ψ:C′→S is a boundary homeomorphism. Put a=Φ(z) and b=Ψ(z′), both interior points of Q. The four triangles spanned by a and the sides of Q triangulate Q. Mapping each by the vertex-affine map to the corresponding triangle spanned by b, fixing the side vertices and sending a to b, gives a boundary-fixing homeomorphism M:Q→Q: maps agree on shared segments and paste by [L2], and reversing a,b builds its inverse. The pointed extension is Ψ−1∘M∘Φ:D‾→D′‾, which extends f and sends z to z′. Next, for a∈D the inversion Ia(x)=a+(x−a)/∣x−a∣2 is an involutive homeomorphism of R2∖{a}, and Ca:=Ia(C) is a Jordan curve; the set U:=Ia(E)∪{a}, where E is the unbounded component of R2∖C, is open --- away from a because Ia is a homeomorphism there, and at a because the complement of a large disk maps into a punctured disk about a --- connected, since a lies in the closure of the connected image of E, and bounded, because E avoids a disk about a of radius dist⁡(a,C); away from a its frontier is Ca and a is an interior point, so U is open and closed in R2∖Ca and hence a component of that complement [L3]; being bounded it is the bounded component Va of R2∖Ca by [F1], so Ia restricts to a homeomorphism C∪E→(Ca∪Va)∖{a}. Now let h:C→C′ be a homeomorphism and fix a∈D, b∈D′; set f∗=Ib∘h∘Ia:Ca→(C′)b and extend f∗ with Φ∗(a)=b to a homeomorphism Φ∗:Va‾→V′b‾, which the pointed form supplies because a∈Va and b∈V′b are interior points; then Fext:=Ib∘Φ∗∘Ia is a homeomorphism C∪E→C′∪E′ extending h on C, since the inversions restrict to homeomorphisms of those closed exteriors and remove the points a,b correspondingly.

12.1A1step 1.1step 11.1F1L1L2L3∎

Conclusion. The interior extension Fint:=Ψ−1∘Φ of step 1.1 is a homeomorphism C∪D→C′∪D′ extending h, and Fext of step 11.1 is a homeomorphism C∪E→C′∪E′ extending h; the two agree on C, and their closed domains cover R2, so pasting them gives a continuous bijection H:R2→R2 extending h; pasting the two inverse homeomorphisms, which agree on C′, gives continuity of H−1 as well, so H is a homeomorphism [L2]. Since H restricts to a homeomorphism of R2∖C onto R2∖C′, it carries complementary components to complementary components; and it carries bounded sets to bounded sets, because the closure of a bounded set is compact [L1], a continuous image of a compact set is compact and hence closed and bounded [L1]; therefore H(D)=D′ and H(E)=E′, the bounded and unbounded components corresponding. Finally, taking C′=S1 and any homeomorphism h:C→S1 exhibits the closed bounded Jordan region D‾ as homeomorphic to the closed unit disk B‾2(0,1). AC is used only as declared in [A1].

Remarks

The argument follows the route of the matched cellulations: a limit map is built inside the Jordan domain by alternating a local grid on the source with an anchored mesh on the square, and continuity at the curve is recovered separately from the skeleton crosscuts. The strongly accessible points are the nearest points of rational interior points; they are dense, and each is the endpoint of an open cone of short straight segments into the domain, which is what lets a fresh anchor support exactly one spoke.

The declared prerequisite Arc complements and accessible Jordan boundary points is retained as part of this item's interface, but the density of anchor points used here is proved directly from nearest points, so that lemma's statements are not load-bearing in the argument above.

The Axiom of Choice is used through the Jordan–Brouwer separation theorem and through the countable instance invoked in the sequential criterion for continuity; the refinement scheme draws its points from fixed enumerations of Q2 and of the anchor set, so it adds no selection of its own.

Depends on

Used by

Dependency tree · two levels

150 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources