Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (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.

Disconnected projection components admit a separating Jordan curve

Statement

Let P⊂S2 be the nonempty finite projection graph of a regular link diagram. If P is disconnected, there is a simple closed curve γ⊂S2∖P such that P has points on both sides of γ.

Facts & Assumptions

Given: A nonempty finite disconnected projection graph P⊂S2.

[F1]

A regular projection is a finite graph with finitely many transverse double points and no triple points; crossingless link components are embedded circles (Regular oriented link diagrams).

[F2]

A smooth Jordan curve in the plane has one bounded and one unbounded complementary region, with the curve as their common boundary; this separation is established in Proof 2.1 of Choice-free smooth Jordan disk parameters and prescribed collars. For a smooth curve on S2, delete a point off the curve and use a stereographic chart. Adding that point back to the unbounded region leaves it connected and does not meet the closure of the bounded region, so there are exactly two complementary components on S2. The smooth boundary collar shows that every transverse crossing switches components. Only separation, rather than disk parameters for both spherical sides, is needed here.

Proof

1.1givenF1construct

Choose one connected component P0 of P. Around each of its finitely many vertices take a small closed disk, and around each edge take a narrow closed strip joining the incident vertex disks; for a crossingless circle take an annular neighborhood. Round the finitely many corners. Because the graph is finite and its distinct components are disjoint compact sets, the disks and strips can be chosen so that their union N is a compact connected subsurface of S2 with smooth finite boundary, contains P0 in its interior, and misses every other component of P.

2.1givenF1F2step 1.1construct

Choose points p0∈P0 and p1 in another component of P. Choose a piecewise-smooth path from p0 to p1 transverse to the finite smooth boundary ∂N. Its endpoints lie respectively in the interior of N and outside N, so it crosses ∂N an odd number of times. The boundary has finitely many disjoint simple closed components; at least one, call it γ, is met an odd number of times. The curve γ lies in S2∖P, since N contains P0 in its interior and misses every other component. By [F2], every transverse crossing of γ switches sides, so p0 and p1 lie on opposite sides of γ.

3.1givenstep 1.1step 2.1cases∎

The construction uses finitely many neighborhoods and applies also when P0 is a crossingless circle; therefore it proves the asserted separation for every nonempty disconnected regular projection. Its chosen separating curve is a smooth boundary component of N.

Depends on

Used by

Dependency tree · two levels

4 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