Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 factorization of a marked MOY graph

Definition

Let Γ be a finite planar graph in a disk whose edges are either oriented arcs between marks (including boundary points) or wide (thick) edges, each wide edge bounded by four oriented edge-ends, as in the Khovanov-Rozansky diagrams. Place finitely many marks, with at least one on every internal edge and every circle of Γ, place any finite number of marks (possibly none) on each boundary edge, and label all marks and boundary points by distinct variables x1,…,xr; the boundary points carry orientations ϵp∈{1,−1}. With Cc and Ct the arc and wide-edge factorizations of Arc and wide-edge Khovanov-Rozansky factorizations, define

C(Γ):=⨂cCc⊗⨂tCt,

the tensor product taken over S=Q[a,x1,…,xr] with all variables shared (the tensor product of the two-term factorizations of the local pieces, with the Koszul sign convention), and view C(Γ) as a factorization over the smaller polynomial ring R=Q[a,xp  :  p a boundary point]: the variables at internal marks are internal and are forgotten. Its potential is

wΓ=a∑pϵpxp.

The sum is over the boundary points: every internal label occurs at exactly two edge-ends with opposite signs, whose contributions +axi and −axi cancel, while a boundary label occurs at exactly one edge-end, and the local potentials of the arc and wide-edge factorizations add to wΓ.

If Γ is closed (no boundary points), then wΓ=0 and C(Γ) is a 2-periodic complex C0(Γ)→dC1(Γ)→dC0(Γ) of bigraded Q[a]-modules, whose cohomology is denoted H(Γ). Each term is a free bigraded Q[a]-module, generally of infinite rank. Contractible summands may be removed without changing its cohomology, but no finite-rank representative over Q[a] is asserted: already a one-mark circle has cohomology Q[x]{−1,1}. For a nonempty closed graph, the row reduction proved below shows that a acts trivially on H(Γ). For the empty graph the empty tensor product is Q[a] in even parity, and a need not act trivially. Caveats: C(Γ) has infinite rank as an R-module whenever internal marks are present; the marks are auxiliary data, and a marking change alters C(Γ) by a chain homotopy equivalence (proved later on this page); the potential vanishes exactly for closed graphs, which is why C(Γ) is a genuine complex in that case.

Depends on

Used by

Dependency tree · two levels

2 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