On Ideals of Minors of Matrices with Indeterminate Entries
نویسنده
چکیده
This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The “generic” case, where all the entries are distinct variables has been studied extensively (cf. [1] and [2] for a thorough account.) While some special cases, such as catalecticant matrices and other 1-generic matrices, have been studied by other authors (e.g., [4]), the general case is not well understood. The main result in the first part of this paper is Theorem 2.3 which gives sufficient conditions for the ideal of minors of a matrix to be prime. This theorem is general enough to include interesting examples, such as the ideal of maximal minors of catalecticant matrices and their generalisations discussed in the second part of the paper. The second aim of this paper is to settle a specific problem raised by David Eisenbud and Frank-Olaf Schreyer (cf. [5]) on the primary decomposition of an ideal of maximal minors. We solve this problem by applying 2.3 together with some ad-hoc techniques. Throughout this paper K shall denote a field. For any matrix M with entries in a ring and any t ≥ 1, It(M) will denote the ideal generated by the t×t minors ofM . The results to be presented here rely on well known properties of determinantal rings which we summarise below:
منابع مشابه
On the Ideal of Minors of Matrices of Linear Forms
The ideals generated by the minors of matrices whose entries are linear forms are not yet well-understood, unless the forms themselves satisfy some strong condition. One has a wealth of information if the matrix is generic, symmetric generic or Hankel; here we tackle 1-generic matrices. We recall the definition of 1-genericity introduced in [E2] by Eisenbud: Let F be a field and X1, . . . , Xs ...
متن کاملOn nest modules of matrices over division rings
Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...
متن کاملMinors of Symmetric and Exterior Powers
We describe some of the determinantal ideals attached to symmetric, exterior and tensor powers of a matrix. The methods employed use elements of Zariski's theory of complete ideals and of representation theory. Let R be a commutative ring. The determinantal ideals attached to matrices with entries in R play ubiquitous roles in the study of the syzygies of R{modules. In this note, we describe so...
متن کاملGeneric graph construction ideals and Greene’s theorem
Let X be an m × n matrix of indeterminates, m ≤ n, and T a new indeterminate. Consider the polynomial rings R0 = K[X] and R = R0[T ]. For a given positive integer t ≤ m, consider the ideal It = It(X) generated by the t-minors (i. e. the determinants of the t× t submatrices) of X . Using all these determinantal ideals, we define a new ideal J in R = R0[T ], which we call the generic graph constr...
متن کاملFree Resolutions and Sparse Determinantal Ideals
A sparse generic matrix is a matrix whose entries are distinct variables and zeros. Such matrices were studied by Giusti and Merle who computed some invariants of their ideals of maximal minors. In this paper we extend these results by computing a minimal free resolution for all such sparse determinantal ideals. We do so by introducing a technique for pruning minimal free resolutions when a sub...
متن کامل