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 two-strand pure braid group is infinite cyclic
Example
Assume the Axiom of Choice and let be the canonical base configuration of Geometric braids in the disc with setwise endpoints, so that in the convention of The pure braid group as the fundamental group of an ordered configuration space. Then generated by the geometrically positive two-strand full twist of Standard geometric pure braid generators A_ij. Under the inverse-slicing identification of The are meridian generators of the forgetful free kernel, the generator corresponds to the clockwise meridian of inside the once-punctured disc fibre, that is to the inverse of the counterclockwise meridian class; relative to the counterclockwise spine basis its winding is . The group is infinite cyclic and, in particular, torsion-free.
Facts & Assumptions
Given: the Axiom of Choice, the canonical base configuration of interior points of the disc, and the truncation notation of The Fadell-Neuwirth short exact sequence for pure braids.
The Axiom of Choice holds (The Axiom of Choice).
In ZF, AC implies DC (AC implies DC implies countable choice).
Assume AC and let . With the base configuration and its truncation , the forgetting map sits in the short exact sequence with injective, surjective and , and is trivial; here is free on the positively oriented meridian classes of the punctures (The Fadell-Neuwirth short exact sequence for pure braids).
Assume AC and let . Under the identification given by , the elements of Standard geometric pure braid generators A_ij are a free basis of , and the -th of them corresponds to the clockwise meridian of the -th puncture, the inverse of the counterclockwise spine-basis class (The are meridian generators of the forgetful free kernel).
The free group on has the reduced-word model, in which each element has a unique reduced word in (Reduced words form the free group on an alphabet). Since there is only one generator, a reduced word contains only or only , so every element is uniquely for some .
Assume AC. For every the pure braid group is torsion-free (Pure braid groups are torsion-free).
Verification
The choice deduction and the exact sequence at . By [F1] the Axiom of Choice [A1] yields DC, so the sequence of [F2] is available at : with injective, , and . Since is trivial by [F2], has trivial codomain, so and : the map is a group isomorphism .
The fibre and its meridian basis. By [F2] the fibre group is free on the single positively oriented meridian class of , written , and by the case of [F3] the corresponding generator corresponds under to the inverse class , the clockwise meridian; that is, and .
is infinite cyclic. By [F2] and [F4], every element of the free group on is uniquely for . Concatenation followed by free reduction adds exponents, so , , is a group isomorphism. Composing the negation automorphism of with and then with of step 1.1 gives the isomorphism , , by step 1.2. Thus is infinite cyclic, generated by , and its inverse sends to , as claimed.
The winding sign and torsion-freeness. By step 1.2 the generator corresponds under to , the clockwise meridian of , while the counterclockwise spine-basis class is itself; the identification of step 1.2 therefore assigns to the winding relative to the counterclockwise basis, as claimed. The isomorphism in step 2.1 shows that is infinite cyclic and generated by ; it is torsion-free by the general theorem [F5].
∎
Depends on
- Geometric braids in the disc with setwise endpoints
- The pure braid group $PB_n$ as the fundamental group of an ordered configuration space
- 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
- Reduced words form the free group on an alphabet
- Pure braid groups are torsion-free
- The Axiom of Choice
- AC implies DC implies countable choice
Used by
Dependency tree · two levels
51 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.