truncate(degs, M)
The truncation to degree $d$ in the singly graded case of a module (or ring or ideal) is generated by all homogeneous elements of degree at least $d$ in $M$. The resulting truncation is minimally generated (assuming that $M$ is graded).
|
|
|
|
The coefficient ring of $R$ may be $\ZZ$ or another polynomial ring. Over $\ZZ$, the generators may not be minimal, but they do generate.
|
|
If a multi-degree $d$ is given, then the result is the submodule generated by elements of degree $d+\NN\mathcal C$ where $\mathcal C$ is either a generating set for the degree semigroup of $R$ or the Nef cone of the toric variety.
The following example finds the 11 generators needed to obtain all graded elements whose degrees are at least $\{7,24\}$.
|
|
|
Given a list of multi-degrees $D$, then the result is the submodule generated by elements of degree $d+\NN\mathcal C$ for any $d\in D$.
The following example finds the generators needed to obtain all graded elements whose degrees at least $\{3,0\}$ or at least $\{0,1\}$. The resulting module is also minimally generated.
|
|
|
The coefficient ring may also be a polynomial ring. In this example, the coefficient variables also have degree one. The given generators will generate the truncation over the coefficient ring.
|
|
|
|
If the coefficient variables have degree 0:
|
|
|
|
|
|
The behavior of this function has changed as of Macaulay2 version 1.13. This is a (potentially) breaking change. Before, it used a less useful notion of truncation, involving the heft vector, and was often not what one wanted in the multi-graded case. Additionally, in the tower ring case, when the coefficient ring had variables of nonzero degree, sometimes incorrect answers resulted.
Also, the function expects a graded module, ring, or ideal, but this is not checked, and some answer is returned.