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.
All standard generate
Statement
Assume the Axiom of Choice. For every let be the canonical base configuration of Geometric braids in the disc with setwise endpoints, so that and . Let be the standard pure braid generators of Standard geometric pure braid generators A_ij for . Then the subgroup generated by the classes ; for the family is empty and generates the trivial group . This asserts generation only: no presentation, no completeness of any list of relations, and no statement about the Artin presentation of is claimed. Once the statement is known at the canonical base configuration, a path in from to any other base configuration conjugates it to the corresponding statement there (Conjugating loop classes by a path is an isomorphism of fundamental groups).
Facts & Assumptions
Given: the Axiom of Choice and an integer with the canonical base configurations , of Geometric braids in the disc with setwise endpoints, the truncated configuration , the open-disc configuration spaces and , and the half twists at .
The Axiom of Choice holds (The Axiom of Choice).
In ZF, AC implies DC (AC implies DC implies countable choice).
is the pure braid group of the closed-disc convention at the configuration ; the inclusion induces an isomorphism at every configuration of interior points, and are trivial, and for the last-coordinate forgetting map fits into the short exact sequence with injective, surjective and , where the base configurations are and its truncation ; under the isomorphism the map corresponds to the open-disc forgetting map (The pure braid group as the fundamental group of an ordered configuration space, The Fadell-Neuwirth short exact sequence for pure braids, The interior-disc and closed-disc configuration spaces are homotopy equivalent).
At the base configuration the kernel of the forgetting map is free with free basis , the standard generators of the last column, interpreted through the isomorphism of [F4] (The are meridian generators of the forgetful free kernel).
The standard generators are the classes of the words (first-under-second stacking, empty outer blocks for ), where for the coordinate path of a pure geometric braid ; is an isomorphism , so for the open-disc class , and the word identity gives (Standard geometric pure braid generators A_ij, Pure geometric braids and ordered configuration loops, The pure braid group as the fundamental group of an ordered configuration space).
For the configuration with the half twist () is the motion , , all other strands fixed, with midpoint and diamond path for and for ; the opposite half twist replaces by the reflection , and (The elementary geometric half twist, its support disc, and its opposite).
For a path from to the radial-shell transport is an isomorphism with inverse transport by , and in degree one ; if is a homotopy of based cubes with basepoint track , meaning that every boundary face of the cube is mapped to , then (that is, for the corresponding maps). For the cube model is the loop model of the fundamental group (Higher homotopy basepoint transport and moving homotopies, Higher homotopy group by based cubes).
Proof
Base case. For the index set is empty, and the subgroup generated by the empty family is the trivial group, which equals by [F2].
Induction hypothesis. Fix and assume that the open-disc group is generated by the classes of the standard words at , ; equivalently, by [F4], that is generated by the classes .
Choice, the exact sequence, and the kernel. By [F1] the Axiom of Choice [A1] yields DC, so the short exact sequence of [F2] is available at level and base configuration , with truncation : the forgetting map has and is surjective, and under the isomorphism it corresponds to the open-disc forgetting map , so . By [F3] the kernel is generated by , and by [F4] ; since a subgroup generated by elements equals the one generated by their inverses, .
The affine comparison of the two configurations. Write for the configurations of [F5], so that , and for define the similarity of , so that and is the scaling followed by the translation by . For one computes , and the same computation gives for the midpoints, . Since the diamond paths of [F5] are for the fixed normalised shape given by for and for , one gets . Consequently , and the same equality holds for the reflected displacement ; the similarity has real coefficients and therefore commutes with the reflection that defines in [F5].
The comparison homotopy. Fix (there are no such pairs when ). Let be the coordinate path of the representative of at built from the motions of [F5], a loop in , and put for the loop in , so that ; let be the corresponding coordinate path of at and . Every strand of the word moves only inside the support discs of the half twists with and off the last strand, so for all (the fixed strands are the base points, of norm at most ). Because each factor of the word and each factor of is built from the same normalised diamond paths and the midpoints correspond under by step 1.4, and because respects stacking and time reparametrisation, the identities , for imply for every . Define . By step 1.4 each is injective, so the coordinates of are pairwise distinct, and , so takes values in and is continuous; moreover , , and the path satisfies because . Thus is a homotopy of based -cubes from to whose boundary value is the path in from to .
Transporting along the affine path. By step 2.1 the homotopy has basepoint track , so the moving-homotopy transport identity of [F6] in degree one gives , that is for every , where is the isomorphism of [F6].
The images of the older generators generate the quotient. Let be the subgroup generated by all the raw standard words at level . Since is a homomorphism and the index set splits into the cases and , one has , where the last equality uses that the classes generate the group by the induction hypothesis of step 1.2 and that is an isomorphism; hence .
Lifting generation to level . By step 1.3 the classes lie in and generate , so . Let . By step 4.1 there is with , hence and therefore . So .
The closed-disc statement and induction conclusion. Applying the isomorphism of [F2] to the equality of step 5.1 gives , and by [F4] , so , which is the statement at level ; step 1.1 is the base case, so by induction is generated by the standard generators for every .
The comparison of the two base configurations is carried out by the explicit similarities , so no Artin-presentation completeness is used: only the short exact sequence, the free kernel with its standard basis, and the geometric words enter. ∎
Depends on
- The $A_{in}$ are meridian generators of the forgetful free kernel
- The Fadell-Neuwirth short exact sequence for pure braids
- Standard geometric pure braid generators A_ij
- The pure braid group $PB_n$ as the fundamental group of an ordered configuration space
- The elementary geometric half twist, its support disc, and its opposite
- Geometric braids in the disc with setwise endpoints
- Pure geometric braids and ordered configuration loops
- Higher homotopy basepoint transport and moving homotopies
- Higher homotopy group by based cubes
- Conjugating loop classes by a path is an isomorphism of fundamental groups
- The interior-disc and closed-disc configuration spaces are homotopy equivalent
- The Axiom of Choice
- AC implies DC implies countable choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
76 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
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.2, author manuscript p. 5 (the split sequence (5), the free subgroup generated by A_{1,n},...,A_{n-1,n}, and the presentation with generators A_{r,s}) (standard reference, not scraped)
- Juan Gonzalez-Meneses, Basic results on braid groups, section 2.1, printed p. 12 (the Artin words of the pure generators) (standard reference, not scraped)