Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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 geometric braids and ordered configuration loops

Statement

Fix n∈N and the explicit base tuple Q of Geometric braids in the disc with setwise endpoints. 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, instantiate the common ordered basepoint at q=Q. Let Gn be the geometric braid group at Q and let πgeo:Gn⟶Sn be its endpoint-permutation homomorphism. Write Gnpure:=ker⁡πgeo. Let p:Fn(D2)⟶Cn(D2) be the ordered-to-unordered quotient, with induced map p∗:PBn=π1(Fn(D2),Q)⟶Bnconf=π1(Cn(D2),[Q]), and let πconf:Bnconf→Sn be endpoint monodromy. Use the isomorphism Φ:Gn⟶Bnconf,Φ([β])=(ι∗C[S(β)])−1 from Geometric braid classes and the unordered configuration fundamental group. Then Φ(Gnpure)=ker⁡πconf=im⁡p∗, and Φ restricts to an isomorphism from Gnpure onto this kernel. The short exact sequence identifies p∗ as an isomorphism from PBn onto the same kernel, so the resulting isomorphism to the ordered configuration group is Ψ:Gnpure⟶PBn,Ψ([β])=(ι∗F[zβ])−1, where zβ(t)=(z1(t),…,zn(t)) is the coordinate path of β. For a pure braid, zβ is a loop at Q. The inverse in this formula accounts for the fact that stacking γ⋆β slices as the loop S(β) followed by S(γ), while the geometric group product is [γ][β].

This holds for every n≥0. The groups and maps use the same specified basepoint Q; no change-of-basepoint path or Artin presentation is asserted.

Facts & Assumptions

Given: n, the explicit tuple Q, a geometric braid class [β] at Q, its endpoint permutation, the ordered and unordered configuration spaces and their quotient maps, and the fixed-basepoint isomorphism Φ above.

[L1]

The geometric braid group Gn at Q is a group, its endpoint permutation πgeo:Gn→Sn is a group homomorphism, and a braid is pure exactly when its endpoint permutation is the identity (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, Geometric braids in the disc with setwise endpoints).

[L2]

The slice S(β)(t)=[(z1(t),…,zn(t))] is a continuous based loop in Cn(int⁡D2) at [Q] (A geometric braid slices to an interior configuration loop).

[L3]

For a based loop α at [Q], there is a unique lift to Fn(D2) starting at Q (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L4]

At the exact basepoint [Q], the parameterized definition gives Bnconf=π1(Cn(D2),[Q]), and raw slicing with the open-to-closed inclusion defines the isomorphism Φ([β])=(ι∗C[S(β)])−1:Gn→Bnconf (The configuration braid group Bnconf as the fundamental group of an unordered configuration space, Geometric braid classes and the unordered configuration fundamental group).

[L5]

