Search arXivSearch

arXiv · 2604.04252

The Bourbaki degree of the syzygy module of 2 $\times$ 4 matrices

Abstract

We introduce and study the Bourbaki degree as a numerical invariant for \(2 \times 4\) matrices $Θ$ of homogeneous polynomials over a polynomial ring \(R = k[x_1, \dots, x_n]\). This invariant, defined via a Bourbaki sequence for the syzygy module \(\operatorname{Syz}(Θ)\), generalizes previous constructions for plane curves and Jacobian matrices. Our main result is an explicit formula expressing the Bourbaki degree in terms of the degrees of the rows, the initial degree of a syzygy, and the first two Hilbert coefficients of the cokernel module \(\mathcal{Q} = \operatorname{coker}(Θ)\). We apply this framework to two important cases. First, matrices with constant first row, which are determined by a three-equigenerated ideal \(J = (f_1, f_2, f_3)\), where we show the Bourbaki degree measures how far \(J\) is from being a perfect ideal, and we completely characterize its smaller and larger values. Second, for a linear matrix, we use the Kronecker--Weierstrass classification to determine all possible Bourbaki degrees and homological types. This classification reveals the existence of a linear matrix with Bourbaki degree equal to 2, a value that does not occur for Jacobian matrices. Finally, in the geometric context of \(\mathbb{P}^3\), we provide a sufficient condition for \(\operatorname{Syz}(Θ)\) to define a codimension one distribution and obtain bounds on the Bourbaki degree when the initial degree is small.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marcos Jardim, Felipe Monteiro, Abbas Nasrollah Nejad. 2026-05-28. The Bourbaki degree of the syzygy module of 2 $\times$ 4 matrices. https://arxiv.org/abs/2604.04252

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On triviality of $\mathbb{A}^2$-forms admitting a nontrivial $\mathbb{G}_a$-action

T. Kambayashi had shown that $\mathbb{A}^2$-forms over separable field extensions are necessarily polynomial rings. However, there exist inseparable $\mathbb{A}^2$-forms which are not necessarily polynomial rings. In this paper, we give a structure theorem for $\mathbb{A}^2$-forms over arbitrary field extensions admitting a nontrivial $\mathbb{G}_a$-action. From this structure theorem we derive some conditions under which an $\mathbb{A}^2$-form becomes trivial. In particular, we prove that over a field $k$, a factorial $\mathbb{A}^2$-form having a $k$-rational point and a non-trivial $\mathbb{G}_a$-action is trivial and we also give examples demonstrating that none of these hypotheses can be discarded. As a consequence of the structure theorem, we obtain a generalization of the Zariski Cancellation Theorem for the affine plane over an arbitrary field.

math.AC

Symbolic powers of the ideal of$n$ general points in $P^{n-1}$

Problem L of Fröberg--Lundqvist--Oneto--Shapiro asks for the difference between the Hilbert series of ordinary and symbolic powers of the ideal of general points in projective space. We solve this completely for \(n\) general points of \(\PP^{n-1}\). Besides a closed formula for \[ \HS(S/I^m)-\HS(S/I^{(m)}), \] we determine all minimal monomial generators of \(I^{(m)}\), and describe the symbolic Rees algebra. We also show that containment \(I^{(m)}\subseteq I^r\) is detected solely by initial degrees. This gives the exact containment threshold, the Waldschmidt constant \(\walpha\), the resurgence \(\Res\), and the asymptotic resurgence \(\aRes\): \[ \walpha(I)=\frac{n}{n-1}, \qquad \Res(I)=\aRes(I)=\frac{2(n-1)}{n}. \] We also take the first step beyond \(n\) points: for \(n+1\) general points of \(\PP^{n-1}\) --- again a rigid, non-monomial configuration --- we identify the defining quadrics, resolve the case \(n=3\) completely (a complete intersection, with \(J^{(m)}=J^m\) for all \(m\) and resurgence \(1\)), and propose an exact Waldschmidt-constant formula \(\walpha=\frac{n+1}{n-1}\) for all \(n\), verified computationally in every case we could check.

math.AC