Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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 the last puncture

Definition

Assume the Axiom of Choice, let n≥1, and let D2, int⁡D2 and the base configuration Qn=(q1,…,qn) be as in Boundary-fixed mapping class group of a punctured disk. Point pushing holds the first n−1 punctures fixed and moves the last one around them.

The puncture complement. Put

Yn:=int⁡D2∖{q1,…,qn−1};

for n=1 the removed set is empty and Y1=int⁡D2. The domain Yn contains qn, because qn is distinct from q1,…,qn−1, and every point of Yn is distinct from the first n−1 marked points.

The ordered loop and its orbit. Let γ:I→Yn be a based loop of Yn at qn, that is, a continuous map with γ(0)=qn=γ(1). Its ordered lift is

Lγ:I⟶Fn(int⁡D2),Lγ(t):=(q1,…,qn−1,γ(t)).

The n coordinates of Lγ(t) are pairwise distinct because γ(t)≠qj for j<n and the qj are pairwise distinct, so Lγ takes values in the ordered configuration space (Ordered configuration spaces Fn(X)); it is continuous, being built from constant maps and γ, and Lγ(0)=Qn=Lγ(1). Composing with the quotient map pn:Fn(int⁡D2)→Cn(int⁡D2) gives the based loop

γˉ:=pn∘Lγ:I⟶Cn(int⁡D2),γˉ(t)=[ (q1,…,qn−1,γ(t)) ],

of the unordered configuration space at the basepoint [Qn] (Unordered configuration spaces Cn(X)).

The point-pushing class. Let δ be the inverse-endpoint boundary map of Boundary map from point motions. The point-pushing homomorphism at the last puncture is defined on the path-homotopy class [γ] of a based loop γ at qn by

Push⁡n([γ]):=δ([γˉ])∈Mod⁡(D2,Qn;∂D2).

The class is pure. The tuple Lγ is a pure geometric braid based at Qn: it is a tuple of continuous paths in int⁡D2 with pairwise distinct values and both the initial tuple Lγ(0) and the terminal tuple Lγ(1) equal to Qn (Geometric braids in the disc with setwise endpoints), and its raw slice is S(Lγ)=pn∘Lγ=γˉ (Geometric braid classes and the unordered configuration fundamental group). Let Ψ be the braid-to-mapping-class isomorphism of Braid group as boundary-fixed punctured-disk mapping classes, so that Ψ=δ∘(ι∗C)−1∘Φ with Φ([β])=(ι∗C[S(β)])−1 precomposed with the inverse of the open-to-closed configuration isomorphism; then

Ψ([Lγ])=δ([S(Lγ)]−1)=δ([ γˉ ])−1=Push⁡n([γ])−1.

Since Lγ is pure, Ψ([Lγ]) lies in PMod⁡(D2,Qn;∂D2) by Pure braids as pure mapping classes, and PMod⁡(D2,Qn;∂D2) is a subgroup of Mod⁡(D2,Qn;∂D2) (Pure boundary-fixed mapping classes), so its inverse Push⁡n([γ]) lies in PMod⁡(D2,Qn;∂D2) as well. Thus the point push of the last puncture is a pure mapping class: it fixes the first n−1 punctures and acts trivially on the marked set. In particular the fixed coordinates do not merely preserve Qn setwise; they prevent any exchange of punctures.

Well-definedness. The value is independent of the representative of [γ]: if H:I×I→Yn is a path homotopy relative to {0,1} from γ to a second based loop γ′, then (t,u)↦(q1,…,qn−1,H(t,u)) is a path homotopy relative to {0,1} in Fn(int⁡D2) from Lγ to Lγ′, and composing it with the continuous map pn gives a path homotopy relative to {0,1} from γˉ to γˉ′: the composite of a continuous homotopy with a continuous map is continuous and it is constant on {0,1}×I because H is. Since δ is well defined on path-homotopy classes (Point-motion boundary map is a homomorphism), the class Push⁡n([γ]) depends only on [γ].

Multiplicativity. Let γ,γ′ be based loops at qn and let γ∗γ′ be their concatenation, traversed first γ then γ′ (Based loops and the fundamental group). Since concatenation is computed coordinatewise, Lγ∗γ′(t)=Lγ(2t) for t≤12 and Lγ∗γ′(t)=Lγ′(2t−1) for t≥12, that is, Lγ∗γ′=Lγ∗Lγ′; applying the continuous map pn gives γ∗γ′‾=γˉ∗γˉ′. Hence, by the multiplicativity of δ (Point-motion boundary map is a homomorphism) and the product convention [γ][γ′]=[γ∗γ′] of Based loops and the fundamental group,

Push⁡n([γ][γ′])=δ([γ∗γ′‾])=δ([γˉ][γˉ′])=δ([γˉ]) δ([γˉ′])=Push⁡n([γ]) Push⁡n([γ′]).

So Push⁡n:π1(Yn,qn)→PMod⁡(D2,Qn;∂D2) is a group homomorphism. No choice is made in the definition itself: the lift of γˉ used to evaluate δ is supplied by the evaluation fibration, and its endpoint component is independent of the lift by the cited well-definedness lemma. The Axiom of Choice enters only through the evaluation fibration and the isomorphisms Ψ and δ built from it.

No injectivity claim. The kernel of Push⁡n is not computed here. The Birman exact sequence and the resulting injectivity claim are deferred to the companion pure-braid page. This item only defines Push⁡n and proves that it is a homomorphism into the pure subgroup.

Elementary case. For n=1 the domain Y1=int⁡D2 carries no puncture, the first n−1 coordinates are absent, the construction above applies verbatim, and PMod⁡(D2,Q1;∂D2)=Mod⁡(D2,Q1;∂D2) because the setwise and pointwise stabilisers of a one-point marked set coincide (Pure boundary-fixed mapping classes); no injectivity is claimed in this case either.

Remarks

  • The homomorphism pushes the n-th puncture along loops in the complement of the other n−1 punctures. The first n−1 points are frozen throughout, so the resulting ambient isotopy moves only the last point among the marked points and represents a pure class, even though the definition itself only records the unordered loop.
  • The definition is the disk boundary-fixed version of the classical point-pushing construction: the evaluation boundary map plays the role of the connecting homomorphism, and the inverse-endpoint convention of the library is what makes Push⁡n a homomorphism rather than an anti-homomorphism.
  • The deferred injectivity is exactly the content of Birman's exact sequence for the disk, and it is stated on the pure-braid page after the relevant higher homotopy group has been shown to vanish; the present item must not be used as if it already contained that theorem.

Depends on

Used by

Dependency tree · two levels

56 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