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.
Boundary map from point motions
Definition
Assume the Axiom of Choice. Let be the closed unit disc, let be the fixed base configuration of Boundary-fixed mapping class group of a punctured disk, and let
with the compact-open topology on both homeomorphism groups and the quotient topology on the unordered configuration space. By Evaluation is a numerable bundle and Hurewicz fibration the evaluation map
is a Hurewicz fibration whose fibre over the basepoint is exactly ; by A fibration has path lifting and homotopy lifting relative to a subspace every path in with a prescribed initial point has a lift in , and the fibre components of are the elements of
by Boundary-fixed mapping class group of a punctured disk. Recall from Based loops and the fundamental group that a based loop is a continuous with , that denotes its path-homotopy class, and that the fundamental-group product is first loop then second.
The boundary map. Let be a based loop at . Choose a lift with and , and define the class
The element is the time-one homeomorphism of the lifted
point motion: its inverse is what makes the assignment compatible with the
library's first-loop-then-second product. The independence of the choice of the
lift, the independence of the representative loop, and the multiplicativity of
the resulting map are not assumed here; they are proved in the lemma
lem-the-point-motion-boundary-map-is-a-well-defined-homomorphism, which
follows this definition and whose statement is the precise well-definedness
claim for .
Why the inverse endpoint. The published exact sequence of a fibration Long exact sequence of homotopy groups of a fibration defines its boundary by
where is the endpoint component of a lift of starting at and products of loops are traversed left-to-right. For the evaluation fibration this is precisely , so is the connecting map of the fibration in the library's convention, and the inverse is not a convention that may be dropped: the raw endpoint assignment reverses the order of the first-then-second product, whereas preserves it.
Elementary cases. For the base is a single point, the only based loop is constant, and the formula gives the identity class of ; for the same construction applies without a collision condition. Nothing in the definition selects among lifts, representatives or enumerations of a configuration: the lift is exhibited in the following lemma, and the class computed by is proved there to be independent of these choices.
Remarks
- The definition uses the total space of all boundary-fixing homeomorphisms of the closed disc, not only the homeomorphisms supported away from near a fixed collar; the boundary circle is fixed pointwise, so every lift is an ambient isotopy rel .
- The target is the setwise mapping class group : the formula produces the class of the inverse of the evaluated endpoint, and that class lies in the pure subgroup exactly when the lift's endpoint permutes the marked points trivially. Purity is a property of the particular endpoint, not of the definition of .
Depends on
Used by
- Setwise boundary preservation kills a nontrivial braid Counterexample
- Point pushing the last puncture Definition
- Point pushing one puncture around another Example
- Standard Aᵢⱼ as point pushes after relabeling Example
- Point-motion boundary map is a homomorphism Lemma
- The Aᵢₙ are meridian generators of the forgetful free kernel Lemma
- Braid group as boundary-fixed punctured-disk mapping classes Theorem
- Evaluation boundary isomorphism for the disk Theorem
- Point pushing is the kernel of forgetting the last disk puncture Theorem
Dependency tree · two levels
30 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
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 1.3 and the proof of Theorem 1, author manuscript pp. 5-7 (standard reference, not scraped)
- Brayton Gray, Homotopy Theory: An Introduction to Algebraic Topology, Chapter 8 on fibre spaces and exact sequences (standard reference, not scraped)