Package zerodim

This article is about a function from ApCoCoA-2. If you are looking for the ApCoCoA-1 version of it, see Category:ApCoCoA-1:Package ZeroDim.

This page describes the zerodim package. The package contains various functions for computing algebraic invariants of zero-dimensional schemes and related computations. For a complete list of functions, see Category:Package zerodim.

Algebraic Invariants

Let $K$ be a field, let $P=K[x_{1},\ldots ,x_{n}]$ be the polynomial ring over $K$ in $n$ indeterminates, and let $I$ be a 0-dimensional ideal of $P$ and $R=P/I$. Then $I$ defines a 0-dimensional scheme $X$ in the affine $n$-space. Consider the canonical multiplication map

$\mu :R^{e}=R\otimes _{K}R\longrightarrow R,(f,g)\mapsto fg$

and its kernel $J=\mathrm {Ker} (\mu )$. Then $J/J^{2}$ is a finitely generated $R$-module and $\mathrm {Ann} _{R^{e}}(J)$ is an ideal of the enveloping algebra $R^{e}$.

• The ideal $\vartheta _{N}(R/K):=\mu (\mathrm {Ann} _{R^{e}}(J))$ is called the Noether different of the algebra $R/K$.
• The $R$-module $\Omega _{R/K}^{1}:=J/J^{2}$ is called the module of Kaehler differential 1-forms of the algebra $R/K$.
• The $K$-linear map $d:R\rightarrow \Omega _{R/K}^{1},f\mapsto f\otimes 1-1\otimes f+J^{2}$, is called the universal derivation of the algebra $R/K$.
• For $m\geq 0$, the exterior power $\Omega _{R/K}^{m}:=\wedge _{R}^{m}\Omega _{R/K}^{1}$ is called the module of Kaehler differential m-forms of the algebra $R/K$.
• For $m\geq 0$ the $m$-th Fitting ideal $\vartheta _{X}^{(m)}(R/K)$ of the module of Kaehler differential 1-forms $\Omega _{R/K}^{1}$ is called the Kaehler different of the algebra $R/K$.

More generally, for any $K$-algebra $T/S$, we can define the Noether different, module of Kaehler differential m-forms, Kaehler different of $T/S$ analogously. In particular, if $T/S$ is graded, then all these invariants are also graded.

Now let us embed the scheme $X$ in the projective $n$-space via $X\subseteq D_{+}(x_{0})\subseteq \mathbb {P} ^{n}$, where $x_{0}$ is a new indeterminate. Set $S:=P[x_{0}]=K[x_{0},\dots ,x_{n}]$ and equip $S$ with the standard grading. The homogeneous vanishing ideal of $X$ is the homogenization of $I$ with respect to $x_{0}$ and denoted by $I_{X}$, and the homogeneous coordinate ring of $X$ is the graded 1-dimensional ring $R_{X}=S/I_{X}$. In this case $K[x_{0}]$ is the Noetherian normalization of $R_{X}$, and hence we can define the above invariants for the graded algebra $R_{X}/K[x_{0}]$. Moreover, we have the following further invariants.

• The graded $R_{X}$-module $\omega _{R_{X}}=\mathrm {Hom} _{K[x_{0}]}(R,K[x_{0}])(-1)$ is called the canonical module of the algebra $R_{X}/K[x_{0}]$.
• The graded locolization $Q^{h}(R_{X})$ of $R_{X}$ at $x_{0}$ is called the homogeneous ring of quotients of $R_{X}$.
• When the scheme $X$ is reduced (more general, locally Gorenstein), there is an injection $\omega _{R_{X}}\hookrightarrow Q^{h}(R_{X})$ and the inverse of $\omega _{R_{X}}$ in $Q^{h}(R_{X})$ is called the Dedekind different of $R_{X}/K[x_{0}]$.

Many interesting properties of the scheme $X$ are reflexed by the algebraic structure of the above invariants.

Package Description

All of the previously described definitions are implemented in the SAGBI package.

Basic functions

Given a polynomial ring P and a list F of polynomials in P, one can compute the reduced SAGBI basis of $K$[F] (with respect to the term ordering given by P) using the function SB.SAGBI - as long as a finite one exists.

SB.SAGBI(F);

Note that this function probably runs into an infinite loop if no finite SAGBI basis exists. This can be avoided using the function SB.SAGBITimeout. Given a positive integer s, one can type in

SB.SAGBITimeout(F,s);

which does the same as SB.SAGBI(F), but throws an error if the computation is not finished within s seconds. Given a polynomial f and a list of polynomials G, the function SB.ReductionStep can be used to compute a polynomial g with f${\xrightarrow {G} }_{\rm {s}}$g.

SB.ReductionStep(f,G);

Special Functions for Graded Subalgebras

If G is a set of homogeneous polynomials, then there are additional functions one can use. Given a positive integerd, a d-truncated SAGBI basis can be computed using SB.TruncSAGBI.

SB.TruncSAGBI(G,d);

If additionally, the Hilbert series HS of the subalgebra $K[G]$ is given, one can call

SB.TruncSAGBI(G,d,HS);

The Subalgebra Data Type

The package also introduces a new Data type, i.e. a record tagged with "$apcocoa/sagbi.Subalgebra". Given a polynomial ring P and a list of polynomials G from P, one can create the subalgebra $K[G]$ using the function SB.Subalgebra.

Use P ::= QQ[x,y,z];
G := [x^2+y*z,z];
S := SB.Subalgebra(P,G);

For details about the structure of this data type, see the function page. While nearly all functionalities of the SAGBI package can be used without touching this data type, it has many advantages to do so because it stores informations of previous computations, see the example below. This is also the reason why many of the getter functions need the subalgebra to be called by reference. The following getter function can be used to get informations about the subalgebra:

SB.GetCoeffRing(S); -- returns the coefficient ring
SB.GetGens(S); -- returns the set G
SB.GetID(S); -- returns the unique ID of S
SB.GetLTSA(ref S); -- returns the subalgebra K[LT(f) | f in S]
SB.GetRing(S); -- returns P
SB.GetSAGBI(ref S); -- returns the reduced SAGBI basis of S (if a finite one exists)

Example for the Subalgebra Data Type

So what advantages does the Subalgebra data type have? Consider the following example.

Use P ::= QQ[x,y,z];
G := [x^2 -z^2,  x*y +z^2,  y^2 -2*z^2];
L := SB.SAGBI(G);
f := x^10*y^2 +x^6*y^6 -2*x^10*z^2 -5*x^8*y^2*z^2 +6*x^5*y^5*z^2 +10*x^8*z^4 +10*x^6*y^2*z^4 +15*x^4*y^4*z^4 -20*x^6*z^6 -10*x^4*y^2*z^6 +20*x^3*y^3*z^6 +20*x^4*z^8 +20*x^2*y^2*z^8 -10*x^2*z^10 +6*x*y*z^10 -y^2*z^10 +3*z^12;
b := SB.IsInSubalgebra(f,G);
h := SB.SubalgebraHS(G);

While this is only a simple example, the second code is much faster. At the time this is written, the second computation is approximately two times as fast as the first one.