Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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 short exact sequence 1→PBn→Bnconf→Sn→1

Statement

Let n∈N, let q∈Fn(int⁡D2) be the base configuration used in The pure braid group PBn as the fundamental group of an ordered configuration space and The configuration braid group Bnconf as the fundamental group of an unordered configuration space (for n=0 this is the empty tuple, the unique point of F0(D2)), and let p:Fn(D2)→Cn(D2) be the quotient map of Unordered configuration spaces Cn(X). Write PBn=π1(Fn(D2),q),Bnconf=π1(Cn(D2),[q]) for the two configuration groups carried by the same q, and let π:Bnconf→Sn be the endpoint monodromy of Endpoint monodromy of an unordered configuration loop as a permutation of the labels: for a based loop α at [q] with lift α~ starting at q, π([α])=σα is the unique permutation with α~(1)=σα⋅q. Then the sequence of groups and homomorphisms 1⟶PBn⟶p∗Bnconf⟶πSn⟶1 is a short exact sequence in the sense of Group extensions, sections, complements, and split extensions: the left arrow is the unique homomorphism from the one-element group 1, the middle arrow p∗ is induced by p on fundamental groups, and p∗ is injective,π is surjective,im⁡p∗=ker⁡π.

This holds for every n≥0, including n=0 and n=1 where Sn is the trivial group. The two groups use the same base configuration q and the map p of Unordered configuration spaces Cn(X), so the middle arrow is a map between fundamental groups at q and at its orbit [q]; no splitting of the sequence is asserted, and neither PBn nor Bnconf is here identified with a presentation or with a group of strand diagrams.

Facts & Assumptions

Given: A natural number n, the base configuration q∈Fn(int⁡D2)⊆Fn(D2), the quotient map p:Fn(D2)→Cn(D2), the groups PBn and Bnconf at q and [q], and the endpoint monodromy π:Bnconf→Sn.

[F1]

PBn=π1(Fn(D2),q) and Bnconf=π1(Cn(D2),[q]), both with the first-then-second loop product, and the labels 1,…,n are identified with n={0,…,n−1} by κ(i)=i−1; F0(D2) and C0(D2) are one-point spaces, and single-coordinate evaluation and the orbit map give canonical homeomorphisms F1(D2)≅D2≅C1(D2) (The pure braid group PBn as the fundamental group of an ordered configuration space, The configuration braid group Bnconf as the fundamental group of an unordered configuration space, Ordered configuration spaces Fn(X), Unordered configuration spaces Cn(X), Based loops and the fundamental group).

[F2]

For a based loop α at [q] with lift α~ starting at q, one has α~(1)=σα⋅q for a unique σα∈Sn, and π([α])=σα defines a group homomorphism π:Bnconf→Sn (Endpoint monodromy of an unordered configuration loop as a permutation of the labels, Monoid homomorphism and group homomorphism).

[L3]

D2 is nonempty, connected, Hausdorff and a topological 2-manifold with boundary, so Ordered configuration spaces cover the unordered ones regularly with deck group Sn applies with M=D2 and d=2≥2: p is a covering map, Fn(D2) and Cn(D2) are path-connected, and every fibre of p has n! elements (The closed disk D2 is a connected Hausdorff topological 2-manifold with boundary, Unordered configuration spaces Cn(X)).

[L4]

For a covering and a path in the base, every point of the fibre over its initial point is the starting point of exactly one lift (Existence and uniqueness of path lifts through a covering map).

[L5]

The formula (σ⋅x)i=xσ−1(i−1)+1 defines a free continuous left action of Sn on Fn(X) by homeomorphisms, p(σ⋅x)=p(x) for x∈Fn(D2), and p−1([q])=Sn⋅q; in particular σ⋅q=q only for the identity σ (The symmetric group acts continuously and freely on Fn(X) by permuting labels, Unordered configuration spaces Cn(X)).

[L6]

p∗ is a well-defined group homomorphism π1(Fn(D2),q)→π1(Cn(D2),[q]) with p∗([γ])=[p∘γ], and it is injective because p is a covering map (The homomorphism on fundamental groups induced by a pointed continuous map, Induced fundamental-group maps are well defined, functorial and invariant under based homotopy, A covering map induces an injective homomorphism on fundamental groups).

[L7]

