Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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 n≥2. Write Qn=(q1,…,qn) for the base configuration of Boundary-fixed mapping class group of a punctured disk, and put Qn′:=(q1,…,qn−1), the truncation of Qn. Here PMod⁡(D2,Qn′;∂D2) means the group of path components of the boundary-fixed homeomorphisms fixing these n−1 points individually; Qn′ is not the canonical rank-(n−1) configuration. Put Yn:=int⁡D2∖{q1,…,qn−1} for the disc with the first n−1 punctures removed, and Push⁡n:π1(Yn,qn)→PMod⁡(D2,Qn;∂D2) for the point-pushing homomorphism at the last puncture of Point pushing the last puncture. Further let ψ:PMod⁡(D2,Qn;∂D2)⟶PMod⁡(D2,Qn′;∂D2) 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 q1,…,qn as one fixing q1,…,qn−1. Then:

  1. Push⁡n is injective;
  2. its image is exactly the kernel of ψ;
  3. ψ is surjective, so with Fn−1:=π1(Yn,qn), the free group on the n−1 puncture meridians of The Fadell-Neuwirth short exact sequence for pure braids, the sequence 1⟶Fn−1→ Push⁡n PMod⁡(D2,Qn;∂D2)→ ψ PMod⁡(D2,Qn′;∂D2)⟶1 is short exact.

No injectivity of Push⁡n 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 n≥2, the canonical configuration Qn of Boundary-fixed mapping class group of a punctured disk and its truncation Qn′, the punctured disc Yn, the point-pushing homomorphism of Point pushing the last puncture with the ordered lift Lγ(t)=(q1,…,qn−1,γ(t)) of a based loop γ:I→Yn at qn, and the boundary map δ:π1(Cm(int⁡D2),[Qm])→Mod⁡(D2,Qm;∂D2) of Boundary map from point motions.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]

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).

[F2]

Under AC the forgetting map sits in the short exact sequence 1→Fn−1→κPBn→φPBn−1→1, where Fn−1=π1(int⁡D2∖{q1,…,qn−1},qn) is the fundamental group of the fibre of the last-coordinate forgetful map, free on the n−1 positively oriented meridian classes, κ is induced by the fibre inclusion x↦(q1,…,qn−1,x) transported through the open-to-closed identification, and φ is induced by forgetting the last coordinate (The Fadell-Neuwirth short exact sequence for pure braids).

[F3]

The map Ψmconf:Gmpure→PBm, Ψmconf([β])=(ι∗F[zβ])−1, is a group isomorphism, where zβ is the coordinate path of the braid β and ι∗F is the open-to-closed isomorphism, and for a pure braid zβ(1)=Qm (Pure geometric braids and ordered configuration loops, Geometric braids in the disc with setwise endpoints).

[F4]

The map Ψmmc:=δ∘(ι∗C)−1∘Φ:Gm→Mod⁡(D2,Qm;∂D2) is a group isomorphism, and for every braid class [β]∈Gm and every lift g:I→Homeo⁡+(D2,∂D2) of the raw slice loop S(β) with g(0)=id⁡ one has Ψmmc([β])=[g(1)]. Moreover Ψmmc(Gmpure)=PMod⁡(D2,Qm;∂D2) (Braid group as boundary-fixed punctured-disk mapping classes, Pure braids as pure mapping classes).

[F5]

Point pushing is defined by Push⁡n([γ])=δ([γˉ]) with γˉ=pn∘Lγ, it is a group homomorphism with values in PMod⁡(D2,Qn;∂D2), no injectivity is asserted by the definition, and Ψnmc([Lγ])=Push⁡n([γ])−1; 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).

[F6]

At the canonical configurations, the pure mapping class group is PMod⁡(D2,Qm;∂D2)=π0(Fm) for the pointwise stabiliser Fm=Homeo⁡+(D2,∂D2;Q^m), two boundary-fixed homeomorphisms fixing each qi lie in the same component exactly when they are isotopic rel ∂D2 fixing each qi for all times, the product is [f][g]=[f∘g], and the canonical map PMod⁡(D2,Qm;∂D2)→Mod⁡(D2,Qm;∂D2) is injective (Pure boundary-fixed mapping classes). For Qn′ we use the same pointwise-stabiliser formula as defined in the Statement; the same path and composition arguments give its group structure.

[F7]

