Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Koszul row operations and variable exclusion preserve homotopy type

Statement

Work over a polynomial ring R and write (a,b)=⨂i(ai,bi) for the Koszul factorization with rows R→aiR→biR, so that its total differential squares to ∑iaibi. The row operations are first statements about ungraded factorizations. In the bigraded setting of Bigraded matrix factorizations with a potential, require the entries, substitutions and basis changes to be homogeneous of the degrees determined by the row shifts; only such operations give bigrading-preserving maps. Then:

(1) Row operations. For λ∈R the replacement of two rows (ai,bi),(aj,bj) by (ai,bi+λbj),(aj−λai,bj), all other rows unchanged, is an isomorphism of factorizations (it is the change of basis ∣00⟩,∣01⟩,∣10⟩,∣11⟩↦∣00⟩,∣01⟩,∣10⟩+λ∣01⟩,∣11⟩ on the tensor product of the two rows).

(2) Variable exclusion. Let R=R′[y], let w=∑iaibi∈R′ (so y is internal), and suppose one row of (a,b) has the form (0, y−μ) with μ∈R′. Let (a′,b′) be the Koszul factorization over R′ obtained by deleting that row and substituting y↦μ in all other rows, and let (a,b)′ be (a,b) restricted to R′ (an infinite-rank factorization). Then (a,b)′≃(a′,b′) in hmfw(R′): the R′-complex 0→R′[y]→yR′[y]→0 splits into the contractible complexes 0→R′yj→yR′yj+1→0 for j≥0 and the rank-one complex 0→R′→0.

(3) Graph factorizations. For a nonempty planar marked graph Γ with m1 arcs and m2 wide edges the Koszul matrix of C(Γ) has m1+m2 linear rows (a,z) (z linear in the xi) and m2 quadratic rows (0, xixj−xkxl); applying the row operations of (1) with λ=1 against the first linear row turns the first row into (a,∑pϵpxp) over the boundary points and all other linear rows into (0,z); if Γ is closed the first row becomes (a,0) and, after restricting scalars to Q and deleting that row with its odd parity and internal shift retained, the remaining rows are (0,z) for the other linear entries and (0,q) for all the quadratic entries. Their Koszul complex computes H(Γ), with the parity and internal shift contributed by the removed (a,0) row retained and the cyclic grading collapsed to a bigrading, and a acts trivially on H(Γ).

Caveats: (2) is a chain homotopy equivalence, not an isomorphism of factorizations over R; the substitution y↦μ must be applied to every remaining row simultaneously; the collapse in (3) loses the cyclic (homological) grading because the differential has nonzero bidegree. Source: Khovanov-Rozansky II, section 2, printed pp. 12-14, and the cyclic Koszul algebra of Khovanov-Rozansky I, section 2, printed pp. 13-17. Removing a here computes cohomology after restricting scalars; it does not give a free representative of that cohomology in hmf0(Q[a]).

Facts & Assumptions

Given: a polynomial ring R, a Koszul factorization (a,b)=⨂i(ai,bi) with potential w=∑iaibi, and a marked planar graph Γ with its factorization C(Γ).

[F1]

The category mfw has objects (M0,M1,d) with d of bidegree (1,1), d2=w⋅id, and morphisms of bidegree (0,0) commuting with d, and hmfw is its homotopy category, with homotopies of bidegree (−1,−1) (Bigraded matrix factorizations with a potential).

[F2]

C(Γ) is the tensor product over the shared polynomial ring of the arc rows (a,xi−xj) and the wide-edge rows (a,x1+x2−x3−x4) and (0,x1x2−x3x4), has potential wΓ=a∑pϵpxp over the boundary points, and internal labels occur with cancelling signs (The factorization of a marked MOY graph).

Proof

technique · direct; a change of basis, two explicit sequences of elementary row transformations, and the standard-form computation of the graph matrix
1.1F1algebra

