Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

A two-crossing closed braid factorization complex

Example

For a braid diagram D with two crossings, C(D) is the iteration of two crossing complexes and the intermediate arc factors; for instance D=σ1σ2 on three strands has C(D)=Cp1⊗Cp2⊗Cc over the shared polynomial ring, with one arc factor Cc for each arc of the diagram. Verify that the total potential is a∑pϵpxp over the boundary points before closure and that for the closed braid diagram (empty boundary) the total potential is 0, so each outer term of C(D) is a genuine two-periodic complex of bigraded Q[a]-modules; exhibit the four resolutions of the two crossings, each a tensor product of the two local crossing resolutions and all unchanged arc factorizations, and record the induced differentials and their bidegrees. The trigraded cohomology H(D) is then computed from the induced differential on the termwise cohomology CH(D).

Caveat: the displayed total complex is a representative in K(hmf0) up to contractible summands; no invariance statement is made in this example (that is the link-invariance theorem proved later on this page).

Facts & Assumptions

Given: the closed braid diagram D of σ1σ2 on three strands with its two crossings p1,p2, the intermediate and external arcs, at least one mark on every internal edge, and the labels x1,…,xm at the marks and boundary points.

[F1]

C(D) is the tensor product of the crossing complexes Cp and the arc factors Cc over the polynomial ring generated by a and all labels; its outer crossing differential has Koszul signs and bidegree (0,0) and squares to zero, while its inner factorization differential has square the sum of the local potentials (The Khovanov-Rozansky complex and trigraded braid homology).

[F2]

The crossing complex Cp is the two-term complex 0→C(Γ0){0,2}→χ0C(Γ1)→0 for a positive crossing and 0→C(Γ1){0,−2}→χ1C(Γ0){0,−2}→0 for a negative crossing, both terms being factorizations with the potential of the four adjacent labels (The positive and negative Khovanov-Rozansky crossing complexes).

Verification

technique · bookkeeping with the tensor product of two crossing complexes, the potential of a closed diagram, and the resulting differential on the four resolutions
1.1F1F2algebra

The four resolutions and all signed edges. Write Cab=C(Γab) for the resolution with choices a,b∈{0,1} at the two positive crossings, including all unchanged arc factors. The outer terms are C−2=C00{0,4},C−1=C10{0,2}⊕C01{0,2},C0=C11, and zero otherwise. In this summand order the outer differentials are ∂−2=(χ0⊗1,−1⊗χ0),∂−1=(1⊗χ0,χ0⊗1). The minus sign comes from the first source factor having cochain degree −1. Each edge has internal bidegree (0,0) after the indicated shifts and raises outer degree by 1. The edge maps commute before the signs, since they act on different tensor factors, so ∂−1∂−2=0. All four terms retain their inner two-periodic factorization differentials, with the same total potential.

2.1F1step 1.1

The potential. Before closure, the boundary points of the braid diagram carry labels; every internal label occurs in exactly two local factors with opposite signs, so the sum of the local potentials is a∑pϵpxp over the boundary points, and the square of the inner factorization differential is that element; the outer crossing differential still squares to zero by step 1.1. After closing the braid the closure arcs identify the boundary points in pairs with opposite orientations, so each boundary label occurs once with sign +1 and once with sign −1; the total potential is 0 and every outer term of C(D) is a genuine two-periodic complex of bigraded Q[a]-modules.

3.1F1F2step 1.1step 2.1∎

The induced differential and the cohomology. For each term Cj(D) the termwise cohomology CHj(D) is computed after removing the contractible summands, and ∂ commutes with the internal differentials, so it descends to maps ∂ ⁣:CHj(D)→CHj+1(D); the four resolutions contribute the four summands of CH(D) and the induced maps are the sums of the four edge maps of the cube with Koszul signs. The resulting cohomology H(D) is the trigraded cohomology of the diagram, and the trigradings of the four summands are inherited from the terms; no invariance statement is made here, and the representative is taken up to contractible summands in K(hmf0).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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