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 be the oriented closed disk and give the product orientation. An -component string link is an ordered family of pairwise disjoint smooth proper embeddings , for , with fixed distinct endpoints and and fixed product collars at the endpoints. Orient each interval from bottom to top. The exterior is obtained by removing the relative interiors of chosen pairwise disjoint product tubes around the intervals. The bottom and top punctured disks and are the copies of with the interiors of the endpoint tube disks removed.
Choose a basepoint on the outer boundary of , a path in the side boundary of 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 . 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 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 and identifying their matching endpoint collars. For closure, fix once and for all a standard zero-framed unknotted embedding , and identify with . Adjoin to each strand the fixed product arc , 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 in the oriented three-sphere, choose pairwise disjoint closed product tubes , put , and write . A positive meridian is the oriented boundary of a normal disk, with the disk orientation fixed by the rule that the oriented tangent of followed by the disk orientation gives the ambient orientation. A degree-one parallel is a simple closed curve on whose projection to has degree . 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 , the self-meridian coordinate of a longitude is its coefficient on . 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.
Definition references
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
- Truncated Milnor invariants from a based link diagram Algorithm
- Pairwise linking numbers do not classify labeled links Counterexample
- Integer Milnor coefficients and closed-link residues Definition
- Lower-central series and Magnus expansion for links Definition
- The Borromean string link has nonzero triple Milnor invariant Example
- A punctured-sphere cover from a labeled link diagram Lemma
- Diagram word for a preferred peripheral longitude Lemma
- Finite nilpotent link quotients are generated by component meridians Lemma
- Finite nilpotent peripheral presentation from a link diagram Lemma
- Local meridian conjugacy at a labeled link crossing Lemma
- Milnor basing indeterminacy and self-crossing scope Lemma
- String-link exterior homology and end-meridian maps Lemma
- The upper link-diagram region is free on strand meridians Lemma
- Isotopy invariance and nonrepeating link-homotopy scope of Milnor invariants Theorem
- String-link end inclusions identify finite nilpotent peripheral quotients Theorem
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
- Cohen, Komendarczyk, Koytcheff and Shonkwiler, Homotopy String Links and the kappa-Invariant (standard reference, not scraped)
- John Milnor, Link Groups (standard reference, not scraped)
- Ryan Stees, Milnor’s Invariants for Knots and Links in Closed Orientable 3-Manifolds (standard reference, not scraped)