A = acyclicClosure RA = acyclicClosure(R, EndDegree => n)This form is shorthand for acyclicClosure(koszulComplexDGA R, ...): the Koszul complex on a chosen generating set of the maximal/irrelevant ideal is used as the starting DG algebra, and acyclicClosure(DGAlgebra) iteratively adjoins new generators to kill homology up to EndDegree. The output is a truncation of Avramov's acyclic closure of R over itself -- equivalently, a free DG algebra resolution of the residue field in hom-degrees 0 through EndDegree.
Variable convention. The hom-degree-1 exterior generators come from koszulComplexDGA and are named T_(1,j), one for each generator of the maximal/irrelevant ideal. Higher generators (adjoined by killCycles at each stage) are named T_(n,j), with n the homological degree and j a 1-indexed counter. Generators of odd hom-degree are exterior; generators of even hom-degree are polynomial. Pass Variable => "S" (or any string/symbol) to rename the base.
|
|
|
|
Four hom-degree-1 exterior generators T_(1,1), ..., T_(1,4) (one per variable of R) and three hom-degree-2 polynomial generators (one for each defining relation, since R is a complete intersection of codimension 3). In the resulting DG algebra the residue field has been resolved through hom-degree 3.
For a complete intersection, the Koszul complex already has zero higher homology beyond what the Tate polynomial closure kills at hom-degree 2, so the number of generators stabilizes quickly:
|
|
|
For a non-c.i., further deviations appear:
|
|
|
The source of this document is in /build/reproducible-path/macaulay2-1.26.05+ds/M2/Macaulay2/packages/DGAlgebras/doc.m2:1521:0.