Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Wirtinger presentation correctness for labeled links

Statement

Assume countable choice.

Let D be a finite regular oriented diagram of a nonempty labeled link, after inserting a small type-I curl on any component that has no underpassing point. Let x1,…,xn be the positive meridians of the strands between successive underpassing points, with the compatible common-upper-collar accesses of the local crossing rule. At a crossing c, write o(c) for the over-strand and s(c),t(c) for the source and target under-sides defined using the positive in-plane normal to the over-strand. Set rc=xo(c)−1xs(c)xo(c)xt(c)−1. Then the assignment of each generator to its based positive meridian induces an isomorphism ⟨x1,…,xn∣rc (c a crossing)⟩≅π1(EL). Any one crossing relator may be omitted without changing the represented group. The theorem makes no claim that all relators are independent.

Arbitrary independently based positive strand meridians remain recorded: if ge is the access difference for strand e, its actual class is ye=gexege−1 in this reference presentation. This gives their exact group elements without claiming that the independently conjugated ye themselves freely generate the upper region or give the displayed uncorrected presentation. A common access change conjugates every generator and preserves the displayed presentation map.

Facts & Assumptions

Given: The link diagram, its labels, crossing conventions, a smooth realization L, and common based meridian paths. Here EL denotes the exterior of arbitrary specified pairwise-disjoint closed product tubes N(Ki) about the components of L, with their product parametrizations; thus EL=S3∖int⁡(⋃iN(Ki)). Choose the group basepoint in EL. Compatible diagram meridians may first be represented in X=S3∖L; their images under the product-tube radial retraction are the based positive meridians in the displayed exterior group. These are auxiliary choices for the exterior and its marking, not extra restrictions on the link.

[A1]

Countable choice, written ACω, is The Axiom of Countable Choice (ACω).

[F1]

For the normalized realization, X=S3∖L has an open cover whose upper piece is generated freely by the strand meridians, whose lower piece is contractible, and whose overlap is a punctured sphere with crossing circles normally generating its fundamental group even after one is omitted. For the specified product tubes the cover supplier also gives the radial deformation retraction R:X→EL, fixed on EL. A punctured-sphere cover from a labeled link diagram, The upper link-diagram region is free on strand meridians

[F2]

The Seifert–van Kampen theorem identifies the fundamental group of a union with the pushout of the two inclusion maps from a path-connected overlap. Seifert–van Kampen identifies the fundamental group with a group pushout, A group pushout is the quotient of a free product by the amalgamating relations

[F3]

Under the upper-region meridian basis, the image of a small puncture circle at crossing c is conjugate to rc or rc−1; these have the same normal closure. Local meridian conjugacy at a labeled link crossing

[F4]

A group presentation is the quotient of the free group on the stated generators by the normal closure of the stated relators. Group presentation by generators and relations, Free group on a set of generators

[F5]

A regular link diagram whose components have underpasses has an ambient-isotopic height realization with every underpass at height −1 and all other points above −1. A regular link diagram admits a normalized height realization

Proof

Given: Countable choice, the link diagram and smooth realization, and the common based meridian paths in the Statement.

1.1F5givenconstruct

If a component has no underpassing point, insert a small type-I curl in a disk meeting only that component. The local curl is the boundary of a disk pushed into a ball disjoint from the rest of the link, so removing it by the reverse isotopy identifies the resulting link with the original. After this finite operation each component has an underpass. Apply [F5] to obtain the normalized height model required by the cover supplier. If h is the resulting ambient isotopy's endpoint, transport each specified tube parametrization by h, together with the basepoint and all based paths. Then h(EL) is exactly the exterior of these transported tubes, and h identifies its based positive meridians with the original ones. Work in this normalized model and retain the names L,EL.

2.1A1F1F2step 1.1

By [A1, F1], the upper-region group is free on x1,…,xn, the lower-region group is trivial, and the overlap group is normally generated by the crossing circles c1,…,cn. Applying [F2] to the open cover of X, the pushout with a trivial lower group is the quotient of the upper group by the normal closure of the images of these circles. This quotient initially computes π1(X). Use common basepoint-change paths when passing between the overlap basepoint and the reference upper basepoint; this conjugates all generator images by the same path, consistently with the given common basing.

3.1F1F3F4step 1.1step 2.1construct

By [F3], the normal closure in the upper group of the images of the crossing circles is the normal closure of the relators rc. By [F4], the pushout quotient is therefore the stated Wirtinger presentation of π1(X). Now apply the radial retraction from [F1]: in each punctured product tube, write a point as (θ,rω) with 0<r≤1 and ∣ω∣=1, and use (θ,rω)↦(θ,((1−t)r+t)ω) for 0≤t≤1, fixing the exterior. These formulas agree with the identity at r=1, so they give the based deformation retraction R:X→EL. It sends a positive small normal circle to the corresponding positive tube-boundary meridian, and fixes any already exterior-based loop. Thus composing the presentation isomorphism with R∗ gives exactly the stated isomorphism to π1(EL) with its positive-meridian marking; retracting the common basepoint-change paths gives the same based identification. Transporting back by h−1 restores the originally specified exterior.

4.1F1step 3.1

The cover lemma also states that any n−1 of the crossing circles normally generate the overlap group. Replacing the full list by any list omitting one circle therefore gives the same normal closure in the upper group, hence the same group π1(X) and, under the fixed isomorphism R∗, the same marked exterior-group presentation from step 3.1.

5.1givenstep 3.1constructalgebra∎

For an arbitrary access ae′ to the same positive meridian circle reached by the reference access ae, set ge=ae′ae−1. Cancellation of reversed paths gives ae′μe(ae′)−1=ge(aeμeae−1)ge−1=gexege−1 in the actual exterior group and hence, by step 3.1, in its reference presentation. If one common based loop is prepended to all accesses, this is simultaneous conjugation and so an inner automorphism of the target. Independent ge need not define an automorphism or even a generating tuple, which is why no such assertion is made. All geometric based meridian data are retained by these explicit words.

Depends on

Used by

Dependency tree · two levels

35 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