Row operations. Model the Koszul factorization on the exterior algebra of a free module with basis ei, with differential d=∑iai(ei∧−)+∑ibiιi, where ιi is contraction by the dual basis. The exterior and contraction operators anticommute for distinct indices and satisfy ιi(ei∧−)+(ei∧−)ιi=1, giving d2=∑iaibi. The basis change ei↦ei+λej, ej↦ej induces an invertible exterior-algebra map. Expressing d in that basis gives exactly (ai,bi+λbj),(aj−λai,bj). This intertwines the differentials; in the graded case it preserves the grading precisely under the degree compatibility stated above.

1.2F1algebra

Polynomial remainders. Replace y by y+μ to reduce (0,y−μ) to (0,y). For every other row write ai=ai′+yAi and bi=bi′+yBi, where ai′,bi′∈R′ are the values at y=0 and Ai,Bi∈R′[y] are polynomial quotients; no linearity in y is assumed. Since the excluded row has product zero and w∈R′, subtraction of the value at zero yields y∑i(Aibi′+ai′Bi+yAiBi)=0. Multiplication by y is injective in R′[y], so ∑i(Aibi′+ai′Bi+yAiBi)=0.

2.1step 1.1step 1.2algebra

Exclusion of the row. Pair (ai,bi) with the distinguished row using step 1.1 with parameter −Bi. After doing this for every i, the rows become (ai,bi′) and (∑iaiBi,y). Swap the entries of the distinguished row, with the corresponding parity shift, and use the dual row operation (ai,bi′),(y,A)↦(ai−Aiy,bi′),(y,A+Aibi′). This dual operation is another exterior-basis change (or the previous operation after exchanging wedge and contraction), and preserves the product. The ordinary rows now equal (ai′,bi′), while the distinguished row equals (y,∑i(aiBi+Aibi′))=(y,0) by step 1.2. Undoing its entry swap cancels the parity shift and leaves (0,y). Thus the original factorization is isomorphic to (a′,b′)⊗(0,y) over R′[y].

2.2F2step 1.1

Standard form of graph factorizations. By [F2] the matrix of C(Γ) has the m1+m2 linear rows (a,z) contributed by the arcs and the first row of each wide edge, and the m2 quadratic rows (0,q) contributed by the second row of each wide edge; permute rows so the linear rows come first. Applying the operation of clause (1) to the first row and each further linear row p with λ=1 replaces the pair (a,z1),(a,zp) by (a,z1+zp),(0,zp), so afterwards the first row is (a,∑linear rowsz) and every other linear row is (0,z) with its original z. The internal labels occur twice with opposite signs and cancel in the sum, while each boundary label occurs once, so the first row is (a,∑pϵpxp); the quadratic rows are untouched.

3.1F1step 2.1

The splitting. Over R′ the row (0,y) presents the complex 0→R′[y]→yR′[y]→0, which is the direct sum of the two-term complexes 0→R′yj→yR′yj+1→0 for j≥0 and the rank-one complex 0→R′→0; for j≥0 the map y ⁣:R′yj→R′yj+1 is an isomorphism, so those summands are contractible and contribute nothing to the homotopy type. In a tensor product with (a′,b′) the contractible summands remain contractible, hence (a,b)′≃(a′,b′)⊗R′≃(a′,b′) in hmfw(R′), which proves clause (2); the equivalence forgets the variable y and is not an isomorphism of R-factorizations because C(Γ) has infinite rank over R′.

4.1F1F2step 2.2step 3.1algebra∎

Closed graphs. If Γ is closed, step 2.2 makes the first row (a,0) and every other row has first entry zero. The latter rows include both the remaining linear entries and every quadratic entry; write their tensor product as K. The first row is Q[a]→aQ[a]{−1,1}→0Q[a]. Its cohomology is the odd-parity copy of Q{−1,1}. More explicitly, as a complex over Q it is the direct sum of contractible pairs Qaj→aQaj+1{−1,1} and the remaining constant in odd parity. Since K has no a in its entries, tensoring this splitting with K leaves its specialization at a=0, with the first row's shift and odd parity retained. This is exactly the Koszul complex on all remaining linear and quadratic entries, with its cyclic grading folded into parity; multiplication by a is zero on the resulting cohomology.

Depends on

Used by

Dependency tree · two levels

5 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