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.

All four classical braid models realize the Artin presentation

Statement

Assume AC and n≥1. Write BnArtin for the Artin-presentation group of The braid group by Artin presentation, Gn=Bngeom for the geometric braid group at the base tuple Qn of The elementary geometric half twist, its support disc, and its opposite, Bnconf:=π1(Cn(D2),[Qn]),π1(Cn(int⁡D2),[Qn]) for the unordered configuration-space fundamental groups of Unordered configuration spaces Cn(X) at the same base configuration, the second identified with the first by the open-to-closed inclusion, and Mod⁡(D2,Qn;∂D2) for the boundary-fixed punctured-disk mapping class group of Boundary-fixed mapping class group of a punctured disk. Then:

  1. the four models BnArtin, Gn, Bnconf≅π1(Cn(int⁡D2),[Qn]) and Mod⁡(D2,Qn;∂D2) are pairwise connected by the canonical isomorphisms: the completeness isomorphism φn of The Artin presentation is complete for geometric braids, the published inverse-loop isomorphism of The geometric and configuration braid models agree at the fixed base configuration, the open-to-closed identification, and the AC-dependent boundary-fixed mapping-class isomorphism of Braid group as boundary-fixed punctured-disk mapping classes (an in-run batch-20 scaffold, not a published supplier);
  2. under these identifications, for every 1≤i≤n−1 the Artin generator σi corresponds to the class [σi] of the elementary geometric half twist, to the configuration loop class Φ([σi]) whose endpoint monodromy is the adjacent transposition (i i+1), and to the class [Hi] of the half twist supported near the i-th and (i+1)-st punctures, that is, of the explicit boundary-fixed homeomorphism supported in the disc Ui and exchanging qi and qi+1;
  3. consequently each of the four models carries the Artin presentation with these corresponding generators: for each model the assignment σi↦ its generator extends to a group isomorphism from BnArtin onto the model, so the model is presented by the generators σ1,…,σn−1 subject to the two Artin relations and to no further relations.

For n=1 there is no generator, all four groups are trivial, and clauses 2 and 3 are vacuous.

Facts & Assumptions

Given: AC, an integer n≥1, the Artin-presentation group BnArtin=⟨X∣R⟩ of The braid group by Artin presentation with generating set X={σ1,…,σn−1} and its two families of Artin relators interpreted in the sense of Group presentation by generators and relations, the four models of the statement, and an index i with 1≤i≤n−1.

[F1]

For every n≥1 the surjection φn ⁣:BnArtin→Gn of The Artin presentation surjects onto the geometric braid group is an isomorphism, and it carries each generator σi to the class [σi] of the elementary geometric half twist of The elementary geometric half twist, its support disc, and its opposite; the endpoint permutation of that class is the transposition of i and i+1 (The Artin presentation is complete for geometric braids, The Artin presentation surjects onto the geometric braid group, The elementary geometric half twist, its support disc, and its opposite).

[F2]

