Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-10-02
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 D2⊆R2 be the closed unit disc, let Qn=(q1,…,qn) be the fixed base configuration of Boundary-fixed mapping class group of a punctured disk, and let

E:=Homeo⁡+(D2,∂D2),B:=Cn(int⁡D2),F:=Homeo⁡+(D2,∂D2;Qn),

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

ev⁡:E⟶B,ev⁡(h):=[h(q1),…,h(qn)],

is a Hurewicz fibration whose fibre over the basepoint [Qn] is exactly F; by A fibration has path lifting and homotopy lifting relative to a subspace every path in B with a prescribed initial point has a lift in E, and the fibre components of F are the elements of

π0(F)=Mod⁡(D2,Qn;∂D2),

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 α:I→B with α(0)=α(1)=[Qn], that [α] denotes its path-homotopy class, and that the fundamental-group product is first loop then second.

The boundary map. Let α:I→B be a based loop at [Qn]. Choose a lift α~:I→E with α~(0)=id⁡ and ev⁡∘α~=α, and define the class

δ([α]):=[α~(1)−1]∈π0(F)=Mod⁡(D2,Qn;∂D2).

The element α~(1) 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

∂p[γ]=[e0]⋅[γ]−1,

where [e0]⋅[γ] is the endpoint component of a lift of γ starting at e0 and products of loops are traversed left-to-right. For the evaluation fibration this is precisely [α~(1)−1], 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 [α]↦[α~(1)] reverses the order of the first-then-second product, whereas δ preserves it.

Elementary cases. For n=0 the base B is a single point, the only based loop is constant, and the formula gives the identity class of Mod⁡(D2,Q0;∂D2); for n=1 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 ∂D2 near a fixed collar; the boundary circle is fixed pointwise, so every lift is an ambient isotopy rel ∂D2.
  • The target is the setwise mapping class group Mod⁡(D2,Qn;∂D2): the formula produces the class of the inverse of the evaluated endpoint, and that class lies in the pure subgroup PMod⁡(D2,Qn;∂D2) 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

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