Alphabeta Math
CorollaryStatement: 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.

Pure braids as pure mapping classes

Statement

Assume the Axiom of Choice. Let n∈N, let Qn be the base configuration of Boundary-fixed mapping class group of a punctured disk, let Gn be the geometric braid group at Qn with endpoint-permutation homomorphism πgeo:Gn→Sn, and let Gnpure:=ker⁡πgeo be the pure geometric braid subgroup (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, Pure geometric braids and ordered configuration loops). Let

Ψ:Gn⟶Mod⁡(D2,Qn;∂D2)

be the braid-to-mapping-class isomorphism of Braid group as boundary-fixed punctured-disk mapping classes. Then

Ψ(Gnpure)=PMod⁡(D2,Qn;∂D2):

under the braid-to-mapping-class isomorphism the pure geometric braid subgroup is exactly the pure boundary-fixed mapping class group. The assertion holds for every n≥0, the cases n≤1 being trivial.

Facts & Assumptions

Given: The Axiom of Choice, the number n, the base configuration Qn, the braid group Gn with its endpoint-permutation homomorphism πgeo:Gn→Sn, and the isomorphism Ψ of Braid group as boundary-fixed punctured-disk mapping classes.

[L1]

Ψ:Gn→Mod⁡(D2,Qn;∂D2) is a group isomorphism (Braid group as boundary-fixed punctured-disk mapping classes).

[L2]

For every [β]∈Gn one has Ψ([β])=[hβ], where hβ∈F is the endpoint of a lift of the raw slice loop S(β) with initial value id⁡, and hβ(Qn)=z(1) for the ordered coordinate lift z of S(β) (Braid group as boundary-fixed punctured-disk mapping classes).

[L3]

ev⁡:Homeo⁡+(D2,∂D2)→Cn(int⁡D2) is a locally trivial bundle whose fibre over [Qn] is exactly F=Homeo⁡+(D2,∂D2;Qn); hence a boundary-fixing homeomorphism h lies in F exactly when [h(Qn)]=[Qn] (Evaluation is a numerable bundle and Hurewicz fibration).

[L4]

The quotient covering p∘:Fn(int⁡D2)→Cn(int⁡D2) has a unique lift of a based loop at [Qn] starting at Qn, and writing the lift as t↦(z1(t),…,zn(t)) its coordinates form a geometric braid based at Qn whose unordered slice at every time is the given loop (An interior configuration loop traces a geometric braid).

[L5]

For a braid β=(z1,…,zn) one has zj(1)=qπ(β)(j) for 1≤j≤n, and πgeo([β])=π(β) is well defined on braid-isotopy classes (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).

[L6]

For every f∈F there is a unique permutation π(f)∈Sn with f(qj)=qπ(f)(j) for all j, and this permutation is locally constant along a path in F (Boundary-fixed mapping class group of a punctured disk).

[L7]

PMod⁡(D2,Qn;∂D2) is identified with the subgroup of Mod⁡(D2,Qn;∂D2) consisting of the classes with trivial permutation of Qn; for n≤1 the setwise and pointwise stabilisers of Qn coincide (Pure boundary-fixed mapping classes).

[L8]

The pure geometric braid subgroup is Gnpure=ker⁡πgeo (Pure geometric braids and ordered configuration loops).

Proof

technique · direct
1.1L2L3L4L5L6

The lift endpoint induces the endpoint permutation. Fix [β]∈Gn and let g be a lift of the raw slice loop S(β) with g(0)=id⁡, so that Ψ([β])=[hβ] with hβ=g(1) and hβ(Qn)=z(1) by [L2]; here z is the ordered coordinate lift of S(β) from Qn, whose coordinates satisfy zj(1)=qπgeo([β])(j) by [L4] and [L5]. First, hβ lies in F: indeed ev⁡(hβ)=S(β)(1)=[Qn], so [hβ(Qn)]=[Qn] and [L3] applies. Therefore the unique permutation π(hβ) of [L6] is defined, and evaluating the identity hβ(Qn)=z(1) in the j-th coordinate gives hβ(qj)=zj(1)=qπgeo([β])(j)(1≤j≤n), so π(hβ)=πgeo([β]): the permutation realised by the evaluation endpoint of the lifted slice is exactly the geometric endpoint permutation of the braid class.

2.1L6L7L8step 1.1

Trivial permutation is exactly purity. By [L7], a class [f]∈Mod⁡(D2,Qn;∂D2) lies in PMod⁡(D2,Qn;∂D2) exactly when the permutation it induces on Qn is trivial; by [L6] the permutation induced by a representative f∈F is a class invariant, so the condition is π(hβ)=id⁡ for the endpoint of any such representative. Combining with step 1.1, for [β]∈Gn we have the equivalence Ψ([β])∈PMod⁡(D2,Qn;∂D2)  ⟺  π(hβ)=id⁡  ⟺  πgeo([β])=id⁡  ⟺  [β]∈Gnpure, the last equivalence being the definition [L8] of the pure subgroup as the kernel of πgeo.

3.1L1L5L7step 1.1step 2.1∎

Conclusion. The equivalence of step 2.1 says that an element [β]∈Gn satisfies Ψ([β])∈PMod⁡(D2,Qn;∂D2) if and only if [β]∈Gnpure; since Ψ is a bijection by [L1], it carries Gnpure onto PMod⁡(D2,Qn;∂D2). The restriction Ψ∣Gnpure is a group isomorphism onto its image because Ψ is a group isomorphism by [L1], so the pure geometric braid subgroup equals the pure boundary-fixed mapping class group under this identification. When n=0 both groups are trivial and the statement is immediate; when n=1 the group S1 is trivial, so every braid class is pure, and by [L7] the setwise and pointwise stabilisers of the one-point marked set coincide, so every mapping class is pure; the equivalence above also holds in these cases because z1(1)=q1 for every one-strand braid.

Remarks

  • The corollary is the mapping-class counterpart of the published identification of the pure braid group with the fundamental group of the ordered configuration space; here the geometric endpoint permutation is compared with the permutation induced on the marked points by the lifted homeomorphism, and the two are literally the same permutation by step 1.1.
  • Consistency with the published covering monodromy (The geometric endpoint permutation matches covering monodromy): the monodromy of ι∗C[S(β)] is πgeo([β])−1, while the label record of the endpoint tuple z(1) read in step 1.1 is πgeo([β]); the inverse is exactly the label-versus-action conversion recorded in the definition of endpoint monodromy, so both computations describe the same permutation of the marked set. This is a consistency check between two published computations, not a proof input: the argument above uses only the endpoint labels z(1).
  • The Axiom of Choice is inherited from the braid-to-mapping-class isomorphism and is not used again here: the endpoint permutation of a braid and the permutation induced by a homeomorphism of the pair are read off the given data without any selection.

Depends on

Used by

Dependency tree · two levels

62 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