Computing minimal Gorenstein covers

From MaRDI portal



Abstract: We analyze and present an effective solution to the minimal Gorenstein cover problem: given a local Artin k-algebra A=k[[x1,...xn]]/I, compute an Artin Gorenstein k-algebra G=k[[x1,...xn]]/J such that ell(G)−−ell(A) is minimal. We approach the problem by using Macaulay's inverse systems and a modification of the integration method for inverse systems to compute Gorenstein covers. We propose new characterizations of the minimal Gorenstein cover and present a new algorithm for the effective computation of the variety of all minimal Gorenstein covers of A for low Gorenstein colength. Experimentation illustrates the practical behavior of the method.


Let \(\pmb k\) be a field and \(A\) be the Artinian local \(\pmb k\)-algebra \(A=R/I\), where \(R=\pmb k \llbracket x_1,\dots, x_n\rrbracket\). The Gorenstein local Artinian \(\pmb k\)-algebra \(G=R/J\) is a Gorenstein cover of \(A\) if there is a surjection \(G\to A\). The Gorenstein colength of \(A\) is the minimum of \(\ell(G)-\ell(A)\) as \(G\) roams over the set of Gorenstein covers of \(A\). This paper asks the questions 1. How does one determine the Gorenstein colength of \(A\)? 2. How does one find a Gorenstein cover of \(A\) of minimal Gorenstein colength? 3. What is the structure of the set of Gorenstein covers of \(A\) of minimal Gorenstein colength? All three questions are answered with Theorems and algorithms; furthermore, the algorithms are implemented in Singular. In particular, the answer to the third question is that the set of Gorenstein covers of \(A\) of minimal Gorenstein colength is a a Zariski open subset of a projective space over \(\pmb k\). In particular, for example, if \(R = \pmb k\llbracket x_1, x_2, x_3\rrbracket\), \(I = (x^2_1, x_1x_2, x_1x_3, x_2x_3, x^3_2, x^3_3)\), and \(A = R/I\), then the set of minimal Gorenstein covers of \(A\) is the open subset of \(\mathbb P^5\) which is the complement of the variety \(V(a_1a_4a_6)\). Furthermore, every minimal Gorenstein cover of \(A\) is of the form \(G = R/ \operatorname{Ann}_R H\), where \(H = a_1y^3_3 + a_2y_2y_3 + a_3y_1y_3 +a_4y^3_2 + a_5y_1y_2 + a_6y^2_1\), with \(a_1a_4a_6 \neq 0\), where \(S=\pmb k[y_1,\dots,y_n]\) is a polynomial ring which, as an \(R\)-module, is isomorphic to the injective hull \(E_R(\pmb k)\) of the \(R\)-module \(\pmb k\) and \((a_1 : a_2 : a_3 : a_4 : a_5 : a_6)\) is a point in \(\mathbb P^5\). The notion of Gorenstein colength was introduced by \textit{H. Ananthnarayan} [J. Algebra 320, No. 9, 3438--3446 (2008; Zbl 1162.13008)]. Rings of Gorenstein colength one are called Teter rings because of the paper by \textit{W. Teter} [Invent. Math. 23, 153--162 (1974; Zbl 0276.13018)]. The present paper is a continuation of the paper by \textit{J. Elias} and \textit{M. S. Takatuji} [Proc. R. Soc. Edinb., Sect. A, Math. 147, No. 1, 125--139 (2017; Zbl 1402.13023)] which essentially answers the same three questions for Teter rings. The technically complicated aspect of the present paper involves calculating a good basis for the relevant submodule of \(S\). This step involves iterated integration of a submodule of \(S\) with respect to powers of the maximal ideal of \(R\). One of the key results of the paper is an algorithm which effectively computes this integration.





Describes a project that uses

Uses Software






This page was built for publication: Computing minimal Gorenstein covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301456)