Antichains of monomial ideals are finite. (English) Zbl 0984.13013
The main result of the paper is the following: Let \({\mathbf I}\) be an infinite collection of monomial ideals in a polynomial ring. Then there are two ideals \(I,J\in{\mathbf I}\) with \(I\subset J\) (theorem 1.1). With other words, polynomial rings do not contain infinite antichains of monomial ideals. This statement is also true for dual order ideals of \({\mathbb N}^n\) and for the generalized Young’s lattice (theorem 1.2 and 1.3). The main result of the paper implies the following two known facts:
– any polynomial ideal admits only finitely many distinct initial ideals,
– there are only finitely many monomial ideals having the same Hilbert series (corollary 2.1 and 2.2).
The paper finishes with some new, but very technical applications to SAGBI (Subalgebra Analogue to Gröbner Bases for Ideals) and convex polytopes.
– any polynomial ideal admits only finitely many distinct initial ideals,
– there are only finitely many monomial ideals having the same Hilbert series (corollary 2.1 and 2.2).
The paper finishes with some new, but very technical applications to SAGBI (Subalgebra Analogue to Gröbner Bases for Ideals) and convex polytopes.
Reviewer: Joos Heintz (Santander)
MSC:
| 13F20 | Polynomial rings and ideals; rings of integer-valued polynomials |
| 13P10 | Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) |
| 52B20 | Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) |
| 06A06 | Partial orders, general |
References:
| [1] | William W. Adams, Serkan Hoşten, Philippe Loustaunau, and J. Lyn Miller, SAGBI and SAGBI-Gröbner bases over principal ideal domains, J. Symbolic Comput. 27 (1999), no. 1, 31 – 47. · Zbl 0930.13021 · doi:10.1006/jsco.1998.0243 |
| [2] | David Bayer and Ian Morrison, Standard bases and geometric invariant theory. I. Initial ideals and state polytopes, J. Symbolic Comput. 6 (1988), no. 2-3, 209 – 217. Computational aspects of commutative algebra. · Zbl 0675.13014 · doi:10.1016/S0747-7171(88)80043-9 |
| [3] | D. Duffus, M. Pouzet, and I. Rival, Complete ordered sets with no infinite antichains, Discrete Math. 35 (1981), 39 – 52. · Zbl 0466.06002 · doi:10.1016/0012-365X(81)90200-4 |
| [4] | Jonathan D. Farley, 1998. Private communication. |
| [5] | Teo Mora and Lorenzo Robbiano, The Gröbner fan of an ideal, J. Symbolic Comput. 6 (1988), no. 2-3, 183 – 208. Computational aspects of commutative algebra. · Zbl 0668.13017 · doi:10.1016/S0747-7171(88)80042-7 |
| [6] | Tadao Oda. Problems on Minkowski sums of convex lattice polytopes. Preprint. 7 pages. · Zbl 0780.52011 |
| [7] | Bernd Sturmfels, Gröbner bases and convex polytopes, University Lecture Series, vol. 8, American Mathematical Society, Providence, RI, 1996. · Zbl 0856.13020 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
