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.
Point pushing is the kernel of forgetting the last disk puncture
Statement
Assume the Axiom of Choice and let . Write for the base configuration of Boundary-fixed mapping class group of a punctured disk, and put , the truncation of . Here means the group of path components of the boundary-fixed homeomorphisms fixing these points individually; is not the canonical rank- configuration. Put for the disc with the first punctures removed, and for the point-pushing homomorphism at the last puncture of Point pushing the last puncture. Further let be the homomorphism induced on the pointwise stabilisers by forgetting the last marked point, that is, the map that regards a boundary-fixed homeomorphism fixing as one fixing . Then:
- is injective;
- its image is exactly the kernel of ;
- is surjective, so with , the free group on the puncture meridians of The Fadell-Neuwirth short exact sequence for pure braids, the sequence is short exact.
No injectivity of is assumed anywhere in the definition of point pushing; it is proved here from the Fadell-Neuwirth sequence for the ordered configuration spaces.
Facts & Assumptions
Given: the Axiom of Choice, an integer , the canonical configuration of Boundary-fixed mapping class group of a punctured disk and its truncation , the punctured disc , the point-pushing homomorphism of Point pushing the last puncture with the ordered lift of a based loop at , and the boundary map of Boundary map from point motions.
The Axiom of Choice holds (The Axiom of Choice).
In ZF, AC implies DC and DC implies countable choice, so under [A1] the extension lemma of [F7] is available (AC implies DC implies countable choice).
Under AC the forgetting map sits in the short exact sequence , where is the fundamental group of the fibre of the last-coordinate forgetful map, free on the positively oriented meridian classes, is induced by the fibre inclusion transported through the open-to-closed identification, and is induced by forgetting the last coordinate (The Fadell-Neuwirth short exact sequence for pure braids).
The map , , is a group isomorphism, where is the coordinate path of the braid and is the open-to-closed isomorphism, and for a pure braid (Pure geometric braids and ordered configuration loops, Geometric braids in the disc with setwise endpoints).
The map is a group isomorphism, and for every braid class and every lift of the raw slice loop with one has . Moreover (Braid group as boundary-fixed punctured-disk mapping classes, Pure braids as pure mapping classes).
Point pushing is defined by with , it is a group homomorphism with values in , no injectivity is asserted by the definition, and ; the boundary map is the connecting isomorphism of the evaluation fibration (Point pushing the last puncture, Evaluation boundary isomorphism for the disk, Point-motion boundary map is a homomorphism).
At the canonical configurations, the pure mapping class group is for the pointwise stabiliser , two boundary-fixed homeomorphisms fixing each lie in the same component exactly when they are isotopic rel fixing each for all times, the product is , and the canonical map is injective (Pure boundary-fixed mapping classes). For we use the same pointwise-stabiliser formula as defined in the Statement; the same path and composition arguments give its group structure.
Every based loop of at the canonical rank- configuration is path homotopic relative to to a based loop whose unique ordered lift from consists of smooth, pairwise collision-free coordinate paths constant near the two time endpoints (Smooth representatives of configuration loops); under countable choice, smooth collision-free paths constant on and on extend to a smooth isotopy with , every a diffeomorphism fixing pointwise, and (Smooth finite point motions extend to disk isotopies).
Induced maps on fundamental groups are functorial and commute with the open-to-closed inclusions: for the coordinate-forgetting maps and their open and closed disc versions (Induced fundamental-group maps are well defined, functorial and invariant under based homotopy, The interior-disc and closed-disc configuration spaces are homotopy equivalent, The Fadell-Neuwirth short exact sequence for pure braids).
Slicing is a bijection , so a braid class is determined by its raw slice loop (Geometric braid classes and the unordered configuration fundamental group).
On the compact metric domain the compact-open topology on is the topology of uniform convergence, and composition of homeomorphisms is continuous for it (Boundary-fixed mapping class group of a punctured disk). The product is again a nonempty compact metric space, so a jointly continuous family is uniformly continuous there (Every continuous map from a nonempty compact Hausdorff space to a uniform space is uniformly continuous); writing and measuring the product with a metric for which , uniform continuity gives for every a with whenever . Hence a jointly continuous family of homeomorphisms gives a continuous path in that topology (Boundary-fixed mapping class group of a punctured disk, Every continuous map from a nonempty compact Hausdorff space to a uniform space is uniformly continuous).
Proof
Choice bookkeeping. By [F1] the Axiom of Choice [A1] yields dependent choice and countable choice, so the short exact sequence of [F2] and the extension lemma of [F7] are both available.
The forgetting homomorphism . Let be the pointwise stabiliser of , and let be the pointwise stabiliser of , as in [F6]. A homeomorphism fixing fixes , so the inclusion is defined and continuous for the subspace topologies; define , that is, for the class of a homeomorphism read in by [F6]. This is well defined: if and are joined by a path in , the same path lies in and joins them there. It is a group homomorphism: for one has , and , so . Thus is exactly the homomorphism that forgets the last marked point.
An isomorphism from the pure braid group and the identification . By [F4] the restriction of to is a group isomorphism onto , and by [F3] the map is a group isomorphism ; so is a group isomorphism. Now let . Its ordered lift is a pure geometric braid based at : its coordinates are the constant paths at and the loop , they are pairwise distinct and lie in , and , so . Writing , for the fibre inclusion, we have , so by [F2] The coordinate path of the braid is itself, so by [F3] while [F5] gives . Applying the isomorphism to the inverse of we therefore get because a group isomorphism carries inverses to inverses.
Reading off a lifted isotopy. Let and let with and coordinate path . Suppose is a lift of the raw slice loop with and with for all and . Then is a lift of with initial value the identity, so [F4] gives , and hence Moreover for every , because is pure, so is an element of the pointwise stabiliser and is literally a class of .
Transport to the truncated configuration. Write for the canonical rank- configuration. The affine motion carries to : gives . The points remain ordered and inside the disc, since each coordinate is a convex combination of its initial and terminal positions. Reparametrize by a smooth nondecreasing function equal to near and near , and extend constantly outside . By [F7] and step 1.1 this smooth separated motion extends to a boundary-fixed disk isotopy with endpoint satisfying for . Conjugation identifies the pointwise stabiliser of with that of , continuously in both directions by [F10]. It induces an isomorphism of their component groups. Also acts coordinatewise on configuration spaces and induces an isomorphism of their fundamental groups at these basepoints, commuting with the open-to-closed inclusions by [F8]. Define where is the canonical isomorphism of step 1.3. This is an isomorphism. If is any ordered loop at lifted by an ambient isotopy from the identity, then lifts from the canonical configuration . The inverse-slicing formula and step 1.4 give This transported formula, rather than a canonical rank- identification at , will be used below.
Naturality at the actual truncation. Let and choose its pure geometric representative . By [F7] and [F9] its ordered path may be taken smooth and constant near the endpoints without changing its class. By step 1.1 and [F7], lift it to a boundary-fixed smooth isotopy from the identity with ; this is a continuous path of homeomorphisms by [F10]. Step 1.4 gives . The same isotopy lifts the truncated loop , based at . By [F3] and [F8] the forgetting map of [F2] satisfies Step 1.5 therefore gives in the component group of the pointwise stabiliser of . Step 1.2 identifies this class with . Thus , with every map based at the specified configuration.
Exactness of the Birman sequence. By step 1.3, with an isomorphism and injective by [F2], so is injective: if , then and hence . Its image is by the exactness in [F2]. By step 2.1 and the injectivity of , so and ; this proves claims 1 and 2. Finally is the composite of the surjection of [F2] with the isomorphism , hence surjective, and therefore itself is surjective. Inserting these three facts into the sequence displayed in the statement gives a short exact sequence, with the free group of [F2] on the puncture meridians.
Remarks
- The proof never uses the splittings, the section, or any explicit generating family of : it transports the Fadell-Neuwirth short exact sequence of The Fadell-Neuwirth short exact sequence for pure braids through the two braid-to-mapping-class identifications, and the only geometric input beyond those identifications is the smooth representative and extension pair of [F7]. Injectivity of is obtained because the fibre inclusion is injective, itself a consequence of .
- The identification is where the two inverse signs cancel: the configuration identification and the mapping-class identification both invert the raw slicing, so the point push of a loop agrees with the image of the fibre class in rather than with its inverse. Without that check the exact sequence would only be correct up to inversion of the free factor.
- The Axiom of Choice is used twice: through the Fadell-Neuwirth fibration that supplies [F2], and through countable choice for the smooth motion extension in step 2.1. The evaluation-boundary isomorphism and the smooth extension lemma carry their own choice hypotheses, which [A1] discharges.
Depends on
- Point pushing the last puncture
- The Fadell-Neuwirth short exact sequence for pure braids
- Pure braids as pure mapping classes
- Braid group as boundary-fixed punctured-disk mapping classes
- Pure geometric braids and ordered configuration loops
- Evaluation boundary isomorphism for the disk
- Boundary map from point motions
- The Axiom of Choice
- AC implies DC implies countable choice
- Every continuous map from a nonempty compact Hausdorff space to a uniform space is uniformly continuous
- Induced fundamental-group maps are well defined, functorial and invariant under based homotopy
- Smooth representatives of configuration loops
- Smooth finite point motions extend to disk isotopies
- Pure boundary-fixed mapping classes
- Boundary-fixed mapping class group of a punctured disk
- The interior-disc and closed-disc configuration spaces are homotopy equivalent
- Geometric braid classes and the unordered configuration fundamental group
- Point-motion boundary map is a homomorphism
- Geometric braids in the disc with setwise endpoints
- The isotopy classes of geometric braids based at $Q$ form a group, and the endpoint permutation is a homomorphism
- Based loops and the fundamental group
Used by
Dependency tree · two levels
102 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.3 and the proof of Theorem 1, author manuscript pp. 5-7 (the Birman exact sequence) (standard reference, not scraped)
- 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 (standard reference, not scraped)
- Edward Fadell and Lee Neuwirth, Configuration Spaces, sections II-IV, printed pp. 111-120 (standard reference, not scraped)