The inverse-loop slicing map Φ ⁣:Gn→Bnconf=π1(Cn(D2),[Qn]), Φ([β])=(ι∗C[S(β)])−1, is a group isomorphism intertwining the endpoint maps, πconf(Φ([β]))=πgeo([β]) for every [β]∈Gn; and the open-to-closed inclusion induces an isomorphism ι∗C ⁣:π1(Cn(int⁡D2),[Qn])→π1(Cn(D2),[Qn]) at the same basepoint (The geometric and configuration braid models agree at the fixed base configuration, The geometric endpoint permutation matches covering monodromy, The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[F3]

The composite Ψ:=δ∘(ι∗C)−1∘Φ ⁣:Gn→Mod⁡(D2,Qn;∂D2) is a group isomorphism, and for every 1≤i≤n−1 it satisfies Ψ([σi])=[Hi], where Hi is the explicit boundary-fixed homeomorphism supported in the support disc Ui of The elementary geometric half twist, its support disc, and its opposite and exchanging qi and qi+1. The theorem supplying Ψ is an in-run batch-20 scaffold of this run, not a published supplier (Braid group as boundary-fixed punctured-disk mapping classes, Boundary-fixed mapping class group of a punctured disk).

[F4]

AC holds, and AC implies dependent choice and countable choice (The Axiom of Choice, AC implies DC implies countable choice); this is the hypothesis under which the mapping-class isomorphism of [F3] and the free-kernel suppliers of the completeness theorem of [F1] are available.

[F5]

Presentation transport along an isomorphism. If a group has a presentation B=⟨X∣R⟩=F(X)/⟨ ⁣⟨R⟩ ⁣⟩F(X) and θ ⁣:B→M is a group isomorphism, then the composite qθ ⁣:F(X)→B→ θ M of the quotient map with θ is a surjective homomorphism with kernel ⟨ ⁣⟨R⟩ ⁣⟩F(X): surjectivity is clear, and qθ(w)=eM holds exactly when q(w)∈ker⁡θ={eB}, that is, exactly when w∈⟨ ⁣⟨R⟩ ⁣⟩F(X). The first isomorphism theorem therefore gives M≅F(X)/⟨ ⁣⟨R⟩ ⁣⟩F(X)=⟨X∣R⟩, the isomorphism carrying the class of each x∈X to θ([x]) (Group presentation by generators and relations, First isomorphism theorem for groups: G/ker⁡f≅im⁡f, The braid group by Artin presentation).

Proof

technique · direct
1.1F1

The abstract and geometric models. By [F1] the map φn ⁣:BnArtin→Gn is a group isomorphism and φn(σi)=[σi] for every i, so the abstract model and the geometric model are identified generator by generator.

2.1F1F2step 1.1

The two configuration models. By [F2] the inverse-loop slicing map Φ ⁣:Gn→Bnconf is a group isomorphism with πconf∘Φ=πgeo, and ι∗C is an isomorphism π1(Cn(int⁡D2),[Qn])→Bnconf; hence the composites Φ∘φn and (ι∗C)−1∘Φ∘φn, being composites of group isomorphisms, are group isomorphisms from BnArtin onto Bnconf and onto π1(Cn(int⁡D2),[Qn]) respectively. The generator σi is carried to Φ([σi]), whose endpoint monodromy is πconf(Φ([σi]))=πgeo([σi]), the transposition of i and i+1 by [F1] and [F2]; in the open-disc model it is carried to (ι∗C)−1Φ([σi]), the same configuration loop class read through the inclusion.

2.2F3step 1.1

The mapping-class model. By [F3] the composite Ψ is a group isomorphism Gn→Mod⁡(D2,Qn;∂D2) with Ψ([σi])=[Hi], so Ψ∘φn is a group isomorphism BnArtin→Mod⁡(D2,Qn;∂D2) carrying σi to [Hi], the class of the boundary-fixed half twist supported in Ui that exchanges qi and qi+1.

3.1F5step 1.1step 2.1step 2.2

Presentation transport to each model. Let R be the set of the two families of Artin relators, so that BnArtin=⟨X∣R⟩=F(X)/⟨ ⁣⟨R⟩ ⁣⟩F(X) by The braid group by Artin presentation and Group presentation by generators and relations. Apply [F5] to the identity isomorphism of BnArtin and to the isomorphisms of steps 1.1, 2.1 and 2.2: the identity on BnArtin, φn, Φ∘φn, (ι∗C)−1∘Φ∘φn and Ψ∘φn. Each of the five models is therefore isomorphic to F(X)/⟨ ⁣⟨R⟩ ⁣⟩ through the composite of the quotient map with that isomorphism, with the class of σi mapping to the corresponding generator displayed in steps 1.1, 2.1 and 2.2; in particular each model is generated by those n−1 elements and satisfies no relation among them beyond the Artin relators.

4.1F1F3F4step 1.1step 2.1step 2.2step 3.1

Conclusion and the one-strand case. Steps 1.1, 2.1 and 2.2 identify the four models pairwise through the stated isomorphisms and track σi to the half twist, to the loop of monodromy (i i+1) and to the supported half twist, and step 3.1 transports the presentation to each of them, proving all three clauses for n≥2. For n=1 the index range 1≤i≤n−1 is empty, so the generator clauses are vacuous, and B1Artin is the trivial group given by the empty presentation by The braid group by Artin presentation; the isomorphisms of [F1]–[F3] then identify the other three models with it, so each of the four models is trivial and carries the empty presentation of the trivial group, which is clause 3 at n=1. AC enters only through [F3] and through the free-kernel suppliers of the completeness theorem recorded in [F4]. ∎

Remarks

  • The corollary does not reprove the mapping-class or configuration identifications: it composes them with the completeness theorem and tracks the generator through the composite. Its only genuinely new input beyond the suppliers is the bookkeeping that the generator correspondence survives each composite, which is why the configuration and mapping-class models inherit the Artin presentation.
  • The mapping-class isomorphism is an in-run batch-20 draft (Braid group as boundary-fixed punctured-disk mapping classes, precheck PASS; not a published supplier), flagged in the dispatch report together with the consuming step 2.2 and the cross-batch edge recorded in frontier-37-owner-30-batch-22.cross-batch-dependencies.json; no published theorem supplies it.
  • The construction is choice-free apart from the AC hypothesis: the presentations are finite, the free group on X is explicit, and no connecting path or lift is chosen in the composites, all of which use the fixed basepoint Qn of the suppliers.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

84 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