Koszul-Tate resolutions and decorated trees
Abstract
Given a commutative algebra O, a proper ideal I, and a resolution of O/ I by projective O -modules, we construct an explicit Koszul-Tate resolution. We call it the arborescent Koszul-Tate resolution since it is indexed by decorated trees. When the O-module resolution has finite length, only finitely many operations are needed in our constructions -- this is to be compared with the classical Tate algorithm, which requires infinitely many such computations if I is not a complete intersection. As a by-product of our construction, the initial projective O -module resolution becomes equipped with an explicit A∞-algebra.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.