Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Planar facial graph facts and isomorphism extension for arbitrary arc drawings

Statement

Assume the Axiom of Choice. Let a finite simple graph G be drawn in the plane by simple arcs meeting only at common endpoints: the vertices are distinct points, and the edges are embedded arcs whose relative interiors are pairwise disjoint and avoid every vertex. Write X for the point set of the drawing, call the connected components of R2∖X its faces, and write V,E,F for the numbers of vertices, edges and faces.

(a) If G is 2-connected, then the frontier of every face is the point set of a simple cycle of G.

(b) If G is connected, then V−E+F=2; in general V−E+F=1+c, where c is the number of connected components of G.

(c) If G is connected, simple, bipartite and V≥3, then E≤2V−4; consequently K3,3 has no plane drawing by simple arcs.

(d) Let G and G′ be finite 2-connected simple graphs drawn in the plane by simple arcs, let φ:G→G′ be a graph isomorphism, and suppose:

(i) there is one global sign ε∈{+1,−1} such that at every vertex v the isomorphism φ carries the cyclic order of the edge germs of the drawing of G at v to the cyclic order of the edge germs of the drawing of G′ at φ(v) read with sign ε;

(ii) a bijection β from the faces of the drawing of G to the faces of the drawing of G′ is given such that φ carries the frontier cycle of each face F onto the frontier cycle of β(F), the outer face of the drawing of G is paired with the outer face of the drawing of G′, and a designated face is paired with a designated face.

Then there is a homeomorphism Φ:R2→R2 with Φ(v)=φ(v) for every vertex, Φ carrying the point set of each edge onto the point set of its φ-image, and Φ(F) equal to the paired face β(F) for every face F.

Facts & Assumptions

Given: A finite simple graph and, when a drawing is specified, vertices as distinct points and edges as embedded arcs meeting only at common endpoints.

[A1]

AC is The Axiom of Choice. Its uses here are exactly the following: Jordan–Brouwer separation supplies the two complementary regions of Jordan curves in steps 1.3, 2.2, 4.1 and 5.1; Jordan–Schönflies extension for plane curves supplies the plane extension in step 7.1; Alexander duality for compact locally contractible subsets of a sphere supplies the duality isomorphism of step 3.1; and The universal coefficient theorem for cohomology over a PID supplies the coefficient sequence of step 3.1. Every other selection in this proof is made from a finite explicit collection.

[L2]

For every arc drawing X in this lemma, define a face to be a connected component of R2∖X and its frontier to be its topological boundary; a facial boundary cycle is a graph cycle whose trace equals that frontier when such a cycle has been proved to exist. The complement-component convention agrees with Plane embeddings of finite simple graphs, their faces, facial boundary walks and lengths (counting a bridge twice), and planar graphs in its polygonal-drawing scope, but no polygonal-only boundary theorem is assumed for arbitrary arcs. An embedding is a continuous injective map that is a homeomorphism onto its image, a map defined on a finite closed cover whose pieces agree on overlaps pastes continuously (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological, Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous), and Polygonal arcs and polygons as non-self-intersecting finite unions of line segments in R2 records the arc and polygon conventions.

[L3]

The unit interval, the circle and finite graph drawings are compact metric spaces, continuous images of compact spaces are compact, compact subsets of the Hausdorff plane are closed, a continuous bijection from a compact space onto a Hausdorff space has continuous inverse, and a compact subset of Rn is closed and bounded (Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace, 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, In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones, A continuous bijection from a compact metric space onto a metric space carries open sets to open sets, so its inverse is continuous).

[L4]

In a locally path connected space the components are exactly the path components, and a connected locally path connected space is path connected (A connected, locally path-connected space is path-connected, because its path components are open).

[L5]

Bipartite graphs have the bipartition convention of A bipartite graph and a proper two-colouring of its vertices; K3,3 is connected and bipartite with six vertices and nine edges (Empty and complete graphs, complete bipartite graphs, and the convention that Pn and Cn have n vertices).

[L6]