A diagram 1→N→G→H→1 of groups and homomorphisms is a short exact sequence when the first map is injective, the last is surjective and the image of the first equals the kernel of the last (Group extensions, sections, complements, and split extensions); the image of a group homomorphism is a subgroup of its target, and a homomorphism is surjective exactly when its image is the whole target (The kernel and image of a group homomorphism, The image of a group homomorphism is a subgroup and its kernel is a normal subgroup).

[L8]

For a set T⊆Sn the subgroup ⟨T⟩ is the smallest subgroup containing T, and Sn is generated by the adjacent transpositions sj, 1≤j<n; for n=0,1 the empty set generates the trivial group Sn (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups, The adjacent transpositions (1 2),(2 3),…,(n−1 n) generate Sn, The symmetric group Sym⁡(X): the bijections of a set X under composition).

[L9]

Under the label identification of [F1], the adjacent transposition sj=(j j+1) exchanges the labels j and j+1 and fixes the others, so that sj⋅x is the tuple x with its j-th and (j+1)-st entries exchanged (The adjacent transpositions (1 2),(2 3),…,(n−1 n) generate Sn, The symmetric group acts continuously and freely on Fn(X) by permuting labels).

[L10]

Addition and multiplication of complex numbers and the affine maps z↦z+c and z↦λz are continuous, and ∣z+w∣≤∣z∣+∣w∣, ∣λz∣=∣λ∣ ∣z∣ (Vector addition and scalar multiplication are continuous in a normed space, The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane, Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[L11]

If X={x0} is a one-point space then every loop at x0 has the constant value x0, so π1(X,x0) has exactly one element, the class of the constant loop (Based loops and the fundamental group).

Proof

technique · direct
1.1

The quotient is a covering and p∗ is injective. By [L3] the map p:Fn(D2)→Cn(D2) is a covering map; by [L6] the induced map p∗:π1(Fn(D2),q)→π1(Cn(D2),[q]), p∗([γ])=[p∘γ], is a well-defined group homomorphism and is injective. Under [F1] this is a homomorphism p∗:PBn→Bnconf.

F1L3L6
1.2

The kernel of π lies in the image of p∗. Let [α]∈Bnconf with π([α])=e, and let α~ be the lift of α starting at q; by the definition of π in [F2] one has α~(1)=σα⋅q=π([α])⋅q=e⋅q=q. So α~ is a loop at q in Fn(D2), and [L6] gives p∗[α~]=[p∘α~]=[α]. Hence ker⁡π⊆im⁡p∗.

F2L4L6
1.3

A model configuration with explicit distances. Assume n≥2 and put qj′:=2j−n−12n for 1≤j≤n, and for 1≤i<n put ui:=qi′+qi+1′2=2i−n2n, w:=12n and η:=w2. Then qj+1′−qj′=1n and ∣qj′∣≤n−12n<1 for all j, so q′=(q1′,…,qn′)∈Fn(int⁡D2); moreover qi′=ui−w and qi+1′=ui+w, and ∣qj′−ui∣=∣2j−2i−1∣2n≥3w for every j∉{i,i+1}.

F1L10algebra
2.1

The first arrow is injective with image the kernel of p∗. The left arrow is the unique homomorphism 1→PBn from the one-element group; its image consists of the identity ePBn alone, so it is injective, and since p∗ is injective by step 1.1 its kernel is {ePBn}, which is exactly that image.

step 1.1L7
2.2

The image of p∗ lies in the kernel of π. Let [γ]∈PBn with γ:I→Fn(D2) a loop at q; then α:=p∘γ is a loop at [q], since p(γ(0))=[q]=p(γ(1)). The path γ satisfies p∘γ=α and γ(0)=q, so by [L4] it is the unique lift of α starting at q. By [F2] the endpoint of that lift is σα⋅q for the permutation π([α])=σα, that is σα⋅q=γ(1)=q; freeness of the action by [L5] gives σα=e, so π(p∗[γ])=π([α])=e. Hence im⁡p∗⊆ker⁡π.

step 1.1F2L4L5
2.3

A swap move at the model configuration. Assume n≥2 and fix i with 1≤i<n, keeping the notation of step 1.3. Define paths ai,bi:I→C by the two-part formulas ai(t)=ui−w(1−2t)+2tη i and bi(t)=ui+w(1−2t)−2tη i for 0≤t≤12, and ai(t)=ui+w(2t−1)+2(1−t)η i and bi(t)=ui−w(2t−1)−2(1−t)η i for 12≤t≤1, and let x(i)(t):=(x1(t),…,xn(t)) be the tuple with xi(t):=ai(t), xi+1(t):=bi(t) and xj(t):=qj′ for j∉{i,i+1}. The two parts of each formula agree at t=12, so ai and bi are continuous by [L10], and ai(0)=qi′, ai(1)=qi+1′, bi(0)=qi+1′, bi(1)=qi′.

step 1.3F1L10
3.1

Exactness at Bnconf. Steps 2.2 and 1.2 together give im⁡p∗=ker⁡π.

step 2.2step 1.2
3.2

The tuples x(i)(t) are collision-free. With the notation of step 2.3, one has Im⁡ai(t)=2tη≥0 for 0≤t≤12 and Im⁡ai(t)=2(1−t)η≥0 for 12≤t≤1, while Im⁡bi(t)=−2tη≤0 and Im⁡bi(t)=−2(1−t)η≤0 on the same intervals; equality holds only at t=0 and t=1, where ai(0)=qi′≠qi+1′=bi(0) and ai(1)=qi+1′≠qi′=bi(1) by step 1.3. Hence ai(t)≠bi(t) for every t. For j∉{i,i+1} one has ∣Re⁡ai(t)−ui∣≤w and Re⁡qj′−ui real with ∣Re⁡qj′−ui∣=∣qj′−ui∣≥3w by step 1.3, so ai(t)≠qj′, and the same argument gives bi(t)≠qj′; finally ∣ai(t)∣≤∣ui∣+w+η≤n−22n+12n+14n<1 and likewise for bi, while ∣qj′∣<1, so every coordinate lies in int⁡D2. Thus x(i)(t)∈Fn(int⁡D2) for every t.

step 1.3step 2.3L10algebra
4.1

A loop at [q] with monodromy si. Assume n≥2 and fix i. By step 3.2 the formula βi:=p∘x(i) defines a continuous loop in Cn(D2) at [q′], because x(i)(0)=q′ and x(i)(1)=si⋅q′ is the tuple q′ with its i-th and (i+1)-st entries exchanged by [L9], whence p(x(i)(1))=[si⋅q′]=[q′] by [L5]. By [L3] Fn(D2) is path-connected, so there is a path γ:I→Fn(D2) with γ(0)=q and γ(1)=q′; define αi:I→Cn(D2) by αi(t):=(p∘γ)(3t) for 0≤t≤13, αi(t):=βi(3t−1) for 13≤t≤23 and αi(t):=(p∘γ)(3−3t) for 23≤t≤1. Then αi is a loop at [q], and the path α~i given by α~i(t):=γ(3t), α~i(t):=x(i)(3t−1), α~i(t):=si⋅γ(3−3t) on the same three intervals is a lift of αi starting at q: it is continuous, takes values in Fn(D2) by [L5], and p(α~i(t))=αi(t) on each piece, since p(si⋅y)=p(y). By [L4] it is the lift of αi starting at q, so its endpoint is α~i(1)=si⋅γ(0)=si⋅q, and therefore π([αi])=si by [F2].

step 1.3step 3.2F2L3L4L5L9
5.1

The endpoint monodromy is surjective. Let n≥2 and let T:={s1,…,sn−1}⊆Sn. Step 4.1 exhibits for each sj∈T a class in Bnconf with π-image sj, so T⊆im⁡π, and im⁡π is a subgroup of Sn by [L7]; since ⟨T⟩ is the smallest subgroup containing T by [L8], it follows that Sn=⟨T⟩⊆im⁡π, so im⁡π=Sn and π is surjective by [L7]. For n=0,1 the group Sn is trivial by [L8], so π is surjective there as well, its image being a subgroup of a one-element group. Hence π is surjective for every n≥0.

step 4.1L7L8
6.1

Conclusion. Step 1.1 shows that p∗ is an injective homomorphism PBn→Bnconf, step 2.1 that the left arrow from the one-element group is injective with image ker⁡p∗, step 3.1 that im⁡p∗=ker⁡π, and step 5.1 that π is surjective. By the definition of a short exact sequence in [L7], the displayed sequence is short exact for every n≥0, including the one-point cases n=0, where F0(D2) and C0(D2) are one-point spaces so that PB0 and B0conf are one-element groups by [F1] and [L11].

step 1.1step 2.1step 3.1step 5.1F1L7L11∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

108 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