Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Two disjoint circles in the two-sphere cobound an annulus

Statement

Assume the Axiom of Choice. Let C,C′ be two disjoint smoothly embedded circles in S2 (Smooth embeddings). Then S2∖(C∪C′) has exactly three components: two of them are open disks and one of them is an open annulus whose boundary is C∪C′. Consequently C and C′ cobound a unique annulus A, and each of the two complementary disks is bounded by one of the circles.

Facts & Assumptions

Given: AC, two disjoint smoothly embedded circles C,C′ in S2, and the standard model S2=R2∪{∞} as the one-point compactification of the plane (The one-point (Alexandroff) compactification X∗=X∪{∞}, whose open sets are the open sets of X together with the complements in X∗ of the closed compact subsets of X).

[F1]

Assume AC. The image of a topological embedding S1↪S2 has exactly two complementary path components, and it is their common boundary; for an embedding into R2 there are exactly two complementary components, one bounded and one unbounded, with the curve as common boundary (Jordan–Brouwer separation). AC is inherited only from Alexander duality.

[F2]

Assume AC. Every homeomorphism between Jordan curves in R2 extends to a homeomorphism of R2 mapping the bounded complementary component of the first onto the bounded complementary component of the second; in particular each closed bounded Jordan region is a closed 2-disk (Jordan–Schönflies extension for plane curves).

[F3]

A smooth embedding of S1 is injective, an immersion, and a homeomorphism onto its image, hence a Jordan curve (Smooth embeddings).

[F4]

Assume AC. A smoothly embedded compact submanifold S⊆Rm has a tubular neighbourhood: there is a positive smooth function δ on S such that the normal addition map on {(p,v)∈N⊥S:∣v∣<δ(p)} is a diffeomorphism onto an open neighbourhood of S (The Euclidean tubular neighbourhood theorem).

[F6]

Every open connected subset of Rn is polygonally connected, hence path connected (Every connected component of an open subset of Rn is open and polygonally connected).

[F8]

Assume AC. Let a finite 2-connected graph be drawn in the plane by simple arcs meeting only at common endpoints, let one cycle C be drawn as a Jordan curve, and let every other edge be a simple polygonal arc whose relative interior lies in the bounded component of R2∖C. Then every component of the complement of the drawing has a graph cycle as its boundary, and V−E+F=2 where F is the number of complement components (Finite plane graph ear and face facts).

Proof

technique · direct
1.1F1F2F3given

Reduction to a planar picture and Jordan–Brouwer. By Jordan separation, C has two complementary components and the connected circle C′ lies in one. Choose o in the other component; in the model S2=R2∪{∞} of the Given we may suppose o=∞, since otherwise we replace the model by its image under a smooth rotation of S2 carrying o to ∞; the number of complementary components and their homeomorphism types are unchanged by a homeomorphism. This pole choice puts C′ in the bounded component of R2∖C. Then C,C′⊂R2, and by [F3] and [F1] each curve has exactly two complementary components with the curve as their common boundary; write D and D′ for the bounded components of R2∖C and R2∖C′. By [F2] the closed regions D‾ and D′‾ are closed 2-disks, hence D and D′ are open disks.

2.1F1F3step 1.1algebra

The pole gives actual nesting. By the pole choice in step 1.1, C′⊂D. The exterior of D‾ is connected and unbounded, misses C′, and thus lies in the unbounded complementary component of C′. Since the two compact circles are disjoint, a collar of C also misses C′, so C lies in that same unbounded component. Hence the closed bounded region D′‾ misses C and its exterior and is contained in D. This uses the specified pole; two side-by-side curves in a previously fixed planar chart would not have this nesting.

3.1F3F4step 1.1step 2.1construct

Topological polygonal reduction in disjoint collars. It suffices to prove the topological annulus assertion for polygonal curves. A smooth embedded circle has a smooth tubular collar by [F4]. A sufficiently fine inscribed polygon in that collar projects one-to-one onto the circle: on every sufficiently short regular arc its tangent has positive component in the original tangent direction, so the projection is locally monotone; compact separation of distant arcs excludes other intersections. Thus the polygon is a continuous normal graph r=u(s) with arbitrarily small displacement. In collar coordinates, choose a smooth cutoff χ(r) equal to 1 near r=0 and 0 near the collar boundary, and make the approximation so small that ∥χ′∥∞∥u∥∞<1. The map Ht(s,r)=(s,r+tχ(r)u(s)) is a homeomorphism: on each normal fibre it is strictly increasing, fixes the ends, and has continuous inverse, since its increase is bounded below by (1−∥χ′∥∞∥u∥∞) times the fibre increment. It is identity off the collar and sends the original curve to its polygon at t=1. Choose the two collars disjoint and apply these maps simultaneously. This is a topological ambient isotopy, sufficient for complementary homeomorphism types; no smooth isotopy extension is applied to a polygonal endpoint. The two nested polygonal curves retain their disks and middle region under this homeomorphism.

4.1F6step 2.1step 3.1construct