Every subgroup of Zn is free of rank at most n, in particular finitely generated, every finitely generated abelian group M is Zr⊕T with T finite and intrinsic rank r, Hom⁡Z(Zn,Z)≅Zn, and every subgroup of Z is dZ for a unique d≥0, so a homomorphism from a finite abelian group to Z is zero (Integer abelian structure and rank by finite reduction, For a commutative ring, Hom⁡R(Rn,N)≅Nn, Every subgroup of (Z,+) is ⟨n⟩=nZ for exactly one natural number n); hence for a finitely generated abelian group A the group Hom⁡(A,Z) is free of rank equal to the rank of A.

[F1]

A Jordan curve in R2 has exactly two complementary components, one bounded and one unbounded, with the curve as the common boundary (Jordan–Brouwer separation).

[F2]

Every homeomorphism of Jordan curves extends to a homeomorphism of the plane carrying bounded and unbounded complementary components to corresponding ones, and every closed bounded Jordan region is a closed disk; consequently a homeomorphism between the boundary circles of two closed bounded Jordan regions extends to a homeomorphism of the regions (Jordan–Schönflies extension for plane curves).

[F3]

Every finite connected graph has a spanning tree, and every finite 2-connected graph with at least three vertices has an ear decomposition beginning with any specified cycle: a sequence of subgraphs beginning with the cycle in which each later graph is obtained by adding a path whose endpoints lie in the earlier graph and whose internal vertices and edge interiors are new (Finite plane graph ear and face facts).

[F4]

A CW complex is a Hausdorff space with an attaching filtration satisfying closure finiteness and the weak topology (CW complex with closure finiteness and weak topology); for a finite CW complex the cellular chain groups are the free groups on the cells, cellular homology computes singular homology, the Euler characteristic is the alternating sum of the numbers of cells, and the Euler-Poincare formula gives χ(X)=∑n(−1)nrank⁡Hn(X;Z) (Cellular homology, Cellular homology computes singular homology, Euler characteristic of a finite CW complex, Euler–Poincare formula for finite CW complexes).

[F5]

Singular chains are free on the singular simplices, singular cohomology is the cohomology of the cochain complex with coefficients, H0 is free on the path components, and the universal coefficient theorem gives the natural short exact sequence 0→Ext⁡1(Hn−1(X),G)→Hn(X;G)→Hom⁡(Hn(X),G)→0 (The singular chain complex and singular homology, Singular cohomology with coefficients, Zero-th singular homology is free on path components, The universal coefficient theorem for cohomology over a PID).

[F6]

For a nonempty proper compact weakly locally contractible subset K of Sn and every commutative unital ring R there is a natural isomorphism H~i(Sn∖K;R)≅H~n−i−1(K;R); a compact subset of Euclidean space is weakly locally contractible exactly when every point and neighborhood admit a smaller neighborhood whose inclusion is nullhomotopic (Alexander duality for compact locally contractible subsets of a sphere, Compact locally contractible Euclidean subsets are neighborhood retracts).

[F7]

The sphere S2 is the set of unit vectors in R3 (Euclidean spheres and closed balls as subspaces of Rn).

Proof

Given: The finite graphs and, where used, their arc drawings, with faces as the components of the complement of the drawing.

1.1L2L3F1

Let G be drawn. The drawing X is a finite union of arcs together with finitely many points, hence compact, and closed in the plane by [L3]. If two arcs have the same two distinct endpoints and meet exactly at those endpoints, their union is a Jordan curve: parametrizing the circle by the two arcs and identifying the four endpoint parameters gives a continuous bijection from the compact circle onto the union, which is a homeomorphism by [L3]. Consequently every cycle of a drawn graph is a Jordan curve, since its edges paste successively in this way; in particular, if J is a Jordan curve, p≠q lie in J and Q is an arc with Q∩J={p,q}, then the two unions Di=Ji∪Q of Q with the two closed arcs J1,J2 of J from p to q are Jordan curves.

1.2F4F6L1L3

