Componentwise linear ideals with minimal or maximal Betti numbers (Q942039): Difference between revisions

Let \(S=k[x_1,\ldots, x_n]\), \(k\) a field. In this note the authors consider componentwise linear ideals of \(S\) and study the cases when certain bounds for the Betti numbers of these ideals are achieved. An ideal \(I\) is called componentwise linear if for each \(j\), the subideal generated by all polynomials in \(I\) of degree \(j\) has a linear resolution. If \(I\) is componentwise linear and \(J\) is the generic initial ideal of \(I\) with respect to the reverse lexicographic order, then the Betti numbers of \(I\) agree with the Betti numbers of \(J\). Since \(J\) is a monomial ideal its Betti numbers satisfy certain bounds. Thus the bounds for the Betti numbers of \(I\) are expressed in terms of the number of generators of \(J\) and the projective dimension of \(S/I\). In general if \(J\) is a monomial ideal minimally generated by \(s\) elements and \(p\) is the projective dimension of \(S/J\) then \(\beta_i(J)\), the \(i\)th Betti number of \(J\), satisfies the following inequalities: \[ {p\choose i+1}\leq \beta_i(J)\leq{s\choose i+1}\;. \] The upper bound is imposed by the Taylor resolution, while the lower bound is a result of \textit{M.\ Brun} and \textit{T.\ Römer} [Commun. Algebra 32, No. 12, 4589--4599 (2004; Zbl 1077.13007)]. It is shown by example that even if the upper bound is achieved for some \(i\) then this is not necessarily the case for all \(i\). Gotzmann ideals are componentwise linear ideals. An ideal is Gotzmann if its graded Betti numbers agree with the graded Betti numbers of the unique lexsegment ideal of \(S\) with the same Hilbert function as \(I\). When \(I\) is monomial and minimally generated by less than \(n\) monomials, then it is shown that the Taylor resolution of \(I\) is minimal if and only if I is Gotzmann. It turns out that if \(I\) is componentwise linear and the maximal bound is achieved for some \(i\) then \(I\) is Gotzmann and the bound is achieved for all \(i\). When \(I\subset (x_1,\ldots, x_n)^2\) and the \(\beta_i(I)\) equals the lower bound for some \(i\) then it equals this bound for all \(j\geq i\). Moreover \(i\) is greater than or equal to the length of maximal regular sequences in \(I\).