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

The basic arcs detect the identity braid

Statement

Assume AC for the supplied well-definedness and isotopy invariance of geometric intersection numbers, including the normal-form contribution table, and to move between the boundary-fixed mapping class f and its braid class (the Artin-to-smooth dictionary of Basic arcs, admissible curves and the standard normal form, including presentation completeness; the topological comparison is Braid group as boundary-fixed punctured-disk mapping classes). Let b0,…,bm be a basic set of curves in (D,Δ) and let f∈G be a boundary-fixed mapping class. If I(bj,f(bk))=I(bj,f2(bk))=I(bj,bk)for all 0≤j,k≤m, then [f]=1 in G. Both iterates are required: the hypothesis on f alone only forces f to act on the basic arcs as a product of the standard twists, and the second iterate together with the freeness of the twist subgroup is what kills the exponents.

Facts & Assumptions

Given: The standard picture with basic arcs b0,…,bm, nested curves l0,…,lm−1 and twists τj, and a boundary-fixed mapping class f whose intersection table with the basic arcs is the identity table for both f and f2.

[L1]

The action of G on isotopy classes of admissible curves preserves the ordinary intersection number I; the hypotheses of the statement are invariant under replacing the basic set by a G-translate, and the conclusion [f]=1 is conjugation invariant, so it suffices to prove the statement in the standard picture (Basic arcs, admissible curves and the standard normal form, Geometric intersection numbers are isotopy invariants).

[L2]

If g∈G satisfies g(bk)≃bk for all k, then [g]=1: the source's Lemma 3.4 isotopes g to a representative fixing the spine b0∪⋯∪bm pointwise and applies the disk mapping-class theorem, and the endpoint bookkeeping uses that the bk meet only consecutively (Basic arcs, admissible curves and the standard normal form).

[L3]

If c is an admissible curve with I(bj,c)=I(bj,bk) for all j, then, in the standard picture, c≃b0 or τ0−1(b0) when k=0, c≃bk or τk±1(bk) when 1≤k<m, and c≃bm when k=m; the proof is the source's Lemma 3.5, a finite read-off from the intersection tables of the normal form (String types and their contributions to geometric intersection numbers).

[L4]

The twists τj commute, τj fixes bk up to isotopy for k≠j, and the subgroup generated by their classes is free abelian of rank m (The standard twists commute and fix the complementary basic arcs, The standard nested twists generate a free abelian subgroup).

Proof

technique · direct
1.1L1L2

A preliminary identification. Suppose g∈G satisfies g(bk)≃bk for all k. Then [g]=1 by [L2], and in particular g(bk) is isotopic to bk for every k and the intersection table of g with the basic set is the identity table.

1.2L3

The intersection table determines the action on the basic curves. Let c be admissible and suppose I(bj,c)=I(bj,bk) for all j. For k<m, [L3] gives c≃τkν(bk) for an integer ν∈{−1,0,1}, with ν≤0 when k=0; for k=m, it gives c≃bm directly. Consequently, applying this to c=f(bk) for each k separately, there are integers ν0∈{−1,0} and ν1,…,νm−1∈{−1,0,1} with f(bk)≃τkνk(bk)(0≤k≤m−1),f(bm)≃bm.

2.1step 1.1step 1.2L4

An explicit model for f. Let g:=τ0ν0τ1ν1⋯τm−1νm−1∈G. Since the twists commute and τj fixes the complementary basic arcs by [L4], one has g(bk)≃τkνk(bk) for k≤m−1 and g(bm)≃bm; comparing with step 1.2, f(bk)≃g(bk) for every k. Applying step 1.1 to g−1f, which fixes each bk up to isotopy, gives [f]=[g].

3.1step 2.1L4

The same for the square, and comparison of exponents. Applying the same argument to f2, whose intersection table with the basic set is also the identity table by hypothesis, produces integers μ0∈{−1,0} and μ1,…,μm−1∈{−1,0,1} with f2≃τ0μ0⋯τm−1μm−1. Since [f]=[g], one has [f2]=[g]2=∏jτj2νj, and therefore ∏j=0m−1τj2νj−μj≃1.

4.1step 3.1L4

Freeness kills the exponents. By the freeness of the twist subgroup [L4], the relation ∏jτj2νj−μj≃1 forces 2νj=μj for every j. Since each μj lies in {−1,0,1} and each 2νj is even, the only possibility is νj=μj=0 for all j; hence [f]=[g]=1, as required.

5.1L1L3step 4.1∎

Conclusion. The identity intersection table for f and f2 forces [f]=1. AC is inherited through the braid/mapping-class dictionary and the supplied well-definedness and isotopy invariance of geometric intersection numbers used in [L1] and [L3]; the local counts and exponent bookkeeping are finite.

Depends on

Used by

Dependency tree · two levels

27 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