Matrix factorization (algebra)

From HandWiki - Reading time: 2 min


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

xRxRxR0

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

fS

, a matrix factorization of

f

is a pair of

n×n

square matrices

A,B

such that

AB=fIdn

. This can be encoded more generally as a

/2

graded

S

-module

M=M0M1

with an endomorphism

d=[0d1d00]

such that

d2=fIdM

.

Examples

(1) For S=x and f=xn there is a matrix factorization d0:SS:d1 where d0=xi,d1=xni for 0in.

(2) If

S=x,y,z

and

f=xy+xz+yz

, then there is a matrix factorization

d0:S2S2:d1

where

d0=[zyxxy] d1=[x+yyxz]

Periodicity

definition

Main theorem

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

F2F1F00

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




Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Matrix_factorization_(algebra)
10 views |
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF