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.
Every geometric braid is braid-isotopic to a smooth braid
Statement
Assume . Let be a geometric braid on strands based at . Then for every there is a braid all of whose strand maps are smooth, together with a braid isotopy from to such that
Moreover the isotopy is relative to the endpoints in the precise sense of Braid isotopy relative to the top and bottom endpoints: every slice is a braid based at , so every bottom endpoint is the fixed point , and the top endpoints may be taken individually fixed, , so that the endpoint permutation is preserved. If the given braid is already smooth on a neighbourhood of and , the construction below may be centred there and the isotopy may be taken trivial on a neighbourhood of the endpoints; for an arbitrary continuous braid the endpoint values remain fixed as above, and neighbourhood agreement cannot be required unless the original strands are smooth on such a neighbourhood.
Facts & Assumptions
Given: , a geometric braid based at (Geometric braids in the disc with setwise endpoints), and a real number .
is the countable axiom of choice (The Axiom of Countable Choice ()).
Assume . Let be continuous on a smooth manifold and let be a positive continuous error function. Then there exists a smooth map with for all (Whitney approximation for Euclidean-valued maps).
A geometric braid on strands based at is an -tuple of continuous maps with for , for every , and (Geometric braids in the disc with setwise endpoints).
A braid isotopy from to is an -tuple of jointly continuous maps such that every slice is a braid based at , and , (Braid isotopy relative to the top and bottom endpoints).
Proof
Empty, singleton and uniform margins. For choose the empty smooth braid and constant empty isotopy; every assertion is vacuous. Henceforth . The finite disk-boundary function is positive and continuous on , so has positive minimum. If , the finite collision function also has positive minimum. Choose at most both minima when , and at most the boundary minimum alone when . Put , so and . No minimum of an empty pair list is used.
Approximate on a boundaryless domain. Extend the continuous tuple to by the constant tuple for and for . This extension is continuous because its values agree at . Apply [F2] on the boundaryless smooth manifold , with constant error , and restrict the resulting smooth map to . It gives with for every . Thus no boundaryless Whitney assertion is applied directly to .
Exact endpoint collars, including preserved smooth germs. Choose so on and on for all . Take smooth cutoffs supported in these disjoint collars and equal to one on the half-sized endpoint collars. Ordinarily use the constant collar data , . If the original strands are smooth in an endpoint neighbourhood, shrink the corresponding collar into that neighbourhood and instead use or there. The products with their cutoffs extend smoothly by zero off the collars. Define . This is smooth with , . In the already-smooth case it agrees with throughout the smaller original endpoint neighbourhood, rather than replacing that neighbourhood by a constant.
All collar choices satisfy the same error bound. On either collar, the replacement error is less than for constant data and zero for preserved original data. Since the cutoffs have disjoint supports and weights sum to one, . This covers both arbitrary continuous endpoints and already-smooth endpoint neighbourhoods.
The repaired motion is a braid, with the same endpoints. For all and all , so the values are pairwise distinct; and , so they lie in . Together with and from [F3] and step 3.1, this shows that is a braid based at , smooth by step 3.1, whose endpoint permutation equals that of because for every .
The straight-line isotopy. Define for . It is jointly continuous, and , and every slice is a braid based at : for all , so the values are pairwise distinct (their pairwise distances are at least ) and lie in ; moreover and for every . Hence is a braid isotopy from to the smooth braid .
Conclusion. By step 6.1 the smooth braid is braid-isotopic to through the isotopy , whose deviation from satisfies by the choice of in step 1.1. The isotopy keeps every bottom endpoint fixed pointwise and every individual top endpoint fixed, so the endpoint permutation is preserved by step 5.1. Where a smooth original collar was retained in step 3.1, there, so the entire straight-line isotopy is also fixed there. Taking proves the statement for the prescribed , and was arbitrary.
Depends on
Used by
Dependency tree · two levels
27 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
- 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)
- Birman and Brendle, Braids: A Survey, Handbook of Knot Theory chapter, author manuscript; section 1.2-2, printed pp. 5-13 (standard reference, not scraped)