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.

Zero-edge normal exchange rectangles and annuli have cellwise product structures

Statement

Let F be a normal surface in a finite simplicial triangulation T. Cut F along a finite disjoint trace family satisfying the distinct-normal-side hypothesis of the positive patch-weight lemma, and let R be a connected compact cut patch missing T(1).

If R is a disk with two trace-arc boundary sides and two original-boundary arc sides, then its normal-cell regions form a finite chain of quadrilaterals. The opposite trace arcs are parallel by a PL product parametrization of R: every intermediate arc meets each region of this chain in one arc joining its two old sides, and its endpoints stay within the two original boundary sides. These old sides lie in distinct tetrahedral faces.

If R is an annulus whose two boundary components are trace circles and which misses ∂F, its normal-cell regions form a finite cycle of quadrilaterals. There is a PL product parametrization by S1×[0,1] taking its two trace circles to the two end levels and keeping each intervening arc within its original normal-cell region. A Mobius patch instead has the twisted interval-bundle model and does not have two trace boundary components.

The parallelisms take place on the cut patch, cell by cell in the original triangulation. No ambient three-dimensional product region or cancellation of a separate exchange surface is asserted.

Statement references

Normal exchange disk patches have positive edge weight

Normal exchange disk patches have positive edge weight — the exact zero-edge Euler cell count and distinct-side trace hypothesis.

Facts & Assumptions

Given: The normal surface, trace family and zero-edge patch in either case of the Statement. An old side interval is a portion of an original normal-cell side; a trace side is a portion of a cut trace.

[F1]

A zero-edge cut patch has normal-cell regions that are polygonal disks. A region with kj trace sides has kj old side intervals, alternating with those trace sides, and kj≥2. If the patch has b original-boundary arcs, each is one old side interval, and χ(R)=b2+∑j(1−kj2). (Normal exchange disk patches have positive edge weight)

[F2]

Each interior old interval is glued to precisely one other region side, while an original-boundary interval remains unglued. The trace sides are unglued boundary sides. Finite polygonal disk boundary identifications extend to PL disk parametrizations by triangulation and coning. (Polygonal Jordan curve theorem: a polygon has exactly two complementary regions and is the frontier of each, Every simple polygon admits a triangulation)

Proof

1.1givenF1constructalgebra

In the disk case χ(R)=1 and b=2; in the annulus or Mobius case χ(R)=0 and b=0. In both cases the Euler formula [F1] says that a sum of nonpositive terms is zero. Thus every kj=2. Each normal-cell region is a quadrilateral with two opposite trace sides and two opposite old sides. The old sides of one quadrilateral lie on distinct sides of its original normal disk: either trace side joins these two old sides, and the distinct-side trace hypothesis excludes their lying on the same normal-disk side. A normal disk has at most one side in any tetrahedral face, so these two faces are distinct.

2.1F1F2step 1.1construct

Make a finite graph with one vertex for each quadrilateral and an edge for each glued pair of old intervals, retaining loops and repeated edges if present. It is connected. Indeed, the quadrilaterals reconstruct the connected surface patch by precisely these old-side gluings. They cannot connect only at a vertex: every vertex is a trace endpoint on an old interval, and its half-disk surface chart joins its incident regions across that interval. Each graph vertex has degree two minus its number of unglued old sides, counting a loop twice. In the disk case there are exactly two unglued old sides by [F1], so the connected graph is a path, possibly one vertex with both ends unglued. To check this without a graph classification, start at one unglued side and follow the unique continuation through each quadrilateral and glued old side. Encountering an earlier vertex before the other unglued side would produce a cycle with no possible exit, contradicting connectedness and the remaining unglued side. Thus all vertices are met once and the traversal ends at the other unglued side. In the closed-boundary-strip case all degrees are two, and the same traversal closes into one cycle containing all vertices.

3.1F2step 1.1step 2.1construct

Parametrize every quadrilateral by a rectangle, with its old sides at the two ends in the chain direction and its trace sides at transverse levels zero and one. These parametrizations may be made compatible along successive old-side gluings: choose a PL parameter on the first old side, transport it across each gluing, and choose any increasing PL parameter on the next old side. The resulting four boundary interval maps extend to a PL rectangle map by [F2]. A concrete extension triangulates the boundary breakpoints, adds an interior vertex, and cones the boundary intervals; it is a homeomorphism because its triangular interiors partition the polygonal disk. Each intermediate transverse level then maps to an embedded arc joining the two old sides within that quadrilateral. Gluing the chain gives a PL product rectangle for the entire disk patch. Its two transverse end levels are exactly the two trace arcs, and its other sides are the two original-boundary intervals. The maps therefore give the claimed cellwise trace parallelism without changing an original cell.

4.1givenF2step 2.1step 3.1construct∎

In the cycle case cut along one old interval and perform the rectangle construction of step 3.1. Closing that cut identifies its two transverse parameter intervals by a PL interval homeomorphism. If the identification reverses their endpoint order, the two trace sides are joined into one boundary circle, giving the twisted rectangle model of a Mobius band. If it preserves endpoint order, reparametrize one of the end intervals by the inverse identification. The prescribed maps on the two old sides of the adjacent quadrilateral still extend by [F2], so this makes the closing identification the identity without changing the cell containing any point of an intermediate arc. The quotient is then a PL product S1×[0,1]. For the annulus in the Statement, its two distinct trace boundary circles rule out endpoint reversal. This proves both the product and the stated distinction from a Mobius patch, using only the finite original quadrilateral strip.

Depends on

Used by

Dependency tree · two levels

10 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