Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Between-copy annular exchanges on least disks have adjacent caps

Statement

Use the least-weight, lexicographically least essential disk D, distinct full-resolution copies D0,D1, actual annular exchange A, and disk caps E0,E1 of the between-copy annular cap-rigidity lemma. Supply a cellwise normal product P between D0,D1, with vertical boundary in ∂M.

Then E0,E1 are adjacent along A: their germs occupy the same side of its rectangular switching neighborhood. This holds without irreducibility or orientability. It does not assert normal parallelism of these caps when A lies outside P.

Facts & Assumptions

Given: The actual original diagram, the least disk, its two copies, the between-copy exchange and the cellwise product in the Statement.

[F1]

The caps have equal counts on every original edge. Between-copy annular exchange caps have rigid original edge counts

[F2]

If the actual exchange is contained in P, it is vertical for a cellwise parametrization and its two disk caps cobound its cap subproduct. Original between-copy exchanges contained in normal products are vertical

[F3]

A connected closed locally flat PL surface with even intersection number on each original edge separates its connected ambient component. Closed PL surfaces with even original-edge counts separate

Proof

1.1givenF1F3construct

The union S=E0∪A∪E1 is an embedded PL two-sphere in the interior of the ambient component containing P. Its abstract surface is a capped annulus, and its pieces have disjoint interiors. Keep this union as a PL surface without moving its points. It is locally flat: off the attaching circles it inherits the normal disk and exchange-rectangle product charts; along them a transverse switching rectangle contains two incident rays, which straighten by a finite sector map to a line. These are charts for the unchanged subset, so no rounding moves it into the interior of P. Its original-edge counts are N(S)=N(E0)+N(E1)=2N(E0) by [F1]. All are even, so [F3] makes S separating.

2.1givenF2step 1.1construct

If the interior of A meets the interior of P, it is wholly inside it. Indeed it is connected and misses the horizontal disks D0,D1 and the vertical boundary in ∂M, hence cannot cross ∂P. In that case A⊂P, and [F2] gives a cap product with vertical annulus A. Its caps occupy the same side of that annulus, proving adjacency. It remains to consider the case that the interior of A lies outside P. Then S misses int⁡P, since its other two pieces lie on the horizontal ends.

3.1givenF3step 1.1step 2.1constructcontradiction∎

In the remaining case suppose the caps were nonadjacent. Put Ki=Di∖Ei‾. Along each frontier circle the cap germ and the remainder germ are opposite rays of the resolved sheet. Hence nonadjacency of the two cap germs means that the two remainder germs also occupy opposite sides of A. Choose points qi in these remainder germs, sufficiently near the frontier, and use the two side collars of the interior of A to compare their sides of S. They approach opposite local sides of S at one common interior point of A. Each qi can also be pushed slightly into int⁡P without crossing S, because it belongs to the open remainder, not to its cap or frontier. The interior of the disk product is connected and disjoint from S by step 2.1, so these pushed points can be joined there. Together with the short pushes and side-collar paths, this joins the two local sides of S without crossing it. Closing that path by one short transverse interval produces a loop crossing S once, contradicting the separating conclusion in step 1.1 (or its parity proof [F3]). Thus nonadjacency is impossible. This argument fills no sphere by a ball and proves only the stated adjacency.

Depends on

Used by

Dependency tree · two levels

8 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