Every based loop of Cm(int⁡D2) at the canonical rank-m configuration [Qm] is path homotopic relative to {0,1} to a based loop whose unique ordered lift from Qm 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 z1,…,zm:R→int⁡D2 constant on (−∞,0] and on [1,∞) extend to a smooth isotopy Φ:D2×[0,1]→D2 with Φ0=id⁡, every Φs a diffeomorphism fixing ∂D2 pointwise, and Φs(zj(0))=zj(s) (Smooth finite point motions extend to disk isotopies).

[F8]

Induced maps on fundamental groups are functorial and commute with the open-to-closed inclusions: p∗D∘ι∗F=ι∗F∘p∗ 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).

[F9]

Slicing is a bijection S:Gm→π1(Cm(int⁡D2),[Qm]), so a braid class is determined by its raw slice loop (Geometric braid classes and the unordered configuration fundamental group).

[F10]

On the compact metric domain D2 the compact-open topology on Homeo⁡+(D2,∂D2) 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 D2×I is again a nonempty compact metric space, so a jointly continuous family g:D2×I→D2 is uniformly continuous there (Every continuous map from a nonempty compact Hausdorff space to a uniform space is uniformly continuous); writing gs(x):=g(x,s) and measuring the product with a metric for which d((x,s),(x,s′))=∣s−s′∣, uniform continuity gives for every ε>0 a δ>0 with sup⁡x∈D2∥gs(x)−gs′(x)∥2<ε whenever ∣s−s′∣<δ. Hence a jointly continuous family of homeomorphisms gives a continuous path s↦gs 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

technique · direct
1.1A1F1F2F7

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.

1.2F6given

The forgetting homomorphism ψ. Let Fn be the pointwise stabiliser of Qn, and let F′ be the pointwise stabiliser of Qn′, as in [F6]. A homeomorphism fixing q1,…,qn fixes q1,…,qn−1, so the inclusion inc⁡:Fn↪F′ is defined and continuous for the subspace topologies; define ψ:=π0(inc⁡), that is, ψ([f]):=[f] for the class of a homeomorphism f∈Fn read in π0(F′)=PMod⁡(D2,Qn′;∂D2) by [F6]. This is well defined: if f and f′ are joined by a path in Fn, the same path lies in F′ and joins them there. It is a group homomorphism: for [f],[g]∈π0(Fn) one has [f][g]=[f∘g], and inc⁡(f∘g)=inc⁡(f)∘inc⁡(g), so ψ([f][g])=[f∘g]=[f][g]=ψ([f])ψ([g]). Thus ψ is exactly the homomorphism that forgets the last marked point.

1.3F2F3F4F5

An isomorphism from the pure braid group and the identification Push⁡n=Θn∘κ. By [F4] the restriction of Ψnmc to Gnpure is a group isomorphism onto PMod⁡(D2,Qn;∂D2), and by [F3] the map Ψnconf is a group isomorphism Gnpure→PBn; so Θn:=Ψnmc∣Gnpure∘(Ψnconf)−1:PBn⟶PMod⁡(D2,Qn;∂D2) is a group isomorphism. Now let [γ]∈π1(Yn,qn). Its ordered lift Lγ is a pure geometric braid based at Qn: its coordinates are the constant paths at q1,…,qn−1 and the loop γ, they are pairwise distinct and lie in int⁡D2, and Lγ(0)=Qn=Lγ(1), so [Lγ]∈Gnpure. Writing i:Yn→Fn(int⁡D2), x↦(q1,…,qn−1,x) for the fibre inclusion, we have i∘γ=Lγ, so by [F2] κ([γ])=ι∗F(i∗[γ])=ι∗F[Lγ]. The coordinate path of the braid Lγ is Lγ itself, so by [F3] (Ψnconf)−1(κ([γ])−1)=[Lγ], while [F5] gives Ψnmc([Lγ])=Push⁡n([γ])−1. Applying the isomorphism Θn to the inverse of κ([γ]) we therefore get Θn(κ([γ])−1)=Push⁡n([γ])−1,henceΘn(κ([γ]))=Push⁡n([γ]), because a group isomorphism carries inverses to inverses.

1.4F3F4given

