Matrix factorization (algebra)

From HandWiki

In homological algebra, a branch of mathematics, a matrix factorization is a tool used to study infinitely long resolutions, generally over commutative rings.

Motivation

One of the problems with non-smooth algebras, such as Artin algebras, are their derived categories are poorly behaved due to infinite projective resolutions. For example, in the ring

R=ℂ[x]/(x2)

there is an infinite resolution of the

R

-module

ℂ

where

⋯→⋅xR→⋅xR→⋅xR→ℂ→0

Instead of looking at only the derived category of the module category, David Eisenbud[1] studied such resolutions by looking at their periodicity. In general, such resolutions are periodic with period

2

after finitely many objects in the resolution.

Definition

For a commutative ring

S

and an element

f∈S

, a matrix factorization of

f

is a pair of

n×n

square matrices

A,B

such that

AB=f⋅Idn

. This can be encoded more generally as a

ℤ/2

graded

S

-module

M=M0⊕M1

with an endomorphism

d=[0d1d00]

such that

d2=f⋅IdM

.

Examples

(1) For S=ℂx and f=xn there is a matrix factorization d0:S⇄S:d1 where d0=xi,d1=xn−i for 0≤i≤n.

(2) If

S=ℂx,y,z

and

f=xy+xz+yz

, then there is a matrix factorization

d0:S2⇄S2:d1

where

d0=[zyx−x−y] d1=[x+yyx−z]

Periodicity

definition

Main theorem

Given a regular local ring R and an ideal I⊂R generated by an A-sequence, set B=A/I and let

⋯→F2→F1→F0→0

be a minimal B-free resolution of the ground field. Then F∙ becomes periodic after at most 1+dim(B) steps. https://www.youtube.com/watch?v=2Jo5eCv9ZVY

Maximal Cohen-Macaulay modules

page 18 of eisenbud article

Categorical structure

Support of matrix factorizations

See also

References

Further reading