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

The geometric endpoint permutation matches covering monodromy

Statement

Fix n∈N and the explicit geometric base tuple Q of Geometric braids in the disc with setwise endpoints. Use the same basepoint [Q] in Bnconf=π1(Cn(D2),[Q]) and in the endpoint monodromy map πconf:Bnconf→Sn. Let ιC:Cn(int⁡D2)↪Cn(D2) be the open-to-closed inclusion, and let ι∗C be its induced map on fundamental groups at [Q]. For every geometric braid class [β]∈Gn, with slice loop S(β) and the inverse-loop isomorphism Φ([β])=(ι∗C[S(β)])−1 of Geometric braid classes and the unordered configuration fundamental group, we have πconf(ι∗C[S(β)])=πgeo([β])−1,πconf(Φ([β]))=πgeo([β]). Thus raw slicing has inverse endpoint monodromy after its class is carried to the closed-disc configuration group, and the inverse-loop map has exactly the geometric endpoint permutation. The formulas hold for every n≥0.

Facts & Assumptions

Given: n, the explicit tuple Q, a geometric braid class [β] based at Q, its point motions and endpoint permutation, the slice loop, and the fixed-basepoint isomorphism Φ.

[L1]

The geometric braid classes based at Q form Gn, and the endpoint map πgeo:Gn→Sn is a well-defined homomorphism; on a braid representative, zj(1)=qπgeo(β)(j) (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]

A based loop at [Q] has a unique lift to Fn(D2) starting at Q (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L4]

The open-to-closed inclusions induce maps ι∗F and ι∗C at the same basepoints, and the quotient square commutes: ιC∘pint⁡D2=pD2∘ιF (The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[L5]

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

[L6]

The fundamental group is a group under the first-loop-then-second product, with identity and two-sided inverses (Based loops and the fundamental group, Loop classes form the group π1(X,x0) under concatenation).

[L7]

Each coordinate motion is continuous, remains in the open disc, and is pairwise distinct from the others. The coordinate tuple therefore defines a continuous path into Fn(int⁡D2); continuity into the product follows because the product topology is generated by projection preimages, and distinctness puts the tuple in the ordered-configuration subspace (Geometric braids in the disc with setwise endpoints, Based motions of an unordered point configuration, 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)).

[L9]

At the fixed basepoint Q, Φ([β])=(ι∗C[S(β)])−1 is the isomorphism from Gn to Bnconf (Geometric braid classes and the unordered configuration fundamental group).

[L10]

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

[L11]

If the terminal tuple of a lifted loop is recorded by α~(1)i=qe(i), then its endpoint record satisfies e=σ−1 (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L12]

For n=1 every geometric braid has identity endpoint permutation, and S1 is trivial (Geometric braids in the disc with setwise endpoints, Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

[L13]

If the unique lift of a based loop at [Q] from Q ends at σ⋅Q, then its endpoint monodromy is πconf([α])=σ (Endpoint monodromy of an unordered configuration loop as a permutation of the labels).

The tuple Q and every coordinate path are specified. The ordered lift used below is the unique lift from Q, so the Axiom of Choice is not used.

Proof

technique · direct
1.1L1L2L3L4L5L7L11L13

Lift the raw slice and read its endpoint labels. Use the fixed real-to-complex coordinate identification of [L7] and put zβ(t)=(z1(t),…,zn(t))∈Fn(int⁡D2); [L7] proves this is a path. By [L2], pint⁡D2∘zβ=S(β). The quotient square [L4] gives pD2∘ιF∘zβ=ιC∘pint⁡D2∘zβ=ιC∘S(β). Thus ιF∘zβ is the lift from Q of the closed-disc loop ιC∘S(β), and by [L3] it is the unique such lift. By [L13] its endpoint permutation is σ=πconf([ιC∘S(β)]). Its terminal coordinate j is qπgeo([β])(j) by [L1], so its label record is e=πgeo([β]). By [L11], e=σ−1. The induced-map formula [L5] therefore yields πconf(ι∗C[S(β)])=πgeo([β])−1.

2.1L6L9L10step 1.1

Apply the inverse-loop isomorphism. Let x:=ι∗C[S(β)]. By [L9], Φ([β])=x−1. Since πconf is a homomorphism by [L10], and Bnconf is a group by [L6], πconf(x) πconf(x−1)=πconf(xx−1)=1, so πconf(x−1)=πconf(x)−1. Applying step 1.1 gives πconf(Φ([β]))=(πgeo([β])−1)−1=πgeo([β]).

3.1L8L9L12∎

Zero- and one-strand cases. When n=0, [L8] gives the unique empty braid and the trivial permutation target; the isomorphism [L9] then makes the configuration braid group a singleton, so both equations hold. When n=1, [L12] gives identity endpoint permutation and trivial S1, so both monodromy values are the identity.

Depends on

Used by

Dependency tree · two levels

64 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