Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Point-motion boundary map is a homomorphism

Statement

Assume the Axiom of Choice. Let D2⊆R2 be the closed unit disc, let Qn=(q1,…,qn) be the base configuration of Boundary-fixed mapping class group of a punctured disk, put

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

and let δ:π1(B,[Qn])→Mod⁡(D2,Qn;∂D2) be the boundary map of Boundary map from point motions. Then:

  1. δ is well defined: δ([α]) depends neither on the representative loop α in its path-homotopy class nor on the evaluation lift chosen in the definition;
  2. δ([α][β])=δ([α]) δ([β]) for all [α],[β]∈π1(B,[Qn]), where the product on the left is the first-loop-then-second product of Based loops and the fundamental group and the product on the right is the product of the mapping class group of Boundary-fixed mapping class group of a punctured disk;
  3. consequently δ is a group homomorphism and agrees with the connecting map of the published fibration exact sequence in the library's inverse-endpoint convention.

The assertion includes n=0, where B is a one-point space and δ is the map of trivial groups, and n=1, where no collision condition is imposed.

Facts & Assumptions

Given: The Axiom of Choice, the evaluation map ev⁡:Homeo⁡+(D2,∂D2)→B of Evaluation is a numerable bundle and Hurewicz fibration with fibre F over [Qn], a based loop α:I→B at [Qn], and lifts of based loops by ev⁡ starting at id⁡.

[L1]

ev⁡ is a Hurewicz fibration whose fibre over the basepoint [Qn] is exactly F (Evaluation is a numerable bundle and Hurewicz fibration).

[L2]

δ([α])=[α~(1)−1] for any lift α~:I→Homeo⁡+(D2,∂D2) of α with α~(0)=id⁡, and π0(F)=Mod⁡(D2,Qn;∂D2) is its target (Boundary map from point motions).

[L3]

Homeo⁡+(D2,∂D2) and its subgroup F are topological groups in the compact-open topology, which on D2 is uniform convergence; composition and inversion are continuous, and Mod⁡(D2,Qn;∂D2)=π0(F) is a group with product [f][g]=[f∘g], identity [id⁡] and inverse [f]−1=[f−1] (Boundary-fixed mapping class group of a punctured disk, On a nonempty compact metric domain, the compact-open topology is the uniform topology).

[L4]

For the Hurewicz fibration ev⁡, a homotopy H:I×I→B lifts to I×I→Homeo⁡+(D2,∂D2) with prescribed compatible values on I×{0}∪{0}×I, since (I,{0}) is a finite CW pair; in particular every path in B lifts from every prescribed initial point (A fibration has path lifting and homotopy lifting relative to a subspace).

[L5]

The product of loop classes is first loop then second: [α][β]=[α∗β] with (α∗β)(t)=α(2t) for t≤12 and (α∗β)(t)=β(2t−1) for t≥12; the reversed loop αˉ(t)=α(1−t) represents the inverse class, and π1(B,[Qn]) is a group with this product (Based loops and the fundamental group, Loop classes form the group π1(X,x0) under concatenation).

[L6]

The connecting map of the fibration exact sequence is ∂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 (Long exact sequence of homotopy groups of a fibration).

[L7]

A group homomorphism is a map of groups with f(xy)=f(x)f(y) for all x,y (Monoid homomorphism and group homomorphism).

[L8]

The group E=Homeo⁡+(D2,∂D2) is contractible; its Alexander deformation joins every element to the identity (Alexander contraction of the boundary-fixed disk homeomorphism group).

Proof

technique · direct
1.1L1L2L3

Independence of the evaluation lift. Let α~,α~′ be lifts of the same based loop α with α~(0)=α~′(0)=id⁡, and put gt:=α~(t)−1∘α~′(t)∈Homeo⁡+(D2,∂D2); this is a continuous path by [L3] with g0=id⁡. For each t, the tuples x:=α~(t)(Qn) and y:=α~′(t)(Qn) satisfy [x]=[y]=α(t), so y=σ⋅x for a permutation σ∈Sn; applying the homeomorphism α~(t)−1 coordinatewise gives α~(t)−1(y)=σ⋅Qn, because α~(t)−1(α~(t)(Qn))=Qn. Hence ev⁡(gt)=[σ⋅Qn]=[Qn] for every t, so t↦gt is a path in the fibre F from id⁡ to g1=α~(1)−1∘α~′(1). Therefore [g1]=[id⁡] in π0(F), that is [α~(1)−1] [α~′(1)]=[id⁡] by the product rule of [L3]; multiplying by the inverse of [α~′(1)]=[α~′(1)−1]−1 gives [α~(1)−1]=[α~′(1)−1], and by [L2] the value δ([α]) does not depend on the chosen lift.