Drawings are finite CW complexes. On the abstract graph make a CW structure with the vertices as 0-cells and the edges as 1-cells attached by their endpoint maps, and let ∣G∣ be the resulting finite CW complex; the drawing map that sends each edge parameter to its arc and each vertex to its point is continuous on the finite closed cover by the edge closures and is a bijection because edges meet only at common endpoints. Since ∣G∣ is a finite union of compact closed cells it is compact, so [L3] makes the drawing map a homeomorphism and X a finite CW complex with V 0-cells, E 1-cells and no higher cells. Every point of X has a neighbourhood basis of contractible neighbourhoods: open subintervals at interior points of edges, and at a vertex v the open stars formed by initial segments of the incident edges, which are open because their preimages in the disjoint union of edges are unions of half-open intervals, and which contract to v by sliding each initial segment along itself; a homeomorphism preserves this, so every drawing is weakly locally contractible in the sense of [F6]. If G is connected, then X is path connected: any two vertices are joined by a path in G whose edges patch to a continuous path, and every point of X is a vertex or lies on an edge. Conversely, the trace of each graph component is closed, being a finite union of compact arcs and vertices; its complement in X is also such a finite union, so it is open as well. A connected path image cannot meet two of these disjoint clopen traces. Hence the path components of X are exactly the c connected components of G.

1.3F1F3

Facial cycles: base of the induction. Every finite connected graph has a spanning tree and every finite 2-connected graph has an ear decomposition beginning with any specified cycle, by [F3]. Let G be 2-connected, build the drawing by the ear decomposition from any cycle C0, and induct on the number of ears with the invariants: (I0) each face is the region of its frontier cycle, that is the component of the complement of that cycle containing it; (I1) the frontier of every face is the point set of a cycle of the current drawing; (I2) the sum of the lengths of the facial boundary cycles equals twice the number of drawn edges. For the initial cycle C0, always a simple cycle, [F1] gives exactly two regions with frontier C0, so (I0) and (I1) hold with both facial boundaries the cycle C0, and each of the two faces traverses all E cycle edges once, giving total boundary length 2E, which is (I2).

2.1F4F5L6step 1.2

Homology of a drawing. Let X be a drawing with V vertices, E edges and c components. By step 1.2 it is a finite CW complex with exactly V 0-cells, E 1-cells and no cells of dimension ≥2, so its Euler characteristic is χ(X)=V−E, and all singular homology of X vanishes in degrees ≥2, because cellular homology computes singular homology and the cellular chain complex is concentrated in degrees 0 and 1. The Euler-Poincare formula therefore gives V−E=rank⁡H0(X;Z)−rank⁡H1(X;Z); the group H0(X;Z) is free on the path components of X, which number c by step 1.2, so rank⁡H1(X;Z)=E−V+c. Moreover H1(X;Z)=ker⁡d1 is a subgroup of the free group C1=ZE, hence is free of rank at most E and finitely generated, and rank⁡H1(X;Z) is its intrinsic rank.

2.2F1L2step 1.1

Crosscut: structure. Let J be a Jordan curve with complementary regions V and W, let p≠q be points of J, and let Q be an arc with Q∩J={p,q} and Q∘⊆V. By step 1.1 the two curves Di=Ji∪Q are Jordan curves, where J1,J2 are the two closed arcs of J from p to q. By [F1] each Di has exactly two complementary regions with frontier Di; let Zi be the region of R2∖Di containing W, well defined because W is connected and disjoint from Di, and let Yi be the other region. Every point of J∖Ji lies in Zi: such a point x has a ball B about it disjoint from Di and meeting W, because x lies in the frontier J of W, and since B is connected and avoids Di it lies in Zi. Hence Yi misses Ji and J∖Ji, so Yi misses J; being connected it lies in one region of R2∖J, and it is not W because W⊆Zi and Yi∩Zi=∅, so Yi⊆V. Next Y2⊆Z1: the set Y2 misses Q⊆D2 and misses J, so it lies in R2∖D1; and points of Y2 are arbitrarily close to each point of the open arc J2∘, because the frontier of Y2 is D2; that arc lies in J∖J1⊆Z1, and Z1 is open, so Y2 meets Z1 and therefore lies in Z1. Symmetrically Y1⊆Z2, so Y1∩Y2=∅. Since Yi is open in the plane and its frontier Di is disjoint from Ω:=R2∖(J∪Q), each Yi is open and closed in Ω; the set Z1∩Z2 is open, nonempty because it contains W, and Ω=Y1⊔Y2⊔(Z1∩Z2), because Ω=(Y1⊔Z1)∩Ω and Z1∩Ω=Z1∩(R2∖D2)=Y2⊔(Z1∩Z2).

