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.
The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism
Statement
Let and let be the base configuration of Geometric braids in the disc with setwise endpoints. Write
for the set of braid isotopy classes relative to the top and bottom (Braid isotopy relative to the top and bottom endpoints), and let be the stacking of Stacking of geometric braids is a well-defined associative operation on isotopy classes. Then:
(a) is a group (Group and abelian group) with this operation. Its identity is the class of the trivial braid , and the inverse of , for with endpoint permutation , is the class of the reversed braid
(b) The endpoint permutation map
is a well-defined group homomorphism (The finite symmetric group , one-line notation, and cycle notation).
The construction is choice-free: all motions and reparametrisations used are given by explicit formulas.
Facts & Assumptions
Given: A natural number , the base configuration , braids , , based at , the trivial braid , and isotopy classes as above.
A braid based at is a tuple of continuous maps with for , , and ; the endpoint permutation is the unique permutation with ; a braid is pure exactly when , and the trivial braid is pure (Geometric braids in the disc with setwise endpoints, The finite symmetric group , one-line notation, and cycle notation).
Stacking of Stacking of geometric braids is a well-defined associative operation on isotopy classes is well defined on isotopy classes and associative, , and the endpoint permutation is constant along braid isotopies: if then .
A braid isotopy from to is a tuple of jointly continuous maps such that every slice is a braid based at and , for all ; isotopy implies homotopy of the strands relative to the endpoints of the motions, in the sense of Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints (Braid isotopy relative to the top and bottom endpoints).
A group is a set with an associative binary operation, a two-sided identity and two-sided inverses (Group and abelian group).
Composites of continuous maps are continuous, continuity on a finite closed cover pastes, and the interval carries the subspace topology in which and are closed and cover (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous, Intervals of : the nine order-convex forms, nondegeneracy, and length).
Proof
(a), the identity. Write and ; since the right factor of a stacking runs during the first half of the height interval, for and for , while for and for ; so and are the reparametrisations and of the tuple . Both and are continuous nondecreasing maps of onto fixing and by [L5], so for the maps and are again of that kind, and , are jointly continuous by [L5]; each slice is a braid based at , because , and the collision-freeness and continuity conditions of [F1] are inherited from , and likewise for ; the boundary slices are , and by , , . Hence and , so is a two-sided identity for the operation of [F2].
(a), the inverse is a braid. For each is a composite of continuous maps with values in , and for because is injective and the are collision-free by [F1]; its bottom values are , using the defining property of in [F1], and its top values are , which run through the set ; hence is a braid based at with .
(b). The map is well defined on classes by the constancy of the endpoint permutation along isotopies in [F2]; it satisfies by [F2], and because is pure by [F1]; a map of groups that preserves the operation and the identity is a group homomorphism into the symmetric group of The finite symmetric group , one-line notation, and cycle notation, so the formula , , defines a group homomorphism once is known to be a group.
(a), . By the stacking formula of [F2] and step 1.2, for and for ; that is, is the out-and-back reparametrisation of with for and for . For put ; then is continuous with , so is jointly continuous by [L5], each slice is a braid based at because it is a reparametrisation of the collision-free tuple with all bottom and top values equal to , and the boundary slices are at and at ; hence .
(a), . By the same computation with the roles of the two factors exchanged, for and for , which is again an out-and-back parametrisation of with the labels relabelled by ; putting for and for , and then , gives a braid isotopy: , so every slice begins and ends at and is collision-free; at the slice is the constant braid. Thus this is a braid isotopy from to .
(a), conclusion. By steps 1.1, 2.1 and 3.1 the operation of [F2] on the isotopy classes based at is associative, has the two-sided identity class , and gives for every ; by [L4] the set of isotopy classes is therefore a group with identity and .
Assertions (a) and (b) are steps 4.1 and 1.3, the latter now applicable because step 4.1 makes a group; the group structure uses only the explicit stacking, reversal and reparametrisation formulas displayed above. ∎
Remarks
- The inverse is built from time reversal together with the relabelling at the top; the relabelling is necessary because braid isotopy fixes the bottom points but only the top set, so a naive time reversal of the tuple would not return the bottom labels.
- For the set has exactly one element and is trivial, so both assertions are immediate; for the group consists of the isotopy classes of loops in the disc based at . This page does not determine , and no claim about it is used later.
- No choice principle is used: the identity isotopies are the explicit reparametrisations , and the inverse is the explicit formula .
Depends on
- Stacking of geometric braids is a well-defined associative operation on isotopy classes
- Braid isotopy relative to the top and bottom endpoints
- Geometric braids in the disc with setwise endpoints
- Group and abelian group
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints
Used by
- Setwise endpoints do not make a braid pure Counterexample
- The elementary geometric half twist, its support disc, and its opposite Definition
- 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
- The geometric three strand braid relation Lemma
- The Artin presentation surjects onto the geometric braid group Proposition
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
- 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)