A crosscut and its finite polygonal collar. Now the curves are polygonal and D′‾⊂D. Put M=D∖D′‾. This open region is nonempty and connected: join any two of its points by a polygonal path in the connected disk D using [F6], perturb its segments to avoid vertices of C′ and cross its edges transversely, and replace every run through D′‾ by a path in a thin exterior polygonal collar of C′. Compact nesting keeps that collar inside D; its side strips and vertex sectors connect around the whole polygon. Finitely many detours give a path in M, so [F6] makes it polygonally connected. Choose p∈C,q∈C′ in edge interiors and short straight access segments entering M. Join their other ends in M, perturb to make all intersections finite, subdivide there and erase cycles in the resulting finite edge walk. Trim in the endpoint collars to obtain a simple polygonal crosscut P with interior in M. Construct a companion P1 on one fixed side of P: choose disjoint small disks at its bends, disjoint thin rectangles on its truncated straight segments, and endpoint rectangles meeting only the appropriate edge interiors of C,C′. Finitely many nonincident pieces have positive separation; choose all widths smaller than it. Offset each segment in those rectangles and connect its offsets in the intervening bend sectors by short bevels. Since each bend sector joins just its two consecutive rectangles and the neighbourhoods miss all nonincident pieces, this is an embedded polygonal P1, disjoint from P, ending at nearby p1∈C,q1∈C′. The rectangles and bend sectors between the two arcs, with the short boundary intervals α1⊂C,α2⊂C′, form a closed thin strip S⊂M‾. Its boundary is precisely P∪P1∪α1∪α2, with no unintended intersection or boundary portion.

5.1F1F2F8step 4.1algebra

The four faces, not all graph cycles. Use the endpoints p,p1∈C, q,q1∈C′ from step 4.1, and divide each boundary into two arcs α1,α1′ and α2,α2′, with α1,α2 bounding the thin strip together with P,P1. The embedded graph G=C∪C′∪P∪P1 has four vertices, six edges and is 2-connected: after deleting any vertex, the surviving bridge and the remaining boundary arcs still connect it. Subdivide each of its six edges once to get a simple 2-connected graph, with ten vertices and twelve edges and the same faces. By [F8] it has 2−10+12=4 complementary faces, each bounded by a graph cycle. The exterior of C is one face and the interior of C′ another; their boundary cycles are C,C′. The thin-strip interior is a third face, with boundary γ=α1∪P1∪α2∪P. Following the other side of either bridge, the local cyclic order of its three incident edges forces the fourth face walk to use α1′,P1,α2′,P, so its boundary is γ1=α1′∪P1∪α2′∪P. This also follows by exhaustively following the two directed sides of the six edges: the two boundary faces, the strip and this last walk use every edge side once. There are other mixed bridge cycles in G; they are not face boundaries. Let Z be the closure of the strip face and Z1 the closure of the fourth open face. By [F2] these Jordan-bounded closures are closed disks. They satisfy M‾=Z∪Z1 and Z∩Z1=P∪P1: the four-face enumeration exhausts the middle region, and only the two bridges border both middle faces. In particular Z1 is the closure of its open face, not a set obtained by removing a strip interior and retaining unrelated boundary arcs.

6.1F2step 5.1algebra

The middle region is an annulus. By [F2] each of Z and Z1 is a closed 2-disk, and its boundary is divided by the four points p,p1,q,q1 into the four arcs α1,α2,P,P1, respectively α1′,α2′,P,P1, in the cyclic order P,α1,P1,α2 (respectively P,α1′,P1,α2′). A closed disk whose boundary is split by four points is homeomorphic to the square [0,1]×[0,1] with the four boundary arcs corresponding to the four sides; transporting the splitting of Z and of Z1 through such homeomorphisms describes the gluing of step 5.1 as the identification of the left edges of two squares with each other and of the right edges with each other, which is the standard description of S1×[0,1]: the free boundary consists of the two circles α1∪α1′=C and α2∪α2′=C′. Hence M‾≅S1×[0,1] and M≅S1×(0,1) is an open annulus with boundary C∪C′.

7.1step 3.1step 5.1step 6.1∎

Conclusion. In the polygonal case the complement of C∪C′ has exactly the three components D′, (R2∖D‾)∪{∞} and M by steps 1.1, 2.1 and 4.1: the first two are open disks and the third is an open annulus whose boundary is C∪C′. The annulus cobounded by C and C′ is unique, because the interior of any such closed cobounding annulus is the connected complementary component adjacent to both circles, and exactly one component does; and the complementary disks D′ and (R2∖D‾)∪{∞} are bounded by C′ and by C respectively. step 3.1 transfers this conclusion back to the given pair of disjoint smoothly embedded circles in S2: the collar homeomorphism constructed there carries each complementary component of the polygonal pair onto a complementary component of the original pair preserving the homeomorphism types, and it carries the annulus onto the annulus cobounded by C and C′. This proves every claim.

Depends on

Used by

Dependency tree · two levels

64 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