3.1A1F5F6F7L3L4L6step 1.1step 1.2step 2.1

Complement components by duality. Let K⊆R2 be nonempty, compact and weakly locally contractible, and identify R2 with S2∖{∞} by the explicit stereographic homeomorphism x↦(2x1/(1+∣x∣2),2x2/(1+∣x∣2),(∣x∣2−1)/(1+∣x∣2)), whose inverse from the sphere minus the north pole is (X1,X2,X3)↦(X1/(1−X3),X2/(1−X3)). The sphere is the one specified by [F7]. Hence K is a nonempty proper compact subset of S2, bounded and missing the point at infinity by [L3], and weakly locally contractible in S2 because near a point of K the spherical and planar neighbourhoods agree. By [F6] with n=2, i=0 and R=Z, H~0(S2∖K;Z)≅H~1(K;Z)=H1(K;Z), the last equality because K is nonempty. By [F5], H1(K;Z)≅Hom⁡(H1(K;Z),Z) because Ext⁡1(H0(K;Z),Z)=0 as H0 is free, so by [L6] the rank of H1(K;Z) equals rank⁡H1(K;Z) whenever H1(K;Z) is finitely generated. Also by [F5], H~0(S2∖K;Z) is free on the set of path components of S2∖K modulo one, and by [L4] applied to the locally path connected spaces R2∖K and S2∖K these path components are their components, so its rank is the number of components of S2∖K minus one. The components of R2∖K and of S2∖K are in bijection: writing e for the point at infinity, for every component C of S2∖K the set C∖{e} is connected, because it equals C when e∉C, and if e∈C and C∖{e}=A⊔B were a separation into nonempty relatively clopen sets, choose r with K in the closed ball of radius r. The outer cap N∪{e}, with N={x:∣x∣>r}, is connected, lies in S2∖K and contains e, hence N⊆C∖{e}. Thus connected N lies wholly in, say, A. Consequently B lies in the closed radius-r ball and e is not in its closure in C. As B is already relatively open and closed in C∖{e}, it is now open and closed in connected C, a contradiction; and C↦C∖{e} is a bijection onto the components of R2∖K, since a component of R2∖K is connected in S2∖K and lies in a unique component C, which yields it back. Comparing ranks, #{faces of X}=1+rank⁡H1(X;Z) for every nonempty drawing X; inserting step 2.1 gives F=1+E−V+c, that is V−E+F=1+c; for the empty graph V=E=c=0 and F=1, so the same formula holds. Applied to the theta curve θ formed by a Jordan curve J and an arc Q with Q∩J={p,q} and Q∘∩J=∅, first subdivide each of its three p-to-q arcs once at a distinct free point. This is a drawing of the simple graph K2,3 with V=5, E=6 and c=1, the geometric trace and complement unchanged. Steps 1.1 and 1.2 therefore give #π0(R2∖θ)=1+(6−5+1)=3. In particular a connected drawing satisfies V−E+F=2, which proves (b).

4.1L2step 3.1step 2.2

Crosscut: the count. With θ=J∪Q as in step 3.1, the space Ω is the disjoint union of the three open sets Y1,Y2 and Z1∩Z2 by step 2.2, and step 3.1 gives #π0(Ω)=3. The sets Y1,Y2 are nonempty connected open and closed subsets of Ω, so each is a component, and therefore Z1∩Z2 is also connected. Since Ω=(V∖Q)⊔W is a separation into open sets with W connected, the components of Ω are those of V∖Q together with W; as Y1∪Y2⊆V∖Q are two distinct components, V∖Q=Y1⊔Y2 and Z1∩Z2=W. Thus R2∖(J∪Q) has exactly the three components W,Y1,Y2, with frontiers J,D1,D2, and the two regions of V∖Q have the Jordan curves D1,D2 as frontiers.

5.1F1F3L2step 4.1

