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

Eliminating double curves of a two-sheeted polygonal disk

Statement

Let M be an orientable piecewise linear three-manifold with boundary, let F be a connected subsurface of its boundary, and let N be a normal subgroup of π1(F). Suppose f:D→M is a proper piecewise linear immersion of a finite polygonal disk, with f(∂D)⊂F, having only regular double curves and with no point having more than two inverse images. More precisely, the double-value set is a finite disjoint union of circles in the interior and arcs properly ending in the boundary; near a double value the two sheets are transverse planes, or transverse half-planes at an endpoint, and there are no other singularities. If the boundary loop of f does not represent an element of N, then there is a properly embedded piecewise linear disk in M whose boundary lies in F and does not represent an element of N.

Membership in N for an unbased boundary loop is interpreted after joining it to a fixed basepoint in F. It is independent of that joining path because N is normal. The disk produced need not have the same boundary as f.

Facts & Assumptions

Given: M,F,N,D,f with the stated finite regular-double-curve conditions.

[F1]

Finite simple polygonal circles in a disk bound polygonal subdisks; cutting along a proper simple polygonal arc splits a disk into two disks. Prescribed piecewise linear boundary identifications between polygonal disks extend over them, and finite arcs have polygonal strip neighborhoods (Finite polygonal disk parametrizations and boundary surgery). For the cutting assertion, join the proper arc to each of the two boundary intervals and apply the polygonal disk assertion after separating shared endpoints by a small polygonal collar.

[F2]

Loop concatenation and reversal define π1(F); conjugating a loop changes its chosen basepath, and a normal subgroup is closed under conjugation, products and inverses (Based loops and the fundamental group, Normal subgroup: invariance under conjugation).

Proof

Given: The data of the Statement. All modifications below use finite polygonal subdivisions and sufficiently small polygonal neighborhoods.

1.1givenconstruct

Each double circle has two distinct preimage circles in D, and its normal crossing neighborhood is a product of that circle with a planar cross. To check the possible monodromy, orient D and M. Each sheet has its induced coorientation, and the ordered pair of sheet coorientations orients their intersection line. If continuation once around the double circle interchanged the sheets, this orientation of the intersection line would be reversed, which is impossible on a circle. Thus the two sheets return individually. The orientation of each sheet and of the intersection line also preserves each of its transverse directions; consequently no pair of opposite arms is interchanged. Trivializing the interval strips in the two sheets therefore gives the product cross. No rotation or reflection monodromy remains.

2.1F1step 1.1construct

The two preimage circles of a chosen double circle bound disks D1,D2⊂D by [F1]. If they are nested, say D1⊂Int⁡D2, replace the part D2 by a copy of D1, matching boundary points with the same image under f, and retain the outside of D2. If they are disjoint, interchange the maps on D1 and D2, with those same boundary identifications, and retain the rest. The identifications extend over the disks by [F1]. At the joining circle resolve the crossing by connecting adjacent arms of the planar cross instead of opposite arms. The resolution can be made polygonal: in a small square normal section replace the two crossing segments by two disjoint bent polygonal arcs joining the selected adjacent pairs, equal to the old arms near the square boundary. Taking products with successive subintervals of the double circle gives matching polygonal annuli; step 1.1 ensures their end identifications agree. This removes that double circle. The retained domain is a disk, its external boundary map is unchanged, and each retained old sheet piece is used at most once. Outside the crossing neighborhood no new double value is introduced; inside it the replacement sheets are disjoint. Other double curves miss this neighborhood and are either retained or discarded.

3.1givenstep 2.1

Repeat step 2.1 until there are no double circles. The number of double curves strictly decreases at every repetition and was finite initially. Each new disk is still a proper polygonal immersion with at most two preimages per value, regular double arcs, and the original boundary loop. The intermediate disk need not lift to an embedding in any covering space; this proof concerns the immersion in M itself.

4.1F1givenstep 3.1construct

Choose a double arc C. Its two preimage arcs a,b are disjoint proper arcs in the disk. They cut it into three polygonal disks, in order an outer piece, a middle piece, and the other outer piece. Orient the boundary of D, and label its four successive portions by α,β,γ,δ so that α and γ are the exposed boundary intervals of the outer pieces. The two ways of matching the orientations of a and b give the following boundary words after the two possible crossing resolutions: originalfirst disksecond disksame orientationαβγδαγαβ−1γδ−1opposite orientationsαβγδαγ−1αδγβ. Here all boundary paths are their images in F; short joining paths inside the endpoint half-disk neighborhoods have been collapsed in the written words. They are homotopic to the actual polygonal boundary paths. To verify the domains and the words, cut along a,b, and use the common parametrization of their images C to match the cut shores. Joining the two outer disks along one shore produces the first disk, with the exposed intervals α,γ read in the matching directions. Joining all three disks in the other order along two shores produces the second disk; following its boundary reads the remaining word in the table. Each join is along a full boundary interval, hence gives a disk by [F1]. Each old piece is used at most once in either candidate. This surgery will be applied after the circle eliminations of step 3.1.

5.1givenF1step 2.1step 4.1construct

Realize each of these two gluings in M by the corresponding adjacent-arm resolution along C. In a transverse square use the two disjoint bent arcs described in step 2.1. At an endpoint use its half-space version; the changed boundary arcs stay in F, since that endpoint has a neighborhood in the subsurface containing the original boundary germs. Subdivide finitely along C to obtain polygonal product strips, and use a width smaller than their positive distances to all other double curves and to nonincident sheet pieces. Thus the replacement is a proper polygonal immersion with no double value along C and with no newly introduced double curve. Away from the strip it uses a subset of the old sheet pieces, with no repetition. The two-to-one bound is therefore preserved. The remaining double curves are among the old ones other than C.

6.1F2step 4.1step 5.1

At least one candidate disk still has its boundary class outside N. In the first row of the table put w=αβγδ, u=αγ, v=αβ−1γδ−1. Cancellation of successive reversed paths gives w=uδ−1v−1uδ. In the second row put u=αγ−1 and v=αδγβ. Then the corresponding cancellation identity is w=u(γδ)−1u−1v(γδ). These are identities of composable paths with the indicated common endpoint identifications; inserting basepaths turns them into products of conjugates in π1(F). By [F2], if both candidate boundary classes belonged to N, so would w, contradicting the induction hypothesis. Retain a candidate whose boundary class is outside N.

7.1givenstep 3.1step 5.1step 6.1∎

Repeat steps 4.1–6.1. Each repetition removes at least one double arc and introduces none, so after finitely many repetitions there is a proper polygonal immersion of a disk with no double values and with boundary class outside N. It is injective. A continuous injection of the compact disk into the Hausdorff manifold M is an embedding; its polygonal local models make this a piecewise linear proper embedding. Its boundary is in F, as required. All choices made in the construction are finite; no countable or arbitrary-index choice assumption has been used.

Remarks

This is the local double-curve-elimination half of the orientable loop theorem. An arbitrary nullhomotopy disk need not satisfy its two-sheeted immersion hypothesis. Establishing that reduction requires the separate finite twofold-cover tower argument; this lemma does not replace that argument or assert the full loop theorem.

Depends on

Used by

Dependency tree · two levels

13 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