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.

Tracing and slicing are inverse on relative classes

Statement

Fix n∈N and the geometric base tuple Q. Tracing based interior configuration loops and slicing geometric braids induce mutually inverse bijections between based path-homotopy classes in Cn(int⁡D2) at [Q] and geometric braid-isotopy classes of braids based at Q.

Facts & Assumptions

Given: n∈N, the fixed tuple Q, an interior based configuration loop α at [Q], and a geometric braid β=(z1,…,zn) based at Q.

[L1]

Every interior based configuration loop at [Q] has a unique ordered lift starting at Q; its coordinate graphs form a geometric braid whose unordered slice at every height is the original loop (An interior configuration loop traces a geometric braid).

[L2]

If two based interior configuration loops are path-homotopic relative to their endpoints, their traced braids are braid-isotopic relative to the top and bottom endpoints (A based configuration-loop homotopy traces a braid isotopy).

[L3]

The slice of a geometric braid β=(z1,…,zn) is S(β)(t)=[(z1(t),…,zn(t))] (A geometric braid slices to an interior configuration loop).

[L4]

In a braid isotopy, every coordinate map Zj(s,t) is jointly continuous in the isotopy parameter s and height t (Braid isotopy relative to the top and bottom endpoints).

[L5]

A based loop class is taken modulo path homotopy relative to the endpoints (Based loops and the fundamental group).

[L6]

A path homotopy is a jointly continuous map on the product square that fixes both endpoints throughout; its first coordinate is the path parameter and its second is the homotopy parameter (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints).

[L8]

The ordered configuration space Fn(X) is the subspace of Xn consisting of tuples with pairwise distinct coordinates (Ordered configuration spaces Fn(X)).

[L9]

The unordered configuration space consists of the coordinate-permutation orbits of ordered configurations (Unordered configuration spaces Cn(X)).

[L10]

The fixed identification (x,y)↦x+iy sends the real open disk D∘ to int⁡D2 (Based motions of an unordered point configuration).

[L11]

A geometric braid is a tuple of continuous motions in D∘ that are pairwise distinct at every height, start at Q, and have terminal point set Q (Geometric braids in the disc with setwise endpoints).

[L12]

Every s-slice of a braid isotopy is a geometric braid based at Q, with bottom tuple Q and top endpoint set Q (Braid isotopy relative to the top and bottom endpoints).

[L13]

The boundary slices of a braid isotopy are its two endpoint braids (Braid isotopy relative to the top and bottom endpoints).

[L14]

For n=0, F0(X) and C0(X) are one-point spaces; for n=1, F1(X) and C1(X) are canonically homeomorphic to X (Ordered configuration spaces Fn(X), Unordered configuration spaces Cn(X)).

[L15]

The canonical projection pn:Fn(X)→Cn(X) is continuous (Unordered configuration spaces Cn(X)).

The trace uses the unique lift from the specified Q; the slice uses the given labelled coordinate tuple. No arbitrary ordering or choice is used.

Proof

technique · direct
1.1L1L2L5L6

Trace is well-defined on path classes. Define T([α]) to be the braid-isotopy class of the braid traced by the unique lift of α from Q, which exists by [L1]. If α and α′ represent the same based path-homotopy class by [L5, L6], then [L2] makes their traced braids braid-isotopic. Thus T is independent of the representative.

1.2L3L4L6L7L8L9L10L11L12L13L15

Slice is well-defined on braid-isotopy classes. Suppose Z is a braid isotopy from β to β′. Apply the real-complex identification [L10] to its coordinates. By joint continuity in [L4] and the product criterion [L7], the tuple map z:Is×It→(int⁡D2)n,z(s,t)=(Z1(s,t),…,Zn(s,t)) is continuous. Each slice is collision-free by [L11, L12], so its image lies in Fn(int⁡D2); the subspace topology [L8] makes the restricted map continuous. Composing with the continuous orbit projection [L15] gives H(s,t):=pn(z(s,t))∈Cn(int⁡D2). The fixed bottom tuple gives H(s,0)=[Q] for every s, and the setwise top condition gives H(s,1)=[Q] for every s, by [L12] and the orbit description [L9]. At s=0 and s=1, H is respectively the slice of β and of β′ by [L3, L13]. The switch (t,u)↦(u,t) is continuous by the product-topology criterion [L7], so K(t,u):=H(u,t) is jointly continuous and is a path homotopy relative to its endpoints by [L6]. Therefore the slice classes agree, and slicing descends to braid-isotopy classes.

1.3L1

Slice after trace is the original loop. For any [α], the trace lemma says that the unordered slice of the traced braid equals α(t) at every t [L1]. Thus S(T([α]))=[α] in the based path-homotopy class set.

1.4L1L3L7L8L10L11

Trace after slice is the original braid. By [L11], the ordered coordinate path t↦(z1(t),…,zn(t)) is a continuous path in Fn(int⁡D2) starting at Q, using [L7, L8, L10]. Its projection is S(β) by [L3]. It is therefore an ordered lift of S(β) from Q; uniqueness in [L1] makes the traced braid exactly β, so T(S([β]))=[β] as a braid-isotopy class.

2.1step 1.1step 1.2step 1.3step 1.4L14∎

The two well-defined assignments satisfy both inverse identities by steps 1.3 and 1.4. Consequently tracing and slicing induce mutually inverse bijections on the stated classes. For n=0 both configuration spaces and class sets are singletons; for n=1 the configuration spaces identify with the disk and there are no collision conditions, so the same constructions apply [L14].

Depends on

Used by

Dependency tree · two levels

41 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