Facial cycles: the ear step. Let the current drawing XH of the 2-connected graph H satisfy (I0), (I1) and (I2) and let Q be the next ear, a path with distinct endpoints u≠v on XH whose relative interior is disjoint from XH. The relative interior of Q is connected and lies in the complement of XH, so it lies in a single face F, and F is the region of the Jordan curve J=Fr⁡(F) containing it by (I0) and (I1). The endpoints u,v lie in J, because points of Q near each of them lie in F and J=Fr⁡(F); the two closed arcs J1,J2 of J from u to v are graph paths, so Di=Ji∪Q are graph cycles, hence Jordan curves. By step 4.1 the new drawing XH∪Q has exactly the faces Y1,Y2 inside F together with all faces of XH other than F: every other face F′ of XH is disjoint from Q, and it is the region of its frontier by (I0), so Q misses F′ and F′ is still a component of the complement of the new drawing, while every remaining point of the complement lies in an old face other than F or in F∖Q=Y1⊔Y2. The new facial frontiers are the old cycle frontiers together with D1 and D2, so (I1) passes, and (I0) passes because each old face is still the region of its frontier and each Yi is the specified component of R2∖Di opposite the old adjacent region W by step 4.1, whether or not that component is bounded; an ear with k≥1 edges contributes k−1 new vertices, k new edges and one new face, and ∣D1∣+∣D2∣=∣J1∣+∣J2∣+2k=∣J∣+2k, so the sum of the cycle lengths changes by 2k and (I2) passes. Induction over the finitely many ears proves (a) and the invariant (I0), and it also proves V−E+F=2 for 2-connected drawings.

6.1L1L5step 5.1

The bipartite bound. Let G be connected, simple and bipartite with V≥3 and put f(G)=2V−E; the claim E≤2V−4 is f(G)≥4. First suppose G is 2-connected. By step 5.1 every face has a boundary cycle and each such cycle has even length at least 4: it is a cycle of a bipartite graph, hence even, and it has at least three distinct vertices, hence at least four. By (I2) of step 5.1 the sum of the facial cycle lengths is 2E, so 4F≤2E; with V−E+F=2 this gives E≤2V−4. In general suppose G is connected, has V≥3 and is not 2-connected. Then some vertex v has G−v disconnected, and splitting the component vertex sets of G−v into two nonempty groups gives connected bipartite drawn subgraphs G1,G2 on the two vertex sets {v}∪C1 and {v}∪C2, which share exactly v, with strictly fewer vertices than G, with V1+V2=V+1 and E1+E2=E. Induction on V gives f(Gi)≥3, because for Vi=2 the graph is one edge and f(Gi)=3, and for Vi≥3 the claim f≥4 is obtained by the same splitting argument applied to Gi, whose vertex number is smaller. Hence f(G)=f(G1)+f(G2)−2≥4, that is E≤2V−4. Finally K3,3 is connected and bipartite with V=6 and E=9 by [L5], and 9>8=2⋅6−4, so K3,3 has no drawing by simple arcs. This proves (c).

6.2F2L2step 5.1

Extension: boundary data. Let G,G′ and φ be as in (d) with a bijection β as in (ii). By step 5.1 the frontier Fr⁡(F) of every face is a cycle of the drawing and, by the invariant (I0) of step 5.1, each face F is the region of its frontier cycle Fr⁡(F); the same holds in the drawing of G′, whose 2-connected drawing also satisfies (I1) and (I0). By (ii) the isomorphism φ carries Fr⁡(F) onto Fr⁡(β(F)), and by (ii) the unique outer face is paired with the unique outer face, so a face is bounded exactly when its paired face is bounded; hence for every face F the regions F and β(F) are both bounded or both unbounded. Choose for each edge e of G any homeomorphism e→φ(e) matching endpoints, which exists since both are embedded arcs, and let h:X→X′ be the resulting map of point sets; it is a homeomorphism, because it is continuous and injective on the finite closed cover by edge closures and its inverse is assembled from the inverse homeomorphisms in the same way, and by construction h(v)=φ(v) for every vertex and h carries each edge onto the edge of its image. For each face F the restriction h∣Fr⁡(F) is a homeomorphism from the Jordan curve Fr⁡(F) onto the Jordan curve Fr⁡(β(F)).