The ordered and unordered open-to-closed inclusions induce isomorphisms ι∗F and ι∗C at Q and [Q], respectively (The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[L6]

With the parameterized base configuration set to q=Q, PBn=π1(Fn(D2),Q) and the open ordered configuration group maps to it by ι∗F (The pure braid group PBn as the fundamental group of an ordered configuration space).

[L7]

For the same Q, the quotient-induced homomorphism p∗:PBn→Bnconf is injective and im⁡p∗=ker⁡πconf (The configuration braid short exact sequence 1→PBn→Bnconf→Sn→1).

[L8]

A pointed continuous map induces the homomorphism f∗([α])=[f∘α] (The homomorphism on fundamental groups induced by a pointed continuous map).

[L9]

Loop classes use the first-loop-then-second product [α][η]=[α∗η], and the fundamental group is a group with two-sided inverses (Based loops and the fundamental group, Loop classes form the group π1(X,x0) under concatenation).

[L10]

For the stacking convention in which β is below γ, [S(γ⋆β)]=[S(β)][S(γ)] (Raw slicing reverses geometric stacking products).

[L11]

The kernel of a group homomorphism is a subgroup, with kernel and image defined by its identity preimage and its values (The kernel and image of a group homomorphism, The image of a group homomorphism is a subgroup and its kernel is a normal subgroup).

[L12]

A group homomorphism that is injective and surjective is bijective, and a bijective group homomorphism is a group isomorphism (Injection, surjection, bijection, Group isomorphisms, automorphisms and the set Aut⁡(G)).

[L14]

The inclusions and orbit quotients commute: ιC∘pint⁡D2=pD2∘ιF (The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[L15]

Endpoint monodromy πconf:Bnconf→Sn is a group homomorphism (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L16]

If eα(i) is defined by α~(1)i=qeα(i), then eα=σα−1 under the specified label identification (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L17]

The coordinate tuple zβ:I→Fn(int⁡D2) is a continuous path starting at Q: its component motions are continuous and pairwise distinct at every time, and it stays in the interior. Its map to the product is continuous because the product topology is generated by projection preimages: each such preimage under zβ is the open inverse image under a continuous component. Pairwise distinctness puts the image in the ordered-configuration subspace. For n=0 it is the constant empty tuple (Geometric braids in the disc with setwise endpoints, The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, Ordered configuration spaces Fn(X)).

[L18]

The endpoint coordinates obey zj(1)=qπgeo(β)(j) (Geometric braids in the disc with setwise endpoints).

[L20]

For a based loop α at [Q], its unique lift from Q ends at σα⋅Q for the endpoint monodromy σα (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

The tuple Q and the point motions zj are specified. The path zβ is the unique lift of its unordered slice from Q, and injectivity of p∗ makes its ordered class unique. No arbitrary ordering, lift, representative, or connecting path is selected; the Axiom of Choice is not used.

Proof

technique · direct
1.1L1L11

Fix the shared basepoint and the pure subgroup. In every parameterized configuration group take q=Q, so PBn, Bnconf, both inclusion-induced maps, and p∗ are based at Q or [Q] as appropriate ([L4, L5, L6, L7]). By [L1], πgeo is a homomorphism and its identity fiber is exactly the set of pure geometric classes. By [L11] this set Gnpure=ker⁡πgeo is a subgroup of Gn.

1.2L2L3L8L14L15L16L17L18L20

The coordinate motion computes covering monodromy. For any braid β, [L2] gives pint⁡D2∘zβ=S(β), and [L17] makes zβ a path in the ordered configuration space. By the commutative square in [L14], ιF∘zβ is a lift, starting at Q, of ιC∘S(β) to Fn(D2). It is the unique such lift by [L3]. Its terminal coordinate satisfies zj(1)=qπgeo(β)(j) by [L18], so the label record e of [L16] is πgeo(β). By [L20] the lift endpoint is σ⋅Q for endpoint monodromy σ, and [L16] gives e=σ−1. The same coordinate tuple has label record e=πgeo(β) by [L18], while [L15] identifies πconf=σ. It follows that πconf(ι∗C[S(β)])=πgeo([β])−1. The use of the closed-disc lift here is valid because the open coordinate path is also a path in Fn(D2) and the quotient square in [L14] identifies its projection with ιC∘S(β).

2.1L4L9L11L12L15step 1.2

The inverse-loop map preserves the endpoint permutation. Put a:=ι∗C[S(β)]. By [L15] and the inverse identity in the fundamental group [L9], πconf(a−1)=πconf(a)−1: indeed πconf(a)πconf(a−1)=πconf(aa−1)=1. By [L4], Φ([β])=a−1, and step 1.2 gives πconf(a)=πgeo([β])−1. Thus for every [β]∈Gn, πconf(Φ([β]))=πgeo([β]). Consequently Φ([β]) lies in ker⁡πconf if and only if [β] lies in Gnpure. Since Φ is an isomorphism by [L4], its restriction is an isomorphism Gnpure→ker⁡πconf.

3.1L7L11L12step 2.1

The short exact sequence identifies the ordered group with the kernel. By [L7], p∗:PBn→Bnconf is injective and has image ker⁡πconf. Regard its codomain as this image. Then it is surjective onto the kernel by the definition of image [L11], hence bijective by [L12]. It is a group homomorphism by [L7], so it is an isomorphism by [L12]. Composing its inverse with the restriction in step 2.1 gives an isomorphism Ψ:Gnpure→PBn.

4.1L1L2L4L5L7L8L9L14L17L18step 3.1

Compute the ordered representative. If [β] is pure, [L1] gives zβ(0)=Q=zβ(1), so [L17] makes zβ a based loop in Fn(int⁡D2) at Q. Using [L2], [L5], [L8], and [L14], p∗(ι∗F[zβ])=[p∘ιF∘zβ]=[ιC∘pint⁡D2∘zβ]=ι∗C[S(β)]. Since p∗ is a homomorphism by [L7], it carries inverses to inverses: p∗(x)p∗(x−1)=p∗(xx−1)=1 for each x by [L9]. Thus p∗((ι∗F[zβ])−1)=(ι∗C[S(β)])−1=Φ([β]). The preimage under p∗ is unique by its injectivity [L7]; hence the isomorphism in step 3.1 is exactly Ψ([β])=(ι∗F[zβ])−1. This also proves the formula is independent of the representative braid.

5.1L1L4L7L8L9L10step 3.1step 4.1

Check the product order explicitly. Let [γ],[β] be pure and put a:=ι∗C[S(γ)] and b:=ι∗C[S(β)]. By [L1, L10] and the homomorphism property in [L8], Φ([γ][β])=(ba)−1. In the group Bnconf, a−1b−1 is a two-sided inverse of ba: (ba)(a−1b−1)=b(aa−1)b−1=1 and (a−1b−1)(ba)=a−1(b−1b)a=1. Thus (ba)−1=a−1b−1=Φ([γ])Φ([β]). The composite Ψ=p∗−1∘Φ on pure classes is therefore multiplicative; this shows directly that inversion of the reversed slicing product gives the ordered configuration product in geometric stacking order.

6.1

Empty and one-strand cases. For n=0, [L13] gives the unique empty braid and trivial PB0 and S0; exactness [L7] then makes B0conf trivial, so each group, kernel, and displayed map is the unique one-element group map. For n=1, [L19] says every geometric braid is pure and PB1 and S1 are trivial, so [L7] gives B1conf=im⁡p∗=ker⁡πconf, also trivial. The isomorphism [L4] then makes G1pure trivial, and the formula in step 4.1 is the unique isomorphism. The zero-strand case is the empty case, and no additional zero-valued parameter is present. [L4, L7, L13, L19, step 2.1, step 3.1, step 4.1] □

Depends on

Used by

Dependency tree · two levels

77 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