Alphabeta Math
TheoremStatement: 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 Khovanov-Seidel weak braid action is faithful

Statement

Assume AC, inherited from the braid-to-mapping-class dictionary used in the Hom theorem and the detector, and from the supplied representative-independence and isotopy invariance of intersection numbers. For every m≥1 the weak action of Bm+1 on Cm given by the complexes Rσ (The Khovanov-Seidel complexes give a weak derived braid action) is faithful (Faithful weak action): if Rσ≅Id⁡Cm for a braid σ, then σ=1. Equivalently, no nontrivial braid acts by the identity functor, although nontrivial braids may act trivially on the Grothendieck group G(Am).

Facts & Assumptions

Given: AC, the weak braid action by the complexes Rσ on Cm, the basic arcs b0,…,bm with their normalized bigradings, and a braid σ∈Bm+1 with Rσ≅Id⁡Cm.

[L1]

For all σ,τ and all j,k,s1,s2 the Hom groups Hom⁡Cm(RτPk,RσPj[s1]{−s2}) are free with Poincaré polynomial Ibigr(f~τb~k,f~σb~j) (Homs compute bigraded arc intersections).

[L2]

If f∈G satisfies I(bj,f(bk))=I(bj,f2(bk))=I(bj,bk) for all j,k, then [f]=1 in G (The basic arcs detect the identity braid).

[L3]

Under AC, the preferred lifts give the action of Bm+1 on bigraded curves, and Ibigr(c~0,c~1)∣q1=q2=1=2I(c0,c1), so equality of the bigraded numbers specializes to equality of the ordinary intersection numbers (Local indices and bigraded intersection numbers).

[L4]

Under the isomorphism Bm+1≅G=π0Diff⁡(D,∂D;Δ) a braid σ corresponds to a boundary-fixed mapping class fσ well defined up to isotopy, and σ=1 iff [fσ]=1 (Basic arcs, admissible curves and the standard normal form, whose dictionary includes Artin-presentation completeness and the smooth comparison).

Proof

technique · direct
1.1L1

The Hom-table of Rσ is the identity table. Suppose Rσ≅Id⁡Cm. Then for all j,k and all shifts s1,s2 the induced isomorphism gives Hom⁡Cm(Pk,RσPj[s1]{−s2})≅Hom⁡Cm(Pk,Pj[s1]{−s2}). By the Hom theorem [L1] applied with τ=1 on the left and σ=1 on the right, taking Poincaré polynomials gives Ibigr(b~k,σb~j)=Ibigr(b~k,b~j)for all j,k.

2.1step 1.1L1

The same for the square. The weak-action relation Rσ2≅RσRσ gives Rσ2≅Id⁡Cm as well; hence the same argument yields Ibigr(b~k,σ2b~j)=Ibigr(b~k,b~j)for all j,k.

3.1step 1.1step 2.1L3L4

Specialization to the ordinary intersection table. Setting q1=q2=1 in the identities of steps 1.1 and 2.1 and using [L3] gives I(bk,fσ(bj))=I(bk,bj),I(bk,fσ2(bj))=I(bk,bj)for all j,k, where fσ is the boundary-fixed mapping class of σ [L4].

4.1step 3.1L2L4

The detector concludes. The two families of equalities of step 3.1 are exactly the hypotheses of the detector lemma [L2] for f=fσ; hence [fσ]=1 in G, and by [L4] σ=1 in Bm+1. This proves faithfulness.

5.1step 4.1L1L2L3∎

Conclusion. No nontrivial braid acts by the identity functor: the identity of the Hom tables forces the identity of the mapping class, by the two-iterate hypothesis of the detector. The contrast with the Grothendieck group is displayed by the decategorification proposition and the companion counterexample. AC is inherited through the Hom theorem and the detector, which use Bm+1≅G, and through the supplied representative-independence and isotopy invariance of intersection numbers in [L3].

Depends on

Used by

Dependency tree · two levels

50 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