Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Based string links and labeled link peripheral systems

Definition

Let D2 be the oriented closed disk and give C=D2×[0,1] the product orientation. An r-component string link is an ordered family of pairwise disjoint smooth proper embeddings τi:[0,1]→C, for 1≤i≤r, with fixed distinct endpoints τi(0)=(pi,0) and τi(1)=(pi,1) and fixed product collars at the endpoints. Orient each interval from bottom to top. The exterior Xτ is obtained by removing the relative interiors of chosen pairwise disjoint product tubes around the intervals. The bottom and top punctured disks P− and P+ are the copies of D2 with the interiors of the endpoint tube disks removed.

Choose a basepoint on the outer boundary of P−, a path in the side boundary of C to the corresponding top basepoint, and basing paths from these points to the component meridians. Each end inclusion, with the chosen connecting path for the top end, induces a based homomorphism ι±:π1(P±)→π1(Xτ). For each string component choose a parallel path on its tube boundary from the bottom endpoint to the top endpoint, and choose access paths that close it to a based loop using the fixed side connector. The resulting element of π1(Xτ) is its based string-link longitude; the parallel and access paths are part of the peripheral datum. The positively oriented boundaries of the endpoint tube disks are the designated meridian loops. Stacking two string links means rescaling them into the lower and upper halves of C and identifying their matching endpoint collars. For closure, fix once and for all a standard zero-framed unknotted embedding Ψ:D2×(R/2Z)↪S3, and identify C with Ψ(D2×[0,1]). Adjoin to each strand the fixed product arc Ψ({pi}×[1,2]), oriented from its top endpoint to its bottom endpoint. These disjoint outside arcs, with the fixed endpoint collars, define the closure and retain the component labels; arbitrary knotted or braided replacement arcs are not allowed.

For a nonempty labeled oriented link L=K1∪⋯∪Kr in the oriented three-sphere, choose pairwise disjoint closed product tubes N(Ki), put EL=S3∖int⁡(⋃iN(Ki)), and write Ti=∂N(Ki). A positive meridian μi is the oriented boundary of a normal disk, with the disk orientation fixed by the rule that the oriented tangent of Ki followed by the disk orientation gives the ambient orientation. A degree-one parallel is a simple closed curve on Ti whose projection to Ki has degree +1. A based longitude is the class of such a parallel transported to the common basepoint by a specified path. When the positive meridians form a basis of H1(EL;Z), the self-meridian coordinate of a longitude is its coefficient on [μi]. A preferred zero-self-meridian longitude is a chosen degree-one parallel whose self-meridian coordinate is zero. The choice, when it exists, is part of the peripheral datum; this definition asserts neither existence nor uniqueness. Changing a common basing path conjugates the peripheral group elements simultaneously.

Remarks

The product-tube choices, endpoint collars, basepoints, connecting path, labels, and longitude basings are part of the input. The term preferred zero-self-linking longitude names a condition on the peripheral data, not an existence theorem.

Depends on

Used by

Dependency tree · two levels

11 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