Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-27
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.

The configuration braid group Bnconf as the fundamental group of an unordered configuration space

Definition

Fix n∈N and the same base configuration q=(q1,…,qn) of pairwise distinct points of int⁡D2 that is used in The pure braid group PBn as the fundamental group of an ordered configuration space, with D2 the closed unit disc. Write p:Fn(D2)→Cn(D2) for the quotient of the ordered by the unordered configuration space, so that p(q)=[q] is the orbit of q (Unordered configuration spaces Cn(X)). The configuration braid group on n strands is the fundamental group (Based loops and the fundamental group)

Bnconf:=π1(Cn(D2),[q]),

the group of based-loop classes at the orbit [q] in the unordered configuration space of the closed disc, with the first-then-second loop product.

The open-disc model. The inclusion-induced map ιC:Cn(int⁡D2)→Cn(D2) of The interior-disc and closed-disc configuration spaces are homotopy equivalent induces an isomorphism π1(Cn(int⁡D2),[q])⟶π1(Cn(D2),[q]) at the same basepoint (claim 3 of that lemma, The homomorphism on fundamental groups induced by a pointed continuous map), so Bnconf may be computed from either disc model exactly as PBn may. Both groups in this definition and in The pure braid group PBn as the fundamental group of an ordered configuration space are taken at the basepoints [q] and q coming from the same tuple q, which is what makes the comparison map of the configuration braid short exact sequence, proved in a later item on this page, a map of based fundamental groups.

The basepoint. Since Fn(D2)→Cn(D2) is surjective every basepoint of Cn(D2) is an orbit, and since Cn(D2) is path-connected (claim 2 of Ordered configuration spaces cover the unordered ones regularly with deck group Sn) the groups at different orbits are isomorphic by conjugation along a path (Conjugating loop classes by a path is an isomorphism of fundamental groups); no particular isomorphism is fixed. For n=0 the space C0(D2) is a point and B0conf is the one-element group.

The superscript. The decoration conf records that the group is defined here through configuration spaces, and it is retained until the later geometric identification of Bnconf with the braid group given by strand diagrams and with its Artin presentation. No such identification and no presentation is asserted on this page; neither is any identification of Bnconf with a group of self-homeomorphisms of the disc.

Depends on

Used by

Dependency tree · two levels

50 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