Reading Θm off a lifted isotopy. Let m≥1 and let x∈PBm with [β]:=(Ψmconf)−1(x)∈Gmpure and coordinate path z=zβ. Suppose g:I→Homeo⁡+(D2,∂D2) is a lift of the raw slice loop S(β) with g(0)=id⁡ and with gs(qj)=zj(s) for all j and s. Then g is a lift of S(β) with initial value the identity, so [F4] gives Ψmmc([β])=[g(1)], and hence Θm(x)=[g(1)]∈PMod⁡(D2,Qm;∂D2). Moreover g(1)(qj)=zj(1)=qj for every j, because [β] is pure, so g(1)∈Fm is an element of the pointwise stabiliser and [g(1)] is literally a class of π0(Fm).

1.5F3F4F7F8F10step 1.1step 1.3step 1.4

Transport to the truncated configuration. Write C=(c1,…,cn−1) for the canonical rank-(n−1) configuration. The affine motion ηj(t)=(1+t/n)qj+t(hn−1,0),hn−1=1/(4n), carries qj to cj: qj=(2j−n−1)/(4(n+1)) gives ηj(1)=(2j−n)/(4n). 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 0 near 0 and 1 near 1, and extend constantly outside I. By [F7] and step 1.1 this smooth separated motion extends to a boundary-fixed disk isotopy with endpoint R satisfying R(qj)=cj for j<n. Conjugation f↦RfR−1 identifies the pointwise stabiliser of Qn′ with that of C, continuously in both directions by [F10]. It induces an isomorphism CR of their component groups. Also R acts coordinatewise on configuration spaces and induces an isomorphism R∗ of their fundamental groups at these basepoints, commuting with the open-to-closed inclusions by [F8]. Define Θ′:=CR−1∘Θn−1∘R∗:π1(Fn−1(D2),Qn′)⟶PMod⁡(D2,Qn′;∂D2), where Θn−1 is the canonical isomorphism of step 1.3. This is an isomorphism. If z′ is any ordered loop at Qn′ lifted by an ambient isotopy g from the identity, then RgR−1 lifts Rz′ from the canonical configuration C. The inverse-slicing formula and step 1.4 give Θ′((ι∗F[z′])−1)=[g1]. This transported formula, rather than a canonical rank-(n−1) identification at Qn′, will be used below.

2.1F2F3F7F8F9F10step 1.1step 1.2step 1.4step 1.5

Naturality at the actual truncation. Let x∈PBn and choose its pure geometric representative β=(Ψnconf)−1(x). By [F7] and [F9] its ordered path z 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 g from the identity with gs(qj)=zj(s); this is a continuous path of homeomorphisms by [F10]. Step 1.4 gives Θn(x)=[g1]. The same isotopy lifts the truncated loop z′=(z1,…,zn−1), based at Qn′. By [F3] and [F8] the forgetting map of [F2] satisfies φ(x)=(ι∗F[z′])−1∈π1(Fn−1(D2),Qn′). Step 1.5 therefore gives Θ′(φ(x))=[g1] in the component group of the pointwise stabiliser of Qn′. Step 1.2 identifies this class with ψ(Θn(x)). Thus ψ∘Θn=Θ′∘φ, with every map based at the specified configuration.

3.1F2F4step 1.3step 2.1∎

Exactness of the Birman sequence. By step 1.3, Push⁡n=Θn∘κ with Θn an isomorphism and κ injective by [F2], so Push⁡n is injective: if Push⁡n([γ])=1, then κ([γ])=Θn−1(1)=1 and hence [γ]=1. Its image is Θn(im⁡κ)=Θn(ker⁡φ) by the exactness in [F2]. By step 2.1 and the injectivity of Θ′, Θn−1(ker⁡ψ)=ker⁡(ψ∘Θn)=ker⁡(Θ′∘φ)=ker⁡φ, so Θn(ker⁡φ)=ker⁡ψ and im⁡Push⁡n=ker⁡ψ; this proves claims 1 and 2. Finally ψ∘Θn=Θ′∘φ 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 Fn−1=π1(Yn,qn) the free group of [F2] on the n−1 puncture meridians.

Remarks

  • The proof never uses the splittings, the section, or any explicit generating family of PBn: 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 Push⁡n is obtained because the fibre inclusion κ is injective, itself a consequence of π2(Fn−1(int⁡D2))=0.
  • The identification Push⁡n=Θn∘κ is where the two inverse signs cancel: the configuration identification Ψconf and the mapping-class identification Ψmc both invert the raw slicing, so the point push of a loop agrees with the image of the fibre class in PBn 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

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