2.1L1L2L3L4step 1.1

Independence of the representative. Let H:I×I→B be a path homotopy relative to {0,1} from α to a second based loop α′ at [Qn], so H(0,t)=α(t), H(1,t)=α′(t) and H(s,0)=H(s,1)=[Qn]. Let α~ be a lift of α with α~(0)=id⁡, prescribe the constant lift id⁡ on the bottom edge I×{0} and α~ on the left edge {0}×I of the square: the two prescriptions agree at the corner (0,0) because α~(0)=id⁡. By the relative lifting clause of [L4] there is H~:I×I→Homeo⁡+(D2,∂D2) with ev⁡∘H~=H agreeing with these values; in particular the right edge s↦H~(1,s) is a lift of α′ starting at H~(1,0)=id⁡, and the top edge s↦H~(s,1) has image under ev⁡ constantly equal to H(s,1)=[Qn], hence lies in F and joins H~(0,1)=α~(1) to H~(1,1). Thus [α~(1)]=[H~(1,1)] in π0(F), and applying the continuous inversion of [L3] gives [α~(1)−1]=[H~(1,1)−1]; by [L2] and step 1.1, δ([α])=δ([α′]).

2.2L1L2L3L4L5step 1.1

Multiplicativity. Let α,β be based loops at [Qn] with lifts a,b:I→Homeo⁡+(D2,∂D2) from id⁡, and write a1:=a(1), b1:=b(1), both in F by [L1]. Define c:I→Homeo⁡+(D2,∂D2) by c(t):=a(2t) for t≤12 and c(t):=b(2t−1)∘a1 for t≥12. The two formulas agree at t=12 because a(1)=a1=b(0)∘a1, so c is continuous by [L3]; also c(0)=a(0)=id⁡. For t≤12 one has ev⁡(c(t))=α(2t), and for t≥12 one has ev⁡(c(t))=[b(2t−1)(a1(Qn))]=[b(2t−1)(Qn)]=β(2t−1), where the middle equality uses a1∈F, so a1(Qn)=Qn as sets; hence ev⁡∘c=α∗β. Therefore c is a lift of α∗β from id⁡ with terminal value c(1)=b1∘a1, and [L2] together with the identity (b1a1)−1=a1−1b1−1 in the group F gives δ([α][β])=δ([α∗β])=[(b1a1)−1]=[a1−1b1−1]=[a1−1] [b1−1]=δ([α]) δ([β]), the third equality being the product rule for π0(F) from [L3] and the first the product convention [L5].

3.1L2L3L5L6L7L8step 1.1step 2.1step 2.2∎

Conclusion, and agreement with the exact sequence. Steps 1.1 and 2.1 show that δ is well defined on π1(B,[Qn]), and step 2.2 shows that it preserves products; by [L7] it is a group homomorphism. For a lift g of γ from the identity, write a=g(1)∈F. The path k(t):=g(1−t)∘a−1 starts at the identity, ends at a−1, and evaluates to γ(1−t) because a−1(Qn)=Qn setwise. Hence the endpoint-component action of [L6] on the inverse loop class gives ∂p[γ]=[id⁡]⋅[γ]−1=[a−1]=δ([γ]) by [L2]. When n=0, B is a singleton and the constant path at the identity is one lift of its unique loop. Step 1.1 shows that every other lift gives the same identity component; indeed it is already a path in F=E. By [L8], π0(F) is trivial as well; when n=1 there is no collision condition and the displayed square and concatenation arguments apply verbatim.

Remarks

  • The lift-independence argument of step 1.1 never uses the lifting property: two lifts of one based loop differ by the continuous F-valued path t↦α~(t)−1∘α~′(t), which is the standard translation argument for the components of a fibre. The relative lifting property of [L4] is used only to compare two representatives, exactly as the fibration connecting map is well defined on the base.
  • The inverse in the definition of δ is what makes step 2.2 conclude δ(αβ)=δ(α)δ(β) rather than the reversed product: the endpoint of a lift of the concatenated loop is b1a1, so the raw endpoint assignment would be an anti-homomorphism.

Depends on

Used by

Dependency tree · two levels

45 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