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.

Bigraded matrix factorizations with a potential

Definition

Fix a finite set I, let S=Q[a,xi  :  i∈I] be the polynomial ring of The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution in a variable a and the variables xi, bigraded by

deg⁡a=(2,0),deg⁡xi=(0,2),

and for a bigraded S-module M and (n1,n2)∈Z2 write M{n1,n2} for the internal shift

M{n1,n2}(k,l)=M(k−n1,l−n2)

in the sense of the internal shift of Associative graded algebras, bimodules, and internal shifts (the two-parameter refinement of the one-parameter shift, applied to each bigrading separately).

Fix signs ϵi∈{1,−1} for i∈I and put w=a∑i∈Iϵixi, an element of S of bidegree (2,2). A bigraded matrix factorization with potential w is a pair M=(M0,M1,d) consisting of free bigraded S-modules M0,M1 (of arbitrary, possibly infinite, rank) together with S-linear maps

d ⁣:M0→M1,d ⁣:M1→M0

of bidegree (1,1) such that

d2=w⋅id,

i.e. d2(m)=wm for every m∈M0⊕M1. A morphism f ⁣:M→N is a pair of S-linear maps of bidegree (0,0) on the two components commuting with d; a homotopy between two morphisms is a pair of maps of bidegree (−1,−1) satisfying the usual homotopy formula. Write mfw for the category of factorizations with potential w and their bidegree-preserving morphisms, and hmfw for its homotopy category, in which the morphisms are the bidegree-preserving morphisms modulo null-homotopic ones. Explicitly, f−g=dNh+hdM, where h reverses inner parity. Internal shifts M{u,v} shift both modules and retain their inner parity. Write ΠM for the parity reversal: (ΠM)0=M1, (ΠM)1=M0, with the same differential. It preserves the potential, acts on morphisms by the same component maps, and satisfies Π2M=M. For w=0, the direct sum of the two parity cohomologies of ΠM is the same bigraded vector space as that of M; only their parity labels change.

Caveats. Unless w=0, d does not square to zero, so a factorization is not an ordinary complex. If I=∅ then S=Q[a] and a factorization with w=0 is a 2-periodic complex M0→dM1→dM0 of free bigraded Q[a]-modules; for w≠0 the only failure of the complex axioms is the identity d2=w⋅id. The sign vector (ϵi) and the bigrading are part of the data, and on this page the potential is always a times a linear form with coefficients in {1,−1}. The conventions (two-variable bigrading with deg⁡a=(2,0), deg⁡xi=(0,2); d of bidegree (1,1); homotopies of bidegree (−1,−1); morphisms commuting with d) follow Khovanov-Rozansky, Matrix factorizations and link homology II, section 1, formulas (1)-(2) and the lattice picture of its Figure 3; the ungraded definitions of a duplex and a free-module factorization are Definitions 1-2 in section 2 (printed pp. 13-14) of Khovanov-Rozansky, Matrix factorizations and link homology.

Depends on

Used by

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