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 , , , , and . Consider the published positive elementary half twist .
The ordered configuration space consists of ordered pairs with distinct coordinates (Ordered configuration spaces ).
The unordered quotient sends an ordered tuple to its coordinate-permutation orbit; in particular and have the same image (Unordered configuration spaces ).
The quotient projection is continuous (Unordered configuration spaces ).
For , the published positive half twist has midpoint and coordinates and ; is continuous, nonzero, has endpoints and , and has norm at most (The elementary geometric half twist, its support disc, and its opposite).
The positive elementary half twist is a geometric braid based at (The elementary geometric half twist, its support disc, and its opposite).
The slice path of a geometric braid is defined by (A geometric braid slices to an interior configuration loop).
A based loop at is a path whose two endpoints both equal (Based loops and the fundamental group).
The coordinates and endpoint exchange are explicit; no choice principle is assumed or used.
Counterexample
Track the ordered pair. The midpoint of and is , so the published half-twist formula in [L4] gives the ordered path Its coordinates lie in because , and they are distinct because their difference is . Thus this is a path in , with endpoints
Since , the terminal ordered tuple is not . By [L7], is a path in the ordered configuration space but is not a based loop at .
Forget the labels. By [L2], the endpoint tuples have the same orbit: By [L3], the quotient projection is continuous, so is a continuous path in with . By [L5, L6], this is the slice path of the positive geometric half twist, so it is the unordered based loop promised by the counterexample.
The ordered coordinate path fails to close at , while its unordered image closes at . 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
- Juan Gonzalez-Meneses, Basic results on braid groups, §1.5, Figure 2, printed pp. 7–8 (standard reference, not scraped)