$d$-sequence and Regular sequence of Quadrics
Joydip Saha, Indranath Sengupta, Gurab Tripathi

TL;DR
This paper explores the algebraic structure of ideals generated by 1x1 minors of matrix products, showing how $d$-sequences and regular sequences naturally appear and using this to determine the Rees algebra's defining equations.
Contribution
It demonstrates the emergence of $d$-sequences and regular sequences in generators of specific ideals and computes the defining equations of their Rees algebra.
Findings
Identification of $d$-sequences and regular sequences in ideal generators
Calculation of the Rees algebra's defining equations
Application to ideals generated by 1x1 minors of matrix products
Abstract
Let be a field and , denote matrices such that, the entries of are either indeterminates over or and the entries of are indeterminates over which are different from those appearing in . We consider ideals of the form , which is the ideal generated by the homogeneous polynomials of degree given by the minors of the matrix . We prove that -sequences and regular sequences arise naturally as part of generators of for some special cases. We use this information to calculate the equations defining the Rees algebra of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Coding theory and cryptography · Algebraic structures and combinatorial models
-sequence and Regular sequence of Quadrics
Joydip Saha and Indranath Sengupta and Gaurab Tripathi
Stat-Math Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata 700 108.
Discipline of Mathematics, IIT Gandhinagar, Palaj, Gandhinagar, Gujarat 382355, INDIA.
Department of Mathematics, St.Xavier’s College, 30 Mother Teresa Sarani, Kolkata 700016.
Abstract.
Let be a field and , denote matrices such that, the entries of are either indeterminates over or [math] and the entries of are indeterminates over which are different from those appearing in . We consider ideals of the form , which is the ideal generated by the homogeneous polynomials of degree given by the minors of the matrix . We prove that -sequences and regular sequences arise naturally as part of generators of for some special cases. We use this information to calculate the equations defining the Rees algebra of .
Key words and phrases:
Determinantal Ideals, -sequence, Ideals of linear type, Rees algebra, Gröbner basis, Regular sequence.
2010 Mathematics Subject Classification:
Primary 13C40, 13P10.
The author is supported by the NPDF fellowship PDF/2019/001074, sponsored by the SERB, Government of India.
The second author is the corresponding author; supported by the MATRICS research grant MTR/2018/000420, sponsored by the SERB, Government of India.
1. Introduction
Our study originated from the 1974 paper of J. Herzog [1] on the following theme: Let be a Noetherian commutative ring with identity. Let be a sequence in . Let be an matrix with entries in ; with . A complex was constructed in [1]. Acyclicity conditions on the complex were derived in order to decide perfectness and the Gorenstein property for the ideals and , where , , (when and ) and is the determinant of the matrix obtained from by deleting the -th column (when and ). Our aim in this paper is to study a class of ideals of the form defined through determinantal conditions, which is similar to the aforesaid class studied by Herzog. We show that -sequences and regular sequences occur very naturally in the setting of the ideals , which is the principal object of study in this paper. We show how -sequences occur naturally in Theorems 3.2 and 3.7. In Theorem 4.3 we show the occurrence of a regular sequence which follows an interesting pattern. However, this regular sequence is not a maximal one and the question finding one of maximal length remains open.
Ideals of the form have appeared in another significant work by Huneke and Ulrich [2]. We will use some of their observations for proving some results on -sequences when is alternating, in Theorem 3.7. In this process we would also prove the conjectures proposed in the paper [6].
A sequence of (homogeneous) polynomials in a polynomial ring is called a regular sequence if the ideal and if each is non-zero divisor in , for every . The notion of a -sequence was defined by Huneke (see def 1), which generalizes the notion of a regular sequence.
Let Given an ideal in a Noetherian ring , the Rees algebra of is the -algebra . One can define an -algebra homomorphism as . The map is a graded map of degree [math]. Therefore is generated by homogeneous polynomials in . Generators of are called the equations defining the Rees algebra . Note that the linear polynomials belong to and we say that the ideal is of linear type (a notion introduced by Valla) if is generated by the linear homogeneous polynomials . It was proved independently by C. Huneke and G. Valla, and later generalized by K.N. Raghavan, that, if an ideal is generated by a -sequence then the ideal is of linear type.
2. The ideal
Let , , and and are distinct indeterminates over the field . Let and be generic matrices. Let us write the product of the matrices and as , so that . Let denote the ideal generated by the polynomials , which are the minors of the matrix . Certain properties like primality, primary decomposition and minimal free resolutions have been studied in [5], [4], [3].
It is easy to see that all the ’s defined above do not form a regular sequence. For example, if then shows that is not a regular sequence. However, certain interesting and useful results proved in this direction are the following:
Theorem 2.1**.**
Let denote the polynomial -algebra and are indeterminates over . Suppose that is either generic or generic symmetric and is generic. Let , where . The set forms a regular sequence. Hence, the defining equations of the Rees algebra of are only the Koszul relations , for .
Proof.
See Theorem 6.1 in [5].∎
Theorem 2.2**.**
Let denote the polynomial -algebra and and be generic matrices. Suppose that , where . Let us define the ideals , for , and , where . The ideals and are all prime ideals.
Proof.
See Corollary 3.2, Theorem 3.3 and Theorem 4.4 in[4]. ∎
3. -sequence
Definition 1**.**
[Definition 5.5.2; [7]] Let be a commutative ring. Set . A sequence of elements is said to be a -sequence if
[TABLE]
Let denote the polynomial -algebra and , be generic matrices. Suppose , where . We now prove Theorem 3.2 to show that is a -sequence. This would make the ideal an ideal of linear type and the equations defining its Rees algebra are all linear. In other words, the Rees algebra and the Symmetric algebra of the ideal are isomorphic. We prove the following lemma first:
Lemma 3.1**.**
Let , , and be as above. Let denote the determinant of the matrix obtained by deleting ’th row of for . Then,
- (i)
, for all . 2. (ii)
. 3. (iii)
. 4. (iv)
.
Proof.
(i) For each , we consider the matrix,
[TABLE]
Then we have for all . Expanding with respect to the first column, we get , for all .
(ii) Rearranging terms we get, . Therefore .
(iii) follows from Lemma 6.7 in [5].
(iv) By lemma 4.3 in [4], we have . Let . Since is a prime ideal, we have .∎
Theorem 3.2**.**
Let denote the polynomial -algebra and , be generic matrices. Suppose , where . Let denote the determinant of the matrix obtained by deleting ’th row of for .
- (i)
The sequence forms a -sequence. 2. (ii)
The Rees algebra of is isomorphic to , where is the ideal generated by the set
[TABLE]
Proof.
(i) It is known by Theorem 2.1 that is a regular sequence. Every regular sequence is also a -sequence, therefore it is enough to prove that
[TABLE]
for all , where . By Lemma 6.7 in [5], we have, . Again by Theorem 2.2, the ideals for and are prime ideals. Therefore, we have for all .
(ii) A graded free minimal resolution of can be found in Section 6 of [5], the construction of which uses the mapping cone technique. We now show, how this piece of information can be used to write the first syzygies matrix because no cancellation takes place at that level. We will be able to write the equations defining the Rees algebra if we can write the first syzygy matrix explicitly.
Let , , . Let denote the -th cofactor of the matrix . We have the following diagram of exact chain complexes:
\textstyle{\cdots\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{(R(-n-2))^{\binom{n}{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{\phi_{2n}}$$\scriptstyle{\delta_{2n}}$$\textstyle{(R(-n-1))^{\binom{n}{1}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{\phi_{1n}}$$\scriptstyle{\delta_{1n}}$$\textstyle{R(-n)\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{\phi_{0n}}$$\scriptstyle{\delta_{0n}=\Delta_{n}}$$\textstyle{R/P_{n}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{0}$$\textstyle{\cdots\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{(R(-4))^{\binom{n}{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{d_{2}n}$$\textstyle{(R(-2))^{\binom{n}{1}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{d_{1}n}$$\textstyle{R\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{d_{0n}}$$\textstyle{R/L_{n}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{0}
where
[TABLE]
By Lemma 6.5 in [5], the first box in the above diagram is commutative. It is evident that, for each , the degrees of the domain and the co-domain of do not match. Therefore, a minimal graded free resolution of is obtained by the mapping cone technique:
[TABLE]
where and \,\alpha_{2n}=\left[\begin{array}[]{c|c}-\delta_{1n}&d_{2n}\\ \hline\cr\phi_{1n}&0\end{array}\right]. We now have the following diagram of exact chain complexes:
\textstyle{\cdots\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{(R(-6))^{\binom{n}{2}}\oplus(R(-n-3))^{\binom{n}{1}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{\alpha_{2n}}$$\scriptstyle{\gamma_{2n}}$$\textstyle{R(-4)^{n}\oplus R(-n-2)\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{\alpha_{1n}}$$\scriptstyle{\gamma_{1n}}$$\textstyle{R(-2)\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{\alpha_{0n}}$$\scriptstyle{\gamma_{0n}=g_{n+1}}$$\textstyle{R/T_{n}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{0}$$\textstyle{\cdots\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{(R(-4))^{\binom{n}{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{d_{2}n}$$\textstyle{(R(-2))^{\binom{n}{1}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{d_{1}n}$$\textstyle{R\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{d_{0n}}$$\textstyle{R/L_{n}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{0}
where
[TABLE]
By Lemma 3.1, the first box is commutative in the above diagram. Therefore, a graded free resolution of is given by:
[TABLE]
where and \psi_{2n}=\left[\begin{array}[]{c|c}-\gamma_{1n}&d_{2n}\\ \hline\cr\alpha_{1n}&0\end{array}\right].
We know that the sequence is a -sequence. Therefore, the ideal is of linear type and the syzygy matrix \psi_{2n}=\left[\begin{array}[]{c|c}-\gamma_{1n}&d_{2n}\\ \hline\cr\alpha_{1n}&0\end{array}\right] describes the ideal explicitly.∎
3.1. with alternating .
Given an generic alternating matrix and a generic column matrix , a scheme was proposed for computing a minimal free resolution of the ideal in the paper [6]. However, the scheme depended on two conjectures. We now prove those conjectures in Lemma 3.5 and Lemma 3.6 below. This not only validates our earlier work in [6] but also helps us prove Theorem 3.7 on the -sequence.
We use the same notations as in [6]. Let denote the alternating matrix and denote the generic matrix given by
[TABLE]
With the assumption that , if and , let . Therefore . Let denote the Pffafian of the alternating matrix with the -th row and the -th column deleted.
Lemma 3.3**.**
Let , if and . Then
- (i)
.
- (ii)
.
- (iii)
, for every .
Proof.
These are easy to verify. ∎
Lemma 3.4**.**
* forms a regular sequence for .*
Proof.
See part (ii) of Theorem 2.3 in [4]. ∎
Lemma 3.5**.**
Let and , so that . Let
[TABLE]
If is even, then, and , for every . Hence is a prime ideal for every .
Proof.
At first we note that the ideal
[TABLE]
is a prime ideal by Proposition 5.8 and Lemma 5.12 in [2]. Let . We have , since . Thus . The other inclusion easily follows from Lemma 3.3. ∎
Lemma 3.6**.**
If is odd then , and for every ,
[TABLE]
Proof.
Clearly by the Lemma 3.3. Let . Since , we have .∎
Theorem 3.7**.**
* forms a -sequence for .*
Proof.
We have forms a regular sequence for . Therefore, it is enough to show that, for and ,
[TABLE]
where for all . We have, for every ,
[TABLE]
Let , then . For , the ideal is a prime ideal (see Theorem 3.3 in [4]), therefore . Moreover, for , the ideal is a prime ideal by Lemma 3.5, therefore . ∎
As an upshot of the aforesaid results, we get a primary decomposition of the ideal and somemore information regarding its normality.
Theorem 3.8**.**
The primary decomposition of
[TABLE]
where is the pfaffian of the matrix .
Proof.
Let and . We note that is a prime ideal and by proposition 5.8 and lemma 5.12 in [2], is a prime ideal. Obviously . Let , where . Then . Hence . By lemma 3.3 , therefore . ∎
Corollary 3.9**.**
The ideal is a radical ideal.
Proof.
Follows from Theorem 3.8.∎
Definition 2**.**
Let be a Noetherian ring and an ideal. Then is normally torsionfree if for .
Theorem 3.10**.**
Let be a regular local ring and a reduced ideal. If is normally torsionfree, then is normal.
Proof.
See the Proposition 1.54 in [8].∎
Lemma 3.11**.**
The ideal is normal.
Proof.
Follows from Theorems 3.8 and 3.10.∎
4. Construction of a regular sequence using
Lemma 4.1**.**
Let be such that with respect to a suitable monomial order on the leading terms of them are mutually coprime. Then, is a regular sequence in .
Proof.
. See lemma 2.2 in [4].∎
Lemma 4.2**.**
Let be distinct polynomials and for let be distinct monomials in . Suppose that the following properties are satisfied with respect to some monomial order on :
- (i)
* for every ;* 2. (ii)
* for every ;* 3. (iii)
* for every ;* 4. (iv)
* for every and .*
Let . Then
- (1)
* is a regular sequence.* 2. (2)
Moreover, if is a polynomial such that for and for , then is a regular sequence.
Proof.
(1) The sequence is a regular sequence by the Lemma 4.1. Let , then is coprime with and also coprime with . Again by the Lemma 4.1, we can write is a regular sequence.
Let , therefore
[TABLE]
This gives , since is a regular sequence. Therefore, is a regular sequence.
(2) Let , therefore
[TABLE]
Now is a regular sequence by 4.1; hence .∎
Theorem 4.3**.**
Suppose that , then . The ordered set
[TABLE]
is a regular sequence in . The polynomials occurring in the list follow the pattern indicated below:
[TABLE]
Proof.
Consider the lexicographic monomial order given by
[TABLE]
In order to show that the set is a regular sequence we consider a larger ordered set of polynomials by adding some indeterminates in the list so that they follow the properties listed in Lemma 4.2. The new ordered set of polynomials we consider is
[TABLE]
If we can show that is a regular sequence in this order, then, under any permutation of this order the polynomials would still form a regular sequence because of homogeneity. Therefore, we can rearrange the entries of in such a way that the elements that appear first are the ones listed in and that proves our claim. By Lemma 4.1, is a regular sequence. Using Lemma 4.2 we can add in the list. Therefore, is a regular sequence. The indeterminate does not divide the any of the leading terms of . Therefore, is a regular sequence, by Lemma 4.2. Therefore, is a regular sequence if we continue the same process. The above comment proves that is a regular sequence.∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Herzog, Certain Complexes Associated to a Sequence and a Matrix , Manuscipta Math. 12(1974) 217–248.
- 2[2] C. Huneke and B. Ulrich, Divisor Class Groups and Deformations , American Journal of Mathematics 107(6)(1985)1265–1303.
- 3[3] J. Saha, I. Sengupta, G. Tripathi, Transversal Intersection and Sum of Polynomial Ideals , ar Xiv:1611.04732 v 2 [math.AC] 2018.
- 4[4] J. Saha, I. Sengupta, G. Tripathi, Primary decomposition and normality of certain determinantal ideals , Proc. Indian Acad. Sci. (Math. Sci.) 129:55(2019).
- 5[5] J. Saha, I. Sengupta, G. Tripathi, Ideals of the form I 1 ( X Y ) subscript 𝐼 1 𝑋 𝑌 I_{1}(XY) , Journal of Symbolic Computation 91(2019)17–29.
- 6[6] J. Saha, I. Sengupta, G. Tripathi, Quadrics defined by Skew-Symmetric Matrices , International Journal of Algebra 11(8)(2017) 349 – 356.
- 7[7] I. Swanson, C. Huneke, Integral Closure of Ideals, Rings, and Modules , LMS Lecture Note Series 336. Cambridge University Press, UK, 2006.
- 8[8] W. Vasconcelos, Integral Closure , Springer Monograph in Mathematics, 2005.
