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.
Torus links as closures of two-strand braids
Example
For let (The braid group by Artin presentation), and let be its oriented closure (The closure of a geometric braid). Then is the torus link: it has components, namely two components when is even and one component when is odd. In the small cases the closure is the standard picture of the torus link: for it is the two-component unlink, for it is the unknot, and for it is the trefoil, the two signs giving the two mirror images. Here the unknot is the closure of the trivial one-strand braid, the two-component unlink is the closure of the trivial two-strand braid, and the trefoil is the closure of ; those closures are the definitions used for these three links on this page.
Facts & Assumptions
Given: An integer and the finite word in ; no choice axiom is assumed.
The fixed closure map is ; permutation cycles give its components. Finite words have explicit smooth endpoint-flat models, and the trivial two-braid bounds the specified disjoint latitude-cap disks (The closure of a geometric braid).
For the fixed basepoints are , , and a signed elementary half twist rotates them through the corresponding signed half turn; its permutation is (The elementary geometric half twist, its support disc, and its opposite, The braid group by Artin presentation).
A smooth Euclidean map with nonzero Jacobian determinant has a smooth local inverse, without any choice assumption (Choice-free smooth inverse function theorem in Euclidean space).
Verification
The literal word model and component count. Write . The finite signed half-turn word has disk strands , where is smooth, , and all positive-order endpoint derivatives vanish. Take at ; concatenating the finitely many flattened half-turn angles gives such a for every other . The two points stay distinct. Its literal smooth closure has , by [F1]. The endpoint permutation is , so there is one component when is odd and two when is even, including . This is , with the positive gcd convention for negative .
An explicit ambient isotopy to the uniform torus model. Set . Its values at both ends are zero, its first derivatives at both ends are , and all higher endpoint derivatives agree; hence it is a smooth function on the page circle. Choose a fixed smooth radial cutoff equal to one near and zero near . On use . Its inverse rotates by the negative angle, since is unchanged. It is a smooth isotopy, and through the explicit it extends by identity across the axis because the cutoff is zero near the disk boundary. It preserves orientation as a smooth path of diffeomorphisms starting at identity. At the curve is exactly , . For odd , concatenate its two strands with parameter ; this gives , , with winding pair after parameter . For even , each strand is a circle with winding pair and the two are disjoint. These are the standard torus curves , including the stated component count. No generic continuous-braid smoothing theorem or Markov-preservation assumption is used.
The two one-crossing oriented unknots without Choice. For , use the chart of with and . Its inverse is , so it is explicitly . The curve from step 2.1 has constant. Move this disk point along the real segment from to by finitely many small cutoff translations , with compact support in and . A fixed smooth bump and a sufficiently fine finite subdivision suffice because that compact segment has positive distance from the boundary. The inverse is the unique limit of , starting at : successive differences are bounded by a geometric sequence with ratio at most , so the explicit sequence converges and its fixed point is unique. The Jacobian has determinant ; [F3] makes the already constructed inverse smooth locally and hence globally. Each map is identity outside its compact interior support, so gives a disk diffeomorphism. Compose these finitely many disk-map families with the same parameter ; the finite smooth composition starts at identity and at sends to . Its product with the unchanged extends by identity across , since there. This ambient isotopy takes the curve to . The explicit unitary rotation , , then takes it to the trivial one-braid circle . For its orientation is already the positive page orientation. For reverse that circle's negative angular orientation using ; this map is the endpoint of the explicit rotation in the real plane of the two imaginary coordinates, an orientation-preserving path in . Thus both signs give the oriented unknot. Every construction is explicit or a finite selection; no countable choice is used.
The unlink, trefoils and conclusion. At step 1.1 is the literal trivial two-braid closure, whose explicit disjoint spanning disks are [F1]. At , step 2.1 gives the standard torus knots, the trefoils named in the Statement. The map changes to and reverses the ambient orientation, so the two are mirrors. Steps 1.1-3.1 give the component formula and both one-crossing unknots, and the coordinate curves verify for every integer .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
28 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
- Birman and Brendle, Braids: A Survey, Handbook of Knot Theory chapter, author manuscript; section 2, printed pp. 12-26 (standard reference, not scraped)
- Ozsvath, Stipsicz and Szabo, Grid Homology for Knots and Links, AMS Surveys and Monographs 208 (2015); section 2.1, printed pp. 13-19; Appendix B.1, printed pp. 367-372 (standard reference, not scraped)