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

An interior configuration loop traces a geometric braid

Statement

For every interior based motion α:I→Cn(int⁡D2) at [Q], the quotient covering p∘:Fn(int⁡D2)⟶Cn(int⁡D2) has a unique lift α~ starting at Q. Writing α~(t)=(z1(t),…,zn(t)), the coordinate graphs form a geometric braid based at Q, and its unordered slice at every height is exactly α(t).

Facts & Assumptions

Given: A natural number n, the geometric base tuple Q, and an interior based motion α at [Q].

[L1]

Fn(X) is the subspace of Xn consisting of tuples with pairwise distinct coordinates, and F0(X) is the one-point space (Ordered configuration spaces Fn(X)).

[L2]

Cn(X) is the orbit quotient of Fn(X) by coordinate permutations; its quotient map p is continuous and surjective, and its fibres are exactly the coordinate-permutation orbits (Unordered configuration spaces Cn(X)).

[L4]

If X is Hausdorff, then every point of Cn(X) has an evenly covered neighbourhood under p:Fn(X)→Cn(X); for n=0, p is the unique homeomorphism of one-point spaces (Disjoint coordinate neighbourhoods evenly cover the unordered configuration space).

[L5]

For a covering p:E→B and path α:I→B with a specified starting lift e0, there is a unique path α~ starting at e0 and satisfying p∘α~=α (Existence and uniqueness of path lifts through a covering map).

[L6]

A geometric braid based at Q is a tuple of continuous point motions in D∘ with pairwise distinct values at every height, bottom tuple Q, and top endpoint set Q (Geometric braids in the disc with setwise endpoints).

[L7]

An interior based motion is a continuous path in Cn(int⁡D2) whose two endpoints are [Q] (Based motions of an unordered point configuration).

No choice principle is assumed or used: the lift is determined by one prescribed starting tuple and is unique.

Proof

technique · direct
1.1L2L3L4

The quotient is a covering on the open disk. By [L3], int⁡D2 is Hausdorff; applying [L4] with X=int⁡D2 gives an evenly covered neighbourhood at every unordered configuration, and continuity and surjectivity from [L2] show that p∘ is a covering. For n=0 both spaces are points, so this conclusion still holds.

1.2L1L2L5L7

Lift the motion. Since α is based at [Q] by [L7] and p∘(Q)=[Q], [L5] gives a unique continuous lift α~:I→Fn(int⁡D2) with α~(0)=Q and p∘∘α~=α; write its coordinates as z1,…,zn, taking the empty tuple when n=0.

1.3L1L2L6L7

Check the strand conditions. By [L1], the coordinate projections of α~ are continuous; because every lifted tuple lies in Fn(int⁡D2), the coordinates remain interior and pairwise distinct, and they start at Q. At the top, p∘(α~(1))=α(1)=[Q], so [L2] places the terminal tuple in the coordinate-permutation orbit of Q, giving endpoint set exactly {q1,…,qn}; these conditions are vacuous for n=0.

1.4L2L5L6

The lift is the required braid and traces the original motion. By [L6], β=(z1,…,zn) is a geometric braid based at Q: its strands are the graphs t↦(zj(t),t), so height is their parameter and distinct strands cannot meet. Its unordered slice is [(z1(t),…,zn(t))]=p∘(α~(t))=α(t) for every t, by [L5]; this also holds for the unique empty braid when n=0.

2.1step 1.2step 1.3step 1.4∎

The unique lift has all the endpoint, collision, continuity and slicing properties required in the statement, establishing the claim.

Depends on

Used by

Dependency tree · two levels

61 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