Jump to content

Matrix factorization (algebra)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Muboshgu (talk | contribs) at 05:22, 24 February 2022 (Dummy edit to reset G13 clock after undeletion (rfud-helper)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, matrix factorizations are tools used to study infinitely long resolutions in homological algebra, 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 there is an infinite resolution of the -module where

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 after finitely many objects in the resolution.

Definition

For a commutative ring and an element , a matrix factorization of is a pair of square matrices such that . This can be encoded more generally as a graded -module with an endomorphism

such that .

Examples

(1) For and there is a matrix factorization where for .

(2) If and , then there is a matrix factorization where

Periodicity

definition

Main theorem

Given a regular local ring and an ideal generated by an -sequence, set and let

be a minimal -free resolution of the ground field. Then becomes periodic after at most steps. https://www.youtube.com/watch?v=2Jo5eCv9ZVY

Maximal Cohen-Macaulay modules

page 18 of eisenbud article

Categorical structure

Support of matrix factorizations

References

  1. ^ Eisenbud, David. "Homological Algebra on a Complete Intersection, with an Application to Group Respresentations" (PDF). Transactions of the American Mathematical Society. 260: 35–64. Archived from the original (PDF) on 25 Feb 2020.

See also