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.
Pure Braids, Fadell–Neuwirth, and Asphericity — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Approximation and Compactness in C(K)
- Asymptotic Cones and the Sublinear Triangle Criterion
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Braids as Fundamental Groups of Configuration Spaces
- Classification of Covering Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Cw Complexes and Cellular Homology
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Fibrations Fiber Bundles and Homotopy Exact Sequences
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Products and Amalgamation
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Geometric Braids and Artin Generators
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Extensions Complements and Schur Zassenhaus
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Higher Homotopy Groups and Cofiber Sequences
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordered and Unordered Configuration Spaces
- Ordinals, Cardinals, and Transfinite Recursion
- Partitions of Unity and Paracompactness
- Permutation Statistics, Inversions and Eulerian Numbers
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Punctured Disks, Mapping Classes, and Point Pushing
- Pure Braids, Fadell–Neuwirth, and Asphericity
- Rank Theorems and Embedded Submanifolds
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Semidirect Products, Automorphism Groups and Split Extensions
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simply Connected Plane Domains: the Grand Equivalence
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Group
- The Fundamental Group of the Circle
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Seifert–van Kampen Theorem
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Uniform Spaces: the Three Definitions
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These four entries make the companion page concrete in the two lowest ranks, identify the standard generators geometrically, and delimit what the configuration braid extension can prove on its own. Each entry works at the canonical base configuration of the geometric-braids pages, with , and inherits the Axiom-of-Choice bookkeeping of the statement it consumes.
The first example computes the rank-two group. In the short exact sequence the quotient is trivial, so the fibre inclusion is an isomorphism: is free on one meridian class, hence infinite cyclic, generated by as well as by its inverse. In the inverse-slicing identification the positive generator is the clockwise meridian of the first puncture, of winding relative to the counterclockwise spine basis; the example also notes that this agrees with the general torsion-freeness theorem in rank two.
The second example computes rank three and the splitting in action. The kernel of the forgetting homomorphism is free on , while is infinite cyclic. Its generator is the canonical two-strand transported to the truncated base configuration , where it is the image of under forgetting. With the far-right continuous section of the companion page, adjusted at the basepoint along a path in the puncture fibre so that it fixes the third point on a small representative of , the split extension reads . For the section chosen, and writing , the action of the positive generator on the free kernel is conjugation , computed directly; no direct-product decomposition and no centre statement is claimed.
The third example matches the standard generators with point pushing. For the ordered slice of the word is braid-isotopic to the motion in which only the -th marked point moves, once counterclockwise around the -th puncture along a standard meridian stem and back, the other strands returning to their base points; the base case is the explicit two-strand computation of the sibling pair, transported into the support disc of the full twist, and the inductive step slides the outer half twists off the excursion across the collar. Inverting the slicing, the class in is the clockwise meridian class of the fibre, and the braid–mapping-class isomorphism of the companion page carries it to the point push of the -th point clockwise around the -th puncture; after relabelling the -th point as the terminal coordinate, this is exactly the instance of computed in the sibling pair. Both inversions — the one in the configuration identification and the inverse-endpoint convention of the point-pushing definition — are displayed, and no injectivity of is used.
The counterexample isolates the invalid inference that the configuration braid sequence would prove torsion-free merely because its kernel is torsion-free and its quotient is finite. The abstract witness is : the kernel is torsion-free, the quotient has order two, and the middle group contains the element of order two, since while . The example makes no claim about torsion in the genuine braid group; it shows only that torsion-freeness needs the finer Fadell–Neuwirth argument of the companion page.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
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].
∎
PB_3 as F_2 by Z, with its section action
Example
Assume the Axiom of Choice and let, with the standard pure braid generators of Standard geometric pure braid generators A_ij for ,
Then is the kernel of the forgetting homomorphism , it is free on , and is infinite cyclic. With the far-right section of A choice-free continuous section of planar coordinate forgetting — adjusted at the basepoint along a path in the fibre, so that on a small representative of it fixes the third point — the extension splits and
Writing , the action of the positive generator on the free kernel is
for this section and the first-under-second convention. This does not assert a direct-product decomposition.
Facts & Assumptions
Given: the Axiom of Choice, the canonical base configuration of The elementary geometric half twist, its support disc, and its opposite, so that , , and ; the half twists and the geometric braid group of The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism; the open and closed ordered configuration spaces and at the base configurations and ; the pure braid groups , and the forgetting homomorphism 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).
The standard generators are with under first-under-second stacking, and the same letters denote their images under the isomorphism in ; for this gives , and (Standard geometric pure braid generators A_ij).
The geometric three strand relation holds: in (The geometric three strand braid relation).
is a group with product induced by stacking, , and the classes generate ; the endpoint permutation is a homomorphism with the transposition of and , and (The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism, The Artin presentation surjects onto the geometric braid group, The elementary geometric half twist, its support disc, and its opposite).
The map , , is a group isomorphism, where is the coordinate path of and is the open-to-closed isomorphism on fundamental groups of configuration spaces (Pure geometric braids and ordered configuration loops, The interior-disc and closed-disc configuration spaces are homotopy equivalent).
Under AC the sequence is short exact with , and under the identification of the elements are a free basis of , each represented by the clockwise meridian of the corresponding puncture (The Fadell-Neuwirth short exact sequence for pure braids, The are meridian generators of the forgetful free kernel).
At the canonical two-point configuration , is infinite cyclic generated by (The two-strand pure braid group is infinite cyclic). Here the quotient is instead , with . The path runs from to . Basepoint transport gives an isomorphism , (Conjugating loop classes by a path is an isomorphism of fundamental groups, Higher homotopy basepoint transport and moving homotopies). Write for the quotient generator; occurrences of in the cyclic quotient factor of the Example mean . Step 1.3 checks that forgetting sends to , using the actual coordinate-forgetting map of The Fadell-Neuwirth short exact sequence for pure braids.
The extension of [F6] splits: there is a homomorphic section of , and then compatibly with and , the action of on the free kernel being ; the section is the based version of the far-right explicit section, and for a section the action depends on that section (The pure braid extension splits as a semidirect product, Splitting lemma for groups: a section, a complement, and a semidirect-product decomposition are equivalent).
The far-right section of the planar forgetful map is for , transported to the disc by the radial homeomorphism with inverse ; fixing a base configuration and a path in the fibre from to , the formula defines a homomorphism with , and the section of [F8] is (A choice-free continuous section of planar coordinate forgetting).
For the support disc of is with and ; the two strands of the braid stay in at every time, and , while and the real interval is disjoint from (The elementary geometric half twist, its support disc, and its opposite).
Verification
Choice bookkeeping and the standing identifications. By [F1] the Axiom of Choice [A1] yields DC, so the short exact sequence and the splitting of [F6] and [F8] are available. Throughout, denote the elements of named in the statement, that is , and , The quotient generator is of [F7]; only the letter is reused for that cyclic factor, and remain kernel elements in .
The product is central. Put and in . By [F2] the geometric classes of the three words are , and , so in the group of [F4] the bracketing is immaterial and where the middle step uses the relation of [F3]; put . The same relation gives , hence and , and therefore So commutes with and ; since and generate by [F4], is central in . Also because is a product of the two distinct transpositions and , a three-cycle whose cube is the identity; hence and is defined. By [F5] the map is a homomorphism, so with the identification of [F2] Since is an isomorphism onto and is central in , the element is central in .
Forgetting and the transported quotient generator. Let be the two moving coordinates of the rank-three word , a loop at . Then by [F5] and the naturality of coordinate forgetting in [F6]. Define and . The map is injective, so these coordinates stay distinct. By [F10], , whence . Thus is a homotopy through ordered configurations with basepoint track from [F7]. At the midpoint is sent to , while the relative diamond displacement is multiplied by , changing its scale from to . Therefore is exactly the raw coordinate loop of the canonical rank-two full twist. The moving-basepoint identity of [F7], and its compatibility with open-to-closed inclusions, give . Since preserves inverses, . By [F7], generates this quotient .
The conjugation by is conjugation by . Put . By step 1.2, with central, so , and for every , in particular for every ,
The far-right section sends to . Write for the coordinate path of in , a loop at whose two entries lie in for every by [F10], and put , so that the far-right lift of [F9] is a loop at in . Since by [F10], we have and, because is increasing on , an interval in the positive real axis. The value of the far-right section at is : here and , so the third coordinate is . Let be the path in the fibre from to , whose third coordinate runs along the real interval ; this interval, and likewise , is contained in , which is disjoint from by [F10]. By [F9] the section of [F8] is built from with , and we claim this class is the class of the third-strand-fixed loop in . To see this, let denote the third coordinate path of , so that , takes values in , and coincides with the third coordinate of on the first quarter, with on the second quarter and with the reversed third coordinate of on the last half. Let be the map that is on , on and on , and put for . Then is continuous, lies in pointwise: each lies in , so both lie in and are distinct, while the third coordinate is a convex combination of two points of and therefore also lies in that interval, which is disjoint from by [F10]; moreover , and , so for every . Finally and . Hence is a path homotopy relative to from to and . Now in : by [F5] the element is and is an isomorphism. Since is a homomorphism, , and since the element of is by [F5] the class (the coordinate path of the braid in is ), the section of [F9] satisfies
The action and the semidirect product. By step 2.2 the section of [F8] satisfies , and by step 2.1 for every in the free kernel of [F6]. Since the action of the section is by [F8], the positive generator of of step 1.3 acts by . The splitting of [F8] therefore exhibits with that action. The action is conjugation by the element of the free kernel, so it depends on the normalised section, no triviality of the action is claimed, and no direct-product decomposition is asserted.
Remarks
- The computation of step 1.2 is a direct rank-three calculation inside : the full twist is written as the product of the three standard generators , and centrality of that product is read off the single braid relation. The later centre theorem for is not used, and neither is any Artin-presentation injectivity: only the surjectivity of The Artin presentation surjects onto the geometric braid group enters, through the generation of by and .
- The section used above is the normalised far-right section: the fibre path is the straight segment from to on the positive real axis, and on the small representative of the far-right lift is homotopic to the loop with constant third coordinate, which is why . Any other section of has for some , so its action is , an inner automorphism of the free kernel; the displayed formula is the one for this section, and clearing it of the normalisation would require a separate conjugation bookkeeping.
- The action is by an inner automorphism of the free kernel, because itself. This example nevertheless asserts only the semidirect-product decomposition with the action of the chosen section; the classical direct-product decomposition is not derived here.
Standard as point pushes after relabeling
Example
Assume the Axiom of Choice, let and , and use the base configuration and positive half twists of The elementary geometric half twist, its support disc, and its opposite. The standard pure braid is the image of the geometric word of Standard geometric pure braid generators A_ij. Put For a based loop of at , let This is the ordered motion in which only the -th point moves.
Choose the compatible family of local meridian circles and stems constructed by the puncture-avoiding fan argument in the proof of The are meridian generators of the forgetful free kernel. Thus, for each , take , let and , and use the local stem from to selected in that compatible family, inside . For , let where represents the positive half twist and the empty composition for is the identity. The associated meridian stem from to is ; let be the based loop that follows this stem, traverses clockwise once, and returns along the reverse stem. These are the compatible standard meridian stems obtained by transporting the adjacent local stem through the successive half twists. Then:
- Point push. For every , Thus the positive standard generator is the class of the motion that holds the other labelled points fixed and moves the -th point clockwise once around along the stated stem.
- Relabeled form. Let satisfy , for , and for . The coordinate permutation gives homeomorphisms and on the open and closed ordered configuration spaces, respectively. It takes to Put , and define the open terminal-coordinate inclusion With the open-to-closed map at basepoint , set . Then the loop class in which the last coordinate moves clockwise around and all other coordinates remain fixed.
- Terminal mapping-class sign. For , where is the isomorphism of Point pushing is the kernel of forgetting the last disk puncture. The inverse-endpoint convention in Point pushing the last puncture makes the clockwise fibre meridian correspond to the positive generator. The raw ordered slice of the positive standard word runs counterclockwise; the configuration identification inverts that slice.
Facts & Assumptions
Given: AC, , , the base configuration , the half twists and their supports , the words , and the maps in the statement.
The Axiom of Choice holds (The Axiom of Choice).
In ZF, AC implies DC and DC implies countable choice (AC implies DC implies countable choice).
The Statement of The are meridian generators of the forgetful free kernel says that, under AC, the last-coordinate fibre inclusion identifies with the kernel of forgetting , and the configuration-group images of the standard geometric classes form a free basis. For the compatible stem family constructed in its proof, if is the counterclockwise meridian class in the fibre, then Here is the geometric braid class and, by [F3], its configuration-group image is the element denoted in this example; is the closed-disc image of the open fibre loop. The supplier Statement makes this last-column assertion; its proof also supplies the local winding and conjugation arguments used below for arbitrary . It does not assert that the whole word motion is braid-isotopic to a one-coordinate motion.
The standard generators are , where The rightmost factor is the bottom one, , and for the ordered coordinate loop (Standard geometric pure braid generators A_ij, Pure geometric braids and ordered configuration loops).
The positive half twist exchanges , is supported in , and fixes every other base point; when . Here the base points are equally spaced by , so the center of is distance from (The elementary geometric half twist, its support disc, and its opposite).
Geometric braids form a group under stacking, with the right factor running first; coordinate paths of pure braids are loops in , and reversed braid paths represent inverse classes (The isotopy classes of geometric braids based at form a group, and the endpoint permutation is a homomorphism, Stacking of geometric braids is a well-defined associative operation on isotopy classes).
Coordinate permutations act by homeomorphisms on both and , and the open-to-closed inclusions commute with these permutations (The symmetric group acts continuously and freely on by permuting labels, The interior-disc and closed-disc configuration spaces are homotopy equivalent).
The maps and are group isomorphisms, with and, for the raw unordered slice , ; on a half twist, , where is orientation-preserving, supported in , and exchanges (Pure geometric braids and ordered configuration loops, Braid group as boundary-fixed punctured-disk mapping classes).
The point-pushing map for the last puncture is , where is the unordered loop of the ordered motion that moves only and is the inverse-endpoint boundary map. The braid-to-mapping-class map sends that raw geometric motion to (Point pushing the last puncture, Boundary map from point motions).
Under AC, is an isomorphism and for the terminal-coordinate fibre inclusion (Point pushing is the kernel of forgetting the last disk puncture).
is the space of pairwise distinct tuples in , , and is an isomorphism (Ordered configuration spaces , The pure braid group as the fundamental group of an ordered configuration space, The interior-disc and closed-disc configuration spaces are homotopy equivalent).
The local two-point winding computation in the proof of The are meridian generators of the forgetful free kernel identifies with convex and shows that the raw coordinate loop of has relative winding , equal to a counterclockwise local meridian motion of around . By the inverse-endpoint convention, The proof's conjugation argument establishes, for any mapping class taking a marked point to , the typed naturality where is a loop in the complement of based at and is based at in the complement of . There is the inverse endpoint of an ambient lift of this single-point motion; for it agrees with [F8].
Verification
Choice bookkeeping. AC supplies DC and countable choice, so the cited fibre exact sequence, braid identifications, and point-pushing identifications are available. [A1, F1, F2, F7, F9]
The choice hypothesis discharges the cited fibration and mapping-class identifications.
Terminal fibre case. Fix and let be the counterclockwise based meridian class in the last-coordinate fibre at from [F2]. Write . The standard generator in is ; applying to again would be ill-typed. The source formula and the fact that the fibre inclusion is a homomorphism give This proves the terminal instance of claim 1. [F2, F3, F10]
Thus the terminal generator is the closed-disc image of the clockwise last-coordinate meridian.
A point-motion loop maps to its point push. Let and let be any based loop in at . By the geometric-braid/configuration identification [F3] and the open-to-closed map [F10], the ordered loop defines a pure geometric braid whose unordered slice is . Its inverse braid has coordinate loop class and unordered slice class . The braid/configuration and braid/mapping-class maps [F7] therefore give For any marked point , the inverse-endpoint point-motion map constructed in the kernel lemma's proof is ; for this agrees with [F8]. Thus This identity will compare classes by the isomorphism and uses no fibre-inclusion injectivity. [F3, F7, F8, F10, F11]
For every marked point, the image under of its one-coordinate motion is the corresponding point push.
Transport the adjacent point push. Fix . Choose the local circle and stem from the statement, and let be the loop following , once clockwise around , and back. Put and let be its mapping-class representative, with the rightmost map acting first. Hence and . It fixes pointwise: each support for is disjoint from , while every point of is at distance at least from the center of . Thus is a stem from to , and . The path avoids all punctures other than its basepoint because permutes and sends the omitted point to . The word identity [F3], first-under-second product, and the local winding and typed naturality in [F11] now give For , is the identity and this is exactly the local winding case. [F3, F7, F11]
The conjugated geometric generator has the point-push image along the transported standard stem.
Point-push claim for every pair. By step 2.2, the image under of the one-coordinate motion along is . By step 2.3, this equals . Since is an isomorphism by [F9], it is injective, and therefore This proves claim 1 without an isotopy assertion about the full word motion. [F9, step 2.2, step 2.3]
Equality under proves the point-push statement for every pair.
Relabeled form and open-to-closed maps. Let be the open ordered loop based at . Pointwise, . The coordinate-permutation square commutes with the open-to-closed inclusions, so Apply this identity to the loop from the point-push claim to obtain This is the relabeled terminal-coordinate form. The argument uses functoriality only and asserts no injectivity of or . [F6, F10, step 3.1]
The coordinate permutation carries the proven open motion to the stated closed-disc terminal-coordinate class.
Terminal mapping-class sign. For , the fibre formula and [F9] give The source formula [F2] identifies the configuration-group image of as , while [F3] identifies the same image as for the raw ordered coordinate loop. Equating and inverting gives : the raw ordered slice is counterclockwise in the fibre. The configuration identification inverts it, so . The inverse-endpoint convention then gives exactly the clockwise point push. [F2, F3, F8, F9, step 2.1]
This proves the terminal mapping-class sign in claim 3 with the positive generator clockwise.
Remarks
- The stem for is the image of the adjacent local stem under the actual mapping-class representative . This specifies the compatible meridian path and preserves its clockwise orientation.
- The relabeling is a coordinate-permutation homeomorphism from basepoint to . The open terminal-coordinate map and its closed-disc composite have distinct codomains; only the latter is denoted in the statement.
- The example identifies standard generators and makes no new generation or presentation claim. The proof uses the local two-point winding and typed point-push conjugation already proved in The are meridian generators of the forgetful free kernel.
The short exact sequence to does not prove torsion-free
Statement refuted
Let be a short exact sequence of groups with torsion-free and finite. Then is torsion-free. In particular the configuration braid short exact sequence , whose kernel is torsion-free and whose quotient is finite, would by itself show that is torsion-free.
Facts & Assumptions
Given: the Axiom of Choice, an integer , the groups and , and their external direct product .
The Axiom of Choice holds (The Axiom of Choice).
Assume AC. Then is torsion-free for every : if and for some , then (Pure braid groups are torsion-free). AC is used only for this citation (AC implies DC implies countable choice).
For every the sequence of the configuration groups is short exact: is injective, is surjective and (The configuration braid short exact sequence ); moreover , so is finite (The Lehmer code gives again).
is a commutative ring and a totally ordered ring: the order is total and compatible with addition, so implies , and exactly one of , , holds for all integers (The integers form a commutative ring, The integers form a totally ordered ring).
is an abelian group with (For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold). Its exactly two classes are and (For , every class in has one representative with , so ; while is in bijection with , The congruence class and the quotient set ), so and ; hence it has order and is generated by .
For any groups the componentwise operation makes a group with identity , and the coordinate projections are group homomorphisms (The external direct product with componentwise multiplication, is a group with identity , coordinatewise inverses, and homomorphic coordinate projections).
In a group, and for natural powers, and has finite order exactly when is the least positive integer with (Powers : natural exponents in a monoid and integer exponents in a group, with , The order of a finite group and the order of an element, with when no positive power of is the identity).
Counterexample
The two factors. By [F3] the additive group is a group, and by [F4] is an abelian group of order with and .
is torsion-free. Let with and let . By trichotomy [F3] either or ; assume , the other case being symmetric with . Since and the order is compatible with addition, and inductively for every : if then . Hence for every , so ; an element of finite additive order would have for some , so no nonzero element of has finite order and is torsion-free.
The sequence . By [F5] the set with componentwise addition is a group with identity , and the second-coordinate projection is a group homomorphism; it is surjective because for every . Its kernel is , and the first-coordinate map , , is a group isomorphism; hence is torsion-free by step 1.2, and has order by [F4], so the quotient is finite. Thus is a short exact sequence with torsion-free kernel and finite quotient.
The middle group has an element of order two. Put . Using the componentwise operation of [F5] and the addition of [F4], , while because . By [F6] the element has order , so is not torsion-free although is torsion-free and is finite. This refutes the general implication of the statement: a torsion-free kernel and a finite quotient do not force the middle group to be torsion-free.
The braid reading. Under the standing assumption [A1], which discharges the Axiom-of-Choice hypothesis that [F1] attaches to its own citation, the configuration braid sequence of [F2] has the two abstract features used above: its kernel is torsion-free by [F1], and its quotient is finite by [F2]. Since the general implication fails already for the infinite cyclic kernel and the two-element quotient of step 2.1, those two features alone cannot establish torsion-freeness of ; only a finer argument about the specific groups can do that. This counterexample makes no claim that itself has torsion.
∎
Sources
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.2, author manuscript p. 5 (the pure braid group P_2 is infinite cyclic and generated by A_{1,2})
- Juan Gonzalez-Meneses, Basic results on braid groups, section 2.1, printed pp. 11-14 (the split pure braid tower and the explicit cross-section)
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.3, author manuscript pp. 5-7 (the free kernel and the splitting of the pure braid sequence)
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.2, author manuscript pp. 4-5 (the elementary braid sigma_{s,t} and the pure generators A_{s,t}=sigma_{s,t}^2)
- Juan Gonzalez-Meneses, Basic results on braid groups, section 2.1, printed pp. 11-14 (Artin words of the pure generators, meridian description of the free kernel)
- Benson Farb and Dan Margalit, A Primer on Mapping Class Groups, version 5.0 author draft, sections 4.2.1-4.2.3, printed pp. 101-105 (point pushing)