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.
Smooth representatives of configuration loops
Statement
Let be the fixed base configuration of Boundary-fixed mapping class group of a punctured disk. Every based loop at the basepoint is path homotopic relative to to a based loop whose unique ordered lift from consists of coordinate paths that are smooth, pairwise collision-free ( for ), take values in , and are constant on and on for some . The construction uses no choice principle.
Facts & Assumptions
Given: The based loop with .
For every and there is a polynomial with (Polynomials are uniformly dense in ).
The standard smooth step function is smooth, equals for and equals for (The standard smooth step function).
The quotient is a covering map with -element fibres, and both spaces are path-connected (Ordered configuration spaces cover the unordered ones regularly with deck group ).
A covering map has a unique path lift through any prescribed starting point: if and , then is unique (Existence and uniqueness of path lifts through a covering map).
consists of the tuples with pairwise distinct coordinates and with quotient map (Ordered configuration spaces , Unordered configuration spaces ).
Proof
If , the unique based loop represents itself and has the unique empty ordered lift; the claim is immediate. Assume below.
The ordered lift and its margin. Let be the quotient covering map of [L3]. By [L4] there is a unique path with and ; its coordinates are continuous and satisfy for and . Compactness and finiteness give a positive boundary margin ; if , also put , and if put . Then bounds every pairwise separation and every boundary margin from below (with the pairwise condition vacuous for ).
Smooth approximation with fixed endpoints and flat time ends. Write . For each of the finitely many functions apply [L1] with to obtain a polynomial with , and put , so that , and . Now choose a small and use [L2] to define the smooth time change ; it is smooth, equals on , equals on , satisfies and on , and equals on . Set and . Then each is smooth, is constant on and on , and because the finitely many are uniformly continuous there is a modulus of continuity for all of them on with . Choosing and so small that , we obtain for every and .
The approximating tuple is collision-free, interior, and based. For and all the estimates of step 1.2 give and , so all lie in and are pairwise distinct. Moreover and , so : the terminal tuple is a permutation of , and is an ordered path from to that permutation, while is a based loop at .
A relative homotopy to the smooth representative. For put , computed coordinatewise in . The map is continuous, and by the estimates of steps 1.2 and 2.1 every again has pairwise distinct coordinates at distance at least and lies in : the interpolation moves each point by at most from . Hence lands in , and its composition with the quotient map of [L3] is a continuous map , , with and ; the identities and , together with , show that for every , so that is a path homotopy relative to .
The lift of the representative is itself. The path is a based loop at by step 2.1, and is a lift of it with ; by the uniqueness clause [L4] the unique ordered lift of from is exactly . Together with steps 1.2, 2.1 and 3.1 this exhibits the required smooth collision-free lift with flat time ends and the path homotopy rel ; all constructions used only the given loop, fixed polynomials and the fixed step function, so no choice principle is spent.
Remarks
- The time change is built from the published smooth step so that the approximating path is stationary near both ends of the interval; this is what later allows the motion to be extended across the endpoints by constancy.
- The estimate is uniform in and uses only finitely many continuous functions on the compact interval, so no selection from infinitely many approximations is made.
Depends on
- Unordered configuration spaces $C_n(X)$
- Ordered configuration spaces $F_n(X)$
- Ordered configuration spaces cover the unordered ones regularly with deck group $S_n$
- Existence and uniqueness of path lifts through a covering map
- Polynomials are uniformly dense in $C([0,1],\mathbb R)$
- The standard smooth step function
- Boundary-fixed mapping class group of a punctured disk
Used by
Dependency tree · two levels
49 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, sections 1.1-1.3, printed pp. 3-5 (standard reference, not scraped)