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.
Braid isotopy relative to the top and bottom endpoints
Definition
Let and let be the base configuration of Geometric braids in the disc with setwise endpoints, so that braids based at are tuples of continuous maps satisfying conditions (1)--(3) of that definition. Write (Intervals of : the nine order-convex forms, nondegeneracy, and length) and give the product topology (The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).
Let and be braids based at . A braid isotopy from to relative to the top and bottom endpoints, or simply a braid isotopy, is an -tuple
of continuous maps (Continuity of a map of topological spaces at a point and globally) such that
- for every , the tuple is a braid based at , i.e. is continuous into , the values are pairwise distinct for every , the bottom condition holds for every and , and for every ;
- and for all and .
The first variable is the isotopy parameter and the second variable is the height; a family of motions depending on is a braid isotopy exactly when the map is jointly continuous, not merely continuous in for each fixed . When such a exists we say that and are braid-isotopic and write .
Relation to homotopy. A braid is a continuous map with additional properties, and a braid isotopy is a homotopy of such maps (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints) that is relative to the bottom subset , in the following sense: the homotopy condition for all says that the whole bottom point is fixed throughout the deformation. At the top, the condition is imposed setwise: . Joint continuity then forces each individual top endpoint to remain constant as varies, since a continuous map from an interval into this finite discrete set is constant.
Endpoint permutations of the slices. Let be a braid isotopy from to . Each slice is a braid and hence has an endpoint permutation (Geometric braids in the disc with setwise endpoints, The finite symmetric group , one-line notation, and cycle notation). This definition does not separately impose that these slice permutations agree: it requires each slice to be a braid and the family to be jointly continuous. The slice permutations do agree, and therefore the endpoint permutation is an invariant of braid isotopy, with ; this is proved on this page, in the stacking proposition, by a connectedness argument for the height interval .
Isotopy of the ambient cylinder is not enough. The definition constrains the deformation to the product through height-preserving motions; it is neither an isotopy of an arbitrary embedded link nor a free homotopy of the tuple of paths. Deformations that make a strand meet a horizontal plane more than once, or that move bottom points, are not braid isotopies; a counterexample is recorded on the companion examples page.
Depends on
- Geometric braids in the disc with setwise endpoints
- Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints
- Continuity of a map of topological spaces at a point and globally
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- The finite symmetric group $S_n$, one-line notation, and cycle notation
Used by
- An arbitrary isotopy of arcs need not be a braid isotopy Counterexample
- Setwise endpoints do not make a braid pure Counterexample
- Geometric two strand braids are integer twists Example
- The three strand geometric braid relation Example
- Every geometric braid is isotopic to a stacking of signed elementary half twists Lemma
- Far commutativity of elementary geometric half twists Lemma
- Geometric braids admit generic polygonal representatives Lemma
- The geometric three strand braid relation Lemma
- Stacking of geometric braids is a well-defined associative operation on isotopy classes Proposition
- The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism Theorem
Dependency tree · two levels
25 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
- Juan Gonzalez-Meneses, Basic results on braid groups, sections 1.2-1.3, printed pp. 4-5 (standard reference, not scraped)
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.1, author manuscript pp. 3-4 (standard reference, not scraped)