Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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-Rozansky complex and trigraded braid homology

Definition

Let D be a finite marked oriented tangle diagram, with at least one mark on every internal edge and every circle, and any finite number of marks (possibly none) on boundary edges. Label all marks and boundary points by variables x1,…,xm. For the braid-homology construction specialize to a braid diagram, a generic projection of the closure of a clockwise-oriented braid (The braid group by Artin presentation, The closure of a geometric braid); crossings are resolved as in The positive and negative Khovanov-Rozansky crossing complexes.

Define C(D):=⨂p crossingCp⊗⨂c arcCc, the tensor product over the polynomial ring generated by a and all labels, then restricted to the ring generated by a and the boundary labels as in The factorization of a marked MOY graph, viewed as a complex of objects of hmfw with w=a∑pϵpxp over the boundary points; for a closed braid diagram w=0. For a nonempty closed braid diagram D, let CHj(D) be the direct sum of the two inner parity cohomologies of Cj(D), with their parity labels forgotten. It is a bigraded Q-vector space on which a acts trivially; the differential ∂ of C(D) induces a differential on CH(D), and the cohomology H(D)=⨁j,k,lHk,lj(D) of the resulting complex is a triply graded Q-vector space (cohomological degree j, first bigrading k and second bigrading l). Its Euler characteristic is ⟨D⟩:=∑j,k,l(−1)jtkqldim⁡QHk,lj(D).

For the zero-strand empty diagram all tensor products are empty: C(∅)=Q[a] in outer degree 0 and even parity, with zero differential. Its cohomology is Q[a], on which a acts by multiplication, not trivially. Since deg⁡a=(2,0), its raw integer-graded Euler series is ⟨∅⟩=(1−t2)−1. This tensor-unit boundary case is distinct from the nonempty-link normalization proved later.

Caveats: the link-invariance results below use braid diagrams only (the oriented IIb move is not used); the marking data are auxiliary, but independence of the marking is proved later on this page; no independence of the diagram is asserted here; the trigrading is kept separate throughout, and t records the first bigrading while q records the second, in the source's convention.

Facts & Assumptions

Given: a marked braid diagram D with its crossings, arcs and labels, the local factorizations Cc and the crossing complexes Cp, and the tensor product C(D) over the shared polynomial ring.

[F1]

Each crossing complex is a two-term complex of matrix factorizations with potential w=a(x1+x2−x3−x4), the differential χ0 or χ1 having bidegree (0,0) on the shifted terms (The positive and negative Khovanov-Rozansky crossing complexes).

[F2]

Each local factorization is an object of hmfw whose differential squares to its own potential: a(x1−x2) for an arc with endpoint labels x1,x2, a(x1+x2−x3−x4) for a wide edge, and the potential of a marked graph is a∑pϵpxp over its boundary points, vanishing for closed graphs; the empty graph tensor unit is Q[a] with zero differential (The factorization of a marked MOY graph).

[F3]

For a nonempty closed graph, row reduction extracts a row (a,0). After restricting scalars to Q, its polynomial splitting reduces cohomology to the remaining Koszul complex at a=0, retaining its odd parity and internal shift; a acts trivially on that cohomology (Koszul row operations and variable exclusion preserve homotopy type).

Proof

technique · direct assembly of the tensor product and termwise reduction to the Koszul standard form
1.1F1F2algebra

The tensor product is a complex with the stated potential. The differential of C(D) is the sum, with the Koszul signs of the totalization, of the differentials of the factors Cp and Cc. Each Cp is a two-term complex by [F1] and each Cc is a single factorization by [F2], so the totalized differential satisfies ∂2=0 strictly, and C(D) is an object of K(hmfw). The square of the internal differential of a tensor product accumulates the individual potentials, so that of C(D) is a∑pϵpxp over the boundary points: every internal label occurs in exactly two local factors with opposite signs and cancels, exactly as for a marked graph in [F2]. For a closed braid diagram there are no boundary points and the potential is w=0, so C(D) is a genuine complex of bigraded Q[a]-modules.

1.2F2F3algebra

Termwise cohomology and trivial a-action. Every resolution of the nonempty closed braid is a nonempty closed marked graph with at least one linear row: a crossingless circle has a mark and hence an arc factor, while each resolved crossing contributes arc or wide-edge factors. The row reduction of [F3] turns its first linear row into (a,0) and leaves all other linear and quadratic rows with first entry zero. The explicit polynomial splitting of that first row over Q reduces its cohomology to the specialization a=0 of the remaining Koszul complex, with the first row's parity and internal shift retained. Thus a acts trivially on every CHj(D) and these are bigraded Q-vector spaces. This reduction does not imply finite rank over Q[a]; the one-mark circle already leaves the polynomial variable x. Each resolution nevertheless has finite-dimensional pieces in each bigrading, since it uses finitely many polynomial variables of positive degrees and finitely many shifted Koszul terms.

2.1F2step 1.1algebra

The empty boundary case. For the zero-strand diagram there are no crossings or arc factors. The empty tensor is the graph tensor unit Q[a] of [F2], in degree 0 with zero differential. Thus CH0=H0=Q[a] and all other outer degrees vanish. Its homogeneous monomials ad have bigrading (2d,0), so each fixed bidegree is finite and the raw Euler series is ∑d≥0t2d=(1−t2)−1. Multiplication by a is nonzero, as asserted separately.

3.1F1F3step 1.1step 1.2step 2.1∎

The induced differential and the trigraded cohomology. The differential ∂ of C(D) is a sum of morphisms χ0,χ1 of bidegree (0,0) between factorizations, so it commutes with the internal differentials of the terms, hence maps cycles to cycles and boundaries to boundaries in each term and induces a map ∂ ⁣:CHj(D)→CHj+1(D). Since ∂2=0 on C(D) by step 1.1, the induced maps satisfy ∂2=0 on CH(D), and since they preserve the bigrading, the cohomology H(D)=⨁j,k,lHk,lj(D) is triply graded with j the cohomological degree and k,l the two bigrading degrees; the Euler characteristic ⟨D⟩=∑j,k,l(−1)jtkqldim⁡QHk,lj(D) is therefore defined. This is the integer-graded construction of Khovanov-Rozansky II, section 1; invariance is established by later items.

Depends on

Used by

Dependency tree · two levels

17 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