Macaulay2 » Documentation
Packages » ChainComplexOperations :: ChainComplexOperations
next | previous | forward | backward | up | index | toc

ChainComplexOperations -- Symmetric and exterior squares of a complex and the 2nd Adams operation

Description

This package implements the constructions used in Mark Walker's November 2016 proof of the (weak) Buchsbaum-Eisenbud-Horrocks conjecture, which states: If M is a module of codimension c over a regular local ring S, then the sum of the ranks of the free modules in a free resolution of M is at least 2^c. Walker's proof works for rings where 2 is invertible, and in this package we work over a field of characteristic $\neq 2$.

The main new (to Eisenbud) tool in Walker's proof was the function chi2. Explicitly, if F is a ChainComplex of free S-modules with finite length homology, then chi2 F is the Euler characteristic of sym2 F minus that of wedge2 F. The function chi2 should be regarded as the Euler characteristic of the 2nd Adams operation, applied to F. It has two properties relevant for the proof: 1) Like the Euler characteristic of F, chi2 F is additive on short exact sequences of complexes. 2) If S is a regular local ring of dimension d with residue field k, then chi2 res k = 2^d.

Sketch of Walker's proof:

The question reduces by localization to the case where M has finite length. Let F = res M, and let B be the sum of the ranks of the free modules in F. Since F**F = sym2 F ++ wedge2 F, we may drop the negative terms in the expression for chi2 — the odd terms in the Euler characteristic of sym2 F and the even terms in the Euler characteristic of wedge2 F — to get chi2 F \leq\ length HH(F**F). This length is evidently \leq B*length M. On the other hand, the additivity of chi2 implies chi2 F = 2^d*length M. Thus

2^d*length M = chi2 F\leq length HH(F**F) \leq B*length M

QED

Chi2 should be regarded as the Euler characteristic of the second Adams operation, applied to a free Chain complex. Its additivity follows from the fact that the Adams operations are ring homomorphism. This is also easy to prove directly.

It would be good to have the whole decomposition of tensor powers of a module or complex under the action of the symmetric group (and thus also the Adams operations) available in M2. Stillman and Eisenbud have discussed implementing this in the future, and anyone wishing to help with this project is welcome to join (or replace!) us.

Author

Version

This documentation describes version 0.2 of ChainComplexOperations.

Source code

The source code from which this documentation is derived is in the file ChainComplexOperations.m2.

Exports

  • Functions and commands
    • chi2 -- Euler characteristic of the 2nd Adams operation applied to a complex
    • eulerCharacteristic -- sum of the lengths of the even degree homology minus the odd degree homology groups
    • evenHomologyLength -- sum of the lengths of the even degree homology groups
    • excess -- Difference between the sum of the lengths of Tor_i(M,M) and the Walker bound 2^d*length(M)
    • oddHomologyLength -- sum of the lengths of the odd degree homology groups
    • reverseFactors -- The isomorphism from F**G to G**F when F,G are complexes
    • sym2 -- symmetric square of a chain complex
    • testWalker -- tests Walker's formula
    • wedge2 -- exterior square of a chain complex
  • Methods
    • chi2(ChainComplex) -- see chi2 -- Euler characteristic of the 2nd Adams operation applied to a complex
    • eulerCharacteristic(ChainComplex) -- see eulerCharacteristic -- sum of the lengths of the even degree homology minus the odd degree homology groups
    • evenHomologyLength(ChainComplex) -- see evenHomologyLength -- sum of the lengths of the even degree homology groups
    • excess(ChainComplex) -- see excess -- Difference between the sum of the lengths of Tor_i(M,M) and the Walker bound 2^d*length(M)
    • excess(Module) -- see excess -- Difference between the sum of the lengths of Tor_i(M,M) and the Walker bound 2^d*length(M)
    • oddHomologyLength(ChainComplex) -- see oddHomologyLength -- sum of the lengths of the odd degree homology groups
    • reverseFactors(ChainComplex,ChainComplex) -- see reverseFactors -- The isomorphism from F**G to G**F when F,G are complexes
    • reverseFactors(Module,Module,ZZ,ZZ) -- see reverseFactors -- The isomorphism from F**G to G**F when F,G are complexes
    • sym2(ChainComplex) -- see sym2 -- symmetric square of a chain complex
    • wedge2(ChainComplex) -- see wedge2 -- exterior square of a chain complex

For the programmer

The object ChainComplexOperations is a package.