Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

The upper link-diagram region is free on strand meridians

Statement

Assume countable choice.

Let D be a finite regular oriented diagram of a nonempty labeled link with n≥1 crossings. Fix a smooth height realization LD={(γ(s),η(s))}⊂R2×[−1,0] such that η(s)=−1 exactly at the n underpassing points and η(s)>−1 elsewhere, and assume each component has at least one underpassing point. Put M=(R2×(−1,∞))∖LD. Cut every component parameter circle at its underpassing points; the resulting n open intervals are the strands. For each strand interval Ij, its vertical sheet is Dj={(γ(s),z):s∈Ij, −1<z<η(s)}⊂M. Set Z=M∖⋃j=1nDj. Choose a common basepoint in Z, and for each strand choose a positive meridian circle meeting only its own sheet once, with its access path in Z. Then π1(M) is free on these based positive meridians x1,…,xn. The inclusion M↪AL also induces an isomorphism on fundamental groups.

Statement references

Facts & Assumptions

Given: The diagram, height realization, product-tube data, and based positive meridians specified in the statement.

[A1]

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

[F1]

The inclusion of the upper half-space with its point at infinity into AL is a homotopy equivalence by the variable-width level-sphere collar. A punctured-sphere cover from a labeled link diagram

[F2]

For an open cover by two path-connected sets with path-connected intersection, Seifert–van Kampen identifies the fundamental group of the union with the pushout. Seifert–van Kampen identifies the fundamental group with a group pushout

[F3]

Under countable choice, every closed smooth embedded submanifold has an open tubular neighborhood in its normal bundle. The tubular neighbourhood theorem in a smooth ambient manifold, The Axiom of Countable Choice (ACω)

[F4]

Cutting along a closed simply connected hypersurface with a two-sided simply connected tube and a one-tube corridor in the complement adds one free cyclic factor to the fundamental group. Cutting along a simply connected hypersurface adds one free generator

[F5]

A positive meridian is the oriented boundary of a normal disk, with orientation fixed by the link tangent followed by disk orientation. Based string links and labeled link peripheral systems

Proof

Given: The diagram and height realization in the statement.

1.1F1F2givenconstruct

Let AL∘=((R2×(−1,∞))∪{∞})∖LD. By [F1], π1(AL∘)≅π1(AL). A small neighborhood H of ∞ in AL∘ is the open upper half-ball together with its cone vertex ∞, disjoint from LD; other points of the level-sphere boundary have been deleted. The open cover AL∘=M∪H has intersection H∖{∞}, which is homeomorphic to (0,1)×int⁡(S+2) and is contractible because the open hemisphere int⁡(S+2) is an open disk. Since H is also contractible, [F2] gives π1(M)≅π1(AL∘).

1.2givenconstruct

Each Dj is the image of the open region (s,t)↦(γ(s),−1+t(η(s)+1)) with s∈Ij and 0<t<1; this is an embedded open disk. At a projected double point, the underpassing branch has height −1 and is absent from M, while the overpassing branch has height greater than −1. Thus sheets over distinct intervals are disjoint. Each sheet is closed in M: its only limit points outside itself lie on the excluded plane z=−1 or on the excluded link. Hence it is a proper smooth embedded simply connected surface.

2.1step 1.2givenconstruct

At a fixed vertical line, every point of Z lies above all link points on that line. Since every link height is at most 0, the straight homotopy (x,y,z)↦(x,y,(1−t)z+t) (0≤t≤1) stays above those link points and contracts Z onto the plane z=1. This plane is contained in Z, so Z is contractible.

3.1A1F3F4givenstep 1.2step 2.1inductionconstruct

For j=1,…,n, put Mj=M∖⋃k>jDk. Then M0=Z and Mj=Mj−1∪Dj. At each stage Mj−1 is path-connected: it contains path-connected Z, and every point of an earlier sheet joins to Z along a short normal segment. Orient Dj by its interval and height coordinates. The ambient orientation orients its normal line, so that line bundle is trivial; a bundle metric gives the unique positive unit vector in each fibre. By [A1, F3], choose a tubular neighborhood disjoint from the other sheets. Radial contraction shows the whole neighborhood and each of its two side components are simply connected. Choose a small positive meridian circle around an interior point of the jth strand in a ball disjoint from all other sheets. It meets Dj transversely once. Remove a short open arc about that intersection; the remaining compact arc lies in Mj−1 and joins the two sides of Dj. Shrink the tubular neighborhood so that it meets this arc only in two end balls. This gives the corridor required by [F4], and its complement hypothesis holds because Mj∖Dj=Mj−1 is path-connected.

4.1F4F5step 1.1step 3.1inductionconstruct∎

The cut lemma [F4] gives π1(Mj)≅π1(Mj−1)∗Z. Its cyclic generator is represented by the short meridian arc crossing Dj followed by the complementary arc from step 3.1. Joining this loop to the basepoint by its access path in Z gives exactly xj, with positive orientation fixed by [F5]. Since π1(M0)=π1(Z)=1, induction yields that π1(M) is free on x1,…,xn. Step 1.1 identifies this with π1(AL).

Remarks

The cross-section shows one sheet below a strand between two underpassing points. The embedded sheet is a disk strip, and its two side collars are the two components used in the van Kampen step; the proof uses these products, not the drawing.

\begin{tikzpicture}[scale=1.0,>=stealth]
  \draw[thick] (-2,0) -- (2,0) node[right] {$z=-1$};
  \draw[thick,->] (-1.5,2) .. controls (-0.5,2.3) and (0.5,2.3) .. (1.5,2);
  \draw[dashed] (-1.5,0) .. controls (-0.5,0.5) and (0.5,0.5) .. (1.5,0);
  \draw[dotted] (-1.5,0) -- (-1.5,2);
  \draw[dotted] (1.5,0) -- (1.5,2);
  \node at (-1.5,-0.25) {$p_-$};
  \node at (1.5,-0.25) {$p_+$};
  \node at (0,0.85) {$D_j$};
  \node at (0,2.35) {strand};
  \node at (0,-0.55) {level sphere};
\end{tikzpicture}

Depends on

Used by

Dependency tree · two levels

37 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