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 combed geometric decomposition is unique
Statement
Assume AC and , and work with the abstract Artin group of The braid group by Artin presentation, the words of The Zariski combing words alpha_i and x_i in the Artin presentation and the published surjection of The Artin presentation surjects onto the geometric braid group. Let be a word in and a word in such that is the trivial geometric braid; such a pair exists for every combed word by Every trivial braid word combs as W_1W_2. Write for the canonical isomorphism of Pure geometric braids and ordered configuration loops, and for the forgetting map of The Fadell-Neuwirth short exact sequence for pure braids. Write for the geometric generators of Standard geometric pure braid generators A_ij, and write for their Artin-word lifts, so . Put in and in , with both empty when . Then:
(i) every is a pure braid and so that the conjugating element lies in the subgroup generated by the standard generators with larger first index; at the word level this is in . Moreover form a free basis of the free kernel of the forgetting map of The Fadell-Neuwirth short exact sequence for pure braids;
(ii) , and , as a word in the alphabet , reduces to the empty word by free cancellations of adjacent inverse pairs (each of which, after expanding both 's, is a permitted deletion of -pairs);
(iii) , and, viewing the same letter word as an element of , its geometric image under the rank- surjection is trivial: . This asserts triviality of the geometric image, not that in .
Facts & Assumptions
Given: An integer , the groups and of The braid group by Artin presentation and The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism, the words of The Zariski combing words alpha_i and x_i in the Artin presentation, words in and in with , the standard pure braid generators of Standard geometric pure braid generators A_ij, and the identifications of The Fadell-Neuwirth short exact sequence for pure braids and Pure geometric braids and ordered configuration loops.
In the two Artin relations hold and adjacent inverse -pairs may be freely inserted and deleted. For , set ; its image under is the geometric standard generator of Standard geometric pure braid generators A_ij, since and preserves the displayed stacking product (The braid group by Artin presentation, The Artin presentation surjects onto the geometric braid group, Standard geometric pure braid generators A_ij). The words satisfy and , and (The Zariski combing words alpha_i and x_i in the Artin presentation).
Assumption AC, and the published consequences that are used to identify the free kernel: AC implies dependent choice and countable choice (The Axiom of Choice, AC implies DC implies countable choice), so that the Fadell--Neuwirth fibrations of The Fadell-Neuwirth short exact sequence for pure braids are available: forgetting the last strand is a homomorphism with kernel a free group of rank , and under the fiber-inclusion identification the elements are a free basis of that kernel (The are meridian generators of the forgetful free kernel). Forgetting a strand is realized by the coordinate projection: under the identifications [F3] at ranks and , a pure braid whose coordinate loop is satisfies , with target basepoint . This follows because coordinate projection commutes with the open-to-closed inclusion and its induced homomorphism preserves inverses.
For every rank , is an isomorphism, and for a pure braid with coordinate path it is , the inverse of the class of the coordinate loop carried to the closed-disc configuration space; the same sign convention is used at every rank, so the inverse cancels in the comparisons between ranks below. At every interior base configuration the open-to-closed inclusion induces an isomorphism on fundamental groups (The interior-disc and closed-disc configuration spaces are homotopy equivalent). Consequently if and only if (Pure geometric braids and ordered configuration loops, Ordered configuration spaces , The homomorphism on fundamental groups induced by a pointed continuous map). Moreover , so a geometric braid is pure exactly when its class lies in under these identifications (The geometric endpoint permutation matches covering monodromy).
Geometric conventions. The base configuration is with , , and the (n−1)-strand base configuration is with , (Geometric braids in the disc with setwise endpoints). The elementary half twist acts as on the two points and fixes all others, where and is the diamond path of size (The elementary geometric half twist, its support disc, and its opposite); stacking is first-under-second with (Stacking of geometric braids is a well-defined associative operation on isotopy classes, The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism). The two configurations are compared through the similarity with . Since , this is the dilation about , namely . It satisfies ; its image is the open disc of radius centered at , whose closure lies in because .
Moving-homotopy transport: for a path in a space and each there is a transport isomorphism depending only on the endpoint-fixed class of ; if is a homotopy with basepoint track , then . In degree one (Higher homotopy basepoint transport and moving homotopies).
Proof
The combing identity, by free cancellation. For put and (empty words for ); then and as words, and by [F1] the Artin word lifts the geometric generator , while is the combing word. First, for every the Artin word freely reduces to : this is a downward induction on , in which both words are for , and in which the substitution of and of the reduced form gives where the block cancels freely to the empty word -- its middle pair cancels first, after which the next pair is adjacent, and so on outwards -- leaving . For this gives , and the inverse word is ; substituting these reduced forms into , and using and (the same middle-outward cancellation applied to ), gives The remaining index has the empty product and , so holds trivially. No Artin relation is used in this step, only free insertions and deletions. Applying gives the stated geometric identity.
The two models of a lower-rank word. Put and consider the similarity with , so that . One computes for , for where is the (n−1)-strand midpoint, and for the two displacement paths, since and each diamond-path coordinate is linear in its size. The reflected paths for the negative letters satisfy the same scaling identity. Since is affine, . Thus for every and both signs, where is the elementary half twist of the -strand model of [F4]. Every lower-rank moving point stays in the support disc of the letter currently being run, or is one of the fixed base points. Relative to , these base points have radii , and the support disc has center with and radius ; hence every such path point has radius at most . This local agreement is all that will be used: maps the lower standard-generator paths to the corresponding -strand paths, but it is not used to map arbitrary lower braids into the complement of . Consequently, for every word in , if is its (n−1)-strand coordinate motion and its n-strand coordinate motion, then by induction on its letters: the generator paths agree by the displayed identity, and stacking has the same coupling permutation on in both models and fixes . Thus is represented by .
The straight-strand extension is a well-defined injective homomorphism. Let , , and . For let and let the distance from to the boundary of along the ray ; in particular . Define the strictly increasing radial function and define , with . Since , each ray is mapped increasingly onto the ray segment of length ; thus is a homeomorphism from onto the open disk . The closure of lies in because , and lies on because . Moreover, whenever . The basepoints satisfy , and for every lower support disc satisfies (for there are no such support discs). Therefore , and [F4] with step 1.2 shows that maps every lower-rank standard-generator path to its corresponding n-strand path. If with representative coordinate loop , define to be the class of . The tuple is a pure n-strand braid: is injective, its image avoids , and the endpoints are . Applying to a braid isotopy preserves pairwise distinctness and avoids , so is well defined on isotopy classes; applying to the stacking formula shows it is a homomorphism. To prove injectivity, first note that the induced map is injective. Indeed, for let and . For each , is strictly increasing along every ray and, when , so is an embedding , with and . Hence is a homotopy on the ordered configuration space from the identity to , whose basepoint follows ; by [F5], , and since is an isomorphism, is injective. If , [F3] and the coordinate-projection description of [F2] imply ; injectivity gives , and [F3] implies .
The conjugating identity in the geometric group. Applying to the word identity of step 1.1 gives where is the geometric product defined in the Statement. Each factor of and itself lies in the pure subgroup and maps under into by [F2, F3]. Since is a subgroup, lies in ; in particular is pure.
The straight-strand extensions meet the kernel trivially. By [F2] the forgetting map acts on coordinate loops by dropping the last coordinate. For the straight-strand extension of step 2.1 the coordinate loop is , whose dropped loop is . Thus at the basepoint . If also lies in , this class is trivial. The inclusion map is injective at that basepoint by [F3], so . Injectivity of (step 2.1) gives , and [F3] gives and . In particular , which is the uniqueness statement used below.
The free basis by the left-inverse argument. Let be the free kernel, and let be the abstract free group. The map given by is an isomorphism by the free-basis clause of [F2]. Write and . By step 2.2 and the homomorphism property of , . First, the elements generate : downward induction on shows , because lies in the left side and lies in the right side; at one has and . Second, they are independent: define an endomorphism of by descending recursion on by , where is the image of the word under the already defined on the generators (at this gives ); this prescription specifies an element for every free generator, hence defines a unique endomorphism . Then for every . If denotes the homomorphism with , then , so is the identity on a free basis, hence and is injective. Therefore freely generate , and applying carries this free basis to the free basis of .
The three claims. (i) is step 2.2 together with step 3.2, the free-basis clause of [F2] being what turns into a basis of the free kernel. For (ii) and (iii), note first that is a product of the pure braids of step 2.2 and that because ; by (i) the elements generate , so both and lie in the free kernel. The lower-rank word has the same reading in the two models, so the endpoint permutation of its n-strand realization is the identity on the labels (the last strand is fixed) and the permuted labels agree with those of its (n-1)-strand realization; since the permutation of is trivial, the (n-1)-strand realization is a pure braid and step 1.2 identifies in . Hence by step 3.1, so ; then injectivity of (step 2.1) gives , which is (iii), and . Finally, since are carried to a free basis of by (i), the homomorphism from the free group on the letters to sending is injective; a word in this alphabet whose image is is therefore freely trivial, and each cancellation of an adjacent pair expands, after writing out both expanded words , into a sequence of permitted deletions of adjacent inverse -pairs. This is (ii). ∎
Remarks
- The load-bearing in-run inputs are the batch-21 items The Fadell-Neuwirth short exact sequence for pure braids, The are meridian generators of the forgetful free kernel and Standard geometric pure braid generators A_ij; steps 2.1 and 3.1 in particular use the convention that the forgetting map is realized by the coordinate projection, which the current statement of The Fadell-Neuwirth short exact sequence for pure braids asserts (the map induced by ); the suppliers' certification remains the owner-held obligation before the item is accepted.
- The combing identity of step 1.1 is the free-cancellation identity , hence , and no relation of the Artin presentation is used in it; applying gives the geometric conjugation with in step 2.2.
- The axiom of choice is used only through the batch-21 Fadell--Neuwirth inputs and the identification of the free kernel; the combing identity, the argument and the two-model comparison of steps 1.1, 2.1 and 3.1 are choice-free.
Depends on
- Every trivial braid word combs as W_1W_2
- The Fadell-Neuwirth short exact sequence for pure braids
- Standard geometric pure braid generators A_ij
- The $A_{in}$ are meridian generators of the forgetful free kernel
- Pure geometric braids and ordered configuration loops
- The geometric endpoint permutation matches covering monodromy
- The braid group by Artin presentation
- The Artin presentation surjects onto the geometric braid group
- The Zariski combing words alpha_i and x_i in the Artin presentation
- The isotopy classes of geometric braids based at $Q$ form a group, and the endpoint permutation is a homomorphism
- The elementary geometric half twist, its support disc, and its opposite
- Stacking of geometric braids is a well-defined associative operation on isotopy classes
- Geometric braids in the disc with setwise endpoints
- Ordered configuration spaces $F_n(X)$
- The homomorphism on fundamental groups induced by a pointed continuous map
- Higher homotopy basepoint transport and moving homotopies
- The interior-disc and closed-disc configuration spaces are homotopy equivalent
- The Axiom of Choice
- AC implies DC implies countable choice
Used by
Dependency tree · two levels
96 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, section 3.1, printed p. 22 (standard reference, not scraped)