Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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 exchange closes only after forgetting labels

Statement refuted

A based loop in the unordered configuration space can occur only when its ordered coordinate path also returns to the same ordered tuple.

Facts & Assumptions

Given: Take n=2, h=1/12, q1=(−h,0), q2=(h,0), and Q=(q1,q2). Consider the published positive elementary half twist σ1.

[L1]

The ordered configuration space F2(D∘) consists of ordered pairs with distinct coordinates (Ordered configuration spaces Fn(X)).

[L2]

The unordered quotient sends an ordered tuple to its coordinate-permutation orbit; in particular (q2,q1) and (q1,q2) have the same image (Unordered configuration spaces Cn(X)).

[L3]

The quotient projection p2:F2(D∘)→C2(D∘) is continuous (Unordered configuration spaces Cn(X)).

[L4]

For n=2, the published positive half twist has midpoint m1=0 and coordinates (σ1)1(t)=ρ(t) and (σ1)2(t)=−ρ(t); ρ is continuous, nonzero, has endpoints (−h,0) and (h,0), and has norm at most h (The elementary geometric half twist, its support disc, and its opposite).

[L5]

The positive elementary half twist is a geometric braid based at Q (The elementary geometric half twist, its support disc, and its opposite).

[L6]

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

[L7]

A based loop at x0 is a path whose two endpoints both equal x0 (Based loops and the fundamental group).

The coordinates and endpoint exchange are explicit; no choice principle is assumed or used.

Counterexample

technique · direct
1.1L1L4

Track the ordered pair. The midpoint of q1 and q2 is 0, so the published half-twist formula in [L4] gives the ordered path σ~1(t)=(ρ(t),−ρ(t)). Its coordinates lie in D∘ because ∥ρ(t)∥≤h<1, and they are distinct because their difference is 2ρ(t)≠0. Thus this is a path in F2(D∘), with endpoints σ~1(0)=(q1,q2)=Q,σ~1(1)=(q2,q1).

2.1step 1.1L7

Since q1≠q2, the terminal ordered tuple (q2,q1) is not Q. By [L7], σ~1 is a path in the ordered configuration space but is not a based loop at Q.

2.2step 1.1L2L3L5L6L7

Forget the labels. By [L2], the endpoint tuples have the same orbit: [(q1,q2)]=[(q2,q1)]=[Q]. By [L3], the quotient projection is continuous, so α(t):=[σ~1(t)] is a continuous path in C2(D∘) with α(0)=α(1)=[Q]. By [L5, L6], this is the slice path S(σ1) of the positive geometric half twist, so it is the unordered based loop promised by the counterexample.

3.1step 2.1step 2.2∎

The ordered coordinate path fails to close at Q, while its unordered image closes at [Q]. Hence forgetting labels can close a nonlooping ordered coordinate path, refuting the claim in the statement.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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