7.1F2L2step 6.2

Extension: assembling the homeomorphism. For each face F apply the extension assertion of [F2] to the homeomorphism h∣Fr⁡(F) and use that F and β(F) are both bounded or both unbounded by step 6.2: there is a homeomorphism ΨF:R2→R2 with ΨF∣Fr⁡(F)=h∣Fr⁡(F) and ΨF(F)=β(F), the latter because F is a region of the Jordan curve Fr⁡(F) and ΨF carries the two regions of that curve onto the two regions of Fr⁡(β(F)) according to boundedness. Define Φ:R2→R2 to equal h on the drawing X and to equal ΨF on each face F. The sets X and the closures F‾ are finitely many closed sets covering the plane, and any two of them meet either in X or not at all, so the definitions agree on overlaps and Φ is continuous by [L2]; it is injective, because it maps X bijectively onto X′ and each face bijectively onto its paired face, and it is surjective for the same reason. Define the actual inverse piecewise to equal h−1 on X′ and ΨF−1 on β(F) for each F. On each paired frontier ΨF−1 agrees with h−1, so the finite closed-cover pasting argument makes this inverse continuous; its compositions with Φ are the identity on every face and edge. Thus Φ is a homeomorphism of the plane with Φ(v)=φ(v) for every vertex, Φ carrying each edge onto its image edge, and Φ(F)=β(F) for every face, in particular for the designated and outer faces. This proves (d).

8.1A1step 3.1step 5.1step 6.1step 7.1∎

Collecting the cases: (a) is step 5.1, (b) is step 3.1 together with the 2-connected case of step 5.1, (c) is step 6.1 and (d) is step 7.1. Degenerate cases: a graph with one vertex and no edges has V−E+F=1−0+1=2 when connected, is not 2-connected, so (a) and the 2-connected part of (c) are vacuous there, (b) is the general formula of step 3.1, and (d) concerns 2-connected graphs, which have at least three vertices; the empty graph has V=E=c=0 and F=1, treated in step 3.1. Choice enters exactly as declared in [A1], through Jordan separation, the Jordan-Schonflies extension, Alexander duality and the universal coefficient theorem; all remaining selections are made from the finitely many edges, faces and spanning trees of the finite data.

Remarks

The polygonal counterparts of (a), (b) and (c) are proved choice-free in Finite plane graph ear and face facts; the statements here cover arbitrary simple arcs, and the crosscut count of step 4.1 is derived from Alexander duality because a wild arc can cross every small circle about one of its points infinitely often, so no local two-sidedness argument is available. The literature route to the same facts argues with accessible points of Jordan regions (Thomassen, Lemmas 2.4 and 2.7; Gallier-Xu, Proposition E.2), whereas step 3.1 computes the number of faces of a drawing from the rank of its first homology group.

In (d) conditions (i) and (ii) are hypotheses on the two given drawings: the rotation data and the pairing of faces must be realized by the drawings, and the pairing must pair the outer faces. The outer-face clause is not redundant. Let G=G′ be the graph consisting of a four-cycle uxvyu together with the chord e=uv, drawn once with e inside the cycle and once with e outside it, and let φ be the identity. The rotation data of the two drawings correspond with global sign −1, and the facial cycles correspond with the outer face of the first drawing paired to the inner face of the second, but no homeomorphism of the plane carries one drawing to the other with that pairing of faces, because a homeomorphism of the plane carries bounded sets to bounded sets; the pairing that pairs the outer faces, on the other hand, fails condition (ii), so the hypotheses of (d) are inconsistent for this pair of drawings, in agreement with the failure of the conclusion. The same computation is the reason the scaffold statement is read here with the condition that the outer faces correspond: the designated face of the extension argument is the outer face, which fixes a plane rather than merely a sphere extension. The rotation condition (i) is recorded because it is the natural combinatorial hypothesis on the drawings, but the construction of steps 6.2 and 7.1 uses only the facial correspondence (ii), which is what the face-by-face Schonflies argument needs.

Depends on

Used by

Dependency tree · two levels

179 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