geometric and combinatorial aspects of commutative algebra
geometric and combinatorial aspects of commutative algebra
edited by Jürgen Herzog Universität Essen Essen, Germany
Gaetana Restuccia Università di Messina Messina, Italy
Marcel Dekker, Inc.
New York • Basel
TM
Copyright © 2001 by Marcel Dekker, Inc. All Rights Reserved.
ISBN: 0-8247-0567-X
This book is printed on acid-free paper.
Headquarters Marcel Dekker, Inc. 270 Madison Avenue, New York, NY 10016 tel: 212-696-9000; fax: 212-685-4540
Eastern Hemisphere Distribution Marcel Dekker AG Hutgasse 4, Postfach 812, CH-400I Basel, Switzerland tel: 41-61-261-8482; fax: 41-61-261-8896
World Wide Web http://www.dekker.com The publisher offers discounts on this book when ordered in bulk quantities. For more information,
write to Special Sales/Professional Marketing at the headquarters address above.
Copyright © 2001 by Marcel Dekker, Inc. All Rights Reserved.
Neither this book nor any part may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, microfilming, and recording, or by any information storage and retrieval system, without permission in writing from the publisher. Current printing (last digit):
10 9 8 7 6 5 4 3 2 1 PRINTED IN THE UNITED STATES OF AMERICA
PURE AND APPLIED MATHEMATICS A Program of Monographs, Textbooks, and Lecture Notes
EXECUTIVE EDITORS Earl J. Taft Rutgers University New Brunswick, New Jersey
Zuhair Nashed University of Central Florida Orlando, Florida
EDITORIAL BOARD M. S. Baouendi University of California, San Diego Jane Cronin Rutgers University Jack K. Hale Georgia Institute of Technology
Anil Nerode Cornell University Donald Passman University of Wisconsin, Madison Fred S. Roberts Rutgers University
S. Kobayashi University of California, Berkeley
David L. Russell Virginia Polytechnic Institute and State University
Marvin Marcus University of California, Santa Barbara
Walter Schempp Universität Siegen
W. S. Massey Yale University
Mark Teply University of Wisconsin, Milwaukee
LECTURE NOTES IN PURE AND APPLIED MATHEMATICS
1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50. 51. 52. 53. 54. 55. 56. 57. 58. 59. 60.
N. Jacobson, Exceptional Lie Algebras L.-Å. Lindahl and F. Poulsen, Thin Sets in Harmonic Analysis I. Satake, Classification Theory of Semi-Simple Algebraic Groups F. Hirzebruch et al., Differentiable Manifolds and Quadratic Forms I. Chavel, Riemannian Symmetric Spaces of Rank One R. B. Burckel, Characterization of C(X) Among Its Subalgebras B. R. McDonald et al., Ring Theory Y.-T. Siu, Techniques of Extension on Analytic Objects S. R. Caradus et al., Calkin Algebras and Algebras of Operators on Banach Spaces E. O. Roxin et al., Differential Games and Control Theory M. Orzech and C. Small, The Brauer Group of Commutative Rings S. Thomier, Topology and Its Applications J. M. Lopez and K. A. Ross, Sidon Sets W. W. Comfort and S. Negrepontis, Continuous Pseudometrics K. McKennon and J. M. Robertson, Locally Convex Spaces M. Carmeli and S. Malin, Representations of the Rotation and Lorentz Groups G. B. Seligman, Rational Methods in Lie Algebras D. G. de Figueiredo, Functional Analysis L. Cesari et al., Nonlinear Functional Analysis and Differential Equations J. J. Schäffer, Geometry of Spheres in Normed Spaces K. Yano and M. Kon, Anti-Invariant Submanifolds W. V. Vasconcelos, The Rings of Dimension Two R. E. Chandler, Hausdorff Compactifications S. P. Franklin and B. V. S. Thomas, Topology S. K. Jain, Ring Theory B. R. McDonald and R. A. Morris, Ring Theory II R. B. Mura and A. Rhemtulla, Orderable Groups J. R. Graef, Stability of Dynamical Systems H.-C. Wang, Homogeneous Branch Algebras E. O. Roxin et al., Differential Games and Control Theory II R. D. Porter, Introduction to Fibre Bundles M. Altman, Contractors and Contractor Directions Theory and Applications J. S. Golan, Decomposition and Dimension in Module Categories G. Fairweather, Finite Element Galerkin Methods for Differential Equations J. D. Sally, Numbers of Generators of Ideals in Local Rings S. S. Miller, Complex Analysis R. Gordon, Representation Theory of Algebras M. Goto and F. D. Grosshans, Semisimple Lie Algebras A. I. Arruda et al., Mathematical Logic F. Van Oystaeyen, Ring Theory F. Van Oystaeyen and A. Verschoren, Reflectors and Localization M. Satyanarayana, Positively Ordered Semigroups D. L Russell, Mathematics of Finite-Dimensional Control Systems P.-T. Liu and E. Roxin, Differential Games and Control Theory III A. Geramita and J. Seberry, Orthogonal Designs J. Cigler, V. Losert, and P. Michor, Banach Modules and Functors on Categories of Banach Spaces P.-T. Liu and J. G. Sutinen, Control Theory in Mathematical Economics C. Byrnes, Partial Differential Equations and Geometry G. Klambauer, Problems and Propositions in Analysis J. Knopfmacher, Analytic Arithmetic of Algebraic Function Fields F. Van Oystaeyen, Ring Theory B. Kadem, Binary Time Series J. Barros-Neto and R. A. Artino, Hypoelliptic Boundary-Value Problems R. L. Sternberg et al., Nonlinear Partial Differential Equations in Engineering and Applied Science B. R. McDonald, Ring Theory and Algebra III J. S. Golan, Structure Sheaves Over a Noncommutative Ring T. V. Narayana et al., Combinatorics, Representation Theory and Statistical Methods in Groups T. A. Burton, Modeling and Differential Equations in Biology K. H. Kim and F. W. Roush, Introduction to Mathematical Consensus Theory J. Banas and K. Goebel, Measures of Noncompactness in Banach Spaces
61. 62. 63. 64. 65. 66. 67. 68. 69. 70. 71. 72. 73. 74. 75. 76. 77. 78. 79. 80. 81. 82. 83. 84. 85. 86. 87. 88. 89. 90. 91. 92. 93. 94. 95. 96. 97. 98. 99. 100. 101. 102. 103. 104. 105. 106. 107. 108. 109. 110. 111. 112. 113. 114. 115. 116. 117. 118. 119. 120. 121. 122.
O. A. Nielson, Direct Integral Theory J. E. Smith et al., Ordered Groups J. Cronin, Mathematics of Cell Electrophysiology J. W. Brewer, Power Series Over Commutative Rings P. K. Kamthan and M. Gupta, Sequence Spaces and Series T. G. McLaughlin, Regressive Sets and the Theory of Isols T. L. Herdman et al., Integral and Functional Differential Equations R. Draper, Commutative Algebra W. G. McKay and J. Patera, Tables of Dimensions, Indices, and Branching Rules for Representations of Simple Lie Algebras R. L. Devaney and Z. H. Nitecki, Classical Mechanics and Dynamical Systems J. Van Geel, Places and Valuations in Noncommutative Ring Theory C. Faith, Injective Modules and Injective Quotient Rings A. Fiacco, Mathematical Programming with Data Perturbations I P. Schultz et al., Algebraic Structures and Applications L Bican et al., Rings, Modules, and Preradicals D. C. Kay and M. Breen, Convexity and Related Combinatorial Geometry P. Fletcher and W. F. Lindgren, Quasi-Uniform Spaces C.-C. Yang, Factorization Theory of Meromorphic Functions O. Taussky, Ternary Quadratic Forms and Norms S. P. Singh and J. H. Burry, Nonlinear Analysis and Applications K. B. Hannsgen et al., Volterra and Functional Differential Equations N. L. Johnson et al., Finite Geometries G. I. Zapata, Functional Analysis, Holomorphy, and Approximation Theory S. Greco and G. Valla, Commutative Algebra A. V. Fiacco, Mathematical Programming with Data Perturbations II J.-B. Hiriart-Urruty et al., Optimization A. Figa Talamanca and M. A. Picardello, Harmonic Analysis on Free Groups M. Harada, Factor Categories with Applications to Direct Decomposition of Modules V. I. Istra'tescu, Strict Convexity and Complex Strict Convexity V. Lakshmikantham, Trends in Theory and Practice of Nonlinear Differential Equations H. L. Manocha and J. B. Srivastava, Algebra and Its Applications D. V. Chudnovsky and G. V. Chudnovsky, Classical and Quantum Models and Arithmetic Problems J. W. Longley, Least Squares Computations Using Orthogonalization Methods L. P. de Alcantara, Mathematical Logic and Formal Systems C. E. Aull, Rings of Continuous Functions R. Chuaqui, Analysis, Geometry, and Probability L. Fuchs and L. Salce, Modules Over Valuation Domains P. Fischer and W. R. Smith, Chaos, Fractals, and Dynamics W. B. Powell and C. Tsinakis, Ordered Algebraic Structures G. M. Rassias and T. M. Rassias, Differential Geometry, Calculus of Variations, and Their Applications R.-E. Hoffmann and K. H. Hofmann, Continuous Lattices and Their Applications J. H. Lightbourne III and S. M. Rankin III, Physical Mathematics and Nonlinear Partial Differential Equations C. A. Baker and L. M. Batten, Finite Geometrics J. W. Brewer et al., Linear Systems Over Commutative Rings C. McCrory and T. Shifrin, Geometry and Topology D. W. Kueke et al., Mathematical Logic and Theoretical Computer Science B.-L. Lin and S. Simons, Nonlinear and Convex Analysis S. J. Lee, Operator Methods for Optimal Control Problems V. Lakshmikantham, Nonlinear Analysis and Applications S. F. McCormick, Multigrid Methods M. C. Tangora, Computers in Algebra D. V. Chudnovsky and G. V. Chudnovsky, Search Theory D. V. Chudnovsky and R. D. Jenks, Computer Algebra M. C. Tangora, Computers in Geometry and Topology P. Nelson et al., Transport Theory, Invariant Imbedding, and Integral Equations P. Clément et al., Semigroup Theory and Applications J. Vinuesa, Orthogonal Polynomials and Their Applications C. M. Dafermos et al., Differential Equations E. O. Roxin, Modern Optimal Control J. C. Díaz, Mathematics for Large Scale Computing Ú P. S. Milojevic, Nonlinear Functional Analysis C. Sadosky, Analysis and Partial Differential Equations
123. 124. 125. 126. 127. 128. 129. 130. 131. 132. 133. 134. 135. 136. 137. 138. 139. 140. 141. 142. 143. 144. 145. 146. 147. 148. 149. 150. 151. 152. 153. 154. 155. 156. 157. 158. 159. 160. 161. 162. 163. 164. 165. 166. 167. 168. 169. 170. 171. 172. 173. 174. 175. 176. 177. 178. 179. 180. 181. 182. 183.
R. M. Shortt, General Topology and Applications R. Wong, Asymptotic and Computational Analysis D. V. Chudnovsky and R. D. Jenks, Computers in Mathematics W. D. Wallis et al., Combinatorial Designs and Applications S. Elaydi, Differential Equations G. Chen et al., Distributed Parameter Control Systems W. N. Everitt, Inequalities H. G. Kaper and M. Garbey, Asymptotic Analysis and the Numerical Solution of Partial Differential Equations O. Arino et al., Mathematical Population Dynamics S. Coen, Geometry and Complex Variables J. A. Goldstein et al., Differential Equations with Applications in Biology, Physics, and Engineering S. J. Andima et al., General Topology and Applications P Clément et al., Semigroup Theory and Evolution Equations K. Jarosz, Function Spaces J. M. Bayod et al., p-adic Functional Analysis G. A. Anastassiou, Approximation Theory R. S. Rees, Graphs, Matrices, and Designs G. Abrams et al., Methods in Module Theory G. L. Mullen and P. J.-S. Shiue, Finite Fields, Coding Theory, and Advances in Communications and Computing M. C. Joshi and A. V. Balakrishnan, Mathematical Theory of Control G. Komatsu and Y. Sakane, Complex Geometry I. J. Bakelman, Geometric Analysis and Nonlinear Partial Differential Equations T. Mabuchi and S. Mukai, Einstein Metrics and Yang–Mills Connections L. Fuchs and R. Göbel, Abelian Groups A. D. Pollington and W. Moran, Number Theory with an Emphasis on the Markoff Spectrum G. Dore et al., Differential Equations in Banach Spaces T. West, Continuum Theory and Dynamical Systems K. D. Bierstedt et al., Functional Analysis K. G. Fischer et al., Computational Algebra K. D. Elworthy et al., Differential Equations, Dynamical Systems, and Control Science P.-J. Cahen, et al., Commutative Ring Theory S. C. Cooper and W. J. Thron, Continued Fractions and Orthogonal Functions P. Clément and G. Lumer, Evolution Equations, Control Theory, and Biomathematics M. Gyllenberg and L. Persson, Analysis, Algebra, and Computers in Mathematical Research W. O. Bray et al., Fourier Analysis J. Bergen and S. Montgomery, Advances in Hopf Algebras A. R. Magid, Rings, Extensions, and Cohomology N. H. Pavel, Optimal Control of Differential Equations M. Ikawa, Spectral and Scattering Theory X. Liu and D. Siegel, Comparison Methods and Stability Theory J.-P. Zolésio, Boundary Control and Variation M. Kr'íz''ek et al., Finite Element Methods G. Da Prato and L. Tubaro, Control of Partial Differential Equations E. Ballico, Projective Geometry with Applications M. Costabel et al., Boundary Value Problems and Integral Equations in Nonsmooth Domains G. Ferreyra, G. R. Goldstein, and F. Neubrander, Evolution Equations S. Huggett, Twistor Theory H. Cook et al., Continua D. F. Anderson and D. E. Dobbs, Zero-Dimensional Commutative Rings K. Jarosz, Function Spaces V. Ancona et al., Complex Analysis and Geometry E. Casas, Control of Partial Differential Equations and Applications N. Kalton et al., Interaction Between Functional Analysis, Harmonic Analysis, and Probability Z. Deng et al., Differential Equations and Control Theory P. Marcellini et al. Partial Differential Equations and Applications A. Kartsatos, Theory and Applications of Nonlinear Operators of Accretive and Monotone Type M. Maruyama, Moduli of Vector Bundles A. Ursini and P. Aglianò, Logic and Algebra X. H. Cao et al., Rings, Groups, and Algebras D. Arnold and R. M. Rangaswamy, Abelian Groups and Modules S. R. Chakravarthy and A. S. Alfa, Matrix-Analytic Methods in Stochastic Models
184. J. E. Andersen et al., Geometry and Physics
185. 186. 187. 188. 189. 190. 191. 192. 193. 194. 195. 196. 197. 198. 199. 200. 201. 202. 203. 204. 205. 206. 207. 208. 209. 210. 211. 212. 213. 214. 215. 216. 217. 218. 219. 220. 221. 222. 223. 224. 225. 226. 227. 228. 229. 230. 231. 232. 233.
P.-J. Cahen et al., Commutative Ring Theory J. A. Goldstein et al., Stochastic Processes and Functional Analysis A. Sorbi, Complexity, Logic, and Recursion Theory G. Da Prato and J.-P. Zolésio, Partial Differential Equation Methods in Control and Shape Analysis D. D. Anderson, Factorization in Integral Domains N. L. Johnson, Mostly Finite Geometries D. Hinton and P. W. Schaefer, Spectral Theory and Computational Methods of Sturm–Liouville Problems W. H. Schikhof et al., p-adic Functional Analysis S. Sertöz, Algebraic Geometry G. Caristi and E. Mitidieri, Reaction Diffusion Systems A. V. Fiacco, Mathematical Programming with Data Perturbations M. Kr'íz''ek et al., Finite Element Methods: Superconvergence, Post-Processing, and A Posteriori Estimates S. Caenepeel and A. Verschoren, Rings, Hopf Algebras, and Brauer Groups V. Drensky et al., Methods in Ring Theory W. B. Jones and A. Sri Ranga, Orthogonal Functions, Moment Theory, and Continued Fractions P. E. Newstead, Algebraic Geometry D. Dikranjan and L. Salce, Abelian Groups, Module Theory, and Topology Z. Chen et al., Advances in Computational Mathematics X. Caicedo and C. H. Montenegro, Models, Algebras, and Proofs C. Y. Yéldérém and S. A. Stepanov, Number Theory and Its Applications D. E. Dobbs et al., Advances in Commutative Ring Theory F. Van Oystaeyen, Commutative Algebra and Algebraic Geometry J. Kakol et al., p-adic Functional Analysis M. Boulagouaz and J.-P. Tignol, Algebra and Number Theory S. Caenepeel and F. Van Oystaeyen, Hopf Algebras and Quantum Groups F. Van Oystaeyen and M. Saorin, Interactions Between Ring Theory and Representations of Algebras R. Costa et al., Nonassociative Algebra and Its Applications T.-X. He, Wavelet Analysis and Multiresolution Methods H. Hudzik and L. Skrzypczak, Function Spaces: The Fifth Conference J. Kajiwara et al., Finite or Infinite Dimensional Complex Analysis G. Lumer and L. Weis, Evolution Equations and Their Applications in Physical and Life Sciences J. Cagnol et al., Shape Optimization and Optimal Design J. Herzog and G. Restuccia, Geometric and Combinatorial Aspects of Commutative Algebra G. Chen et al., Control of Nonlinear Distributed Parameter Systems F. Ali Mehmeti et al., Partial Differential Equations on Multistructures D. D. Anderson and I. J. Papick, Ideal Theoretic Methods in Commutative Algebra Á. Granja et al., Ring Theory and Algebraic Geometry A. K. Katsaras et al., p-adic Functional Analysis R. Salvi, The Navier-Stokes Equations F. U. Coelho and H. A. Merklen, Representations of Algebras S. Aizicovici and N. H. Pavel, Differential Equations and Control Theory G. Lyubeznik, Local Cohomology and Its Applications G. Da Prato and L. Tubaro, Stochastic Partial Differential Equations and Applications W. A. Carnielli et al., Paraconsistency A. Benkirane and A. Touzani, Partial Differential Equations A. Illanes et al., Continuum Theory M. Fontana et al., Commutative Ring Theory and Applications D. Mond and M. J. Saia, Real and Complex Singularities V. Ancona and J. Vaillant, Hyperbolic Differential Operators
Additional Volumes in Preparation
Preface
This volume contains research papers based on lectures delivered at the International Conference "Commutative Algebra and Algebraic Geometry," held in Messina, Italy. Altogether 116 mathematicians from Europe, the United States, Japan, India, Korea, Brazil, Senegal, and from all parts of Italy attended the meeting. One traditional research subject at the University of Messina is commutative algebra. The motivation to organize this meeting was to celebrate this tradition and to further promote this area of mathematics in Sicily. In recent years combinatorial and computational methods found successful applications in commutative algebra and algebraic geometry. One aim of this book is to focus on this development, but also to present new trends in singularity and tight closure theory, the theory of projective schemes and the geometry of curves in Pn. The present volume is directed to university teachers as well as to graduate students and is intended to stimulate further research in these topics. We would like to thank many public and private institutions for their support and enthusiasm, which made it possible to organize this congress, among them the MURST (National project Algebra Commutativa Geometria Algebrica e Aspetti Computazionali), the University of Messina, the Presidenza della Regione Siciliana, the CNR, the Fondation Bonino Pulejo of Messina, and the Faculty of Ingineering of the University of Reggio Calabria. We also would like to thank the Faculty of Sciences of the University of Messina for providing the required facilities during the conference, and the Centre di Spiritualita S. Tommaso di Messina for granting hospitality to many participants of the conference. We are grateful to the Scientific Committee consisting of Prof. Takayuki Hibi (Osaka University), Prof. Lawrence Ein (Illinois University), Prof. Hamet Seydi (Universite de Dakar), Prof. Rosario Strano (University of Catania), Prof. Paolo Valabrega (Politecnico di Torino), and Prof. Wolmer Vasconcelos (Rutgers University) for its cooperation, and we wish to thank all contributors and participants for their active collaboration, as well as all the referees for their help. Our thanks go also to all local organizers: Vittoria Bonanzinga, Marilena Crupi, Maurizio Imbesi, Rosanna Utano and the students of the doctorat Sabina Buono, Anna Maria Giordano, Maria Fortuna Paratore, and Giancarlo Rinaldo for their help during the meeting. In particular, we would like to thank iii
Preface
Giancarlo Rinaldo for his help in the preparation of the meeting. Special thanks go to Rosanna Utano, who spent a lot of energy and passion in the preparation of this book.
Jiirgen Herzog
Gaetana Restuccia
Contents
Preface Contributors Participants 1.
On Free Complete Intersections Margherita Barile, Marcel Morales, and Apostolos Thorna
2.
On the Number of Ideals of Finite Colength Valentina Barucci and RalfFroberg
3.
Realizable Sequences Linked to the Hilbert Function of a 0-Dimensional Protective Scheme Giannina Beccari and Carlo Massaza
4.
5.
iii ix xiii 1
11
21
Lexsegment Ideals in the Exterior Algebra Vittoria Bonanzinga
43
On the Equations Defining Toric Projective Varieties
57
Emilio Briales Morales, Antonio Campillo Lopez, and Pilar Pison Casares 6.
KRS and Determinantal Ideals Winfried Bruns and Aldo Conca
67
1.
The Koszul Complex in Projective Dimension One Winfried Bruns and Udo Vetter
89
8.
Grobner Bases as Characteristic Sets Giuseppa Carra'Ferro
99
9.
Threefolds with Degenerate Secant Variety: On a Theorem of G. Scorza L. Chiantini and C. Ciliberto
10. The Unirationality of All Conic Bundles Implies the Unirationality of the Quartic Threefold
Alberto Conte (with an Appendix by M. Marchisio)
111
125
Contents
11.
Gaussian Ideals and the Dedekind-Mertens Lemma Alberto Corso and Sarah Glaz
131
12. Depth Formulas for Certain Graded Modules Associated to a Filtration: A Survey T. Cortadellas and S. Zarzuela
145
13. Extremal Betti Numbers of Lexsegment Ideals
159
Marilena Crupi and Rosanna Utano 14. Local Monomialization Steven Dale Cutkosky
165
15.
175
Isomorphism of Complexes and Lifts Steven Dale Cutkosky and Hema Srinivasan
16. Weil Divisors on Rational Normal Scrolls Rita Ferraro
183
17. Families of Wronskian Correspondences
199
Letterio Gatto 18. A Note on Hodge's Postulation Formula for Schubert Varieties Sudhir R. Ghorpade
211
19.
221
Unimodular Rows and Subintegral Extensions
Joseph Gubeladze 20. On Commutative FGS-Rings with Ascending Condition on Annihilators
227
Cheikh Thiecoumba Gueye and S. Mamadou Sanghare 21.
Cohen-Macaulay F-Injective Homomorphisms Mitsuyasu Hashimoto
231
22. Valuations of Ideals, Evolutions and the Vanishing of Cohomology Groups Reinhold Hiibl and Anton Rechenauer
245
23.
259
On Integral Schemes of Vector Fields Ernst Kunz
24. Roberts Rings and Dutta Multiplicities
273
Kazuhiko Kurano 25. Hilbert Functions of Squarefree Veronese Subrings Hiroyuki Nishida, Hidefumi Ohsugi, and Takayuki Hibi 26.
On the Conductor of a Surface at a Point Whose Projectivized Tangent Cone Is a Generic Union of Lines Ferruccio Orecchia
289
301
Contents
vii
27. Lifting Problem for Codimension Two Subvarieties in Pn+2: Border Cases Margherita Roggero
309
28. Rank Two Bundles and Reflexive Sheaves on P3 and Corresponding Curves: An Overview Margherita Roggero, Paolo Valabrega, and Mario Valenzano
327
29. On the Structure of Ext Groups of Strongly Stable Ideals Enrico Sbarra
345
30. An Introduction to Tight Closure
353
Karen E. Smith 31.
Eisenbud-Goto Inequality for Stanley-Reisner Rings Naoki Terai
379
Contributors
Margherita Barile Universita degli Studi di Bari, Bari, Italy Valentina Barucci Universita "La Sapienza," Rome, Italy Giannina Beccari Politecnico di Torino, Torino, Italy Vittoria Bonanzinga University of Reggio Calabria, Reggio Calabria, Italy Winfried Bruns University of Osnabriick, Osnabriick, Germany Antonio Campillo Lopez
University of Valladolid, Valladolid, Spain
Giuseppa Carra' Ferro University of Catania, Catania, Italy Pilar Pison Casares University of Seville, Seville, Spain
L. Chiantini University of Siena, Siena, Italy C. Ciliberto Universita di Roma Tor Vergata, Rome, Italy Aldo Conca University of Sassari, Sassari, Italy Alberto Conte Universita degli Studi di Torino, Torino, Italy Alberto Corso University of Kentucky, Lexington, Kentucky T. Cortadellas University of Barcelona, Barcelona, Spain Marilena Crupi University of Messina, Messina, Italy Steven Dale Cutkosky University of Missouri-Columbia, Columbia, Missouri Rita Ferraro Universita di Roma "Tor Vergata," Rome, Italy
Ralf Froberg Stockholms Universitet, Stockholm, Sweden Letterio Gatto Politecnico di Torino, Torino, Italy ix
x
Contributors
Sudhir R. Ghorpade Sarah Glaz
Indian Institute of Technology, Bombay, India
University of Connecticut, Storrs, Connecticut
Joseph Gubeladze A. Razmadze Mathematical Institute, Tbilisi, Georgia Cheikh Thiecoumba Gueye
Universite Cheikh Anta Diop, Dakar, Senegal
Mitsuyasu Hashimoto Nagoya University, Nagoya, Japan Takayuki Hibi
Osaka University, Osaka, Japan
Reinhold Hiibl
University of Regensburg, Regensburg, Germany
Ernst Kunz
University of Regensburg, Regensburg, Germany
Kazuhiko Kurano Tokyo Metropolitan University, Tokyo, Japan Carla Massaza
Politecnico di Torino, Torino, Italy
Eniilio Briales Morales
Marcel Morales
University of Sevilla, Seville, Spain
University of Grenoble I, Institut Fourier, Lyon, France
Hiroyuki Nishida
Osaka University, Osaka, Japan
Hidefumi Ohsugi Osaka University, Osaka, Japan Ferruccio Orecchia
Complesso Universitario di Monte S. Angelo, Naples,
Italy Anton Rechenauer University of Regensburg, Regensburg, Germany Margherita Roggero University of Torino, Torino, Italy
Mamadou Sanghare Enrico Sbarra
Universite Cheikh Anta Diop, Dakar, Senegal
Universitat GH-essen, Essen, Germany
Karen E. Smith University of Michigan, Ann Arbor, Michigan Hema Srinivasan University of Missouri—Columbia, Columbia, Missouri
Naoki Terai Faculty of Culture and Education, Saga University, Saga, Japan Apostolos Thoma University of loannina, loannina, Greece Paolo Valabrega Politecnico di Torino, Torino, Italy Mario Valenzano Politecnico di Torino, Torino, Italy
Contributors
Udo Vetter Universitat Oldenburg, Oldenburg, Germany S. Zarzuela University of Barcelona, Barcelona, Spain
xi
Participants
• ARAMOVA Annetta Universitat Essen, Germany,
[email protected]
• ARENA Roberto Via Raimondi, 17 - Messina, Italy,
[email protected]
• ARTALE Maria Universita di Roma, Tor Vergata, Italy,
[email protected]
• BARILE Margherita Universita di Bari, Italy,
[email protected] • BARRY Mamadou Dept. Maths et Info. FST, Universite de Dakar, Senegal,
[email protected]
• BARUCCI Valentina Universita di Roma "La Sapienza", Italy,
[email protected]
• BASS Hyman Columbia University, New York - USA,
[email protected] • BECCARI Giannina Politecnico di Torino, Italy,
[email protected]
• BLICKLE Manuel University of Michigan, USA,
[email protected]
• SLUM Stefan Universitat Essen, Germany,
[email protected] • BONANZINGA Vittoria Universita di Reggio Calabria, Italy,
[email protected],
[email protected]
• BRUNS Winfried University of Osnabruck, Germany,
[email protected] • BUCHSBAUM David A. Brandeis University, Waltham, MA - USA,
[email protected] • BUONO Maria Sabina Universita di Messina, Italy,
[email protected]
. CALABRI Alberto Universita di Roma "La Sapienza", Italy,
[email protected]
• CALAPSO Maria Teresa
Universita di Messina, Italy,
[email protected]
xiii
xiv
Participants
• CARINI Luisa Universita di Palermo, Italy,
[email protected] • CARISTI Giuseppe Via Pozzo Giudeo, Torre Faro - Messina, Italy,
[email protected]
• CARRA FERRO Giuseppa
Universita di Catania, Italy,
[email protected] . CAVALIERE Maria Pia Universita di Geneva, Italy,
[email protected]
• CHIANTINI Luca Universita di Siena, Italy,
[email protected] • CHO Young Hyun Dept. of Maths, National University, Seoul, Korea,
[email protected] . CHRISTENSEN Lars Winther
University of Copenhagen, Denmark,
[email protected]
• CILIBERTO Giro Universita di Roma , Tor Vergata, Italy,
[email protected]
• CIOLLI Fabio Olevano Romano (Roma), Italy,
[email protected]
« CONCA Aldo Universita di Genova, Italy,
[email protected] • CONTE Alberto Universita di Torino, Italy,
[email protected]
• CONTESSA Maria Universita di Palermo, Italy
• CREA Rosa Giovanna Via Quarnaro, Trav. I Ramirez, 27 - Gallico (RC), Italy
• CRUCITTI Angelica Via Sbarre C.li, Trav. II Ferr., 12 - Reggio Calabria, Italy • CRUPI Marilena Universita di Messina, Italy,
[email protected] • CUFARI Adelaide Vill. Annunziata Conca D'Oro, Messina, Italy,
[email protected]
• CUMINO Caterina Politecnico di Torino, Italy,
[email protected]
Participants • CUTKOSKY Dale S. University of Missouri, USA,
[email protected]
• DE FILIPPIS Vincenzo Via Conte D'Apice, 7 - Vibo Valentia, Italy,
[email protected]
• DE NEGRI Emanuela Universita di Genova, Italy,
[email protected] • DIANKHA Oumar Dept. Maths et Info. FST, Universit de Dakar, Senegal,
[email protected]
• DONATO Santi Universita di Messina, Italy • EIN Lawrence Illinois University,
[email protected]
• ELIAS Juan Universitat de Barcelona, Spain,
[email protected]
• FERRARA Massimiliano Universita di Messina, Italy,
[email protected] • FERRARO Maria Rita Universita di Roma, Tor Vergata, Italy,
[email protected]
• FIORENTINI Mario Universita di Ferrara, Italy
• FLACCOMIO Simona Via S. Sebastiano, 15 - Messina, Italy,
[email protected]
• FRANKILD Anders Matematisk Afdeling, Copenhagen, Denmark,
[email protected]
• FROBERG Ralf University of Stockholm, Sweden,
[email protected]
• GATTO Letterio Universidade Federal de Pernambuco, Brazil,
[email protected],
[email protected]
• GERAMITA Anthony V. Universita di Genova, Italy,
[email protected] • GERMANA Clara Via S. Caterina dei Bottegai, 8 - Messina, Italy,
[email protected]
• GHORPADE Sudhir Indian Institute of Technology - Bombay, India, ghoparde@
[email protected]
xv
xvi
Participants
• GIORDANO Anna Maria Universita, di Messina, Italy,
[email protected]
• GIUFFRIDA Salvatore Universita di Catania, Italy
• GLAZ Sarah University of Connecticut, USA,
[email protected]
• GUARDO Elena Universita, di Catania, Italy
• GUBELADZE Joseph Georgian Academy of Sciences - Tbilisi, Georgia,
[email protected]
• GUEYE Cheikh Thiecoumba Dept. Maths et Info. FST, Universit de Dakar, Senegal,
[email protected]
• HASHIMOTO Mitsuyasu Nagoya University, Japan,
[email protected] . HREINSDOTTIR Freyja Stockholm University, Sweden,
[email protected]
. HUBL Reinhold Umversitat Regensburg, Germany,
[email protected]
• IARROBINO Anthony
[email protected]
• IMBESI Maurizio Universita di Messina, Italy,
[email protected] • IONESCU Cristodor Romanian Academy of Sciences, Bucarest, Romania,
[email protected] • IORFIDA Vincenzo Contrada Maurizio 10, Lamezia Terme, Italy,
[email protected]
• KUNZ Ernst Universitat Regensburg, Germany,
[email protected]
• KURANO Kazuhiko Tokyo Metropolitan University, Japan,
[email protected]
• LA BARBIERA Monica Via Peschiera, 23 - Messina, Italy
• LI MARZI Enzo Universita di Messina, Italy,
[email protected]
Participants
xvii
• MAGGIONI Renato Universita di Catania, Italy,
[email protected] • MARCHISIO Marina Universita di Torino, Italy,
[email protected]
• MARINARI Maria Grazia Universita di Geneva, Italy,
[email protected] • MOLICA BISCI Giovanni Via Passoforno - Piraino (ME), Italy,
[email protected]
• NAKAMURA Yukio Meiji University, Higasimita, Japan,
[email protected]
• NASTOLD Hans-Joachim Mathematisches Institut, Miinster, Germany,
[email protected]
• NISHIMURA Jun-ichi Hokkaido University of Education, Sapporo, Japan,
[email protected]
• OHSUGI Hidefumi Osaka University, Japan,
[email protected] • ORRCCHIA Ferruccio Universita di Napoli, Italy,
[email protected] • PAENG Seong-Hun(non e chiaro se e venuto) Korea Institute for Advanced Study, Seoul, Korea,
[email protected] • PANTI Giovanni Universita di Udine, Italy,
[email protected] • PARATORE Mariafortuna Universita di Messina, Italy,
[email protected]
• PARESCHI Giuseppe Universita di Roma , Tor Vergata, Italy,
[email protected] • PAXIA Giuseppe Universita di Catania, Italy • PEDRINI Claudio Universita di Geneva, Italy,
[email protected] • PLANAS-VILANOVA Francesc Universitat Politecnicade Catalunya, Barcelona, Spain,
[email protected] • POLO Antonio Universita di Bologna, Italy,
[email protected]
xviii
Participants
• RAGUSA Alfio Universita di Catania, Italy,
[email protected]
• RAVIDA DONATO Maria Via S. Michele, 18 - Castroreale (ME), Italy • RESTUCCIA Gaetana Universita di Messina, Italy,
[email protected] • RINALDO Giancarlo Universita di Messina, Italy,
[email protected]
• ROBBIANO Lorenzo Universita di Geneva, Italy,
[email protected]
• ROGGERO Margherita Universita di Torino, Italy,
[email protected]
• ROMERTim Universitat Essen, Germany,
[email protected] • ROSSI Maria Evelina Universita di Genova, Italy,
[email protected] • SALMON Paolo Universita di Bologna, Italy,
[email protected]
• SANGARE Daouda
[email protected] • SANGHARE Mamadou Dept. Maths et Info. FST, Universit de Dakar, Senegal,
[email protected] • SBARRA Enrico Universitat Essen, Germany,
[email protected]
• SKOLDBERG Emil Stockholm University, Sweden,
[email protected] • SMITH Karen University of Michigan, USA,
[email protected] . SNELLMAN Jan Laboratoire GAGE, Ecole Polyt. Palaiseau Cedex, France,
[email protected]
• SRINIVASAN Hema University of Missouri, Columbia- USA,
[email protected] . STRANO Rosario Universita di Catania, Italy,
[email protected]
Participants
• TARTARONE Francesca Universita di Trieste, Italy,
[email protected] • TBRAI Naoki Saga University, Japan,
[email protected]
• TYC Andrzej University of Torun, Poland,
[email protected]
• UTANO Rosanna Universita di Messina, Italy,
[email protected]
. VALABREGA Paolo Politecnico di Torino, Italy,
[email protected] • VALENZANO Mario Politecnico di Torino, Italy,
[email protected]
• VALLA Giuseppe Universita di Geneva, Italy,
[email protected]
• VERRA Alessandro III Universita di Roma, Italy,
[email protected]
• VETTER Udo Universitat Oldenburg, Germany,
[email protected]
• WEIBEL Chuck Rutgers University, USA,
[email protected]
• YANAGAWA Kohji Osaka University, Japan,
[email protected] • ZAPPALA Giuseppe Universita di Catania, Italy
• ZARZUELA Santiago Universitat de Barcelona, Spain,
[email protected]
. ZATINI Elsa Universita di Geneva, Italy,
[email protected]
xix
On free complete intersections MARGHERITA BARILE Dipartimento di Matematica, Universita degli Studi di Bari, Via Orabona 4, 70125 Bari (ITALY) MARCEL MORALES Universite de Grenoble I, Institut Fourier, UMR 5582, B.P.74, 38402 Saint-Martin D'Heres Cedex, and IUFM de Lyon, 5 rue Anselme, 69317 Lyon Gedex (FRANCE)
APOSTOLOS THOMA Department of Mathematics, University of loannina, loannina 45110 (GREECE)
1
INTRODUCTION
The determination of the minimum number of equations needed to define an algebraic variety V set-theoretically or ideal-theoretically is an old and important problem in Algebraic Geometry. The defining ideal of a toric variety is generated by binomials. In [1] we have proven that in characteristic zero a simplicial toric variety is a set-theoretic complete intersection on binomials if and only if it is a complete intersection on the same set of binomials. In this paper we want to give a numerical criterion which characterizes a special class of complete intersection toric varieties in characteristic zero. Let K be a field of characteristic 0. Let ei,...,e n be the elements of the canonical basis of -Zf1, and for all i = 1, . . . ,r let aj = (0*1,1, • • • ,ai,n) € JV". Let di ...,dn e Wand set T = {diei,... ,d n e n ,ai,...,a r } C j8V™. Define ..,xn,yi,...,yr] ->• K[ti, . . . ,tn] as the homomorphism of .FC-algebras for which
(xi) = td;ei
<j>(yi) = tai
for alH = 1, . . . , n,
for alH = 1, . . . , r,
where ta' = t"''1 ...tn''". Then Ker> = IT is the simplicial toric ideal of T and its affine variety V = V(/r) of zeros in A^+r is an affine simplicial toric variety in the sense of [2, 7], which also includes non normal varieties. The image (K[xi ,...,xn,yi,..., yr}) is the affine semigroup ring K[T] of T. In other terms,
Barile, Morales and Thoma
IT is the defining ideal of the variety V in A^+r having the following parametrization: Xl
= ui
1* dsji
—— ——
It U-n
=
UI M ...u^ 1 -"
yi
i/T"
5_
* * "
fi
Let ^VT = {/idiei + • • • + / n + r a r : l\,..., ln+r € JN} be the affine semigroup generated by T and 2ZT = {hdiei + • • • + ln+ra.r '• h, • • •,ln+r € ^} the lattice spanned by T. It is well-known that M(!T) ~ r; it is a complete intersection if and only if it is generated by r elements. We recall the following:
DEFINITION 1.1 Let TI and T2 be non-empty subsets ofT such that T = TI U T2 and TI nT2 = 0. Then T is called a gluing ojT\ and T% if there is a nonzero element a e JNTi n IVT2 such that 2Za = 22Ti n ^T2. The concept of semigroup gluing was defined by J.C. Resales in [6] and used by K. Fischer, W. Morris and J. Shapiro in [3] to characterize all complete intersections affine semigroups. They proved the following: THEOREM 1.2 Let 1NT be an affine semigroup which is not a free abelian semigroup. Then 1NT is a complete intersection if and only if there are two subsets TI and T-2 of T such that T is the gluing of TI and T2 and JNTi , ^VT2 are complete intersection sub semigroups. In this paper we want to treat the case of free complete intersections, a notion due to P.A. Garcia-Sanchez and J.C. Resales (see [4]). They give the following characterization:
THEOREM 1.3 The affine simplicial semigroup JNT is a free complete intersection (with respect to the sequence aj., . . . , ar) if and only if for all i = 1, . . . , r — 1, , . . . ,d n e n ,ai,...,ai}
is the gluing of T^i = {diei,...,dnen,ai,...,a.i--i} and {a-,}.
REMARK 1.4 (a) Suppose that T is free with respect to the sequence ai, . . . , a r , Since JV^ej., . . . , d n e n ) is a complete intersection, it follows recursively from Theorem 1.2 that the semigroup
is a free complete intersection, in particular V is a complete intersection (we shall say that V is a free complete intersection). More precisely, if m^a; € -#VT,_i (wij ^ 0),
On free complete intersections
3
is such that W(mjaO = J^fTi-i n Wa;, and m^ai = £)"=1 HijdjBj + Y^i "i,*^, then setting, for all i = 1 , . . . , r, /?. — ,/ m < _ a-i T-^-1 ... 3-r »./*;,.• .."a .. ..."'.'-i S/l i/i-l '
- f z — J/i
we have that 7T = (F 1 ...,F P ). (b) It follows that for all i = 1 . . . , r one has that
ITr\K[xi,...,xr,yi,...,yi] - (Fi,. ..,#). 2
THE MAIN RESULT
The definition of free complete intersection strictly depends on the ordering. This is shown in the next EXAMPLE 2.1 Let T = {(4,0), (0,4), (2,2), (3,3)}. Then 1NT is free with respect to the sequence (2,2), (3,3). In fact
2(3,3) =3(2,2) generates ^((4,0), (0,4), (2,2)) n ^(3,3), so that T is the gluing of {(4,0), (0,4), (2,2)} and {(3,3)}. The toric variety V associated to T is parametrized
by xi = u\,
x2 = u\,
2/1 = u\u\,
2/2 = u\ul,
it is a complete intersection on the binomials
yi-xix-z,
2/2-2/1-
T is not, however, the gluing of {(4,0), (0,4), (3,3)} and {(2,2)}. In fact
(2,2) = -(4,0) -(0,4) + 2(3,3), but
(2,2)gW((4,0),(0,4),(3,3)). Hence INT is not free with respect to the sequence (3,3), (2,2). LEMMA 2.2 Suppose T is free (with respect to the sequence ai,... ,a r j. The notations are those introduced in Remark 1.4. For alii = 1,... ,r let Mi be a monomial not divisible by yt but divisible by Xj for at least one j, such that Gi = y™' —Mi € IT, where m; ^ 0 and I^m^O = IVT;_i n Was. Then IT = (Gl,... ,G r ).
Proof. Set J = (Gi . . . , Gs). By induction on i = 1,..., r we prove that Fj € J. For all i = 1 , . . . , r set ri 1 Ti r M-l — rai'1 • • • 7x-ncri'"'7/ ivi — Xj yl ' •• •• •ii -yr ' .
First suppose that M\ only involves some of the variables x\... ,xn. Then
Barile, Morales and Thoma
3=1
Since dielt . . . ,dnen are linearly independent, it follows that o~ij = /j,ij for all j = 1, . . . ,n, so that Fj = GI. Now suppose that MI involves some variable y^. Let s be the greatest index i with this property. Then
It follows that r ljS = \sms for some As € W. Now
hence
"i •— 2/1 /~"
.__
—
—
,.mi
(7, -
<-ri
_
^i
™ffl.l
T* 2-1
71 1
'
^n j/i
i/s-i -iws
. . . -ffl.n,. 1 "!.! . . . . . T l . « - l M A '
• . . r^l.",/1"1'1 . . .,| T 1 '«- 1 /7( A ') C
-Cn
J/l
•••J/s_i
<-Js
7" fc «/.
Note that the degree of the x— part of the monomial 71 11 1 r"l71'1 . • •r' '— 1 M MeA " •''n '"?;''" 2/1 ' • • .i/ J/«-l
x
has increased strictly. If we re-apply the same procedure as above to the binomial G'i , and proceed recursively, at each step we get a new binomial belonging to J:
Since G?i 6 /T, it follows that G\ = FI. This completes the proof that FI 6 J.
Now fix an index i > 1 and suppose that FI . . . , F j _ i € J. Note that the
same recursive argument used in the proof of the induction basis can be applied to construct a binomial Gi = y™' — Mj € J where Mj only involves variables from xi, ... ,xn,yi . . . , y j _ i . Then, by Remark 1.4 (b) and induction,
...^^!,....^.!] = (Fi,...,F l i _ 1 ) C J, which completes the proof. From the preceding lemma we deduce:
PROPOSITION 2.3 The simplicial toric variety V is a free complete intersection with respect to any permutation of the sequence ai , . . . , ar if and only if it is a complete intersection on r binomials of the form
where Mj is a product of powers of x\ , . . . , xn . Proof. We prove the non trivial implication. We assume that V is a free complete intersection with respect to any permutation of the sequence ai, . . . , ar. Then by
On free complete intersections
5
definition, for alH = 1, . . . , r, {die^, . . . , dnen, a.-,} is the gluing of {diei, . . . , dnen} and {a;}. Prom Remark 1.4 (a) it follows that there is a binomial of the form d
— iimi - XT^1 . . -r^* X
"» — Vi
l
n
belonging to IT, where m^a; e JN(die-i, . . . ,dnen), (mi ^ 0), and ^(rmsii) = ^(diei, . . . ,dnen) n ^(a;).
The claim then follows from Lemma 2.2. The varieties of the preceding proposition can be numerically characterized in terms of the exponents of their parametrizations. LEMMA 2.4 Let d be a positive integer, and, for i = 1, . . . , r, j = 1, . . . , n let aij be an integer. For all i = l , . . . , r set % = gcd(a,,i, . . . ,ai
= Ci
(mode/)
ar,ixi + • • • + ar
= cr
(modd)
(*)
is solvable for all multiples c\ 0/71,..., cr of 7r if and only if
gcd (Mfcd1-*) fc=0,...,r
divides 71 "-7r
gcd
i=l,...,r fc=0,...,r-2
(Mf^-^V^-'-ii'-^r),
(I)
w/zere
• /or all k = 0, . . . ,r, M^ denotes the set of k-minors of the matrix
• for all i = 1,... ,r, Mjf denotes the set of k-minors of A not involving the ith row (we set M0 = MQ = 1 for all i).
Proof. Fix some multiple c\ of 71,..., cr of 7,.. The system (*) is solvable if and only if the system of linear equations a-i,i%i + • • • + o-i,nxn + dy\
=
c\
CLf l«-Cj, "T" ' * ' ~T" Cdf fi^Tl
—
^-"T
I~ ^"?/71
( T^T )
Barile, Morales and Thoma
has an integer solution. The matrix of coefficients is • • • ai,n d • • • 02 n 0
a
A=
i,i a-21 \ a r> i
• • • ar,n
0 d
••• 0
0 0 ••• d J
Set c= We shall use the following notation: if A is a matrix with integer coefficients, by
| .A | we shall denote the greatest common divisor of its maximal minors. If all the maximal minors are equal to 0, we set \A\ — 0. By a well-known lemma of number theory (see [5]) the system (**) has an integer solution if and only if |A| ^ 0 and \A\ — \Ac . Now:
\A\= gcd (M*
divides dr ^ 0. Hence \A\ / 0. On the other hand
\Ac\=&cd(\A\,M), where M denotes the set of all r-minors of Ac involving the last column. Each of these minors is of the form:
E
ejCjAz; 1 "'.*'
(***)
some
where EJ e {1, -1} for all i = 1, . . . , r, and M £;;•]* denotes the fc-minor of A formed by the rows with the indices i\ . . . i& and the columns with the indices ji . . .jk', moreover i $ {ii . . .ik}. Note that for every possible choice of i,i\ . . .ik,ji • • -jk the summand appears in the expansion of some r-minor of Ac formed by the columns with the indices ji, . . . , j/fe,mi, . . . ,TO r _fc_i,n + r + 1, where r + I < mi < •• • < m r _^_i < n + r, and i,ii, . . . ,ik ^ {TOI — n, . . . ,mr-k-i — n}. By virtue of Bezout's Identity, the greatest common divisor of the numbers ( * * * ) , as ci . . . , cr vary, is equal to the greatest common divisor of the numbers
for all possible choices of the indices such that i $ {ii, . . . , i k } - But all entries of the' Mh row are divisible by 7^ (h = l,...,r) and all 7^ divide d. Hence 71 • • • 7i • • • 7r divides
*$;;:£ tT-*-1,
as was to be proved.
The next Theorem is quoted from [1]:
On free complete intersections
THEOREM 2.5 Let V be a simplicial toric variety of codimension r over a field of characteristic zero. Then V is defined by r binomial equations if and only if V is a complete intersection. Moreover, if FI, . . . , Fr are binomials such that I(V) = rad(Fl,. . . ,Fr), then I(V) = (Fi,.. .,Fr).
REMARK 2.6 Up to replacing the exponents di,...,dn by their least common multiple we may assume that they are all equal. We make this assumption in the statement of our main result.
THEOREM 2.7 Let V be the simplicial toric variety of A^+r having the following parametrization:
T •*>n
u 1l
— —
n
yi
= «?'•'
yr
=
j,
Ul'
(,
...<"'"•
For all i = 1,..., r the binomial
n. - yid/T; _ rxai;.i/T- ... x oi, n /7i i "s —w n
where -ji = gcd(a i i l ,...,aj, n ,d) for i = l,,..,r, belongs to I(V).
Moreover
rad(Gi,... ,Gr) — I(V) if and only if condition (I) holds and in fact (Gi,..., Gr) = I(V) if and only if condition (I) holds.
Proof. Let K be the algebraic closure of K. The condition rad(Gi,..., G>) = I(V) is equivalent to the following statement: every point of A^.+r on which G i , . . . , G > vanish belongs to V, where K is the algebraic closure of K. Let P(XI, ... ,xn,yi,... , 2/ r ) be such a point. Let Uj be a dth root of Xj for all j = 1,... ,n. Then from the binomial Gi we have j/i = uiua1i'1 •••<'•"
(1)
for alii = 1 , . . . , r, where uji is a d/7;th root of 1. Let r] be a primitive dth root of 1. Then, for alH = 1,... ,r, one has that w, = 77°' for some multiple c; of 7^. Now P € V if and only if there exists, for all j = 1,..., n, a dth root ffj of 1 such that
yi = (Oiu1)a^---(dnunT"" for all i = 1,... ,r: then Xj — (9jUj}d 6j € 2Z be such that
(2)
for j = 1,... ,n. For all j = 1,... ,n let
9i=rtei. Conditions (1) and (2) are fulfilled if and only if, for all 1,... ,r,
Barile, Morales and Thoma
i.e., i.e.,
eii is an arbitrary d/%th root of 1, and Cj is an arbitrary multiple of 7$. Hence our claim is equivalent to the solvability of (3) for all multiples c; of 7$. i.e., to condition (I). By Theorem 2.5 we know that the condition rad(Gi,... ,Gr) = I(V) is equivalent to (Gi,... ,G r ) = I(V). This completes the proof. We consider the particular case r = 2. The variety V is parametrized by X!
=
uf
1/2
= <*•'
We may assume that gcd(ojj,
IT, - I I - ' r<
x 01 ' 1 / 71 " -T
i
. d/72
^2 = J/2
-
X
02,1/72
l
Then rad(Gi,G2) = I(V) if and only if 5=
gcd (d 2 ,aiji
divides 7172
, ,
gcd
(— -).
»=1,2
7«
Note that
Let F be the generic projective monomial curve of P^-, parametrized by
where ai + &i = a2 + 62 = d. Then
where
ai62~fl2^i
= =
is a multiple of d, so that g — d.
(d — bi)(d — a 2 ) — d — ayd — bid + a-zbi —
On free complete intersections
9
EXAMPLE 2.8 Let V be the projective monomial curve of P3K parametrized by
In this case d = 6, 71 = 2, 72 = 3, and thus condition (I) is fulfilled: I(V) =
Final Remark A simplicial toric variety which is a complete intersection need not to be free. This is shown in the next
EXAMPLE 2.9 The monomial curve C parametrized by Ti Jj\
— ijt —
33
j
TQ — — f"77 f •"-'3
65 To — —/ •^'2 ** ;
7S
TA — ~ vf •AJQ
is a complete intersection on the binomials 7 _
3
6_
5
2
_
It is not, however, a free complete intersection. In fact {33,65,77,78} is the gluing of {33,77} and {65,78}, which both generate complete intersection subsemigroups. The equality 2 x 33 - 65 + 77 - 78 = 0, however, shows that no 2-subset of {33,65,77,78} is the gluing of its two 1-subsets.
References [1] M. Barile, M. Morales, A. Thoma. On Set-Theoretic Complete Intersections on Binomials. Prepublication de 1'Institut Fourier N. 498 (2000). Submitted. [2] D. Eisenbud and B. Sturmfels. Binomial ideals, Duke Math. J. 84:1-45,
1996.
[3] K. Fischer, W. Morris, J. Shapiro. Affine semigroup rings that are complete intersections. Proc. Amer. Math. Soc. 125:3137-3145, 1997. [4] P.A.Garcia-Sanchez, J.C. Resales, On Free Affine Semigroups, Semigroup Forum, 58:367-385, 1999. [5] J. Heger, Denkschriften. Kais. Akad. Wissensch. Mathem. Naturw. Klasse, 14 II, 1858. II. [6] J.C. Resales. On Presentations of Subsemigroups of ^V*. Semigroup Forum. 55:152-159, 1997. [7] B. Sturmfels, Grobner Bases and Convex Polytopes. University Lecture Series, No. 8, Providence, R.I.: American Mathematical Society, 1995.
On the number of ideals of finite colength VALENTINA BARUCCI, Dipartimento di Matematica, Universita "La Sapienza", Piazzale A.Moro 2, 00185 Roma, Italy, email: barucci@mat. uniromal .it
RALF FROBERG, Matematiska institutionen Stockholms Universitet, 10691 Stockholm, Sweden, email: [email protected]
1
INTRODUCTION
If I is an ideal of a (commutative) ring R and IR(R/!) = h, we say that / has colength h. Maximal ideals have colength 1, and there may be many other ideals of finite colength even in non-Noetherian rings. If R is a one-dimensional Noetherian domain, every non-zero ideal has finite colength. We are interested in the class of rings in which there is a finite number of ideals for each finite colength, and how this number grows as a function of h. In
Artinian rings there are no ideals of colength h, if h » 0 and we show that, in a Noetherian ring of dimension at least two, the number of ideals of colength h grows exponentially with h (for a precise statement, cf. Theorem 2.8). If R has a finite number of ideals for each finite colength, then R is semilocal and each
localization at a maximal ideal has the same property. Thus the one-dimensional (Noetherian) local rings are a natural class of rings to investigate. For a large
natural subclass of those, we give a precise measure of the growth: if (R, m) is a one-dimensional analytically unramified residually rational local ring with finite residue field and the integral closure R has d maximal ideals, with \R/m\ > d, we prove that the number of ideals of colength h is a polynomial of degree d — 1 in h, if h > IR(&/R : R) (cf. Theorem 3.8). In particular, when d = 1, i.e. when
R is analytically irreducible, the number of ideals of colength h is, for large h, a constant that of course depends on the cardinality of the residue field of R.
All the information on the number of ideals of finite colength of a ring R can be collected in a generating function, the colength series of R, which in the case of our subclass of rings has a nice form. To prove the mentioned results, we use the value semigroup associated to a one-dimensional analytically unramified ring and we refer for that to [1].
11
12
2
Barucci and Froberg
GENERALITIES
Let R be a (not necessarily Noetherian) ring. We consider ideals J of R of finite colength (i.e. ln(R/J) — h < oo). This is equivalent to say that R/J is an Artinian ring.
Notice that many ideals of finite colength may exist also in non-Noetherian rings. R = Z + XQ[[X]] is an example of a non-Noetherian ring with ideals of any colength h € N. As a matter of fact .R/XQ[[Jf ]] = Z and so, if p is a prime
in Z, phR = ph1 + X^[X]} is an ideal of R of colength h. LEMMA 2.1 Suppose that J C I are ideals of a quasilocal ring (R,m) with 1R(I/J) = 1. ThenlmC J. Proof. If / is finitely generated, this follows from Nakayama's lemma, but the statement is always true. Let t € / \ J. Then t £ J + tm, since otherwise t — j + tmi,j € J, mi € m, so i(l — mi) = j € J, and t £ J since 1 — m\ is invertible. Since J C J + tm C I and the last inclusion is proper, the first inclusion cannot be proper, and we get J 4- tm = J for all t € /, so Im C J.
PROPOSITION 2.2 Let (R, m) be a quasilocal ring. If J is an ideal of colength h, then mh C J. In particular J is m-primary. Proof. We use induction on h. If h — 1, then J — m. Suppose ln(R/J) = h and that the statement is proved for ideals of colength h — 1. Choose an ideal / 3 J of colength h - 1. Then mh~l C /, so mh C ml C J by Lemma 2.1.
COROLLARY 2.3 Let R be a ring with a finite number of ideals for each colength h € N and let m be a maximal ideal, then the localization Rm has also a finite number of ideals for each colength h € N.
Proof. By Proposition 2.2, ideals in Rm of finite colength are m.Rm-primary, and there is a 1-1 correspondence between m.Rra-primary ideals Qm in Rm and m-primary ideals Q in .R, and lRm(Rm/Qm) = If the ring (R,m) is Noetherian, then each m-primary ideal is of finite colength, but in general this is not true. By Proposition 2.2, if the maximal ideal of R is idempotent, i.e. m — m2 (this happens for example in a one-dimensional non-discrete valuation domain), then the only ideal of finite colength is the maximal ideal, but each non-zero ideal is m-primary. However, if we restrict to Noetherian rings, we get: PROPOSITION 2.4 Let (R,m) be a local (i.e. quasilocal and Noetherian) ring
of dimension > 0. Then there exists, for each h € N, an ideal of colength h. Proof. By induction on h. Let I be an ideal of colength h — 1. Any ideal J which is maximal in the set of proper subideals of J is of colength h.
In the sequel we will restrict to (Noetherian) local rings. There is no restriction to assume that R is complete:
The number of ideals of finite colength
13
PROPOSITION 2.5 If (R,m) is local with (m-adic) completion (R,m), there are just as many ideals of colength h in R as in R. Proof. By Proposition 2.2, mh C / if / is of colength h (and correspondingly for ideals in R), and R/mh ** R/mh.
Notice however that even such a simple ring as R — C[X, Y]/(X, Y)2 = C[x, y] has infinitely many ideals of colength 2. Any maximal chain of ideals in R looks like this:
R3(x,y)D(ax + by)l>(Q)
and there are infinitely many choices for (a, 6) ^ (0,0) giving different ideals. The following proposition gives the class of rings we will study. PROPOSITION 2.6 Let (R,m) be a local ring. Then, for each h 6 N, there is a finite number of ideals of colength h if and only if R is a DVR, an Artinian principal ideal ring, or if R/m is finite.
Proof. Suppose that the number of ideals of colength 2 is finite. The ideals of colength 2 are in 1-1 correspondence to .R/m-subspaces of m/m2 of codimension 1. Then either m/m2 is one-dimensional or R/m is a finite field. In the first case m = (x) is a principal ideal and, since by Krull intersection theorem fli>o m* = 0, we get that every element of R is of the form ex1, for some i > 0 and some unit e. It follows that, if ml ^ 0 for each i, then R is a DVR and, if m1 = 0 for some i, R is an Artinian principal ideal ring.
If R is a DVR or an Artinian principal ideal ring, the number of ideals of each colength is at most one, so we assume that R/m is a finite field. By induction we can assume that there are finitely many ideals Jj of colength h — 1. The ideals of colength h corresponds to .R/m-subspaces of Ji/mJi of codimension 1, which are finitely many. We are interested in the growth of the number of ideals of colength h in
a local ring R as a function of h. We denote the number of ideals in R of colength h by OH(/I), or just ft(/i) if the ring R is understood from the context. If R is Artinian, then fi(/i) = 0, if h » 0. We will first see that, if dim/? > 2, then fl(h) cannot be bounded by a function which grows less than exponentially,
thus the following theorem shows that it is natural to restrict to one-dimensional rings. We will use the following, certainly well known, lemma.
LEMMA 2.7 Let V be a vector space of dimension n over a field with q elements. Then the number of subspaces of dimension (or codimension) [n/2] is at least
Proof. The statement is trivially true for n = 1. If n > 1, the number of subspaces of dimension [n/2] is (qn - l)(qn - q) • • • (qn - qln/2l-l)/((q^n/^ l)( g [n/2] _ q ) . . . ( q [ n / 2 ] _ g [n/2]-i)) n
2
1
n 2
=
flgg)-1 (q» - g')/(gl n / 2 I - *).
Since
(q - q^ / \ and we have [n/2] factors, the statement follows.
14
Barucci and Froberg
THEOREM 2.8 Let (R,m) be a local ring. If dim R > 2, there is a positive rational number F such that, for each N there is an M > N with 0(M) > qFM . Proof. Suppose that dimR — 2. Then we have ln(R/mn) = an2 + bn + c and lR(mn/mn+1) = lan + a + b, for some a > 0, if n » 0. Let Mn = [(2an + a + 6)/2] (integer part). There are, by Lemma 2.7, at least q(Mn">
subspaces of codimension Mn in mn/mn+l, so there are at least g(M") ideals of colength an2 + bn + c + Mn in R. If we let M'n = an2 + bn + c + Mn, we will show that (M n ) 2 > FM'n for some F > 0, if n » 0. Since (Mn)2 > (an)2 /I if n » 0 and M'n < 2an2 if n » 0, it suffices to show that (on) 2 /2 - F • 2an2, for some F > 0, and so F = a/4 will do. If dim R > 2, let / be an ideal in R such that dimR/ 1 = 2. Obviously fi^(n) > £lR/j(n). In the next section we will see that we can get good control over the growth of fl(/i) for a large class of one-dimensional rings.
3
ANALYTICALLY UNRAMIPIED ONE-DIMENSIONAL RINGS
In this section we consider a particular class of one-dimensional rings. In all this section R will be an analytically unramified one-dimensional local ring, i.e. a one-dimensional reduced Noetherian local ring, such that the integral closure R is finite over R. An important class of examples of such rings are the local rings of an algebraic curve. As we noticed in the previous section, it is not restrictive to suppose that R is complete. So we can suppose that, if PI, . . . ,Pd are the minimal primes of R, each R/Pi is analyticlly irreducible, with integral closure Vi, a DVR. Thus we have R C R/Pl x • • • x R/Pd and R = Vi x • • • x Vd. We also suppose that R is residually rational (i.e. that all localizations at maximal ideals of R have the same residue field as R) and that the cardinality of the residue field of R is at least equal to the number d of minimal primes. Since R C R/P\ x • • • x R/Pd C Vi x • • • x Vd, each element x = (x\ , . . . , Xd) 6 R has a value v(x) = (vi(xi),... ,vd(xd)), where, for i = 1,... ,d, v^ is the valuation of the DVR Vi (it is convenient to assume Uj(0) = oo). The value semigroup of R is 5 = v(R) = {v(x); x E R} C (N U {oo})d and each ideal I C R has its value set v(I] = {v(x);x G /} C S. On 5 there is a natural partial ordering, (QI, . . . ,a<j) < (/Si, . . . ,/?d), if Q-i < /?« for all i. For other properties of S, we refer to [1]. If C = (R : R) is the conductor, then C is an ideal (of R and) of R , so C = ti5lVi x • • • x td6dVd, where tt is the uniformizing parameter of Vj. Thus v(C) = {a = (ai,... ,ad) e (NU{oo}) d | a» > Si, for i = 1, . . . ,d}. We will' always denote minv(C) by 6 = (Si,.. . ,Sd) in the sequel. Notice in particular that each element x £ R = V\ x • • • x Vd, with v(x) > S (i.e. v(x) 6 v(C)) is in R, because it is in C. If J C / are ideals of R, it is possible to compute IR(! / J) looking at v(I) and v(J) (cf. [1, Section 2.1]).
The number of ideals of finite colength
15
Finally, in order to study how the number of ideals of colength h grows with h in R, we have to suppose that the residue field of R is finite, cf. Proposition 2.6. In this setting, that is fixed for all Section 3, and with the notation introduced above, if 7, J are ideals of R, we define I ~ J if there exists an element x in the quotient ring of R such that v(I) = v(xJ). This is an equivalence relation and we call a shape for the ideals of R an equivalence class. If / is an ideal in the equivalence class I, we say that I is the shape of I or I is of shape I. Notice that the shapes are finitely many for a ring R.
EXAMPLE 1. For the ring R = k[[(t, u), (t3,^)}} = k[[x, y}}/(x3 - y) n (x2 - y) that has the following value semigroup
1 2 3 Fig. 1. The value semigroup of R we have the following shapes:
Zi =the principal shape. Z 2 =shape(((£,u), (£ 3 ,u 2 )).R). 23=shape(C). DEFINITION. Given a shape 1 for the ideals of R, we define the function ftz(/i) as the number of ideals of R of shape I and colength h. Of course we haven(/i) = Ei fi i( ft )-
3.1 The analytically irreducible case We first consider the analytically irreducible case, i.e., we assume that the integral closure of the ring R is a DVR which we denote by (V, i). We denote the conductor C = R : V by t5V.
16
Barucci and Froberg
LEMMA 3.1 The map &(/) = t*I,i > 0, from ideals I with minv(I) = S to ideals J with minu(J) — i + 6 is a bisection which preserves the shape of the ideal. Proof. Since tll is a fractional ideal and fl C C C R, we get that (j>i(I) is an ideal of R. The map is bijective with (j>^l(J) = t~*J as inverse. The shape is preserved by the definition of shape.
LEMMA 3.2 fi z (/i) is constant, ifh>6. Proof. If minw(/) < S, then 1R(R/I) = #(w(H) \ «(/)) = #((v(R) \ «(/)) n
[1, 6)} + #((v(R) \ v(I)) n [S, oo)) < 1R(R/C) + 1R(V/K) = 1R(V/C) = 6. Thus 7 C C, if 1R(R/ 1) > S. According to Lemma 3.1, the number of ideals of shape X is constant (i.e. independent of minu(/)) for all ideals inside the conductor.
We now state the main result for analytically irreducible rings. PROPOSITION 3.3 // R is analytically irreducible, then fi(/i) is constant, if
h > 1R(V/C). Proof. We have ft(/i) = J^x^zW- The sum is finite and each summand is a constant, by Lemma 3.2, if h > 6 = 1R(V/C). As usual it is convenient to collect the information in a generating function. We define the colength series of R to be CLR(Z) = ^%L0ft(h)Zh. For an analytically irreducible ring R we get CLR(Z) = p(Z)/(l - Z). Then p(Z) 6 Z[Z], and p ( l ) = Q(/i), for h > 1R(V/C). The constant fi(/i),/i » 0, of course depends on q — \R/m\. We will determine this dependence in an example.
EXAMPLE 2. Let R = k [ [ t 3 , t 4 , t 5 ] } . There are the following shapes of ideals: Ii = shape(-R), Z2 = shape((£ 3 ,£ 5 )), I3 = shape((* 3 ,i 4 )), and finally I4 = sh&pe((t3,t4,t5)). We get, if q - \k\,
n(2) = nl2(2) + nls(2) + nl4(2) = q + q2 + 1,
n(ft) = SlXl(h) + O l2 (/i) + ft l3 (/i) + fi l4 (/i) = q2 + q + q2 + 1, if h > 3. CLR(Z) = (l + (q + q2)Z* + q2Z3)/(l - Z).
We could generalize the example and show that, if v(R) = (6,6+1,... ,26 — 1), then the constant tl(h) is a polynomial of degree [£/2]2 in g = \R/m\, if h > 6. In general the dependence of fl(/i) of q is more complicated. We can,
however, show that ft(/i) is always bounded by a polynomial of degree [S/2]2 in
q3.2 The non-analytically irreducible case We consider now the analytically unramified case with d > 1. Recall that, as above, S = (Si,... ,<5 d ) is mmv(C). By the properties (1) and (2) of [1,
The number of ideals of finite colength
17
Proposition 2.1], the semigroup S is given by the union of a finite number of sets that, modulo a reordering of the coordinates, are of the following form: (3.4)
where <5j < a» £ N, for i < u, and ft are fixed integers, 0 < ft < <5;, for s + l,,... ,/?„.
LEMMA 3.5 Letx = ( x i , . . . ,a;d) £ ft, withv(x) = (QI,... , a s ,ft,+i,... ,/?<*) € ^i.-.i.A+i,...,/?.!- #<*» -a, < n* < oo, / o r i = 1,... ,s, tfien ( * ! , . . . , Z d X t ; 1 ' , . . . , * ? • , ! , . . . , 1 ) 6 fl.
Proof. Every element x' — (x(,... ,x's,Q,... ,0) of ft, with v^x'j) > St, for i = 1,... ,s has a value in v(C), sox' £ C C R. In particular (xi,... , xs, 0,... ,0) € ft and so (EI ,... ,x d )-(xi,... ,x s ,0,... ,0) = (0,... ,0,o;s+1,... ,xd) € ft, and thus every element ( x [ , . . . , x's,xa+i,..., xd) with vi(x'i) > 6i, for i = 1,... , s belongs to ft. The element ( x i , . . . , Xd)(t™1,... , i"', 1,... ,1) in the statement of the lemma is such an element.
LEMMA 3.6 a) Let I be an ideal of R with mint;(/) = minTslt...,s.,0,+lt...t0d. Then the map 0(7) = ( i ™ 1 , . . . , t%', 1,... , 1)7, from ideals I with minu(7) = (5i,... , 6s,/3s+i,... , /3d) to ideals J with min v( J) = (61 + HI ,... ,8S + ns, fls+i, • • • > fid) is a bijection which preserves the shape of the ideal. b) The number of ideals of R of shape I with minv(7) G Tslt...is,,0,+i,...,04 zs a constant. Proof, a) By Lemma 3.5, if x — (xi,... ,xd) £ 7, then (i™ 1 ,... ,*"*,!,... , l)x 6 ft. So the fractional ideal (t"1,... , t™', 1,... , 1)7 is contained in ft and is an ideal of ft. The map is bijective with ~1 (J) = (t^ni,... , tjn>, 1,... , 1) J as inverse. The shape is preserved by the definition of shape, b) By a) the number of ideals of ft of shape J with mini>(7) e Tslt...,s,,0.+i,...,i3d does not depend on the element a — minu(7).
Denote the constant in Lemma 3.6b) by fi(Tslt...,s,,f3,^l,...,i3d)For an analytically unramified ring with d > 1 minimal primes, we need to make the definition of the function flj(/i) finer.
DEFINITION. Given a shape I for the ideals of ft, we define the function uz(h,Tglt,..ts,,p.+i,...,0d) as the number of elements a £ Tglt_,^s,,/3,+i,...,0d such that there exists an ideal 7 in ft of shape I and colength h, with minv(7) = a.
18
Barucci and Froberg
The computation of the function i^i(h,Ts1,...ts,,^,+1,...,ffd) gives an answer to our problem at semigroup level and is the first step in the computation of the growth (with h) of fi(ft), the number of ideals of colength h. It is convenient to introduce before next lemma another notation. If I is an ideal of shape I, with minv(J) = mmTSl,...,s,,/3,+1,...,0d, set bz(TSl,... ,s.,p,+i,...,pd) = ln(R/I)-
LEMMA 3.7 ui(h,Tglt...tgftpi+li...tpd)
is a polynomial of degree at most s - I ,
Proof. We know that Tgli...tgttftt+l!...>0d is a finite union of subsets T of type (1) described in the beginning of this section. We will first count the number of elements a € T (where T is of type (1)), such that there exists an ideal / of R of shape X and colength ft, with minu(J) = a. If such an ideal / with minf(I) £ 2 1 < 5 1) ... ) j 4) ^ +1> ... $d exists, we have to count the number of ways to write ft — bz(Tglt...tgft/3f+lt...tpd) as a sum of u non-negative summands ft, = di —Si, where u < s. This is given by 'ft- &zCT<5i,...,<5.A.+i,... Ai) +u ~ u-l
which is a polynomial in ft of degree u — 1 < s — 1. Since T^... ^/s.+i,... ,/jd is a finite union of subsets of type (1), then, by the principle of inclusion-exclusion, uz(h,Tslt...ts.,0,+l,...,0
fi(ft) is a polynomial in h of degree d — I , if ft > 1R(R/C). Proof. We have fi(ft) = J^rfizCO and the sum is finite. Thus it is enough to prove the theorem for a fixed shape X.
By Lemma 3.7, ui(h,Tslt...,s,,0.+1,...,0d), i.e. the number of elements a € 2^1,... ,s,,0,+i,... ,pd such that there exists an ideal 7 in R of shape X and colength ft, with minv(7) = a, is a polynomial in ft of degree at most s — 1, if ft > &z(2ii,...,<5,A+i,...,&i)- All the numbers &z(25i,...,<$.,/3.+i,- ,Pd) are bounded by &z(T!jj,... ,6d) — bx(v(C)). Moreover, if li is the shape of a principal ideal, all the numbers bz(v(C)) are bounded by b-R.(v(C)). It follows that, for ft > b-n(v(C)) = 1R(R/C)+1R(R/R) = 1R((R/C) and for each shape X, wz(ft,T 5li ...,^ A+1; ... i/3<J ) is a polynomial in ft of degree at most s — 1. It is actually a polynomial of degree d — 1, when Ta li ... >( j S) /3 J+li ... ^ = v(C), because an ideal I of shape X with minv(/) £ u(C') certainly exists. On the other hand we have to count, fixed a certain Tslt...ts,,p,+i,...,pd, for each a e T<5 lv ... ,<5,,0 a+1) ...,^ d , how many ideals I of R of shape X and colength ft, with mini>(/) = a exist. By Lemma 3.6, this number, fz(Tglt...ts,,p.+i,...,pd)i does not depend on the element a € T$lt...ts,,p,+l,...,0d chosen. So, for ft > 1R(R/C), we get that 2J
• f z ( T S l , . . . ,s
The number of ideals of finite colength
19
is a polynomial in h of degree d — 1. EXAMPLE 3. We use the same ring R as in Example 1 from the beginning of this section. We get /Zl(T0,0) = 1,/z^Ti,!) = qJi,(T^) = (-l),/z 2 (T 0 , 0 ) = 0,/z 2 (T M ) = l,/z 2 (T 2>2 ) = q- l,/z 3 (To,o) = 0,/z3(T1,1) = 0,/i3(T2,2) = 1. Furthermore wz a (ft, lb,o) = 1 for /i = 0 and = 0 otherwise, ui1(h,Titi) = 1 for h = 2 and = 0 otherwise, wi 1 (/i,T 2> 2) = ft - 3 for ft > 4 and = 0 otherwise, wi 2 (ft,T 0 , 0 ) = 0 for each ft, ui2(h,Titi) — 1 for ft = 1 and = 0 otherwise, w l2 (ft,T 2 , 2 ) = f t - 2 for ft > 3 and = 0 otherwise, wz 3 (ft,T 0 , 0 ) = wz 3 (ft,T u ) = 0 for all ft, W2; 3 (ft,T 2]2 ) - h - 1 for ft > 2 and = 0 otherwise. Thus fifl(O) = 1, n B (l) = 1, n fl (2) = 1 + q, O fl (3) = 1 + q, and Qfl(ft) = 1 + 4 + (ft - 3)<72, if h>4 = lR(R/C). For the generating function CL^(Z) of fl(ft) we get the following result.
COROLLARY 3.9 CLR(Z) = p(Z)/(l - Z)d, where p(Z) E %[Z], degp(Z) = l f i ( R / C ) , p ( l ) equals the number of ideals / with min v(7) = o; for any a > 6, and d equals the number of maximal ideals in R.
EXAMPLE 4. The generating function from Example 1 (and Example 3) becomes CLR(Z) = (l-Z + qZ2- qZ3 + 2 Z 4 )/(1 - Z)2.
References [1]
V. Barucci - M. D'Anna - R. Froberg, Analytically unramified onedimensional semilocal rings and their value semigroups, J. Pure Appl. Algebra 147 (2000), 215-254.
Realizable Sequences Linked to the Hilbert Function of a 0-Dimensional Projective Scheme GIANNINA BECCARI Dipartimento di Matematica, Politecnico di Torino, Italia, e.m. [email protected] CARLA MASSAZA Dipartimento di Matematica, Politecnico di Torino, Italia, e.m. [email protected]
INTRODUCTION This paper is strictly linked to a previous one,[l], in which properties of a pro-
jective, 0-dimensional, reduced scheme are studied by means of a "refinement" of its Hilbert function or, actually, of its first difference F ([2],[3]). The main tool, in this investigation, is a numerical sequence Mr ; rather surprisingly, the set of those MF'S, arising from all the possibles F 's, turns out to be in 1-1 correspondence with the set of the r-type vectors introduced in [4] for a different purpose; moreover, a sequence of numbers of interest in the description of Mr turns out to be a generalization, to higher dimension, of the sequence of numerical characters introduced in [5] for a 0-dimensional scheme in P2. In [1] any ordered set of distinct points (Pi, ...,PS) in Pr gives rise to a sequence of natural numbers Splt...,pt = (di,...,di,...da), defined as follows: di, i > 0, is the minimum degree of a hypersurface separating Pi from Pi...Pj_i, while di = 0. There, the function 75 : N —» N, defined by 7s(n) = card{i: dt = n}, is proved to coincide with the Castelnuovo function F of any 0-dimensional, projective, reduced scheme X = {Pi, ...,PS}, having S as an allowed sequence. Here the following problem is faced: for any given Castelnuovo function F, find the set Sr of all sequences allowed for at least one scheme X, having that Castelnuovo function. The solution of this problem will be essential in a next step of the investigation, consisting in a partition of Sr into equivalence "Supported by MURST , National Project ex 40 % :"Geometria Algebrica, Algebra Commutativa e aspetti computazionali". °1991 Mathematics Subject Classification: Primary 13D40, Secondary 13A02, 14A05, 14Q99.
21
22
Beccari and Massaza
classes, each of which corresponds to schemes with some characteristic geometric property. The starting point is Macaulay's theorem [6], characterizing the functions / : N —> N that can be the Castelnuovo function of some scheme. Such a set Sp is completely determined by its maximum with respect to the lexicographic order, which is the already mentioned sequence MrThe description of Air is the main job of this paper. In fact, in the special case of n + 1 points on a line, Air simply is what we call a 1 — segment starting with 0, that is (0, 1,2, ...,n). For a scheme X lying in P2, Mr can be partitioned into a collection of 1-segments, say Mr = (So, ...,St), where Si = (i,i + l,...,m), n0 > HI > ... > nt and t + 1 is the minimal degree of a curve containing X; so, we are led to introduce the concept of 2-segment starting with 0. In this situation, Mr is realized by any 0-dimensional scheme of distinct points on t + 1 lines r0, ...,rt, such that the points on Th are in 1 - 1 correspondence with the elements of Sh and the intersection of two lines does not belong to X. In the more general situation of points in P2 , Mr appears as a generalization of a 2-segment to higher dimension and we are led to introduce the concept of r-segment: an M r is an r-segment starting with 0. The schemes described in §3 as a realization of Mr are k — configurations ([4]). The sequence Mr seems to be an important help when we want to study all the schemes with a given Castelnuovo function F, also for reasons different from the one of producing Sr- For instance, from the structure of Air a bound can be read for the maximum number of points of X lying on a hypersurface of given degree, or on a linear subspace of given dimension. We are very grateful to A.Geramita for stimulating discussions.
1
PRELIMINARIES AND RECALLS
To any 0-dimensional, reduced, projective scheme X in Pr we can associate a saturated ideal / of R = K[x0, ...xr] and a coordinate ring A = R/I, of Krull dimension 1. Let us recall some well known concepts. 1.1 The Hilbert function of X is denned as the Hilbert function of its standard graded algebra A = K[x0,...,xr]/I = ®i>oA{, that is the function H(A;.) : N -> N defined as H(A;i] = dwn#A,. Its first difference T(A\.) : N -> N, denned as T(A;i) = H(A;i) - H(A;i - !),» > 1, T(A;Q) = 1, is called Castelnuovo function of X and denoted FX- If L € K[xo,...,xr] is a linear form, regular on A, then F(A; .) turns out to be the Hilbert function of
2.1
Let h and i positive integers. Then h can be written uniquely in the
form
*- 1
Realizable Sequences
23
where m, > m^-i > ... > m,j > I. This expression for h is called the i-binomial expansion of h. Also define:
i + l j \
i
J
\J +
0 = 0 (see [7]).
and
3.1 ([8]) A sequence (&o, &i, — , & » , — ) of non negative integers is called an 0-sequence if 60 = 1, bi+i < 6^J>,Vi. 4.1 (Macaulay's theorem [6]) The following facts are equivalent: (A) (bi),i > 0 is an O-sequence. (B) (bi),i > 0 is the Hilbert function of a standard graded algebra.
We will use some definitions and results of [1], that we are going to recall.
5.1 A hypersurface F separates the point P from a set of points PI ,..., Pk iff it contains PI, ..., Pk, but does not contain P. 6.1 To any sequence of points (Pi ...P8) we associate a sequence of natural numbers S — Spl...pil = (di,d^,...,d8), where di = 0 and dk(k > 1) is the least degree of a hypersurface separating Pk from PI, ...,Pfc_i.
NOTATION d(Pi,S) denotes the number di corresponding to Pi in S. nW, in a sequence, means n...n repeated s times. 7.1
To any finite sequence of natural numbers S = (d\,..., d$), we associate
a function 75 : N —> N as follows:
7s(n) = card{i : di — n},
where cardJ denotes the cardinality of the set J. Viceversa, given a function / : N —» N, with finite support, we say that a sequence S is associated to / if 7s — /• As I is saturated, the irrelevant ideal M is not associated to /; so there exists a non zero divisor L (that can be choosen as a linear form) such that A/(L) has T(A; •) as its Hilbert function. Viceversa, let (&,) be a finite sequence of natural numbers and (cj = 6j — 6i_i),co = 1 its first difference. If (cj) is the Hilbert function of a graded algebra J3, then B[T] is an algebra with Hilbert function (hi). So, Macaulay theorem 4.1 implies the following statement:
24
Beccari and Massaza
8.1
For a finite sequence 5 of natural numbers, the following facts are
equivalent:
i) 75 is the Castelnuovo function of a 0-dimensional scheme. ii) (js(i)) is an 0-sequence.
9.1 If S = SPl...Pa, then 75 = T(R/I), that is, S is associated to T(R/I) and 75 is independent of the order of the points. 10.1 AsequenceSis realizable if there exists a sequence of points (Pi...P,), such that 5 = Spi...p3. The set of all schemes realizing 5 will be denoted XsIf F is an O-sequence, the set of all realizable sequences 5 such that 75 = T will be denoted Sp. A sequence 5 is allowable for X = {Pi...P8} (X- allowable sequence) iff 5 = Sp,(i)...p,(t) f°r some permutation a. The set of all X-allowable sequences will be denoted Sx11.1 A permutation of a sequence (di,...,ds) of natural numbers, realized by interchanging two elements d;,dj+1, will be called a direct transposition (briefly d.t.) if c^+i < d, and inverse transposition (briefly i.t.) if dj+i > dj.
12.1 If Si = (di,...,di,di+i,...,ds) is realizable and dj > d»+i, then also S% — (di, ...,di+i,di, ...,ds) is realizable and it is X-allowable, for every X realizing Si.
2
TECHNICAL TOOLS: h-SEGMENTS, BINOMIAL EXPANSIONS AND F - HOLES
Our aim is to produce the set Sp, for a given Castelnuovo function F. Let us start with some definitions.
DEFINITION 1.2 S is Macaulay- compatible (briefly M.c.) iff the equivalent conditions of 8.1 are verified. We will use the following notation: if S = (di,...,ds), its i-th truncation is
DEFINITION 2.2 The sequence S is strongly Macaulay-compatible(s.M.c.) iff all its truncations S . ii) Let F = FX be the Castelnuovo function of some 0-dimensional projective scheme X. Then a sequence C = (CQ, ..., cu, ..., cn) is F - saturated (F - sat.) in
Realizable Sequences
25
REMARK 1.2 If 75 = FX and / is the saturated ideal of X, then 75 is Macaulay saturated in u iff A = R/(I,L) has maximal growth in u — 1, where L is a regular 1-form on R/I (see [9], §1). DEFINITION 4.2 Let C = (co,...,c u ,...,c n ) be an O-sequence. We say that u is an M — hole for C iff C is not M — sat. in u. More precisely, u is an (M, *) - hole iff c -cu = k. We say that u is a F — hole for (7 iff (7 is not F — serf, in u. More precisely, u is a (F, k) - hole iff in/{c^"J"1> - c u , F(u) - cu} = fc. Let us introduce the following notation: if F is as in def.3.2, we denote Sr the set of all sequences 5 such that: 75 = F and 5 is s.M.c..
REMARK It is immediate to control that Sp 2 Sr- In cor. 8.3 we will prove that, as a matter of fact, the equality holds. DEFINITION 5.2 We set Mr = sup Sp, where the maximum is computed with respect to the lexicographic order arising from the natural ordering of N. From now on, we will fix our attention on Mr- Our aim is to describe MY well enough to be able to show that it is realizable and that every other sequence of Sp can be obtained from it by a finite number of d.t.. With such a description we can produce Mr, starting from a known F, with an easy algorithm (see example 20.2).
PROPOSITION 2.2 Set Mr- (mi,...,mj,...,m s ). It is immediate to verify that Mr can be constructed, step by step, as follows: a)
m-i = 1, TOJ+I = sup{u : u is a F— hole for T i ( t ) } ,
mi = 0,
b)
i = 2...s — 1, where F; is
the function 7( mi ... mi )-
LEMMA 3. 2 Let (Mr)
Fi_i(£) and F;(t) are O-sequences and they coincide except for t =
mi, where F^m,) = F;_i(rai) + 1.
The condition characterizing an O-sequence involves couples of consecutive numbers, so no number of the form mj + h (h > 2) is a F-hole for FJ as it
does not for Fj_i, while m^ + 1 is a F-hole for F, if Fj(mi + 1) < F(m, + 1). In fact, applying the well known property: c, < o?j =>• c < rf^ l> , with Cj = Ti_i(mi),di = F;_i(mj) + 1, we get:
so that mi + 1 is aF-holefor Fj, or, in other words, the sequence (mi...mi(mj+l)) is M.c..
26
Beccari and Massaza Lemma 3.2 suggests the following definition.
DEFINITION 6.2 A 1 — segment S1 is a sequence of natural consecutive numbers with at least two elements; o^1) and ^(S1) will denote its first and, respectively, last element. A 0 — segment is a sequence S° — (n) of just one natural number; we agree that a(S°) = w(«S°) = n. Repeatedly applying lemma 3.2, we easily get the following PROPOSITION 4.2 Mr is a sequence of 1-segments and 0-segments, say Mr = (So,Si,...,St), with a(<S;) < w(<Sj_i); moreover the sequence (w(<Sb)— is non increasing. REMARK Proposition 4.2 says that to construct Mr we need a criterion of choise for a(Si),i > 1. EXAMPLE Let us consider the case F(l) = 2; in other words, let us consider the Castelnuovo function of a scheme X lying in P2. By means of the well known properties (see [10]):
(*)
a = 2 => c < n + 1,
and
c<"> < n => c<£+h> < n,
it is easy to see that Mr= (So, ...,St) has the following shape: ( 0 1 2 1 2
. . . n0 ... m
2
... n2
t
... nt
)
where no > ni > n% > ... > nt, a(Sh) = h, t + 1 = minimal degree of a curve containing X. The sequence Mr is realized by any 0-dimensional scheme of distinct points on t + 1 lines ro,...,rt, such that the points on rh are in 1 — 1 correspondence with the elements of Sh and the intersection of two lines does not belong to X. This situation is a special case of th.19.2 . A direct proof can be easily provided by observing that any curve separating a point of rh from the previous ones must contain TO, ..., r^-i as components. The previous example shows that a(Sh) is determined by relation (*), linking a to c^°'. When X lies in Pr,r > 2, the required relations between Ci and c^l> are more complicated and the description of Mr is uneasy in terms of 1-segments. So, we introduce the concept of h - segment, for h > 2. Indeed , we start by defining a presegment. The concept of presegment turns out to be more general than the one of segment except for degrees 1 and 2, in which the two coincide. So, the definition of /i-segment will be given by induction on h, starting from the cases h — 0, h = 1.
Realizable Sequences
27
DEFINITION 7.2 A segment of order 0 or, respectively, 1 is a presegment of the same order. A presegment of order h ( briefly h — presegment ), h > 1, is a sequence Sh = (not, ...,not 0 ,nii, ...,nitl, ...,nki,—,rikth,—,nvi,...,nvtv),v > 1, satisfying the following^^ conditions:
i) The sequences S^" ^ 1 — (riki,...,nktk), 0 < k < v, are h - 1 presegments, l while S^~ is a pv -presegment, with pv < ft — 1. ii) («fei), k — Q...V, is a 1-segment. The first and last elements of Sh will be denoted respectively ct(Sh) and u(Sh) . It is convenient to_give to Sv a "virtual order" h- 1, when it is considered as a subsequence of Sh. EXAMPLE
The sequence S = (01111) is a 4-presegment. In fact: S = (S03 A3), where S* = (0111), 5? = (1) S3 = (SlS!), where S20 = (Oil), 5? = (1) So2 - (So1, Si), where <S<J = (01),
# = (1)
and SQ,SQ,SQ are respectively of order 1,2,3. We observe that the 0-segment
(1) has virtual order 0,1,2 or 3 according to its position inside S. We say that (S^"1 , ..., S^1) is a decomposition ofSh into (ft— 1) -presegments h (briefly: (h - 1) - decomposition of Sh ) and write S -, ( Sj"1,..., S^~l). If — -i h > 1, the decomposition can be repeated for each S£~ , with the convention that the decomposition of S%~1 into h - 2 subsegments coincides with S^1 itself, if /i — 2 > /?„. So, more generally, we can consider a decomposition of Sh into A;-presegments, for k < h. PROPOSITION 5.2 If Sh is an /i-presegment and a(Sh) = u, then ft coincides with the number of (u + l)'s appearing in Sh. So, the order of a presegment is unique. Proof By induction on ft. For ft = 0 or 1 the statement is obvious. Let us suppose it true until ft - 1. As Sh = (So"1,...,^"1),* > 1, it is enough to observe that u + 1 appears once in iSf"1, and does not appear any more in Sfc~\ k > 2, while it appears ft - 1 times in S^1 , by induction.
PROPOSITION 6.2 ments is unique.
The decomposition of Sh as a sequence of ft - 1 preseg-
28
Beccari and Massaza
Proof For h — 1 the statement is obviuos. So, let us suppose h > 1. If Sh = ($Q~I,...,S£~l) — (<S 0 fe ~ 1 ,...,5 ( ft ~ 1 ), we point out our attention on the first i such that S**~l ^ Sih~1. But <Sf ~1 and ^j'1""1 cannot differ for elements in the same position, because those elements are also in the same position in Sh ; in particular, none of them is empty. So, let us suppose that S^~l is a truncation of <Si/l~1 at its n-th place. Then, if o^S^1) — a(<Si/'~1) = d, the (n + l)-th element of <Sf-1 should be d + 1, because it must coincide with a(<Sf_|T11). So, the number of (d + l)'s appearing in S^"1 is strictly less than the number of (d + l)'s appearing in S^1 ; this means (prop.5.2) that the order of <SZ- -1 is strictly less than h — 1; but <Sf ~1 is not the last element of the decomposition of Sh into h — 1 segments: a contradiction. I The following statement comes easily from the definition of /i-presegment. OBSERVATION-DEFINITION 8.2 If a(Sh) = u and i > -u , then the sequence obtained fromjS'* by adding i to each element is still an /i-presegment, that will be denoted Sh(i) . Clearly, a(Sh)(i)} = a(Sh) + i, u(Sh)(i)) = The /i-presegments that we use to describe M.? have some more properties. If Sh = (Sg-1,...,^-1) = (S^,...,§1) , we set:
NOTATION
DEFINITION 9.2 An h - segment Sh, h > 2, is an /i-presegment satisfying the following conditions: i) Sh is a sequence of h-1 segments as follows: Sh = (5^~ 1 ,...,<S^~ 1 ,...,5 t ft ~ 1 ). and each <Sk~~l is, in its term, decomposable as a sequence of (h — 2)-segments: oh-l _ i oft-2
°
—°
>
It is immediate to see that the following statement holds.
REMARK 7.2 i) If S2 = (S^...Sl), condition ii) of def.9.2 becomes: cj(«S/) > w(5J+1). ii) If Sh = (SQ...SD is a decomposition in 1-segments, then condition ii) of def.9.2 implies that w(<S<5) > u(Sl)... > u(S}). PROPOSITION 8.2 Let Sh = (S$,...,S?S?+1,...,S£) be a fc-decomposition of the /i-segment Sh, with k < (h - 1). Then 0(<Sf+1) < r(<Sf ), i = O...(t - 1). Proof If <Sf and <S*+1 come from the decomposition of the same Sk+1 , then the condition follows from ii) of def.9.2, applied to the (k + l)-segment Sk+1 .
Realizable Sequences
29
Otherwise, <S* and <S*+1 come from the decomposition of two different (k + 1)segments, say S*+l and 5*+J; so <S£+1 - (...,<Sf), $£} - (<Sf+1,...) and, as a consequence, r(<S*+1) < r(5f), 6l(<S*+11) = 0(<Sf+1) . If there is a (fc+2)-segment whose decomposition contains (<S*+1) and (<S*+J) , then condition ii) of def.9.2,
applied to that (fc + 2)-segment, gives the required unequality. Otherwise, we go on until we find two (fc+j)-segments, <5*+J , «S*+f, such that their decomposition into fc-segments is of the type: S%+:> = (...,<S*), <S*+i' — (S^+1...) , and there is an Sk+i+i containing both of them. So T(S*+>) < r(<Sf), 0(«S£#) = 0(Sf+1) , and the unequality follows from ii) of def.9.2, applied to that Sk+:i+1 . I
REMARK 9.2 Every /i-segment Sh gives rise to an h-type vector TH (see [4]) as follows. To each S° we associate 7~° = 1. To S1 = (nj...n
9(Sh) = sup Sh = a(Sh) + ff(Sh) - 1 r(Sh) = a(Sh) + aG(Sh) - 1. So condition ii) of def.9.2, written in terms of a and eta, becomes:
As a^-1) = a(S£lt) + 1 , we get
Now , to conclude that (*) becomes the condition required in def. 2.1 of [4], it is enough to observe that, if Tr is the r-type vector corresponding to Sr, then Viceversa, every ft-type vector comes from a family of /i-segments, each of which is determined by fixing its first element. In fact, the sequence of natural numbers underlying T, in the reverse order, gives the length of each <S* of the 1-decomposition of the Sh to be constructed. Moreover the first element of <S/ can be decided using induction. In fact, if <Sh = (<Sf ...e>*) is the kdecomposition of Sh, knowing a(S^) and ao(Sj), we can determine the first
30
Beccari and Massaza
element of each (k - l)-segment of the (k - l)-decomposition of <S*; we know that ao(Sj) = a(T* /Sk)_k+1), while a(Sf) can be obtained by induction.
EXAMPLE (see ex. 2.2 in [4]) Let us produce the 3-segment corresponding to the 3-type vector T3 - ((12)(134)(23456)), with a(S3) = 0. We have: S3 = (SlSlSl), where a(S2) = 0 , a(S*) = 1 , a(<S32) = 2 , ao(S») = 5, a a(S%) = 3 , aoGSf) = 2 . So, writing each 1-segment on a different line, we have:
<S2 = 0 1 2 3 1 2 3 2 3 3
4 4 4 4 4
5 5 5 5 5
<5f =
1 2 3 4 2 3 4 3
«S|=23 3
PROPOSITION 10.2 The truncation of a segment of order k is still a segment of order h < k. Proof LetS* = (So~1,...,St*~1), t > 1 and <S a trucation of Sk. Iffc = l, the statement is obvious; so, let us suppose it true until k = h and prove it for k — h + 1. If <5 C <Sg, then, either it coincides with Sft or we apply the inductive hypothesis to Sh: in both cases S is a segment of order < h + 1. If S is strictly contained in SQ, then S = (iS* ,<Sf ...,<S*,E), where E either is empty or is a truncation of 5^; in the latter case, we apply the inductive hypothesis to <S£+1 '• m both cases S is still an h + 1-segment.
PROPOSITION 11.2 Let S and S' be two segments, with 7? = 75-. Then c=0 c/. 0
Proof Let us suppose S ^ S' and say a and a', a < a', the first elements in which they differ. Say S the truncation of S (or S') before a (or a'). Moreover, denote k (resp. k') the maximal order of a decomposition of S that is the beginning of the decomposition of S (resp. S' ) having the same order, so that we have:
where: a = a(S?+1) = a(Sf) + 1 = t»/(5f ) + 1, a' = a(4+i) = a(4*') + * =
As a < a', then k' < k , which means that <S^,*' is the last element of the decomposition of S* in ^'-segments. So, d(S^+l) = sup(S — S) < r(Sf) < a(<Sj;*') = a' — 1. As a consequence, 7(<S)(a') 7^ 7 (<$')(«')• I In what follows we need the concept ofsubsegment. To state when a segment Sh is a subsegment of <Sr ( briefly Sh < Sr) we give the following
Realizable Sequences
31
DEFINITION 10.2 a) A 0-segment <50 has only one subsegment: So itself. b) An r-segment (r > 0) S'r = (S1^1 , ...,5'p1) is a subsegment of an r-segment Sr = (<S0~l , ...,<S^1), iff: 0 s >t iiJST1 «$[-!, i = 0...t c) An /i-segment 5//l is a subsegment of an r-segment Sr with /i-decomposition (S0>,...,S?),r>h,ittS'h<S0-. REMARK A truncation <S of a fc-segment 5fc is a subsegment of Sk , but a subsegment is not necessarily a truncation, as we see in the following proposition. PROPOSITION 12.2 S' is a subsegment of an r-segment Sr iff it can be obtained by repeatedly applying the following process. If r = 1, delete the last element of the segment. If r > 2, choose h < r and, inside the /i-decomposition of Sr, an element S? = (5*-1,..,5*T1) ; deletes^1, so replacing S? with S'f = (S^1,...^^) iff
Proof As the statement is obvious in case r = 1, let us consider r > 2. The sequence S' obtained from Sr by replacing <Sf by 5'j is still a segment, because r(«S'£) = r(5f) - 1; condition (*) garanties that r(5'f) > 0(S'f+i) . So it is enough to prove that S' is a subsegment of <Sr . If h < r — 1, then Sf appears in the decomposition of an element 5J""1 of the (r - l)-decomposition of Sr, and it is enough to prove that S'f is a subsegment of SJ"1. So, step by step, we can substitute Sr with a segment of lower order, until we get order h + 1; in other words, we can suppose h = r — 1. So, we just have to control that S'p1 is a subsegment of S^1 , and this is clearly true, as it is obtained from S^~l by deleting the last element of its (r - 2)-decomposition. Viceversa, every subsegment can be obtained in this way. In fact, let S' <Sr, where S' is an /z-segment. If h = r, then S' is obtained by deleting in S some elements at the end of its (r — l)-decomposition and then acting recoursively on the (r - l)-segments left; if h < r, then S' is obtained by deleting all the elements of the /i-decomposition of S different from the first one, and going on recoursively. I h
PROPOSITION 13.2 Let S = (S%, ...,£*) , h > 1, be the decomposition of the /i-segment Sh into 1-segments. Then: h d is an (h - l)-segment. a*(S )=
32
Beccari and Massaza
true until h - 1 and prove it for h. If Sh = (S%~l,...,S?~l), then a*(<Sft) = (a*(<So~ 1 ),...,a*(<S t ft ~ 1 )) and, by inductive hypothesis, a*^"1)) is an (ft-2)segment, for k < t, and is a (pt — l)-segment, with pt < (ft — 1), for k = t. Moreover a(a*(<S£~ 1 )) = a^"1), so that the sequence (a(a*(<S^~1))) is a 1segment: so we realized that a*(Sh) is an (h - l)-presegment. If ft = 2, we just remind that a 1-presegment is also a 1-segment. If h > 2, we still have to prove condition ii) of def.9.2; to this aim it is enough to observe that: T(a*(<S ft ~ 1 ) = i-OS*-1) , while e(a*(Sh-1) < 0(Sh~l). In fact if Sh~l = (S£-2,...,S*-2) , then T^S*-1) = a(«S£-2) and ro'^*-1) = aa'(S^~2) = a(S^). As for the unequality, it is enough to recall that 0(5} = supS and to observe that a*(Sh~l) is a subsequence of Sh~1. I A repeated application of prop.13.2 gives;
COROLLARY 14.2 segment.
If Sh is an ft-segment and i < h, then afiSh is an (h - i)-
Now our aim is to prove that Mr is an r-segment, where r = F(l). Before that, we need some technical tools.
LEMMA 15.2 Let c - (nuu) +...+ft) be the u-binomial expansion of c (see 2.1). Then the u-binomial expansion of c+ 1 is respectively: i ) C + l = f t ) + . . . + (•*) + (*:') i f f t > l ii) c + 1 = ft) + ... + (££) + ("'+*) if ft = 1 and nk+1 > (m + k), while nv+i = HI + v for 0 < v < k. Proof i) The statement is obvious, for the unicity of the u-binomial expansion of c + I . ii) Let c = ft) + ... + (-_+') + (•»+*-!) + ... + (•»+!) + ("/) , with nk+i > (HI + k). To get statement ii), repeatedly use the equality: ( 6 "j) + (£) = (^J). I PROPOSITION 16.2 Let C = (co,...,c u ,...,c u+t ,...) be an O-sequence with an M-hole in u and M-saturated for t > 1. Denote cu = ft) + ... + (™fth) the u-binomial expansion of cu. i) Let us consider the sequence C\ = (clk) — (co,...,c u _i,c u + 1, ...,cu+i + 1,...). Then: 11) Ci is M-saturated in u + t, t > 2. 12) If ft ^ 1, Ci is M-saturated also in u + 1. is) If ft = 1, Ci has an (M,ni)-hole in u + 1. Moreover, the (u + 1)binomial representation of clu+l = cu+\ + 1 ends with (*). ii) For h = 1, t > 2, the sequence
C1* = (4) = (co,"-,c«-i,c u + l,c u +i +2,...,cu+t-i + t,cu+t+t,...,cu+t+v+t...) is M-saturated, for k > u, except in u + 1 , if n\ / 1 and in u + i, where it has an (M, l)-hole; moreover the (u + £)-binomial representation of cu+t + t ends with (}).
Realizable Sequences
Proof
33
The hypothesis of M-saturation of C says that
iu + t^ So, if h + t > 2, we have:
h +1 -
,...+*+!
The condition h + t > 2 is obviously verified for every t > 0 if h > 2 and for every h > 0 if t > 2; it is verified for t > 1 if h = 1 . This proves ii) and 12). If h = 1 and t = 0, following the notation of lemma 15.2, we have: n
u\ (nk+i\ Ah + k — 1\ A1! +1\ (ni + + L i ) + ( i. }+•••+ i u \k + l \ k \ 0 1 + \l cu+i =Cu
u+1 J
=
frik+i + 1\ /Tii + k\ /HI 4- 2\ "+( k + 2 ) + \k+l)+'"+( 3 )+\ , C
+1
«' Lemma 15.2 implies:
fnu + l\ /ni + l\ A + + + =(u+l) - ( 2 J G , fnk+i\
so that
As a consequence:
(cu + !)<«> - (cu+1 - (ni + D] - 1 = m
so that i) is completely proved. Now we prove ii) by induction on t. For t = 2, we have
£2 = (4) = (c 0 ,-.,c u _i,c u + l,c u+ i +2,c u+2 + 2, ...,cu+v
2
34
Beccari and Massaza
Starting from C\ instead of from C and using as initial position u + 1 instead of u, we get that Ci is M-saturated for k > u + 3 (use ii); in u + 2 we have an (M, 1) - hole, as the binomial representation of cu+i -I-1 ends with (*) (use is)). Using is) once more, we see that the binomial representation of cu+2 + 2 ends with (|), while C? is saturated in u + 1 only if n\ = 1. So, let us suppose the statement true until t; to prove it for t + 1, it is enough to use i), substituting C\ with Ct and u with u + t. I
DEFINITION 11.2 Let C = (CD, .., .cu,cu+i,...,cu+t,...) be a finite 0-sequence, with a F-hole in u and F-saturated for t > 1 and suppose that the w-binomial expansion of cu ends with (J). We call F — saturation process the process that starts with the O-sequence C" — (co,-..,cu + l,cu+i,...,cu+t,...), goes on by adding, step by step, 1 to the element of the sequence lying in the last F-hole ( i.e. to cu+to, where u +10 is a F-hole, while C is F-sat for t > to), and ends when the reached sequence is F-saturated for t>l. REMARKS i) Denote S(C) the sequence of "last F-holes" borning, step by step, in the F-saturation process. If C is the Fj arising in the construction of Mr(see prop.2.2), then S(C) is the subsequence of Air starting with u and ending before the first element < u. ii) The F-saturation process ends because of the bounds imposed by F, as the creation of M-holes does not come to an end (lemma 3.2). Let us call u the last M-hole that cannot be saturated, so that the F-saturation process finishes. If C" is the O-sequence arising after the F-saturation process of C, then the Fsaturation process of C" gives rise to a sequence of elements S(C') all of which are less then u.
LEMMA 17.2 Let C be as in def.11.2. i) If cu = ( n u u )+...+ (*) is the u-binomial expansion of cu, then the sequence S(C) arising from the F-saturation process of C is an /i-segment Sh, with a(S''1) = u, where h = inf(k + 1,F(w + 1) — c u +i). ii) If the u-binomial expansion of cu ends with ("•'), where j > 2, then the F-saturation process gives rise to a segment of degree 0 or 1.
Proof i) If C is F-saturated in u + 1 because F(u +1) = cu+1, then the Fsaturation process consists in adding u, which is a 0-segment S°, with a(S°) — u, Otherwise, the condition that C is F-saturated in w+1 means that c u +i = (n^^\ ) + ...+ ( fc + 1 ) . In this case, we prove the statement by induction on k. If k = 1, we must show that 5(C) is a segment <52, with a(<S2) = u, that can reduce to a 1-segment S1, if T(u + 1) — cu+i = 1: this follows easily from prop. 16.2. So, suppose the property true until k — 1 and prove it for k. Prop.16.2 says that in u+1 we create an (M, fc)-hole; let j < inf(k+l, F(w+l)-c u+ i); using induction on j, we prove that, if we stop the F-saturation process before adding the (j + l)th element (u + 1), the produced sequence is a j-segment. In fact, if j = 1, the first u + l added gives rise to the 1-segment iSg = (u (u + l)...(u + v). Now let us suppose the statement true until j — 1 and prove it for j. Look at the situation
Realizable Sequences
35
before adding the j-th element u + 1. The sequence produced at this point of the F-saturation process is a (j - l)-segment S'l"1 , with o^S'j"1) = u, and the new O-sequence to be saturated is Cj-\ = O^"1) i where c^"1 = cu + 1 and 4+1! = c u + i + j - l ; the last hole in Cj-i is u + land 4+1 = •••+ (k^) + CT 1 )The F-saturation process of C goes on with Gj~\ instead of C, u replaced by u + 1 and k replaced by j — 1. By induction on k, the F-saturation process of C^1 produces a j-segment J S' 0 with a(<S'o) = u + I . As a consequence, the sequence <SJ = (S'30~ ,<S'o) has a decomposition in j - 1-segments; so, it turns out to be a j-segment, with a(<S-J) = u (see def. 9.2 and remark 7.2). So, if F(u + 1) — cu+i — h < k, the F-saturation process gives rise to a /(.-segment Sh, with a(Sh) = u. Now, let us suppose T(u + 1) - cu+\ — k + 1. The F-saturation process of C, stopped after adding k times the element u + 1, gives rise to the following situation. The F-saturation process produces a fe-segment <S'0, with a(S'0) — u. The O-sequence to be saturated is
Ck = (....cu + l.co+i+fc.cj+a,...).
with u +1 as last hole and cu+i + k = ... + (kJ1) + (*). So, Ck is in a situation very similar to that of C, with u replaced by u + 1 and with the supplementary information that u + 1 is a (M, l)-hole. By adding u + 1, the sequence becomes F-saturated in u + 1 and gets u + 2 as a (M, k + l) -hole. If F(u + 2) - c£+2 — h < k , then the F-saturation process of C ends by still adding an /i-segment S'^, with a(S'^) = u + 2 , so producing the (k+ l)-segment
Sk+l = (5'J,5'i). If T(u + 2) - c*+2 = k+l, the process goes on, with u + 2 replaced by u + 3 and so on, until we reach a u + t, with T(u + t) - c*+f = h < k. The final
sequence is the (k + l)-segment Sk+1 = (S'o,S'i-S'u+t-i>slv+t)ii) The last assertion of the lemma follows immediately from prop.16.2.
PROPOSITION 18.2 A truncation (Mr)h of Mr containing h elements equal to 1 is an /i-segment Sh, with a(Sh) — 0. Proof By induction on h. If ft — 1 the statement follows immediately from prop.4.2. If h = 2 the assertion follows from lemma 17.2, when C — (0 1 2...t),u = l,ci = (}). So let us suppose the statement true until h—1 and prove it for h. The hypothesis says that (Mr)h~l = <Sh~1 is an (h - l)-segment with a(Sh~l) = 0. Moreover, (Mr}h can be obtained from (Mr)h~l with the Fsaturation process applied to C — 7((.Mr) /l ~ 1 ), with u = l,ci = C^1)- Lemma 17.2. says that such a process gives rise to an /-segment Sl with a(S ) = 1,1
THEOREM 19.2 If F(l) = r, then Mr is an r-segment «Sr, with a(Sr) = 0.
36
Beccari and Massaza Proof
The statement follows immediately from Prop. 18. 2., choosing h —
EXAMPLE 20.2 . Let X be a set of 104 points in P3 with the following Castelnuovo function (see [9]):
T = (1, 3, 6, 10, 14, 14, 16, 15, 17, 4, 4). Theorem 19.2 says that Mr is a 3-segment Sr, with a(<Sr) = 0. Talking into account the links imposed by F, we see that Air = (^O'^i'^li^I) > where:
= 0 1 2 3 1 2 3 2 3 3
4 4 4 4 4
5 5 5 5 5 5
6 6 6 6 6 6 6
7 8 7 8 7 8 7 8 7 8 7 8 7 8 78
9 9 9 9
Sf = 2 3 4 5 6 3 4 5 6 4 5 6
1 0 5? = 1 2 3 4 5 6 7 8 10 2 3 4 5 6 7 8 10 3 4 5 6 7 8 10 4 5 6 7 8 5 6 7 8 6 7 8 78 8
5|=34 4
PROPOSITION 21.2 Let X' be a subscheme of X, F' and T their Castelnuovo functions; then Air" is a subsegment of Air-
Proof It is enough to prove the statement when degX. = degX1 + 1. In this situation, Mr is obtained from Air" by adding an element u in a M-hole of Airs which means either at the end of an Sl or as the first element of a new Sl ~ (u) ( the latter case occours in particular if u = 1). In any case, if order Air" = r, there exist an ft, 0 < ft < r — 1, and an ft + 1-decomposition of Air', such that the ft-decomposition of some of its elements can be continued by adding u as its last Sh. So, Air' can be obtained from Air using prop. 12.2. I REMARK 22.2 From the F-saturation process it turns out that if Air = Sr, the Ai-holes of F are the numbers r(<S/1) +1,1 < ft < r, where Sh is any segment of the ft-decomposition of AirThe first M-hole of F, different from 1, is aG(Sr) = r(ST) + 1 : it is the degree of a minimal hypersurface of Pr containing a 0-scheme X, having F as its Castelnuovo function; it is also the number of iS7""1 appearing in the (r — l)-decomposition of Air-
Realizable Sequences
37
If <52 = (Sl,...,Sl) is a 2-segment, with a(<S2) = 0 , then the sequence r(iS|) + 1 = w(iSj) + 1 is the sequence of the numerical characters of the Hilbert function corresponding to <S2 (see [5]). 3
REALIZABLE SEQUENCES
The main aim of this paragraph is to show that every r-segment Sr, with a(Sr) = 0, is a realizable sequence. Let us introduce some technical tools. LEMMA 1.3 If Sr is an r-segment, there exists a function / : Sr -»• P r , satisfying the following conditions: i) For any ft < r, if <Sf is a fc-segment of the ft-decomposition of Sr, k < ft, then /(/*) = P f i generates a linear subspace of dimension k that we denote ii) For every Sh = (So"1, ...jS*"1) of the ft- decomposition of <5r, ft = l...r:
TT^y1 n T^j1 = 0, if o < i < j.
Proof By induction on r. If r = 1, S1 — (ni,...,n s ), we define f ( n i ) = Pj, where Pi,...,Pg are distinct points of a line. Let us suppose the statement true until r — ft and prove it for r = ft 4-1. As 5ft+1 = (<S£, ...,5('), we choose i-f 1 hyperplanes of Ph+1, say TT$, ...,7if. As ?if can be identified with P'1, for the inductive hypothesis there exists a function fi : <Sf -> Trf, satisfying i) and ii). Moreover, as /i(<Sf) = Pf is a finite set of points, we can arrange things so that neither of them lies in TT£_V,V = l...i. So we define / : Sh+l -4 Ph+1 as f / s h = fr. I REMARK Prj inherits the ordering of ST; it turns out to be a ^-configuration in Pr (see [4]).
LEMMA 2.3 Let Sh be a ft-segment with a(Sh) = w, nh a hyperplane of Ph+1 and / : <Sft -> 7rh a function as in lemma 1.3, with image /(<Sft) = 'Ph. Every hypersurface of Ph+l containing Ph, and of degree g < T(Sh) — u, splits and 7rft is one of its components.
Proof There is no loss of generality in replacing Sh with Sh(—u), so that we may suppose u = 0. We work by induction on ft. If ft = 1, P1 - f(Sl) is a set of r(Sl) + 1 points on a line in P2. Every curve of degree g < r(Sl), containing all those points must contain their line, by Bezout's theorem.
Now, let us suppose the statement true until ft — 1 and prove it for ft. Suppose E be a hypersurface of P ft+1 , deg(S) = g < r(«S ft ), S D Ph. If Sh = (So~l,...,S£~l), then Ph = (P^1 ,...,P^~1}; moreover:
T(SQ~I) > T(S^"1) > ... > T(S^) > r(Sh).
38
Beccari and Massaza
If we intersect E with 7rh, there are two possibilities: either E contains nh, or E n wh = E is a hypersurface in ?rft of degree g < r(S^~l),i = O...t. We show that the last possibility leads to a contradiction. In fact, replacing Sh with S^1 and E with E, we see, by induction, that E splits into ir^1 and EI, of degree g - I , that must contain P£ = (P^~l ,...,Pt~l). We observe that Si = (Si~l(-l),...,St~l(-l}) is again a fc-segment, with k < h, and a(Si) = 0, r(«Sf ) = T(Sh) - 1. So, the previous situation is restated, because deg(f,i) < T(S%). We can conclude that EI = Tr^Ul^, where c%(E2) - g-2. Step by step we get : E = Tr^"1 U KI~I U ... U Tif""1 U E t+ i. Condition h h a(S ) = 0 implies r(S ) = t, so that g < t, and E cannot contain the union of t + 1 hyperplanes. I THEOREM 3.3 Every r-segment Sr, with a(Sr) = 0, is a realizable sequence. If / : Sr -> Pr is as in lemma 1.3, and f(Sr) = Pr, then Pr is a realization of <Sr. Moreover, every realization of <Sr can be obtained in this way, choosing a convenient /.
Proof If r = 0 the statement is obvious. So, let us suppose r > 1. We prove that Pr is a realization of Sr, working by induction on r. If r = 1 the statement follows immediately observing that n distinct points in P1 are the zeros of an n-form in two variables. So, we suppose the statement true until r — I and prove it for r. Let us consider the (r — l)-decompositions Sr = (50r-1,...,<Sr1), Pr = (Pr0-\...,Prt-l),t > 1. By induction, P'~l is a realization of <Sf~ 1 (— i) in its hyperlane 7Tj_i of P r . If Q € P\ l and 6 is its corresponding number in S^"1 (—i), then 6 is the minimal degree of a hypersrface separating Q from its preceding points in Pf"1, no matter if we are working in Pr or in TTJ_I (see remark to th 2.1). If E' is such a hypersurface in P r , then E = E' U TTo U ... U TTJ_I is a hypersurface separating Q from all the points preceding it in Pr . It is enough to show that the degree d = 6 + i of E is minimal. In fact, we have: d < T(S^~I) < ... < T(SQ~I), and lemma 2.3 says that every hypersurface of degree d < r(Sj~1) — j, 0 < j < i containing Pj"1 must have Try as a component; this implies that every hypersurface separating Q from its preceding points of Pr must contain TTO-.TTJ-I, so that it must be a S. Finally, let Q = (Q0, ..., Qt) be a realization of Sr = (S^1 , ...,5[~1), where Qi corresponds to S[~l . We want to prove that Q is a Pr, for a convenient /. If r=l, it is immediate, because a sequence corresponding to points not on a line contains at least twice the element 1. So, let us suppose the statement true until r - I and prove it for r. By induction, Q0 is a P$~l\ moreover, lemma 2.3 implies that every minimal ipersurface E separating a point P E Qi from its preceding ones, must contain 7ro...7Tj_i. This implies that no element of Qi can lie on 7r0...7r;_i and that Qi is a realization of S^"1 (-i). As a consequence, induction shows that Qi is a P~l.
REMARK 4.3
Prop. 13. 2 says that a*(Sr) is an r - 1-segment. Let us observe
Realizable Sequences
39
that we can choose a realization Pj, such that, if Sr = (£$...S$) is the 1decomposition of Sr, then (/(a(501),...,/(a(lSt1)) = P*f(r~l) is a realization of a*(<S r ). It is enough to choose / in such a way that p*(r~l> lies on a hyperplane
TT of P r , not containing points of Prf — P^r~l>. Let us prove that, with this choice, Pj~ satisfies conditions i) and ii) of lemma 1.3. i) We work by induction on h.
Step 1 Let S1 = (SQ...S°) be a 1-segment of the 1-decomposition of Sr.
Then PJ° = (/(£§)) generates a 0-dimensional linear space. Step n Let us suppose the statement true until n - 1 and prove it for n. We consider a (n + l)-segment of the (n + l)-decomposition of <Sr, say <S"+1 = OS?,...,5"). Then a*(S"+l) = (a*(«S0"), ...,a*(S£)), and /(a*(«Sre+1)) = Pjn = (^(0n""1),...,p;^~1)), where the linear space jr*""1* generated by P*f(£~l) is
(n - l)-dimensional, by induction. Moreover p*^n~1^ fl^o" 1 = $> by condition ii) of lemma 1.3, applied to Sr. So, the linear space generated by P*fn is at least of dimension n; on the other end, it cannot be of bigger dimension, because it is contained in Trf)""™"1"1, where irn+1 is the (n + l)-dimensional linear space generated by P^+l, not contained in ir. ii) This follows immediately from the same condition on <5r. The procedure can be refined as follows. Choose, for every ft, f(a*h(Sr)) on a hyperplane of the linear subspace generated by /(a** ft ~ 1 )(<S r )). In this way, prf-h = f(a*h(Sr)) is a realization of a*h(Sr). REMARK 5.3 Remark 4.3, together with def.10.2, shows that a*(Sr) is a subsegment of the first (r - l)-segment of the (r - l)-decomposition of Sr. An obvious consequence of th.3.3 is the following statement, announced in the previous paragraph. COROLLARY 6.3 Mr is a realizable sequence. If F(l) = r, every realization of M.F is a Pj, for a chosen f.
THEOREM 7.3 Every strongly Macaulay-compatible sequence 5 € Sp can be obtained from Mr with a finite number of direct transpositions. Proof We use induction on the cardinality s of S. If s = 2, then S = (0,1) = Mr- So, let us suppose the statement true until s - I and prove it for s. We observe that if 5 — (di,...,ds-i,da) € Sp, then also 5' = (di,...,ds-i) is s.M.c.; set I" = 7s/. Comparing the 1-decompositions of Mr and Mr1 , we see that Mr comes from Mr1 by adding ds as a last element of a 1-segment or as the only element of a new 0-segment appearing in the 1-decomposition. In both cases, remark 7.2 iii) says that all the elements of Mr following ds are < ds, so that ds can be moved to the end of the sequence with a finite number of direct transpositions. Now we use induction on the couple S',Mr'I
40
Beccari and Massaza
Prop 12.1 and th.7.3 imply the following COROLLARY 8.3 A sequence 5 is realizable iff it is s.M.c.. Such an 5 is obtained from MJS with a finite number of direct transpositions. PROPOSITION 9.3 Let X be a scheme with Fx = Fand.M r = (<SJ~1,...,<S[~1) i) For every hypersurface F, of degree d < t + 1, A4r X nF ^s a subsegment of r —I
As a consequence: ii ) FXOF < 75' i 2 ) deg(X n F) < card(S')ii) Let 7rft be any /i-dimensional linear subspace of P r . Set: X/> = Xri7r ft and consider the /i-decomposition (S$ , ...,<Stft) of Air- The segment .Mrx is a subsegment of SQ and, as a consequence:
< card(S%). Proof i) The minimal degree of a hypersurface containing Y = X n F is d' < d; moreover, .MrY is a k- segment S' , k < r, which is a subsegment of .Mr(see prop. 21.2). If k < r, then .MrY ^o"1 an(^ 0 's true- If A; = r , the r - 1-decomposition of A'frv 'ls °f tne form: A1rY — ("^'o"1' •••><5'd'~-1i)i where 5'p1 <<Sjr-1, and again i) holds. Clearly, ii) and i 2 ) come from i). ii) This statement can be obtained by repeatedly applying i), in case d=l. More directly, we observe that if Fx h (l) = k, then necessarily k < h, so that A^r Xh is a subsegment of SQ (see prop.21.2 and def.10.2). Then iii) and ii2) follow immediately. I With the same notation of prop. 9. 3, we get, as an immediate consequence, the following COROLLARY 10.3 For every degree d hypersurface F of 7r ft , d < t + 1, we have: F X nF < Jigh-1 sh~l)> anc^' ^ a consequence, deg(X. n F) < REMARK 11.3 A consequence of th.3.3 is the following one. Let H be the Hilbert function of a projective scheme of dimension d, (or, using another terminlogy, an O-sequence of dimension d) and suppose it to be (d + 1)differentiable. Then its d-th difference F is an O-sequence of dimension 0 (see [10]). Macaulay's theorem assures that F is the Castelnuovo function of a standard 0-dimensional graded algebra. Theorem 3.3 produces a projective, reduced! 0-scheme X, having F as its Castelnuovo function. If A is the coordinate ring of X, then A[X\, -..,Xci\ is the coordinate ring of a projective, reduced scheme whose Hilbert function is H. So we restate th.4.1 of [10]. REMARK 12.3 Let us recall cor.15.2 of [1], which is a reformulation of results in [11] and [12]. There we proved that, if 5 is a realizable sequence satisfying the
Realizable Sequences
41
condition : ~fs(n + 1) = 7s(n + 2) = s, s < n + 1, then every X realizing <S can be reordered in such a way that its corresponding sequence becomes ( S i j S ^ ) , where: 752(t) =0, t>n.
jSl(t) = -js(t), t> s,75j(t) = Tc(t), 0 < t < n + 2, C an unmixed curve of degree s, containing the subset X' of X corresponding to Si. Here we observe that, if X is a fc-configuration, realizing M~/s, Si turns out to be the first 2-segment of the 2-segment decomposition of M-ys and C is a plane curve splitting into s lines. In other words, there is always some scheme, realizing S, that contains at least s(2n + 7 - s)/2 points on a plane curve of degree s.
References [I] G.Beccari-C.Massaza, A New Approach to the Hilbert Function of a 0Dimensional Projective Scheme, Rapp.Int. Dip.Mat.Politecnico di Torino n.41, 1999. [2] O.Zariski-P.Samuel, Commutative Algebra, Van Nostrand, Princeton, N.J., (I960) [3] L.Robbiano, A Introduction to the Theory of Hilbert Functions, Queen's Papers in Pure and Applied Math, 85 (1990), Kingston. [4] A.Geramita-T.Harima-Y.S.Shin, An Alternative to the Hilbert Function for the Ideal of a Finite Set of Points in Pn, Mathematical Preprint, Queen's University, Kingston (1998-06). [5] L.Gruson-C.Peskine, Genre des courbes de I'espace projectif, Algebraic Geometry, Lecture Notes in Math. 687, Springer (1978). [6] F.Macaulay, Some Properties of Enumeration in the Theory of Modular Systems, Proc.London Math.Soc. 26(1927), 531-555. [7] C.Greene-D.J.Kleitman, Proof Techniques in the Theory of Finite Sets, Mathematical Association of America 17, (1978), 22-79. [8] R.Stanley, Hilbert Functions of Graded Algebras, Adv.in Math. 28 (1978), 71-82. [9] A.Bigatti-A.Geramita-J.Migliore, Geometric Consequences of Extremal Behaviour in a Theorem of Macaulay, Trans.Amer.Math.Soc. 346 (1994), 203-235. [10] A.Geramita-P.Maroscia-L.Roberts, The Hilbert Function of a Reduced Kalgebra, J.London Math.Soc. (2) 28 (1983), 443-452. [II] E.Davis-A.Geramita-P.Maroscia, Perfect Homogeneous Ideals: Dubreil's Theorem revisited, Bull. Sc. Math., 2e serie, 108(1984), 134-185. [12] D.Davis, Complete Intersections of Codimension 2 in Pr: The BezoutJacobi Theorem Revisited, Rend.Sem.Mat.Univ.Pol.Torino., Vol 43,2 (1985), 333-353.
Lexsegment ideals in the exterior algebra VITTORIA BONANZINGA D.I.M.E.T., Facolta di Ingegneria, Universita di Reggio Calabria, Via Graziella (Feo di Vito) 89100, Reggio Calabria (Italia) [email protected] or [email protected].
INTRODUCTION
Let V be a k-vector space with basis ei,..., en, and let E be the exterior algebra over V. For any subset a = {ii, i?,...,id} of {1,..., n} with i\ < i-2 < ... < id we call ea = e^ A ... A ejd a monomial of degree d and we denote the set of all monomials of degree d > 1 by M^. An ideal ICE generated by monomials is called a monomial ideal. We order the monomials lexicographically so that e\ > 62 > • . . > en. A monomial ideal / C E is called lexsegment ideal if it is generated by a lexsegment of monomials, that is, a set of the form: L(u, v) = {w € M^ /u>w> v}. Lexsegment ideals in this generality were first introduced in polynomial rings by Hulett and Martin [1]. In extremal combinatorics one usually considers more special lexsegment ideals, which we call initial lexsegment ideals. These are ideals which in each degree are generated by initial lexsegments, that is, sets of the form: Ll(u) = {w € Md/w > u}, called simple lexsegment in the usual terminology usually are considered. The support of a monomial u G E is supp(u) = {i : e^ divides u}. The shadow of a set S of monomials in M^ is the set of the non-zero monomials Shad(S) = {sei : Vs € 5, Vz ^ supp(s)} . We define the i-th shadow recursively by Shadz(5) = Shad(Shadz~1(5)). The initial lexsegments have the nice property that their shadow is again an initial lexsegment. This important property of initial lexsegments is crucial in the proof of Kruskal-Katona theorem. This fact is not true for arbitrary lexsegments. A lexsegment L is called completely lexsegment [1], if all the iterated shadows of L are again lexsegments, that is, if for each i the set Shad'(L) is a lexsegment. De Negri and Herzog 43
44
Bonanzinga
in [2] characterized the completely lexsegments in polynomial rings and gave sufficient conditions for an ideal generated by a completely lexsegment to have a linear resolution. We study ideals in the exterior algebra generated by lexsegments of monomials. In Section 1 we recall some definitions and introduce some notation and we prove a persistence theorem which states that all iterated shadows of a lexsegment are again lexsegments if the first shadow has this property and we develop some technical lemmas needed in the proof of Theorem 1.1. In Section 2 we give a full characterization of completely lexsegment ideals. Our approach is similar to that used in the symmetric case, but in the exterior algebra the following isomorphism Torf(E/I\ k) = Hi(C.(ei,. . ., en); E/I],
where C.((ei,. . . ,en);E/I) is the Cartan complex, plays a crucial role. Finally, in Section 3 we give sufficient conditions for lexsegment ideals to have a linear resolution. The author is grateful to Jiirgen Herzog for several inspiring discussions on the subject of the paper and for his hospitality at the University of Essen.
1
A PERSISTENCE THEOREM FOR LEXSEGMENT IDEALS
We have to introduce some notation and we recall some definitions which we will use throughout this paper. Let u E MJ be a monomial. We set m(u) = min{i : i € supp(u)} , M(u) = max(u) = max{« : i £ supp(u)} , u' = it/eM(u) and u" — u/em^. If u € M^ with d < n we denote by c(u) the monomial of degree n — d such that i €supp(w) if and only if i £ supp (c(u)). In order to simplify notation, we set uv for the product u A v of any two elements u and v in M^. An element u 6 E is called homogeneous of degree d, if u € EJ, where EJ = /\d V. An ideal / is called graded if I is generated by homogeneous elements. If / is graded, then / = © It, where It is the K- vector space of all homogeneous elements u € / t>o of degree t. Let u = e^e^ • . -&id and v = Gj1ej2 . . . ejd be two monomials of Md, with 1 < ii < i-i < . . . < i& < n and 1 < ji < j% < . . . < jd < n. The lexicographic order on the monomials of M& is defined as follows: u > v if the first non-zero coordinate of (i\ — ji,- • • ,id — jd) is negative. We will denote by L^(u) — {w € Md/w < u} a final lexsegment set of degree d. For example, if n = 5 and d = 3 then the {626365, 636465 , 636465} is a final lexsegment. A homogeneous component of a graded ideal will be called lexsegment if it is spanned as K- vector space by a lexsegment. Moreover, a graded ideal is called completely lexsegment if all components of / are lexsegments, i.e. if all the iterated shadows of a lexsegment are again lexsegments. Given u = eil . . .eid, and A; € N with k < d, then we set We can associate to a monomial
u = e^ . . . eid a d-uple of integers
Lexsegment ideals in the exterior algebra
45
(ii , . . . , id)- Now we consider the decomposition of (i\ , . . . , id) into blocks of consecutive integers: Bo,.-.,Br, where j = 0,...,r, Bj — {ikj+i, • • • ,ikj+i}
with &o = 0 and kr+i = d. For j = 0, . . . , r — 1 denote by Gj the gap between Bj and J5j+i, that is, Gj = {i^+i + 1, . . . ,«fy +2 — l} • Note that |Gj = ifcj+i+i - ifcj+i - 1 and Gr = n- id. The gaps of (n, . . . , z d ) are called the gaps of w. A monomial ideal / C E is called stable if for each u € J and all j < M(«) one has that &jeff\{M(u^ £ I. A. monomial ideal / C E is strongly stable if for each ea € / and for each j € a one has that ejC^j} € / for all i < j. This section is devoted to the proof of
THEOREM 1.1 Let u = e^ . . . eid >v = 6jl... ejd be two monomials in Md,
with d < n and let L = L(u,v). Suppose that Shad(L) is lexsegment. Then all the iterated shadows of L are again lexsegment, in other words, I = (L) is completely lexsegment. For the proof of the theorem we need some preparations. In the following proposition we describe the largest and the smallest element in the shadow of a lexsegment PROPOSITION 1.2 Let u = eh . ..eid > v = eh ...ejd be two monomials in Md, with d < n. We denote by s(u) and s(v) the largest and the smallest element of Shad(L(u, v)) in the lexicographic order, i.e. for all w 6Shad(L(«,u)), s(u) > w > s(v). Then (1) s(u) = e m ( c ( u )) u in the following cases: (a) u = v; (b) n > 1;
(c) i'i = 1 and ik ^ k for the first k with ik ^ jk(2) s(u) = e,\e
Proof, (la) Suppose u = v. Since m(c(u)) < i for all i ^supp(u), it follows that e m(c ( u ))U > u&i. (Ib) If i\ > 1, then m(c(u}} = 1. We have to show that if w GShad(L(u, v}) then e\u > w. Since w eShad(L(u,u)) there exists an element WQ with u > WQ > v and an index i ^supp(^o) such that w — &i WQ hence e\ u > &i WQ because e\ > &i and u > WQ. (Ic) Let u - eiej 2 . . . eik_leik ...eid and v = e\e^ . . . eik_1ejk . . . ejd with Jk > ik > k; the index m(c(u)) is such that z'2 < . . . < is-i < m(c(u}) < is < . . . < ik, with 1 < s < k. Therefore u = e\62 • • • es-i&is . . . &ik . . . e,d
46
Bonanzinga
and v — eie-2- • .es-\£ja • • - e j k - • -ejd wi*h ^s > s- It follows that em(c(u)) u = 6162- • .&s-\eseiseik. . . ejd = egi. Let weShad (L(u,v)), there exists an index i and an element WQ 6 £(u, w) such that w = €,{ WQ ^ 0. Since U;Q € £(«, u) we have WQ = ^162 . . -es-\^t, • • -^td- Since w ^ 0 it follows that i > s. Therefore es u > eiWQ because es > ei and u > WQ. (2) Let u = eie-z . . . ek-iekeik+l ...eid and v = eie2 . . . ek-iejkejk+1 . . . ejd with ik > k. The element WQ = e\ . . . ek^iek+\ek+2 • • •ed+i is less than u, since ek < e^+i, and WQ > v because k + 1 < jk, k + 1 < jk+i, • • • ,d+l < jdTherefore WQ € L(u,v) and to = ekwo = e\e.i . . . e^+i €Shad(L(u, v ) ) . (3) We have to show that if w € Shad(L(u,v)) then w > ve^^^y, but w eSh&d(L(u,v)) implies that there exists an index i and an element WQ 6 L(u,v) such that w — ej WQ ^ 0. We have two cases. I case: If too = w, there exists an index i with i ^supp(too), such that e^o 7^ 0, so i €supp(c(w)), i < M(c(v})\ hence &i > M(c(v)) and eiWQ > vM(c(v)); II case: If WQ = 6^612 ...ej d > v = efcjgjtj . . .ekd and i < M(c(v)) we obtain the desired result; if WQ > v and i > M(c(v)), we denote by s the smallest index such that is < fc s , we distinguish two subcases: a) M(c(v)} > ks; b) M(c(v)) < ks, in case a) i > is and M(c(v)) > ks so BIWQ > veM^c^\\ in case b) M(c(v}} = ks — 1, we have two additional subcases if is < M(c(v)) again e^wo > veM(c(«))! ^ ^s — M(c(v)) the monomial e M(c(v))eka • • •ekd hasn't gaps so is of this form etet+i . • .e^ and the monomial 6js . . . 6id has only one gap of lenght 1 and so &ia . . . 6id &i must coincide with et&t+i • • • e
LEMMA 1.3 Let u = e^ . . . eid > v = e^ . . . Sjd be two monomials in Mj with ji > ii > 1, I = (L(u,v)) andK — (£/(«)). // the Shad(L(u,v))is lexsegment then the Shad(L-^(u)) is lexsegment, too. Proof. We have Shad(L*(u)) = ^(«e M(c{M)) ) and ShadMd = Md+i. Therefore it follows that
= Md+l \ u> 6 Md+i : w
C Shad(L(u,e n _ d+1 ...e n _ie n ) = Shad(L / (w)). By hypothesis Shad(L(«, v)) is lexsegment, hence by Prop. 1.2 Shad(L(«,t;)) = L(ei«,ue M ( c ( r; ))). We will show that we M ( c ( u )) > v eM(c(v))> , and therefore we will have
)),e n _d...e n _ie n ) cShad(I/(u)) and so Shad(L^(M)) = L-^(eiu) is lexsegment. In order to show that ueM(c(u)) >veM(c(v))i we observe that M(c(u)) > i\ in
Lexsegment ideals in the exterior algebra
47
fact if M(c(u}) < ii, u is the smallest element of degree d in the lexicographic order, but u > v. It is clear that if M(c(v)) > i\ then i\ — j\ < 0, therefore ue M(c(u)} > veM(c(v))- If M(c(u)) < j\ then v is the smallest element in the lexicographic order of degree d and M(c(v)) — j\ — 1, with j\ > i\; therefore ji = ii + $ with s > 1; if s > 1 then M(c(v)) = j\ — 1 = i\ + s — 1 > ii, hence ue M(c(u)) > ue M ( c ( v)) ; if s = 1, then M(c(i>)) = n, ji = n + 1, ji = n ii + 2 > • • • > 3d — ii + d, therefore u eM(c(u)) = veM(c(v))-
LEMMA 1.4 Let u > v be two monomials in Mj, J — (Ll(v}} and K = (L,f (u)}. Then J fl K is generated in degree d and d + I. Proof. The lemma follows by Corollary 3.4 of [3] and by arguments similar to those in [2]. D LEMMA 1.5 Let u > v be two monomials in Mj, I — (L(u,v)), J — (Ll(v)) and K = (L^ (u)). If I is completely lexsegment then I = J fl K. Proof. We first consider the case of one element. If u = v and deg u = n — 2, L(u,u] — (u) is completely lexsegment if u has a gap of two neighbour elements, in fact Shad (u) = {ej u,uek} is a lexsegment if k — j + 1, that is, Shad (it) = {ejU,Mej + i}, hence
Jd+i r\Kd+i = L*(uei+i)r\Lf(uei) — {eju,ue;+i} =Shad(u). If u — v, degu < n - 2, and / is completely lexsegment then we have: (1) u has at most one gap; and (2) if u has one gap, then its lenght is at most 2 or it is end gap. Because of 1.4 it suffices to show that Id+i = Jd+i H Kd+\. In fact, in order to prove (1) suppose u has more than one gap, then u = e\e-i . . . efce^+i . . . ereses+i . . . en with I > k + 1, s > r + 1, and s(u) = e m(c(u ))« = eie2 . . . ekek+ieeee+i . . . ereses+i ...en > w = 6163 . . . ekek+ieeee+i . . . er-ier+ieses+i . . . en > s(v) = ueM(c(u)), but w ^Shad(n), a contradiction. For the proof of (2) we suppose that u has one gap G. If |G| = 2 then d = n — 2, therefore if/ is completely lexsegment then I = J n K. If \G\ > 2 then u = eie2 . . . e^e^e^i ...en with t > k + 3, therefore s(u) = eie 2 . . .ekek+leeet+i. . .en > w = eie2. . .ekek+2et-iee+i. . .en > s(v) with s(v) = eie 2 .. .e^l-i^t • • • en, but w ^Shad (u), a contradiction, hence u — e\&2 ... e; therefore (u) = (Lz(u)} C\ (I/(it)) — (u) n (M^) = (u). If i\ = ji > 1 then / is not completely lexsegment. In this case, u < e 2 63...ed + 1 . We choose w < v and we define m = e\w ^ 0, then m € L(s(u),s(v)). In fact, s(u) = e\u and u > w. This implies s(u) = e\u > a))V = s(v), since Mfy) > 1, so 1 ^i
48
Bonanzinga
Suppose that m is in Shad(L(u,u)) then m = e^n, with n € L(u,v). We have e\w — m = e;n. Suppose that i > 1 then 1 €supp(n), therefore n > u, but it is a contradiction. So i = 1 and n = w, a contradiction because u> < v. If 1 = i\ and A; is the first index such that ik ^ jk and if- ^ k then ik — (k ~ 1) > 1 and jfc — (A: — 1) > 1, the ideal generated by the lexsegment L(u^k\v^) is not completely lexsegment, hence the ideal 7 = (L(u, v}} is not completely lexsegment. It remains to consider the case 1 = i\ and k is the first index such that ik / jk and ik = k. Then s(u) = e\e^ . . . &d+i and s(u) = e\u > e\w = m and m — e\w > &M(C(V))V = s(v}-> since M(v) > 1, so 1 £supp(eM(c(v))v)- Suppose that m is in Shad(L(u,v)) then m = e^n, with n € L(u,v). We have e\w = m — e^n. Suppose that i > 1 then 1 £supp(n), therefore n > u, but it is a contradiction. So i = 1 and n — w, a contradiction because w < v.lfl — i\ and k is the first index such that ik ^ jk and ik ^ k then ifc — (&-1) > 1 and jk~ (k— 1) > 1, the ideal generated by the lexsegment L(u^h\v^) is not completely lexsegment, hence the ideal / = (L(u,v)) is not completely lexsegment. It remains to consider the case 1 = i\ and k is the first index such that ik ^ jk and ik = k. Then s(u) = eie^ • • • &d+i and Jd+i^Kd+i - L(eie 2 ...ed + i,ve M ( c ( t ,)))nAf d =ShadL(u,v) = Id+i and by Lemma 1.4 it follows the assert. D
It is easy to see that shadow of an initial lexsegment is again an initial lexsegment. Therefore the persistence theorem for initial lexsegments is trivial. The next proposition gives the proof of the persistence theorem for final lexsegment ideals.
PROPOSITION 1.6 Let u be a monomial in Md with d e 3 e 4 ... Proof. We may assume that d < n — 2, since otherwise the problem is trivial. The implication a) =4> 6) is obvious. 6) => c) Suppose u < 6364 ... e^+2-
Let w be the smallest element with w > u. Then w < 6364 . . . e^+2 and hence 62 does not divide w. Therefore e^w ^ 0 and e\u > BZW, i.e. e^w € L Suppose that e^w eShad(^). Then there exists v < u and e; with e;v = Since v < u < 6364 . . . ej+2 it follows that e2 does not divide u, and so we must have ej — e2 and v = w. But this is a contradiction since w > u. c) =£• 6) We distinguish two cases.
Lexsegment ideals in the exterior algebra
49
I case: If e\ divides u then Shad(K) = M^+i is a lexsegment. In fact, the inclusion Shad(K) C M^+i'is trivial and if u; € M^+i then w — em(w)w' with m(w] = mm{i : ei/w}, therefore w' < u and w €Shad(K). II case: If e\ does not divide u and u > 6364 . . . 6^+2 then Shad(K) — L , f ( e i u ) . In general one has Shad(Jf) C L,f(eiu). If w €. Lf(e\u) then e\u > w = em(w)w'; if m(w) — 1 is evident that u > w' otherwise w' <
6364 . . . ed+2 < u, hence w eShad(K). Now we show (a). If (c) is satisfied for the ideal generated by K, then it is also satisfied for the Shad K. Hence, since (b) and (c) are equivalent, then Shad(Shad(K)) is lexsegment. Applying this argument repeatdly we see that all the iterated shadows of K are again lexsegments. D After these preparations we can prove the persistence theorem Proof. [Proof of 1.1] We distinguish 3 cases: (1) If u = v and d = n — 2, then ShadL is lexsegment if u has a gap of two neighbour elements, so ShadL = {uei, uei+i} and it is obvoius that
L is completely lexsegment; if d < n — 2 and Shad L is lexsegment then u — 6162 ... &di in this case ShadL is an initial lexsegment and therefore L is completely lexsegment. (2) If ?! = 1 and k is the first index such that ik ^ jk and ik — k, then s(u) = e\e-i . . . Crf+i, hence the assertion follows. (3) By Prop. 2.2, (b), without loss of generality, we may assume that
1 < i\ < ji- By hypothesis, ShadL is lexsegment, therefore we have from Lemma 1.3, that Shad L^(u) is lexsegment too and by Prop. 1.6 K = (L^(u)) is completely lexsegment. The ideal J generated by the initial lexsegment Ll(u] is completely lexsegment too. Hence (J n K}d+i is lexsegment and ( JC\K)d+i =Shad L — L(e\u, veM(c(v))} since both vector spaces are spanned by the same lexsegment. By Lemma 1.3 it follows that the ideal (L(u, v)} — J n K is completely lexsegment, as desired. D
2
A CHARACTERIZATION OF COMPLETELY LEXSEGMENT IDEALS
In this section we will give a full description of the completely lexsegment ideals.
THEOREM 2.7 Let u — e^ . . . &id > v = e^ . . . &jd be two monomials in and I = (L(u, v } ) . Let k be the smallest integer such that ( i k , j k ) ¥" ( k , k ) . Then I is completely lexsegment if and only if one of the following conditions holds:
(1) u = eie2 . . . ek^ieik ...eid with eikik . . . eidid > e^+k^s+k • • • e
50
Bonanzinga
(2) ik = k and for every w < v there exists i > k such that e, divides w and ekw/ei < u. For the proof we need the following technical results:
PROPOSITION 2.8 Let u = e^ . . . ad > v = e^ . . . ejd be two monomials of degree d and let k be the smallest integer with (ik,jk) ¥" ( k , k ) . Then
(a) |L(u,«)| (b) |Shad(L(«,u))|= (c) a(«)(*> = «(«(*>) and a(t>)<*> = s(v^}. Proof, (a) We show the existence of a bijection
Then w^ = erk_(k_l}erk+1_(k_l} . ..erd_(k_l}. k
w(
) > u(fc) ? hence ^7 is an injective map.
This implies that
We define now the map
rd
so f is surjective. Therefore
w = e\e.i . . . ek-\eT . . . er_eser ...erd with eikeik+l . . .eid >eTk.. .erd > ejk. . .ejd and s ^supp(eie2. . .e fe _ie rfc . . .erd). Then
->Shad(L(«,i7)),
so (p is bijective. Therefore |Shad(L(«,w))| = Sha,d(L(u^k\v^)}
as desired.
(c) We distinguish 3 cases. 1) If i\ > 1, then u^ = u and v^ = v; u > v implies that there exists an index s such that js > is > 1; s(u) — e\ u and s(v) = veM(c(v)) witn M(c(v)) > is > I therefore s(v) does not contain e\ and s(u)^ = s(u) = s(u^). Moreover s(v^) = s(v) = veM(c(v)) —
Lexsegment ideals in the exterior algebra ejj ...eja • • . ejdeM(c(v)) with js > therefore s(v)^ = s(u) = s(«( fc )). 2) If i\ = 1 and k is the first then j'fc > z fc > fe. Let ir be the eie2...e r _iej r ...ej f c _jei f c ...ej d , u
51
is > 1. It implies M(c(w)) > is > I index such that ik ^ jk and if- ^ fc, first index different from r. Then u = = 6^2 .. . e r _iej r ... &ik_1ejk .. .ejd and
m(c(u)) = r < k. We have u(A;) = e i r _ ( r _ 1 ) e i r + 1 _ ( r _ 1 ) ... ei d _ (r _i) and s(u( since ir > r implies ir — (r — 1) > 1. We have:
s(u) = 6162 ... er s(v) = eie2 , . . e r _ie
with M(c(v)) 7^ r, because r < k < ik < jk and M(c(v)) > ik > r. Therefore s(u)W = eie^.^.!)... eid_(r_i). Moreover w (r) = e i r _ ( r _ 1 ) .. .e id _ (r _ 1); s(w (r) ) = e i r _( r _ 1 ) .. -^-(r-ije^^,))), and a(w)( r ) - e i r _ ( r _!)... e id _ (r _ 1) e M(c(t , )) _ (r _ 1) ; hence s(«W) = s(w). 3) If i\ = 1 and /c is the first index such that ij. 7^ jfc and i^ = A;, then u = eie<2.,.ek-iekeik+i ...eid and u-eie 2 ... ek_iejk ...e jd with jk > ik = k. Therefore uW = e fc _ (fc _ 1) e ifc+1 _ (/fc _ 1) .. .e id _ (fc _ 1} = eie^^^!).. .eid_(k_-i), u (fc) = e j - fe _( fc _ 1 ) . . . ejd_(k_l}, s(u) - eie2 ... ek-ieh ... ed+\, s(v) = eie 2 .. .efe-ie^.. .ejdeM(c(i;)) with jk >k, hence s(u)(fc) = eie2. - .e d _ fe+2 = a(u(*)) and 5(u( fe )) = ejk^k_l}.. •ejd_(fc_1)eM(c(^fc))) = s(v)( fe ) = =e
jHfc-i)- • •e j d -{A ; -i) e M(c(t)))-(A : -i) ) as we wanted show.
D
COROLLARY 2.9 Let u > v be two monomials of Md then Shad (L(u,v)) is lexsegment if and only if Shad(L(u^k\v^)) is lexsegment. Proof. If the shadow of the lexsegment L(u, v) is lexsegment then |Shad(L(ii,D))| = \ L ( s ( u ) , s ( v ) ) \ . Applying Prop. 2.2 and the previous relation we can write this chain of equalities:
iad(L(«« «(*>))| = |Shad(L(n,«))| = \L(s(v.),s(v))\ = \ L { s ( u ( k ' ) , s ( v ( k ' } \ , and, comparing the first and last element we obtain that Shad(L(ti(*>y fc )))| = L (s(uW),s(uW) , hence Shad(L(«(*)y*>)) is lexsegment. The proof of the converse is analogue. D The main ideas of the proof are similar to those in the symmetric case ([2]). In the details however the proof differs essentially. In particular one has to consider Cartan cycles instead of Koszul cycles. Proof. [Proof of 2.1] By persistence theorem, / is completely lexsegment if and only if Shad(L(it, v)) is a lexsegment. If *i = ji > 1 then / is not completely lexsegment. In this case, u < 6263... e<2+i. We choose w < v and we define m = e\w ^ 0, then m € L(s(u),s(v)). In fact, s(u) = e\u and u > w. This implies
52
Bonanzinga s(u) = e\u > e\w = m and m = e\w > e^^^v = s(v),
since M(v) > 1, so 1 ^supp (eM(c(v))v}- Suppose that m is in Shad(L(u, v)) then m = e^n, with n € L(u,v). We have e\w = m = e^n. Suppose that i > 1 then 1 €supp(n), therefore n > n, but it is a contradiction. So i = 1 and n = w: a contradiction because w < v. If u = e\ei . . . ek-i€ik ...&id with &ik... eid > e2+ke3+k . . . ed+2 and v = ei&2 . . . ek-\en-d+k ...en then u^ =
)- • -eid-(k-i) with e^^). . .eid_(k.i) > e3e4. . .ed+2-(k-i)
and
Since |shad(L(u(*>,u<*)))| = |Shad(L(«,u))| and by Prop. 1.6, Shad(L(u(*>,«(*))) = ShadL'(«(*>) is a lexsegment, then Shad(L(u,u)) is a lexsegment too. If ik = jk > k, since Shad(L(tt(*),t;(*))) = |Shad(L(u,v))\, after removing the block of the first common elements to u and v, arguing as before, it is easy to see that / is not completely lexsegment. If ik > jk > k, we consider the elements ft;) _ i rtjj _ yf
eik...eid < e2+ke3+k.. .ed+2 then e ifc _ (A ._ 1 ).. .ej d _ (A ._ 1) < e 3 e 4 .. .e d+2 -(fc-i)Let u; € M<2 be such that u; < t/*) and we define m = e\w ^ 0, then m € L(a(«(*)),a(«W)). In fact, «(«(*>)) = ei «(*) and «(*> > to. This
implies s(u^}} — e\ u^ > e\ w = m and m = e\ w > v^eM^v(k)^ = s(v^), since M(c(v^))) > 1, so 1 ^supp(v^eM,c,v(k)\\). Suppose that m is in Shad(L(uW,«W)), then m = e»n, with n € L(u(k\v(^}. Therefore e\ w — m = e^n. Suppose that i > 1 then 1 Gsupp(n) and n > u^k\ a contradiction. So i = 1 and n = w, a contradiction because w < v^. If ik > jk> k and v^e\e2.. .ek-ien-d+k- • -^n then tr ' ^en-d+\- • -Zn-k+iWe show that the element
v* = ei&n_d+i... en-k+\ € In fact,
since M(c(u( /c ))) > n - d + 1. Since that u* is in Shad(L(«W,« (fc) )), then w* = gjZ with z e L(u^,v^). Therefore v* = eien^d+i • • • e n -fc+i = ei^Suppose that i > 1 then 1 Gsupp(z) and z > u^k\ a contradiction. So i = 1 and z — en-d+i • • • Cn-fe+i) a contradiction, because en-d+i • • • en-k+i < v(k'. It remains to prove that for k = ik, I is completely lexsegment if and only if condition (2) holds. Let J = (Ll(v)) and K — (L^(u)) be the ideals generated respectively by L l (i>) and I/(w). J is completely lexsegment because it is generated by
Lexsegment ideals in the exterior algebra
53
an initial lexsegment, and K is completely lexsegment, too since i\ = 1 and u > 6364 . . . ed+2- Hence JC\K is completely lexsegment. We have, / = JC\K, (I)d = (JC\K)d and by Lemma 1.4 JnK is generated in degree d and d+ 1. therefore it follows that / is completely lexsegment if and only if / = JC\K, that is, if and only if J fl K is generated in degree d. Let L be the ideal J + K = (Md). Therefore it follows that / is completely lexsegment if and only if / = JC\K, that is, if and only if J n K is generated in degree d. Let L denote the ideal generated by all the monomials in M&. Then J n K is generated in degree d if and only if the map
is surjective, where T;(/) denote the vector spaces Torf(E/I;k). We shall consider the following isomorphism Torf(E/I;k) = Hi(C.(ei,. . .en);E/I)
where C.((ei, . . . en);E/I) is the Cartan complex, [4]. By [3], a basis of T2( J) is given by the homology classes of the cycles u/:r£i~l~eM(u'>) with w € M^,
i < M(w), w > v where ei, . . . , en is a standard basis of Nn. Analogously, a basis of Tz(L) is given by the homology classes of the cycles y/a^'+^W' with w E Mdi i < M(w). We call this kind of cycles classical cycles. It is clear that the classes •U/£(£'+£M("'>) with i < M(w), w > v are in the
image of (p. If w € L^ (u) \ Ll(v), that is w < u, then the differential of the corresponding classical cycle is
d
WX£M(*)
ifi = M(w).
If i 7^ 1, then w'&i e K; because if w = eki^-k^ • • •ekd < v < u, then > ji > H = 1, so L'a;(£i+£M('»))l £ T-2(K}. It follows that the classes /o;( £i+£M ( u ')'
with w < v and 1 ^ i < M(w) are in the image of ?.
Let T be the fc-subvector space of T2(L), generated by L/a;(ei+eMO")) I for
every w € Md, 1 ^ i < M(w), and [io'x^1+£M('")'l for w > v. Then • T2(L)/T is surjective. By [3], a basis of T m(z). We call such cycles non-classical cycles. If i > M(z), then M(z"ei) = i, and z"x^m^+£i^ = (z"ezyX(£m^+eM^"*0}. In fact, if z = e^e^ • • -£kd then z" = e^ . . . efc d , M(z) = kd and if i >
M(z) then M(z"ei) = M(ek2 . . . ek
54
Bonanzinga
Therefore, if m(z) ^ 1, then
If m(z) - 1, then Ip([z"x^i+£^^}) = {(z"ei}'x(ei+£M^"^\ which is one element of the canonical basis of T-2(L}/T. Let now i < M(z). Considering the boundary of z" if i ^ 771(2 then
if i — m(z) then
since ? ^ 1 then z/eM(z)x^i+eM(*^
e
^- Moreover
M(2) =M(eklek2...ekd) = kd = M(z"ei) = M(efc2 . . . e, . . . ekd). Thus, if i ^ m(z)
then
If t = m(z) or m(z) ^ 1, then v([z" x(£™^+s^}} = 0. If t ^ m(«) = 1, it follows that
is an element of the canonical basis of Ti(L}/T. Therefore, a basis of the image of ip is given by the elements
with z < u; i 7^ 1. Now we claim that lp is surjective if and only if condition (2) in the theorem holds, that is, if and only if for every w < v, there exists 1 < i < n and z < u such that w — zei/e\. In fact, the canonical basis of T2(L)/T is given by the cycles [W'X^I+£M!-W^] with w < v. Therefore if condition (2) holds, then [W'X^I+£M^] — [(zei/ei)'x^1+£M(~ze'/e^} is in the image of
Lexsegment ideals in the exterior algebra
3
55
LEXSEGMENT IDEALS WITH LINEAR RESOLUTION
In this section we give sufficient conditions for lexsegment ideals to have a linear resolution. We believe that these conditions are also necessary THEOREM 3.10 Let I be a lexsegment ideal. With the notation of 2.7 the ideal I has a linear resolution in the following cases: (1) / is an initial or final lexsegment ideal; (2) / satisfies 2.1(1); (3) 1 ^ «i 7^ ji, and eim/eM^m-j < u for every m < v.
Proof. Initial and final lexsegments ideals, generated in a fixed degree, are both stable. Thus it follows from [3] that these have a linear resolution. In case (2), / is isomorphic to the final lexsegment ideal generated by (eik+l-(k-i) • • •eid-(k-i)} in n — (A; — 1) variables, hence / has a linear resolution. In order to prove that / has a linear resolution it is enough to show that
is surjective for every s > 2, where L is the ideal generated by all monomials of degree d. By [3], the homology classes of the cycles w'x^kl+ek2+...+£ks+^M(u,))^ with w e Md and 1 < ki < k2 < ... < ks < M(w) form a basis of T s +i(L). It is clear that if w is in Ll(v), then £ J [w'x( kl rek+...+ek3+eM(w))^
jg jn
thg image of
^ If
w
w < v, then the differential d is:
if .7 = 1 if
ks = M(w).
If k\ ^ 1, then w'e^ £ K for every kj, because if w = e^e^ . . . e^d < v < u, then k\ ^ j\ > i\ — 1 and so w'x(£ki+£k2+'"+Sks+£M(w^ is a cycle whose homology class belongs to Ts+i(K). Thus [ w ' a; ^ A; i +£fc 2+-+ e * s + £ M(^))] is in the image of >. Hence in order to prove that is surjective it remains to show that the elements of the form [w'x^ki+£k^+'-'+£ks+£M^} are in the image of $, for every w < v. By hypothesis there exists z < u such that w = zeM(w^/ei. Since M(z) < M(w) it follows that w' = \zejV[(w)/ei ) = z/ei = z" and so u/ 2^1+^2+-+^ + £ MW) = z»x(£m(z)+£k2+...+£ks+£M(w)) js a non-classical cycle. Hence [w'x^£l+£kl2+'"+£ks+£M<w^} elm^, as desired. D
56
Bonanzinga
References [1] H. A. Hulett, H. M. Martin, Betti numbers of lexsegment ideals, Preprint 1996. [2] E. De Negri, J. Herzog. Completely lexsegment ideals, Proc. Amer. Math. Soc. 126 (12) (1998), 3467-3473.
[3] A. Aramova, J. Herzog, T. Hibi. Gotzmann theorems for exterior algebras and combinatorics. J. Algebra 191 (1997), 174-211. [4] A. Aramova, L. L. Avramov, J. Herzog. Resolutions of monomial ideals and cohomology over exterior algebras, Trans. AMS. 352 (2) (2000), 579-594.
On the equations defining toric projective varieties EMILIO BRIALES MORALES Departamento de Algebra. Facultad de Matematicas. Universidad de Sevilla (Spain). E-mail: [email protected] ANTONIO CAMPILLO LOPEZ Departamento de Algebra, Geometria y Topologia. Facultad de Ciencias. Universidad de Valladolid (Spain). E-mail: [email protected]
PILAR PISON CASARES Departamento de Algebra. Facultad de Matematicas. Universidad de Sevilla (Spain). E-mail: [email protected]
1
INTRODUCTION
Several recent results ([1], [2], [3], [4]) study the syzygies of toric varieties. In particular, the equations defining an embedded affine toric variety can be described. When the toric variety is projective one, the situation becomes special, since the semigroup defining it has a system of generators which lies on an hyperplane (i.e. there exists a map L with the properties in section 1 below). The purpose of this paper is to give an estimation for the degrees of the equations defining an embedded projective toric variety, and give an effective upper bound for such degrees. Our results show such upper bound can be derived from some general facts stablished in [2]. As an illustration, we compute the bound explicitly in the case of toric projective curves. 2
THE APERY SET
Let 5 be a cancellative finitely generated commutative semigroup with zero element and torsion free. Let A be a finite set of generators for S, j}A = h. Denote G(S) the smallest group containing 5 and let d be its rank. Then G(S) ~ Zd C Qd ~ V(S) :— G(S) z Q. Let C(S) be the cone generated by 5, i.e., the rational cone in V(S) generated by the image 5 of 5 in V(S). Suppose that there exists L : S -> N satisfying
1. L(A) = {1} 2. L(n + m) = L(n) + L(m) 57
58
Morales, Campillo and Casares
3. L(n) = 0 <^ n = 0. Fix, from now on, the data S, A, and L. Notice that the existence of L implies that 5 satisfies the property 5n (-5) = {0} therefore, the cone C(S) is strongly convex. Denote / the number of extremal rays of (7(5). Notice that, since (7(5) generates V(S), one obviously has / > d. Then, there are subsets E c A with jjE = / such that C(E] = C(5), where C(E) is the cone in V(S) generated by E. Following [2], fix a partition A = E U A, where E satisfies the above property. This kind of partition is called convex partition. Let |A = r = h — f .
The Apery set Q of S relative to E is defined to be the set given by Q :={€ 5
| q-e$S,VeeE}.
The Apery set Q is finite as proved in Proposition 5.1 of [2]. The terminology Apery comes from the use of the set Q, for the particular case of numerical semigroups, done in [5]. This finiteness property follows from the fact that the semigroup ring Z[5] is a finite integral extension of Z[E], however we will show below an effective proof of it. Set E — {ei, . . . ,e/} and A = {a\, . . . ,ar}. We know that E contains a basis of y(5) as Q- vector space. Since a,j £ (7(5), for any j, we have that
\ijei, with \ij £ Q+. Therefore, for any j, 3qj £ N such that
tijei, with tij € N. If m € Q, m = 2j=i &iai w^tn ft < 9j> f°r finite number of m € Q.
an
y 3- Therefore, there exists only a
REMARK 2.1 In order to find the set Q it is enough: 1. Compute qj, for any j, 1 < j < r.
2. Check whether the elements m — £^=1 /3jUj, with /3j < qj for any j, is in Q. Now, for any t > 0, let H* := {m e 5 i
| L(m) = t}, and denote
g :=gnH*,
and
to := min{t
\ Q* = 0}
PROPOSITION 2.2 With the above notation, if Q* = 0 then Q*' = 0 for all t' > t. In particular, one has Q* = 0 for t > t0.
Proof. It is enough to prove that Qt = 0 =» g*+i = 0.
Suppose that m 6 Qt+l. Then, m = m' 4- a with a 6 A and m' £ #*. Since Q* = 0, we have that m' g Q and therefore there exists e € E such that m' — e 6 5. But then m — e € 5, a contradiction with m £ Q.
Equations defining toric projective varieties
59
REMARK 2.3 In order to find t0 it is enough to use 2.1. Note that 2 in 2.1 could be computed, in practice, by using an integer programming method.
3
SOME HOMOLOGY EXACT SEQUENCES
Fix a field k for coefficients. Denote by E the simplex of parts of A. For any simplicial subcomplex A of E, let us denote by Hi(A), —l
Tm = {FcE n an<
n
=
| m-nF€S},
ur
where np '•— Sn€F ^ ® 0- ^ objective will be to obtain some information of Am by means of Tm. Notice that if A — 0, then A m = Tm. To have a significative discussion from now on, assume that $A = r > 1. DEFINITION 3.1 On the elements of S, define a partial order >Q
m >Q m' <=$• m - m! € 5 \ Q.
If H c 5, we say that m £ H is Q-minimal in the set H if m >Q m', with m' € H, implies that m — m'. PROPOSITION 3.2 The set
D(0):={meS
\ H0(Tm) ? 0}
is finite and it can be determined by an algorithm.
Proof. The finiteness of D(Q) is shown in Proposition 4.1 of [2]. We will give here an effective proof of this fact. __ As above, set E = {ei, . . . , e / } and A = {oi,. .. ,ar}. Notice that if H0(Tm) ^ 0 then, by choosing elements e\ and 62 in different connected component of Tm, one obtains, for j = 1,2: / m-ej£S=$m
f+r
= ^a^ei + ^ a\})ai-f, with a(j} > 1. i=l
«=/+!
Set a^ = (a[j),...,a(^) € N h , for j = 1,2, and let Cj £ N fe , the vector with coordinates equal to zero, excepting the jth one which is equal to 1. Then, a(rt » ej, for j — 1, 2, where » stands for the componentwise partial order. Sea A the matrix whose column vectors are the generators of 5. Notice that m = AaW, for j = 1,2, and a = (a ( 1 ) ,a( 2 >) € N 2h satisfies (A\-A)a = 0, and a » ( e i , e 2 ) -
60
Morales, Campillo and Casares
Then, if one considers the sets
Reie2 := {/3 = (/3 (1) ,/3 (2 >) € N2ft | (.4| - A) ft = 0, with /3 » ( Cl ,e 2 )}, and
Stfeie2 := {m' e 5 | m' = .40W with £ 6 we have that a e J?eie2 and m € ^-Reie 2 - Furthermore, in fact one has, m € M eje2 where M ei e 2 := {m' € £.Reie2 | "i' is Q - minimal in EReiC2}.
In fact, notice that on the semigroup 5 one can write m = m' + m", with m' € M eie2 andm" € S\Q. Ifm" 7^ 0, then one has m" = Ej=i^ e j + Ej=/+i^ a j-/> /?j € N and /3j ^ 0 for some j, 1 < j> < /, which is a contradiction since ei and 63 are in differente connected component of Tm. Thus, to show that -D(O) is finite, it is enough to prove that each set M eie2 is so. For it, notice that the set eie2
:= {/? € Reie3 I /8 is minimal for >},
is finite and set eie2
= {m' € 5 m' = AP(1) with £
We claim that M eiC2
The proof of the proposition follows from the claim. In fact, let n € MeiC2. Set n = A^l\ with /? € ^?eie2- If /? € HReie:!, we claim is obvious. Otherwise, /? = 7+/x, with 7 € HReie2 and /u € N2/l. Then, n = n'+n", with n' = A"f^ and n" = AfJ,^. It is clear by definition that n' £ S/HJ?e,e2, and n" € Q because n is Q-minimal in Mei<,2. This proves the claim. Above effective proof gives rise to the algorithm mentioned in the statement of the proposition. Next remark points out how one can proceed to the computation of D(0).
REMARK 3.3 In order to find the set I>(0) it is enough: 1. Compute the set Q (see 2.1).
2. Compute the sets SH/?eie2, for any 61,62 € E, with e\ ^ 62 using integer programming (see [6]).
3. Check the Q-minimal elements in EHfJ ei62 + Q and obtain MeiC2, for, any ei, e-2 € .E, with e! / e2 .
4. Check the elements m £ |J M eie2 , ei,e 2
such that Ho(Tm) ^ 0 by using linear algebra. Now, let us recover from [2] a construction which shows how the set £>(0) can be combinatorially described.
Equations defining toric protective varieties
61
• For any m e G(S) and I > —I, denote by C^Q™) the vector space which has the set f T
.—
A
|
U T
_. J
i^ "!
£- /^"l
as a basis. • For any chain z in C*t(Qm), denote by Ot(z) the projection on (7j_i(Q m ) of the simplicial boundary of z. By Lemma 2.2 in [2], {C".(Qm), #•} is a chain complex for any m. To understand better the homology of this complex, consider, for any m € 5, the following subset of E:
Km = { L e A m
(LnE^Q) or (L C A and m-niZS
It is easy to check that K m is a simplicial subcomplex of A m , so that one can consider the chain complex C.(Km) and the relative chain complex C,(A m ,K m ). Notice that, by construction, one has an identification C^Q,,,) ~ (7.(A m ,K m ). Notice that if m £ Q, then one has that (7«(QTO) c; A; and KTO = 0. Otherwise, if m 6 5 \ Q, since 3e £ E such that m — e £ S, one obtains L = {e} € K m and Km ^ {0}. Therefore, H-i(Km) — 0 for any m € 5. This allows to deduce, from the exact sequence of complexes,
0 -> C.(Km) -» C.(Am) ->• C7.(Qm) ->• 0, that there is a long exact sequence of homology,
) -* H,(Qm) -»• ... > H_i(K m ) = 0 -)•
Now, in order to understand the homology .H»(K m ), let us consider the simplicial complex given by the following disjoint union of subsets of S:
K m :-K m U{/UJ,I C A, J C E
\ m-m-nj $ S and m-nj-e £ 5,Ve € J}.
Notice that any /U J in the second set of the above union is such that the cardinality of J is at least 2. The complex K m is acyclic, i.e. if;(Km) = 0 for any I > -1 (see Corollary 2.1 in [2]). Thus, the long exact sequence of homology coming from the exact sequence of chain complexes 0 -> C.(K m ) -» C.(Km) ->- C.(Kro,Kro) -> 0
gives rise to an isomorphism p;+i : JJ(+i(K m ,K m ) —> f/j(K m ), for every / > — 1. To study the homology #.(K m ,K m ) let us consider, the chain of simplicial complexes r) -1) K - M( C MTn(°) *^-C •Mm(1' V—C • • - ^_C ±M.( = Km X^-m — m *^-m lvA
lvA
LVA
VI
xv
62
Morales, Campillo and Casares
where Mm , —1 < i < r, is the simplicial subcomplex of Km given by: M$ := K m U {L = / U J e K m
| J C A, J C £, and j}/ < i}.
Now, ff,(K m ,K m ) can be computed (see [2]) by means of the long exact sequences
for -1 < i < j < k < r. In fact, to compute tf.(K m ,K m ) = H.(M$,M(m1}), it will be enough to use the above exact sequences for the concrete values of (i,j,k) given by (—1,0, 1), (— 1, 1,2), ..., (— l,r — l,r), and take into account the following result which is obvious by construction (see proposition 4.3 in [2]).
PROPOSITION 3.4 With the previous notations, for any m £ S, one has: for any I > — 1 and any i, 0 < i < r,
(in this formula, Hi-i(Tm-nt) = 0 if either / - f l < z o r m — n / ^ 5). 4
DEGREES OF THE EQUATIONS
It is known that the degrees of the elements in a minimal generating set of the ideal of 5 are exactly (L(m) | MA m ) 7^ 0} (see [7] and [4]). Moreover, each such degree t appears as many times as the sum of the values /io(A m ) for m € Hl. In order to estimate these degrees, we are going to use the formulae and exact sequences in above section and, in particular, the following four terms one _,
TT (f\
\
.
TT (TS
\f
\
v ZJ
/ A
\
V E7
{f~\
\
Vn
••• —' ^ I v ^ r o / —' ^1 \-"-77ii ^\-mj —' -^Ov^mj —' -^Ov^cmJ —' "J*
PROPOSITION 4.1 Let m € 5 D Hl with t > t0, then H0(Qm) = 0.
Proof. Ifm-aeQ and m e 5 n H*, then m - a € Ql~l. Since t > t0, t - 1 > t0 and so Q^1 = 0 by 2.2. Thus, one has that Co(QTO) = ©m-aeoM 0 } — 0 and TT
ff~\
\ __ A
JiQlV^y^ J
—— U.
Now, on the other hand, by 3.4 one has for / = 0
.M^- 1 ')-
©
H-i(Tm-nt).
Thus, one has
for i > 1, and the following diagram of exact sequences
Equations defining toric projective varieties
63 = 0
- tf!(K m ,K ro ) -»•
( M . M - 1 ) =0
Again by 3.4 one has: For I = 0, i = 1: a€A
For / = 1, i = 1:
For i = 0, i = 0:
Replacing in the first sequence of the above diagram, one obtains
.. -»• ® # 0 (T m _ a ) *-$ H0(Tm) REMARK 4.2 In order to describe the mapping ipm we can do the following: 1. Compute the simplicial complexes Tm and Tm-a with a € A. (Using Integer Programming)
2. Take bases of H0(Tm) and Ho(Tm~a) with a £ A, picking a point {e} in each connected component and considering a generating tree, for example fix {e\ } for one concrete of the components and consider {e^} — {ei}, with e^ over the other components (see [7] for details).
3. Take the natural basis of @a&A H0(Tm^.a) obtained from the bases of H0(Tm-a) computed in 2.
4. Give the linear mapping ipm by means of a matrix using that f {ei}-{e 2 } if m - e i - e 2 £ S (see Proposition 3.2 in [2])
Now, let
ti := min{f
coker((pm) = 0 Vm € H1},
i.e. the minimum t € N such that (pm is surjective for every m 6 H*. (There exists ti by 3.2) REMARK 4.3 In order to find t\ it is enough to check the condition
coker(tpm) = 0 over the set £>(0) computed by 3.3 and using the matrix given in 4.2.
64
Morales, Campillo and Casares
LEMMA 4.4 Let m € H* with t > t0, then ff_i(T m _ a ) = 0, for any a £ A.
Proof. One has tf_i(T m _ a ) ^ 0 if and only if T m _ a = {0}, i.e, if and only if m - a e S and m - a - e £ S, for every e € E. But m - a - e ^ 5, for all e 6 E implies m — a €. Q. Since m — a € H1"1, we have that m — o € Q*"1,* — 1 > £oBut Q*-1 = 0 by 2.2. Therefore, H_i(T m - 0 ) = 0. THEOREM 4.5 Let 5 be a semigroup with the previous conditions. Then, the degrees of the polynomials in a minimal generating set of the ideal of S are less or equal than max(to,ti).
Proof. The degrees we are looking for are {I/(m) | /io(A m ) ^ 0}. Hence, it is enough to prove that if t > max(£ 0 ,ii), then H0(&m) = 0 for any First, since t > to we obtain the exact sequences: .
IT ( c\
\
\
£? /T?
~V
\
\
£/ / A
\
vn
U tf\
\
••• ~f fll(*m) ~* J^O(^m) —> U = -"o(.*°«ro;j
I -» jff^M^M^ 1 )) ->• 0. Second, since t > ti, we obtain ffi(M m , Mm ) — 0. Now, the diagram guarantees that Hi(Km,Km) = 0, and the result in the theorem follows from this fact.
5
AN EXAMPLE: THE DEGREE OF THE EQUATIONS OF TORIC PROJECTIVE CURVES
A projective toric curve is the projective scheme Proj(k[S}), where k is the ground field and 5 is the subsemigroup of N2 generated by elements of a set A consisting of elements of type ei - (d,0),e 2 = (0,d),ai = (an,a 12 ),...,a r = (a r i,a r2 ), whereof > 0 is the degree of the curve, Oji+0^2 = dforeachi, and#cd(d, on,...,ai r ) = 1. The choice of the generators gives an embedding of the toric curve into the projective space Pr+1. The homogeneous ideal defining this embedding is nothing but the ideal associated to the semigroup 5 and the generator set A. Notice that the pair S,A satisfies the conditions in section 1, if one chooses the map L given by L(ai,fl2) = (ai + a 2 )/d. Hence the degrees of the homogeneous equations defining the toric projective curve can be estimated from the results in above sections. For it, consider the partition A = ELSA where E = {61,62} and A = {ai, ...,ar}. Then, for each m € 5, the simplicial complex Tm has non trivial reduced homology if either it consists of only the empty set (in that case the —1 reduced homology is isomorphic to k) or it is the complex T consisting of the two points corresponding to ei and 62 but not to the edge joining both points (in that case the 0-th homology is isomorphic to k). Thus, the estimation of the degrees of the equations will be
Equations defining toric projective varieties
65
given in terms of the sets Q and D where Q is the Apery set (which can be viewed as the set of m € S such that Tm = {0}) and D is the set of those m E S such that Tm — T. Note that the set D is empty if and only if the curve is arithmetically Cohen-Macaulay, i.e. if the fc-algebra k[S] is Cohen-Macaulay (see [8]). Now, in the Cohen-Macaulay case, the degree of the equations of the curve are bounded by the integer to defined in section 1. In the non Cohen Macaulay case, one can also define the integer fa to be the largest integer t such that D n H1 is non empty. Notice that one has t\ < fa, so the equations of the projective curve are bounded by the integer max(to,fa). Using the explicit description, given in [2], of the sets Q and D in terms of the numerical semigroup Si generated by the integers d,an, ...,air 4.5, the integers t0 and fa can be easily computed as follows. First, for every b € Z, set l(b) equal to infinity if b £ S and, otherwise, equal to the least number of integers among d,an,...,air (allowing repetitions) with sum equal to b. Then, if B is the set of b £ S such that l(b — d)< l(b), and if B' is the subset of B consisting of those b & B such that b — d € S, one has t0 = I + max{l(b) fa=max{l(b-d)
& € £}, \ b&B'}.
Thus, one concludes the following result: THEOREM 5.1 With assumptions and notations as above, the degrees of the polynomials in a minimal set of homogeneous equations defining a toric projective curve C are bounded by the integer 1 + max{l(b)
| b € B}
if C is arithmetically Cohen Macaulay, and by min{l + max{l(b)
\ b £ B},max{l(b - d) \ b£B'}},
if C is not arithmetically Cohen-Macaulay.
References [1] D.BAYER, B.STURMFELS, Cellular resolutions of monomial modules J. reine angew. Math. 502, (1998), 123-140. [2] A. CAMPILLO, P. GIMENEZ, Syzygies of affine toric varieties. Journal of Algebra 225, 2000, 142-161.
[3] P. PISON-CASARES, A. VIGNERON-TENORIO, First Syzygies of Toric Varieties and Diophantine Equations in Congruence, Preprint of University of Sevilla Seccion Algebra 52 (1999).(Communications in Algebra to appear). [4] BRIALES E.; PISON P.; VIGNERON A. The Regularity of a Toric Variety, Preprint of University of Sevilla Seccion Algebra 53 (1999). [5] R.APERY, Sur les branches superlineaires des courbes algebriques. C.R.Acad.Sci.Paris 222 (1946), 1198-1200.
66
Morales, Campillo and Casares
[6] P.PISON-CASARES, A. VIGNERON-TENORIO, N-solutions to linear systems over Z. Preprint of University of Sevilla Section Algebra 43 (1998).
[7] E. BRIALES, A. CAMPILLO, C. MARIJUAN, P. PISON, Minimal Systems of Generators for Ideals of Semigroups J. of Pure and Applied Algebra, 124 (1998), 7-30. [8] N.V.TRUNG, L.T.HOA, Affine semigroup and Cohen-Macaulay rings generated by monomials. Trans.Am.Math.Soc. 298 (1986), 145-167.
KRS and determinantal ideals WINFRIED BRUNS, Universitat Osnabruck, FB Mathematik/Informatik, 49069 Osnabriick, Germany, Winf rled.BrunsQmathematik.uni-osnabrueck. de ALDO CONCA, Dipartimento di Matematica e Fisica, Universita di Sassari, Via Vienna 2, 07100 Sassari, Italy, concafissmain.uniss.it
1 INTRODUCTION
Let K be a field and X an m x n matrix of indeterminates. The determinantal ideals in K[X] are the ideals It generated by the i-minors of X, 1 < t < min(m,n), and ideals related to them. The Knuth-Robinson-Schensted correspondence (KRS) is a powerful tool for the computation of Grobner bases of determinantal ideals. For this purpose it has first been used by Sturmfels [16]. Then Herzog and Trung [12] have considerably extended the class of ideals to which KRS can be applied. In a different direction Sturmfels' method has been generalized by Bruns and Conca [4] and Bruns and Kwiecinski [5]. While Herzog and Trung use Grobner bases in order to derive numerical results, the papers [4] and [5] aim at structural information, mainly on powers of determinantal ideals and the corresponding Rees algebras. The crucial point in the application of KRS to Grobner bases is to show the equality in(7) = KRS(7) for the ideals I under consideration. We call these ideals in-KRS. Here in(/) is the initial ideal of I with respect to a so-called diagonal term order on ^[-Y], and KRS(I) is the image of / under the automorphism of the polynomial ring K[X] induced by KRS - in the strict sense KRS is a bijection from the set of standard bitableaux (or standard monomials) S to the set of monomials M. of jK^-X]. Both S and M. are K-bases of A'fX]: for S this is asserted by the straightening law of Doubilet-Rota-Stein. Since in(/) is a monomial ideal, one must assume that I has a basis of standard bitableaux. The first three sections of the paper are an expanded version of the first author's lecture in the conference. Section 2 recapitulates the straightening law, and Section
67
68
Bruns and Conca
3 introduces KRS. Section 4 explains the common ideas underlying the results of [4] and [5]. For this purpose we develop a conceptual framework in which KRS invariants play the central role. Such invariant is a function F : T> —> N defined on the set £> of all bitableaux (or products of minors) that, roughly speaking, is compatible with the straightening law and, moreover, satisfy the condition
F(£) = max{F(A) : A 6 £>, in(A) = KRS(E)}. It is then easy to see that each of the ideals Ik (F) generated by all standard bitableaux E with F(E) > k satisfies the condition in(/fc(F)) = KRS(/fc(F)). Even more is true: Ik(F) is G-KRS, i. e. in addition to being in-KRS, Ik(F) has a Grobner basis of bitableaux. The class of G-KRS ideals is closed under sums, that of in-KRS ideals / is closed under sums and intersections, and therefore one then obtains many G-KRS or at least in-KRS ideals. It has been shown in [4] that the functions 7( introduced by De Concini, Eisenbud and Procesi [9] are KRS invariants. This fact allows one to compute the Grobner bases, or at least the initial ideals of the symbolic powers of the Jj and products J fl • • • Its. The family o^ of KRS invariants found by Greene has been used in [5] for the analysis of the ideal underlying MacPherson's graph construction in the generic case. In Section 5 we show that all ideals that are generated by products of minors and do not "prefer any rows or columns" of the matrix X are in-KRS, at least if char K is 0 or > min(m, n). In characteristic 0 this is exactly the class of ideals that have a standard monomial basis and are stable under the natural action of GL(m, K) x GL(n,K) on AT[X]. In fact all these ideals can be written as sums of intersections of symbolic powers of the ideals It, and the symbolic powers are G-KRS, as stated above. Section 6 characterizes those among all the ideals of Section 5 that are even GKRS. We show that these are essentially the sums of the ideals J(k, d) introduced in [5] and for which Greene's theorem yields the property of being G-KRS. Since each KRS invariant can be derived from a family of G-KRS ideals, this shows that Greene's functions o^ are truly basic KRS invariants, at least if one considers functions F : T> —>• N for which .F(A) only depends on the shape of A. Section 7 complements the results of [4]. We show that the formation of initial ideal and symbolic power commute for the ideals It. This result can be interpreted as a description of the semigroup of monomials in the initial algebra of the symbolic Rees algebra by linear inequalities. In Section 8 we turn to a potential new KRS invariant jg related with the ideal I(X, 6) cogenerated by a minor 8. Except in the case in which Is = It, these do not only depend on shape and therefore constitute an interesting new class of functions. Though [12] gives some information on 7,5, we have not yet been able to show that these are KRS invariants. The application of KRS to determinantal ideals has also been investigated by Abhyankar and Kulkarni [1, 2]. Furthermore, variants of the KRS can be used to study ideals of symmetric matrices of indeterminates (Conca [7]) or ideals generated by Pfaffians of alternating matrices ([12], Bae^ica [3], De Negri [8]). There are now excellent discussions of KRS available in textbooks; see Fulton [10] and Stanley [15].
KRS and determinants! ideals
69
2 THE STRAIGHTENING LAW Let K be a field and X an m x n matrix of indeterminates over K. For a given positive integer t < min(m,n), we consider the ideal It — It(X) generated by the i-minors (i. e. the determinants of the t x t submatrices) of X in the polynomial ring R = K[X] generated by all the indeterminates X^. From the viewpoint of algebraic geometry R should be regarded as the coordinate ring of the variety of K-\me&r maps /: Km -> Kn. Then V(It) is just the variety of all / such that rank/ < t, and R/It is its coordinate ring. The study of the determinantal ideals It and the objects related to them has numerous connections with invariant theory, representation theory, and combinatorics. For a detailed account we refer the reader to Bruns and Vetter [6]. Almost all of the approaches one can choose for the investigation of determinantal rings use standard bitableaux and the straightening law. The principle governing this approach is to consider all the minors of X (and not just the 1-minors X^) as generators of the .ft'-algebra R so that products of minors appear as "monomials". The price to be paid, of course, is that one has to choose a proper subset of all these "monomials" as a linearly independent JiT-basis: the standard bitableaux are a natural choice for such a basis, and the straightening law tells us how to express an arbitrary product of minors as a K-linear combination of the basis elements. (In [4], [5] and [6] standard bitableaux were called standard monomials; however, we will have to consider the ordinary monomials in K[X] so often that we reserve the term monomial for products of the Xij.) In the following [ai,...,a t | & i , . . . ,bt] stands for the determinant of the submatrix (X^: i = 1,..., t, j — 1,..., t). The letter A always denotes a product 61 • • • 6W of minors, and we assume that the sizes \Si (i. e. the number of rows of the submatrix X' of X such that <5j = det(X')) are descending, \S\ > ••• > \6W\. By convention, the empty minor [|] denotes 1. The shape | A| of A is the sequence (|<5i |,..., \SW\). If necessary we may add factors [ | ] at the right hand side of the products, and extend the shape accordingly. A product of minors is also called a bitableau. The choice of this term bitableau is motivated by the graphical description of a product A as a pair of Young tableaux as in Figure 1: Every product of minors is represented by a bitableau and, conversely,
an
n
a
wt
Figure 1: A bitableau
70
Brims and Conca
every bitableau stands for a product of minors if the length of the rows is decreasing from top to bottom, the entries in each row are strictly increasing from the middle to the outmost box, the entries of the left tableau are in {1, . . . ,m} and those of the right tableau are in {1, . . . ,n}. These conditions are always assumed to hold. For formal correctness one should consider the bitableaux as purely combinatorial objects and distinguish them from the ring-theoretic objects represented by them, but since there is no real danger of confusion, we simply identify them. Whether A is a standard bitableau is controlled by a partial order of the minors, namely [01 , . . . , at \ bi , . . . , bt] ;< [ci , . . . , cu | di , . . . , du] t > u and di < Ci, bi < di, i = 1, . . . , u.
A product A = 61 • • • 6W is called a standard bitableau if
in other words, if in each column of the bitableau the indices are non-decreasing from top to bottom. The letter £ is reserved for standard bitableaux. The fundamental straightening law of Doubilet-Rota-Stein says that every element of R has a unique presentation as a K -linear combination of standard bitableaux (for example, see Bruns and Vetter [6]):
THEOREM 2.1.
(a) The standard bitableaux are a K -vector space basis ofK[X] .f ,
(b) If the product 6162 of minors is not a standard bitableau, then it has a representation oi62 = ^Xietrji, Xi € K, xt ^ 0, where e^ is a standard bitableau, ei -< Si , 62 -< f]i (here we must allow that r\i = I ) .
(c) The standard representation of an arbitrary bitableau A, i.e. its representation as a linear combination of standard bitableaux £, can be found by successive application of the straightening relations in (b) . (d) Moreover, at least one £ with |£| = |A| appears with a non-zero coefficient in the standard representation of A. Let BI, . . . , em and /i, . . . , /„ denote the canonical Z-bases of Zm and Zn respectively. Clearly K[X] is a Zm 0 Z"-graded algebra if we give Xij the " vector bidegree" a ® fj . All minors are homogeneous with respect to this grading, and therefore the straightening relations must preserve the multiplicities with which row and column indices occur on the left hand side. The straightening law implies that the ideals It have a AT-basis of standard bitableaux:
COROLLARY 2.2. The standard bitableaux E = 61 • • • Sw such that \Si > t form a K -basis of It-
KRS and determinants] ideals
71
All these standard bitableaux are elements of It since S\ € It if |<5i > t. Conversely, every x & It can be written as a JiT-linear combination of products 6M where 6 is a minor of size t and M is a monomial. Properties (b) and (c) of the straightening law imply that the standard bitableaux in the standard presentation of 6M have the required property. We say that an ideal I C R has a standard basis if / is the /^-vector space spanned by the standard bitableaux E € /.
3 THE KNUTH-ROBINSON-SCHENSTED CORRESPONDENCE Let E be a standard bitableau. The Knuth-Robinson-Schensted correspondence (see Fulton [10] or Stanley [15]) sets up a bijective correspondence between standard bitableaux and monomials in the ring .RTfX]. We use the version of KRS given by Herzog and Trung [12].
If one starts from bitableaux, the correspondence is constructed from the deletion algorithm. Let E = (ajj|6jj) be a non-empty standard bitableau. Then one constructs a pair of integers (£,r) and a standard bitableau E' as follows.
(a) One chooses the largest entry £ in the left tableau of E; suppose that {(ii,ji), • ••, (iu,ju)}, ii < • • • < « „ , is the set of indices (i, j) such that (. — a^. (b) Then the boxes at the pivot position (p, q) — (iu,ju) in the left and the right tableau are removed. (c) The entry I = apq of the removed box in the left tableau is the first component of the output, and bpq is stored in s. (d) The second and third components of the output are determined by a "push out" procedure on the right tableau as follows: (i) if p = 1, then r = s is the second component of the output, and the third is the standard bitableau E' that has now been created; (ii) otherwise the entry bpq is moved one row up and pushes out the right most entry & p _u such that 6 p _ifc < bpq whereas 6 p _ifc is stored in s. (iii) one replaces p by p - 1 and goes to step (i). It is now possible to define KRS recursively: One sets KRS([ | ]) = 1, and KRS(E) =
We give an example in Figure 2. The circles in the left tableau mark the pivot position, those in the right mark the chains of "push-outs": In this example we have T/"r>CJ/\^\ __
y
y
y
y
y
y y
It is often more convenient to denote the output by a two row array instead of a monomial by making the row indices of the factors the upper row and the column indices the lower row; in the example
1 2 3 4 5 6 4 1 2 5 6
Brims and Conca
72
5
4
3
1
© 2 ® 4
3
1
2 ® 6
4 ®
1
1 2
2
4
5 ©
1 2 © 4
Figure 2: The KRS algorithm In general we set krs(E) = In both rows indices may appear several times; however, the indices Ui in the upper row are non-decreasing from left to right, and if u^ = Uj+i, then i>; > Vj+i for the indices in the lower row, as is easily checked. Conversely, if we are given a monomial, then, by arranging its factors in a suitable order, there is always a unique way to represent it as a two rowed array satisfying the condition just given. The reader may check that one can set up an insertion algorithm exactly inverting the deletion procedure above (what was deleted last, must be inserted first). In combinatorics one most often uses standard bitableaux for the investigation of sequences (or two row arrays). Then insertion is more important than deletion. Since insertion and deletion are inverse operations, one obtains
THEOREM 3.1. The map KRS is a bisection between the set of standard bitableaux on {!,... ,m} x {1,... ,n} and the monomials of K[X}.
This theorem proves half of part (a) of the straightening law: it is enough to check that every element of K[X] can be written as a linear combination of standard bitableaux. Using the straightening law one can now extend KRS to a K-linear automorphism of A^X]: with the standard representation x — £) asS one sets KRS(x) =]T>sKRS(S). The automorphism KRS does not only preserve the total degree, but even the ZTO © Z" degree introduced above: in fact, no column or row index gets lost. Note also that KRS it is not a K-algebra isomorphism: it acts as the identity on polynomials of degree 1 but it is not the identity map . It would be interesting to have some insight on the property of KRS as a linear map like, for instance, its eigenvalues and eigenspaces. REMARK 3.2. We note two important properties of KRS:
KRS and determinantal ideals
73
(a) KRS commutes with transposition of the matrix X: Let X' be a n x m matrix of indeterminates, and let T : K[X] -> K[X'] denote the fiT-algebra isomorphism induced by the substitution Xij >->• X'^; then KRS(r(/)) = r(KRS(/)) for all / € ^1-X]- Note that it suffices to prove the equality when / is a standard bitableau. Then the statement follows from [12, Lemma 1.1]. (b) All the powers Sfc of a standard bitableau are again standard, and one has
4 KRS INVARIANTS AND GROBNER BASES
The power of KRS in the study of Grobner bases for determinantal ideals was detected by Sturmfels [16]. He applied Schensted's theorem:
THEOREM 4.1. Let (ti,...,tw) be the shape of the standard bitableau E. Then ti is the length of the longest strictly increasing subsequence in the lower row of krs(S).
If (ujj , . . . , Viq ) is a strictly increasing subsequence of the lower row, then the subsequence (u^ , . . . , uiq ) of the upper row must also be strictly increasing. Therefore
KRS(S) = M • diag[wit , . . . , uiq\ % , . . . , viq]
(*)
where M' is a monomial diag(J) denotes the product of all the indeterminates in the diagonal of the minor 6. Once and for all we now introduce a diagonal term order on the polynomial ring .fiT[^T]. With respect to such a term order the initial monomial in(<5) is diag(<5). There are various choices for a diagonal term order, For example one can take the lexicographic order induced by the total order of the X^j that coincides with the lexicographic order of the (i, j ) . Schensted's theorem implies through its equivalent (*) that for a standard bitableau S 6 It there exists a t-minor S such that in(<5) = diag(<$) KRS(S), and,
in particular, KRS(S) € in(/ t ): if q > t, then we can simply write
» ! , . . . , viq] = M" diag[ufl , . . . , uit | w^ , . . . , u i( ]. Since It has a basis of standard bitableaux, it follows that KRS(/t) C in(/ t ). The K- vector space KRS(/t) has the same Hilbert function as It with respect to total degree since KRS preserves total degree. But in(/ t ) also has the same Hilbert function as It. This implies:
THEOREM 4.2.
The t-minors of X form a Grobner basis of It, and KRS(/<) =
74
Brans and Conca
In fact, the equation KRS(7 f ) = in(7t) has just been observed, and if M € in(/t) is a monomial, then it must be of the form KRS(S) for some standard bitableau S 6 It- But then M is divisible by in(<5) for some t-minor 6. Exactly this condition must be satisfied for the set of ^-minors to form a Grobner basis. It is worth formulating the idea behind the proof of Theorem 4.2 as a lemma:
LEMMA 4.3. (a) Let I be an ideal of K[X] which has a K-basis, say B, of standard bitableaux, and let S be a subset of I. Assume that for all S £ B there exists s E S such that in(s) | KRS(S). Then S is a Grobner basis of I andin(I) = KRS(J). (b) Let I and J be homogeneous ideals such that in(/) = KRS(/) and in(J) = KRS(J). Then in(7) + in(J) = in(/ + J) = KRS(J + J) and in(7) n in(J) = in(/n J) = KRS(/n J).
The proof of part (a) has been explained for the special case of J = It. For (b) one uses KRS(7 + J) = KRS(7) + KRS(J) = in(7) + in(J) C in(7 + J), KRS(7 n J) = KRS(7) n KRS( J) = in(7) n in( J) D in(7 n J),
and concludes equality from the Hilbert function argument. DEFINITION 4.4. Let 7 be an ideal with a standard basis. Then we say that 7 is in-KRS if in(7) = KRS(7); if, in addition, the bitableaux A € 7 form a Grobner basis, then 7 is G-KRS. In slightly different words, an ideal 7 with a standard basis is in-KRS if for each S e 7 there exists x 6 7 with KRS(E) = in(o;); it is G-KRS if x can always be
chosen as a bitableau. As a consequence of Lemma 4.3 one obtains
LEMMA 4.5. Let I and J be ideals with a basis of standard bitableaux.
(a) If I and J are G-KRS, then I + J is also G-KRS. (b) If I and J are in-KRS, then I + J and 7 n J are also in-KRS. In general the property of being G-KRS is not inherited by intersections as we will see below.
The KRS correspondence could be used for the proof of Theorem 4.2 since, by Schensted's theorem, the length of the first row of a standard bitableau is a KRS invariant: DEFINITION 4.6. Let T> be the set of all bitableaux on the matrix X and F : T> -»• N a function on T>. Then we define a function on the set M of monomials, also called F, by F(M) = max{F(A) : A € V, M = in(A)}.
Of course F(M) is well-defined since there are only finitely many A £ T> with M = in(A). We say F is a KRS-invariant if the following conditions are satisfied:
KRS and determinantal ideals
75
(a) jP( A) is the minimum of F(E) where E runs through the standard bitableaux in the standard representation of a bitableau A; moreover, if E' appears in the standard representation of xA. for some x € R, then -F(S') > (b) F(E) = F(KRS(E)) for all standard bitableaux E € P. If just condition (a) is satisfied, then we say that we say that F is str-monotone. In order to interpret condition (b) combinatorially we write krs(E) = Then the bitableaux A such that KRS(E) = in(A) correspond bijectively to the decompositions of the lower row of krs(E) into strictly increasing sequences, called inc-decompositions. In fact, if the sequence v^,..., Vit is strictly increasing, then the same holds for u^,..., uit, or equivalently, XUlVl • • • XUtVl is the diagonal product of a i-minor. Note that u ^ , . . . , « $ , is always non-decreasing, and therefore Xmvi • • • XUtVt can only be a diagonal product if v^,..., Vit is strictly increasing. Thus condition (b) requires that F(E), a number associated with the standard bitableau, is encoded in the sequence of integers forming the lower row of krs(E). It is now an easy exercise to show PROPOSITION 4.7. Let F be a KRS-invariant, and let k be an integer. Let Ik(F) be the ideal generated by all bitableaux A such that F(A) > k. Then
(a) Ik(F) has a standard basis formed by all standard bitableaux E such that F(E) > k.
(b) Moreover, Ik(F) is G-KRS. Part (a) follows immediately from str-monotonicity and part (b) follows from 4.3. In general, it does not suffice to take the standard bitableaux in Ik(F) to obtain a Grobner basis of Ik(F); we will discuss an example below. Starting from the ideals Ik (F) and applying 4.5 one can now find new ideals that are G-KRS or at least in-KRS. We have seen that the length of the first row is a KRS-invariant. In order to apply KRS to a wider class of ideals one has to find other (or more general) KRS invariants. One such family of invariants are the functions 74 defined as follows. For an integer s and a sequence si,...,sw of integers one sets w
7t(s) = ( s - £ + ! ) +
and
~ft(si, ...,sw) = ]T Jt(si).
Here we have used the notation (Ar)+ = max(0,A;). One then defines this function for bitableaux A = Si • • • Sw by 7t(A) = 7t(|A|).
76
Brims and Conca
The invariants •jt are of interest since they describe the symbolic powers of the ideals It. Provided the characteristic of the field is 0 or > min(m,n) (we then say K has non-exceptional characteristic), all products Itl •••/{,. have a primary decomposition as intersections of such symbolic powers, and can therefore described in terms of the jt '• (a) A 6 I(tk} «=» 7t(A) > fc;
(b) the standard bitableaux E with 7t(E) > k are a jftT-basis of I\ , (c)
See [6, Section 10] and [9]. The straightening law shows that jt is str-monotone. In [4] we have proved
THEOREM 4.8. The functions jt are KRS-invariants. As a consequence of this theorem and Lemma 4.5 one obtains that all ideals 4 are G-KRS and that all products of ideals of minors are in-KRS if char K = 0 or char .ft" > min(m, n). Furthermore one can then show that the "initial algebras" of the symbolic and ordinary Rees algebras of the ideals It are normal semigroup rings. In particular this implies that these algebras are Cohen-Macaulay. Another object accessible to this approach is the subalgebra At of K[X] generated by the i-minors of X. See [4] for a detailed discussion. EXAMPLES 4.9. (a) We choose m, n > 3. By the above discussion the ideal 7^2) is G-KRS. We want to show that the standard bitableaux in 1% do not form a Grobner basis. The monomial M = ^12^23^21^32 is the initial term of a bitableau of shape (2,2) and hence M 6 in(/2 ). If the standard bitableaux in /|2' were a Grobner basis, then M would be divisible by the initial of a standard bitableaux in 1^. The standard bitableaux in /|2) of degree < 4 have shape (3), (3,1) and (2,2) and clearly their initial term cannot divide M. (b) Suppose that I and J are G-KRS and let E be a standard bitableau in / n J. Then we can find bitableaux AI € 7 and A2 € J such that KRS(E) = in(Ai) = in(A 2 ). In general it can happen that AI $ J and A2 ^ /, and / n J need not be G-KRS. An example is / = 1% ', J = /4 for a matrix of size at least 6x6. In fact, let S = [1345 1236][26145]. (This is the example considered in Section 3). Then £ e J is obvious, and E € / since 72(E) > 2. Since / n J is in-KRS, it follows that KRS(E) = XuX2iX32X45X56XX63 £ in(7 n J). It is however impossible to write this monomial as the initial monomial of a bitableau A in / n J. The bitableaux of degree 6 in /n J are those of shapes (6), (5,1), and (4,2). (By Schensted's theorem, only the last shape would be possible.) Let T be a new indeterminate and define the ideal J in the extended polynomial ring K[X][T\ by
J = Im + Im^T + ••• + hTm~l + (Tm)~
KRS and determinantal ideals
77
we assume that m < n. This ideal and its Rees algebra 0°^.0 J* is fundamental for the generic case of MacPherson's graph construction; see [5]. If one "expands" the power Jk into a "polynomial" in T, then the "coefficient" of Tkm~d is
eo + ei + • • • + em - k, ei 4- 2e2 + • • • + mem - d. For a non-increasing sequence si, . . . , sw of non-negative integers let us define k
ak(si,...,sw) - y^Sj j=i
where s» = 0 if i > w. Then we can set at (A) = Q fc (|Al)
for every bitableau A. The straightening law shows that a/t is str-monotone, and it follows easily that
(a) A e J ( k , d ) <=> a f c (A) > d; (b) the standard bitableaux E with afe(S) > d are a ff-basis of J(fc, d)-
THEOREM 4.10. The functions ak are KRS-invariants. An analysis of a^ in terms of inc-decompositions shows that ak(KRS(E)) > d if and only if the lower sequence of krs(E) contains a subsequence of length d that
itself can be decomposed into k increasing subsequences. Thus Theorem 4.10 is just a re-interpretation of Greene's theorem [11]: «*(£) is the maximal length of a subsequence that has an inc-decomposition into k parts. For the "determinantal" consequences of Theorem 4.10 we refer the reader to [5]. The relationship between the KRS invariants 74 and ak is analyzed in Section 6. 5
IDEALS DEFINED BY SHAPE
We say that an ideal I C K[X] is defined by shape if it is generated as an ideal by a set of bitableaux, and, moreover, it depends only on |A| whether a bitableau A belongs to /. In this section we want to characterize the ideals defined by shape in the case in which the characteristic of K is big enough. In particular we will see that all these ideals are in-KRS. The following "balancing lemma" is a crucial argument; it is a simplified version of [6, (10.10)].
LEMMA 5.1. Let TT and p be minors of X, and set u = \p\, v — TT (we include the case TT = 1, in which u — 0). Suppose that u < v and charK = 0 or charK > min(w + l,m — (u + l),n — (u + 1)). Then irp £ Iu+ilv-i.
78
Brims and Conca
The case in which u — 0 is just Laplace expansion. In general the lemma says that a product •np of minors can be expressed as a linear combination of minors that are "more balanced" in size. By repeated application of the lemma we see that irp is even a linear combination of products 6s such that \5\ + \e\ = \K\ + \p\ and 1*1 < N < 1*1 + 1The group GL = GL(m, K) x GL(n, K) operates as a group of linear substitutions on R — K[X] in a natural way: for M 6 GL(m,K) and N € GL(n, K) one substitutes Xij by the corresponding entry of MXN~l. Therefore R is an interesting object for the representation theory of GL, and representation theory offers another approach to the theory of determinantal rings. It is clear that an ideal defined by shape is GL-stable since each element g € GL transforms a minor into a linear combination of minors of the same size. Let a be a shape. Then the ideal 1^ is generated by all bitableaux A with 7t(A) > 7t(
|Aj > a. If even | A|<, > (?k for all k, then we write |A| D a. The ideals 1^ are evidently defined by shape. By definition
Therefore 1^ has a standard basis and is in-KRS. The following theorem should have been contained in [6, Section 11]. THEOREM 5.2. Suppose that char/f = 0. Then the following are equivalent for an ideal I C K[X}: (a) I is defined by shape; (b) I is a sum of ideals of type 1^.
(c) I has a standard basis, and I is stable under the action o/GL on K[X}. Proof. (a)=^(b): / is obviously contained in the sum of all ideals /(I A D where A runs through the generators of I. On the other hand, let S be a (standard) bitableau contained in /d A D, that is, |S| > |A|). If even |S| D |A|, then we can apply Laplace expansion and write S as a linear combination of bitableaux of the the same shape as A. Suppose that |E| ~fi |A|, and let k be the smallest index such that |E|fc < |A|fc. Then there must be an index j < k such that |S|j > |A|j. Now one applies the balancing lemma above, increasing the fc-th row at the expense of the j'-th. After finitely many balancing steps we have written S as a .ftT-linear combination of bitableaux E such that |E D |A|. (b)=>-(a): This is evident, as well as (b)=>(c). (c)=^(b): We have to show that H 6 / for all standard bitableaux E such that E > |S| for some standard bitableau S 6 /.
KRS and determinantal ideals
79
Set er = |S|. Suppose first that |H = |E|. By [6, (11.10)] there is a decomposition of GL stable subspaces where I>^ is generated by all standard bitableaux 0 such that |9| > a\ in this decomposition Ma is irreducible and the unique GL-stable complement of /> ' in /(") . Thus we can write
E =x +y where x £ Ma , y £ 1^' . Since E £ /> , we deduce that x ^ 0. For H = S it follows that Ma C I. In fact, / has a unique decomposition as a direct sum of irreducible GL-modules, and these are exactly the MT; since the projection to Ma is non- trivial, it must appear in the decomposition of I. For general H it now follows that x £ /, and therefore all the standard bitableaux in the standard representation of x must belong to /. However, since y £ /> , H must appear in this standard representation. Suppose now that |H| > a. If we find some standard bitableau F of shape |H| such that Tel, then the argument just given shows that E £ I. Since we can connect a and |H| by a chain of shapes with respect to the partial order <, it is enough to consider the case in which |H| is an upper neighbor of a. One obtains the upper neighbors by either inserting a new box below the bottom of the diagram (and thereby increasing 71 by 1) or by removing an "outer corner" box of the Young diagram of shape a and inserting it at an "inner corner" in such a way that the box travels one row up or one column to the right. (At the end of the first row is also an inner corner, provided its length is < min(m,n)). Figure 3 illustrates the three cases.
;t Figure 3: Upper neighbors with respect to < The case in which a new box is added, is trivial. In fact, we fill it with Xmn, and X mn £ is standard of the right shape. We now assume that a box travels one row up, say from row k to row k - 1. With a = (si,..., sw) let p = Sk and q = SK-I- One forms the standard bitableau Q = Oi • • • 6W where
0k = [1,... ,p - 1,q + 111,... ,p - 1,q + 1]
80
Brims and Conca
of shape a. Since 0 is a standard bitableau of shape a, it belongs to /, as was shown above. Note that Sk+i < p < q < Sfc_ 2 (where Sk+i = 0 if k = w and Sfc_2 = oo if k = 2). Now we apply the cyclic permutation TT € (pp+l. ..qq+1) to both the rows and columns of the matrix X; the transformation n belongs to GL. Therefore 7r(0) € /. All the factors of 0 except dk-i and Ok are invariant under TT, whereas , . . . , g + l]
(1) (2)
If we straighten this product and multiply its standard presentation with the remaining factors of 0, then we obtain the standard representation of ?r (0). Therefore it is enough that a standard bitableau of shape (q + l,p — 1) appears in the standard representation of it(8k-i)ii(6k)- (Whereas the proof of ((a)=>-(b) is based on "balancing", we now need the "unbalancing" effect of straightening.) Mapping all the indeterminates Xij with i ^ j, i < p or j < p, to 0 and Xu,... , X p _i p _i to 1, one reduces the claim to the assertion that in the standard representation of [111][2,..., r 12,..., r] with r > 3 the minor [1,..., r \ 1,..., r] shows up, and that is immediate from Laplace expansion. The case in which the box travels one column to the right is similar and left to the reader. Essentially it is the case in which a consists of a single column. D One should note that the implications (b)=^(a) and (b)=J>(c) are true over arbitrary fields (actually, over all rings of coefficients), whereas (a)=»(b) needs only that char AT > min(m, n). The implication (c)=>(b) uses the hypothesis that K has characteristic 0 more profoundly: the ideal 7f+1 + (X^,..., X^) satisfies (c) if char .fiT = p > 0, but is not a sum of ideals /^ (provided that X is not just a 1 x 1 matrix).
COROLLARY 5.3. Suppose that K is a field of characteristic 0. Then all GL-stable ideals that have a standard basis are in-KRS. This follows from Lemma 4.5 since the ideals 7^' are in-KRS. Note that there are ideals with a standard basis which are not in-KRS. For instance, let S be standard bitableau with KRS(S) ^ in(S) and set d = degS. Then / = (E) + (Xtj : 1 < i < m, 1 < j < n)d+l has a standard basis and KRS(7) / in(/). As we have seen in the previous section, there are in-KRS ideals that are not G-KRS. The G-KRS ideals among those considered in Corollary 5.3 will be characterized in the next section.
6 BASIC KRS-INVARIANTS In this section we want to show that the functions a^ are basic KRS-invariants, as far as functions F : T> -» N are considered that depend only on shape. First we prove a converse of Proposition 4.7:
PROPOSITION 6.1. Let F : T> -> N be a str-monotone function, and let k be an integer. Let h(F) be the ideal generated by all bitableaux A such that F(A) > k. Then the following hold:
KRS and determinantal ideals
81
(a) Ik(F) has a standard basis, and A e Ijt(F) (if and) only z/F(A) > k; (b) iflk(F)
is G-KRS for all k, then F is a KRS-invariant.
Proof, (a) It follows immediately from the definition of str-monotonicity that Ik (F) is the K-vector space generated by the bitableaux A with F(A) > k, and that the standard bitableaux E € Ik (F) form a jRT-basis. (b) We have to show that F(E) = F(KRS(S)) for every standard bitableau E. First note that F(E) < F(KRS(E)). Set k - KRS(E). Since by assumption Ik(F) is G-KRS we have that KRS(E) = in(A) for some A £ Ik(F) and consequently F(KRS(£)) > k. It follows that for every t one has
KRS(J t (F)) C (M : F(M) >t)C in(It(F)) = KRS(/ t (F)) and hence KRS(J t (F)) = (M : F(M) > t). Now let M be a monomial and set t = F(M). Then E = KRS-1(^) is in It(F) which proves that F(S) > F(KRS(£)). D Now we can show that the KRS-invariance of the functions 7^ follows from that of the otk'PROPOSITION 6.2. For allt,ll one has
Proof. Let E e I j ' be a (standard) bitableau, and suppose that k is the biggest index such that |E|jt > t. Then obviously E e J(k,r + (t - 1)). The verification of the inclusion D is likewise simple. D Since by Greene's theorem the ideals J(k, d) are G-KRS, it follows immediately that the ideals l[r' are G-KRS. In conjunction with Proposition 6.1 we therefore obtain that the jt are KRS-invariants. From hindsight, Theorem 4.8 is an easy consequence of Greene's theorem. The most difficult part of [4] is the proof that the ideals ITt are G-KRS in nonexceptional characteristics. Actually Jtr = J(r, rt) so that the property of being G-KRS is no longer surprising for I£. Not every shape defined, G-KRS ideal is the sum of ideals J(k, d). As an example one can take /^ n Is = /i/s. Another exception occurs for square matrices. For example, if m = n = 4, then 72/4 is G-KRS, but it looses this property for bigger matrices. Nevertheless, the next theorem shows that the functions a>k are truly basic KRS-invariants:
THEOREM 6.3. Let I be a shape defined ideal. If I is G-KRS, then it is the sum of ideals of type J(k, d) n If and, ifm = n, ( J ( k , d) n /r)/£.
Brims and Conca
82 Proof. Let S € 7 be a (standard) bitableau. Suppose that a = |£| = (si,...,s f c , !,...,!)
with Sfc > 2, and st < max(m, n) (equality can only occur if m = n). Set d = otk(a) and £> = deg(S). Then J = 7(fc,d) n if is the smallest ideal of type J ( k , d ) n If containing E. Among the shapes of the elements in the standard basis of J there exists a unique element that is minimal with respect to the partial order defined by the functions 7t (see Section 5). In fact let u = [_d/k\ and r = d-uk. Then the smallest element is
d = (u + 1, . . . , u + 1, u, . . . , u, 1 . . . , 1)
where u 4- 1 appears r times, u appears d — r times, and 1 as often as in a. We have J = /W. Therefore, if a — 0, the ideal J is contained in /, as follows from Theorem 5.2. Now suppose that a > 6. Then it is enough to show that there exists a standard bitableau S of shape a such that |A| < a whenever in(A) = KRS(S). Since we have |A| < a from the KRS invariance of the functions 7t (or a^) it really suffices to find S of shape a such that |A| ^ a for all A with in(<J) = KRS(S). Instead of constructing A directly, we find a monomial M such that KRS-1(M) has the desired shape, but M cannot be written as in(A) where |A| = a. The shape of KRS -1 (M) can be controlled via the 7 or a functions. Let us first consider a = (51,52); we set p = si, q = s2. Then max(m,n) > p > q + 2 > I and min(m,n) > p. It is harmless to assume n — max(m, n). With r — p - q + 2 let
For p = 5 and q = 3 this monomial has the following "picture" :
The reader can check that KRS -1 (M) indeed as shape (p, q). However, it is not possible to decompose M into a product in(#i)in(<52) where \8i\ — p, \52\ = q. In the general case one must multiply M with suitable factors. These are not hard to find. D 7 INITIAL IDEAL OF SYMBOLIC POWERS AND SYMBOLIC POWERS OF THE INITIAL IDEAL
Let S be a polynomial ring and T a term order on S. Given an ideal J of S and an integer b one denotes by «/<& the intersection of all the primary components
KRS and determinantal ideals
83
of height < b in a primary decomposition of J (J 6} and that in(J<6) C in(J)<6,
(1)
see [17]. If J has height c, then we define the fc-symbolic power J^ of J to be: •/<*> = (Jk)
Note that J^ = J if and only if J has no embedded primes and all the minimal primes have height c. Now by (1)
On the other hand, since in(J)* C in(J fc ), we have in(J)<*> - (in(J)*)<e C in(J fc )< c . Summing up, there are inclusions
(2) These inclusions are in general strict. In this section we will show that they are equalities when J is the determinantal ideal It and r is a diagonal term order. THEOREM 7.1. In non- exceptional characteristics we have in(J t ( * ) )=in(J*)< c = in(J4)(*) where c is the height of It, i.e. c — (m — t + l)(n — t + 1). The initial ideal in(/t) of It is the square free monomial ideal generated by the diagonals of the f-minors, simply called ^-diagonals in the sequel. Hence it is the Stanley-Reisner ideal of the simplicial complex A t = {A C {1, . . . , m} x {1, . . . , n} : A does not contain t-diagonals}. Denote by Fj the set of the facets of Aj. Then in(J t ) =
PF
where Pp denotes the ideal generated by the Xij with ( i , j ) $ F. The elements of Ft are described in [12] in terms of families of non-intersecting paths. It turns out that Aj is a pure (even shellable) simplicial complex. Since the powers of the ideals PF are P^-primary, it follows that
We start by proving:
84
Bruns and Conca
PROPOSITION 7.2. We have
We have already mentioned in Section 4 that If is G-KRS, and in particular the initial ideal in(/t ) of I\ is generated by the monomials M with 7t(M) > k. Now a monomial M = Ili=i xafbi is in Pp if and only if the cardinality of {i : (a;, &;) ^ F} is > k. Equivalently, M is in P£ if and only if the cardinality of {i : (aj,6j) € F} is < deg(M) - k. If we set
wt(M) = max{|A| :AC[l,...,s] and {(oj,6i) : i € 4} G A t } then we have that a monomial M is in PlF€Ft PF if an k. Now Proposition 7.2 follows from:
LEMMA 7.3. Let M be a monomial. Then 7t(M) + wt(M) = deg(M). We reduce this lemma to a combinatorial statement on sequences of integers. Given such a sequence b we define wt(b) to be the cardinality of the longest subsequence of b which does not contain an increasing subsequence of length t, that is,
wt(b) = max{length(c) : c is a subsequence of B and 74 (c) = 0}. Let M — Hi=i xa.ibi be a monomial. We may order the indices such that aj < ai+i for every i and bi+i > 6, whenever Oi = ai+\ . (We have already considered this rearrangement in Section 3.) Then the i-diagonals dividing M correspond to increasing subsequences of length t of the sequence b, and wt(M) = wt(b). Since wt(M) depends only on the sequence b we may assume that o^ = i for every i. Then, by exchanging the role between the Oj's and the 6,'s we may also assume that the bi are distinct integers (see Remark 3.2). Summing up, it suffices to show that:
LEMMA 7.4. One has 7t(6) + wt(b) = length(fr) for every sequence b of distinct integers. Proof. Let P be the tableau obtained from b by the Robinson-Schensted insertion algorithm. We have already discussed the first part of Greene's theorem, namely that the sum a/b(P) of the lengths of the first k rows of P is the length of the longest subsequence of 6 that has a decomposition into k increasing subsequences. But the theorem contains a second (dual) assertion: the sum a*k(P) of the lengths of the first k columns of P is the length of the longest subsequence of 6 that can be decomposed into k decreasing subsequences. It follows that a sequence a has no increasing subsequence of length t if and only if it can be decomposed into t - 1 decreasing subsequences. Then wt(b) is the equal to the maximal length of a subsequence of 6 which can be decomposed into t — 1 decreasing subsequences. Therefore Wt(b) = al_l(P). On the other hand, by Theorem 4.8 we know that 7t(6) is equal to 7t(P) which is the sum of the length of the columns of P of index
> t. Therefore 7^(6) + wt(b) is equal to the number of entries of P which is the D
length of b.
KRS and determinantal ideals
85
We know [4, Thm. 3.5] that in(/tfc) = f|j-=i in(/j fc(t+1 ~ j)) ) (in non-exceptional characteristic) and hence, taking into consideration Proposition 7.2, we have:
3=1
ri
Since the powers of the ideal Pp are Pp-primary we have that (3) is indeed a primary decomposition of in(I*). Hence in(/tfc)
QUESTION 7.6. What is a primary decomposition of the powers of in(Jt)? Is the Rees algebra of in(It) Cohen-Macaulay? Is it normal? 8
COGENERATED IDEALS
As before, let X = (%ij) be an m x n matrix of indeterminates. We consider the set of minors of X equipped with the usual partial order that has been introduced in Section 2. Let <5 = [01,02, ... ,a r |&i,&2, ••• ,br] be a minor of X. One defines 1(6, X) to be the ideal of K[X] generated by all the minors /i such that fj, % S, i.e.
The ideal I ( 6 , X ) is said to be the ideal cogenerated by 6. For general facts about the ideals cogenerated by minors we refer the reader to [6]. We just recall that 1(6, X) is a prime ideal and that it has a standard basis. Namely the set B(6) = {£ : E = a\ • • • crw is a standard bitableau and a\ ^ 6} is a K- vector space basis of 1(6, X). Herzog and Trung have shown in [12, Theorem 2.4] that the natural generators of 1(6, X) (i.e. the minors n such that /j, ^ 6) form a Grobner basis of 1(6, X) with respect to the diagonal term order. Their argument makes use of the KRS correspondence and boils down to the study of the KRS image of the elements of B(6). We will see that this can be rephrased in terms of properties of a suitable 7-function associated to 6. We will henceforth denote its value on the bitableau A by 7,5 (A). We start by defining j s ( p ) f°r a single minor (j,= [ c i , . . . , C k \ d i , . . . , d k ] , namely
7a(//) = max{(i - j + 1)+ : 1 < i < k, 1 < j < r + 1 and (cj < a,- or dt < bj)}
86
Bruits and Conca
where, by definition, o r+ i = 6r+1 = oo. Then we extend, by linearity, the 75function to product of minors, that is, if A = /^ • • • nh is a product of minors, then
The standard bitableaux £ such that 7,5 (S) ^ 0 are exactly the elements of B(6). Note that if one takes <J = [1, . . . , i - 1 1, . . . , i — 1] then J(<5, X) — 7t and 7*(/i) = 7t(/i). We may extend, as we have done in Section 4, the definition of the 7,5 -function also to ordinary monomials by setting:
"fi(M) = max{7i(A) : A is a bitableau and in(A) = M}. In terms of the 7,5-function Herzog and Trung [12, Lemma 1.2] proved
LEMMA 8.1. Let £ be a standard bitableau. Then 7«(S) ?* 0 =» 75(KRS(£)) 5* 0 and this implies that
THEOREM 8.2. The ideal 1(5, X) is G-KRS. Note that from 8.2 one has that
There are many natural questions concerning the function 7,5 and related ideals. For instance:
QUESTIONS 8.3. Let J(6,k) = h(ls), that is, the ideal generated by the bitableaux A such that 7,5 (A) > k, and let B(6, k) be the set of the standard bitableaux £ with 7,j(S) > k. (a) Is 7,5 a KRS-invariant? (b) Is B(6, k) a basis of J(6,k)t i.e. is 7,5 str-monotone? (c) Is J(S,k) equal to I(5,X)^7 The inclusion J(6,k) C I(6,X)W holds since the symbolic powers form a nitration and for a single minor /i is not difficult to see that n 6 1(6, X)^ where k = 75 (/z).
(d) Is i REFERENCES
1. S.S. Abhyankar and D.M. Kulkarni. Bisection between indexed monomials and standard bitableaux. Discrete Math. 79 (1990), 1-48.
KRS and determinants] ideals
87
2. S.S. Abhyankar and D.M. Kulkarni. Coinsertion and standard bitableattx.) Discrete Math. 85 (1990), 115-166.
3. C. Bae^ica. Rees algebra of ideals generated by pfaffians. (1998), 1769-1778.
Commun. Algebra 26
4. W. Bruns and A. Conca. KRS and powers of determinantal ideals. Compositio Math. Ill (1998), 111-122.
5. W. Bruns and M. Kwiecinski. Generic graph construction ideals and Greene's theorem. Math. Z. 233 (2000), 115-126. 6. W. Bruns and U. Vetter. Determinantal rings. Lect. Notes Math. 1327, Springer 1988.
7. A. Conca. Grobner bases of ideals of minors of a symmetric matrix. 3. Algebra 166 (1994), 406-421.
8. E. De Negri. ASL and Groebner bases theory for Pfaffians bras. Dissertation, Universitat Essen (1996).
and monomial alge-
9. C. De Concini, D. Eisenbud and C. Procesi. Young diagrams and determinantal varieties. Invent, math. 56 (1980), 129-165. 10. W. Fulton. Young tableaux. Cambridge University Press 1997. 11. C. Greene. An extension of Schensted's theorem. Adv. Math. 14 (1974), 254265.
12. J. Herzog and N. V. Trung. Grobner bases and multiplicity of determinantal and pfaffian ideals. Adv. in Math. 96 (1992), 1-37.
13. D.E. Knuth. Permutations, matrices, and generalized Young tableaux. Pacific J. Math. 34 (1970), 709-727. 14. C. Schensted. Longest increasing and decreasing subsequences. Can. J. Math. 13 (1961), 179-191. 15. R.P. Stanley, Enumerative Combinatorics, Vol 2. Cambridge University Press 1999.
16. B. Sturmfels. Grobner bases and Stanley decompositions of determinantal rings. Math. Z. 205 (1990), 137-144. 17. B. Sturmfels, Ngo Viet Trung and W. Vogel. Bounds on degrees of projective schemes. Math. Ann. 302 (1995), 417-432.
The Koszul complex in projective dimension one WINFRIED BRUNS, Universitat Osnabruck, FB Mathematik/Informatik, 49069 Osnabriick, Germany, Winfried.BrunsQmathematik.uni-osnabrueck.de
UDO VETTER, Universitat Oldenburg, FB Mathematik, 26111 Oldenburg, Germany, vetterQmathematik.uni-oldenburg.de
Let R be a noetherian ring and M a finite .R-module. With a linear form \ on M one associates the Koszul complex K(x)- If M is a free module, then the homology of K(x) is well-understood, and in particular it is grade sensitive with respect to Imx-
In this note we investigate the case of a module M of projective dimension 1 (more precisely, M has a free resolution of length 1) for which the first nonvanishing Fitting ideal I M has the maximally possible grade r + 1, r = rankM. Then h = grade Imx < r + 1 for all linear forms x on M, and it turns out that Hr.i(K(x)) = 0 for all even t < h and Hr-i(K(x)) = S ( '~ 1)/2 ((7) for all odd i < h where S denotes symmetric power and C — Ext^j(M, R), in other words, C = Cokt/i* for a presentation
Moreover, if h < r, then Hr-/l(K(x)) is neither 0 nor isomorphic to a symmetric power of (7, so that it is justified to say that K(x) is grade sensitive for the modules M under consideration. We furthermore show that the maximally possible value grade Im x —r + 1 can only occur in two extreme cases: (i) r = 1 or (ii) rankF = 1 and r is odd. The note was motivated by a result of Migliore, Nagel, and Peterson (see [MNP], Proposition 5.1). They implicitly prove the result on K(x) for Gorenstein rings R, using local cohomology. Our method allows more general assumptions. (Even the assumption that R is noetherian is superfluous if one uses the correct notion of grade.) It is based on results in [BV1] and has a predecessor in [HM]. The case in which rankF = 1 has been treated in [BV3].
89
90
Bruns and Vetter
The situation in which the Fitting ideal IM of M has only grade r is also of interest. For example, it occurs for the Kahler differentials of complete intersections with isolated singularities. While our method also yields results in this case, we have restricted ourselves to the case of grade r + 1 for the sake of clarity. The detailed account of the linear algebra of M and its exterior powers has been given in [BV2], Section 2.
For technical reasons we start with a situation dual to the above one. So let F, GJoe finite free ^-modules of rank m,n and ip : G -> F an .R-homomorphism. Set G = G ® S(F) where S(F) denotes the symmetric algebra of F. Then we may consider ip an S(F) -linear form on G and can define the Koszul antiderivation
with respect to ?/> in the usual way, i.e.
A ... A Xi) —
(-l) J t/>(:Ej):ri A .. .Xj ... A
for xi . . . Xi € G. We use the term Koszul complex also for the complex
associated with a linear map if : R —t G. Suppose that i/>ip = 0 and let
dv:^G^ /\G
be the differential of the Koszul complex associated with tp ® S(F), i. e.
dv(x) = (
for x € A^- Since ip
Koszul complex in protective dimension one
91
bicomplex K.
0
1
,
[
0
i «i
4*
4-
0
0
0
I - ! i -i
"+•
! i
4-
-4*
°^l^ \^"\r^ "L 0———,
«
_^M
-^ ^
-^« -^« 0
where for all integers p, g, and S? means qth symmetric power. The row homology of /C
at Mp'9 is denoted by H™, the column homology by Hp'q . Thus Hp>° is the pth homology module Hp of the Koszul complex associated to /\PG yield a complex homomorphism 0 ———> R —?—> N1 ———>• • • • NP
—^-> ]Vp+1 • • •
o ——>. /z — ^-> G ——>. ..-/VPG — ^-* A P+I G where the maps .
PROPOSITION 1. Set g = grade 1M, C = Coktfj, and let h = grade Im^*. Assume that r = n — m > 1 and g — r + 1. Then (a) Im
(b) Hi = 0 for 0 < i < min(2, h - 1);
92
Brims and Vetter
(c)
if 3 < i < M £ 0 ( 2 ) i/ 3 < » < /i, i = 0 (2);
\0
(d) moreover, for h > 3 £/iere is on ea;ac£ sequence Q -> S^ (C) -> Hh -> Hh h
h
Q-*H -^H
if h £0(2),
if h = 0 ( 2 ) .
Proof. Let M = Cok i/>* . We choose a basis e\ , . . . , em of F* and define the linear map * : G* -> /\m+lG* by *(x) = V*(ei) A ... A *i/>*(em) A a;. Then one obtains a complex 0 -»• F* ^ G" whose dual is the head of the Buchsbaum-Rim complex resolving C = Coktp. It follows that M* = Im\&*, and obviously Im** C IMG. Since ip 6 M*, one has Imtp C IM- This shows (a). We quote some well-known facts about the homology of 1C. Let 0 < p < g. Then H™ =Oforq^Q,p and H™ = SP(C). (See [BV1], Proposition 2.1 for the general statement.) Furthermore Hp>q — 0 for p — q < h by the grade sensitivity of the Koszul complex for ip. Claim (b) on H1 for 0 < i < min(2, ft - 1) is easily proved from the long exact (co)homology sequence. For (c) we modify the complex K. to the complex K, by setting (i) Mp
~1 — Np. The maps to be added are the natural surjection P P p+1 p+l < , and those induced by the canonMP,P _). S (C), the zero map S (C) -^ M p p ical injections A^ -» f\ G. The truncation of K, to the "rectangle" 0 < p < h, 0 < q < g has exact columns. Moreover, row homology for indices < h can only occur at Mp>~1, namely Hp,0
— 1, be the gth row of K. and B9+i be the image complex of Tig in ~R.q+i . Then we have a series of exact sequences 0 -> Bq -> Kq -)• B9+i -)• 0. Thus we can use the long exact (co)homology sequence for each q. With SP'9 = Hp(Bq) one therefore obtains the "southwest" isomorphisms fji
_ £1,0 ^ _g»-l,l a • • • = jgi'i
if i is even, and -...-
if i is odd, 0 < i < h. In fact, there is an exact sequence
and the extreme terms in this sequence are 0 for all j under consideration. Let now i be even, and j = i/2. Since the map APJ -» M J + l j is injective, the same holds true for its restriction # -> B+l in 5 , and so Hp = Ej'j = 0.
Koszul complex in projective dimension one
93
In the case in which i is odd we can go one further step southwest, and obtain the isomorphism Sj(C) = £^+1 =* &>+1'i for j = (i - l)/2. Since Hh ^ 0, we only have an exact sequence
0 _> Eh-i,h _> gh _^ Hh^ but the arguments above can be applied to Eh~1'1; it is zero if h is even, and isomorphic to S (ft ~ 1)/2 (C) if h is odd.D REMARK 2. Proposition 1 shows that roughly the first half of the symmetric powers Sl(C), i < h, can be interpreted as homologies of a Koszul complex. It is also possible to interpret the other half in a similar way. To this end we consider the column complexes C o , . . . , C/j of /C (not of /C) and set Ch+i — Cok(Ch-i —> Ch)Then we obtain an exact sequence 0 -> C0 -> • • • -»• C ft -*• C ft+ i -> 0 of complexes, and the only nonzero (co)homology can occur along Cft+i and at HP(CP) = SP(C) for p > 0. If one applies arguments similar to those in the proof of Proposition 1 (now proceeding in northwestern direction), then one obtains
fs^C)
i f f c + i = 0(2),
for 0 < i < h. Note that the module C^+1 is resolved by 7?.j, and Hi is just a truncated and shifted version of KQ <8> S*(F). The truncations of ~R0 resolve the exterior powers A/M 9 where Mv = Cok(ip). Thus Clh+1 = f\h~lMv ® Sl(F).As in the proof of Proposition 1 let M = Cok^*. Then it is easy to see that Np = (f\pM)* for all p. In fact, ifj" induces a presentation
f\p~lG* ® F* -> f\pG* ->• /\PM -> 0 for all p, and the exact sequence 0 -> iVp -> /\PG -> /\P~1G <S> F is obtained by dualizing. It follows that ./Vr is free of rank 1 (provided grade IM > 2), and Np — 0 for p > r.
COROLLARY 3. LeiV '• G -* F be as above, and assume thatg = gradelM = H-l. T/ien t/ie following conditions are equivalent.
(1) There is a homomorphism ip : R —> G suc/i i/ioi ^y> = 0 ond the ideal Im ?* ftas grade r + 1;
f2J (i) r = 1 or (ii) m = 1 and r is odd.
Proof. The implication (2) => (1) is an easy exercise. (See also the considerations at the end of this note.) For the converse observe that Np = 0 for p > r and that Nr is free of rank 1. So Hr must be cyclic. If r were even, then_H r = 0 by Proposition 1, and Imc^* = R. Thus r must be odd. In this case Hr = S (r ~ 1)/2 (C) by Proposition
1 where C = Coki/i*. So if r > 3, then C must be cyclic, which in turn means m = 1.O
94
Bruns and Vetter
We now return to our original purpose. Therefore let x be a linear form on M = Cokip*. The induced linear form on G* is denoted by x; note that xV'* = 0. Set ip = x*, and, as above, r — n — m. We want to connect the truncated Koszul complex 0 -> I\TM -> • • • A*-^ ~~$ K~1M • • • -> M -> R -> 0
(1)
with the complex 0 -> fl 4 AT1 -> • • • ATp ^ Afp+1 • • •
(2)
considered above. We have already observed that Np = (/\PM)*.
LEMMA 4. With notation from above, let g = grade 1M > r + I. Then there are maps np : f\pM -» Nr~p, p = 0,... ,r, such that d$fj,p = ±^ p _i9^ and which are isomorphisms for p — 0,... ,r — I and injective for p = r. If, in particular, g = r + 1 > 2, then we obtain the following diagram of maps, the columns of which are exact and with commutative or anticommutative rectangles: 0
0
I
Proof. As in [BV2], p. 17, we choose isomorphisms 7 : /\™F* -^ R, 6 : /\nG* -» and define maps = 0, . . . , r, by
a; € A P G*, J/ G A r " p G*, z = T-^1)- Via the natural isomorphism (/\r~pG*)* ^ /\r~pG we regard i/p as a map f\pG* -> A r " PGf - One has Im VP C A rr ~ p , and it is an easy exercise to show that the diagram
Koszul complex in projective dimension one
95
is commutative or anticommutative (see for example [HM], proof of Theorem 3.1). Consequently the same is true for
PP-I dx, \lmvp
where pp and pp-\ are induced by vp and vf-i. Now let np be the composition of pp and the canonical injection Im vp ->• Nr~p. Then the equation asserted in the proposition obviously holds. In case p < grade IM —1, Imz/ p = Nr~p. This proves the remaining statements.D
If we look at the homology of the truncated Koszul complex (1) associated to x instead of the homology of (2), then a somewhat smoother assertion than Proposition 1 is possible.
THEOREM 5. Let M be module with a finite free resolution of length 1, M = Coktf}* where ip : G —> F is as above, and assume that g = grade IM_ = r + 1. Let X be a linear form on M . Then Imx C IM, and for the homology Hp at /\MP of the truncated Koszul complex (1) associated to x the following holds:
if 0 < i < h, i ^ 0 (2) if 0 < i < h, i = 0 (2), where S°(C) =R/IM. Furthermore there is a x with grade Imx — g if and only if (i) r = 1 or (ii)
m = 1 and r is odd. In this case we have necessarily Im x = IM • Proof. Consider the diagram in Lemma 4. Since p,r is injective, Hr must _be zero if h > 0. Next let h > 1. Then we obtain R/_IM = ff r -i, since H° = H1 = 0. Finally if h > 2, then in addition H2 = 0, so Hr-2 = 0 as stated. The remaining assertions concerning the homology of (1) are contained in Proposition 1. Instead of x we can consider the induced linear form x on G* . Corollary 3 yields the statement about the existence of such a linear form x satisfying grade Im x = 9Assume that such a x exists. If m = 1, then Imx = IM by Proposition 2 in [BV3]. If r — 1, then, under our assumptions, M = Cok«/>* is an ideal in R which must be isomorphic to Imx- Using the Hilbert-Burch Theorem, we have Imx = Q!M with an element a € R. Since grade Imx = 2, a must be a unit.D REMARK 6. (a) It is a noteworthy fact that the homology Hr-i of the truncated Koszul complex (1) associated to x is independent of x for i < h. (b) The Koszul complex associated to a linear form x on a free module of rank r is grade sensitive: its homology vanishes for j > r — grade Im x, and does not vanish at r — grade Im x-
In a sense, this is also true for the linear form x considered in Theorem 5: of course, "vanishes" must be replaced by "vanishes if i is even and is isomorphic to S (i ~ 1)/2 (C) if i is odd". Then Theorem 5 covers alH = 0, . . . , h - 1, but
96
Bruns and Vetter the analogy also persists if i = h < g. In fact, let p be a prime ideal of grade h such that Im* C p. The module Mp is free and Sj(Cv) = SJ'(C% = 0 for all j. Therefore one can apply the grade sensitivity of the Koszul complex for a free module, and H^ can be neither 0 nor isomorphic to a non-vanishing symmetric power of C: otherwise its localization would vanish.
(c) That we have truncated the Koszul complex of x is inessential. In fact, f\rM is torsionfree of rank 1, and /\ r+1 M has rank 0. Hence Hom/{(/\r+1M, f\TM) — 0, and the homology of the full and of the truncated Koszul complexes at f\TM coincide. Let ip : G —* F be as above, r = n — m, and g = grade IM = r + 1. In case r > 1, the existence of a linear form x on G* with grade Im^ = g can be described equivalently and independently of the last theorem.
PROPOSITION 7. With the assumptions on t/> and x from Theorem 5, assume in addition that r > 1. Then grade Im x = 9 is possible if and only if there exists a submodule U of M = Cok ?/>* with the following properties: (1) rank[/ = r- 1;
(2) U is reflexive, orientable, and U9 is a free direct summand of Mv for all primes p of R such that grade p < r. Proof. Let x be a linear form on M such that grade Imx = r + 1. Set U = Ker%. Then (1) and the last property in (2) are obvious. Since Imx is torsionfree and M is reflexive, U must be reflexive. Because Im x has grade > 2, it is orientable. M being orientable, the orientability of U follows from Proposition (2.8) in [B]. Conversely let U be a submodule of M which satisfies (1) and (2). Then / = M/U is torsionfree of rank 1 and therefore an ideal in R which is orientable since
U and M are orientable. Consequently grade/ > 2. So for a prime p in R which contains /, the localization IRf cannot be free. On the other hand I = R is impossible since g = r + 1. In view of the last condition in (2), / must have grade r + LD From Theorem 5 we know that the hypothesis of Proposition 7 can only be satisfied with m = 1 and r odd. The submodule U of M in Proposition 7 has projective dimension r — 1. In fact, the ideal IM = Imx is generated by r + 1 elements and has grade r +1. Therefore it is perfect, i. e. projdim R/I = r +1. This
implies projdim U — r -I via the exact sequence 0 - » [ / - ^ M - » / - » 0 . Dualizing this exact sequence, we obtain an exact sequence 0 -* R -t M* -> U* -> 0. Since M* = f\r~lM has projective dimension r — 1, it follows that U* has projective dimension r - I . The dualization argument just used amounts to interchanging the roles of ip* and x> so that U* plays the same role for x* and if> as U for i/>* and x- If we choose X in a special way, then we can even achieve that U and U* are isomorphic in a skewsymmetric way: for the isomorphism a : U —>• U* one has a* = —a upon the identification of U and U** via the natural isomorphism. As we mentioned at the beginning of the proof of Corollary 3, it is easy to see that
there is a linear form x on G* such that ip* (1) £ Ker x and grade Imx = r + l = n:
Koszul complex in projective dimension one
97
fix a basis zi, . . . ,zn of G* and let if>*(l) = SILi xizi'i the map \ : X^ILi a»z* ^ X)™-! (— l)* a t^n+i-» is an appropriate linear form. Let x be the induced form on M = Cok •;/>*. The submodule U = Ker% has the properties (1) and (2) of Proposition 7 (see the first part of the proof). Consider the commutative diagram 0 ———> Kerx
with exact rows. The isomorphism p is defined by p(zi) = (-l)*z*+1_i where z*,... , z* is the basis of G dual to zi,... ,z n > and pi is induced by p. Since Pi(t/>*(l)) = —x, we obtain a second commutative diagram Kerx ———> U PI
——> 0
PI
with exact rows. (V>*)i is induced by ip* and the first vertical arrow maps 1 to —1. As pi is an isomorphism, the same is true for pi, so U turns out to be self-dual. Moreover p\ is skew-symmetric, i.e. (jp\)* = —pi since the same is true for p. Suppose that R = K\X\,..., Xn] is the polynomial ring in n indeterminates over a field K. If we define tp : Rn —> R by ip(ei) = X^ then the module U is associated with a rank n — 2 vector bundle on Wn~l(K). Such bundles exist however also for odd n; see [V]. The module V associated with the the construction in [V] is self-dual only for n = 4. REFERENCES 1. W. Bruns. The Buchsbaum-Eisenbud structure theorems and alternating syzygies. Commun. Algebra 15 (1987), 873-925.
2. W. Bruns and U. Vetter. Length formulas for the Local Cohomology of Exterior Powers. Math Z. 191 (1986), 145-158. 3. W. Bruns, U. Vetter. Determinantal rings. Lect. Notes Math. 1327, Springer 1988.
4. W. Bruns and U. Vetter. A Remark on Koszul Complexes. Beitr. Algebra Geom. 39 (1998), 249-254.
5. J. Herzog and A. Martsinkovsky. Glueing Cohen-Macaulay modules with applications to quasihomogeneous complete intersections with isolated singularities. Comment. Math. Helv. 68 (1993), 365-384 6. J.C. Migliore, U. Nagel, and C. Peterson. Buchsbaum-Rim sheaves and their multiple sections. J. Algebra 219 (1999), 378-420.
7. U. Vetter. Zu einem Satz van G. Trautmann iiber den Rang gewisser kohdrenter analytischer Garben. Arch. Math. 24 (1973), 158-161.
Grobner bases as Characteristic Sets
GIUSEPPA CARRA FERRO Department of Mathematics and Computer Science, University of Catania, Catania, Italy
1 INTRODUCTION The notion of characteristic set was introduced by Ritt [1] in order to study differential polynomials and in particular usual polynomials. This notion is used now in automatic deduction in geometry and it is alternative to the notion of Grobner basis in [2] and [3]. Such notion is based on the concepts of class, ranking, pseudodivision, pseudoremainder and pseudoreduction in the ring of differential polynomials. A characteristic set of a set of differential polynomials is nothing else than a finite set of differential polynomials, such that every differential polynomial is pseudoreduced with respect to the other ones and minimal with respect to a pre-order depending on the ranking and denned on finite subsets of differential polynomials. If a set of polynomials is considered, then a characteristic set of a prime ideal is a regular sequence. When linear partial differential polynomials are considered, then a ranking is nothing else than a term ordering on a free module of finite rank over a polynomial ring and the notions of pseudodivision, pseudoremainder and pseudoreduction almost coincide with the notions of division, remainder and reduction in the Grobner basis theory. These special properties were recently used by Levin [4] in order to define Hilbert polynomials in two variables of algebraic and differential ideals. In this paper it is shown that if the notions of term ordering, division, remainder and reduction are used as in Grobner basis theory and the notions of autoreduced set and ranking pre-order on such sets are used as in Ritt theory, then the notion of characteristic set of an ideal is equal to the notion of reduced Grobner basis. Another approach suggests such proof in [5]. Furthermore the Wu-Ritt-Kolchin algorithm for
99
100
Carra Ferro
the construction of an extended characteristic set of a differential polynomial ideal becomes a reduced Grobner basis algorithm. The ranking pre order induces a pre order on the set of all polynomial ideals in K[Xi,...,Xn] and then an equivalence relation. Two ideals are equivalent if they have the same monomial ideal associated to the corresponding reduced Grobner basis. Finally the ranking pre-order induces a linear pre-order on the set of all monomial ideals and it induces a linear pre-order on the Hilbert scheme of all homogeneous ideals in K[Xi,..., Xn] with the same Hilbert polynomial.
2 GROBNER BASES IN POLYNOMIAL RINGS Let NO—{0,1,2,..., n,...}. It is well known that (N$, +) is a commutative monoid. Let X\,..., Xn be n variables. DEFINITION 1 PP(Xi,..., Xn)={ X? • • • X^: (01,..., an) € Ng } is the set of power products in the variables X\,..., Xn.
(PP(X\,...,Xn),.) is a monoid and it is isomorphic to (NQ, +). Let K be a field of characteristic zero. Let A = K[Xi,...,Xn] TA = PP(Xi,..., Xn] be the set of terms of A.
and let
DEFINITION 2 A term ordering a on TA is a total order such that:
(i). 1
Let K* be equal to K \ {0}. Let A* be equal to A \ {0} and let / e A*, f — Y
DEFINITION 3 Let a be a term ordering on TA and let / be an ideal in A.
MM) = (MM) • f e I) and Tff(I) = (Ta(f) : / € / ) . DEFINITION 4 [9]. Let / = (/i,... ,/ r ) be an ideal in A and let a be a term ordering on TA- F={fi,..., fr} is a Grobner ( or standard) basis of / with respect to a iff
Grobner bases as Characteristic Sets
either Mff(I)
101
= (Mff (A, . . . , M ff (/ r )) or Tff(I) = (Tff(fi, • • • , Wr))-
By [10] every ideal / in A has a Grobner basis. DEFINITION 5 Let f,g € A* and let a be a term ordering on TA. / is reduced with respect to g iff no monomial in / is a multiple of Mff(g). More
generally if G={g\, . . . ,gr} C A* f is reduced with respect to G iff it is reduced with respect to every &, i=l,. . . ,r. REMARK 1 Let /, g\,. . . ,gr 6 A*. If / is not reduced with respect to G={gi,. . . ,<7 r }, then there exist gj.,. . . ,qr,r € A such that /=£)i=i,...,r 9»S*+ r and r is reduced with respect to G. r is obtained by the usual reduction procedure in a finite number of steps, because a is a well ordering. In this case / reduces to r with respect to G. DEFINITION 6 Let f , g € A* and let a be a term ordering on TA.
),
]9
is the S — polynomial of / and g and it will be denoted by S ( f , g ) . The following propositions are well known in the literature.
PROPOSITION 1 [10]. F={/l5 . . . , fr} is a Grobner basis of the ideal / in A with respect to the term ordering a iff S(fi,
fj) reduces to zero with respect to F for alii, j — 1, . . . , r.
PROPOSITION 2 [10], [6]. Let / be a nonzero ideal in A and let a be a term ordering on TA- There exists a set F={fi, . . . , fr} C / \ {0} such that:
(i)- fi —ai^i + ^i> with ti £ TA and GJ G -^* f°r alii = 1, . . . , r; (ii).
{ < i , . . . , ir} minimally generates TO-(/);
(iii). ajtj = Mff(fi)
(iv).
for alii = 1, . . . ,r;
Supp(Ri) n T ff (/)=0 for all * = 1, . . . ,r.
F is a Grobner basis of I with respect to a and it is called a reduced Grobner basis of I with respect to a. If #j = a^1 fi for alH = 1, . . . , r, the G— {
102
Carra Ferro
(i). F={fi,..., fr} is a Grobner basis of / with respect to a. (ii). A polynomial / € 7 iff / reduces to 0 with respect to F.
3 AUTOREDUCED SETS
Now the notion of autoreduced set is introduced in order to prove the equivalence between the notions of reduced Grobner basis and characteristic set. DEFINITION 7 Let G={gi,...,gr} C A* and let a be a term ordering on TA- G is autoreduced iff each $ is reduced with respect to every gj, ij = l , . . . , r and j ^ i.
PROPOSITION 4 Let a be a term ordering on TA- Every autoreduced set of polynomials is finite. Proof: Let G be an autoreduced set of polynomials in A and let Ta={T(7(g): g 6 G}. By Dickson lemma there exists a finite subset F of G, such that every Ta(g) is a multiple of Ta(f) for some / € F. If F ^ G, then we have a contradiction by definition of autoreduced set. In fact each g € G is reduced with respect to every g' 6 G with g ^ g', i.e. Ta(g) is not a multiple of Ta(sf) for all g1 ± g. A proof of Proposition 4 with different tools is in [5], prop.4.1.36, p.201.
Now a pre-order relation, i.e. a reflexive and transitive relation is introduced on the set of all polynomials in A. This relation can be found in [1] and [11], where only variables are used. It also can be found in [12], [4] and [5], where power products in the variables are used.
DEFINITION 8 Let a be a term ordering on TA and let /, g € A. / h a s lower rank than g if Ta(f)
Only autoreduced sets G={gi,... ,gr} arranged in order of increasing rank will be considered, i.e. autoreduced sets G={gi,... ,gr} with rank(g\) -
Grobner bases as Characteristic Sets
103
REMARK 2 Let f,gi,...,gr € A* and suppose that G= {gi,-.-,gr} is a chain with respect to a. If / is not reduced with respect to G, then by Remark 1 there exist q\,..., g r , r € A such that / = ]Ci=i r 9z9* + r an(^ T is reduced with respect to G. If r is obtained by reducing / in decreasing
order with respect to gr,---,9i, then the polynomials
A similar procedure can be found in [13], p.331 and p.368. DEFINITION 9 Let a be a term ordering on TA. Let JF={/i,... ,/r} and G={#i,..., gs} be autoreduced sets in A. F has lower rank than G and write F - s and rank(fi)=rank(gi) for alH = 1,..., s. If r = s and rank(fi)=rank(gi) for all i = 1,..., s, then F and G have the same rank.
REMARK 3 The ranking relation on the set of all autoreduced subsets of A defined as above is a pre-order relation by its own definition and is called again a ranking pre-order. It is easy also to show that it is linear, i.e. for each pair of autoreduced subsets F and G of A either F ^ G or G -
PROPOSITION 5 Let a be a term ordering on TA- Every nonempty set of autoreduced subsets of the ring of polynomials A has an element of lower rank.
Proof: Let S be a nonempty set of autoreduced subsets of A. By repeating the Ritt's proof in the case of autoreduced subsets associated to a different notion of reduction and rank, there exists a finite decreasing sequence of nonempty subsets of S. Let So=S. Let Si={ F £ S: F ^ 0 and the first
element of F is of lowest possible rank }. Let S2—{F€Si\ F has at least two elements and the second element of F is of lowest possible rank }. More
generally let Sh={ F 6 Sh-i- F has at least h elements and the h-th element of F is of lowest possible rank }. It follows that every autoreduced set in Sh has the first h elements of possible lower rank. If Sh+i is empty, then each autoreduced set F in Sh has minimal rank in S by definition of rank. Suppose that Sh is nonempty for all h G NO- Let G={ fh- fh is the h-th element of an autoreduced set F^ e Sh, h S NO }. G is an autoreduced set in A and then it must be finite by Proposition 4. So Sj must be empty for all j > h + 1 and some h (E NQ.
REMARK 4 The proof of Proposition 5 shows also that if F and G are two autoreduced subsets of A of lower rank in a set 5, then they have the same rank.
104
Carra Ferro
DEFINITION 10 Let a be a term ordering on TA and let / be an ideal in A. An autoreduced subset of / of lowest rank is a characteristic set of /. PROPOSITION 6 Let / be a nonzero ideal in A and let a be a term ordering on TA- The following statements are equivalent:
(i). G={gi,... ,gr} is a characteristic set of /. (ii). An element / of / is reduced with respect to G iff /=0. Proof: Suppose that G is a characteristic set of / and there exists a nonzero element / in I, that is reduced with respect to G. If rank(f) -
PROPOSITION 7 Let / be an ideal of A. G={gi,..., gr} is a characteristic set of / iff G is a reduced Grobner basis of / with respect to a. Proof: Suppose that G is a characteristic set of /. By Proposition 6 / € / iff it reduces to zero with respect to G. By Proposition 3 G is a Grobner basis of I with respect to a. Since G is autoreduced, then it is a reduced Grobner basis of / by Proposition 2. Conversely suppose that G is a reduced Grobner basis of / with respect to a. It follows that G is a autoreduced set by its own definition. So G is a characteristic set of / by Propositions 3 and 6. The above proposition shows once again the existence of a reduced Grobner basis of an ideal / in A with respect to a term ordering a. A similar proposition is suggested in [5], pp.201-202 and in [12], p.217, where a different linear pre-order on the set of all monic Grobner bases of / is used. REMARK 5 By Proposition 1 the well known Buchberger algorithm for the computation of a Grobner basis and its optimizations can be used for the
computation of a characteristic set of an ideal I — ( f i , . . . , f T ) in A. Conversely the Wu-Ritt-Kolchin algorithm for the computation of an extended characteristic set as in [14], pp.178-179 can be used for the computation of a reduced Grobner basis of /.
Grobner bases as Characteristic Sets
105
3.1 Algorithm of Wu-Ritt-Kolchin
Input / = (F), F = {/i,..., fr} ideal in A. Output G = { < ? i , . . . , <7S} a characteristic set of /. G:=0; B : = 0
loop F := F U fl U S; F7 := F; .R := 0; S := 0; while F ^ 0 loop Choose a polynomial / € F' of minimal ranking F':=F' \ {#: 3 is not reduced with respect to /} G:=GU/; end {loop}; for all / e F \ G loop if r:=remainder of / with respect to G and r ^ 0 then jR:=.RUr;
end {if}; end {loop}; for every nonempty subset H C G loop Compute S"=the S-polynomials of H; for every s' € 5' loop if s":=remainder of s' with respect to G and s" 7^ 0 then 5 := S U s" end {loop}; end {loop}; until R = 0; until 5 = 0; return G; end The termination of the algorithm follows from Proposition 5. The correctness of the algorithm follows from Proposition 1 and from the following fact: at each step G C F and then (G) C (F) = I. In the final step each / € F \ G reduces to zero with respect to G and then I=(F) C (G).
4 RANKINGS AND MONOMIAL IDEALS Let K be a field of characteristic zero. Let A = K[Xi,..., Xn] and let a be a term ordering on TAThe ranking pre-order -
106
Ta(f]
Carra Ferro
= Tff(g) and write jRag.
Ra is an equivalence relation on the set A by [12], Lemma 4.24, pp.153-154. There is a biijective map between the quozient set A/Ra and TA, because each polynomial / € A has the same rank as TCT(/). Moreover the ranking pre-order on A induces the total order a on TA by its own definition and by [12], Lemma 4.24, pp.153-154.
Let TT be the canonical map from A onto A/Ra=Tj\- If G={gi,... ,.,} is an autoreduced subset of A, then n(G) = Ta(G) — {Ta(g\},... ,T^(^)} is an autoreduced subset of TA with s elements. PROPOSITION 8 Let a be a term ordering on TA and let -<„ be the ranking pre-order induced by a on the set of all autoreduced subsets of A. The ranking pre-order -
Proof: Since the ranking pre-order has the reflexive and transitive properties, then it is sufficient to show the antisymmetric property, in order to prove that it is a partial order. I f T a ( G ) ^ Ta(F) and Ta(G) -& «fc, then respectively either Ta(F] XCT Ta(G) or Ta(G] -
DEFINITION 12 Let a be a term ordering on TA and let / and J be ideals in A. I has lower rank than J if the reduced Grobner basis G of I with respect to a has rank lower than the reduced Grobner basis F of J with respect to
Grobner bases as Characteristic Sets
107
REMARK 7 Let cr, 7, J, G and F be as in Definition 12. 7 has the same rank as J if Tff(I)=TlT(G)=Ttr(F)=Ttr(J). In other words the ideals 7 and J have the same rank iff the corresponding monomial ideals TO-(7) and Tff( J) are equal. Since the rankig pre-order on the set of all autoreduced subsets of A is linear, then the ranking pre-order on the set I(A) of all ideals of A is linear, i.e. for each pair of ideals 7 and J in A either 7 -
PROPOSITION 9 Let a be a term ordering on TA. Let F = {/i,..., /r} and let G ~ {g\,..., gs} be respectively reduced Grobner bases of (F) and (G). Let Ta(F}= (T f f (/i),... ,T ff (/ r )} and let Tff(G)= (Ta(9l),.. .,Ta(ga)}. Then:
(G) c (F) =* F -<„ G *=> (F) ^a (G) <=» (T ff (F)) -<„ (Tff(G)). Proof: Let T f f (F)={
If (G) C (F),
then by reduced Grobner bases theory there exists terms mi G TA, such that
Vj = m,jt^ for all j = 1,..., s and some i(j') = 1,..., r. If either z(l) > 1 or mi ^ 1, then t\ - 2 or m^ ^ 1, then £2 ^o- U2 and F -<,„ G. If i(2) = 2 and 7712 = 1, then let ^3 = mst^3\. Let r > s. By repeating the proof as above, if there exists j = 1,..., s such that Vh = m/jt^/jj for all h =
108
Carra Ferro
1 , . . . , j — 1 and either i(j) > j or rrij ^ 1, then tj -<„ Vj and F -
It is easy to find examples of pairs of monomial ideals / and J, such that I -(a J and J g /.
EXAMPLE 1 Let A = K[Xi,X2,X3}. Let a=tdeglex with Xi
If we fix the Hilbert polynomial HP(t), let's consider all monomial ideals I, such that HP(t}=HP(I,t). The Hilbert scheme -H/fp(/,i), n _i as the set of all homogeneous ideals J in A with the same Hilbert polynomial HP(J, t)=HP(I, t) is pre-ordered by the ranking pre-order on the sets of all ideals in A. Such relation defines the equivalence relation Ria as above on the Hilbert scheme #f/p(/,t) !n -i by using the ranking pre-order. It follows that the corresponding quozient set Hfjp(i^),n-i/R^ can be iden-
tified either with a set of autoreduced sets of power products or with a set of monomial ideals. By Proposition 8 such set is totally ordered and well ordered by the ranking -
Grobner bases as Characteristic Sets
109
theory for ^4-submodules of free A-modules of finite rank and the characteristic set theory of Ritt in [1] for systems of linear partial differential equations with constant coefficients.
REFERENCES
1. J F Ritt. Differential Algebra. New York: AMS Coll. Publ. 33, 1950 2. W-T Wu. Basic principles of Mechanical Theorem Proving in Geometries. Journal of Syst. Sci. and Math. Sci. 4(3): 207-235, 1984, Also in Journal of Automated Reasoning, 2(4): 221-252, 1986
3. W-T Wu . Some Recent Advances in Mechanical Theorem-Proving of Geometries. Automated Theorem Proving: After 25 Years, AMS Contemporary Mathematics 29: 235-242, 1984 4. A Levin. A. Computation of Hilbert Polynomials in two variables. J. of Symb. Comp. 28: pp.681-710, 1999
5. M V Kondrateva, A B Levin, A V Mikhalev, E V Pankratiev. Differential and Difference Dimension Polynomials. Dordrecht: Kluwer Academic Publ. MIA 461, 1999 6. D Bayer. The division algorithm and the Hilbert scheme. Ph. D. Thesis. Harvard University, 1982 7. L Robbiano. Term orderings on the polynomial rings. Lect. Not. in Comp. Sci. 204: 513-517, 1985
8. T Mora, L Robbiano. The Grobner Fan of an ideal. J. of Symb. Comp.: 49-74, 1989 9. B Buchberger. Some properties of Grobner bases for polynomial ideals. ACM SIGSAM BULL. 10: 19-24, 1976 10. B Buchberger. A theoretical basis for the reduction of polynomials to canonical form. ACM SIGSAM BULL. 10 (3): 19-29, 1976
11. E Kolchin. Differential Algebra and Algebraic Groups. New York: Academic Press, 1973 12. T Becker, V Weispfenning. Grobner Bases A Computational Approach to Commutative Algebra. New York: Springer-Verlag GTM 141, 1993
110
Carra Ferro
13. D Eisenbud. Commutative Algebra with a View Toward Algebraic Geometry. New York: Springer-Verlag GTM 150, 1995 14. B Mishra. Algorithmic Algebra. New York: Springer Verlag, 1993 15. R Hartshorne. Algebraic Geometry. New York: Springer-Verlag GTM 52, 1977
Threefolds with degenerate secant variety: on a theorem of G. Scorza L. CHIANTINI Dipartimento di Matematica, Universita di Siena, Via del Capitano, 15, 53100 Siena, Italia. [email protected] C. CILIBERTO Dipartimento di Matematica, Universita di Roma Tor Vergata, Via della Ricerca Scientifica, 00133 Roma, Italia. [email protected]
1
INTRODUCTION
In this paper we work over the complex field C.
Let X C Pr be a reduced, irreducible (not necessarily smooth) projective variety of dimension n. Let H be a hyperplane section on X and let ~H C \H\ be the (possibly incomplete) linear system cut out on X by the hyperplanes of Pr . We will assume that X is non-degenerate, i.e. that Ji has dimension r, namely that X spans the whole of P r . Then, by abusing notation, we may, and sometimes will, denote by H both the divisor and the unique hyperplane TTH which cuts it on X. We will also abuse notation by denoting with the same letter a complete linear system of Cartier divisors on a variety and the corresponding line bundle. Let now k be a non-negative integer and let Sk(X) be the k-secant variety of X, i.e. the Zariski closure of the set: {P G Pr : P lies in the span of k + 1 independent points of X} Of course S°(X) = X, Sr(X) = Pr and Sk(X) is empty if k > r + 1. We will also set S (X) — ptyset if