Arithmetical Properties of Commutative Rings and Monoids
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.
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
46. J. Cigler, V. Losert, and P. Michor, Banach Modules and Functors on Categories of Banach Spaces 47. P.-T. Liu and J. G. Sutinen, Control Theory in Mathematical Economics 48. C. Byrnes, Partial Differential Equations and Geometry 49. G. Klambauer, Problems and Propositions in Analysis 50. J. Knopfmacher, Analytic Arithmetic of Algebraic Function Fields 51. F. Van Oystaeyen, Ring Theory 52. B. Kadem, Binary Time Series 53. J. Barros-Neto and R. A. Artino, Hypoelliptic Boundary-Value Problems 54. R. L. Sternberg et al., Nonlinear Partial Differential Equations in Engineering and Applied Science 55. B. R. McDonald, Ring Theory and Algebra III 56. J. S. Golan, Structure Sheaves Over a Noncommutative Ring 57. T. V. Narayana et al., Combinatorics, Representation Theory and Statistical Methods in Groups 58. T. A. Burton, Modeling and Differential Equations in Biology 59. K. H. Kim and F. W. Roush, Introduction to Mathematical Consensus Theory 60. J. Banas and K. Goebel, Measures of Noncompactness in Banach Spaces 61. O. A. Nielson, Direct Integral Theory 62. J. E. Smith et al., Ordered Groups 63. J. Cronin, Mathematics of Cell Electrophysiology 64. J. W. Brewer, Power Series Over Commutative Rings 65. P. K. Kamthan and M. Gupta, Sequence Spaces and Series 66. T. G. McLaughlin, Regressive Sets and the Theory of Isols 67. T. L. Herdman et al., Integral and Functional Differential Equations 68. R. Draper, Commutative Algebra 69. W. G. McKay and J. Patera, Tables of Dimensions, Indices, and Branching Rules for Representations of Simple Lie Algebras 70. R. L. Devaney and Z. H. Nitecki, Classical Mechanics and Dynamical Systems 71. J. Van Geel, Places and Valuations in Noncommutative Ring Theory 72. C. Faith, Injective Modules and Injective Quotient Rings 73. A. Fiacco, Mathematical Programming with Data Perturbations I 74. P. Schultz et al., Algebraic Structures and Applications 75. L Bican et al., Rings, Modules, and Preradicals 76. D. C. Kay and M. Breen, Convexity and Related Combinatorial Geometry 77. P. Fletcher and W. F. Lindgren, Quasi-Uniform Spaces 78. C.-C. Yang, Factorization Theory of Meromorphic Functions 79. O. Taussky, Ternary Quadratic Forms and Norms 80. S. P. Singh and J. H. Burry, Nonlinear Analysis and Applications 81. K. B. Hannsgen et al., Volterra and Functional Differential Equations 82. N. L. Johnson et al., Finite Geometries 83. G. I. Zapata, Functional Analysis, Holomorphy, and Approximation Theory 84. S. Greco and G. Valla, Commutative Algebra 85. A. V. Fiacco, Mathematical Programming with Data Perturbations II 86. J.-B. Hiriart-Urruty et al., Optimization 87. A. Figa Talamanca and M. A. Picardello, Harmonic Analysis on Free Groups 88. M. Harada, Factor Categories with Applications to Direct Decomposition of Modules 89. V. I. Istra’tescu, Strict Convexity and Complex Strict Convexity 90. V. Lakshmikantham, Trends in Theory and Practice of Nonlinear Differential Equations
91. H. L. Manocha and J. B. Srivastava, Algebra and Its Applications 92. D. V. Chudnovsky and G. V. Chudnovsky, Classical and Quantum Models and Arithmetic Problems 93. J. W. Longley, Least Squares Computations Using Orthogonalization Methods 94. L. P. de Alcantara, Mathematical Logic and Formal Systems 95. C. E. Aull, Rings of Continuous Functions 96. R. Chuaqui, Analysis, Geometry, and Probability 97. L. Fuchs and L. Salce, Modules Over Valuation Domains 98. P. Fischer and W. R. Smith, Chaos, Fractals, and Dynamics 99. W. B. Powell and C. Tsinakis, Ordered Algebraic Structures 100. G. M. Rassias and T. M. Rassias, Differential Geometry, Calculus of Variations, and Their Applications 101. R.-E. Hoffmann and K. H. Hofmann, Continuous Lattices and Their Applications 102. J. H. Lightbourne III and S. M. Rankin III, Physical Mathematics and Nonlinear Partial Differential Equations 103. C. A. Baker and L. M. Batten, Finite Geometrics 104. J. W. Brewer et al., Linear Systems Over Commutative Rings 105. C. McCrory and T. Shifrin, Geometry and Topology 106. D. W. Kueke et al., Mathematical Logic and Theoretical Computer Science 107. B.-L. Lin and S. Simons, Nonlinear and Convex Analysis 108. S. J. Lee, Operator Methods for Optimal Control Problems 109. V. Lakshmikantham, Nonlinear Analysis and Applications 110. S. F. McCormick, Multigrid Methods 111. M. C. Tangora, Computers in Algebra 112. D. V. Chudnovsky and G. V. Chudnovsky, Search Theory 113. D. V. Chudnovsky and R. D. Jenks, Computer Algebra 114. M. C. Tangora, Computers in Geometry and Topology 115. P. Nelson et al., Transport Theory, Invariant Imbedding, and Integral Equations 116. P. Clément et al., Semigroup Theory and Applications 117. J. Vinuesa, Orthogonal Polynomials and Their Applications 118. C. M. Dafermos et al., Differential Equations 119. E. O. Roxin, Modern Optimal Control 120. J. C. Díaz, Mathematics for Large Scale Computing 121. P. S. Milojevic, Nonlinear Functional Analysis 122. C. Sadosky, Analysis and Partial Differential Equations 123. R. M. Shortt, General Topology and Applications 124. R. Wong, Asymptotic and Computational Analysis 125. D. V. Chudnovsky and R. D. Jenks, Computers in Mathematics 126. W. D. Wallis et al., Combinatorial Designs and Applications 127. S. Elaydi, Differential Equations 128. G. Chen et al., Distributed Parameter Control Systems 129. W. N. Everitt, Inequalities 130. H. G. Kaper and M. Garbey, Asymptotic Analysis and the Numerical Solution of Partial Differential Equations 131. O. Arino et al., Mathematical Population Dynamics 132. S. Coen, Geometry and Complex Variables 133. J. A. Goldstein et al., Differential Equations with Applications in Biology, Physics, and Engineering 134. S. J. Andima et al., General Topology and Applications 135. P Clément et al., Semigroup Theory and Evolution Equations
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.
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
179. 180. 181. 182. 183. 184. 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.
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 J. E. Andersen et al., Geometry and Physics 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’cek 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édé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
223. 224. 225. 226. 227. 228. 229. 230. 231. 232. 233. 234. 235. 236. 237. 238. 239. 240. 241.
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 and Related Problems G. R. Goldstein et al., Evolution Equations A. Giambruno et al., Polynomial Identities and Combinatorial Methods A. Facchini et al., Rings, Modules, Algebras, and Abelian Groups J. Bergen et al., Hopf Algebras A. C. Krinik and R. J. Swift, Stochastic Processes and Functional Analysis: A Volume of Recent Advances in Honor of M. M. Rao S. Caenepeel and F. van Oystaeyen, Hopf Algebras in Noncommutative Geometry and Physics J. Cagnol and J.-P. Zolésio, Control and Boundary Analysis S. T. Chapman, Arithmetical Properties of Commutative Rings and Monoids
Arithmetical Properties of Commutative Rings and Monoids
Scott T. Chapman Trinity University San Antonio, Texas, U.S.A.
Boca Raton London New York Singapore
Published in 2005 by CRC Press Taylor & Francis Group 6000 Broken Sound Parkway NW Boca Raton, FL 33487-2742 © 2005 by Taylor & Francis Group, LLC CRC Press is an imprint of Taylor & Francis Group No claim to original U.S. Government works Printed in the United States of America on acid-free paper 10 9 8 7 6 5 4 3 2 1 International Standard Book Number-10: 0-8247-2327-9 (Hardcover) International Standard Book Number-13: 978-0-8247-2327-9 (Hardcover) Library of Congress Card Number 2004061830 This book contains information obtained from authentic and highly regarded sources. Reprinted material is quoted with permission, and sources are indicated. A wide variety of references are listed. Reasonable efforts have been made to publish reliable data and information, but the author and the publisher cannot assume responsibility for the validity of all materials or for the consequences of their use. No part of this book may be reprinted, reproduced, transmitted, or utilized in any form by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying, microfilming, and recording, or in any information storage or retrieval system, without written permission from the publishers. For permission to photocopy or use material electronically from this work, please access www.copyright.com (http://www.copyright.com/) or contact the Copyright Clearance Center, Inc. (CCC) 222 Rosewood Drive, Danvers, MA 01923, 978-750-8400. CCC is a not-for-profit organization that provides licenses and registration for a variety of users. For organizations that have been granted a photocopy license by the CCC, a separate system of payment has been arranged. Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for identification and explanation without intent to infringe. Library of Congress Cataloging-in-Publication Data Arithmetic properties of commutative rings and monoids / edited by Scott T. Chapman. p. cm. — (Lecture notes in pure and applied mathematics v. 240) Includes bibliographical references and index. ISBN 0-8247-2327-9 (alk. paper) 1. Commutative rings—Congresses. 2. Monoids—Congresses. I. Chapman, Scott T. II. Series. QA251.3.A72 2005 512'.44--dc22
2004061830
Visit the Taylor & Francis Web site at http://www.taylorandfrancis.com Taylor & Francis Group is the Academic Division of T&F Informa plc.
and the CRC Press Web site at http://www.crcpress.com
Preface This volume contains the Proceedings of two related meetings which took place in October 2003. The first event was a one day Mini-Conference on Factorization Properties of Commutative Rings and Monoids hosted by the Department of Mathematics at the University of North Carolina at Chapel Hill. The Mini-Conference was followed by a regular Special Session on Commutative Rings and Monoids at the Fall 2003 Southeast Sectional Meeting of the American Mathematical Society. A major focus of these two meetings was the study of properties related to nonunique factorizations of elements into irreducible elements in commutative rings and monoids. Such problems have emerged as an independent area of research only over the past 30 years. Almost every result obtained in this area since 1970 can be traced to the following Theorem from a short two page paper by Leonard Carlitz (Proc. Amer. Math. Soc. 11(1960), 391–392). Theorem: The algebraic number field Z has class number ≤ 2 if and only if for every nonzero integer α ∈ Z the number of primes πj in every factorization α = π1 π2 · · · πk only depends on α. While Carlitz’s result has been referenced well over 50 times, it did not initially gain much attention. None the less, according to Math Science Net, since the early 1970’s well over 200 papers dedicated to the study of factorization properties of integral domains and monoids, and related topics, have appeared in refereed mathematical journals or conference proceedings. During this same period, over 14 Doctoral Dissertations which touch on factorization properties have been completed. The institutions where such degrees were awarded include The University of Iowa, The University of Tennessee at Knoxville, The University of Nebraska at Lincoln, The University of North Carolina at Chapel Hill, North Dakota State University, Karl-Franzens-Universit¨at-Graz and Universite D’Aix-Marseille III. That this has become a highly active area of mathematical research is demonstrated by Marcel Dekker’s publication in 1997 of the monograph Factorization in Integral Domains, edited by D.D. Anderson. This monograph contains the Proceedings of a 1996 Mini-Conference held at the University of Iowa on factorization problems followed by a Special Session on Commutative Algebra at the Midwestern Regional Meeting of the American Mathematical Society. The meetings in Iowa were followed by a flurry of research activity and the 2003 Meetings in Chapel Hill xi
xii
Preface
were organized with the intent of allowing some of the leading researchers in this field to review the major results of this period. I invited D. D. Anderson (University of Iowa), D. F. Anderson (University of Tennessee at Knoxville), Jim Coykendall (North Dakota State University), Alfred Geroldinger (Karl-Franzens-Universit¨at, Graz), Franz Halter-Koch (Karl-FranzensUniversit¨ at, Graz) and Ulrich Krause (Universit¨at Bremen) to deliver 45 minute addresses at the Mini-Conference. These authors have produced a series of 7 papers based on these lectures which make up the introductory chapters of this volume. These chapters demonstrate the diverse approach that many authors have taken in studying nonunique factorizations. Several are written in a purely monoidal setting, while several others demonstrate that ring theoretic properties play a key role in how elements factor. Moreover, these chapters exhibit the broad range of mathematical techniques necessary to obtain results in this area. Such techniques can range from purely algebraic and combinatorial, to number theoretic. It is hoped that these chapters not only offer mathematicians new to this area the opportunity to survey its current trends and major results, but also offer an up to date introduction to factorization theory for beginning graduate students. The remaining chapters in this volume reflect research which is motivated by arithmetical properties of commutative rings and monoids. This is not restricted to factorization problems, as aspects of the following topics are all considered: multiplicative ideal theory, the factorization of ideals and ideal generation problems, integer-valued polynomials, Pr¨ ufer rings and Domains, block monoids and their combinatorial invariants, and numerical monoids. The two sessions in Chapel Hill and subsequent Proceedings Volume have generated a significant amount of interest. The sessions attracted 30 speakers from 6 different countries. This volume features 26 papers from 33 different contributors from 7 different countries. I wish to take this opportunity to thank all those who participated in the sessions, and to all those who submitted papers for consideration to this volume. I am indebted to a large number of referees, who as always will remain nameless. A special thanks goes to the Department of Mathematics at the University of North Carolina at Chapel Hill, and in particular to Professor William W. Smith who was instrumental in planning and organizing this event. I also wish to thank the Department of Mathematics at Trinity University for their continued support and help in preparing this manuscript. The organization and preparation of the finished work would not have been possible without the help and patience of Denise Wilson, our Departmental Secretary and technical typist. I am of course indebted to Maria Allegra and her staff at Marcel Dekker for giving me the support and opportunity to complete this manuscript. I hope the readers of this volume enjoy its contents as much as I enjoyed putting it together. Scott Chapman San Antonio, Texas January 14, 2005
Contents Preface
xi
Contributors
xv
1 Non-Atomic Unique Factorization in Integral Domains Daniel D. Anderson
1
2 Divisibility Properties in Graded Integral Domains David F. Anderson
22
3 Extensions of Half-Factorial Domains: A Survey Jim Coykendall
46
4 C-Monoids and Congruence Monoids in Krull Domains Franz Halter-Koch
71
5 Monotone Chains of Factorizations in C-Monoids Andreas Foroutan and Alfred Geroldinger
99
6 Transfer Principles in the Theory of Non-unique Factorizations Alfred Geroldinger and Franz Halter-Koch
114
7 Cale Monoids, Cale Domains, and Cale Varieties Scott T. Chapman and Ulrich Krause
142
8 Weakly Krull Inside Factorial Domains Daniel D. Anderson, Muhammed Zafrullah, and Gyu Whan Chang
172
9 The m-Complement of a Multiplicative Set David F. Anderson and Gyu Whan Chang
180
10 Some Remarks on Infinite Products Jim Coykendall
188
11 Rings with Prime Nilradical Ayman Badawi and Thomas G. Lucas
198
xiii
xiv
Contents
12 On the Ideal Generated by the Values of a Polynomial Jean-Luc Chabert and Sabine Evrard
213
13 Using Factorizations to Prove a Partition Identity David E. Dobbs and Timothy P. Kilbourn
226
14 On Inside Factorial Integral Domains David E. Dobbs, Gabriel Picavet, and Martine Picavet-L’Hermitte
233
15 Polynomial Separation of Points in Algebras Sophie Frisch
253
16 k-Factorized Elements in Telescopic Numerical Semigroups Jose C. Rosales, Pedro A. Garc´ıa-S´ anchez, and Juan I. Garc´ıa-Garc´ıa
260
17 Pr¨ ufer Conditions in Rings with Zero-Divisors Sarah Glaz
272
18 Unmixedness and the Generalized Principal Ideal Theorem Tracy Dawn Hamilton
282
19 A Note on Sets of Lengths of Powers of Elements of Finitely Generated Monoids Wolfgang Hassler
293
20 UMV-Domains Evan Houston and Muhammad Zafrullah
304
21 On Local Half-Factorial Orders Florian Kainrath
316
22 On Factorization in Krull Domains with Divisor Class Group Z2k Karl M. Kattchee
325
23 Integral Morphisms Jack Maney
337
24 A Special Type of Invertible Ideal Stephen McAdam and Richard G. Swan
356
25 Factorization into Radical Ideals Bruce Olberding
363
26 Strongly Primary Ideals Gyu Whan Chang, Hoyoung Nam, and Jeanam Park
378
Index
389
Contributors Daniel D. Anderson, Department of Mathematics, University of Iowa, Iowa City, Iowa, 52242,
[email protected] David F. Anderson, Department of Mathematics, University of Tennessee, Knoxville, Tennessee 37996-1300,
[email protected] Ayman Badawi, Department of Mathematics and Statistics, American University of Sharjah, P.O. Box 26666, Sharjah, United Arab Emirates,
[email protected] Jean-Luc Chabert, Laboratoire Ami´enois de Math´ematiques Fondamentale et Appliqu´ee, CNRS-UMR 6140, Universit´e de Picardie, 33 rue Saint Leu, 80039 Amiens, France,
[email protected] Gyu Whan Chang, Department of Mathematics, University of Incheon, Incheon, 402-748 Korea,
[email protected] Scott T. Chapman, Department of Mathematics, Trinity University, One Trinity Place, San Antonio, Texas 78212-7200,
[email protected] Jim Coykendall, Department of Mathematics, North Dakota State University,Fargo, North Dakota 58105-5075,
[email protected] David E. Dobbs, Department of Mathematics, University of Tennessee, Knoxville, Tennessee 37996-1300,
[email protected] Sabine Evrard, Laboratoire Ami´enois de Math´ematiques Fondamentale et Appliqu´ee, CNRS-UMR 6140, Universit´e de Picardie, 33 rue Saint Leu, 80039 Amiens, France,
[email protected] Andreas Foroutan, Institut f¨ ur Mathematik, Karl-Franzens-Universit¨at, Heinrichstrasse 36, 8010 Graz, Austria, a−
[email protected] Sophie Frisch, Institut f¨ ur Mathematik, Technische Universit¨at Graz, A-8010 Graz, Austria,
[email protected] ´ Pedro A. Garc´ıa-S´anchez, Departamento de Algebra, Universidad de Granada, Facultad de Ciencias, Campus Fuentenueva s/n, 18071 Granada, Spain,
[email protected] xv
xvi
Contributors
´ Juan I. Garc´ıa-Garc´ıa, Departamento de Algebra, Facultad de Ciencias, Universidad de Granada, Campus Fuentenueva s/n, 18071 Granada, Spain,
[email protected] Alfred Geroldinger, Institut f¨ ur Mathematik, Karl-Franzens-Universit¨at, Heinrichstrasse 36, 8010 Graz, Austria,
[email protected] Sarah Glaz, Department of Mathematics, University of Connecticut, Storrs, Connecticut 06269,
[email protected] Franz Halter-Koch, Institut f¨ ur Mathematik, Karl-Franzens-Universit¨at, Heinrichstrasse 36, 8010 Graz, Austria,
[email protected] Tracy Dawn Hamilton, Department of Mathematics and Statistics, California State University Sacramento, 6000 J Street, Sacramento, California 95819,
[email protected] Wolfgang Hassler, Institut f¨ ur Mathematik, Karl-Franzens Universit¨ at Graz, Heinrichstraße 36/IV, A-8010 Graz, Austria,
[email protected] Evan Houston, University of North Carolina at Charlotte, Department of Mathematics, Charlotte, North Carolina 28223-0001,
[email protected] Florian Kainrath, Institut f¨ ur Mathematik, Karl-Franzens-Universit¨at Graz, Heinrichstraße 36, A-8010 Graz, Austria, fl
[email protected] Karl M. Kattchee, Mathematics Department, University of Wisconsin-La Crosse, 1725 State Street, La Crosse, Wisconsin 54601,
[email protected] Ulrich Krause, Fachbereich Mathematik/Informatik, Universit¨at Bremen, 28334 Bremen, Germany,
[email protected] Timothy P. Kilbourn, Department of Mathematics, University of Illinois at UrbanaChampaign, Urbana, Illinois 61801-2975,
[email protected] Thomas G. Lucas, Department of Mathematics and Statistics, University of North Carolina Charlotte, Charlotte, North Carolina 28223,
[email protected] Jack Maney, Department of Mathematics, North Dakota State University, Fargo, North Dakota 58105-5075,
[email protected] Stephen McAdam, Department of Mathematics, The University of Texas at Austin, 1 University Station C1200, Austin, Texas 78712-0257,
[email protected] Hoyoung Nam, Department of Mathematics, Inha University, Incheon, 402-751, Korea Bruce Olberding, Department of Mathematical Sciences, New Mexico State University, Las Cruces, New Mexico 88003-8001,
[email protected]
Contributors
xvii
Jeanam Park, Department of Mathematics, Inha University, Incheon, 402-751, Korea Gabriel Picavet, Laboratoire de Math´ematiques Pures, Universit´e Blaise Pascal, 63177 Aubi`ere Cedex, France,
[email protected] Martine Picavet-L’Hermitte, Laboratoire de Math´ematiques Pures, Universit´e Blaise Pascal, 63177 Aubi`ere Cedex, France,
[email protected] ´ Jose C. Rosales, Departamento de Algebra, Universidad de Granada, Facultad de Ciencias, Campus Fuentenueva s/n, 18071 Granada, Spain,
[email protected] Richard G. Swan, Department of Mathematics, The University of Chicago, Chicago, Illinois 60637,
[email protected] Muhammed Zafrullah, Department of Mathematics, Idaho State University, Pocatello, Idaho 83209-8085,
[email protected]
Chapter 1
Non-Atomic Unique Factorization in Integral Domains by
Daniel D. Anderson Abstract UFDs can be characterized by the property that every nonzero nonunit is a product of principal prime elements or equivalently that every nonzero nonunit x can be written in the form x = upa1 1 · · · pann where u is a unit, p1 , . . . , pn are nonassociate principal primes, and each ai ≥ 1. Each pai i , in addition to being a power of a prime, has a number of other properties, each of which is subject to generalization. We survey various generalizations of (unique) factorization into prime powers in integral domains.
1
Introduction
Unique factorization domains are of course the integral domains in which every nonzero nonunit element has a unique factorization (up to order and associates) into irreducible elements or atoms. Now UFDs can also be characterized by the property that every nonzero nonunit is a product of principal primes or equivalently that every nonzero nonunit has the form upa1 1 · · · pann where u is a unit, p1 , . . . , pn are nonassociate principal primes, and each ai ≥ 1. Each of the pai i , in addition to being a power of a prime, has other properties, each of which is subject to generalization. For example, each pai i is primary, each is contained in a unique maximal t-ideal, and the pai i are pairwise coprime. The goal of this chapter is to survey various generalizations of (unique) factorization into prime powers in integral domains. This follows the thesis of M. Zafrullah that the pai i are the building blocks in a UFD. The author would like to thank M. Zafrullah for a number of discussions of these topics over the past several years. 1
2
Anderson
This chapter consists of four sections besides the introduction. Section 2 covers integral domains whose elements are products of primary elements, Section 3 relates locally finite intersections of localizations to factorizations, Section 4 surveys factorizations into pairwise comaximal elements, and Section 5 summarizes the various generalizations of prime powers and the integral domains whose elements are products of these various generalizations. A fairly complete list of references is also given. The next four paragraphs outline in more detail these four sections. Then a brief review of some of the terms and notation used throughout the chapter is given. In particular, star-operations, the t-operation, the group of divisibility, and splitting sets are discussed. In Section 2 we consider weakly factorial domains, integral domains with the property that every nonzero nonunit is a product of primary elements. While factorization into primary elements need not be unique, it is unique (up to order and associates) once we combine primaries with the same radical, that is, it is unique when the primary elements involved are pairwise v-coprime. Now UFDs are also characterized as being the Krull domains D with trivial divisor class group Cl(D) or the integral domains D whose group of divisibility G(D) is a cardinal sum of copies of Z (with the usual order). In a similar manner, an integral domain D is weakly factorial if and only if D is weakly Krull, that is, D = ∩P ∈X (1) (D) DP (here X (1) (D) is the set of height-one primes of D) where the intersection is locally finite and D has t-class group Clt (D) = 0 or if and only if the natural map G(D) → ⊕P ∈X (1) (D) G(DP ) is an order isomorphism (or equivalently, is just surjective). Also, D is weakly factorial if and only if every saturated multiplicatively closed subset of D is a splitting set. In the case of a weakly factorial domain D, the (unique) factorization of an element into v-coprime primary elements is given by the intersection D = ∩P ∈X (1) (D) DP in the following sense. Let x be a nonzero nonunit of D that is contained in the height-one primes P1 , . . . , Pn . Then each xDPi ∩ D = (xi ) is a principal Pi primary ideal and (x) = ∩P ∈X (1) (D) xDP = (x1 ) ∩ · · · ∩ (xn ) = (x1 ) · · · (xn ) where (x1 ) ∩ · · · ∩ (xn ) is also the reduced primary decomposition for (x). In Section 3 we consider factorizations induced by other locally finite intersections of localizations D = ∩P ∈S DP . For example, call a nonzero nonunit element t-pure if it is contained in a unique maximal t-ideal (as is the case for a nonzero primary element). Then every nonzero nonunit of D is a product of t-pure elements if and only if the intersection D = ∩P ∈t-Max(D) DP (where t-M ax(D) is the set of maximal t-ideals of D) is locally finite, is independent (distinct maximal t-ideals contain no common nonzero prime ideal) and Clt (D) = 0. Again, this factorization into t-pure elements is unique once elements contained in the same maximal t-ideal are combined, or equivalently, when the elements in the product are pairwise v-coprime. We also consider factorization into homogeneous elements and into rigid elements. In Section 4 we consider the comaximal factorizations recently introduced by McAdam and Swan [27]. They defined a nonzero nonunit element d of an integral domain D to be pseudo-irreducible (pseudo-prime) if d = ab (d|ab) with a and b comaximal implies that a or b is a unit (d|a or d|b). A factorization d = d1 · · · dn is a (complete) comaximal factorization if each di is a nonzero nonunit (pseudoirreducible) and the di ’s are pairwise comaximal. The integral domain D is a comaximal factorization domain (CFD) if each nonzero nonunit has a complete comaximal factorization and a unique comaximal factorization domain (UCFD) is
Non-Atomic Unique Factorization in Integral Domains
3
a CFD in which complete comaximal factorizations of an element are unique up to order and associates. The main result is that for a CFD D the following are equivalent: (1) every two-generated invertible ideal of D is principal, (2) every nonzero nonunit of D has a comaximal factorization into pseudo-prime elements, and (3) D is a UCFD. We give a star-operation generalization, and relate these comaximal factorizations to the factorizations given in Sections 2 and 3. It is interesting to note that a one-dimensional domain is a UCFD if and only if it is weakly factorial. In Section 5 we summarize the various prime power generalizations given in Sections 2–4 and give several additional ones. Then the integral domains whose nonzero nonunits are products of these prime power generalizations are considered. Diagrams are given to show the various implications among the prime power generalizations and the integral domains defined. We next review some of the terms and notation used in this chapter. Throughout D is an integral domain with quotient field K. Let F (D) denote the set of nonzero fractional ideals of D and let f (D) be the set of finitely generated members of F (D). A star-operation ∗ on D is a closure operation on F (D) that further satisfies D∗ = D and (xA)∗ = xA∗ for all 0 = x ∈ K and A ∈ F (D). Here A ∈ F (D) is called a ∗-ideal if A∗ = A and A has finite type if A∗ = B ∗ for some B ∈ f (D). The star-operation ∗ has finite character if for each A ∈ F (D), A∗ = ∪{B ∗ |B ⊆ A with B ∈ f (D)}. Suppose that ∗ has finite character. Then every proper ∗-ideal is contained in a maximal ∗-ideal and a maximal ∗-ideal is prime. A prime ideal minimal over a ∗-ideal is a ∗-ideal. Hence a prime ideal minimal over a principal ideal is a ∗-ideal. We use ∗-Max(D) to denote the set of maximal ∗-ideals. Here D = ∩P ∈∗-Max(D) DP . With any star-operation ∗ is associated the finite character star-operation ∗s where A∗s = ∪{B ∗ |B ⊆ A where B ∈ f (D)}. Evidently ∗ has finite character precisely when ∗ = ∗s . Examples of star-operations include (1) the d-operation Ad = A, (2) the voperation Av = (A−1 )−1 = ∩{Dx|Dx ⊇ A where 0 = x ∈ K}, (3) the t-operation At = Avs = ∪{Bv |B ⊆ A with B ∈ f (D)}, and (4) for a set {Dα } of overrings of D with D = ∩Dα , the star-operation induced by ∩Dα A∗ = ∩ADα . Here (1) and (3) have finite character while (2) generally does not. An intersection D = ∩Dα has finite character or is locally finite if each 0 = x ∈ D is a unit in almost all Dα . If the intersection D = ∩Dα is locally finite, then the induced star-operation has finite character, but not conversely [1, Theorem 1]. An ideal A ∈ F (D) is ∗-invertible if there is a B ∈ F (D) with (AB)∗ = D. In this case we can take B = A−1 . The set Inv∗ (D) of ∗-invertible ∗-ideals forms a group under the ∗-product A ∗ B = (AB)∗ . The ∗-class group Cl∗ (D) of D is Inv∗ (D)/ Princ(D) where Princ(D) is the subgroup of nonzero principal fractional ideals. Of particular importance is the t-class group Clt (D) (or just the class group) of D. For D a Krull domain Clt (D) is the usual divisor class group while for a Pr¨ ufer domain D or one-dimensional domain D Clt (D) is the Picard group Pic(D) = Inv(D)/ Princ(D) = Cld (D). If ∗ is a finite character star-operation, then a ∗-invertible ideal has finite type, in fact A ∈ F (D) is ∗-invertible if and only if A has finite type and AP is principal for each P ∈ ∗-Max(D). Two ideals A and B of D are ∗-comaximal if (A, B)∗ = D. If A and B are ∗-comaximal, then it is easily proved that A∗ ∩ B ∗ = (A ∩ B)∗ = (AB)∗ . In the case where ∗ = d, we just say comaximal. Two elements a, b ∈ D are ∗-coprime if
4
Anderson
(a, b)∗ = ((a), (b))∗ = D and a and b are coprime if [a, b] = 1 (here [a, b] denotes the GCD of a and b). Thus a, b ∈ D are v-coprime if (a, b)v = D, or equivalently, a and b are not contained in any maximal t-ideal. Of particular interest are star-operations induced by intersections of localizations D = ∩P ∈S DP : A → A∗S = ∩P ∈S ADP . For any star-operation ∗ we have the associated finite character star-operation ∗w defined by A∗w = {x ∈ K|xI ⊆ A for some I ∈ f (D) with I ∗ = D} = ∩P ∈∗s -Max(D) ADP . Here ∗s -Max(D) = ∗w -Max(D), A is ∗s -invertible if and only if A is ∗w -invertible and Cl∗s (D) = Cl∗w (D). See [7] for details. General references for star-operations include [21], [23], and [24]. For results on ∗-invertibility, class groups, and t-ideals see [18] and [35]. For star-operations induced by overrings, see [1] and [7]. For an integral domain D with quotient field K let K ∗ = K − {0} and U (D) be the group of units of D. Then the multiplicative group G(D) = K ∗ /U (D) is called the group of divisibility of D. Now G(D) is partially ordered by aU (D) ≤ bU (D) ⇐⇒ a|b in D ⇐⇒ Da ⊇ Db. Note that the map G(D) → Princ(D) given by aU (D) → Da is an order isomorphism where Princ(D) is ordered by reverse inclusion. Given a family {(Gλ , ≤λ˙ )} of partially ordered abelian groups, the cardinal product is ΠGλ with the order (aλ ) ≤ (bλ ) ⇐⇒ each aλ ≤ bλ . The cardinal sum is defined in a similar manner. Suppose that D = ∩P ∈S DP . Then we have an order preserving monomorphism ϕ: G(D) → ΠP ∈S G(DP ) (cardinal product) given by ϕ(xU (D)) = (xU (DP )). Note that if D = ∩P ∈S DP has finite character, then im ϕ ⊆ ⊕P ∈S G(DP ). A subgroup H of a partially ordered abelian group (G, ≤) is convex if whenever 0 ≤ a ≤ h with h ∈ H, then a ∈ H and H is directed (or filtered ) if given a, b ∈ H, there exists c ∈ H with a ≤ c and b ≤ c or equivalently H+ = {h ∈ H|h ≥ 0} generates H as a group. Let S be a saturated multiplicatively closed subset of D. Then < S >= {s1 s−1 2 U (D)|s1 , s2 ∈ S} is a convex directed subgroup of G(D). The converse is also true, see [28]. A convex directed subgroup H of G(D) is a cardinal summand of G(D) if there is a convex directed subgroup K of G(D) with G(D) = H ⊕ K where H ⊕ K is the cardinal sum of H and K. A saturated multiplicatively closed subset S of D is a splitting set if every nonzero element x of D can be written in the form x = st where s ∈ S and t is v-coprime to each element of S. It is not hard to show that a saturated multiplicatively closed set S is a splitting set if and only if < S > is a cardinal summand of G(D) ([29, Proposition 4.1] and [4, Theorem 22]). Perhaps the main example of a splitting set is a multiplicatively closed subset generated by a set {pα } of height-one principal primes satisfying pαn D = 0 for each countable subcollection {pαn } of {pα }. Splitting sets were introduced in [29] and studied in [4] and [17]. There are of course many other generalizations of UFDs. A UFD is characterized by the property that every nonzero prime ideal contains a nonzero principal prime (ideal). Thus for each of the generalizations of a prime power, we can ask what domains have the property that each nonzero prime ideal contains such an element. While we will not pursue that theme here, the reader is referred to [14] for various “Kaplansky-like” theorems. Recall that an integral domain D is atomic if every nonzero nonunit of D is a product of irreducible elements or atoms. The theme of studying integral domains with various good atomic factorization properties is put
Non-Atomic Unique Factorization in Integral Domains
5
forth in [3]. For a survey of extensions of unique factorization to integral domains, rings with zerodivisors, rings without identity, or to modules, the reader is referred to [2]. In fact, this chapter is an elaboration of Section 2 of that chapter. Portions of this chapter were presented at a mini-conference on factorization organized by Professor Scott Chapman held October 23, 2003 preceding the regional American Mathematical Society meeting at the University of North Carolina.
2
Weakly Factorial Domains
Throughout D will denote an integral domain with quotient field K. Recall that D is weakly factorial if every (nonzero) nonunit of D is a product of primary elements or equivalently every proper principal ideal of D is a product of principal primary ideals. Weakly factorial domains were introduced by D. D. Anderson and L. A. Mahaney [9] and further studied by Anderson and Zafrullah [13]. We begin by looking at factorizations into primary elements in an integral domain. Suppose that (q) is a nonzero P -primary ideal of D. Then P is the unique prime t-ideal containing (q) [5, Lemma 1]. Thus nonzero primary elements with distinct radicals are v-coprime. If (q1 ) and (q2 ) are P -primary, then so is (q1 ) (q2 ) = (q1 q2 ) [9, Corollary 2]. Thus if a nonzero nonunit x ∈ D is a product of primary elements, then by combining primary elements with the same radical, we can write x = q1 · · · qn where (qi ) is Pi -primary and the Pi ’s are distinct, or equivalently, the qi ’s are pairwise v-coprime. In this case, (x) = (q1 ) · · · (qn ) = (q1 ) ∩ · · · ∩ (qn ) where (q1 ) ∩ · · · ∩ (qn ) is the unique normal decomposition for (x) [9, Corollary 5]. It follows that the factorization of an element into a product of pairwise v-coprime primary elements is unique up to order and associates. We next give a number of conditions equivalent to D being weakly factorial and then sketch the proof of several of the implications. Theorem 2.1. For an integral domain D the following conditions are equivalent. (1 ) D is weakly factorial. (2 ) Every nonzero nonunit of D has a unique factorization (up to order and associates) into a product of pairwise v-coprime primary elements. (3 ) D = ∩P ∈X (1) (D) DP is locally finite and Clt (D) = 0. (4 ) For every nonzero nonunit x ∈ D, if P is a prime ideal minimal over (x), then ht P = 1 and xDP ∩ D is principal. (5 ) D = ∩P ∈X (1) (D) DP is locally finite and the natural map G(D) → ⊕P ∈X (1) (D) G(DP ) is surjective (and hence an order isomorphism). (6 ) Every convex directed subgroup of G(D) is a cardinal summand of G(D). (7 ) For (nonzero) prime ideal P of D, D − P = every U(D)|s is a cardinal summand of G(D). s1 s−1 1 , s2 ∈ D − P 2 (8 ) Every saturated multiplicatively closed subset of D is a splitting set. (9 ) For every (nonzero) prime ideal P of D, D − P is a splitting set. Proof. We have already remarked the equivalence of (1) and (2). The equivalence of (1) and (3)-(7) is [13, convex directed subgroup of G(D) Theorem]. Since every U (D) |s , s ∈ S for some saturated multiplicatively is of the form S = s1 s−1 1 2 2
6
Anderson
closed subset S of D and conversely and since S is a cardinal summand of G(D) if and only if S is a splitting set, we get the equivalence of (6) and (8) and of (7) and (9).
We next sketch the proof of several of the implications of the previous theorem. Suppose that D is weakly factorial. Since each nonzero prime ideal contains a nonzero primary element, each nonzero prime ideal contains the radical of a nonzero principal primary ideal which is a maximal t-ideal. Hence X (1) (D) = t-Max (D). As we always have D = ∩P ∈t-Max(D) DP , we have D = ∩P ∈X (1) (D) DP . Moreover, each proper principal ideal having a primary decomposition involving only heightone primes gives that each nonzero principal ideal is contained in only finitely many height-one primes and hence the intersection is locally finite. (In fact, D = ∩P ∈X (1) (D) DP with the intersection being locally finite if and only if every nonzero principal ideal has a primary decomposition involving only height-one primes [9, Theorem 13].) So D is weakly Krull. Let A be an integral t-invertible ideal of D. Let P1 , · · · , Pn be the maximal t-ideals (=height-one primes) containing A. Now APi is principal, so APi = qi DPi where qi D is Pi -primary. Then A ⊆ (AP1 ∩ D) ∩ · · · ∩ (APn ∩ D) = q1 D ∩ · · · ∩ qn D = q1 · · · qn D. So A = q1 · · · qn A where A is contained in no height-one prime. Hence At = D, so At = q1 · · · qn D is principal. Thus Clt (D) = 0. Conversely, suppose that D = ∩P ∈X (1) (D) DP where the intersection is locally finite and that Clt (D) = 0. Let x be a nonzero nonunit of D. Then xD = (xDP1 ∩ D) ∩ · · · ∩ (xDPn ∩ D) where P1 , · · · , Pn are the height-one primes containing xD. But each xDPi ∩D is Pi -primary and xDP1 ∩D, · · · , xDPn ∩D are v-coprime. Hence xD = (xDP1 ∩ D) ∩ · · · ∩ (xDPn ∩ D) = ((xDP1 ∩ D) · · · (xDPn ∩ D))t ; so each xDPi ∩ D is t-invertible. Hence Clt (D) = 0 gives (xDPi ∩ D)t = qi D where qi D is Pi -primary. So xD = q1 D · · · qn D. Thus D is weakly factorial. We next show that (1) and (4) are equivalent. Suppose that D is weakly factorial. If P is minimal over (x), then ht P = 1 and (x)P ∩D is principal being the P -primary component in the reduced primary decomposition of (x). Conversely, suppose that (4) holds. Let S be the multiplicatively closed subset of D consisting of all products of primary elements and units. Then S is saturated. Let y be a nonunit factor of an element x ∈ S. Then (x) being a product of principal primary ideals has only finitely many minimal primes each of which by hypothesis has height-one. Since y is a factor of x, it too is contained in only finitely many height-one primes P1 , · · · , Pn . Now y ∈ (y)P1 ∩ D = (q1 ) where (q1 ) is P1 -primary and y = q1 t1 where t1 ∈ P2 ∩ · · · ∩ Pn − P1 . Continuing in this manner we get y = q1 · · · qn tn where (qi ) is Pi -primary and tn is contained in no height-one prime, hence a unit. So y ∈ S. Suppose that some nonzero nonunit of D is not in S. Then (a) ∩ S = ∅ since S is saturated. Hence (a) can be enlarged to a prime ideal P ⊇ (a) maximal with respect to P ∩ S = ∅. Shrinking P to a prime ideal Q minimal over (a), we have a height-one prime ideal Q containing no primary elements. But this is absurd, for (a)Q ∩ D is itself a principal primary ideal contained in Q. We next give some examples of weakly factorial domains.
Non-Atomic Unique Factorization in Integral Domains
7
Example 2.2. (1) A one-dimensional quasilocal domain has every nonunit element primary and hence is weakly factorial. Conversely, a domain in which every nonunit is primary is either a field or one-dimensional quasilocal. (2) [9, page 149] A one-dimensional domain D is weakly factorial if and only if each nonunit of D is contained in only finitely many maximal ideals and P ic(D) = 0. (3) [9, Theorem 21] Given any collection {Hλ } of rank-one totally ordered abelian groups, there is a weakly factorial Bezout domain D with G(D) order-isomorphic to the cardinal direct sum ⊕Hλ . (4) [13, Example] Let K ⊆ L be fields and D = K +XL[X] = {f (X) ∈ L[X]|f (0) ∈ K}. Then D is an atomic weakly factorial domain. It is easily seen that every nonzero nonunit of D may be written in one of the following two forms: p1 · · · pn or p1 · · · pn (aX r ) where p1 , · · · , pn are principal primes and aX r (r ≥ 1, a ∈ L) is primary. (5) [5, Lemma 3] An atomic domain in which almost all atoms are prime is weakly factorial. (6) [5, Corollary 2] An atomic domain is weakly factorial ⇐⇒ every atom is primary ⇐⇒ each atom is contained in a unique maximal t-ideal. While D[X] is a UFD whenever D is, this need not be the case for a weakly factorial domain. We have the following result. Recall that D is a generalized Krull domain if D is weakly Krull and for each P ∈ X (1) (D), DP is a valuation domain. Theorem 2.3. For an integral domain D the following conditions are equivalent. (1 ) D[X] is weakly factorial. (2 ) D is a weakly factorial GCD domain. (3 ) D is a weakly factorial generalized Krull domain. (4 ) D is a generalized Krull domain and a GCD domain. (5 ) D is weakly factorial and if p and q are non v-coprime primary elements then p|q or q|p. Proof. (1)⇐⇒(2) [9, Theorem 17]. The equivalence of (2)–(4) is [9, Theorem 20]. (2)⇐⇒(5) [9, Theorem 18] and its proof. It is interesting to observe that D[X] is an atomic weakly factorial domain if and only if D[X] and hence D is a UFD. This follows from the previous theorem and the well-known fact that an atomic GCD domain is a UFD.
3
Independent Locally-Finite Intersections of Localizations
In Section 2 we saw that factorization into primary elements was intimately connected to the locally finite representation D = ∩DP ∈X (1) (D) DP . Now of course an integral domain need not have such a representation. In this section we extend the results of Section 2 to more general intersections of localizations. Much of this comes from Anderson and Zafrullah [16]. We begin with some definitions given there.
8
Anderson
Let D be an integral domain with quotient field K. A family F = {Pi }i∈I of nonzero prime ideals of D is called a defining family of primes for D if D = ∩i∈I DPi . If, further, every nonzero nonunit of D belongs to at most finitely many members of F , F is of finite character, and if no two members of F contain a common nonzero prime ideal, F is independent. An integral domain is independent of finite character F (or an F -IFC domain) if it has a defining family F of prime ideals that is independent and of finite character. Let us note that the h-local domains of Matlis [26] (where F = Max(D)), Noetherian domains whose grade-one primes are of height one, Krull domains, generalized Krull domains of Ribenboim [30], independent rings of Krull type [22], and weakly Krull domains [10] are all F -IFC domains with well-defined family of primes. Let F be a defining family of primes for D. Then F induces the star-operation ∗F on D by A∗F = ∩P ∈F ADP for A ∈ F (D). Moreover, if F has finite character, so does ∗F [1, Theorem 1]. We call an integral ideal A of D unidirectional if A is contained in a unique member of F . The following four theorems come from [16]. Theorem 3.1. ([16, Theorem 2.1] ) Let D be an integral domain and let F be a defining family of primes for D. Then the following are equivalent. (1 ) D is an F -IFC domain. (2 ) For every nonzero nonunit x of D, (x) is a ∗F -product of finitely many unidirectional ∗F -ideals of D. (3 ) Every nonzero prime ideal of D contains a nonzero element x such that (x) is a ∗F -product of finitely many unidirectional ∗F -ideals. If P1 , · · · , Pn are the members of F containing (x) in (2), then the factorization alluded to is (x) = (xDP1 ∩ D) ∩ · · · ∩ (xDPn ∩ D) = ((xDP1 ∩ D) · · · (xDPn ∩ D))
∗F
.
Theorem 3.2. ([16, Theorem 3.3] ) Let F be a defining family of mutually incomparable primes for D such that ∗F is of finite character. Then the following are equivalent. (1 ) F is independent of finite character. (2 ) Every nonzero prime ideal of D contains an element x such that (x) is a ∗F product of unidirectional ∗F -ideals. (3 ) Every nonzero prime ideal of D contains a unidirectional ∗F -invertible ∗F -ideal. (4 ) For P ∈ F and 0 = x ∈ P , xDP ∩ D is ∗F -invertible and unidirectional. (5 ) F is independent and for any nonzero ideal A of D, A∗F is of finite type whenever ADP is finitely generated for all P in F . Theorem 3.3. ([16, Corollary 3.5]) Let F be a defining family for D consisting of incomparable primes. Then the following are equivalent. (1 ) F is independent of finite character and every ∗F -invertible ∗F -ideal is principal. (2 ) Every nonzero nonunit x of D may be written in the form x = x1 · · · xn where each xi generates a unidirectional ideal. (3 ) For each nonzero nonunit x in D and for each P in F containing x, xDP ∩ D is principal and unidirectional. (4 ) The natural map G(D) → ΠP ∈F G(DP ) has image ⊕P ∈F G(DP ).
Non-Atomic Unique Factorization in Integral Domains
9
The factorization in (2) becomes unique (up to order and associates) once the xi ’s belonging to the same unidirectional ideal are combined. If P1 , · · · , Pn are the primes of F containing x and if xDPi ∩ D = (xi ), then this factorization is x = ux1 · · · xn for some unit u. Now suppose that ∗ is a star-operation on D. Now D = ∩P ∈∗s -Max(D) DP , so F = ∗s -Max(D) is a defining family for D. Here the star-operation ∗sF is given by A∗sF = ∩P ∈F ADP . But by [7], ∩P ∈F ADP = A∗w = {x ∈ K|xI ⊆ A for some I ∈ f (D) with I ∗ = D}. Also, ∗sF = ∗w has finite character, A is ∗sF -invertible if and only if A is ∗s -invertible and Cl∗sF (D) = Cl∗s (D). So we have the following result. Theorem 3.4. Let ∗ be a finite character star-operation on the integral domain D. Then the following conditions are equivalent. (1 ) ∗-Max(D) is independent of finite character and Cl∗ (D) = 0. (2 ) Every nonzero nonunit x of D may be written in form x = x1 · · · xn where each xi is contained in a unique member of ∗-Max(D). (3 ) Every nonzero nonunit x of D may be written uniquely (up to order and associates) in the form x = x1 · · · xn where each xi is contained in a unique Pi ∈ ∗Max(D) and for i = j, Pi = Pj , or equivalently, xi and xj are ∗-coprime. (4 ) For each nonzero nonunit x in D and for each P ∈ ∗-Max(D), xDP ∩ D is principal and unidirectional. (5 ) The natural map G(D) → ΠP ∈∗- Max(D) G(DP ) has image ⊕P ∈∗- Max(D) G(DP ) (and hence is an order isomorphism where ⊕G(DP ) has the cardinal order ). (6 ) ∗-Max(D) is independent, Cl∗ (D) = 0, and for each nonzero ideal A of D, A∗w is of finite type whenever ADP is finitely generated for all P ∈ ∗-Max(D). Of special interest is the case where ∗ is the t-operation. Here ∗w = tw is the w-operation introduced by Wang and McCasland [20]: Aw = {x ∈ K|xI ⊆ D for some finitely generated ideal I with I −1 = D}. Let P be a prime ideal of a domain D. Then an ideal A of D is P -pure if AP ∩ D = A (we usually assume A ⊆ P ) and A is t-pure if A is P -pure for some P ∈ t-Max(D) [10]. For A t-invertible (with At = D), At is t-pure if and only if A is contained in a unique maximal t-ideal [11, Lemma 2.1]. A nonzero nonunit x ∈ D is t-pure if (x) is t-pure, or equivalently, if x is contained in a unique maximal t-ideal. Following [11] we call an integral domain D t-pure if every nonzero nonunit of D is t-pure and we call D semi-t-pure if every nonzero nonunit of D is a finite product of t-pure elements. Evidently D is t-pure if and only if D is quasilocal with maximal ideal a t-ideal. Observe that if 0 = (q) is P -primary, then (q) is P -pure and t-pure and q is t-pure. We have the following t-version of Theorem 3.4. Theorem 3.5. For an integral domain D, the following conditions are equivalent. (1 ) t-Max(D) is independent of finite character and Clt (D) = 0. (2 ) D is semi-t-pure, i.e., every nonzero nonunit of D is a finite product of t-pure elements. (3 ) Every nonzero nonunit x of D may be written uniquely in the form x = x1 · · · xn where each xi is t-pure and for i = j, xi and xj are v-coprime. (4 ) For 0 = x ∈ D and x ∈ P ∈ t-Max(D), xDP ∩ D is principal and t-pure. (5 ) The natural map G(D) → ΠP ∈t- Max(D) G(DP ) has image ⊕P ∈t- Max(D) G(DP ) (and hence is an order ismorphism where ⊕G(DP ) has the cardinal order ).
10
Anderson
(6 ) t-Max(D) is independent, Clt (D) = 0, and for each nonzero ideal A of D, Aw is of finite type whenever ADP is finitely generated for all P ∈ t-Max(D). (7 ) For each P ∈ t-Max(D), D − P is a splitting set, or equivalently, < D − P >= {s1 s−1 2 U (D)|s1 s2 ∈ D − P } is a cardinal summand of G(D). (8 ) For each nonempty subset F ⊆ t-Max(D), S = D − UP ∈F P is a splitting set, or equivalently < S > is a cardinal summand of G(D). (9 ) D is an F -IFC domain, for each Q ∈ F, DQ is t-pure, and Clt (D) = 0. Proof. The equivalence (1)–(6) follows from Theorem 3.4. The equivalence of (1), (7) and (8) follows from [16, Theorem 2.14]. And the equivalence of (1)–(3) and (8) is given in [11, Theorem 3.4]. Observe that Theorem 2.1 (D weakly factorial) is just the case X (1) (D) = tMax(D). We next give three more generalizations of prime powers that turn out to be equivalent to being t-pure in GCD domains. Let h be a nonzero nonunit of an integral domain D. Then h is rigid [31] (homogeneous, strongly homogeneous [11]) if for x, y ∈ D, x, y|h (with [x, y] = 1, (x, y)v = D) implies x|y or y|x (x or y is a unit). And D is (semi-) rigid if every nonzero nonunit of D is (a product of) rigid (elements). Similar definitions for (semi-) homogeneous domains and (semi-) strongly homogeneous domains may be given. It is easy to see that an atom or prime power is rigid, that a rigid element is strongly homogeneous, and that a strongly homogeneous or t-pure (and hence primary) element is homogeneous. Evidently an integral domain is rigid if and only if it is a valuation domain. Thus any one-dimensional quasilocal domain that is not a valuation domain will have a nonzero primary element that is not rigid. To study factorization in a nonatomic setting, P.M. Cohn [19] defined a nonzero nonunit h ∈ D to be primal if h|xy implies h = h1 h2 where h1 |x and h2 |y and to be completely primal if each of its nonunit factors is primal. (See [15] for a survey of completely primal elements.) Thus an atom is (completely) primal if and only if it is prime. An integral domain in which every nonzero nonunit is (completely) primal is called a pre-Schreier domain [34] and an integrally closed pre-Schreier domain is a Schreier domain. A GCD domain is a Schreier domain [19]. We have the following result. Theorem 3.6. ([11, Theorem 2.3, Corollary 2.4]) Let h be a completely primal element of an integral domain D. Then the following are equivalent. (1 ) h is homogeneous. (2 ) h is strongly homogeneous. (3 ) h is t-pure. If further D is a GCD domain, we have (1)–(3) equivalent to (4 ) h is rigid. It is well-known that Clt (D) = 0 for a pre-Schreier domain D [34, Corollary 3.7]. Combining this with Theorem 3.5 and Theorem 3.6 we get our next result. Theorem 3.7. ([11, Corollary 3.7]) For an integral domain D, the following are equivalent. (1 ) D is a pre-Schreier semi-homogeneous integral domain.
Non-Atomic Unique Factorization in Integral Domains
11
(2 ) Every nonzero nonunit of D may be written uniquely as a product of mutually coprime completely primal homogeneous elements. (3 ) D is pre-Schreier and t-Max(D) is independent of finite character. (4 ) D is a F -IFC domain, for each Q ∈ F, DQ is a homogeneous pre-Schreier domain, and Clt (D) = 0. Combining Theorem 3.5 and the second part of Theorem 3.6 we get the following result which should be compared to Theorem 2.3. Recall that an integral domain D is an independent ring of Krull type if t-Max(D) is independent of finite character and DP is a valuation domain for each P ∈ t-Max(D). The implication (1)=⇒(3) was first given in [31] while the implication (3)=⇒(1) was given in [32]. Theorem 3.8. ([11, Corollary 3.8]) For an integral domain D, the following conditions are equivalent. (1 ) D is a semi-rigid GCD domain. (2 ) D is a semi-t-pure GCD domain. (3 ) D is a GCD domain that is an independent ring of Krull type. (4 ) D is an independent ring of Krull type with Clt (D) = 0. We end this section with the following result. Recall that two ideals I and J of a ring are condensed if IJ = {ij|i ∈ I, j ∈ J}. Theorem 3.9. ([8, Theorem 2.1] ) Let D be an atomic domain. Then the following statements are equivalent. (1 ) Every pair of comaximal ideals of D is condensed. (2 ) Every pair of distinct maximal ideals of D is condensed. (3 ) Each atom of D is unidirectional. (4 ) D is h-local with Pic(D) = 0. (5 ) Every nonzero nonunit of D is a product of unidirectional elements. (6 ) For each nonzero nonunit x ∈ D and each maximal ideal M containing x, xDM ∩ D is a principal unidirectional ideal. As before, the factorization into unidirectional elements given in (5) is unique up to units and associates once elements contained in the same maximal ideal are combined. Note that (4)–(6) are still equivalent if we drop the hypothesis that D is atomic. Indeed these three statements are just three of the equivalences of Theorem 3.4 where ∗ is the d-operation.
4
Comaximal Factorizations and Generalizations
Recently McAdam and Swan [27] studied comaximal factorizations of elements and ideals in integral domains and rings. In this section we discuss their comaximal factorizations of elements in integral domains, give a generalization to star-operations, and compare it to results from Sections 2 and 3. We begin with some definitions from their chapter. Let D be an integral domain. A nonzero nonunit b of D is pseudo-irreducible (resp. pseudo-prime) if b = cd with c and d comaximal (i.e., (c, d) = D) implies c or d is a unit (resp. b|cd with c and d comaximal implies that b|c or b|d). Clearly b pseudo-prime implies that b is pseudo-irreducible. Note that b is pseudo-prime
12
Anderson
if and only if D/ (b) is indecomposable [27, Lemma 3.1]. For a nonzero nonunit b of D we call b = b1 · · · bm a (complete) comaximal factorization of b if the bi are pairwise comaximal nonunit (pseudo-irreducible) elements. Evidently a comaximal factorization b = b1 · · · bm is complete if and only if it has no proper refinements that are also comaximal factorizations of b. Then D is a comaximal factorization domain (CFD) if every nonzero nonunit of D has a complete comaximal factorization and D is a unique comaximal factorization domain (UCFD) if D is a CFD in which complete comaximal factorizations are unique up to order and associates. They showed [27, Lemma 1.1] that an integral domain D is a CFD if either (i) each nonzero nonunit of D has only finitely many minimal primes or (ii) each nonzero nonunit of D is contained in only finitely many maximal ideals. Here (i) insures that a Noetherian domain is a CFD. To this list of CFDs we can add: D has a defining family of primes of finite character. The proof is similar to the proof given for (i). A key concept in their work is the notion of an S-ideal. A nonzero ideal I of D is called an S-ideal if I = (a, c) = a2 , c for some a, c2 ∈ I. The relation to comaximal factorizations is the observation that (a, c) = a , c if and only if there is an element b ∈ D with (a, b) = D and c|ab [27, Lemma 1.2]. They proved that S-ideals are invertible and that any two-generated invertible ideal is isomorphic to an S-ideal [27, Lemma 1.5]. They gave the following characterization of UCFDs (we have added (3)). Theorem 4.1. ([27, Theorem 1.7] ) For an integral domain D the following conditions are equivalent. (1 ) D is a UCFD. (2 ) D is a CFD and every pseudo-irreducible element of D is pseudo-prime. (3 ) Every nonzero nonunit of D has a comaximal factorization into pseudo-prime elements. (4 ) Every two-generated invertible ideal of D is principal. (5 ) Every S-ideal of D is principal. It should be noted that in the previous theorem we can not add P ic(D) = 0 as the following example from Section 4 of [27] shows (but see Theorem 4.2 below). Let An be the subring of Bn = R[x0 , · · · , xn ]/ x20 + · · · + x2n − 1 , the ring of realvalued polynomial functions on the n-sphere S n , consisting of all even functions. Then for n ≥ 2, An is a regular domain that is a UCFD, but P ic(An ) = 0. Now a UFD D is a UCFD, indeed every nonzero nonunit of D is contained in only finitely many minimal prime ideals and P ic(D) = 0. For exactly the same reason, a weakly factorial domain is a UCFD. Note that the domains given by Theorem 3.4 for the case where ∗ is the d-operation are UCFDs. Indeed, these are precisely the UCFDs in which every pseudo-irreducible element is contained in a unique maximal ideal. In the case of a one-dimensional UFD (that is, a PID) a pseudo-prime element is just a primary element and a complete comaximal factorization is the same thing as a factorization into v-coprime prime powers or primary elements. Actually this result extends to any one-dimensional domain. Theorem 4.2. For a one-dimensional integral domain D the following are equivalent. (1 ) D is weakly factorial.
Non-Atomic Unique Factorization in Integral Domains
13
(2 ) Every nonzero nonunit of D is contained in only finitely many maximal ideals and P ic(D) = 0. (3 ) D is a UCFD. Proof. (1)⇐⇒(2) Example 2.2 (2). (2)=⇒(3) Since every nonzero nonunit is contained in only finitely many minimal primes, D is a CFD. By Theorem 4.1 D is a UCFD. (3)=⇒(1) Let d ∈ D be pseudo-prime. Hence D/ (d) is indecomposable and (d) is indecomposable. Since D/ (d) is zero-dimensional and reduced, thus D/ (d) is von Neumann regular and hence a field since it is indecomposable. Thus D/ (d) is a maximal ideal and hence (d) is a primary ideal. Thus every nonzero nonunit of D is a product of pseudo-prime elements or equivalently a product of primary elements. So D is weakly factorial. Also, a quasilocal domain (D, M ) is a UCFD. Indeed, for 0 = a ∈ M , a = a is the unique comaximal factorization of a ! One should note that while a UFD is a UCFD, the complete comaximal factorization of an element need not be the prime-power factorization. Indeed in K[X, Y ], K a field, XY is pseudo-irreducible. We next generalize comaximal factorizations to coprime and ∗-comaximal factorizations where ∗ is a finite character star operation on D. A nonzero nonunit a ∈ D is ∗-pseudo-irreducible (resp. ∗-pseudo-prime) if for b, c ∈ D with (b, c)∗ = D, a = bc (resp. a|bc) implies b or c is a unit (resp. a|b or a|c). Certainly a ∗-pseudoprime element is ∗-pseudo-irreducible. A factorization b = b1 · · · bm into nonunits is a (complete) ∗-comaximal factorization if for i = j (bi , bj )∗ = D (and each bi is ∗-pseudo-irreducible). Evidently b = b1 · · · bm is a complete ∗-comaximal factorization if and only if it has no proper refinements that are ∗-comaximal factorizations. Finally, D is a ∗-CFD if each nonzero nonunit of D has a complete ∗-comaximal factorization and a ∗-CFD is a ∗-UCFD if each complete ∗-comaximal factorization is unique up to units and associates. Note that if we take ∗ to be the d-operation (Ad = A) we get the comaximal factorizations of McAdam and Swan. We can also define coprime factorizations by replacing (a, b)∗ = D by [a, b] = 1, but we must be careful (see next paragraph). Define a nonzero nonunit a ∈ D to be [ ] -pseudo-irreducible (resp. [ ]-pseudoprime) if a = a1 · · · an (resp. a|a1 · · · an ) where [ai , aj ] = 1 for i = j implies some ai is a unit (a|ai for some i). A (complete) coprime factorization is a factorization b = b1 · · · bm where each bi is a nonunit and [bi , bj ] = 1 for i = j (with each bi [ ]-pseudo-irreducible). Evidently a coprime factorization is complete if and only if it has no proper refinement which is again a coprime factorization. The domain D is a [ ]-CFD if each nonzero nonunit has a complete coprime factorization and a [ ]-CFD is a [ ]-UCFD if the complete coprime factorization of an element is unique up to units and associates. Note that if a is ∗-pseudo-irreducible and a = a1 · · · an where (ai , aj )∗ = D for i = j, then some ai is a unit. Indeed, this follows from the fact that if (a, b)∗ = (a, c)∗ = D, then (a, bc)∗ = D. For we can write a = a1 (a2 · · · an ) where (a1 , a2 · · · an )∗ = D. However, [a, b] = [a, c] = 1 does not imply [a, bc] = 1. (In fact, a domain D satisfies this property (called the P P -property) if and only if D satisfies GL: the product of two primitive polynomials is primitive. And it is well-known that an atomic domain satisfying GL is a UFD. See [12] for details.) Consider the element X 3 of Q+XR[X]. Then X 3 is not [ ]-pseudo-irreducible since
14
Anderson
√ 1 3 X 3 = X( 3 2X)( √ does not have a 3 X) is a coprime factorization. However, X 2 3 coprime factorization into two elements. For if X = ab, then we can take a = uX and b = u−1 X 2 where u ∈ R. But [uX, u−1X 2 ] = uX. Note that if ∗1 and ∗2 are finite character star-operations on D with ∗1 ≤ ∗2 (i.e., A∗1 ⊆ A∗2 for each A ∈ F (D)), then a ∈ D ∗2 -pseudo-irreducible implies a is ∗1 -pseudo-irreducible and that a [ ]-pseudo-irreducible implies that a is t-pseudoirreducible. Similar statements hold for the corresponding types of pseudo-prime elements. However, for comaximal factorizations we have the reverse situation. If ∗1 ≤ ∗2 , then a ∗1 -comaximal factorization is a ∗2 -comaximal factorization. Thus the relationship between ∗1 -UCFDs and ∗2 -UCFDs is somewhat murky. As in the case of CFDs, a domain D is a ∗-CFD if each nonzero nonunit is either (i) contained in only finitely many minimal primes or (ii) contained in only finitely many maximal ∗-ideals. Also, it is not hard to show that a domain satisfying ACCP is a ∗-CFD. We have the following partial analog of Theorem 4.1. Theorem 4.3. Let ∗ be a finite character star-operation on an integral domain D. Consider the following four conditions. (1 ) D is a ∗-CFD and each two-generated ∗-invertible ∗-ideal is principal. (2 ) D is a ∗-CFD and each ∗-pseudo-irreducible element is ∗-pseudo-prime. (3 ) Every nonzero nonunit of D has a ∗-comaximal factorization into ∗-pseudoprime elements. (4 ) D is a ∗-UCFD. Then (1 )=⇒(2 )⇐⇒(3 )=⇒(4 ). Proof. The proof of (1)=⇒(2)=⇒(4) is the star operation version of [27, Lemma 1.3]. We give the details for the readers not familiar with star-operations. (1)=⇒(2) Let a be ∗-pseudo-irreducible. Suppose that a|bc where (b, c)∗ = D. Then ((a, b), (a, c))∗ = D, so (a, b)∗ ∩ (a, c)∗ = ((a, b)(a, c))∗ . Hence (a) ⊆ (a, b)∗ ∩ (a, c)∗ = ((a, b)(a, c))∗ ⊆ (a); so (a) = ((a, b)(a, c))∗ . So (a, b) and (a, c) are ∗-invertible. Thus (a, b)∗ = (d) and (a, c)∗ = (e) for some d, e ∈ D. So (a) = (d)(e) and hence a = ude for some unit u. But then a ∗-pseudo-irreducible and (d, c)∗ = D gives ud or e is a unit. If ud is a unit, (a) = (e) and c ∈ (a, c)∗ = (e) = (a). Likewise e a unit gives c ∈ (a). So a is ∗-pseudo-prime. (2)=⇒(3) Clear. (3)=⇒(2) Let a be ∗-pseudo-irreducible. Then a has a ∗-comaximal factorization a = a1 · · · an where each ai is ∗-pseudo-prime. Since a is ∗-pseudo-irreducible, n = 1, that is, a = a1 is ∗-pseudo-prime. (2)=⇒(4) Suppose that x1 · · · xn = y1 · · · ym are two complete ∗-comaximal factorizations. By hypothesis, each xi , yj is ∗-pseudo-prime. Now x1 ∗-pseudo-prime and x1 |y1 · · · ym implies x1 |yi for some i which we can take to be 1. Likewise yi |xj for some j. Then x1 |xj and since (x1 , xj )∗ = D for j = 1, we must have j = 1. Thus x1 and y1 are associates. Cancelling x1 gives x2 · · · xn = (uy2 ) · · · ym for some unit u. By induction n = m and after re-ordering xi and yi are associates. Note that if D is a domain satisfying the equivalent conditions of Theorem 3.4, then D is a ∗-UCFD. Indeed, these are precisely the ∗-UCFDs in which each ∗-pseudo-irreducible element is contained in a unique maximal ∗-ideal. We do not know if (4)=⇒(1), even in the case of the t-operation. However, in the onedimensional case we have the following result.
Non-Atomic Unique Factorization in Integral Domains
15
Theorem 4.4. For a one-dimensional domain D and a finite character staroperation ∗ on D the following are equivalent. (1 ) D is weakly factorial. (2 ) D is a ∗-UCFD. Proof. This follows from Theorem 4.2 and the fact that for D one-dimensional, ∗-Max(D) = Max(D). However, we can not add D is a [ ]-UCFD to Theorem 4.4. For let D = K + XL[[X]] where K ⊆ L are fields. Now D is always a [ ]-CFD, but D is a [ ]-UCFD if and only if K = L, i.e., D is a UFD. Now up to associates the nonunits (atoms) of D have the form uX n where u ∈ L∗ and n ≥ 1 (n = 1). Let u, v ∈ L∗ . Then uX and vX are associates ⇐⇒ uv −1 ∈ K and for n > 1, uX n = (vX)(uv −1 X n−1 ). Hence [uX n1 , vX n2 ] = 1 ⇐⇒ n1 = n2 = 1 and uv −1 ∈ / K. Let a be a nonzero nonunit of D. Then either a is [ ]-pseudo-irreducible or a = a1 · · · an where each ai is a nonunit and [ai , aj ] = 1 for i = j. In the latter case [ai , aj ] = 1 gives that each ai has order one and hence is irreducible and thus [ ]-pseudo-irreducible. Thus D is a [ ]-CFD. Suppose that K L and let u ∈ L − K. Then uX 2 = uX · X = u2 X · u−1 X = u(u + 1)X · (u + 1)−1 X. Now the first two complete coprime factorizations are distinct unless u2 ∈ K while the first and the third complete coprime factorizations are distinct unless u(u + 1) ∈ K. But then uX 2 having a unique complete coprime factorization gives that u = u(u + 1) − u2 ∈ K, a contradiction.
5
Generalizations of Prime Powers
In this section we summarize the various generalizations of prime powers given in Sections 2–4 and give several new ones (see Figure 1). For each of these prime power generalizations, we consider the domains whose nonzero nonunits are a product of such elements (see Figure 2). The pattern runs as follows. Suppose that D is an integral domain and that P is a property generalizing prime power. Then D could be called a P-domain if each nonzero nonunit of D has a property P and a semi-P-domain if each nonzero nonunit of D is a finite product of elements with property P. In several cases we have seen that D is a semi-P-domain if and only if D is an F -IFC domain where for each P ∈ F, DP is a P-domain. For example, this is the case where property P is “prime power”, “primary”, or “t-pure”. In [6] a nonzero nonunit q was defined to be a prime quantum if q satisfies Q1 : For every nonunit r|q, there exists a natural number n with q|rn , Q2 : For every natural number n, if r|q n and s|q n , then r|s or s|r, and Q3 : For every natural number n, each element t with t|q has the property that if t|ab, then t = t1 t2 where t1 |a and t2 |b. Thus Q2 says that each power of q is rigid and Q3 says that q is completely primal (since a product of completly primal elements is completely primal). A prime power pn is a prime quantum and a prime quantum q is primary. An integral domain D is a generalized unique factorization domain (GUFD) if every nonzero nonunit of D is a product of prime quanta. Clearly a UFD is a GUFD and a GUFD is weakly factorial and a GCD domain [6]. M. Zafrullah [33] considered yet another generalization of a prime power. He defined a nonzero nonunit x ∈ D to be a packet if (x) is prime, that is, there is a
16
Anderson
unique minimal prime over (x). He studied GCD domains, called unique representations domains (URD ), with the property that every nonzero nonunit is a product of packets. In a URD, each nonzero nonunit has only finitely many primes minimal over it. Thus by Theorem 4.1, a URD is a UCFD. For a study of domains with this and related properties, see [25]. The various generalizations of a prime element are indicated in Figure 1.
Non-Atomic Unique Factorization in Integral Domains
17
prime = irreducible B B
prime power
B BN rigid
Z Z Z ~ Z
prime quantum A
A AA U
homogeneous A
completely primal A
A AAU
strongly homogeneous A
-
primary Q Q Q s Q
primal
packet
t-pure
A A U A
t-pseudo-irreducible
-
Figure 1.
A AAU
pseudo-irreducible
18
Anderson
Corresponding to Figure 1, we have Figure 2 showing the various generalizations of UFDs. Again, the only implications are the obvious ones.
atomic domain
? semi-rigid domain semi-strongly-homogeneous domain A
A AA U
semi-homogeneous domain
UFD
?
GCD domain : GUFD @ @ R @ A A Schreier domain AAU weakly factorial domain
?
pre-Schreier domain
semi-t-pure domain H HH HH HH j H ? t-UCFD
Figure 2.
UCFD
Bibliography [1] D.D. Anderson, Star operations induced by overrings, Comm. Algebra 16 (1988), 2535–2553. [2] D.D. Anderson, Extensions of unique factorization: A survey, Advances in Commutative Ring Theory (Fez, 1997), 31-53, Lecture Notes in Pure and Appl. Math., 205, Dekker, New York, 1999. [3] D.D. Anderson, D.F. Anderson, and M. Zafrullah, Factorization in integral domains, J. Pure Appl. Algebra 69 (1990), 1–19. [4] D.D. Anderson, D.F. Anderson, and M. Zafrullah, Splitting the t-class group, J. Pure Appl. Algebra 74 (1991), 17–37. [5] D.D. Anderson, D.F. Anderson, and M. Zafrullah, Atomic domains in which almost all atoms are prime, Comm. Algebra 20 (1992), 1447–1462. [6] D.D. Anderson, D.F. Anderson, and M. Zafrullah, A generalization of unique factorization, Boll. Un. Mat. Ital. A(7) 9 (1995), 401–413. [7] D.D. Anderson and S.J. Cook, Two star-operations and their induced lattices, Comm. Algebra 28 (2000), 2461–2475. [8] D.D. Anderson and T. Dumitrescu, Condensed domains, Canad. Math. Bull. 46 (2003), 3–13. [9] D. D. Anderson and L.A. Mahaney, On primary factorizations, J. Pure Appl. Algebra 54 (1988), 141–154. [10] D.D. Anderson, J. L. Mott, and M. Zafrullah, Finite character representations for integral domains, Boll. Un. Mat. Ital. B(7) 6 (1992), 613–630. [11] D.D. Anderson, J.L. Mott, and M. Zafrullah, Unique factorization in nonatomic integral domains, Boll. Unione Mat. Ital. Sez B Artic Ric. Mat. (8) 2 (1999), 341–352. [12] D.D. Anderson and R.O. Quinterro, Some generalizations of GCD-domains, Factorization in Integral Domains, 189–195, Lecture Notes in Pure and Appl. Math., 189, Dekker, New York, 1997. [13] D.D. Anderson and M. Zafrullah, Weakly factorial domains and groups of divisibility, Proc. Amer. Math. Soc. 109 (1990), 907–913. 19
20
Anderson
[14] D.D. Anderson and M. Zafrullah, On a theorem of Kaplansky, Boll. Un. Mat. Ital. A(7) 8 (1994), 397–402. [15] D.D. Anderson and M. Zafrullah, P.M. Cohn’s completely primal elements, Zero Dimensional Commutative Rings, 115–123, Lecture Notes in Pure and Appl. Math., 171, Dekker, New York, 1995. [16] D.D. Anderson and M. Zafrullah, Independent locally finite intersections of localizations, Houston J. Math. 25 (1999), 433–452. [17] D.D. Anderson and M. Zafrullah, Splitting sets in integral domains, Proc. Amer. Math. Soc. 129 (2001), 2209–2217. [18] D.F. Anderson, The class group and local class group of an integral domain, 33-55, Non-Noetherian Commutative Ring Theory, Mathematics and Its Applications, vol. 520, Kluwer Academic Publishers, Dordrect/Boston/London, 2000. [19] P.M. Cohn, Bezout rings and their subrings, Proc. Cambridge Philos. Soc. 64 (1968), 251–264. [20] Wang Fanggui and R.L. McCasland, On w-modules over strong Mori domains, Comm. Algebra 25 (1997), 1285–1306. [21] R. Gilmer, Multiplicative Ideal Theory, Queen’s Papers in Pure and Appl. Math. 90, Queen’s University, Kingston, Ontario, 1992. [22] M. Griffin, Rings of Krull type, J. Reine Angew. Math. 229 (1968), 1–17. [23] F. Halter-Koch, Ideal Systems - An Introduction to Multiplicative Ideal Theory, Pure and Applied Mathematics, vol. 211, Dekker, New York, 1998. [24] P. Jaffard, Les Syst`emes d’Ideaux, Travaux et Recherches Math´ematiques, vol IV, Dunod, Paris, 1960. [25] P. Malcolmson and F. Okoh, Minimal prime ideals and generalizations of factorial domains, preprint. [26] E. Matlis, Torsion-free Modules, The University of Chicago Press, ChicagoLondon, 1972. [27] S. McAdam and R.G. Swan, Unique comaximal factorization, J. Algebra (to appear). [28] J.L. Mott, Convex directed subgroups of the group of divisibility, Canad. J. Math. 26 (1974), 532–542. [29] J.L Mott and M. Schexnayder, Exact sequences of semi-value groups, J. Reine Angew. Math. 283/284 (1976), 388–401. [30] P. Ribenboim, Anneaux normaux, r´eels `a caract`ere fini, Summa Brasil Math. 3 (1956), 213–253. [31] M. Zafrullah, Semirigid GCD domains, Manuscripta Math. 17 (1975), 55–66.
Non-Atomic Unique Factorization in Integral Domains
21
[32] M. Zafrullah, Rigid elements in GCD domains, J. Natur. Sci. Math. 17 (1977), 7–14. [33] M. Zafrullah, Unique representation domains, J. Natur. Sci. Math. 18 (1978), 19–29. [34] M. Zafrullah, On a property of pre-Schreier domains, Comm. Algebra 15 (1987), 1895–1920. [35] M. Zafrullah, Putting t-invertibility to use, 429-457, Non-Noetherian Commutative Ring Theory, Mathematics and Its Applications, vol. 520, Kluwer Academic Publishers, Dordrect/Boston/London, 2000.
Chapter 2
Divisibility Properties in Graded Integral Domains by
David F. Anderson Abstract Let R be a graded integral domain. In this chapter, we study the extent to which conditions on the homogeneous elements or the homogeneous ideals of R determine divisibility properties of R.
1
Introduction
There are many divisibility properties one can consider on an integral domain R. They range from chain conditions and closedness properties to lengths of factorizations and class groups. If, in addition, R is a graded ring, then in some cases we need only consider homogeneous information. Here we investigate to what extent conditions on the monoid S of nonzero homogeneous elements of R or the homogeneous ideals of R determine divisibility properties of R. It is somewhat surprising that in some cases divisibility properties of R are completely determined by S; this depends on the divisibility property considered and how R is graded. Things behave best when R is a Z+ -graded integral domain or a semigroup ring. Many standard ring-theoretic constructions such as polynomial rings, semigroup rings, and the A + XB[X] construction yield graded integral domains. These constructions illustrate the diversity in graded integral domains, and they have been very useful in constructing examples. We are also interested in determining when these various classes of graded integral domains satisfy certain divisibility conditions. The literature on these constructions is vast; so we will not needlessly duplicate it. For more on semigroup rings, we refer the reader to [54], and for the A + XB[X] and the related D + XDS [X] constructions, we refer the reader to [74], [44], and [89]. This chapter has six sections including the introduction. In the second section, we review some basic facts about graded integral domains and the homogeneous quotient field of a graded integral domain. In the third section, we discuss several 22
Divisibility Properties in Graded Integral Domains
23
divisibility properties on a graded integral domain and investigate the extent to which conditions on the homogeneous elements or homogeneous ideals of R determine divisibility properties of R. In the fourth section, we look at some factorization properties in several special classes of graded integral domains, with emphasis on semigroup rings and graded subrings of polynomial rings. In the fifth section, we discuss the Picard group and (t-)class group of a graded integral domain. In the final section, we give several examples using graded integral domains, usually semigroup rings. Of course, there are many divisibility properties we do not discuss. We have chosen those divisibility properties we have worked on and are most interested in. Hopefully, we have supplied enough additional references for the interested reader to pursue other properties. Our notation is standard. We will usually denote an integral domain by either D or R, a field by K, a monoid by Γ, and a torsionfree abelian group by G. Given an integral domain R, we will denote its quotient field and group of units by qf (R) and U (R), respectively. By the dimension of a ring, we will always mean Krull dimension. Usually, X, Y, Z, W , or {Xα } will denote indeterminates. The nonzero elements of a subset A of a ring R will be denoted by A∗ . Given a ring D and an additive semigroup Γ, the semigroup ring will be denoted by D[Γ] = { as X s | as ∈ D, s ∈ Γ } with X s X t = X s+t . As usual, N, Z, Q, R, C, and Z/nZ will denote the positive integers, integers, rational numbers, real numbers, complex numbers, and the integers modulo n, respectively. For a partially ordered abelian group G, let G+ = { x ∈ G | x ≥ 0 }. References for any undefined concepts or notation are [53], [54], [49], [80], [64].
2
Graded Domains and the Homogeneous Quotient Field
In this section, we review some basic properties of graded integral domains which will be used throughout this article. Let R = R0 ⊕ R1 ⊕ · · · be a Z+ -graded integral domain. That is, each Rn is an additive subgroup of R and Ri Rj ⊆ Ri+j for all i, j ∈ Z+ . We will say that a nonzero x ∈ Rn is homogeneous of degree n, and deg(0) = 0. Thus each x ∈ R may be written uniquely as x = x1 + · · · + xn with deg(xi ) = mi and m1 < . . . < mn . In this case, R0 is a subring of R, and (R0 )∗ is a saturated multiplicatively closed subset of R. Thus U (R) = U (R0 ). Also, the set S = { 0 = x ∈ R | x is homogeneous } = ∪n∈Z+ (Rn )∗ of nonzero homogeneous elements of R is a saturated multiplicatively closed subset of R. Then RS is a Z-graded integral domain via deg(a/s) = deg(a) − deg(s) for all a, s ∈ S. We will call RS the homogeneous quotient field of R; each nonzero homogeneous element of R is a unit. Note that (RS )0 is a field, and moreover, RS = (RS )0 [t, t−1 ] for any homogeneous t ∈ RS of smallest positive degree (such a t is transcendental over (RS )0 ), and hence RS is a PID. The simplest example of a Z+ -graded integral domain is the polynomial ring R = D[X] over an integral domain D with each Rn = DX n . More generally, let {Dn }n∈Z+ be a family of subrings of an integral domain D with Dn ⊆ Dn+1 for all n ∈ Z+ . Then R = ⊕n∈Z+ Dn X n is a Z+ -graded integral domain with each Rn = Dn X n . Special cases of this construction which have received considerable
24
Anderson
attention, often for constructing examples, are the A + XB[X] construction and the D + XDS [X] construction. Let Γ be a commutative, cancellative monoid, written additively, with the property that nx = ny for x, y ∈ Γ and n a positive integer implies that x = y. We will call such a monoid a torsionless grading monoid. In this case, Γ is a submonoid of its quotient group, the torsionfree abelian group Γ = {a − b | a, b ∈ Γ}. (Thus a torsionless grading monoid is just a submonoid of a torsionfree abelian group.) The group of units of Γ is U (Γ) = Γ ∩ −Γ. Note that a cancellative monoid can be totally ordered if and only if it is torsionless. Also, the semigroup ring D[Γ] is an integral domain if and only if D is an integral domain and Γ is a torsionless grading monoid. General references for torsionless grading monoids are [54] and [80]. Let Γ be a torsionless grading monoid (which we will always assume to be totally ordered). In this article, we will study Γ-graded integral domains. That is, R = ⊕α∈Γ Rα , where each Rα is an additive subgroup of R and Rα Rβ ⊆ Rα+β for all α, β ∈ Γ. We say that a nonzero x ∈ Rα is homogeneous of deg(x) = α, and we will usually make the harmless assumption that each Rα is nonzero. In this case, R0 is a subring of R, and thus (R0 )∗ is multiplicatively closed, but (R0 )∗ is saturated if and only if Γ ∩ −Γ = 0. Let S = ∪α∈Γ (Rα )∗ be the saturated multiplicatively closed set of nonzero homogeneous elements of R. Note that U (R) ⊆ S. The homogeneous quotient field RS of R is Γ-graded with (RS )α = { a/s | a, s ∈ S with deg(a) − deg(s) = α } ∪ {0} for each α ∈ Γ. The best example of a Γ-graded integral domain is the semigroup ring R = D[Γ] over an integral domain D, graded by deg(aX α ) = α for all a ∈ D∗ and α ∈ Γ. For R = D[Γ], its set of nonzero homogeneous elements is S = { aX α | a ∈ D∗ , α ∈ Γ }, and its homogeneous quotient field RS is just the group ring K[G], where K = qf (D) and G = Γ. So, when we say a “graded integral domain R”, we mean an integral domain R graded by a torsionless grading monoid Γ. A general reference for graded integral domains is [80]. We have seen that RS = (RS )0 [Z] when R is a Z+ - or Z-graded integral domain, and in this case, RS is a UFD (in fact, a PID). However, in general RS need be neither a UFD nor a group ring over Γ. The UFD case is easy. Just let R = K[Q] for any field K; then RS = R is not a UFD because ACCP fails since (1 − X) ⊆ (1 − X 1/2 ) ⊆ (1 − X 1/4 ) ⊆ . . . is a properly ascending chain of principal ideals of R (see Theorem 2.3(a) below). We next show that RS need not be a group ring. Example 2.1. Let D be an integral domain, Γ a torsionless grading monoid, and T ⊆ Γ such that [T ] = Γ, where [T ] is the submonoid generated by T . Define R = D[{Xα }α∈T ]. Then R is Γ-graded with deg(Xαn11 · · · Xαnrr ) = n1 α1 + · · · + nr αr . In fact, R = D[Γ ], where Γ is the free abelian monoid on T. Let D be a UFD and T = Γ = Q+ . Then R, and hence RS , is a UFD. If RS were a group ring over Q, then necessarily RS ∼ = (RS )0 [Q]. But the group ring (RS )0 [Q] is not a UFD since ACCP fails. So R is not isomorphic to a group ring over Q. However, the homogeneous quotient field RS is a twisted group ring. Let K = (RS )0 and G = Γ. For each α ∈ G, pick a nonzero Yα ∈ (RS )α . Then (RS )α = KYα and Yα Yβ = γ(α, β)Yα+β for some nonzero γ(α, β) ∈ K. Thus RS = (RS )γ0 [G] is a twisted group ring (see [34] for more details). But, we may not always be able to choose the Yα ’s so that each γ(α, β) = 1. Some cases when RS is a group ring or
Divisibility Properties in Graded Integral Domains
25
a UFD are given in [12]. For example, RS is a UFD if Γ satisfies ACC on cyclic subgroups [12, Proposition 3.5] (note that the converse fails by Example 2.1). Although RS need not be a UFD, it is “close” to being a UFD. In fact, by our next result, RS is a UFD if and only if it is a Krull domain, if and only if it satisfies ACCP. Theorem 2.2. Let R be a graded integral domain and S its set of nonzero homogeneous elements. Then RS is a completely integrally closed GCD-domain. Proof. The ring RS is completely integrally closed by [12, Proposition 3.2] and is a GCD-domain by [12, Proposition 3.3]. For future reference, we record the following result for group rings. The semigroup ring case will be discussed in the next section. The condition that G has ACC on cyclic subgroups is equivalent to each rank-one subgroup of G being free (cyclic) [12, Lemma 2.5] or each nonzero element of G having type (0, 0, 0, . . . ) (see [51, Section 85]). We will always use the ACC on cyclic subgroups condition. Theorem 2.3. Let D be an integral domain and G a torsionfree abelian group. (a) D[G] is a UFD if and only if D is a UFD and G satisfies ACC on cyclic subgroups. (b) D[G] is a Krull domain if and only if D is a Krull domain and G satisfies ACC on cyclic subgroups. Proof. Part (a) is due to Gilmer and Parker [57, Theorem 7.13], and part (b) is due to Matsuda [75, Proposition 3.3]. They each used the type (0, 0, 0, . . .) condition on G. Following Cohn [42], we say that an extension A ⊆ B of integral domains is inert if whenever xy ∈ A for x, y ∈ B, then x = ru and y = su−1 for some r, s ∈ A and u ∈ U (B). Clearly R0 ⊆ R = ⊕α∈Γ Rα is inert if and only if Rα contains a unit for each α ∈ Γ ∩ −Γ. For example, this happens if Γ ∩ −Γ = 0, R0 is a field, or R = R0 [Γ]. In particular, if R is Z+ -graded, then R0 ⊆ R is always an inert extension. We will see that things usually behave better when R0 ⊆ R is an inert extension. An integral ideal I of R = ⊕α∈Γ Rα is homogeneous if I = ⊕α∈Γ (I ∩ Rα ); equivalently, if I is generated by homogeneous elements. A fractional ideal I of R is homogeneous if sI is an integral homogeneous ideal of R for some s ∈ S (thus I ⊆ RS ). For x = x1 + · · · + xn ∈ RS with each xi ∈ (RS )αi and α1 < . . . < αn , we define the content of x to be the homogeneous ideal C(x) = (x1 , . . . , xn ). Thus a fractional ideal I ⊆ RS is homogeneous if and only if C(x) ⊆ I for each x ∈ I. For x, y ∈ R, we have C(x)n C(xy) = C(x)n+1 C(y) for some integer n ≥ 0 [79]. A subring A of R is a graded subring if A = ⊕α∈Γ (A ∩ Rα ). In a similar manner, we define a graded overring of R to be a graded subring of RS containing R.
3
Divisibility Properties of Graded Domains
Divisibility properties of an integral domain R are often equivalent to the corresponding divisibility properties in the multiplicative monoid R∗ . Some of these equivalences are obvious (R is a UFD iff R∗ is a factorial monoid); others are more
26
Anderson
difficult (R is a Krull domain iff R∗ is a Krull monoid). In fact, nowadays one often studies divisibility properties in the more general context of a commutative, cancellative monoid (for example, see [64] or [40], and the next paragraph). In this section, we investigate to what extent divisibility properties of R are actually determined by the corresponding divisibility properties on the monoid S of nonzero homogeneous elements of R, or by conditions on the homogeneous ideals of R. One can also ask how divisibility properties of R0 relate to those of R. In other words, how do divisibility properties on the submonoids (R0 )∗ and S of R∗ relate to divisibility properties of R (or R∗ )? Let H be a commutative, cancellative (multiplicative) monoid with quotient group H = { a/b | a, b ∈ H }. Ring-theoretic properties can often be translated to monoid properties. This is obvious if it is a purely multiplicative property, and we usually won’t give the explicit definition in this case. For example, we say that H is integrally closed (resp., completely integrally closed) if xn ∈ H (resp., hxn ∈ H for some h ∈ H) for x ∈ H and some (resp., all) n ∈ N implies x ∈ H. Also, H is a Krull monoid if H is completely integrally closed and H satisfies ACC on integral v-ideals (for other equivalent conditions, see [41], [40], or [64]). Recall that a torsionless grading monoid Γ is written additively; so here integrally closed would mean that nx ∈ Γ for some n ∈ N and x ∈ Γ implies x ∈ Γ. Let R be an integral domain with quotient field K. Then its group of divisibility is the abelian group G(R) = K ∗ /U (R) partially ordered by xU (R) ≤ yU (R) if and only if y/x ∈ R. Divisibility properties of R are often reflected in its group of divisibility. For example, R is a GCD-domain (resp., valuation domain) if and only if G(R) is lattice ordered (resp., totally ordered). In a similar manner, for a graded integral domain R, we define its homogeneous group of divisibility to be HG(R) = U (RS )/U (R). It is a partially ordered subgroup of G(R). We first give two examples to show that divisibility properties of R need not be determined by S. We call a graded integral domain R a graded valuation domain if for x, y ∈ S, then either x|y or y|x (cf. [66]); equivalently, HG(R) is a totally ordered abelian group. Certainly RS is always a graded valuation domain, and any polynomial ring over a field is a graded valuation domain, but neither is a valuation domain. So a condition on the nonzero homogeneous elements of R need not force that given condition on all the nonzero elements of R. Secondly, for the group ring R = K[G] over a field K, its set of nonzero homogeneous elements S = { aX α | a ∈ K ∗ , α ∈ G } ∼ = K ∗ × G is certainly a very nice monoid and satisfies almost any conceivable divisibility property. For example, S is always a factorial monoid, but R need not be a UFD (cf. Theorem 2.3(a) and Theorem 3.3). A given integral domain R may be graded in many different ways (cf. [3]); so R0 and S depend on the given grading of R. Our next example illustrates this problem. Example 3.1. Let R = Q[X, Y, Z, W ]. Then R is a 4-dimensional Noetherian UFD. We consider three very different gradings on R. (a) R is Z+ -graded in the usual way with degX = degY = degZ = degW = 1. In this case, R0 = Q is a UFD and R0 ⊆ R is an inert extension. (b) R is (Z+ )4 -graded with degX = (1, 0, 0, 0), degY = (0, 1, 0, 0), degZ = (0, 0, 1, 0), and degW = (0, 0, 0, 1). In this case, R = Q[(Z+ )4 ] is a semigroup ring, R0 = Q is a UFD, and R0 ⊆ R is an inert extension. (c) R is Z-graded with degX = degY = 1 and degZ = degW = −1. In this
Divisibility Properties in Graded Integral Domains
27
case, R0 = Q[XZ, XW, Y Z, Y W ] is not a UFD. In fact, R0 is a Krull domain with Cl(R0 ) = Z [49, Proposition 14.8]. Note that R0 ⊆ R is not an inert extension. As in [1], we define a graded integral domain R to be a graded GCD-domain if each pair of nonzero homogeneous elements of R has a (necessarily homogeneous) GCD; equivalently, S is a GCD-monoid, or HG(R) is a lattice ordered abelian group. Example 3.1(c) shows that R a graded GCD-domain does not imply that R0 is a GCD-domain. However, if R0 ⊆ R is an inert extension and R is a graded GCD-domain, then it is easily proved that R0 is a GCD-domain. The key fact that gives the equivalence in the next theorem is that RS is a GCD-domain. Theorem 3.2. Let R be a graded integral domain and S its set of nonzero homogeneous elements. Then R is a GCD-domain if and only if S is a GCD-monoid. Thus R is a GCD-domain if and only if R is a graded GCD-domain. Proof. This is proved in [1, Theorem 3.4] using [57, Theorem 3.1]. In a similar manner, we define a graded integral domain R to be a graded UFD if each homogeneous nonzero nonunit of R is a product of (necessarily homogeneous) prime elements of R; equivalently, S is a factorial monoid, or HG(R) is orderisomorphic to a free abelian group with the usual product order. We have already seen that a graded UFD need not be a UFD since RS , which is trivially a graded UFD, need not be a UFD. Example 3.1(c) also shows that R0 need not be a UFD when R is a graded UFD. However, R0 is a UFD when R is a graded UFD and R0 ⊆ R is an inert extension. We next give the analog of Theorem 3.2 for UFDs. But in this case, and the next, the graded and nongraded conditions are not equivalent. Theorem 3.3. Let R be a graded integral domain and S its set of nonzero homogeneous elements. Then R is a UFD if and only if S is a factorial monoid and RS is a UFD. In particular, if R is Z+ - or Z-graded, then R is a UFD if and only if R is a graded UFD. Proof. This is proved in [1, Theorem 4.4]. The “in particular” statement follows since RS ∼ = (RS )0 [Z] is a UFD (PID) when R is Z+ - or Z-graded. This case was first proved in [10, Theorem 5]. We next consider the Krull domain case. We define a graded integral domain R to be a graded Krull domain if R is completely intregrally closed with respect to homogeneous elements of RS (i.e., a/b almost integral over R for a, b ∈ S implies a/b ∈ R) and R satisfies ACC on homogeneous integral v-ideals; equivalently, S is a Krull monoid. However, unlike the previous two cases, if R is a graded Krull domain, then R0 is also a Krull domain [1, Corollary 5.9]. Theorem 3.4. Let R be a graded integral domain and S its set of nonzero homogeneous elements. Then R is a Krull domain if and only if S is a Krull monoid and RS is a Krull domain (UFD). In particular, if R is Z+ - or Z-graded, then R is a Krull domain if and only if R is a graded Krull domain. Proof. This is proved in [1, Theorem 5.8]. We have already observed that RS is a Krull domain if and only if it is a UFD. The “in particular” statement follows since RS is a UFD (PID) in this case.
28
Anderson
We next recall several closedness properties on an integral domain R. For a positive integer n, we say that R is n-root closed if xn ∈ R for x ∈ qf (R) implies x ∈ R, and that R is root closed if R is n-root closed for each positive integer n. Also, R is seminormal if x2 , x3 ∈ R for x ∈ qf (R) implies x ∈ R. An integrally closed domain is root closed, and an n-root closed (for some n ≥ 2) domain is seminormal, but neither converse holds (see Example 6.7). The seminormal property will be useful in Section 5 when we discuss Picard groups. By a result of Swan [84], R is seminormal if and only if whenever x2 = y 3 for x, y ∈ R, then x = z 3 and y = z 2 for some z ∈ R. In the obvious manner, we can define a (n-)root closed or seminormal monoid (for seminormality, we can use either equivalent condition). Note that for monoids, the definitions of integrally closed and root closed are the same. The n-root closed version of the next theorem is left to the reader. Theorem 3.5. Let R be a graded integral domain and S its set of nonzero homogeneous elements. Then the following statements are equivalent. (a) R is root closed (resp., seminormal). (b) R is root closed (resp., seminormal) with respect to homogeneous elements of RS , i.e., if xn ∈ R for some positive integer n (resp., x2 , x3 ∈ R) for a homogeneous x ∈ RS , then x ∈ R. (c) S is a root closed (resp., seminormal) monoid. Proof. The root closed (resp., seminormal) part is given in [16, Theorem 2.4] (resp., [2, Theorem 6.1]). Theorem 3.6. Let R be a graded integral domain and S its set of nonzero homogeneous elements. (a) R is integrally closed (resp., completely integrally closed) if and only if R is integrally closed (resp., completely integrally closed) with respect to homogeneous elements of RS , i.e., if a homogeneous x ∈ RS is integral (resp., almost integral) over R, then x ∈ R. (b) R is completely integrally closed if and only if S is a completely integrally closed monoid. Proof. (a) The integrally closed (resp., completely integrally closed) case is given in [1, Theorem 5.4] (resp., [1, Theorem 5.2]). The integrally closed case also follows from [66, Theorem 2.10]. (b) This follows directly from part (a). The above seven properties P all satisfy: the graded integral domain R is a Pdomain if and only if R is a “graded P-domain” and RS is a P-domain. Note that RS is always a completely integrally closed GCD-domain, and hence is integrally closed, root closed, and seminormal. Also, as noted above, RS is a UFD if and only if it is a Krull domain. This equivalence also holds for π-domains, PVMDs, and G-GCD domains (see [1] and [2]). Note that RS is a valuation domain if and only if R is trivially graded, i.e., R = R0 , so RS = qf (R). Thus this property also has the above form. We next give the semigroup ring analogs of Theorem 2.3 which were promised in the previous section. These are all fairly immediate consequences of the previous theorems.
Divisibility Properties in Graded Integral Domains
29
Theorem 3.7. Let D be an integral domain and Γ a torsionless grading monoid with group of units U (Γ) = Γ ∩ −Γ. (a) D[Γ] is a GCD-domain if and only if D is a GCD-domain and Γ is a GCDmonoid. (b) D[Γ] is a UFD if and only if D is a UFD, Γ is a factorial monoid, and U (Γ) satisfies ACC on cyclic subgroups. (c) D[Γ] is a Krull domain if and only if D is a Krull domain, Γ is a Krull monoid, and U (Γ) satisfies ACC on cyclic subgroups. (d ) D[Γ] is integrally closed if and only if D is integrally closed and Γ is a root closed monoid. (e) D[Γ] is completely integrally closed if and only if D is completely integrally closed and Γ is a completely integrally closed monoid. (f ) D[Γ] is (n-)root closed if and only if D is (n-)root closed and Γ is a (n-)root closed monoid. (g) D[Γ] is seminormal if and only if D is seminormal and Γ is a seminormal monoid. Proof. We prove parts (f) and (g); the proofs of the others may all be found in [54]. If D[Γ] is root closed (resp., seminormal), then clearly D and Γ are each root closed (resp., seminormal). Conversely, to show that D[Γ] is root closed (resp., seminormal), by Theorem 3.5 we need only check that (aX α )n ∈ D[Γ] (resp., (aX α )2 , (aX α )3 ∈ D[Γ]) for aX α ∈ qf (D)[Γ] implies aX α ∈ D[Γ]. But this is clear if D and Γ are each root closed (resp., seminormal). Remark 3.8. (a) By Theorem 3.7, If D is an integrally closed domain, then R = D[Γ] is integrally closed if and only if it is root closed. (b) We give a more concrete description of factorial and Krull monoids. A factorial monoid has the form G ⊕ F+ and a Krull monoid has the form G ⊕ T , where G is a torsionfree abelian group, F = ⊕Zα is a free abelian group with the usual product order, and T is a submonoid of F such that T = T ∩ F+ . Thus a UFD semigroup ring is just a polynomial ring over a UFD group ring, and a Krull domain semigroup ring is just a subring of a polynomial ring over a Krull group ring generated by monomials (cf. [1, pages 204 and 209], [41, Proposition 1], and [57, Lemma 7.15]). (c) By Theorem 3.7 (with Γ = Z+ ), we have that D[X] is a P-domain if and only if D is a P-domain. Thus it seems natural to ask if a graded integral domain R satisfies property P if and only if R0 satisfies property P and RS satisfies property P. However, this fails for all seven properties in Theorem 3.7. Let R = Z + ZX + X 2 Q[X] be considered as a graded subring of Q[X]. Here R0 = Z and RS = Q[X, X −1 ] satisfy all seven properties, but R does not satisfy any of them.
4
Factorization Properties in Graded Domains
In this section, we consider several divisibility properties related to factorizations for an integral domain R (they all translate in the obvious way to monoids). We say that R is atomic if each nonzero nonunit of R is a product of a finite number of irreducible elements (atoms) of R. We say that R is a bounded factorization domain (BFD) if R is atomic and for each nonzero nonunit x of R there is a bound
30
Anderson
on the length of factorizations of x into irreducible elements. We say that R is a half-factorial domain (HFD) if R is atomic and each factorization of a nonzero nonunit of R into a product of irreducible elements has the same length. Finally, R is a finite factorization domain (FFD) if each nonzero nonunit of R has only a finite number of factorizations up to order and associates. These properties, and several others, have been studied systematically in [6], [7], and [9]. We have the following implications (no implication is reversible, see [6] and Examples 6.1-6.4). UFD ⇓ FFD
⇒ HF D ⇓ ⇒ BF D
⇒ ACCP
⇒ atomic
It is well-known that R[X] satisfies ACCP if and only if R satisfies ACCP. Also, R[X] is a BFD (resp., FFD) if and only if R is a BFD (resp., FFD) [6, Proposition 2.5 (resp., Proposition 5.3)]. Clearly R is atomic (resp., an HFD) if R[X] is atomic (resp., an HFD). However, R an atomic integral domain does not imply that R[X] is atomic [83]. For R a Krull domain, R[X] is an HFD if and only if |Cl(R)| ≤ 2 [90, Theorem 2.4]. Also, R = R + Y C[Y ] is an HFD (see Theorem 4.3(a)), but R[X] is not an HFD [7, Example 5.4]. In fact, if R[X] is an HFD, then R is necessarily integrally closed [45, Theorem 2.2]. For more on HFDs, see the survey article [39]. Several divisibility properties are studied for group rings and semigroup rings in [54] and [70]. We mention three for group rings. Theorem 4.1. Let D be an integral domain and G a torsionfree abelian group. Then D[G] satisfies ACCP (resp., is a BFD, FFD) if and only if D satisfies ACCP (resp., is a BFD, FFD) and G satisfies ACC on cyclic subgroups. Proof. The ACCP case is proved in [54, Theorem 14.17], and the BFD and FFD cases are from [70, Theorem 3.1] and [70, Theorem 4.1], respectively. We next consider Z+ -graded integral domains of the form R = ⊕n∈Z+ Dn X n , where {Dn }n∈Z+ is a family of subrings of an integral domain D with Dn ⊆ Dn+1 for all n ∈ Z+ . Various divisibility and factorization properties of R have been studied in [65], [58], [68], and [35]. For example, if D0 is a field, then R is atomic, satisfies ACCP, and is a BFD; but R need not be an HFD or an FFD (see Theorems 4.2 and 4.3). However, R is completely integrally closed if and only if Dn = D0 for all n ∈ Z+ and D0 is completely integrally closed. Thus R is a UFD (resp., Krull domain) only in the trivial case when R = D0 [X] and D0 is a UFD (resp., Krull domain). The other closedness properties we have studied all force Dn = D1 for all n ∈ N. Thus we will concentrate on the special case of the A + XB[X] construction. There has also been considerable work on the related A + XB[[X]] construction. In fact, most papers treat both the A + XB[X] and A + XB[[X]] constructions simultaneously. We will just give a few results for the A + XB[X] construction; for many more see [7], [27], [32], [33], [38], [44], [47], [48], [58], [59], [60], [61], [65] [68] [69], [74], [87], [88],and [89]. For the definition of splitting set in part (d), see the next section. Theorem 4.2. Let A ⊆ B be an extension of integral domains and R = A+XB[X]. (a) R is completely integrally closed (resp., a UFD, Krull domain) if and only if A = B and A is completely integrally closed (resp., a UFD, Krull domain).
Divisibility Properties in Graded Integral Domains
31
(b) R is integrally closed (resp., root closed, seminormal) if and only if B is integrally closed (resp., root closed, seminormal) and A is integrally closed in qf (B) (resp., root closed in qf(B), seminormal). (c) R satisfies ACCP if and only if U (B) ∩ A = U (A) and every ascending chain b1 B ⊆ b2 B ⊆ . . . with each bn ∈ B nonzero and bn /bn+1 ∈ A terminates. (d ) R is a GCD-domain if and only if A is a GCD-domain and B = AS for S a splitting multiplicative set of A. (e) R is a BFD if and only if U (B) ∩ A = U (A) and for each nonzero nonunit b ∈ B, there is an N (b) ∈ N such that whenever b = b1 · · · bn with each bi ∈ B a nonunit, then at most N (b) of the bi ’s are in A. (f ) R is an FFD if and only if B is an FFD and U (B)/U (A) is finite. Proof. We have already mentioned part (a). Part (b) is clear by comments in the previous section. Part (c) is from [32, Proposition 1.1]; part (d) is from [33, Theorem 2.10]; part (e) is from [32, Proposition 2.1]; and part (f) is from [32, Proposition 3.1] and uses facts from [11]. The most popular problem seems to be to determine conditions for A + XB[X] to be an HFD. Partial results have appeared in many of the papers listed above. Probably the simplest example of an HFD which is not a UFD, is k + XK[X] for any proper extension k K of fields [7, Theorem 5.3]. Below we give three conditions for A + XB[X] to be an HFD. A surprising consequence of part (b) is that A + XB[X] can be an HFD without B[X] being an HFD. (Note that A is an HFD if A + XB[X] is an HFD.) Theorem 4.3. Let A ⊆ B be an extension of integral domains and R = A+XB[X]. (a) If B is a field, then R is an HFD if and only if A is a field. (b) If A is a field, then R is an HFD if and only if B is integrally closed. (c) If B is a UFD, U (B) ∩ A = U (A), and each irreducible element of A is also irreducible in B, then R is an HFD. Proof. Part (a) is from [7, Theorem 5.3], and part (b) is from [47, Theorem 2.1]. For part (c), see [59, Proposition 1.8] and [32, Proposition 5.4]. For an atomic integral domain R, the elasticity of R is ρ(R) = sup{ m/n | x1 · · · xm = y1 · · · yn for irreducible xi , yj ∈ R }. (In a similar manner, one can define the elasticity ρ(H) of an atomic monoid H.) Then 1 ≤ ρ(R) ≤ ∞, and ρ(R) = 1 if and only if R is an HFD. Not much more can be said since for each real number r ≥ 1 or r = ∞, there is a Dedekind domain R with torsion class group and ρ(R) = r [4, Theorem 3.2]. This concept is due to Valenza [85]. For a recent survey article on the elasticity, see [20]. Let R be a graded integral domain with S its monoid of nonzero homogeneous elements. It is clear that ρ(R0 ) ≤ ρ(R) if R0 ⊆ R is an inert extension and that ρ(S) ≤ ρ(R). The next example shows that a “graded HFD” need not be an HFD and that we may have ρ(R0 ) > ρ(R). Example 4.4. Let R = Q[X, Y, Z, W ] be Z-graded with degX = degY = 1 and degZ = degW = −1 as in Example 3.1(c). Here R is a UFD, and hence an HFD. In this case, R0 = Q[XZ, XW, Y Z, Y W ] = Q[Γ], where Γ = (1, 0, 1, 0), (1, 0, 0, 1), (0, 1, 1, 0), (0, 1, 0, 1) ⊆ (Z+ )4 , is not a UFD. We observed in Example 3.1(c) that
32
Anderson
R0 is a Krull domain with Cl(R0 ) = Z. Thus ρ(R0 ) = ∞ since each nonzero divisor class of Cl(Z[Γ]), and hence Cl(R0 ), contains a height-one prime ideal [71, Theorem 7](also see Theorem 4.5(c)). Hence 1 = ρ(R) < ρ(R0 ) = ∞. Note that R0 ⊆ R is not an inert extension. Let S0 be the set of nonzero homogeneous elements of R0 . Then S0 ∼ = Q∗ × Γ. Clearly Γ is an HFD monoid, and thus so is S0 ; but 1 = ρ(S0 ) < ρ(R0 ) = ∞. Hence R0 is a “graded HFD”, but not an HFD. The elasticity of certain families of graded integral domains has been studied extensively. We will just mention two cases for graded subrings of a polynomial ring, and one for Krull semigroup rings. For a finite abelian group G, we define the Davenport constant of G, denoted by D(G), to be the least positive integer d such that for each sequence S ⊆ G with |S| = d, some nonempty subsequence of S has sum 0 (D(G) = ∞ if G is infinite). Then D(G) ≤ |G| and D(Z/nZ) = n. A special case of our next result is given in Example 6.4. For other related results, see [28], [31], [36], [63], and [72] for semigroup rings, and [35], [58], [59], [60], [61], and [72] for the A + XB[X] and related constructions. Theorem 4.5. (a) Let K be a field and R = K[X n , X n+1 , . . . , X 2n−1 ]. Then ρ(R) = (nD(P ic(R)) + 3n − 2)/2n. (b) For n ≥ 2, let K0 ⊆ K1 ⊆ . . . ⊆ Kn−1 be an ascending sequence of subfields of a field K with Kn−1 K, and let R = K0 + K1 X + · · · + Kn−1 X n−1 + X n K[X]. Then ρ(R) = (2n + D(P ic(R)) − 1)/2. (c) Let D be a UFD with proper quotient field K and D[Γ] a Krull domain which is not a UFD. Then ρ(D[Γ]) = D(Cl(K[Γ]))/2. Proof. Part (a) follows from [31, Theorem 2.4] and [35, Remark 4.6(e)]; part (b) is proved in [35, Theorem 4.4 and Remark 4.6(e)]; and part (c) is proved in [72, Corollary 2.3].
5
The Picard Group and Class Group of a Graded Domain
In this section, we investigate the Picard group and (t-)class group of a graded integral domain. We first recall a few definitions. Let R be an (not necessarily graded) integral domain with quotient field K. For a nonzero fractional ideal I of R, let I −1 = { x ∈ K | xI ⊆ R }, Iv = (I −1 )−1 , and It = ∪{ Jv | 0 = J ⊆ I is finitely generated }. A nonzero fractional ideal I of R is a v-ideal (resp., t-ideal ) if Iv = I (resp., It = I), and I has finite type if I = Jv with J ⊆ I finitely generated. A fractional ideal I of R is t-invertible if (II −1 )t = R. A t-invertible t-ideal necessarily has finite type. Let T (R) be the group of t-invertible t-ideals of R under the t-multiplication I ∗ J = (IJ)t , and let P rin(R) be its subgroup of nonzero principal fractional ideals. Then the (t-)class group of R is the abelian group Cl(R) = T (R)/P rin(R). Let Inv(R) ⊆ T (R) be the subgroup of invertible ideals of R. Then the Picard group or ideal class group of R, P ic(R) = Inv(R)/P rin(R), is a subgroup of Cl(R). If R is a Krull domain, then Cl(R) is just the usual divisor class group of R; while if R is a Pr¨ ufer domain or a one-dimensional integral domain, then Cl(R) = P ic(R). The class group is important because ring-theoretic properties of R are often reflected
Divisibility Properties in Graded Integral Domains
33
in group-theoretic properties of Cl(R). For example, if R is a Krull domain (resp., Pr¨ ufer domain), then Cl(R) = 0 if and only if R is a UFD (resp., B´ezout domain). For more on the divisor class group of a Krull domain, see [49]; for a recent survey article on the t-class group, see [22]. Given an extension of integral domains A ⊆ B, we write P ic(A) = P ic(B) (resp., Cl(A) = Cl(B)) to mean that the inclusion map induces an isomorphism P ic(A) −→ P ic(B) (resp., Cl(A) −→ Cl(B)) given by [I] → [IB], where [I] denotes the class of I in P ic(A) or Cl(A). Note that this map is always defined for P ic and is defined for Cl when B is a flat A-module. A first natural question for polynomial rings is: when does Cl(D) = Cl(D[X]) or P ic(D) = P ic(D[X])? In this case, we have nice answers. Theorem 5.1. Let D be an integral domain. (a) P ic(D) = P ic(D[X]) if and only if D is seminormal. (b) Cl(D) = Cl(D[X]) if and only if D is integrally closed. Proof. Part (a) is due to Gilmer and Heitmann [56, Theorem 1.6], and part (b) is due to Gabelli [52, Theorem 3.6]. We next give the semigroup ring analog of Theorem 5.1 for the Picard group; the class group case will be discussed later. Recall that an integral domain D is called quasinormal if P ic(D) = P ic(D[X, X −1 ]) ( = P ic(D[Z])). An integrally closed domain is always quasinormal, and a quasinormal integral domain is seminormal, but neither converse holds. An interesting consequence of the next theorem is that P ic(D) = P ic(D[Γ]) for all seminormal torsionless grading monoids Γ if and only if P ic(D) = P ic(D[Z]). Theorem 5.2. Let D be an intergal domain and Γ a torsionless grading monoid with group of units U (Γ) = Γ ∩ −Γ. (a) P ic(D) = P ic(D[Γ]) if and only if D[Γ] is seminormal and P ic(D) = P ic(D[U (Γ)]). (b) If U (Γ) = 0, then P ic(D) = P ic(D[Γ]) if and only if D is seminormal and Γ is seminormal. (c) If U (Γ) = 0, then P ic(D) = P ic(D[Γ]) if and only if D is quasinormal and Γ is seminormal. Proof. This is from [18, Corollary]. Part (b) follows directly from part (a) and Theorem 3.7(g). The key fact needed for part (c) is that D is quasinormal if and only if P ic(D) = P ic(D[Zn ]) for all positive integers n (see [86]), and hence if and only if P ic(D) = P ic(D[G]) for all torsionfree abelian groups G. Let R be a graded integral domain. If I is a nonzero homogeneous fractional ideal of R, then I −1 , Iv , and It are also homogeneous fractional ideals of R. Thus the abelian groups HP rin(R) ⊆ HInv(R) ⊆ HT (R) can be defined in the natural way, and we can define the homogeneous analogs of P ic(R) and Cl(R) by HP ic(R) = HInv(R)/HP rin(R) and HCl(R) = HT (R)/HP rin(R), the homogeneous Picard group and homogeneous (t-)class group, respectively. Thus HCl(R) = Cl(R) if and only if for each I ∈ T (R), I = xJ for some x ∈ RS and J ∈ HT (R). A similar result holds for HP ic(R).
34
Anderson
It is well-known that HCl(R) = Cl(R) if R is a graded Krull domain (see [49, Proposition 10.2] for the Z+ -graded case and [12, Theorem 4.2] for the general Γgraded case) since Cl(R) is generated by the classes of the height-one homogeneous prime ideals of R. We next give some conditions to have HP ic(R) = P ic(R) and HCl(R) = Cl(R). We first give some relevant definitions from [2] and [15]. Recall from Section 3 that a graded integral domain R is integrally closed (resp., seminormal) if and only if R is integrally closed (resp., seminormal) with respect to homogeneous elements of RS . With this motivation, we define R to be almost normal (resp., almost seminormal) if R is integrally closed (resp., seminormal) with respect to homogeneous elements of RS of nonzero degree. Thus R is integrally closed (resp., seminormal) if and only if R is almost normal (resp., almost seminormal) and R0 is integrally closed (resp., seminormal) in (RS )0 . Moreover, if R contains a (homogeneous) unit of nonzero degree, then R is integrally closed (resp., seminormal) if and only if R is almost normal (resp., almost seminormal) [2, Theorem 3.7(1)]. Also, note that D[Γ] is almost normal (resp., almost seminormal) if and only if it is integrally closed (resp., seminormal). Based on earlier work of Querre [82] for polynomial rings, a careful study of invertible ideals and v-ideals in graded integral domains was initiated in [2]. In [37], these ideas were extended to t-invertible t-ideals. We next give a sampling of results from [2]. Theorem 5.3. Let R be a graded integral domain and S its set of nonzero homogeneous elements. Then the following statements are equivalent. (a) Each integral v-ideal of R which contains a nonzero homogeneous element of R is homogeneous. (b) C(xy)v = (C(x)C(y))v for all nonzero x, y ∈ R. (c) xRS ∩ R = xC(x)−1 for all nonzero x ∈ R. (d ) If I is an integral v-ideal of R of finite type, then I = xJ for some x ∈ RS and homogeneous v-ideal J of R of finite type. Proof. This is part of [2, Theorem 3.2]. The finite type hypothesis may be deleted in part (d) above if IRS is a principal ideal of RS [2, Proposition 3.3]. In particular, this holds if R is Z+ - or Z-graded. However, an example given in [76] shows that it can not be deleted in general. We next examine the content condition in Theorem 5.3(b) more carefully. In [78], an example of a Z-graded integral domain is given which is almost normal, but does not satisfy the content condition. Thus the inert extension hypothesis can not be deleted in Theorem 5.4(c). Theorem 5.4. Let R be a graded integral domain. (a) If R is integrally closed, then C(xy)v = (C(x)C(y))v for all nonzero x, y ∈ R. (b) If C(xy)v = (C(x)C(y))v for all nonzero x, y ∈ R, then R is almost normal. (c) If R0 ⊆ R is an inert extension, then C(xy)v = (C(x)C(y))v for all nonzero x, y ∈ R if and only if R is almost normal. Proof. Parts (a) and (b) are proved in [2, Theorem 3.5], and part (c) is proved in [2, Theorem 3.7(2)].
Divisibility Properties in Graded Integral Domains
35
We next discuss the relationship between P ic(R) and HP ic(R). An example given in [77] shows that the inert extension hypothesis in Theorem 5.5(b) can not be eliminated. Theorem 5.5. Let R be a graded integral domain. (a) If HP ic(R) = P ic(R), then R is almost seminormal. Suppose, in addition, that R0 ⊆ R is an inert extension. (b) P ic(R0 ) = HP ic(R). (c) If R is almost normal, then P ic(R0 ) = P ic(R). Proof. Part (a) is [2, Theorem 4.3(3)], part (b) is [2, Theorem 5.4], and part (c) is [2, Theorem 5.5]. Our next goal is to determine when Cl(D) = Cl(D[Γ]). The key fact is the next result, which is the t-analog of Theorems 5.3 and 5.4. Theorem 5.6. Let R be a graded integral domain such that R0 ⊆ R is an inert extension. Then HCl(R) = Cl(R) if and only if R is almost normal. Proof. This is proved in [37, Theorem 1.1]. Corollary 5.7. Let R be a Z+ -graded integral domain. Then HCl(R) = Cl(R) if and only if R is almost normal. Proof. This is [37, Corollary 1.8]. It follows directly from Theorem 5.6 since in this case R0 ⊆ R is an inert extension. An example of a Z-graded almost normal integral domain R with HCl(R) = Cl(R) is given in [37, Example 1.11]. Thus the inert extension hypothesis is needed in Theorem 5.6. However, in Theorem 5.6 it is sufficient to assume that R contains a (homogeneous) unit of nonzero degree [37, Remark 1.7]. If D[Γ] is a Krull domain, then Cl(D[Γ]) = Cl(D)⊕Cl(K[Γ]), where K = qf (D), and Cl(K[Γ]) is independent of the field K [12, Proposition 7.2]. In fact, one can define the divisor class group Cl(Γ) of the Krull monoid Γ, and it turns out that Cl(Γ) ∼ = Cl(K[Γ]) (see [41] and [54, Section 16]). So it seems natural to ask what happens in the general semigroup ring case. In [67], it is shown that Cl(D) = Cl(D[G]) when G is a torsionfree abelian group which satisfies ACC on cyclic subgroups, and in [73] it is shown that Cl(D[Γ]) = Cl(D) ⊕ Cl(Γ) when D[Γ] is a PVMD and Γ satisfies ACC on cyclic subgroups. For integrally closed semigroup rings, a very satisfactory analog of the Krull domain result is given in [37]. Theorem 5.8. Let D be an integral domain with quotient field K and Γ a torsionless grading monoid. (a) HCl(D[Γ]) = Cl(D[Γ]) if and only if D[Γ] is integrally closed. (b) HCl(D[Γ]) = Cl(D) ⊕ HCl(K[Γ]). Proof. Part (a) follows from Theorem 5.6; it is in [37, Proposition 2.2]. Part (b) is in [37, Theorem 2.6]. Corollary 5.9. Let D be an integral domain with quotient field K and Γ a torsionless grading monoid. If D[Γ] is integrally closed, then Cl(D[Γ]) = Cl(D)⊕Cl(K[Γ]).
36
Anderson
Proof. This is proved in [37, Corollary 2.8]. It is an immediate consequence of Theorems 5.6 and 5.8. In analogy with integral domains, one can define the (t-)class group Cl(Γ) for any torsionless grading monoid Γ to be the group of t-invertible t-ideals of Γ under t-multiplication modulo its subgroup of principal fractional ideals. By [37, Theorem 2.9], HCl(K[Γ]) ∼ = Cl(Γ) for any field K, and thus Cl(K[Γ]) ∼ = Cl(Γ) when Γ is integrally closed [37, Corollary 2.10]. Hence Cl(D[Γ]) = Cl(D) ⊕ Cl(Γ) when D[Γ] is integrally closed [37, Corollary 2.11]. Theorem 5.10. Let D be an integral domain and Γ a torsionless grading monoid. Then Cl(D) = Cl(D[Γ]) if and only if D[Γ] is integrally closed and Cl(Γ) = 0. Proof. This is from [37, Theorem 2.12] and follows immediately from the previous results. Example 5.11. (a) When Γ is a Krull monoid and K is a field, then Cl(K[Γ]) = Cl(Γ) can be calculated. If Γ ⊆ F+ with Γ = Γ ∩ F+ (here, F = ⊕Zα is a free abelian group with the usual product order and prα is the natural projection map, cf. Remark 3.8(b)) and the prα |Γ ’s are distinct essential valuations of Γ, then Cl(Γ) ∼ = F/Γ ([41, Theorem 2], [54, Section 16], and [13]). For some specific calculations, see Example 6.6. (b) If R = D[Γ] is a Krull domain, then Cl(D) = Cl(D[Γ]) if and only if Cl(Γ) = 0, if and only if Γ is a factorial monoid. This need not be the case in general. For example, R = K[Q+ ] is a B´ezout domain for any field K [54, Theorem 13.5]; so Cl(R) = 0. Thus Cl(Q+ ) = 0, but Q+ is not a factorial monoid. (c) However, even for Krull domains, we may have Cl(D) ∼ = Cl(D[Γ]) with Cl(Γ) nonzero. For example, let k be any field, Γ = (1, 0, 1, 0), (1, 0, 0, 1), (0, 1, 1, 0), (0, 1, 0, 1) ⊆ (Z+ )4 , D = k[⊕n∈Z+ Γ], and K = qf (D). Then Cl(D) ∼ = ⊕n∈Z+ Z [49, Proposition 14.8], and thus Cl(D[Γ]) = Cl(D) ⊕ Cl(K[Γ]) = Cl(D) ⊕ Z ∼ = Cl(D). (d) Another consequence of Theorem 5.10 is that Cl(D) = Cl(D[G]) for a torsionfree abelian group G if and only if D is integrally closed. However, we always have Cl(D[F+ ]) = Cl(D[F ]) for any free abelian group F with the usual product order [8, Example 4.5]. Next one should try to compute Cl(D[Γ]) in general. As a step in this direction, we have the following result from [25]. Recall that a numerical semigroup Γ is a submonoid of Z+ with Z+ \Γ finite. So for Γ a numerical semigroup, D[Γ] is a subring of D[X] generated by monomials over D with quotient field K(X) and D[Γ] ⊆ D[X] integral. Theorem 5.12. Let D be an integral domain with quotient field K and Γ a numerical semigroup. Then Cl(D[Γ]) = Cl(D[X]) ⊕ P ic(K[Γ]). In particular, if D is integrally closed, then Cl(D[Γ]) = Cl(D) ⊕ P ic(K[Γ]). Proof. Let N = { X α | α ∈ Γ } and T = D∗ ; each is a multiplicatively closed subset of D[Γ]. In [25, Theorem 5], it is shown that the natural homomorphism Cl(D[Γ]) −→ Cl(D[Γ]N ) ⊕ Cl(D[Γ]T ) = Cl(D[X, X −1 ]) ⊕ Cl(K[Γ]), given by [I] → ([IN ], [IT ]), is an isomorphism. Since Cl(D[X]) = Cl(D[X, X −1 ]) for any integral domain D by Example 5.11(d) and Cl(K[Γ]) = P ic(K[Γ]) because K[Γ] is onedimensional, the result follows. For the “in particular” statement, use Theorem 5.1(b).
Divisibility Properties in Graded Integral Domains
37
The above result can be iterated to hold when Γ = Γ1 × · · · × Γn is a finite direct product of numerical semigroups Γi , 1 ≤ i ≤ n. Also, note that P ic(K[Γ]) can be calculated (for example, by using the Mayer-Viertoris exact sequence for (U, P ic)). It seems reasonable to ask if Cl(D[Γ]) = Cl(D[Γ]) ⊕ Cl(K[Γ]) for any integral domain D and torsionless grading monoid Γ. We next consider the natural homomorphism φ : P ic(R0 ) −→ P ic(R) given by φ([I]) = [IR]. When R is a Z+ -graded integral domain, φ is always injective (in fact, splits since P ic is a functor), and we have a nice answer for when φ is surjective. Theorem 5.13. Let R be a Z+ -graded integral domain. Then P ic(R0 ) = P ic(R) if and only if R is almost seminormal. Proof. This is proved in [15, Theorem 1]. It is easy to see that imφ ⊆ HP ic(R); so we have φ : P ic(R0 ) −→ HP ic(R) ⊆ P ic(R). We have already seen in Theorem 5.5 that φ is injective and imφ = HP ic(R) when R0 ⊆ R is an inert extension, and that P ic(R0 ) = P ic(R) if, in addition, R is almost normal. In [77], an example of a Z-graded integral domain R is given with imφ = HP ic(R). For some other results, mainly in the Z-graded case, see [18], [81], and [2]. However, kerφ is easy to describe. Theorem 5.14. Let R be a Γ-graded integral domain, and let φ : P ic(R0 ) −→ P ic(R) be the natural homomorphism. Define Γ1 = { α ∈ U (Γ) | Rα R−α = R0 } and Γ2 = { α ∈ Γ | Rα ∩ U (R) = ∅ }. Then Γ2 ⊆ Γ1 are subgroups of U (Γ). (a) kerφ ∼ = Γ1 /Γ2 . (b) Let 0 −→ A −→ B −→ C −→ 0 be a short exact sequence of abelian groups. Then there is a graded integral domain R with P ic(R0 ) ∼ = B, P ic(R) ∼ = C, ∼ and kerφ = A. Proof. These are proved in [19]. The analog of Theorem 5.13 for the class group fails, even for Krull domains. A Z+ -graded Krull domain R may have Cl(R0 ) = 0 and Cl(R) = 0 (see Example 6.6). For other results on the class group of a graded Krull domain, see [12] and [49]. We end this section with some results about P ic(A + XB[X]) and Cl(A + XB[X]). Note that A + XB[X] is almost normal (resp., almost seminormal) if and only if B is integrally closed (resp., seminormal). Also, the natural homomorphism φ : Cl(A) −→ Cl(A + XB[X]) is always injective when B is a flat A-module [29, Lemma 4.2]. However, the overring hypothesis is needed in Theorem 5.15(c) for φ to be surjective [29, Corollary 4.12]. For related results on Cl(A + XB[X]), see [29] and [30]. Theorem 5.15. Let A ⊆ B be an extension of integral domains, R = A + XB[X], and S a multiplicatively closed subset of A. (a) P ic(A) = P ic(R) if and only if B is seminormal. (b) HCl(A) = HCl(R) if and only if B is integrally closed. (c) If B is an integrally closed flat overring of A, then Cl(A) = Cl(R). In particular, Cl(A) = Cl(A + XAS [X]) if A is integrally closed.
38
Anderson
Proof. Part(a) is a special case of Theorem 5.13. Part (b) is from [30, Corollary 1.2], and is a special case of Corollary 5.7. Part (c) is from [29, Theorem 4.4]. The “in particular” statement is clear since AS is always a flat overring of A. Let S be a saturated multiplicatively closed subset of an integral domain D. Then N = { 0 = x ∈ D | xD ∩ sD = xsD for all s ∈ S } is a saturated multiplicatively closed subset of D called the m-complement of S. We call S a splitting set if SN = D∗ . If S is a splitting set, then Cl(D) = Cl(DS ) ⊕ Cl(DN ) [8, Corollary 3.8]. For other applications of splitting sets, see [8] and [24]. If S is a splitting set, then we can explicitly calculate Cl(D + XDS [X]) and P ic(D + XDS [X]). Theorem 5.16. Let S be a splitting multiplicative subset of an integral domain D with m-complement N . Then Cl(D + XDS [X]) = Cl(DS [X]) ⊕ Cl(DN ) and P ic(D + XDS [X]) = P ic(DS [X]) ⊕ P ic(DN ). Proof. This is proved in [24, Theorem 4.3].
6
Examples
In this final section, we have collected some of our favorite examples illustrating various divisibility properties. In each case, we use a semigroup ring construction. In Examples 6.4, 6.6, and 6.7, the semigroup rings are subrings of a polynomial ring generated by monomials, and hence are also Z+ -graded. Example 6.1. An integral domain with no atoms. Let R = Z/2Z[Q+ ]. Then R is a one-dimensional integral domain with f = X α1 +· · ·+X αn = (X α1 /2 +· · ·+X αn/2 )2 for each f ∈ R; so no element of R is irreducible. Integral domains with no atoms have been investigated in [46]. Example 6.2. An atomic integral domain which does not satisfy ACCP ([62]). Let R = K[Γ]M , where K is a field, Γ = 1/3, 1/(2·5), 1/(22·7), . . . , 1/(2k ·pk ), . . . ⊆ Q+ (here p0 = 3, p1 = 5, . . . are the odd primes), and M = { f ∈ K[Γ] | f (0) = 0 }, a maximal ideal of K[Γ]. Then R is a one-dimensional quasilocal integral domain. In [62], it is shown that R is atomic. However, R does not satisfy ACCP since XR ⊂ X 1/2 R ⊂ X 1/4 R ⊂ . . . is a properly ascending chain of principal ideals of R. Example 6.3. An integral domain which satisfies ACCP, but is not a BFD ([6, Example 2.1]). Let R = K[Γ], where K is a field and Γ = 1/2, 1/3, 1/5, . . . , 1/pk , . . . ⊆ Q+ (here pk is the kth prime). Then R is a one-dimensional integral domain which satisfies ACCP. However, X = (X 1/p )p and X 1/p is an atom for each prime p; so R is not a BFD. An integral domain which satisfies ACCP, but is not a BFD ([6, Example 2.1]). Let R = K[Γ], where K is a field and Γ = (1/2, 1/3, 1/5, . . . , 1/pk , . . .) ⊆ Q+ (here pk is the kth prime). Then R is a one-dimensional integral domain which satisfies ACCP. However, X = (X 1/p )p and X 1/p is an atom for each prime p; so R is not a BFD. Example 6.4. An atomic integral domain which is not an HFD. Let R = Z/2Z[X 2 , X 3 ]. Then R is a one-dimensional Noetherian integral domain which is not seminormal. Clearly ρ(R) ≥ 3/2 since (X 2 )3 = (X 3 )2 . In fact, for any field K, we have ρ(K[X 2 , X 3 ]) = (D(K) + 2)/2 [28, Theorem 2.4]. Thus ρ(R) = 2. Moreover,
Divisibility Properties in Graded Integral Domains
39
f 2 = g 3 h for irreducible f = X 3 (1 + X + X 2 ), g = X 2 , and h = 1 + X 2 + X 4 ∈ R. As an application of Theorem 5.12, for any integral domain D with quotient field K, we have Cl(D[X 2 , X 3 ]) = Cl(D[X]) ⊕ K since P ic(K[X 2 , X 3 ]) = K as additive abelian groups. Example 6.5. A two-dimensional non-Noetherian UFD ([55]). Let R = K[G], where K is a field and G is a torsionfree rank-two infinite abelian group which is not free, but each rank-one subgroup is free. Such abelian groups exist (see [51, Section 88]). Then dim(D) = rank(G) = 2, and R is a UFD by Theorem 2.3(a). Clearly R is not Noetherian since G is not finitely generated. For each integer n ≥ 2, R[X1 , . . . , Xn−2 ] is an n-dimensional non-Noetherian UFD. Note that a one-dimensional UFD is a PID, and thus Noetherian. Example 6.6. Krull domains with specified class group. Let K be a field and G an abelian group. One can construct a Krull domain R = K[Γ] with Cl(R) = G [41, Corollary 2]. In fact, we may localize R to obtain a quasilocal Krull domain A with Cl(A) = G. We show this explicity when G = Z/n1 Z ⊕ · · · ⊕ Z/nr Z ⊕ Zn is finitely generated. Let R = K[{ Xini , Xi Yi , Yini | 1 ≤ i ≤ r }, { Sj Uj , Sj Vj , Tj Uj , Tj Vj | 1 ≤ j ≤ n }], a subring of T = K[{ Xi , Yi | 1 ≤ i ≤ r }, { Sj , Tj , Uj , Vj | 1 ≤ j ≤ n }] generated by monomials. Then Cl(A) = Cl(R) = G, where A = RM with M = R ∩ ({Xi , Yi }, {Sj , Tj , Uj , Vj })T [13, Example 9 and Theorem 10]. Recall that for any abelian group G, there is a Dedekind domain D with Cl(D) = G [43]. Example 6.7. Independence of n-root closed and seminormal conditions ([16]). For an integral domain R, define C(R) = { n ∈ N | R is n-root closed }. Then C(R) is a multiplicative submonoid of N such that mn ∈ C(R) if and only if m, n ∈ C(R); so C(R) is generated by primes. We show that for any multiplicative submonoid T of N generated by primes, there is an integral domain R with C(R) = T . If T = N, let R be any root closed integral domain. Otherwise, let Q = {pi }i∈I be the set of primes not in T . Define R = Q[{ Xipi | i ∈ I }, { XimYjn | m ≥ 0, n ≥ 1, and i, j ∈ I }], a subring of Q[{ Xi , Yi | i ∈ I }] generated by monomials. In [16, Theorem 2.7], it is shown that C(R) = T . Note that if T = {1}, then R is seminormal, but not n-root closed for any integer n ≥ 2. Other constructions for R with C(R) = T are discussed in [21, Section 6].
Bibliography [1] D. D. Anderson and D. F. Anderson, Divisibility properties in graded domains, Canad. J. Math. 34 (1982), 196–215. [2] D. D. Anderson and D. F. Anderson, Divisorial ideals and invertible ideals in a graded integral domain, J. Pure Appl. Algebra 76 (1982), 549–569. [3] D. D. Anderson and D. F. Anderson, Grading integral domains, Comm. Algebra 11 (1983), 1–19. [4] D. D. Anderson and D. F. Anderson, Elasticity of factorizations in integral domains, J. Pure Appl. Algebra 80 (1992), 217–235. [5] D. D. Anderson and D. F. Anderson, The ring R[X, r/X], Zero-dimensional Commutative Rings, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 171 (1995), 95–113. [6] D. D. Anderson, D. F. Anderson, and M. Zafrullah, Factorization in integral domains, J. Pure Appl. Algebra 69 (1990), 1–19. [7] D. D. Anderson, D. F. Anderson, and M. Zafrullah, Rings between D[X] and K[X], Houston J. Math. 17 (1991), 109–129. [8] D. D. Anderson, D. F. Anderson, and M. Zafrullah, Splitting the t-class group, J. Pure Appl. Algebra 74 (1991), 17–37. [9] D. D. Anderson, D. F. Anderson, and M. Zafrullah, Factorization in integral domains, II, J. Algebra 152 (1992), 78–93. [10] D. D. Anderson and J. Matijevic, Graded π-rings, Canad. J. Math. 31 (1979), 449–457. [11] D. D. Anderson and B. Mullins, Finite factorization domains, Proc. Amer. Math. Soc. 124 (1996), 389–396. [12] D. F. Anderson, Graded Krull domains, Comm. Algebra 7 (1979), 79–106. [13] D. F. Anderson, The divisor class group of a semigroup ring, Comm. Algebra 8 (1980), 467–476. [14] D. F. Anderson, Seminormal graded rings, J. Pure Appl. Algebra 21 (1981), 1–7. 40
Divisibility Properties in Graded Integral Domains
41
[15] D. F. Anderson, Seminormal graded rings, II, J. Pure Appl. Algebra 23 (1982), 221–226. [16] D. F. Anderson, Root closure in integral domains, J. Algebra 79 (1982), 51–59. [17] D. F. Anderson, The Picard group of a monoid domain, J. Algebra 115 (1988), 342–351. [18] D. F. Anderson, The Picard group of a monoid domain, II, Arch. Math. 55 (1990), 143–145. [19] D. F. Anderson, The kernel of P ic(R0 ) −→ P ic(R) for R a graded domain, C. R. Math. Rep. Acad. Sci. Canada 13 (1991), 248–252. [20] D. F. Anderson, Elasticity of factorizations in integral domains, a survey, Factorization in Integral Domains, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 189 (1997), 1–29. [21] D. F. Anderson, Root closure in commutative rings, a survey, Advances in Commutative Ring Theory, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 205 (1999), 55–71. [22] D. F. Anderson, The class group and local class group of an integral domain, Non-Noetherian Ring Theory, Math. Appl., Kluwer Acad. Publ., Dordrecht 520 (2000), 33–55. [23] D. F. Anderson and G. W. Chang, The class group of D[X 2 , X 3 ], Internat. J. Commutative Rings 2 (2003), 1–7. [24] D. F. Anderson and G. W. Chang, The class group of integral domains, J. Algebra 264 (2003), 535–552. [25] D. F. Anderson and G. W. Chang, The class group of D[Γ] for D an integral domain and Γ a numerical semigroup, Comm. Algebra 32 (2004), 787–792. [26] D. F. Anderson, G. W. Chang, and J. Park, D[X 2 , X 3 ] over an integral domain D, Commutative Ring Theory and Applications, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 231 (2002), 1–14. [27] D. F. Anderson, G. W. Chang, and J. Park, Weakly Krull and related domains of the form D + M, A + XB[X], and A + X 2 B[X], Rocky Mountain J. Math., to appear. [28] D. F. Anderson, S. Chapman, F. Inman, and W. Smith, Factorization in K[X 2 , X 3 ], Math. Arch. 61 (1993), 521–528. [29] D. F. Anderson, S. El Baghdadi, and S. Kabbaj, On the class group of A + XB[X] domains, Advances in Commutative Ring Theory, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 205 (1999), 73–85. [30] D. F. Anderson, S. El Baghdadi, and S. Kabbaj, The homogeneous class group of A + XB[X] domains, Internat. J. Commutative Rings 1 (2002), 11–25.
42
Anderson
[31] D. F. Anderson and S. Jenkins, Factorization in K[X n , X n+1 , . . . , X 2n−1 ], Comm. Algebra 23 (1995), 2561–2576. [32] D. F. Anderson and D. Nour El Abidine, Factorization in integral domains, III, J. Pure Appl. Algebra 135 (1999), 107–127. [33] D. F. Anderson and D. Nour El Abidine, The A + B[X] and A + XB[[X]] constructions from GCD-domains, J. Pure Appl. Algebra 159 (2001), 15–24. [34] D. F. Anderson and J. Ohm, Valuations and semi-valuations of graded domains, Math. Ann. 256 (1981), 145–156. [35] D. F. Anderson and J. Park, Factorization in subrings of K[X] or K[[X]], Factorization in Integral Domains, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 189 (1997), 227–241. [36] D. F. Anderson and C. Scherpenisse, Factorization in K[S], Commutative Ring Theory, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 185 (1997), 45–56. [37] S. El Baghdadi, L. Izelgue, and S. Kabbaj, On the class group of a graded domain, J. Pure Appl. Algebra 171 (2002), 171–184. [38] V. Barucci, L. Izelgue, and S. Kabbaj, Some factorization properties of A + XB[X] domains, Commutative Ring Theory, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 185 (1997), 69–78. [39] S. T. Chapman and J. Coykendall, Half-factorial domains, a survey, NonNoetherian Ring Theory, Math. Appl., Kluwer Acad. Publ., Dordrecht 520 (2000), 97–115. [40] S. T. Chapman and A. Geroldinger, Krull domains and monoids, their sets of lengths, and associated combinatorial problems, Factorization in Integral Domains, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 189 (1997), 73–112. [41] L. G. Chouinard, Krull semigroups and divisor class groups, Canad. J. Math. 33 (1981), 1459–1468. [42] P. M. Cohn, Bezout rings and their subrings, Proc. Cambridge Philos. Soc. 64 (1968), 1459–1464. [43] L. Claborn, Every abelian group is a class group, Pacific J. Math. 18 (1966), 219–222. [44] D. L. Costa, J. L. Mott, and M. Zafrullah, The construction D + XDS [X], J. Algebra J. 53 (1978), 423–439. [45] J. Coykendall, A characterization of polynomial rings with the half-factorial property, Factorization in Integral Domains, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 189 (1997), 291–294. [46] J. Coykendall, D. E. Dobbs, and B. Mullins, On domains with no atoms, Comm. Algebra 27 (1999), 5813–5831.
Divisibility Properties in Graded Integral Domains
43
[47] J. Coykendall, T. Dumitrescu, and M. Zafrullah, The half-factorial property and domains of the form A + XB[X], preprint. [48] T. Dumitrescu, S. O. Ibrahim Al-Salihi, N. Radu, and T. Shah, Some factorization properties of composite domains A + XB[X] and A + XB[[X]], Comm. Algebra 28 (2000), 1125–1139. [49] R. M. Fossum, The Divisor Class Group of a Krull Domain, Springer, New York, 1973. [50] L. Fuchs, Infinite Abelian Groups, vol. I, Academic Press, New York, 1970. [51] L. Fuchs, Infinite Abelian Groups, vol. II, Academic Press, New York, 1973. [52] S. Gabelli, On divisorial ideals in polynomial rings over Mori domains, Comm. Algebra 15 (1987), 2349–2370. [53] R. Gilmer, Multiplicative Ideal Theory, Marcel Dekker, New York, 1972. [54] R. Gilmer, Commutative Semigroup Rings, Chicago Lecture Notes in Mathematics, University of Chicago Press, Chicago, 1984. [55] R. Gilmer, A two-dimensional non-Noetherian factorial ring, Proc. Amer. Math. Soc. 44 (1974), 25–30. [56] R. Gilmer and R. Heitmann, On P ic(R[X]) for R seminormal, J. Pure Appl. Algebra 16 (1980), 251–257. [57] R. Gilmer and T. Parker, Divisibility properties in semigroup rings, Michigan Math. J. 21 (1974), 65–86. [58] N. Gonzalez, Factorisation pour les polynˆomes sur une suite croissante d’anneaux, Th`ese de doctorat de l’Universit´e de Droit, d’Economie et des Sciences d’Aix Marseille, 1997. [59] N. Gonzalez, Elasticity of A + XB[X] domains, J. Pure Appl. Algebra 138 (1999), 119–137. [60] N. Gonzallez, Elasticity and ramification, Comm. Algebra 27 (1999), 1729– 1736. [61] N. Gonzallez, S. Pellerin, and R. Robert, Elasticity of A + XI[X] domains where A is a UFD, J. Pure Appl. Algebra 160 (2001), 183–194. [62] A. Grams, Atomic domains and the ascending chain condition, Proc. Cambridge Philos. Soc. 75 (1974), 321–329. [63] F. Halter-Koch, Finitely generated monoids, finitely primary monoids, and factorization properties of integral domains, Factorization in Integral Domains, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 189 (1997), 31–72. [64] F. Halter-Koch, Ideal Systems, Marcel Dekker, New York, 1998.
44
Anderson
[65] Y. Haouat, Anneaux des polynˆomes, Th`ese de doctorat de la Facult´e des Sciences de Tunis, 1992. [66] J. Johnson, Integral closure and generalized transforms in graded domains, Pacific J. Math. 107 (1983), 173–178. [67] B. G. Kang, Group rings over torsion-free abelian groups, Comment. Math. Univ. St. Paul. 48 (1999), 19–24. [68] P. L. Kiihne, Factorization and ring-theoretic properties of subrings of K[X] and K[[X]], Doctoral Dissertation, University of Tennessee, Knoxville, 1999. [69] H. Kim, Examples of half-factorial domains, Canad. Math. Bull. 43 (2000), 362–367. [70] H. Kim, Factorization in monoid domains, Comm. Algebra 29 (2001), 1853– 1869. [71] H. Kim, The distribution of prime divisors in Krull monoid domains, J. Pure Appl. Algebra 155 (2001), 203–210. [72] H. Kim, Elasticity of factorizations in graded integral domains, Internat. J. Commutative Rings 1 (2002), 1–9. [73] H. Kim and Y. S. Park, The t-class group of a semigroup ring, Algebra Colloq. 8 (2001), 419–426. [74] T. Lucas, Examples built with D + M, A + XB[X] and other pullback constructions, NonNoetherian Ring Theory, Math. Appl., Kluwer Acad. Publ., Dordrecht 520 (2000), 341–368. [75] R. Matsuda, On algebraic properties of infinite group rings, Bull. Fac. Sci. Ibaraki Univ. Series A Math. 7 (1975), 29–37. [76] R. Matsuda, On an Anderson-Anderson problem, Proc. Japan Acad. Ser. A 59 (1983), 199–202. [77] R. Matsuda, φ : P ic(R0 ) −→ HP ic(R) is not necessarily surjective, Bull. Fac. Sci. Ibaraki Univ. Series A Math. 16 (1984), 13–15. [78] R. Matsuda, On the content condition of a graded integral domain, Comment. Math. Univ. St. Paul. 33 (1984), 79–86. [79] D. G. Northcott, A generalization of a theorem on the content of polynomials, Proc. Cambridge Philos. Soc. 55 (1959), 282–288. [80] D. G. Northcott, Lessons on Rings, Modules, and Multiplicities, Cambridge University Press, Cambridge, 1968. [81] S. Oda, On the Picard group of Z-graded domains, J. Algebra 160 (1993), 287–309. [82] J. Querre, Id´eaux divisoriels d’un anneau de polynˆ omes, J. Algebra 64 (1980), 270–284.
Divisibility Properties in Graded Integral Domains
45
[83] M. Roitman, Polynomial extensions of atomic domains, J. Pure Appl. Algebra 87 (1993), 187–199. [84] R. G. Swan, On seminormality, J. Algebra 67 (1980), 210–229. [85] R. J. Valenza, Elasticity of factorizations in number fields, J. Number Theory 36 (1990), 212–218. [86] C. Weibel, P ic is a contracted functor, Invent. Math. 103 (1991), 351–377. [87] M. Zafrullah, The D+XDS [X] construction from GCD-domains, J. Pure Appl. Algebra 50 (1988), 93–107. [88] M. Zafrullah, Various facets of rings between D[X] and K[X], Commutative Ring Theory and Applications, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker 231 (2002), 445–460. [89] M. Zafrullah, Various facets of rings between D[X] and K[X], Comm. Algebra 31 (2003), 2497–2540. [90] A. Zaks, Half-factorial domains, Israel. J. Math. 137 (1993), 281–302.
Chapter 3
Extensions of Half-Factorial Domains: A Survey by
Jim Coykendall Abstract A half-factorial domain (HFD) is an atomic domain, R, with the property that if one has the irreducible factorizations in R π1 π2 · · · πn = ξ 1 ξ 2 · · · ξ m then n = m. Half-factorial domains were implicitly studied in the case of rings of algebraic integers in a 1960 paper of L. Carlitz [11] and were subsequently abstracted and studied by A. Zaks. Since their inception as a generalization of the classical notion of unique factorization domains, half-factorial domains have been the subject of much interest in commutative algebra. This chapter will give a survey of some recent advances in the study of half-factorial domains with the emphasis on advances in the understanding of ring extension behavior of half-factorial domains.
1
Introduction and A Bit of History
The purpose of this chapter is to give an expository overview of some of the recent work in the study of half-factorial domains and their extension rings. This chapter is written as an expansion on an invited 45-minute address presented in Chapel Hill in October of 2003. The author would like to begin by expressing his gratitude to Professors Scott Chapman and Bill Smith for their kind invitation and hospitality. The concept of “half-factorial domain” was introduced implicitly in 1960 in a striking paper of L. Carlitz [11]. The paper was written as an answer to a challenge of Narkiewicz who asked for a purely arithmetic characterization of rings of integers in terms of the class number. Of course, it was well-known that a ring of algebraic integers, and more generally, a Dedekind domain, has unique factorization if and only if its class number is one. Given this interplay between the concepts of unique 46
Extensions of Half-Factorial Domains: A Survey
47
factorization and class number (and class group), Narkiewicz’ line of questioning was most natural. In 1960, Carlitz’ partial answer to this question appeared in the Proceedings of the American Mathematical Society. In our opinion, this result is one of the most succinct and beautiful results in the study of factorization in rings of integers. It is also, from at least one point of view, the paper that is the ancestor of much of the current study in the general theory of factorization in general integral domains. Additionally, this paper is one of the most cited papers in factorization theory, and the arguments utilized in the proof have made a “factorization industry” possible for large classes of domains. The proofs in the paper underscore the “right” direction in which to proceed in the more general case. The main result of this seminal paper is that if R is a ring of algebraic integers then one has unique length of factorizations if and only if the class number does not exceed 2. Because of the importance of this result and the fundamental nature of its proof, we will state this result (and demonstrate its proof) more formally later. In the interim, we will remind the reader of the “nicest” class of domains from a factorization point of view and give the current definition of a half-factorial domain as a generalization. This not only gives the historical line of reasoning, but also makes the statement of Carlitz’ result much cleaner. The result of Carlitz’ 1960 paper remained mostly untouched for about 15-20 years until Zaks generalized this “unique length of factorization” property. He published a couple of papers [47, 48] on the subject and coined the terminology “half-factorial domain.” The paper [48] is a longer work with a number of important theorems on the subject of the half-factorial property. It is interesting to note that what seems to be the current accepted definition of a half-factorial domain is actually different from the one in Zaks’ paper. About 10 years later the real gold rush began with a paper by D. D. Anderson, D. F. Anderson, and M. Zafrullah [2]. This paper (and its sequel [3]) is a blueprint for much of the work that is taking place in modern factorization theory, and the scope of the paper far exceeded the scope of the half-factorial property. Historically, this marks the time when much activity began in the factorization theatre. In this chapter, we will concentrate on work that has been done in the theory of half-factorial domains and their extension rings. Because of the large number of results obtained in various aspects of factorization, this chapter will be far from complete. The interested reader would be well served to consult the volume [1] for a very good collection of papers on the half-factorial property, its generalizations, and factorization in general. In this chapter we use the following notation conventions: 1) R is (unless otherwise stated) an atomic domain with quotient field K. 2) RS is the localization of R at a multiplicative set S. 3) R is the integral closure of R. 4) R is the complete integral closure of R. 5) U (R) is the unit group of R. 6) Irr(R) is the set of irreducible elements of R.
48
Coykendall 7) Cl(R) is the class group of R. 8) R[x] and R[[x]] are the rings of polynomial and formal power series over R, respectively. 9) D(G) is the Davenport constant of the finite abelian group G.
10) d(K) is the discriminant of the algebraic number field K. 11) Sn is the symmetric group on n letters. Other notations are standard.
2
Some Preliminary Results and Definitions
Of course, the genesis of factorization theory is motivated by the domains where factorization is extremely well-behaved. For the purposes of this chapter, we will assert some control over the “badness” of the factorization behavior. That is, unless otherwise stated, we will assume that our domains are atomic (i.e., every nonzero, nonunit element of R can be written as a product of irreducible elements). We now recall the definition of unique factorization domains. Definition 2.1. A unique factorization domain (UFD) is an atomic integral domain, R, such that given the irreducible factorizations π1 π2 · · · πn = ξ1 ξ2 · · · ξm we have that: a) n = m and b) ∃ σ ∈ Sn such that for each 1 ≤ i ≤ n, πi = ui ξσ(i) for some ui ∈ U (R). There are a number of equivalent definitions of UFDs that are useful in different settings. In particular, a UFD may be more succinctly defined as the class of domains where every nonzero nonunit can be expressed as a product of prime elements. From the ideal theoretic point of view, UFDs can also be characterized as the class of domains where every nonzero prime ideal contains a nonzero principal prime [32]. Unique factorization domains possess a large number of very nice properties and we will compare and contrast some of these with the properties of half-factorial domains. The class of half-factorial domains (HFDs) is, from one point of view, the nicest generalization of the class of UFDs with respect to factorization. Definition 2.2. An (atomic) domain is said to be a half-factorial domain (HFD) if given two irreducible factorizations π1 π2 · · · πn = ξ1 ξ2 · · · ξm then n = m.
Extensions of Half-Factorial Domains: A Survey
49
So, in a certain sense, an HFD is just a UFD with “half the axioms.” It is worth noting that Zaks’ original definition omitted the “atomic” assumption (and in Zaks’ paper he quickly specialized to atomic cases). Of course, it is natural to ask if the HFD condition without the atomic assumption automatically forces atomicity, but this is not the case as we will see in the next example. Without the “atomic” assumption, there is some pathology that we wish to avoid; for this reason (and since today’s common definition also includes the assumption “atomic”), we will always assume that HFD implies atomic unless otherwise indicated. In the following example from [25], we will produce a nonatomic domain that has the property that any two equal irreducible factorizations have the same length. Example 2.3. This example will give a nonatomic domain with the property that if π1 π2 · · · πn = ξ1 ξ2 · · · ξm with πi , ξj ∈ Irr(R), 1 ≤ i ≤ n, 1 ≤ j ≤ m, then n = m. The example is a domain with a unique nonprime irreducible element (up to associates) and was constructed in [25]. In this domain, the uniqueness of the irreducible assures that any two irreducible factorizations are of the same length (in fact, unique). The ease of this observation belies the delicate nature of the construction of a domain with a unique nonprime irreducible (for atomic domains with finitely many irreducibles, the so-called CK domains, see [4]). Speaking very loosely, we will outline the major steps to the construction of such a domain. Begin with a ring R that possesses a nonprime π ∈ Irr(R). One then constructs a new domain, R1 , by indexing all the irreducibles in R that are not associated to π (say our relevant irreducibles are {ξi }i∈I with I some indexing set) and building a larger domain that “forces” each ξi to become reducible. In particular, we let R1 = R[{xi }][
ξi ]i∈I , xi
with each xi a polynomial indeterminate. It is then shown that in R1 , π remains a nonprime irreducible and each ξi is reducible in R1 by construction. Of course, there may be many “new irreducibles”, but one again isolates π and constructs R2 analogously. Continuing in this fashion, we obtain a tower of rings ∞
R1 ⊆ R2 ⊆ R3 ⊆ · · ·
and we define T := i=1 Ri . It can be shown that in T , π is the unique nonprime irreducible (intuitively, uniqueness comes from the fact that every possible irreducible not associated to π is “destroyed” in the next stage of the construction). This domain has the claimed property, and it is interesting to note that this construction shows that any domain with a nonprime irreducible element can be embedded in such a domain. We remark that the general theme of this construction is very much in the spirit of the construction performed by M. Roitman in [42] where it was shown that a polynomial extension of an atomic domain is not necessarily atomic.
50
Coykendall
With these definitions in hand, we now have the tools to succinctly state the classical result of Carlitz. We give a slightly more general statement in the spirit of the general utility of Carlitz’ proof and in the spirit of much of the research that has taken place concerning the interplay of the class number and factorization. Theorem 2.4. Let D be a Dedekind domain. If |Cl(D)| ≤ 2 then D is an HFD. If Cl(D) is torsion and D has the property that there is a prime ideal in every class, then the converse also holds. Proof. Of course, it is well-known that if Cl(D) is trivial, then D is a UFD (and hence an HFD), so we will concentrate on the case where |Cl(D)| = 2. Assume that we have the irreducible factorizations π1 π2 · · · πn = ξ1 ξ2 · · · ξm . Since a prime factor appears on the left side if and only if it appears on the right, we will reduce to the case where the factorizations above consist entirely of nonprime irreducible elements. Since |Cl(D)| = 2 and each irreducible is a nonprime we can factor (in terms of prime ideals) (i)
(i)
(i)
(i)
πi = P1 P2 and
ξi = Q1 Q2 . We now have the ideal factorization (1)
(1)
(2)
(2)
(n)
(n)
P1 P2 P1 P2 · · · P1 P2
(1)
(1)
(2)
(2)
(m)
(m)
= Q1 Q2 Q1 Q2 · · · Q1 Q2 .
Since prime ideal factorizations are unique, we have that 2n = 2m and hence n = m. On the other hand, assume that D is a Dedekind HFD and Cl(D) has a prime in every class. Since Cl(D) is torsion, every class has finite order. We first assume the existence of a class of order n > 2 and select a prime ideal P in this class. By construction, Pn is principal and generated by some α ∈ Irr(D). We now choose a prime ideal Q in the class of P−1 and note that PQ is principal and generated by some π ∈ Irr(D) and additionally Qn is principal and generated by the irreducible β. We now consider the ideal factorizations (PQ)n = (Pn )(Qn ) which give the elemental factorizations π n = uαβ for some u ∈ U (D). Since n > 2, D is not an HFD. The only case left to consider is the case where Cl(D) is of exponent 2 and |Cl(D)| > 2. In this case, Cl(D) must contain a subgroup isomorphic to the Klein 4-group Z2 ⊕ Z2 . In a fashion similar to the above, we choose prime ideals P in the class corresponding to (0, 1), Q in the class corresponding to (1, 0) and R in the class corresponding to (1,1). It is easy to see that there are irreducibles α, β, γ,
Extensions of Half-Factorial Domains: A Survey
51
and ξ such that P2 = (α), Q2 = (β), R2 = (γ), and PQR = (ξ). The ideal factorizations (PQR)2 = (P2 )(Q2 )(R2 ) give rise to the elemental factorizations ξ 2 = uαβγ for some u ∈ U (R) and once again D is not an HFD. A couple of remarks are worth noting here. First, the original Carlitz result was couched strictly in terms of algebraic number theory. His result was that a ring of algebraic integers, R, is an HFD if and only if the class number of R does not exceed 2. But the seeds of the original proof pointed the way towards much more generality. The second remark is that although the above theorem is slightly more general than the original statement of Carlitz, it is not as general as possible either. There has been much work done in more general cases and the interested reader is encouraged to consult [5, 6, 14].
3
“Good” Properties of UFDs versus HFDs
As a generalization of UFDs, one would like to understand what, if any, “nice” behaviors of UFDs are shared by HFDs. UFDs possess a number of nice properties (especially in the case of localizations and polynomial extensions). Some of these classical results are that if R is a UFD then so is R[x], and the localization RS . Both of these central results for UFDs can be obtained from the following nice ideal-theoretic characterization of UFDs. Theorem 3.1. A domain R is a UFD if and only if every nonzero prime ideal in R contains a (nonzero) prime element. So a UFD is the “multi-dimensional” generalization of a principal ideal domain (PID). Generally speaking, HFDs do not have a readily apparent ideal theoretic characterization. In the case of rings of algebraic integers (and more generally, Dedekind and Krull domains with certain restrictions on the class group), HFDs do have a nice ideal-theoretic characterization (evidenced by Carlitz’ theorem, for one). A sweeping ideal-theoretic characterization for general HFDs seems to be elusive (if indeed such a characterization exists), and we cannot resist the following question. Question 3.2. Find a general ideal-theoretic characterization of HFDs in the spirit of the characterization of UFDs, if it exists. Below we produce a table that records some of the classical results about UFDs and compares them with what is known about the analog property for HFDs. It should be explicitly stated that the entries “no” in the table mean, more precisely, “not always.”
52
Coykendall Table of Inherited Factorization Properties R is a: UFD HFD
R[x] Yes No
R[[x]] No No
R Yes No
R Yes No
RS Yes No
We make a couple of remarks about the table. First it should be noted that if R is a UFD then the (complete) integral closure of R coincides with R, so this result is trivial (but it does indeed invite the question as to whether the (complete) integral closure of an HFD is still an HFD). Also, although it is possible for a power series ring over a UFD to lose unique factorization [43], if R is a one-dimensional UFD (i.e., a PID) then R[[x1 , x2 , · · · , xn ]] is a UFD for all n. If the reader hopes for the half-factorial property to be preserved in standard extensions, then this table will look quite depressing. However, we remark that there are indeed positive results with (in some cases) rather minimal restrictions placed on the HFD. We will look at some of the positive results and some of the pathologies in the next sections.
4
Localizations
In our view, one of the most disturbing results in the table from the previous section is that if R is an HFD, then it is not necessarily true that RS is an HFD (where S is a multiplicatively closed subset of R). The proof that the UFD property holds in localizations is very elementary (the characterization of UFD via every nonzero prime contains a nonzero principal prime is very useful in this regard). Of course, one would not expect general overrings to preserve the half-factorial property since unique factorization is not preserved in general overrings. A quick example of this is the ring K[x, y] where K is a field. This ring is a UFD (and hence an HFD), but the overring K[x, xy , xy2 , xy3 , · · · ] is not even atomic. In this section we take a brief look at some examples, positive (and negative) results, and generalizations of HFDs in the case of localizations and more general overrings. We will begin by giving an example of an HFD which possesses a localization which does not have the half-factorial property. This example and other very nice results in this spirit may be found in the papers [7], [8], and [9]. Example 4.1. We begin by noting that one can construct a Dedekind domain, D, with class group Z6 such that the prime ideals of D are restricted to the classes corresponding to {1, 2, 3} ⊆ Z6 (a more general theorem on the construction of such Dedekind domains can be found in [27]). As it turns out, such a Dedekind domain is necessarily an HFD. We now consider the set Γ = {Q|Q is a prime ideal of D with [Q] = 1 or [Q] = 2}.
It is easy to see that if P is a prime ideal such that [P ] = 3 then P ⊆ Q∈Γ Q. Let t ∈ P \ ∪Q∈Γ Q, T = {1, t, t2 , · · · } and form the localization R = DT . We make the following observations. 1. R is a Dedekind domain.
Extensions of Half-Factorial Domains: A Survey
53
2. Cl(R) ∼ = Cl(D)/(ker(τ )) where τ is the natural map from Cl(D) −→ Cl(R) defined by τ : [I] −→ [IR]. It follows ([7]) that Cl(R) ∼ = Z6 /Z2 ∼ = Z3 and the primes of R are in the nontrivial classes of Z3 . With this reduction, the technique of the Carlitz proof can be applied to show that R is not an HFD. This example motivates the following definitions (once again from [7] and [8]). Definition 4.2. Let R be an integral domain. We say that R is a a) Locally half-factorial domain (LHFD) if every localization of R is an HFD. b) Strong half-factorial domain (SHFD) if every overring of R is an HFD. Of course, an SHFD is an LHFD, but the converse does not hold in general. Here are some nontrivial examples of these types of domains. Example 4.3. Let R be a Dedekind domain with Cl(R) = Zp for a prime integer p, such that all primes of R are contained in the class {1}. Then it can be shown that any (nontrivial) localization RS has trivial class group and hence is a PID. The upshot is that R is a LHFD, and since R has torsion class group, every overring is a localization and hence R is SHFD. We note that this example can be tweaked to the case where Cl(R) is not torsion to give an example of an LHFD that is not an SHFD (the key in this augmentation of the example is that if the class group is not torsion, then there are overrings which are not localizations). Theorem 4.4. Let D be a Dedekind domain satisfying one of the following. a) |Cl(D)| ≤ 5. b) Cl(D) = Zpn . c) Cl(D) = ⊕ki=1 Z2 . Then the following statements are equivalent. 1. D is an HFD. 2. D is a SHFD. 3. D is a LHFD. We conclude this brief section with a couple of observations. The first is that the SHFD property is very strong in the sense that if R is an SHFD then the Krull dimension of R is no more than 1 (the introductory example at the beginning of the section of the overring pair K[x, y] ⊆ K[x, xy , xy2 , xy3 , · · · ] illustrates very plainly the hazards of domains where the Krull dimension is 2 or more). Finally, if G is a finite abelian group NOT of the form a), b), or c) in the theorem, then there exists a Dedekind domain D with Cl(D) = G such that D is not an HFD but every proper overring is an HFD. Some interesting generalizations of HFDs (e.g., “congruence” HFDs and kHFDs) are studied in [15].
54
5
Coykendall
Polynomial Extensions
One of the most famous and useful properties of UFDs is the fact that unique factorization in a coefficient ring R makes a smooth transition to the polynomial ring R[x]. This result, originally due to Gauss, makes polynomial computations (over a well-behaved coefficient ring) quite tractable. Theorem 5.1. If R is a UFD, then R[x] is a UFD. The standard proof of this theorem uses the notion of “content” of a polynomial (recall that the content of a polynomial f ∈ R[x] is the ideal of R generated by its coefficients), but a more streamlined proof can be given using the ideal-theoretic characterization of UFDs (any nonzero prime contains a nonzero prime element). This theorem is a classic and begs the analogous question for HFDs. In [48], Zaks proved the following generalization of this theorem to a special class of HFDs. Theorem 5.2. If R is a Krull domain, then R[x] is an HFD ⇐⇒ |Cl(R)| ≤ 2. Unfortunately, Zaks’ result does not generalize to all HFDs as the following example will show. √ √ √ Example 5.3. Consider the order R := Z[ −3] ⊆ Z[ ω] where ω = 1+ 2 −3 . The √ fact that R is an HFD is easily shown (for example, see [48]). Intuitively, Z[ −3] is an HFD because the integral √ closure, Z[ω], is a UFD and a norm argument shows that every irreducible in Z[ −3] is prime in Z[ω]. Now consider the factorization (2x − 2ω)(2x − 2ω) = (2)(2)(x2 − x + 1) where ω is the complex conjugate of ω. Clearly, the right hand side of the above equation has at least three irreducible factors (in fact, precisely three), and so if both of the factors on the left are ir√ reducible, then Z[ −3][x] is not an HFD. And indeed this is the case, as any irreducible factorization of 2x − 2ω (respectively 2x − 2ω) must consist of a constant √ in Z[ −3] of norm 2 or 4, and a degree one polynomial factor. It is easy to check that there is no such factorization. Although the above example demonstrates the impossibility of a full generalization of Gauss’ theorem to general HFDs, it does provide some insight. A slight tweaking of this example to a slightly more general setting allows us more to glean the following theorem [17]. Theorem 5.4. If R[x] is an HFD, then R is an integrally closed HFD. The proof of this theorem may be found in [17], but the example above holds almost the entire content of this theorem. The interested reader is encouraged to “play” with the√above example; it is easily seen that the failure of the half-factorial property in Z[ −3] is a direct consequence of the fact that the coefficient ring is not integrally closed. As a corollary to the previous theorem (coupled with the results from [48]), one can classify all Noetherian polynomial HFDs.
Extensions of Half-Factorial Domains: A Survey
55
Corollary 5.5. Let R be Noetherian. The following conditions are equivalent. a) R[x] is an HFD. b) R[x1 , x2 , · · · , xn ] is an HFD for all n ≥ 1. c) R is a Krull domain with |Cl(R)| ≤ 2. Proof. It is known from [48] that if R is a Krull domain, then R[x] is an HFD if and only if |Cl(R)| ≤ 2, which gives c) implies a). For a) implies c), we assume that R[x] is an HFD. This means that R is integrally closed, and since R is Noetherian, R is a Krull domain. We apply Zaks’ result again to obtain c), and hence a) and c) are equivalent. Certainly b) implies a) and to get the converse, we merely note that if R is a Krull domain, then so is R[x1 , · · · , xn ] and what is more, the class number is stable upon the adjunction of any finite number of indeterminates.
6
Power Series Extensions
Power series extensions are oftentimes more problematic than polynomial extensions. Many classical results that hold (in general commutative algebra) sometimes fail wildly in the setting of power series. Passing to a completion (even an x–adic one) is sometimes a bit tricky and some nice properties may be lost. For the sake of perspective, a striking example of this phenomenon is in dimension theory. A classical result for polynomials is that if the (Krull) dimension of a ring (dim(R)) is finite (say dim(R) = n), then so is the dimension of R[x] (in particular, if dim(R) = n then n + 1 ≤ dim(R[x]) ≤ 2n + 1). This is wildly untrue (and in fact, from the non-Noetherian point of view, usually untrue) in the case of power series rings. In fact, there are 0−dimensional rings whose power series extensions are infinite dimensional. Of course, it should be noted that there are instances in which the behavior of formal power series is at least as nice as the analog behavior in polynomials. One example where this occurs is in the case of the passage of the unit group of a ring to polynomials and power series. It is well-known that U (R) = U (R[x]) and that the set of units in R[[x]] is the set of power series f (x) ∈ R[[x]] such that f (0) ∈ U (R). An even more striking example of good power series behavior involves (semi-) quasi-local rings. It is a central result that R is quasi-local (resp., semi-quasi-local) if and only if R[[x]] is quasi-local (resp. semi-quasi-local). The analogous result for polynomials is not true, since the ring R[x] is never semi-quasi-local. But such nice behavior of power series rings relative to the polynomial case is the exception and not the rule in practice. From a factorization point of view we can find bad behavior as well. For example, there are UFDs which have non-UFD power series extensions [43]. As has been pointed out earlier, if R[x] is an HFD, then R is integrally closed. Since for the polynomial case, the coefficient ring being integrally closed is necessary for R[x] to have a chance at the half-factorial property, intuitively one would (perhaps) expect that R[[x]] being an HFD would demand at least this much. In light of this “intuition” let us revisit an earlier example.
56
Coykendall
√ √ √ Example 6.1. Consider the order R := Z[ −3] ⊆ Z[ ω] where ω = 1+ 2 −3 . As noted before, R is an HFD with R[x] failing to be an HFD. We again look at the factorization in Z[x] that demonstrated the loss of the half-factorial property:
(2x − 2ω)(2x − 2ω) = (2)(2)(x2 − x + 1). A close inspection of this factorization shows that, in contrast to the Z[x] case, this does not deny the half-factorial property in Z[[x]]. The reason for this is that the element x2 + x + 1, although an irreducible in Z[x], is a unit in Z[[x]]. Hence up to units, the factorizations on both sides of the above equation are of length 2. In fact, in the example above, R[[x]] is, in fact, an HFD. Much more general situations are considered in [22]. We will outline a proof that the above example is a (nonintegrally closed) example of an HFD such that R[[x]] is an HFD. A more thorough treatment of this phenomenon can be found in [22]. Theorem 6.2. Let R be a 1−dimensional domain with integral closure R and conductor I. Also suppose that every nonzero coset of R/I can be written in the form u + I with u ∈ U (R). Then R is a UFD implies that R[[x]] is an HFD. Before beginning this proof, we note that, in particular, the hypotheses apply to √ the ring√Z[ −3]. Indeed, the integral closure of this ring is (the UFD) Z[ω] where √ ω = 1+ 2 −3 and the conductor of Z[ω] to Z[ −3] is the ideal 2Z[ω] = P. Since this conductor ideal is prime, the quotient ring Z[ω]/2Z[ω] is isomorphic to F4 , the field of 4 elements. It is easy to see that the nonzero cosets can be written in the form 1 + P, ω + P, and ω 2 + P. We will now give an outline of the proof of the theorem. Proof. We claim that every irreducible element of R[[x]] is again irreducible in R[[x]]. If not, then we factor an irreducible f ∈ R[[x]] as gh with g, h ∈ R[[x]]. First note that if both h and g are in I[[x]], then this is a direct contradiction. We begin by assuming that neither g nor h is an element of I[[x]]; we write g(x) = a0 + a1 x + · · · + ak−1 xk−1 + xk (bk + bk+1 x + · · · ) where bk is the first term not in the conductor I. We write bk = u1 + Ig with u1 a unit of R and Ig ∈ I. Collapsing notation we write g = g + xk (ug + Ig ) where ug is a unit power series with constant coefficient u1 ∈ U (R) and g ∈ I[[x]]. In a similar fashion, we write h = h + xm (uh + Ih ) with uh a unit power series with constant coefficient v1 ∈ U (R), h ∈ I[[x]], and Ih ∈ I. Note that gh =gh + gxm (uh + Ih ) + hxk (ug + Ig )+ + xk+m (ug uh + ug Ih + uh Ig + Ig Ih ).
Extensions of Half-Factorial Domains: A Survey
57
Since h, g, Ig , and Ih are in I[[x]] and g and h are in R[[x]], we obtain that ug uh is an element of R[[x]]. As a consequence we note that since g = g + xk (ug + Ig ) we have that uh g = uh g + xk (uh ug + uh Ig ) and so uh g ∈ R[[x]]. Similarly, we obtain that ug h ∈ R[[x]]. We now note that f = gh = (uh g)(ug h)(uh ug )−1 and we have a contradiction. The final case to consider is the case when precisely one of the factors, g or h, is an element of I[[x]]. We will assume without loss of generality that g = g is the factor in I[[x]]. In this case, uh g ∈ R[[x]] and we have f = gh = (uh g)(u−1 h h) which is again a contradiction. Now that we have established that every irreducible in R[[x]] is irreducible in R[[x]], we observe that if we have two irreducible factorizations in R[[x]] f1 f2 · · · fn = g1 g2 · · · gm then each fi , gj is irreducible in R[[x]] which is a UFD (since R is a 1 dimensional UFD and hence a PID). Hence n = m. We cannot resist highlighting what we believe to be an interesting implication of this example. Corollary 6.3. There exist HFDs R such that the half-factorial property is lost in R[x] and regained in R[[x]]. √ Proof. If one considers the ring R := Z[ −3], then this is an HFD such that R[x] is not an HFD, since R is not integrally closed. Nonetheless, the above result shows that R[[x]] is indeed an HFD. Here is a final observation along these lines. Corollary 6.4. If R[[x]] is a UFD, then R and R[x] are UFDs. If R[[x]] is an HFD, then R is an HFD, but R[x] is not necessarily an HFD. Proof. First we note that any irreducible element of R remains irreducible in R[[x]]. Indeed, if π ∈ Irr(R) and π = f (x)g(x) with f (x), g(x) ∈ R[[x]] then we write ∞ i i f (x) = ∞ i=0 ai x and g(x) = i=0 bi x and factor ∞ ∞ π=( ai xi )( bi xi ). i=0
i=0
It is immediate that we get the factorization
58
Coykendall
π = a0 b 0 and since π ∈ Irr(R), either a0 or b0 is a unit in R, forcing either f (x) or g(x) to be a unit in R[[x]]. This establishes our claim. Given this claim, we consider the following factorization in R π1 π2 · · · πn = ξ1 ξ2 · · · ξm with each πi , ξj ∈ Irr(R). If R[[x]] is an HFD, then all of the above irreducible elements remain irreducible in R[[x]] and since R[[x]] is an HFD, we must have n = m and R is an HFD. Additionally, if R[[x]] is a UFD, then every irreducible element of R[[x]] is prime, and hence each πi and ξj is a prime element of R[[x]] (and it is easy to see that the elements are therefore prime as elements of R). Hence R is a UFD. We now have that if R[[x]] is a UFD (respectively HFD) then R is a UFD (respectively HFD). The fact that if R[[x]] is a UFD implies that R[x] is a UFD follows from the previously mentioned result of Gauss, and the absence of the analogous result for HFDs is demonstrated by the above example. We remark here that one might notice that there is a similar result for the case of (semi)quasi-local rings. That is, if R[[x]] is (semi)quasi-local then R is (semi)quasi-local, but R[x] is not. One thing to contrast, however, is that R[x] is never (semi)quasi-local. As was noted before, the above technique is used with some success in [22] in a more general setting. In the previous section, a classification of all Noetherian polynomial HFDs was given, but a general classification for the power series case (even for Noetherian rings) remains elusive. In hindsight, this might not be too surprising since a good characterization of when the UFD property is preserved in power series extensions is not known. One of the best theorems in this sense is the result that states that if R is a PID then R[[x1 , x2 , · · · , xn ]] is a UFD for all n ≥ 1. The class of PIDs is precisely the class of one-dimensional UFDs and it should be noted that the classical example of a UFD, R, such that R[[x]] is not a UFD is a two-dimensional Noetherian domain. This demonstrates, in a certain sense, that one does not have to travel far from the class of PIDs to find examples of bad factorization behavior in power series extensions.
7
Extensions of the Form A + xB[x] and A + xI[x]
A key source of examples in commutative algebra is the so-called “D + M” construction. Recently the D + M construction has shown that its utility extends to the study of factorization (often as a rich source of “bad” factorization behavior). A useful illustration of this is the ring Z + xQ[x]. This ring is one of the simplest examples of the previous statement. It is nonatomic, since the element x is a nonunit that possesses no finite factorization into irreducibles. To see this, we note that if x = π1 π2 · · · πn is an irreducible factorization of x in Z + xQ[x], then a degree argument, coupled with the fact that Q[x] is a PID, shows that precisely one of the irreducible factors
Extensions of Half-Factorial Domains: A Survey
59
(say π1 without loss of generality) must be an associate of x as an element of Q[x]. We write π1 = qx with q ∈ Q and note that π1 = 2( q2 )x, which contradicts the irreducibility of π1 in Z + xQ[x]. The constructions A + xB[x] and A + xI[x], specializations of the standard “D + M” construction, are gold mines for interesting (especially nonunique) factorizations [10] (note that it is assumed that A ⊆ B are domains and in the second case that I ⊆ A is an ideal). Indeed, there is no way that an A + xB[x] construction can ever be a UFD unless A = B and A is a UFD (in fact, unless A = B and A is completely integrally closed, A + xB[x] is not completely integrally closed). Also note that if I is a proper nonzero ideal of A, then x is almost integral over A + xI[x] and hence A + xI[x] is not a UFD either. For the A + xI[x] construction, assuming that A is an UFD is a very natural starting point. With respect to this condition, Gonzalez, Pellerin and Roberts proved the following nice theorem [30]. Theorem 7.1. Let A be a UFD and R := A + xI[x] with I a proper nonzero ideal of A. Then R is an HFD if and only if I is a prime ideal of A. Actually much more is shown in this paper. They show, in fact, that R is atomic and that ρ(R) is finite if and only if I = P1 · · · Pk with the Pi ’s being noncomparable primes with at most one of them nonprincipal (and if this is the case then ρ(R) = k). This result has also been extended to the case where A is a Dedekind domain. It has been shown that if |Cl(A)| = ∞ then ρ(R) = ∞. In the case where |Cl(A)| < ∞ and I is a product of k distinct principal primes, we have the following from [37]. Theorem 7.2. Let A be a Dedekind domain with finite class group and let I ⊆ A , be the product of k distinct principal primes. Then ρ(A + xI[x]) = k + D(Cl(A)) 2 where D(Cl(A)) is the Davenport constant of Cl(A). Here we declare that the Davenport constant is 0 if the class group is trivial. We now present some recent advances in the spirit of the work of Gonzalez, Pellerin, and Roberts. This next result can be found in [23] and is an extension of some of the work of Kim [33]. Theorem 7.3. If K is a field and B is any domain containing K then K + xB[x] is an HFD if and only if B is integrally closed. We now look at the A + xI[x] construction. Question 7.4. If K ⊆ B is an extension of domains with K a field and B a UFD, and P ⊆ B is a prime ideal, then is K + xP[x] an HFD? To help in this, we record the following result [23]. Theorem 7.5. Let A ⊆ B be an extension of domains with A a UFD and let I ⊆ B be a proper ideal. If I contains an irreducible element π ∈ B such that π 2 has no nontrivial factor in A, then A + xI[x] is not an HFD. Proof. (πx2 )(π 2 x) = (πx)(πx)(πx).
60
Coykendall
Corollary 7.6. Let K ⊆ B be an extension of domains with K a field and let I ⊆ B be a proper ideal. If I contains an irreducible element of B, then K + xI[x] is not an HFD. This answers the question raised above. Once again, we see the usefulness of the ideal theoretic characterization of UFD. This time, the fact that the prime ideal xI[x] ⊆ K + xI[x] contains no prime element helps us to do something “bad”.
8
Integral Closure
As UFDs are (completely) integrally closed, a very natural question is “are HFDs integrally closed?” Earlier examples quickly show that√this is not the case; for example, we have seen the concrete example of the ring Z[ −3] which is a nonintegrally closed HFD. Along this line of thought, a natural next question is, “is the integral closure of an HFD still an HFD?” This question was answered in the negative by the present author in [21]. We will outline this result (as the construction is somewhat intricate). But we will note that, in some sense, this counterexample is a bit unsatisfactory. More specifically, the reason why the integral closure of the HFD presented in [21] fails to have the half-factorial property is that it fails to be atomic. From the point of view of the current accepted definition of HFD, this example is a bona fide counterexample, but only because of the loss of atomicity. As one will see from the outline of the construction, it turns out that any two irreducible factorizations in the integral closure of this domain are of the same length. (So from the point of view of the original discarded definition of Zaks, the integral closure of this HFD is again an HFD.) We will outline this example in a couple of steps and give the briefest idea of how it works. This construction will deliver a specific example of an HFD whose integral closure does not have the half-factorial property, but it should be noted that this construction can be generalized (for example, the choice of the value group and residue fields are only for computational convenience). 1. We begin with the semigroup ring F2 [x; Q+ ], and we denote the maximal ideal generated by the “monomials” by M (i.e., M is the ideal generated by the set {xα }α∈Q+ ). 2. We now form the localization R := F2 [x; Q+ ]M . This localization is a 1− dimensional nondiscrete valuation domain with value group Q and residue field F2 . 3. Abusing the notation, we let M ⊆ R be the maximal ideal and consider R1 := F2 + tM[t] where t is a polynomial indeterminate. It is worth noting at / R1 . It is this step that the element t ∈ / R1 ; additionally for all α ∈ Q+ , xα ∈ also worth noting that R1 is integrally closed. Indeed, its integral closure is certainly contained in F2 + tR[t] since R[t] is integrally closed and F2 + tR[t] is integrally closed in R[t] (the integral closure of F2 in R is F2 ). It is now easily seen that no element of (F2 + tR[t]) \ (F2 + tM[t]) is integral over F2 + tM[t]. 4. In this step, we simplify by localizing at the ideal tM[t]. The effect of this is to get rid of irreducible “polynomials” that may crop up in the ring R1 and
Extensions of Half-Factorial Domains: A Survey
61
clarifies factorization behavior. We let R2 := (F2 + tM[t])tM[t] and note that this is an HFD. Indeed, if π ∈ R2 is irreducible, then π ∈ tM[t]R2 , and this observation allows us to conclude that every irreducible in R2 can be written in the form u(xα1 t + 2 xα2 t2 + · · · + n xαn tn ) with each u a unit in R2 , i ∈ U (R2 ) {0}, and each αi ∈ Q+ . At this step it is fairly straightforward to verify that R2 is an HFD. Indeed, a general nonzero nonunit in R2 assumes the form (with notation as above) u(xα0 tm + 1 xα1 tm+1 + · · · + k xαk tm+k ). In this form it is easy to see via a “degree argument” that the above element has at most m irreducible factors (since no rational power of x is an element of R2 ). The fact that if m > 1, the above element actually has a factorization with m elements follows from the fact that the original valuation domain from earlier in this construction was nondiscrete. Note that if α = min(α0 , α1 , · · · , αk ), then we can factor the above element u(xα0 tm + 1 xα1 tm+1 + · · · + k xαk tm+k ) α
= u(x 2(m−1) t)m−1 (xα0 − 2 t + 1 xα1 − 2 t2 + · · · + k xαk − 2 tk+1 ). α
α
α
Of course this element may have many factorizations, but the above shows that each has length m. 5. The problem that we encounter now is that the domain from the previous step, R2 , is integrally closed, as it is a localization of the integrally closed domain, R1 . In particular, the strategy is to make the elements {xα }α∈Q+ integral and to ensure that the integral closure of our target domain is not atomic. To continue our construction we wish to adjoin elements to R2 that make this happen (while not destroying the half-factorial property). With this in mind, we consider R3 := (F2 + tM[t])tM[t] [x + t], obtained by adjoining the element x + t of the quotient field of R2 to R2 . In the ring R3 there are two prime ideals worth noting. The first is the prime ideal P = (x + t) (it is fairly easy to show that x + t is a prime element of R3 ) and second is the prime ideal Γ which is the extension of the maximal ideal tM[t]R2 to our new domain R3 . 6. We now wish to, once again, simplify for the purposes of factorization. We let R4 := (F2 + tM[t])tM[t] [x + t](P S Γ)c . By construction, the only prime ideals of R4 are (the extensions of) P and Γ. A simple computation shows that the only nonunits of R4 are of the form (x + t)n h where h can be thought of as an element of R2 (up to units). If we consider any irreducible factorization of (x + t)n h, we note first that since x + t is a prime element of R4 , we can ignore the effect of the (x + t)n factors. An argument similar to the proof that any nonunit in R2 has the half-factorial property (by counting the multiplicity of t) applies here and so R4 is an HFD.
62
Coykendall 7. To see that the integral closure of R4 is not an HFD (more specifically, not atomic) note that 1 1 tx1+ n xn = tx 1
and so x n is in the quotient field of R4 . Also note that 1
1
(x n )2n + (x + t)(x n )n + xt = 0 1
and so x n is a root of the monic polynomial Y 2n + Y n (x + t) + xt ∈ R4 [Y ]. It is easy to see that the existence of the factorizations 1
x = (x n )n for all n deny the atomicity of the integral closure of R4 . Purists (those who would like to follow the original concept of HFDs from Zaks) will be understandably displeased with this example, for, in a certain sense, it is cheating. Along lines similar to the above, it can be shown that the integral closure of R4 contains every (positive) rational power of x and every positive integral power of t and hence is a localization of a polynomial ring over a (nondiscrete) valuation domain. As a consequence, it can be shown that any two irreducible factorizations of the same element are of equal length. The question still remains as to whether or not the integral closure of an HFD is again an HFD if the integral closure remains atomic.
9
Orders in Rings of Integers
Despite the title of this chapter, we take a step back and look at the dual notion of underrings of half-factorial domains (here, by “underring” of a ring T , we mean a ring R ⊆ T such that R and T share the same quotient field). Much of the study here is motivated by questions concerning orders in rings of algebraic integers. We briefly recall that an order in a ring of integers is a ring R such that the integral closure R is the full ring of algebraic integers. The study of the factorization behavior is well-motivated by questions in algebraic number theory and is important in a number of applications including representation of integers by quadratic forms. For an interesting example of the ramifications of the half-factorial property with respect to the representation of integers by quadratic forms applied to finite geometry, see [24] for an example. Much of the theory of factorization has its roots (and is still motivated by) questions from number theory. In particular, Carlitz’ paper was motivated by a number-theoretic question of Narkiewicz. Carlitz’ result gave an interpretation of the half-factorial property in terms of the class group, which is a subject that has been of interest in algebraic number theory for a very long time. In the spirit of factorization and the class group, here is a very famous open conjecture due to Gauss that has resisted solution for quite some time. Conjecture 9.1. There is an infinite number of real quadratic UFDs.
Extensions of Half-Factorial Domains: A Survey
63
Despite the apparent difficulty of Gauss’ conjecture, we offer another conjecture along these lines. Conjecture 9.2. There is an infinite number of real quadratic HFDs that are not UFDs. The curious reader may at this juncture wonder about the status of the questions for the imaginary case. In light of the fact that the Carlitz result allows us to completely determine the half-factorial property via the class number (with class number one being a UFD and class number 2 being a non-trivial HFD), we present a couple of results that answer this question. The following result is due to H. Stark [44]. Theorem 9.3. Let R be the ring of integers of an imaginary quadratic field. Then |Cl(R)| = 1 if and only if the field discriminant is −3, −4, −7, −8, −11, −19, −43, −67, or −163. The proof of the fact that the rings of integers corresponding to the field discriminants listed above are all UFDs is fairly straightforward. The converse of the theorem was only completely solved in the late 1960s, when Stark showed that there was no tenth imaginary quadratic field. A result from analytic number theory states that there are only finitely many totally complex abelian extensions of Q of given degree and class number ([35]). This makes the existence of only finitely many imaginary quadratic HFDs immediate. Due to another result of Stark [45] we can list all imaginary quadratic HFDs that are rings of integers. Theorem 9.4. Let R be the ring of integers of an imaginary quadratic field. Then |Cl(R)| = 2 if and only if the field discriminant is −15, −20, −24, −35, −40, −51, −52, −88, −91, −115, −123, −148, −187, −232, −235, −267, −403, or −427. It is interesting to note that before this list was complete, an initial upper bound was set for the size of the discriminant of imaginary quadratic fields K with the class number equal to 2. This bound was |d(K)| < 101030 . Stark’s paper [45] found all of the fields, and it is interesting to note that, in fact, |d(K)| ≤ 427. There is a striking difference to consider when looking for HFDs that occur as orders in rings of algebraic integers, for unlike UFDs, HFDs do not have to be integrally closed. UFDs that occur as orders must occur as the full ring of algebraic integers (and in some sense, this may make them easier to find, since the tools generally used in this vein become more unwieldy when one leaves the assumption “integrally closed” behind). The upshot of all this is that, in searching for HFDs in rings of integers, we do not have to restrict to the full ring of integers; we can consider proper orders. When considering which orders may contain HFDs, the following theorem is useful. It demonstrates that one can restrict the search for HFDs to orders inside rings of integers which are HFDs. It is worth noting that the following theorem is a positive answer to the question, “Is the integral closure of an HFD again an HFD?” for number theorists. Theorem 9.5. Let R be an order in a ring of algebraic integers with integral closure R. If R is an HFD, then R is an HFD.
64
Coykendall
If the search for HFDs in imaginary quadratic fields is augmented to include the nonintegrally closed case, we are done quickly. A proof of the following theorem using norms can be found in [19]. √ Theorem 9.6. The ring Z[ −3] is the unique nonintegrally closed imaginary quadratic HFD. Since we know that any nonintegrally closed HFD that is an order in an imaginary quadratic field must appear as a subring of one of the 27 imaginary HFDs (the 9 UFDs and 18 nontrivial HFDs listed above), we could prove this theorem by restricting to searching for subrings of these 27 rings of integers. It is of interest to note, however, that the above theorem was known before it was known that HFDs as orders must be subrings of integrally closed HFDs (see [19] for a direct result or [31] for at least an implicit one). The proof of this theorem in [19] utilizes the norm, and since in the case of imaginary quadratic fields, the norm is positive definite, the proof is rather quick and clean (it basically depends only upon representing certain integers via the norm form). But it should be noted that although perhaps elegant in this case, generalizing this technique to more general fields (even real quadratic fields) is fraught with difficulties because of the difficulty determining integer representations when the form may take on negative values (and it also should be pointed out that even for relatively small degree fields, the norm form becomes quite large and hard to handle very quickly). Despite the computational difficulties inherent in actually applying the norm, the above discussion and results beg the question as to how much information can be obtained by looking at factorizations from the point of view of norms. We begin by recalling a concept known as elasticity. Definition 9.7. Let S be an atomic set (that is, every element of S can be factored into irreducible elements of S). We define the elasticity of S to be n |α1 α2 · · · αn = β1 β2 · · · βm } m where αi , βj are irreducible elements of S for all i, j. ρ(S) = sup{
Basically, elasticity is a global measure of how long ratios of differing (yet equal) factorizations in S can be. The definition that we give slightly generalizes the definition of elasticity of a domain given in [46] and studied in (among others) [12, 28, 29, 30]. Here is a theorem that has appeared in a paper by Valenza [46] and was improved by Narkiewicz [36]. Theorem 9.8. Let R be a ring of algebraic integers. Then ρ(R) = D 2 where D is the Davenport constant of the class group of R if R is not a UFD (and if R is a UFD, then ρ(R) = 1). We remind the reader that the Davenport constant is the invariant of a finite abelian group G that is the smallest positive integer, n, such that any sequence of n (not necessarily distinct) elements of G has a subsequence that sums to 0. The Davenport constant has been studied rather extensively in the realm of pure group theory and has become a topic of much interest in commutative algebra because of its natural connection with factorization. There are many remaining open questions relating to the Davenport constant (e.g., “Is there a closed form representation of
Extensions of Half-Factorial Domains: A Survey
65
the Davenport constant?”). The answers to many of these questions would have far-reaching ramifications in factorization theory. For a more in-depth look at the theory of the Davenport constant and some of its applications, see [12, 13, 26]. We now produce a theorem that is useful in determining factorization behavior in rings of integers. This theorem is a hybrid of a couple of theorems that can be found in [16] and [20]. Theorem 9.9. Let F/Q be a Galois extension, R the ring of algebraic integers of F , and S the multiplicative set of integral norms from R to Z. Then R is an HFD if and only if ρ(S) = 1, and additionally, R is a UFD if and only if S has unique factorization into irreducibles. It should be noted that, in general, for Galois extensions we have that ρ(R) ≥ ρ(S). Perhaps this is not too surprising since one would expect that the set of norms would lose some of the factorization information that is contained in R. It is a subtle point that although ρ(R) ≥ ρ(S) in general, one cannot lose “too much” information in the sense that ρ(R) = 1 if and only if ρ(S) = 1. We would also like to highlight that the “Galois” assumption is very necessary here. In the non-Galois case, an example of a non-Galois extension with normal closure having Galois group S5 can be produced to show the failure of this theorem in general. Mainly because of its more complicated unit structure, the real case cannot be disposed of as easily as the imaginary case. We supply the following conjecture. Conjecture 9.10. There are infinitely many real quadratic HFDs (even inside √ Z[ 2]). This result makes use of the “boundary map” which we define below. Definition 9.11. Let R be an HFD with quotient field K. We define the boundary map ∂R : K \ {0} −→ Z via ∂R (α) = n − k ···πn with each πi , ξj ∈ Irr(R). In the where α ∈ K \ {0} is of the form α = πξ11πξ22···ξ k case that R = K we declare that ∂R ≡ 0.
The boundary map is a homomorphism from the multiplicative group K \ {0} to the additive group Z. The definition of the boundary map assumes that the domain, R, is an HFD and this is a necessary (and sufficient) condition for the boundary map to be well-defined. In Zaks’ paper [48] a function called the length function was defined. A length function is a function from the nonzero nonunits of R to the natural numbers such that f (st) = f (s) + f (t) for all s, t nonzero, nonunit elements of R. Of course, HFDs are precisely the domains which admit a well-defined length function such that f (x) = 1 for all irreducible elements x ∈ R. The boundary map may be thought of as a natural generalization of this length function to a homomorphism from the set of nonzero elements of the quotient field of R to the integers. In [18], the boundary map proved to be a useful tool in showing that, in the case of orders in rings of algebraic integers, the integral closure of an HFD is again an HFD. Since the time of the paper [18], more work has been done on exploring
66
Coykendall
properties of the boundary map and attempts have been made, with some success, to glean properties of overring behavior of HFDs. One recent avenue of interest is the so-called “boundary valuation domains” introduced by J. Maney. Definition 9.12. Let R be an HFD with quotient field K and boundary map ∂R . R is called a boundary valuation domain if for all α ∈ K such that ∂R (α) = 0, either α or α−1 is an element of R. This definition was motivated by an attempt to understand the overring behavior of HFDs in the spirit of “ordinary” valuation domains. A good example of a boundary valuation domain is any Noetherian valuation domain, and a more general example is given by the construction F + xK[[x]], where F K are fields. In [34], many interesting properties of the boundary valuation domains are explored, and insights into the overring behavior of HFDs are obtained. Additionally, boundary valuation domains are completely characterized using groups of divisibility. Recently, Maney has also shown that the class of boundary valuation domains coincides with the class of atomic pseudo-valuation domains. We close this section by pointing to some interesting recent work along these lines. In a fairly recent sequence of papers [38, 39, 40, 41] M. Picavet-L’Hermitte has done some striking work (often utilizing t-closedness, seminormality, and the concept of weak factoriality) that has advanced the understanding of the factorization behavior in orders of rings of integers. Finally, we leave the reader with a list of questions that the present author would like to see answered. This list of questions is by no means exhaustive (and is motivated by the present author’s current tastes). There are myriad interesting open questions with respect to the structure and behavior of HFDs (and certainly many, many more in factorization theory in general). It seems clear that despite recent vigorous progress, factorization theory has very far to go. Questions: 1. If R[x] is an HFD, does it follow that R[x, y] is an HFD? (Note: it is known that the answer to this is “yes” if R is Noetherian.) 2. If R[[x]] is an HFD, then is R[[x, y]] an HFD? (Note: this one might be quite difficult; the analogous question for UFDs has been open for nearly 40 years [43].) 3. If the integral closure of an HFD is atomic, then is it an HFD? 4. Find a general ideal-theoretic characterization of HFDs (if it can be done). 5. If R is an HFD, find general conditions for which R[[x]] is an HFD. 6. Classify all (non-Noetherian) polynomial HFDs. 7. Under what conditions is an affine ring an HFD? √ 8. Is there an infinite number of (real) quadratic HFDs (inside Z[ 2])? 9. Find a closed-form representation of the Davenport constant (if one exists).
Extensions of Half-Factorial Domains: A Survey
67
10. Characterize the relationship between the elasticity of an order in a ring of integers and the elasticity of its set of norms. (Note: this is only partially known even in the case that the order is a full ring of integers and its quotient field is Galois over Q.)
Bibliography [1] D.D. Anderson, Factorization in Integral Domains, Lecture Notes in Pure and Applied Mathematics, 189 (1997), Marcel Dekker, New York. [2] D.D. Anderson, D.F. Anderson and M. Zafrullah, Factorization in integral domains, J. Pure Appl. Algebra 69 (1990), 1–19. [3] D.D. Anderson, D.F. Anderson and M. Zafrullah, Factorization in integral domains, II, J. Algebra 152 (1992), 78–93. [4] D.D. Anderson and J.L. Mott, Cohen-Kaplansky domains: integral domains with a finite number of irreducible elements, J. Algebra 148 (1992), 17–41. [5] D.F. Anderson, S.T. Chapman and W.W. Smith, Some factorization properties of Krull domains with infinite cyclic divisor class group, J. Pure Appl. Algebra 96 (1994), 97–112. [6] D.F. Anderson, S.T. Chapman and W.W. Smith, On Krull half-factorial domains with infinite cyclic divisor class group, Houston J. Math. 20 (1994), 561–570. [7] D.F. Anderson, S.T. Chapman and W.W. Smith, Overrings of half-factorial domains, Canad. Math. Bul. 37 (1994), 437–442. [8] D.F. Anderson, S.T. Chapman and W.W. Smith, Overrings of half-factorial domains, II, Comm. Algebra 23 (1995), 3961–3976. [9] D.F. Anderson and J. Park, Locally half-factorial domains, Houston J. Math. 23 (1997), 617–630. [10] V. Barucci, L. Izelgue and S.E. Kabbaj, Some factorization properties of A + XB[X] domains, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker, 185 (1997), 69–78. [11] L. Carlitz, A characterization of algebraic number fields with class number two. Proc. Amer. Math. Soc. 11 (1960), 391–392. [12] S.T. Chapman, On the Davenport constant, the cross number and their application in factorization theory, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker, 171 (1995), 167–190. 68
Extensions of Half-Factorial Domains: A Survey
69
[13] S.T. Chapman and A. Geroldinger, Krull domains and monoids, their sets of lengths and associated combinatorial problems, Lecture Notes in Pure and Applied Mathematics, Marcel-Dekker, 189 (1997), 73–112. [14] S.T. Chapman and W.W. Smith, Factorization in Dedekind domains with finite class group, Israel J. Math 71 (1990), 65–95. [15] S.T. Chapman and W.W. Smith, On the HFD, CHFD and k-HFD properties in Dedekind domains, Comm. Algebra 20 (1992), 1955–1987. [16] J. Coykendall, Normsets and determination of unique factorization in rings of algebraic integers, Proc. Amer. Math. Soc. 124 (1996), no. 6, 1727–1732. [17] J. Coykendall, A characterization of polynomial rings with the half-factorial property, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker, 189 (1997), 291–294. [18] J. Coykendall, The half-factorial property in integral extensions, Comm. Algebra 27 (1999), 3153–3159. [19] J. Coykendall, Half-factorial domains in quadratic fields, J. Algebra 235 (2001), 417–430. [20] J. Coykendall, Elasticity properties preserved in the normset, J. Number Theory 94 (2002), no. 2, 213–218. [21] J. Coykendall, On the integral closure of a half-factorial domain, J. Pure Appl. Algebra 180 (2003), 25–34. [22] J. Coykendall, The half-factorial property in power series rings, preprint. [23] J. Coykendall, T. Dumitrescu and M. Zafrullah, The half-factorial property and domains of the form A + xB[x], submitted. [24] J. Coykendall and J. Dover, Sets with few intersection numbers from Singer subgroup orbits, European J. Combin. 22 (2001), no. 4, 455–464. [25] J. Coykendall and M. Zafrullah, AP-domains and unique factorization, J. Pure Appl. Algebra 189 (2004), 27–35. [26] A. Geroldinger and R. Schneider, On Davenport’s Constant, J. Combin. Theory Ser. A 61 (1992), 147–152. [27] R. Gilmer, W. Heinzer and W.W. Smith, On the distribution of prime ideals within the ideal class group, Houston J. Math. 22 (1996), 51–59. [28] N. Gonzalez, Elasticity and ramification, Comm. Algebra 27 (1999), 1729–1736. [29] N. Gonzalez, Elasticity of A + XB[X] domains, J. Pure Appl. Algebra 138 (1999), 119–137. [30] N. Gonzalez, S. Pellerin and R. Robert, Elasticity of A+ XI[X] domains where A is a UFD, J. Pure Appl. Algebra 160 (2001), no. 2-3, 183–194.
70
Coykendall
[31] F. Halter-Koch, Factorization of Algebraic Integers, Ber. Math. Stat. Sektion im Forschungszentrum 191 (1983). [32] I. Kaplansky. Commutative Rings. University of Chicago Press, 1974. [33] H. Kim, Examples of half-factorial domains, Canad. Math. Bull. 43 (2000), no. 3, 362–367. [34] J. Maney, Boundary valuation domains, J. Algebra 273 (2004), 373–383. [35] W. Narkiewicz, Elementary and analytic theory of algebraic numbers, SpringerVerlag, 1990. [36] W. Narkiewicz, A note on elasticity of factorizations, J. Number Theory 51 (1995), no. 1, 46–47. [37] S. Pellerin and R. Robert, Elasticity of A + XI[X] domains where A is a Dedekind domain, J. Pure Appl. Algebra 176 (2002), no. 2-3, 195–212. [38] M. Picavet-L’Hermitte, Some remarks on half-factorial orders, Rend. Circ. Mat. Palermo 52 (2003), no. 2, 297–307. [39] M. Picavet-L’Hermitte, Weakly factorial quadratic orders, Arab. J. Sci. Eng. Sect. C Theme Issues 26 (2001), no. 1, 171–186. [40] M. Picavet-L’Hermitte, Factorization in some orders with a PID as integral closure, Algebraic number theory and Diophantine analysis (Graz, 1998), 365– 390, de Gruyter, Berlin, 2000. [41] M. Picavet-L’Hermitte, Seminormality and t-closedness of algebraic orders, Lecture Notes in Pure and Applied Mathematics, Marcel Dekker, 205 (1999), 521–540. [42] M. Roitman, Polynomial extensions of atomic domains, J. Pure Appl. Algebra 87 (1993), 187–199. [43] P. Samuel, On unique factorization domains, Illinois J. Math. 5 (1961), 1–17. [44] H.M. Stark, A complete determination of the complex quadratic fields of classnumber one, Michigan Math. J. 14 (1967), 1–27. [45] H.M. Stark, On complex quadratic fields with class-number two, Math. Comp. 29 (1975), 289–302. [46] R.J. Valenza, Elasticity of factorization in number fields, J. Number Theory 36 (1990), no. 2, 212–218. [47] A. Zaks, Half-factorial domains, Bull. Amer. Math. Soc. 82 (1976), 721–723. [48] A. Zaks, Half-factorial domains, Israel J. of Math. 37(1980), 281-302.
Chapter 4
C-Monoids and Congruence Monoids in Krull Domains by
Franz Halter-Koch1 Abstract Only recently, several types of auxiliary monoids were used for the investigation of the arithmetic of congruence monoids in Dedekind domains and of noetherian domains satisfying some natural finiteness conditions. In this chapter, we introduce C-monoids as a common generalization of all these types of auxiliary monoids and investigate their algebraic and arithmetical properties. We discuss congruence monoids in Krull domains as examples of arithmetical interest.
1
Introduction
In a recent paper [9], devoted to the arithmetic of congruence monoids in Dedekind domains, we introduced abstract congruence monoids (AC-monoids) and C0 monoids as appropriate tools for the arithmetical investigations of the more complicated arithmetically interesting objects. A similar concept (that of a Z-monoid) was used by W. Hassler [17] for the investigation of the multiplicative arithmetic of a large class of finitely generated integral domains. In this chapter, we introduce C-monoids as a common generalization of C0 -, Z- and (all interesting) AC-monoids. C-monoids have a nice algebraic structure: They are v-noetherian (Theorem 4.8) and their complete integral closures are Krull monoids with finite class group and have a nonempty conductor (Theorem 4.6). Every Krull monoid with finite class group is a C-monoid (Theorem 4.7). The arithmetically most important examples of C-monoids are congruence monoids in Krull domains. Among them are the congruence monoids in Dedekind domains investigated in [9] and the noetherian integral domains considered in [17]. 1 This
work was supported by the Austrian Science Fund FWF (Project-Nr. P16770-N12)
71
72
Halter-Koch
By means of a suitable transfer principle, the arithmetical investigation of a C-monoid can essentially be reduced to that of a C0 -monoid (see [8, Theorem 7.2]). Apart from the arithmetical results already proved in [9], we present here a necessary and sufficient criterion for a C-monoid to have finite elasticity (Theorem 5.1), which is even new for congruence monoids of natural numbers (see [8, Theorem 7.8]). For finitely generated integral domains in general, a stronger criterion for finite elasticity was proved by F. Kainrath [18, Theorem 6.1]. This chapter is organized as follows. In Section 2 we fix our notations concerning monoids and factorization theory. In Section 3 we recall and refine the concept of class semigroups. Section 4 is devoted to the algebraic theory of C-monoids and contains the main results of this chapter. In Section 5 we present a criterion for the finiteness of the elasticity of a C-monoid, and finally in Section 6 we discuss congruence monoids in Krull domains as a main application of this new concept.
2
Preliminaries and Notations
Let N denote the set of positive integers and N0 = N ∪ {0}. For m, n ∈ Z with m ≤ n, we set [m, n] = {x ∈ Z | m ≤ x ≤ n}. For a subset X ⊂ N0 , we denote by gcd(X) ∈ N0 its greatest common divisor. In particular, gcd(X) = 0 if and only if X ⊂ {0}. For any set X, we denote by |X| ∈ N0 ∪ {∞} its cardinality. For convenience and to fix notations, we recall some notions from the theory of monoids and nonunique factorizations which we use in this chapter. Our main reference for the theory of divisibility and the theory of v-ideals is [16, Ch. 10 and 11]. For the theory of Krull monoids we refer to [16, Ch. 20, 22 and 23] and to the survey article [3]. For the basic concepts of nonunique factorizations, we refer to the survey articles in [1], in particular to [7] and [15]. Basic notions. By a semigroup we mean a nonempty set with a commutative and associative law of composition possessing a unit element. By a monoid we mean a cancellative semigroup. Unless stated otherwise, we use multiplicative notation and denote the unit element by 1. For subsets A, B of a monoid H, we set AB = {ab | a ∈ A , b ∈ B}, and for n ∈ N, we set An = A · . . . · A. Semigroup and monoid homomorphisms are assumed to respect the unit element. Subsemigroups and submonoids are assumed to contain the unit element.
For each monoid H, we fix a quotient group q(H) of H, and we denote by H the complete integral closure of H in q(H), consisting of all elements x ∈ q(H) for which there exists some c ∈ H such that cxn ∈ H for all n ∈ N. For subsets X, Y ⊂ q(H), we define (X : Y ) = {z ∈ q(H) | zY ⊂ X}. If H ⊂ D is a submonoid, we tacitly assume that q(H) ⊂ q(D). We denote by H × the group of invertible elements of H and by Hred = {aH × | a ∈ H} the associated reduced monoid of H. We call H reduced , if H × = {1} (and in this case we will identify H with Hred ). For a monoid homomorphism ϕ : H → D we denote by ϕred : Hred → Dred the induced homomorphism of reduced monoids, given by ϕred (aH × ) = ϕ(a)D× . For an integral domain R, we denote by R• = R \ {0} its multiplicative monoid. Let H be a monoid and a, b ∈ H. We call a a divisor of b and we write a | b , if b ∈ aH. We call a and b associated and write a b , if aH × = bH × . An element u ∈ H is called an atom if u ∈ / H × , and for all a, b ∈ H, u = ab
C-Monoids and Congruence Monoids in Krull Domains
73
implies a ∈ H × or b ∈ H × . We denote by A(H) the set of all atoms of H, and we call the monoid H atomic , if every a ∈ H \ H × is a product of atoms. An element p ∈ H is called a prime , if H \ pH is a submonoid of H, and H is called factorial , if every a ∈ H \ H × is a product of primes. Every prime is an atom, and a monoid is factorial if and only if it is atomic and every atom is a prime. If H is atomic and p ∈ H is a prime, then every a ∈ q(H) has a representation a = pn bc−1 , where b, c ∈ H, p bc and n ∈ Z. The exponent n is uniquely determined by the classes aH × and pH × in Hred , and we call n = vp (a) the p-adic value of a. The map vp : q(H) → Z is a surjective group homomorphism, called the p-adic valuation. If P is a set of primes of an atomic monoid H and x ∈ q(H), then suppP (x) = {p ∈ P | vp (x) = 0} is called the support of x (in P ). Free monoids. For a set P , we denote by F (P ) the free (abelian) monoid with basis P . F (P ) is a reduced factorial monoid and P is the set of primes of F (P ). Every nonempty subset X of F (P ) possesses a unique greatest common divisor, denoted by gcd(X) ∈ F(P ). Every a ∈ F(P ) has a unique representation in the form pνp , where νp ∈ N0 and νp = 0 for all but finitely many p ∈ P , a= p∈P
and then νp = vp (a) for all p ∈ P . Sets of lengths and elasticity. Let H be an atomic monoid. For a ∈ H \ H × , we denote by L(a) = {r ∈ N | a = u1 · . . . · ur with u1 , . . . , ur ∈ A(H)} the set of lengths of a . The monoid H is called a BF-monoid , if L(a) is finite for all a ∈ H \ H × . If H is a BF-monoid and a ∈ H, then ρ(a) =
max L(a) ∈ Q>0 min L(a)
is called the elasticity of a and ρ(H) = sup{ρ(a) | a ∈ H \ H × } the elasticity of H. The elasticity is one of the best investigated invariants of nonunique factorizations (see [2] for a survey). Submonoids and class groups. Let D be a monoid and H ⊂ D a submonoid. For x ∈ q(D), we set [x]D/H = xq(H) ∈ q(D)/q(H); we call D/H = {[a]D/H | a ∈ D} the class monoid and q(D)/q(H) = q(D/H) the class group of D modulo H. If H ⊂ D× is a subgroup, then [a]D/H = aH ∈ q(D)/H for all a ∈ D, there are natural epimorphisms D → D/H → D/D× = Dred ⊂ q(D)/D× = q(Dred ), and Hred = H/H × is a submonoid of D/H × . In this special case, we write D/H multiplicatively. In the general situation however, we use additive notation for D/H, so that [ab]D/H = [a]D/H + [b]D/H for all a, b ∈ D, and [1]D/H is the zero element of D/H. A submonoid H ⊂ D is called • cofinal , if aD ∩ H = ∅ for all a ∈ D (equivalently, D/H = q(D/H)). • saturated , if q(H) ∩ D = H (equivalently, H = {a ∈ D | [a]D/H = [1]D/H }).
74
Halter-Koch • divisor-closed , if a ∈ H, b ∈ D and b | a implies b ∈ H (equivalently, yD ∩ H = yH for all y ∈ D).
If H ⊂ D is divisor-closed, then H ⊂ D is saturated, A(H) = A(D)∩H, and factorizations of an element of H into atoms of H amounts to the same as factorizations into atoms of D. A subset E ⊂ H is a divisor-closed submonoid if and only if H \ E is a prime s-ideal of H [16, Definition 6.1]. For any subset E ⊂ H, we denote by [[E]] the smallest divisor-closed submonoid of H containing E. In particular, [[∅]] = H × . Divisor homomorphisms, divisor theories and Krull monoids. A monoid homomorphism ϕ : H → D is called a divisor homomorphism , if ϕ(a) | ϕ(b) implies a | b for all a, b ∈ H. If H ⊂ D is a submonoid, then the injection H → D is a divisor homomorphism if and only if H is a saturated submonoid of D. An arbitrary monoid homomorphism ϕ : H → D is a divisor homomorphism if and only if ϕred : Hred → Dred is a divisor homomorphism. A divisor theory is a divisor homomorphism ϕ : H → F (P ) into a free monoid F (P ) such that for every p ∈ P there exists a finite set E ⊂ H such that p = gcd(ϕ(E)). A monoid homomorphism ϕ : H → F (P ) is a divisor theory if and only ∼ if it induces an isomorphism Hred → ϕ(H) and the injection ϕ(H) → F (P ) is a divisor theory. If ϕ : H → F (P ) and ϕ : H → F (P ) are divisor theories, then there ∼ exists a unique isomorphism Φ : F (P ) → F (P ) such that Φ ◦ ϕ = ϕ . A monoid H is a Krull monoid , if it possesses a divisor theory. Every saturated submonoid of a Krull monoid is a Krull monoid. If ∂ : H → F is a divisor theory, then ∂ is cofinal, and we call C(H) = F/∂(H) the (divisor) class group of H. It is (up to canonical isomorphisms) uniquely determined by H. A monoid H is factorial if and only if it is a Krull monoid with trivial divisor class group. A monoid H is a Krull monoid if and only if Hred is a Krull monoid, and then C(H) = C(Hred ). An integral domain R is a Krull domain if and only if R• is a Krull monoid, and then C(R• ) = C(R) is the divisor class group of R as defined in [5]. Products. For two monoids H1 , H2 , we denote by H1×H2 their direct product, and we view H1 and H2 as (divisor-closed) submonoids of H = H1×H2 . Then every a ∈ H has a unique factorization in the form a = a1 a2 with a1 ∈ H1 and a2 ∈ H2 . We have (H1×H2 )× = H1××H2× , q(H1×H2 ) = q(H1 )×q(H2 ) and H 1 ×H2 = H1×H2 . If H1 ⊂ D1 and H2 ⊂ D2 are submonoids, then H1×H2 ⊂ D1×D2 , and there is an ∼ isomorphism D1 /H1×D2 /H2 → D1×D2 /H1×H2 , given by a1 q(H1 ), a2 q(H2 ) → a1 a2 q(H1 ×H2 ). Also, H1 ×H2 is saturated [ cofinal ] in D1 ×D2 if and only if both H1 ⊂ D1 and H2 ⊂ D2 are saturated [ cofinal ]. A monoid H is factorial and P ⊂ H is a maximal set of representatives of pairwise nonassociated primes of H if and only if H = H × × F(P ). Every Krull monoid H splits in the form H = H × ×H0 , where H0 is a reduced Krull monoid, and there is a divisor theory H0 → F (P ). If H1 and H2 are Krull monoids with divisor theories ϕ1 : H1 → F1 and ϕ2 : H2 → F2 , then H1 × H2 is a Krull monoid, and ϕ1 × ϕ2 : H1 × H2 → F1 × F2 is a divisor theory.
C-Monoids and Congruence Monoids in Krull Domains
3
75
Class Semigroups
Class semigroups were introduced in [9, Definition 4.1] as a appropriate refinement of the usual concept of ordinary class groups in algebraic number theory. Later on, in Propositions 3.6 and 3.7 we shall prove that, for saturated and cofinal submonoids, the two concepts coincide. We recall the definition given in [9] in a refined version. Definition 3.1. Let D be a monoid, S ⊂ D a submonoid and A ⊂ D a subset. Two elements y, y ∈ D are called (A, S)-equivalent, if y −1 A ∩ S = y −1 A ∩ S (equivalently: if x ∈ S, then xy ∈ A if and only if xy ∈ A). By definition, (A, S)-equivalence is an equivalence relation on D. For each y ∈ D, we denote by [y]SA the (A, S)-equivalence class of y. For a subset T ⊂ D, we define CT (A, S) =
[y]SA | y ∈ T , and in particular C(A, S) = CS (A, S)
∗
and C (A, S) = C(S\S × )∪{1} (A, S). We shall prove in Lemma 3.2 that (A, S)equivalence is a congruence relation on S. The quotient law on C(A, S) will be written additively, that is, [y1 ]SA + [y2 ]SA = [y1 y2 ]SA for all y1 , y2 ∈ S. Endowed with the quotient law, C(A, S) is an additive abelian semigroup with zero element [1]SA , and the canonical map S → C(A, S) , defined by y → [y]SA , is an epimorphism. Consequently, if T ⊂ S is a submonoid, then CT (A, S) is a subsemigroup of C(A, S). In particular, C ∗ (A, S) is a subsemigroup of C(A, S). We call C(A, S) the class semigroup and C ∗ (A, S) the reduced class semigroup of A in S. Lemma 3.2. Let D be a monoid, S ⊂ D a submonoid and A ⊂ D a subset. 1. (A, S)-equivalence is a congruence relation on S. 2. For every subset T ⊂ D, there is a bijective map CT (A, S) → {y −1 A ∩ S | y ∈ T } ,
given by
[y]SA → y −1 A ∩ S.
3. If y ∈ D and [y]SA ∩ A = ∅, then [y]SA ⊂ A. Proof. 1. We must prove that, for all x, y, y ∈ S, [y]SA = [y ]SA implies [xy]SA = [xy ]SA . Thus let x, y, y ∈ S be such that y −1 A ∩ S = y −1 A ∩ S. By symmetry, it suffices to prove that (xy)−1 A ∩ S ⊂ (xy )−1 A ∩ S. If z ∈ (xy)−1 A ∩ S, then zx ∈ y −1 A ∩ xS = (y −1 A ∩ S) ∩ xS = (y −1 A ∩ S) ∩ xS = (y −1 A ∩ S) ∩ xS, and therefore z ∈ (xy )−1 A ∩ S. 2. By the very definition of (A, S)-equivalence, for all y, y ∈ T we have [y]SA = S [y ]A if and only if y −1 A ∩ S = y −1 A ∩ S. 3. If y ∈ [y]SA ∩ A and z ∈ [y]SA , then [z]SA = [y ]SA . Hence 1 ∈ y −1 A ∩ S = −1 z A ∩ S, and thus z ∈ A. Lemma 3.3. Let H ⊂ D be a submonoid. D × ∗ 1. [u]D H = [1]H for all u ∈ H , C (H, D) = C(D\D× )∪H × (H, D), and there is a × × monomorphism Ψ : D /H → C(H, D), given by Ψ(uH × ) = [u]D H for all u ∈ D× .
76
Halter-Koch 2. C(H, D) is finite if and only if both C ∗ (H, D) and D× /H × are finite.
3. There is an isomorphism Φ : C(H, D) → C(Hred , D/H × ), given by Φ [y]D H =
D/H × [yH × ]Hred for all y ∈ D. It satisfies Φ C ∗ (H, D) = C ∗ (Hred , D/H × ). 4. If U ⊂ D× is a subgroup, then there is an epimorphism
D C(HU, D), given by Ψ [y]H = [y]D HU for all y ∈ D.
Ψ : C(H, D) →
5. If D ⊂ D is a submonoid and H = H ∩ D , then there is an epimorphism D CD (H, D) → C(H , D ), given by [y]D H → [y]H for all y ∈ D . In particular, ∗ × × ∗ if C (H, D) is finite and D = D ∩ D , then C (H , D ) is also finite. Proof. 1. The map Ψ0 : D× → C(H, D), defined by Ψ0 (u) = [u]D H , is a group homomorphism, and we shall prove that Ker(Ψ0 ) = H × . Then it follows in particular D × that [u]D and C ∗ (H, D) = C(D\D× )∪H × (H, D). H = [1]H for all u ∈ H D If u ∈ D× , then u−1 H ∩ D = u−1 H. Therefore [u]D H = [1]H holds if and only if u−1 H = H, which is equivalent to u ∈ H × . 2. By 1., since C(H, D) = C ∗ (H, D) ∪ Ψ(D× /H × ). 3. If ρ : D → D/H × denotes the canonical epimorphism, then ρ(D× ) = (D/H × )× and ρ(H) = Hred . For all y, y ∈ D, we have y −1 H ∩ D = y −1 H ∩ D if and only if ρ(y)−1 ρ(H) ∩ ρ(D) = ρ(y )−1 ρ(H) ∩ ρ(D). Hence Φ is an isomorphism as asserted. 4. It is sufficient to prove that (H, D)-equivalence on D implies (HU, D)equivalence. We must prove that, for all y, y ∈ D, y −1 H ∩ D = y −1 H ∩ D entails y −1 HU ∩ D ⊂ y −1 HU ∩ D. Thus suppose that y −1 H ∩ D = y −1 H ∩ D and z ∈ y −1 HU ∩ D. Then zy = cu for some u ∈ U and c ∈ H, and therefore u−1 z ∈ y −1 H ∩ D = y −1 H ∩ D, which implies z ∈ y −1 HU ∩ D.
D D D 5. We shall prove that, for all y, y ∈ D , [y]D H = [y ]H implies [y]H = [y ]H . −1 −1 Thus suppose that y, y ∈ D and y H ∩ D = y H ∩ D. By symmetry, it suffices to prove that y −1 H ∩ D ⊂ y −1 H ∩ D . If z ∈ y −1 H ∩ D , then z ∈ y −1 H ∩ D = y −1 H ∩D, hence y z ∈ H ∩D = H and z ∈ y −1 H ∩D . Therefore the assignment D ∗ [y]D H → [y]H defines an epimorphism CD (H, D) → C(H , D ), and C (H , D ) is the ∗ × × image of CD \D (H, D), which is a subset of C (H, D), if D \ D ⊂ D \ D× .
The following Lemma 3.4 justifies the subsequent restriction to cofinal submonoids. Lemma 3.4. Let H ⊂ D be a submonoid and D0 = {y ∈ D | yD ∩ H = ∅}. 1. D0 is the greatest monoid D such that H ⊂ D ⊂ D and H is cofinal in D. 2. D0× = D× and q(H) ∩ D = q(H) ∩ D0 . In particular, H is saturated in D if and only if H is saturated in D0 .
C-Monoids and Congruence Monoids in Krull Domains
77
∼ 0 = 3. There is an isomorphism Φ : C(H, D0 ) → CD0 (H, D) satisfying Φ [y]D H D [y]D H for all y ∈ D0 . If y0 ∈ D \ D0 , then C(H, D) = CD0 (H, D) [y0 ]H
and C ∗ (H, D) = Φ C ∗ (H, D0 ) [y0 ]D H . Proof. 1. Obvious by the definition. 2. If u ∈ D× , then uu−1 = 1 ∈ H implies u ∈ D0× . If a ∈ q(H) ∩ D, then there exists some y ∈ H such that ay ∈ H and thus a ∈ D0 . 3. It is easily checked that, for all y, y ∈ D0 , we have y −1 H ∩ D = y −1 H ∩ D if and only if y −1 H ∩D0 = y −1 H ∩D0 . Thus Φ is an isomorphism as asserted. Since y0−1 H ∩ D = ∅ for all y0 ∈ D \ D0 , Lemma 3.2.2 implies C(H, D) = CD0 (H, D) [y0 ]D H . Hence we obtain
C ∗ (H, D) = C(D0 \D× )∪{1} (H, D) ∪ CD\D0 (H, D) = Φ C ∗ (H, D0 ) [y0 ]D H . 0
Lemma 3.5. Let H1 ⊂ D1 and H2 ⊂ D2 be cofinal submonoids. ∼
1. There is an isomorphism Φ : C(H1 ×H2 , D1 ×D2 ) → C(H1 , D1 ) × C(H2 , D2 ) satisfying
D1 D2 1×D2 Φ [y1 y2 ]D = [y for all (y1 , y2 ) ∈ D1 ×D2 . ] , [y ] 1 H1 2 H2 H1×H2 2. C ∗ (H1 ×H2 , D1 ×D2 ) is finite if and only if the following two conditions are satisfied: (a) C ∗ (H1 , D1 ) and C ∗ (H1 , D1 ) are both finite. (b) Either D1 = D1× , or D2 = D2× , or the groups D1× /H1× and D2× /H2× are both finite. Proof. 1. If (y1 , y2 ) ∈ D1 × D2 , then (y1 y2 )−1 (H1 × H2 ) ∩ (D1 × D2 ) = (y1−1 H1 ∩ D1 ) × (y2−1 H2 ∩ D2 ) = ∅, since H1 ⊂ D1 and H2 ⊂ D2 are cofinal. Thus we obtain, for all (y1 , y2 ), (y1 , y2 ) ∈ D1 × D2 , (y1 y2 )−1 (H1 × H2 ) ∩ (D1 × D2 ) = (y1 y2 )−1 (H1 ×H2 ) ∩ (D1 ×D2 ) if and only if y1−1 H1 ∩ D1 = (y1 )−1 H1 ∩ D1 and y2−1 H2 ∩ D2 = (y2 )−1 H2 ∩ D2 . Therefore there is an isomorphism Φ as asserted.
2. Since (D1×D2 ) \ (D1××D2× ) = (D1 \ D1× )×(D2 \ D2× ) (D1 \ D1× )×D2×
D1× × (D2 \ D2× ) , the isomorphism Φ given in 1. maps C ∗ (H1 × H2 , D1 × D2 ) onto
C = C ∗ (H1 , D1 )×C ∗ (H2 , D2 ) ∪ CD1 \D× (H1 , D1 )×CD× (H2 , D2 ) ∪ 1 2
CD× (H1 , D1 )×CD2 \D× (H2 , D2 ) . 1
2
By Lemma 3.3.1 there are isomorphisms CD× (H1 , D1 ) ∼ = D1× /H1× and CD2× (H2 , D2 ) 1 ∼ = D2× /H2× . Hence C is finite if and only if (a) and (b) are satisfied.
78
Halter-Koch
Proposition 3.6. Let H ⊂ D be a submonoid. 1. C(H, D) is a group if and only if C ∗ (H, D) is a group, and in this case we have either D = D× or C(H, D) = C ∗ (H, D). 2. If C(H, D) is a group, then H ⊂ D is cofinal. 3. If C(H, D) is a torsion group, then H ⊂ D is cofinal and saturated. × Proof. 1. By definition, C(H, D) = C ∗ (H, D) ∪ C , where C = {[u]D H | u ∈ D } ∗ is a subgroup of C(H, D). Hence C(H, D) is a group if and only if C (H, D) is a D group. Thus suppose that D = D× , a ∈ D \ D× and u ∈ D× . Then [a]D H , [ua]H ∈ ∗ D D D ∗ C (H, D), and therefore also [u]H = [ua]H − [a]H ∈ C (H, D).
2. Let C(H, D) be a group. For every c ∈ D, there exists some c ∈ D such that D D D D D −[c]D H = [c ]H , and therefore [cc ]H = [c]H + [c ]H = [1]H , which implies cc ∈ H. 3. Let C(H, D) be a torsion group, a, b ∈ H and c ∈ D be such that a = bc. D n−1 D D Let n ∈ N be such that n[b]D ]H = [a]D H = [1]H . Then [ab H + (n − 1)[b]H = D D D n−1 ∈ H implies c ∈ H. Hence H ⊂ D is saturated. [c]H + n[b]H = [c]H , and ab Proposition 3.7. Let D be a monoid and H ⊂ D a cofinal submonoid. 1. There are epimorphisms θ : C(H, D) → D/H and θ∗ : C ∗ (H, D) → D/D× H ,
∗ D given by θ [y]D H = [y]D/H for all y ∈ D, and θ ([y]H = [y]D/D × H for all y ∈ (D \ D× ) ∪ {1}. 2. [1]D H ⊂ H ⊂ [1]D/H . 3. The following conditions are equivalent: (a) H is saturated in D. (b) [y]D H = [y]D/H ∩ D for all y ∈ D. (c) [1]D H = [1]D/H ∩ D. (d) The epimorphism θ : C(H, D) → D/H defined in 1. is an isomorphism. D Proof. 1. We assert that, for all y, y ∈ D, [y]D H = [y ]H implies yq(H) = y q(H). D D Indeed, suppose that y, y ∈ D and [y]H = [y ]H . Since H is cofinal in D, there exists some z ∈ D such that yz ∈ H. Hence y z ∈ H, and thus y y −1 = (y z)(yz)−1 ∈ q(H). Now the assignment [y]D H → [y]D/H = yq(H) defines a map θ : C(H, D) → D/H, and obviously θ is an epimorphism. Hence the map θ1 : C(H, D) → D/D× H, de× × D fined by θ1 ([y]D H ) = yD q(H), is also an epimorphism. If y ∈ D , then θ1 ([y]H ) = D ∗ ∗ ∗ × θ1 ([1]H ), and therefore θ = θ1 | C (H, D) : C (H, D) → D/D H is also an epimorphism.
C-Monoids and Congruence Monoids in Krull Domains
79
2. By Lemma 3.2.3 we obtain [1]D H ⊂ H, and by definition we have [1]D/H = q(H) ⊃ H. D D 3. (a) ⇒ (b) If y ∈ D and y ∈ [y]D H , then [y ]H = [y]H , hence [y ]D/H = [y]D/H by 1., and therefore y ∈ [y]D/H ∩ D. To prove the reverse inclusion, suppose that y ∈ [y]D/H ∩ D = yq(H) ∩ D. Then there exist u, u ∈ H such that u y = uy. By symmetry, it is sufficient to prove that y −1 H ∩ D ⊂ y −1 H ∩ D. If x ∈ y −1 H ∩ D, then xy u = xyu ∈ H. Hence xy ∈ q(H) ∩ D = H, and thus x ∈ y −1 H ∩ D. (b) ⇒ (c) and (b) ⇒ (d) are obvious. (c) ⇒ (a) If [1]D H = [1]D/H ∩ D, then 2. implies H = [1]D/H ∩ D = q(H) ∩ D, and therefore H ⊂ D is saturated. (d) ⇒ (c) If (c) fails, then [1]D H [1]D/H ∩ D by 2., and thus there exists some D D . Since [u] u ∈ [1]D/H ∩ D \ [1]D H H = [1]H and [u]D/H = [1]D/H , it follows that θ is not injective. The following example is due to A. Geroldinger. Example 3.8. To illustrate the difference between D/H and C(H, D), we consider the additive monoid H = (N × N≥6 ) ∪ {(2n , 3) , (2n , 4) , (2n + 2, 5) | n ∈ N} ∪ {(0, 0} ⊂ D = N20 . Since q(H) = q(D) = Z2 , we have D/H = 0, but nevertheless C(H, D) is infinite, since any two elements of the set {(2n , 0) | n ∈ N} are not (H, D)-equivalent. Indeed, n D n n suppose that m, n ∈ N, m ≤ n and [(2m , 0)]D H = [(2 , 0)]H . Then (2 , 3) + (2 , 0) = n+1 n m m n−m n−m , 3) ∈ H implies (2 , 3)+(2 , 0) = (2 (2 +1), 3) ∈ H, hence 2 +1 = 2l (2 for some l ∈ N and thus m = n. Note that H is a finitely primary monoid of rank 2 and exponent 6 satisfying
= D, and (6, 6) + D ⊂ H (for the theory of finitely primary monoids see [6]). H Theorem 3.9. Let D be a monoid and S ⊂ H ⊂ D submonoids such that S is saturated in H and H/S is finite. If T ⊂ D is a subset such that CT (H, D) is finite, then CT (S, D) is also finite. Proof. For y, y ∈ T , we set y ∼ y if either y −1 H ∩ D = y −1 H ∩ D = ∅ or if there exists some z ∈ y −1 H ∩ D = y −1 H ∩ D such that [zy]H/S = [zy ]H/S . Since H/S is finite and {y −1 H ∩ D | y ∈ T } is finite by Lemma 3.2.2, ∼ is an equivalence relation with only finitely many equivalence classes on T . We shall prove that, for all y, y ∈ T , y ∼ y implies y −1 S ∩ D = y −1 S ∩ D. Then {[y]D S | y ∈ T } is also finite. If y, y ∈ T and y −1 H ∩ D = y −1 H ∩ D = ∅, then y −1 S ∩ D = y −1 S ∩ D = ∅. Thus we may assume that there exists some z ∈ y −1 H ∩ D = y −1 H ∩ D such that [zy]H/S = [zy ]H/S . Then y −1 y = (zy)−1 (zy ) ∈ q(S), and since S is saturated in H, we obtain y −1 S ∩ D = y −1 (H ∩ q(S)) ∩ D = y −1 H ∩ D ∩ y −1 q(S) = y −1 H ∩ D ∩ y −1 q(S) = y −1 (H ∩ q(S)) ∩ D = y −1 S ∩ D.
80
Halter-Koch
The arithmetical importance of C ∗ (H, D) is (inter alia) revealed by the following Proposition 3.10 (see also [9, Proposition 4.5]). Proposition 3.10. Let H ⊂ D be a submonoid such that C ∗ (H, D) is finite, and D × . V = u ∈ D× [ua]D H = [a]H for all a ∈ D \ D 1. V ⊂ D× is a subgroup of finite index, H × ⊂ V , and V (H \ H × ) ⊂ H. 2. There exists some α ∈ N such that (D× : V ) | α and q 2α D ∩ H = q α (q α D ∩ H) for all q ∈ D \ D× . × ∗ Proof. 1. D× operates on the finite set C = {[a]D H | a ∈ D \ D } ⊂ C (H, D) by D D × × means of u [a]H = [ua]H for all u ∈ D and a ∈ D \ D . This operation defines a homomorphism ϕ : D× → Perm(C) into the (finite) permutation group of C, V = Ker(ϕ) is a subgroup of finite index, and H × ⊂ V by Lemma 3.3.1. If u ∈ V D and a ∈ H \ H × , then [ua]D H = [a]H ⊂ H and thus ua ∈ H by Lemma 3.2.3.
2. For every g ∈ C ∗ (H, D), there exist γg , λg ∈ N such that (λg + γg )g = λg g, and then (λg + γg )g = λg g for all γg , λg ∈ N such that γg | γg and λg ≥ λg . Let α ∈ N be such that (D× : V ) | α, γg | α and α ≥ λg for all g ∈ C ∗ (H, D). Then 2αg = αg for all g ∈ C ∗ (H, D). If q ∈ D \ D× and a ∈ D, then D D D D α D [q 2α a]D H = 2α[q]H + [a]H = α[q]H + [a]H = [q a]H ,
and thus q 2α a ∈ H if and only if q α a ∈ H.
4
Algebraic Theory of C-Monoids
Definition 4.1. Let H be a monoid. 1. H is called a C-monoid , if it is a submonoid of a factorial monoid F such that H ∩ F × = H × and C ∗ (H, F ) is finite. Then it follows by Proposition 3.10 that there exists some α ∈ N and a subgroup V ⊂ F × such that H × ⊂ V , (F × : V ) | α, V (H \ H × ) ⊂ H and q 2α F ∩ H = q α (q α F ∩ H) for all q ∈ F \ F × . We refer to these properties by saying that H is defined in F with exponent α and subgroup V ⊂ F × . 2. Let F = F × ×F(P ) be a factorial monoid and H ⊂ F a submonoid. (a) H is called dense in F , if vp (H) ⊂ N0 is a numerical monoid for all p ∈ P. (b) A subset E ⊂ P is called H-essential a ∈ H \ F ×.
if E = suppP (a) for some
(c) H is called simple in F , if every minimal H-essential subset of P is a singleton.
C-Monoids and Congruence Monoids in Krull Domains
81
Note that the conditions (a) and (c) do not depend on the particular choice of P . 3. H is called a C0 -monoid , if it is a C-monoid defined in a factorial monoid F possessing only finitely many pairwise nonassociated prime elements. By definition, every factorial monoid is a C-monoid. If H is a C-monoid defined in a factorial monoid F , then F is far from being uniquely determined by H. However, in Theorem 4.6 we shall prove that there is a canonical choice for F . Without giving details, we mention that the Z-monoids used in [17] and the ACmonoids defined in factorial monoids which were introduced in [9] are C-monoids, and that the C0 -monoids as defined above coincide with the C0 -monoids introduced in [9]. For Z-monoids, this follows immediately from the definitions, and for AC-monoids defined in a factorial monoid this is true by [9, Theorem 5.4]. The conformity of the concepts of C0 -monoids will be explained after the subsequent Theorem 4.3. The following technical Lemma 4.2 is basic for the further theory of C-monoids. Lemma 4.2. Let F = F × × F(P ) be a factorial monoid, H ⊂ F a submonoid, α ∈ N, and let ρα : F → F be defined by np ρα u p pnp −αlp =u p∈P
p∈P
for all u ∈ F × and (np )p∈P ∈ N0 , where (lp )p∈P ∈ N0 if np < 2α, and α ≤ np − αlp < 2α, if np ≥ 2α. (P )
(P )
is chosen so that lp = 0,
1. The following assertions are equivalent: (a) For all p ∈ P and a ∈ pα F , we have a ∈ H if and only if pα a ∈ H. (b) If u ∈ F and (np )p∈P , (np )p∈P ∈ N0 are such that, for each p ∈ P , either np = np or [ np ≡ np mod α and min{np , np } ≥ α ], then (P )
u
pnp ∈ H
implies
u
p∈P
pnp ∈ H .
p∈P
(c) For all x, y ∈ F we have xy ∈ H if and only if ρα (x)y ∈ H. 2. Let H be a C-monoid defined in F with subgroup V ⊂ F × and exponent α ∈ N. (a) The equivalent conditions stated in 1. hold. (b) If Q ⊂ P is H-essential, u ∈ V and (lp )p∈Q ∈ NQ , then u pαlp ∈ H . p∈Q
82
Halter-Koch (c) If H is dense in F , then every finite subset of P is contained in an H-essential subset of P . (d ) If x, y ∈ H, then suppP (x) ⊂ suppP (y) if and only if x ∈ [[y]].
Proof. 1. (a) ⇒ (b) The assertion follows by induction on n= |np − np | . p∈P
(b) ⇒ (c) The elements xy and ρα (x)y satisfy the conditions stated in (b). (c) ⇒ (a) If p ∈ P and a ∈ pα F , then ρα (pα a) = ρα (a). 2. (a) Note that 1.(a) is equivalent to p2α F ∩ H = pα (pα F ∩ H) for all p ∈ P , and this holds by Proposition 3.10.2. (b) Suppose that a ∈ H \ F × , Q = suppP (a), u ∈ V and (lp )p∈Q ∈ NQ . If a=ε pnp , where ε ∈ F × and (np )p∈Q ∈ NQ , p∈Q
then uε−α ∈ V and a ∈ H \ H × implies uε−α aα = u
pαnp ∈ H .
p∈Q
Since αnp ≡ αlp mod α and min{αnp , αlp } ≥ α for all p ∈ Q, the assertion follows by 1.(b). (c) If H is dense in F and {p1 , . . . , pd } ⊂ P , then there exist elements a1 , . . . , ad ∈ H such that vpi (ai ) > 0 for all i ∈ [1, d], and if a = a1 · . . . · ad , then {p1 , . . . , pd } ⊂ suppP (a). (d) If x ∈ [[y]], then x | y n for some n ∈ N, and therefore suppP (x) ⊂ suppP (y). Thus suppose that x, y ∈ H and E = suppP (y) ⊃ suppP (x). Then x=ε pnp and y = η p mp , p∈E
p∈E
where ε, η ∈ F × , np ∈ N0 and mp ∈ N for all p ∈ E. Let k ∈ N be such that kmp > np for all p ∈ E. Then (b) implies pα(kmp −np ) ∈ H , x−1 y kα = xα−1 (ε−1 η)α p∈E
and therefore x ∈ [[y]]. The following Theorem 4.3 characterizes C0 -monoids without referring to the class semigroup, and in Proposition 4.4 we shall see that locally C-monoids behave like C0 -monoids. Theorem 4.3 (Characterization of C0 -monoids). Let F = F × ×[p1 , . . . , ps ] be a factorial monoid with pairwise nonassociated prime elements p1 , . . . , ps , and let H ⊂ F be a submonoid such that H ∩ F × = H × . Then the following assertions are equivalent:
C-Monoids and Congruence Monoids in Krull Domains
83
(a) H is a C0 -monoid defined in F . (b) There exists some α ∈ N and a subgroup V ⊂ F × such that (F × : V ) | α, V (H \ H × ) ⊂ H, and for all j ∈ [1, s] and a ∈ pα j F we have a ∈ H if and only if pα j a ∈ H. Proof. (a) ⇒ (b) By Proposition 3.10. (b) ⇒ (a) Let {u1 , . . . , ut } ⊂ F × be a set of representatives for F ×/V , and consider the finite set B = uτ pn1 1 · . . . · pns s τ ∈ [1, t], (n1 , . . . , ns ) ∈ [0, 2α − 1]s . Let ρα : F → F be the reduction map defined in Lemma 4.2, and define ϕ : F → B by ϕ(uc) = uτ ρα (c), whenever u ∈ uτ V and c ∈ [p1 , . . . , ps ]. We assert that F × ∗ [x]F H = [ϕ(x)]H for all x ∈ F \ F . Whence in particular C (H, F ) is finite. To prove this assertion, suppose that x = uc ∈ F \ F × , where u ∈ F × and c ∈ [p1 , . . . , ps ] \ {1}. Let τ ∈ [1, t] be such that u ∈ uτ V . Then ϕ(x) = uτ ρα (c), and we must prove that for all y ∈ F we have yx ∈ H if and only if yϕ(x) ∈ H. If y = vb ∈ F , where v ∈ F × and b ∈ [p1 , . . . , ps ], then yx = uvbc, yϕ(x) = uτ vbρα (c), and by Lemma 4.2.1 we have yϕ(x) ∈ H if and only if uτ vbc ∈ H. Since bc = 1 and (uτ v)−1 (uv) ∈ V it follows that yx ∈ H if and only if yϕ(x) ∈ H. Let F = F × ×[p1 , . . . , ps ] be as in Theorem 4.3 and H ⊂ F a submonoid such that H ∩ F × = H × . Let V ⊂ F × be a subgroup and ≡ the congruence relation modulo V on F × (observe that every congruence relation on F × is of this form). Then F ×/V = F ×/ ≡, and the following two assertions are equivalent: • V (H \ H × ) ⊂ H. • For all u, v ∈ F × , u ≡ v implies u−1 H ∩ [p1 , . . . , ps ] \ {1} = v −1 H ∩ [p1 , . . . , ps ] \ {1}. Therefore our concept of a C0 -monoid coincides with that of [9, Definition 5.1]. Proposition 4.4. Let H be a C-monoid defined in a factorial monoid F with exponent α and subgroup V ⊂ F × . Let P1 be a set of pairwise nonassociated prime elements of F , U ⊂ F × a subgroup and F1 = U ×F(P1 ) ⊂ F . Then H1 = H ∩ F1 is a C-monoid defined in F1 with exponent α and subgroup U ∩ V . In particular, (a) If P1 is finite, then H1 is a C0 -monoid. (b) If U = F × , then H1 ⊂ H is divisor-closed. Proof. F1 is factorial, F1× = U , and clearly H1× ⊂ U ∩ H1 . If ε ∈ U ∩ H1 , then ε ∈ F × ∩ H = H × and ε−1 ∈ U ∩ H ⊂ H1 , hence ε ∈ H1× . Whence H1× = F1× ∩ H1 . Since F1× = F1 ∩ F × , the reduced class semigroup C ∗ (H1 , F1 ) is finite by Lemma 3.3.5, and therefore H1 is a C-monoid defined in F1 . If q ∈ F1 \ F1× ⊂ F \ F × and a ∈ F1 , then q α a ∈ H if and only if q 2α a ∈ H, and therefore q α a ∈ H1 if and only if q 2α a ∈ H1 . Since H × ∩ H1 = F × ∩ H ∩ H1 = F1× ∩ H1 = H1× , we obtain (V ∩ U )(H1 \ H1× ) ⊂ V (H \ H × ) ⊂ H and therefore (V ∩ U )(H1 \ H1× ) ⊂ H ∩ F1 = H1 . Since finally (U : V ∩ U ) | (F × : V ) | α, it follows that H1 is a C-monoid defined in F1 with exponent α and subgroup U ∩ V . The more precise assertions (a) and (b) are obvious.
84
Halter-Koch
Proposition 4.5. Let H be a C-monoid defined in a factorial monoid F with exponent α and subgroup V ⊂ F × . 1. Hred is a C-monoid defined in F/H × with exponent α and subgroup V /H × . In particular, if H is a C0 -monoid, then so is Hred . 2. Let S ⊂ H be a saturated submonoid such that H/S is finite. Then S is a C-monoid, and if H is a C0 -monoid, then so is S. Proof. 1. F/H × is factorial, (F/H × )× = F × /H × , and (F/H × )× ∩ Hred = (F × ∩ H)/H × = {1}. By Lemma 3.3.3 we have C ∗ (H, F ) ∼ = C ∗ (Hred , F/H × ). Hence Hred × is a C-monoid in F/H . The remaining assertions are easily checked. 2. Since S ⊂ H is saturated, we have F × ∩ S = F × ∩ H ∩ S = H × ∩ S = S × and, by Theorem 3.9, C ∗ (S, F ) is finite. Theorem 4.6. Let H be a C-monoid defined in F = F × ×F(P ) with subgroup V and exponent α. 1. For p ∈ P , set dp = gcd(vp (H)) ∈ N0 . Define P0 = {pdp | p ∈ P, dp = 0} ⊂ F (P ), and F0 = {a ∈ F | vp (a) ∈ dp N0 for all p ∈ P } = F × ×F(P0 ) ⊂ F . Then H is a C-monoid defined in F0 with subgroup V and exponent α, and H is dense in F0 .
is a Krull monoid, (H : H)
= ∅, and C(H)
is a finite group whose exponent 2. H divides α. 3. If H is dense in F , then the following assertions hold. (a) H is cofinal in F .
= q(H)∩F ⊂ q(H), and if {p1 , . . . , pd } ⊂ P is an H-essential subset (b) H F F α
satisfying {[p1 ]F H , . . . , [pd ]H } = {[p]H | p ∈ P }, then (p1 · . . . · pd ) H ⊂ H.
(c) For every q ∈ F \ F × , we have q α ∈ H.
→ F (P ), defined by (d ) The map ∂ : H ∂(a) = pvp (a) , p∈P
is a divisor theory, and there is an epimorphism C ∗ (H, F ) → C(H). (e) If H is defined in another factorial monoid F such that H is dense in F , then there exists an isomorphism Φ : Fred → Fred such that Φ(aF × ) = × aF for all a ∈ H.
C-Monoids and Congruence Monoids in Krull Domains
85
In particular, if H is dense in F , then (up to isomorphisms) Fred is uniquely determined by H.
=H
× ×H0 with a reduced Krull monoid H0 , and let H0 → 4. Suppose that H
××F(P ), F (P ) be a divisor theory. Then H is a C-monoid defined in F1 = H H is dense in F1 , and if H is a C0 -monoid, then P is finite. Proof. 1. By definition, we have H ⊂ F0 , F0× ∩ H = F × ∩ H = H × , and C ∗ (H, F0 ) is finite by Lemma 3.3.5. Hence H is a C-monoid defined in F0 . It is now obvious that H is defined in F0 with subgroup V and exponent α, and that H is dense in F0 . 2. and 3. Replacing F by F0 as defined in 1., we may assume that H is dense
is in F . Then it suffices to prove the assertions 3.(a) to 3.(d). Indeed, by 3.(d) H
a Krull monoid and C(H) is finite, by 3.(b) (H : H) = ∅, and by 3.(c) the exponent
divides α. To prove 3.(e), suppose that H is a C-monoid which is defined of C(H)
be the complete integral closure of H inside and dense both in F and F ; let H
→H
such that
those inside F . Then there is an isomorphism Φ0 : H F and H
→ F → Fred and H
→ F → F Φ0 | H = idH . Since the maps H red are divisor theories, the assertions 3.(e) follows from the uniqueness of divisor theories. 3.(a) If a = εp1 · . . . · pn ∈ F , where n ∈ N0 , ε ∈ F × and p1 , . . . , pn ∈ P , then there exist elements a1 , . . . , an ∈ H such that vpi (ai ) > 0 for all i ∈ [1, n], and thus a | a1 · . . . · an . Hence H is cofinal in F . 3.(b) We define a homomorphism ×
π : q(F ) → F /V ×(Z/αZ)
(P )
np by π ε p = εV, (np + αZ)p∈P , p∈P
where ε ∈ F × and (np )p∈P ∈ Z(P ) . We set R = π −1 (π(H)) ⊂ q(F ), and we shall
= R ∩ F . π(H) is a subsemigroup of an abelian torsion prove that R = q(H) and H group, and therefore it is itself a group. Hence R is a group, and H ⊂ R implies q(H) ⊂ R.
⊂ q(F ), then there exists some c ∈ H such that cz k ∈ H for all k ∈ N. If z ∈ H Hence vp (cz k ) = vp (c)+kvp (z) ≥ 0 for all p ∈ P and k ∈ N, which implies vp (z) ≥ 0 for all p ∈ P and thus z ∈ F . Therefore it remains to show that R ⊂ q(H) and
R ∩ F ⊂ H. Suppose that z ∈ R, and let x ∈ H be such that π(z) = π(x). Since H is dense in F , there exists some x0 ∈ H such that Q = suppP (x0 ) ⊃ suppP (x) ∪ suppP (z). We set pnp and z = v p mp , x=u p∈Q
p∈Q
where u, v ∈ F × , v −1 u ∈ V , np ∈ N0 , mp ∈ Z, and np ≡ mp mod α for all p ∈ Q. By Lemma 4.2 we have y0 =
p∈Q
pα ∈ H
and v −1 uy0l ∈ H
for all l ∈ N .
86
Halter-Koch
Let l ∈ N be such that mp + lα ≥ α for all p ∈ Q. Then xy0 = u pnp +α ∈ H , v −1 uy0l z = u pmp +lα ∈ F , p∈Q
p∈Q
hence v −1 uy0l z ∈ H, and z = (v −1 uy0l )−1 (v −1 uy0l z) ∈ q(H). Assume now that z ∈ R ∩ F . Then mp ≥ 0 for all p ∈ P . Let {p1 , . . . , pd } ⊂ P F F be an H-essential subset satisfying {[p1 ]F H , . . . , [pd ]H } = {[p]H | p ∈ P }. Then α w0 = (p1 · . . . · pd ) ∈ H by Lemma 4.2, and we assert that w0 z k ∈ H for all k ∈ N. F Let Q = Q1 . . . Qd be a partition such that Qi ⊂ {p ∈ Q | [p]F H = [pi ]H } for all i ∈ [1, d]. For all k ∈ N, we have w0 z k = v k
d i=1
pα i
(u−1 v)k w0 xk = v k
pkmp ∈ F,
d i=1
p∈Qi
pα i
pknp ∈ H ,
p∈Qi
and we consider the elements zk = v k
d
pikmi +α ∈ F
and xk = v k
i=1
d
i +α pkn ∈F i
i=1
where mi =
p∈Qi
mp and ni =
np .
p∈Qi
−1 k v) w0 xk ]F We have [xk ]F H = [(u H , and thus xk ∈ H, hence zk ∈ H by Lemma 4.2, F k F k and since [zk ]H = [w0 z ]H , it follows that w0 z ∈ H. 3.(c) If q ∈ F \ F × and a ∈ q α F ∩ H, then q α a ∈ H and therefore q α = −1 α
a (q a) ∈ q(H) ∩ F = H. 3.(d) If ϕ : F → q(F )/q(H) denotes the natural homomorphism defined by
Hence H
⊂ F is a saturated ϕ(a) = aq(H), then ϕ−1 (1) = F ∩ q(H) = H.
is a Krull monoid, and the composite map ∂ : H
→ F = submonoid. Therefore H F × ×F(P ) → F (P ) is a divisor homomorphism. It is given by
, pvp (a) for all a ∈ H ∂(a) = p∈Q
and and we assert that it is a divisor theory. Indeed, if p ∈ P , then pα ∈ H, since vp (H) is a numerical monoid, there exists some z ∈ H such that vp (z) =
vp (p−nα z) = 1, and nα + 1 for some n ∈ N. Then p−nα z ∈ F ∩ q(H) = H, p = gcd ∂(pα ), ∂(p−nα z) .
We It remains to prove that there exists an epimorphism C ∗ (H, F ) → C(H).
∼
= have C(H) C(∂) = F (P )/∂ H = q(F (P ))/q(∂ H), and we assert that q(∂ H) = ×
F q(H) ∩ q(F (P )) ⊂ q(F (P )). Indeed, suppose that z ∈ F(P ). If z ∈ q(∂ H), −1 ×
then z = a b, where a, b ∈ F(P ) and aε, bη ∈ H for some ε, η ∈ F . Then z =
Conversely, if z ∈ F × q(H),
then z = ε0 (εa)−1 (ηb), (εη −1 )(aε)−1 (bη) ∈ F × q(H).
Then z ∈ F(P ) implies where ε0 , ε, η ∈ F × , a, b ∈ F(P ) and εa, ηb ∈ H. −1 −1
ε0 ε η = 1 and z = a b ∈ q(∂ H), since ∂(εa) = a and ∂(ηb) = b.
C-Monoids and Congruence Monoids in Krull Domains
87
By Proposition 3.7.1, there exists an epimorphism θ : C ∗ (H, F ) → F/F × H. We
and
= q(F )/F × q(H) combine it with the natural epimorphism F/F × H → F/F × H consider the isomorphisms
= F × q(F (P ))/F × q(H)
q(F )/F × q(H) ∼
∩ q(F (P )) = q(F (P ))/q(∂ H)
∼
= C(H) = q(F (P ))/F × q(H) to obtain the desired epimorphism. 4. Replacing F by F0 as defined in 1., we may assume that H is a C-monoid defined in a factorial monoid F = F × ×F(P ) such that H is dense in F , and if H
⊂ F , and the composite is a C0 -monoid, then P is finite. By 3. we have H ⊂ H
splits in the form map ∂ : H → F → F (P ) is a divisor theory. The Krull monoid H ×
=H
×H0 , where H0 is a reduced Krull monoid, ∂ | H0 is injective, and thus we H
× ×F(P ) ⊂ F , may assume that H0 → F (P ) is a divisor theory. Then H ⊂ F1 = H and by Proposition 4.4 H is a C-monoid defined in F1 . By construction, H is dense in F1 .
Theorem 4.7. 1. Let H be a Krull monoid with finite class group. Then H is a C-monoid, and H is a C0 -monoid if and only if Hred is finitely generated. 2. Let H be a C-monoid defined in a factorial monoid F such that C(H, F ) is a group. Then H is a Krull monoid. Proof. 1. Let ∂ : H → F (P ) be a divisor theory, and H = H × ×H0 , where H0 is a reduced Krull monoid. Then ∂ | H0 is injective and thus we may assume that H0 → F (P ) is a divisor theory. Then H ⊂ F = H × ×F(P ), F × = H × , and by Proposition 3.7 we have C(H, F ) ∼ = F/H ∼ = F0 /H0 = C(H). Hence C(H, F ) is finite, and H is a C-monoid. By [12, Satz 4], Hred is finitely generated if and only if P is finite. If P is finite, then H is a C0 -monoid by definition, and if H is a C0 -monoid, then P is finite by
since H is a Krull monoid). Theorem 4.6 (note that H = H, 2. By Proposition 3.6.3, H ⊂ F is saturated, and thus it is a Krull monoid.
Theorem 4.8. Every C-monoid is v-noetherian. The proof of Theorem 4.8 depends on the following Lemma 4.9, which is a refinement of Dickson’s Finiteness Theorem. Lemma 4.9. Let s ∈ N, ∅ = M ⊂ Ns0 , and let Min(M ) be the set of all minimal points of M . Then there exists a finite set M such that Min(M ) ⊂ M ⊂ M with the following property: If n = (n1 , . . . , ns ) ∈ M , n∗ = (n∗1 , . . . , n∗s ) ∈ Min(M ) and n∗ ≤ n, then there exists some n = (n1 , . . . , ns ) ∈ M such that n∗ ≤ n ≤ n and {i ∈ [1, s] | n∗i < ni } = {i ∈ [1, s] | n∗i < ni }.
88
Halter-Koch
Proof of Lemma 4.9. For n∗ = (n∗1 , . . . , n∗s ) ∈ Min(M ) and I ⊂ [1, s], we denote by M (n∗ , I) the set of all n = (n1 , . . . , ns ) ∈ M such that n ≥ n∗ and I = {i ∈ [1, s] | ni > n∗i }. Let M0 (n∗ , I) be the set of all minimal points of M (n∗ , I). It is finite by Dickson’s Theorem [16, Theorem 1.1], and therefore the set M = M0 (n∗ , I) n∗ ∈Min(M) I⊂[1,s]
is also finite and, by construction, it has the desired property. Proof of Theorem 4.8. Let H be a C-monoid defined in a factorial monoid F = F × × F(P ) with subgroup V and exponent α. By [16, Theorem 24.1] we must prove that for every subset X ⊂ H there exists a finite subset Y ⊂ X such that Y −1 ⊂ X −1 . We may assume that X = ∅, we fix an element x0 ∈ X and distinct primes p1 , . . . , ps ∈ P such that vp (x0 ) = 0 for all p ∈ P = P \ {p1 , . . . , ps }. We define homomorphisms v : F → Ns0 and π : F → F ×/V ×(Z/αZ)s ×C ∗ (H, F ) as follows: If x = εpn1 1 · . . . · pns s a, where ε ∈ F × , n1 , . . . , ns ∈ N0 and a ∈ F(P ), then v(x) = (n1 , . . . , ns ) ∈ Ns0 and
× s ∗ π(x) = εV, n1 + αZ, . . . , ns + αZ, [a]F H ∈ F /V ×(Z/αZ) ×C (H, F ) .
Let X = X1 ∪ . . . ∪ Xt be a partition of X such that |π(Xτ )| = 1 for all τ ∈ [1, t]. For τ ∈ [1, t], we set Mτ = v(Xτ ) ⊂ Ns0 , and we choose a finite subset Mτ ⊂ Mτ with the property of Lemma 4.9. Let Yτ ⊂ Xτ be a finite subset satisfying the following two conditions: 1. For every n ∈ Mτ there exists some x ∈ Yτ such that v(x) = n. 2. If there exist elements x1 , x2 ∈ Xτ such that v(x1 ) = v(x2 ) ∈ Mτ and x−1 1 x2 ∈ F × F (P ) \ H, then Yτ also contains two elements with these properties. Let Y ⊂ X be a finite set such that Y1 ∪ . . . ∪ Yt ∪ {x0 } ⊂ Y . Then we have X −1 ⊂ Y −1 and vp (x) ≥ 0 for all x ∈ Y −1 and p ∈ P . We shall prove that Y −1 ⊂ X −1 . Suppose that z ∈ Y −1 , τ ∈ [1, t] and x ∈ Xτ , say x=ε
s i=1
pni i a
and z = η
s
plii z0 ,
i=1
where ε, η ∈ F × , n = (n1 , . . . , ns ) = v(x), l1 , . . . , ls ∈ Z and a, z0 ∈ F(P ). Let n∗ = (n∗1 , . . . , n∗s ) ∈ Min(Mτ ) and n = (n1 , . . . ns ) ∈ Mτ be such that ∗ n ≤ n ≤ n and {i ∈ [1, s] | n∗i < ni } = {i ∈ [1, s] | n∗i < ni }. For i ∈ [1, s], we set ni = n∗i + ki α and ni = n∗i + ki α, where ki , ki ∈ N0 and either ki = ki = 0 or ki ≥ ki ≥ 1. Let x∗ , x ∈ Yτ be elements such that v(x∗ ) = n∗ and v(x ) = n . Suppose that s s n∗ n x∗ = ε∗ pi i a∗ and x = ε p i i a , i=1
i=1
C-Monoids and Congruence Monoids in Krull Domains
89
where ε∗ , ε ∈ F × are such that ε∗−1 ε, ε−1 ε ∈ V , and a∗ , a ∈ F(P ) are such ∗ F F that [a]F H = [a ]H = [a ]H . Therefore we obtain zx = εη
s
n∗ +li +ki α
pi i
z0 a , zx = ε η
i=1 ∗
s
n∗ +li +ki α
pi i
z0 a , zx∗ = ε∗ η
i=1
s
n∗ +li
pi i
z 0 a∗ ,
i=1
zx , zx ∈ H, and we must prove that zx ∈ H. For all i ∈ [1, s], we have n∗i + li + ki α ≥ n∗i + li + ki α ≥ n∗i + li ≥ 0, and either n∗i + li + ki α = n∗i + li + ki α or n∗i + li + ki α ≥ n∗i + li + ki α ≥ α. Hence Lemma 4.2 implies y = ε η
s
n∗ +li +ki α
pi i
z 0 a ∈ H ,
i=1 F F −1 × × and since [a]F εy]F H = [a ]H , we obtain [zx]H = [ε H . If y ∈ F , then y ∈ H \ H , and ε−1 εy ∈ V (H \ H × ) ⊂ H implies zx ∈ H. If y ∈ F × , then z0 = a = 1 and n∗i + li + ki α = 0, hence n∗i + li + ki α = n∗i + li = 0 for all i ∈ [1, s]. Thus we obtain y = ε η = zx ∈ F × ∩ H = H × and zx = εηa ∈ F × F (P ). Assume that zx ∈ H. Then x−1 x = (zx )−1 zx = ε−1 εa ∈ F × F (P ) \ H, and since v(x) = v(x ) ∈ Mτ , there exists some x1 ∈ Yτ such that × −1 x−1 x1 ∈ F × F (P ) \ H or x−1 implies 1 x ∈ F F (P ) \ H. In any case, z ∈ Y zx1 ∈ H. If x−1 x1 ∈ F × F (P ) \ H, then zx1 = (zx )(x−1 x1 ) ∈ F × F (P ) \ H, a contradiction. −1 × × × = If x−1 1 x ∈ F F (P )\H, then zx = (zx1 )(x1 x ) ∈ H implies zx1 ∈ H ∩F −1 × × H and therefore x1 x ∈ H , again a contradiction.
Proposition 4.10. Let H be a C-monoid defined in F = F × ×F(P ) with exponent α. For an H-essential subset E ⊂ P , we define uE = pα ∈ H , p∈E
and for any subset Q ⊂ P , we set HQ = {x ∈ H | suppP (x) ⊂ Q} = F (Q) ∩ H.
F××
1. {HQ | Q ⊂ P } is the set of all divisor-closed submonoids of H. In particular, every divisor-closed submonoid of a C-monoid is a C-monoid. 2. For every subset Q ⊂ P , we have HQ = [[{uE | E ⊂ Q is H-essential}]]. In particular, if Q ⊂ P is H-essential, then HQ = [[uQ ]]. 3. The following assertions are equivalent: (a) H is a C0 -monoid. (b) H has only finitely many divisor-closed submonoids. (c) H has only finitely many prime s-ideals.
90
Halter-Koch
Proof. Note that uE ∈ H by Lemma 4.2. 1. If Q ⊂ P , then HQ = (F ××F(Q))∩H is a C-monoid, and it is a divisor-closed submonoid of H by Proposition 4.4. Thus let S ⊂ H be a divisor-closed submonoid and set suppP (x) . Q= x∈S
Then S ⊂ HQ by definition. If x ∈ HQ , then suppP (x) ⊂ Q, and thus there exist x1 , . . . , xm ∈ S such that suppP (x) ⊂ suppP (x1 ) ∪ . . . ∪ suppP (xm ) = suppP (x1 · . . . · xm ). Hence x ∈ [[x1 · . . . · xm ]] ⊂ S by Lemma 4.2.2(d). 2. If Q ⊂ P and E ⊂ Q is H-essential, then uE ∈ HQ . Hence [[{uE | E ⊂ Q is H-essential}]] ⊂ HQ . Conversely, suppose that Q ⊂ P , x ∈ HQ and E = suppP (x). Since E = suppP (uE ), Lemma 4.2.2(d) implies x ∈ [[uE ]] ⊂ [[{uE | E ⊂ Q is H-essential}]]. 3. The equivalence of (b) and (c) follows from the definitions. (a) ⇒ (b) If H is a C0 -monoid, then we may assume that P is finite. Then H has only finitely many divisor-closed submonoids by 1. (b) ⇒ (a) By Theorem 4.6 we may assume that H is dense in F . If Q and Q are H-essential subsets of P and Q = Q , then HQ = HQ . Hence P has only finitely many H-essential subsets. However, by Lemma 4.2.2(c) every finite subset of P is contained in an H-essential subset of P . Therefore P is finite and H is a C0 -monoid. Theorem 4.11. Let H1 and H2 be monoids. Then H1 ×H2 is a C-monoid if and only if the following two conditions are satisfied: (a) H1 and H2 are both C-monoids. 1 × /H × and H 2 × /H × (b) Either H1 = H1× , or H2 = H2× , or the groups H 1 2 are both finite. Proof. If H1 × H2 is a C-monoid, then H1 and H2 are C-monoids by Proposition 4.10.1, since they are divisor-closed submonoids. Thus suppose that H1 and H2 are C-monoids. Then Theorem 4.6 implies that for i ∈ {1, 2} the monoid Hi is a C-monoid defined in a factorial monoid Fi = i × × F(Pi ) such that there is a divisor theory H i → F (Pi ). Then H1 × H2 ⊂ H × × × H1 × H2 × F(P1 ) × F(P2 ) = (H1 ×H2 ) × F(P1 ∪ P2 ) = F1 × F2 , and there is a divisor theory H 1 ×H2 = H1 × H2 → F (P1 ) × F(P2 ) = F (P1 ∪ P2 ). Again by Theorem 4.6 and by the uniqueness of divisor theories, H1 ×H2 is a C-monoid if × and only if it is a C-monoid defined in F1 ×F2 , and since (H 1 ×H2 ) ∩ (H1 ×H2 ) = × × × × × (H1 ∩ H1 )× (H2 ∩ H2 ) = H1 × H2 = (H1 × H2 ) , this is the case if and only if C ∗ (H1 × H2 , F1 × F2 ) is finite. The criterion given in Lemma 3.5 completes the proof. We close this section with some remarks concerning finitary monoids and Gmonoids. We recall the relevant definitions from [10]. A subset U of a monoid H is called an almost generating set , if U ⊂ H \ H × , and there exists some n ∈ N such that (H \ H × )n ⊂ U H. A monoid H is called
C-Monoids and Congruence Monoids in Krull Domains
91
• finitary , if it is a BF-monoid and possesses a finite almost generating set. • a G-monoid , if there exists an element a ∈ H lying in all nonempty prime s-ideals of H. A v-noetherian monoid is a G-monoid if and only if it has only finitely many prime s-ideals, and then it is also finitary [10, Proposition 4.5 and Theorem 4.7]. In [9, Theorem 5.9] it is proved that every C0 -monoid is finitary. We can do a little bit more. Proposition 4.12. Let H be a C-monoid. Then H is a G-monoid if and only if it is a C0 -monoid. Proof. By Theorem 4.8, H is v-noetherian, and therefore H is a G-monoid if and only if it has only finitely many prime s-ideals. Thus the assertion follows by Proposition 4.10.3. Example 4.13. The Hilbert monoid H = 2N ∪ {1} is a C-monoid defined in N [8, Theorem 7.4]. Hence it is v-noetherian by Theorem 4.8. Since (H \ {1})2 ⊂ 2H, it follows that {2} is an almost generating set, and therefore H is finitary. For every prime number p, the set 2pN is a prime s-ideal of H. Hence H has infinitely many prime s-ideals and thus it is not a G-monoid (see also [10, Remark 4.11.2]).
5
The Elasticity of C-Monoids
In [8, Theorem 7.2] we proved that a C-monoid H fulfills all relevant finiteness conditions of nonunique factorizations: It is locally tame, has finite catenary degree, and the Structure Theorem for Sets of Lengths holds for H. In particular, it is a BF-monoid. Monotone chains of factorizations in C-monoids are studied in [4]. The purpose of this section is to present a criterion for the elasticity of a C-monoid to be finite. Theorem 5.1. Let H be a C-monoid defined in the factorial monoid F = F ××F(P ) with exponent α. 1. Assume that a ∈ H, and set supp∗P (a) = p ∈ suppP (a) {p} is H-essential . (a) If a ∈ A(H), then
vp (a) ≤ (2α − 1) |C ∗ (H, F )| .
p∈supp∗ P (a)
(b) We have the estimates 1 (2α − 1)|C ∗ (H, F )|
vp (a) ≤ min L(a)
p∈supp∗ P (a)
≤
vp (a)
p∈supp∗ P (a)
+ (3α − 1) | suppP (a)| .
92
Halter-Koch (c) If every minimal H-essential subset of suppP (a) is a singleton, then
max L(a) ≤
vp (a)
and
ρ(a) ≤ (2α − 1) |C ∗ (H, F )| .
p∈supp∗ P (a)
2. If H is simple in F , then ρ(H) ≤ (2α − 1) |C ∗ (H, F )|. Otherwise ρ(H) = ∞. Proof. 1.(a) Suppose that
vp (a) > (2α − 1) |C ∗ (H, F )| .
p∈supp∗ P (a)
Then there exist (not necessarily distinct) primes p1 , . . . , p2α ∈ supp∗P (a) such that F [p1 ]F H = . . . = [p2α ]H and a = p1 · . . . · p2α b for some b ∈ F . We set q = p1 · . . . · pα , α F F a = pα+1 · . . . · p2α b, a1 = p2α 1 b and a1 = p1 b. Then [a1 ]H = [a]H , hence α α F a1 ∈ H, and by Lemma 4.2 we obtain p1 ∈ H and a1 ∈ H. Since [p1 ]H = [q]F H and F [a1 ]F = [a ] , it follows that q ∈ H and a ∈ H, and therefore a = qa is not an H H atom of H. (b) If r = min L(a) and a = u1 ·. . .·ur with u1 , . . . , ur ∈ A(H), then (a) implies
vp (a) =
p∈supp∗ P (a)
r
vp (ui ) ≤ r(2α − 1) |C ∗ (H, F )| .
i=1 p∈supp∗ P (a)
Hence the first inequality holds. To prove the second one, we consider F0 = F × ×F(P0 ), where P0 = suppP (a), and H0 = F0 ∩ H. By Proposition 4.4, H0 is a C0 -monoid defined in F0 , and H0 is a divisor-closed submonoid of H. Hence we may replace H ⊂ F by H0 ⊂ F0 , and then the inequality follows by [9, Proposition 5.6]. (c) If every minimal H-essential subset of suppP (a) is a singleton, then every atom u ∈ A(H) dividing a satisfies vp (u) ≥ 1 for at least one p ∈ P ∗ . Hence max L(a) ≤
p∈P ∗
vp (a)
and
ρ(a) =
max L(a) ≤ (2α − 1) |C ∗ (H, F )| . min L(a)
2. If H is simple in F and a ∈ H, then every minimal H-essential subset of suppP (a) is a singleton, and thus ρ(a) ≤ (2α − 1) |C ∗ (H, F )| by 1.(c). Hence ρ(H) ≤ (2α − 1) |C ∗ (H, F )|. Assume now that H is not simple in F . Then there exists some a ∈ H such that suppP (a) is a minimal H-essential subset of P and |suppP (a)| ≥ 2. Then supp∗P (a) = ∅, and 1.(b) implies min L(an ) ≤ (3α − 1) | suppP (a)| for all n ∈ N , and thus ρ(H) = ∞.
hence
lim ρ(an ) = ∞ ,
n→∞
C-Monoids and Congruence Monoids in Krull Domains
6
93
Congruence Monoids in Krull Domains
We recall the definition and the elementary properties of congruence monoids from [9]. Let R be an integral domain. A map σ = (σ1 , . . . , σm ) : R• → {±1}m is called a sign vector of R, if there exist distinct ring monomorphisms w1 , . . . , wm : R → R such that σj (a) = sign{wj (a)} for all a ∈ R• and all j ∈ [1, m]. For m = 0, the empty sequence will also be considered as a sign vector. Let {0} = f R be an ideal and σ = (σ1 , . . . , σm ) a sign vector of R. Two elements a, b ∈ R• are called congruent modulo fσ, a ≡ b mod fσ, if a ≡ b mod f and σ(a) = σ(b). Congruence modulo fσ is a congruence relation on R• , and the semigroup of congruence classes is denoted by R/fσ. For a ∈ R• , we denote by [a]fσ ∈ R/fσ the congruence class containing a. Note that (R/fσ)× = {[a]fσ | a + f ∈ (R/f)× } is the group of invertible elements of R/fσ. For m = 0, the congruence modulo fσ is just the ordinary congruence modulo f, and we write f instead of fσ. If ∅ = Γ ⊂ R/fσ is a multiplicatively closed subset (not necessarily containing the unit element [1]fσ ), then the (multiplicative) monoid HΓ = a ∈ R• | [a]fσ ∈ Γ ∪ {1} ⊂ R• is called the congruence monoid defined in R modulo fσ by Γ. It is called • regular modulo f , if aR + f = R for all a ∈ H. • singular modulo f , if aR + f = R for all a ∈ H \ {1}. Note that H is regular modulo f if and only if Γ ⊂ (R/fσ)× , and H is singular modulo f if and only if Γ ∩ (R/fσ)× = ∅. A submonoid H ⊂ R• is called a congruence monoid in R, if there exists an ideal f = {0} of R, a sign vector σ of R and a multiplicatively closed subset ∅ = Γ ⊂ R/fσ such that H = HΓ . Every such ideal f is called an ideal of definition for H. If f is an ideal of definition for H and R/f is noetherian, then H has a largest ideal of definition (see [9, Proposition 3.4]). The most interesting examples of congruence monoids are Hilbert monoids of natural numbers and orders in Krull domains. Regular Hilbert monoids were discussed in [13] and regular congruence monoids in Dedekind domains in [14]. For the analytical number theory of congruence monoids we refer to [11] and for the deeper arithmetical theory of congruence monoids in Dedekind domains we refer to [9]. The arithmetical theory of Hilbert monoids is also discussed in [8]. In this chapter we investigate congruence monoids in Krull domains and give a common generalization of the theory developed in [9] and the investigations of W. Hassler [17] on certain noetherian domains. Lemma 6.1. Let R be an integral domain, f = {0} an ideal of R, σ a sign vector of R, ∅ = Γ ⊂ R/fσ a multiplicatively closed subset, and H = HΓ ⊂ R• . 1. Suppose that either H is singular modulo f or that Γ ∩ (R/fσ)× is a subgroup of (R/fσ)× . Then R× ∩ H = H × .
94
Halter-Koch 2. If (R/fσ)× is a torsion group, then either H is singular modulo f or Γ ∩ (R/fσ)× is a subgroup of (R/fσ)× .
Proof. 1. Obviously, H × ⊂ R× ∩ H, and if H is singular modulo f, then R× ∩ H = {1} = H × . If Γ ∩ (R/fσ)× is a subgroup of (R/fσ)× and a ∈ R× ∩ H, then × −1 [a−1 ]fσ = [a]−1 ∈ H and therefore a ∈ H × . fσ ∈ Γ ∩ (R/fσ) . Hence a 2. Observe that every nonempty multiplicatively closed subset of a torsion group is a subgroup. If H is a congruence monoid in a Dedekind domain, f is its largest ideal of definition, and H = HΓ for some Γ ⊂ R/fσ such that Γ ∩ (R/fσ)× is a group, then H is regular modulo f if and only if H is a Krull monoid (see [9, Theorem 3.7]). In a Krull domain, we have the following weaker result. Proposition 6.2. Let R be a Krull domain, {0} = f R an ideal and σ a sign vector of R, ∅ = Γ ⊂ R/fσ a multiplicatively closed subset, H = HΓ ⊂ R• and H ∗ = {a ∈ H | a + f ∈ (R/f)× }. Suppose that either H is singular modulo f, or that Γ ∩ (R/fσ)× is a subgroup of (R/fσ)× . 1. H ∗ is a saturated submonoid of R• . In particular, H ∗ is a Krull monoid. 2. If H is regular modulo f, then H is a Krull monoid. Proof. 1. If H is singular modulo f, then H ∗ = {1}. Thus let Γ ∩ (R/fσ)× be a subgroup of (R/fσ)× . If a, b ∈ H ∗ and b = ac for some c ∈ R• , then [a]fσ ∈ × ∗ Γ ∩ (R/fσ)× , and [c]fσ = [a]−1 fσ [b]fσ ∈ Γ ∩ (R/fσ) implies c ∈ H . 2. If H is regular modulo f, then H = H ∗ is a Krull monoid by 1.
Theorem 6.3. Let R be a Krull domain, H ⊂ R• a congruence monoid in R and f an ideal of definition for H. Let C(R) and R/f be finite, and suppose that either R is noetherian or f is divisorial. Then H is a C-monoid. Proof. Being a Krull monoid, R• splits in the form R• = R× × D, where D is a reduced Krull monoid, and there is a divisor theory D → F0 = F (P0 ). Then the composite map ∂ : R• → D → F0 is also a divisor theory. For every a ∈ F0 , ∂ −1 (aF0 ) ∪ {0} is a divisorial ideal of R (see [16, Theorem 20.5]). Let σ be a sign vector of R and ∅ = Γ ⊂ R/fσ a multiplicatively closed subset such that H = HΓ . By definition, H ⊂ R× ×D ⊂ R× ×F0 = F , F is factorial, and F × ∩ H = R× ∩ H. Since R/f is finite, Lemma 6.1 implies R× ∩ H = H × . Thus it remains to prove that C ∗ (H, F ) is finite. We consider the group G = q(F )/q(R• ). It is finite, since it is isomorphic to C(R), and since R• ⊂ F is cofinal, we have G = {zq(R• ) | z ∈ F }. Therefore it is × sufficient to prove that for each g ∈ G the set {[x]F H | x ∈ F ∩ g \ F } is finite. × Let g ∈ G be given. If z = εz0 ∈ F ∩ (−g), where ε ∈ R and z0 ∈ F0 , then z(F ∩ g) = zF ∩ q(R• ) = R× ×(z0 F0 ∩ q(D)) = R× ×(z0 F0 ∩ F0 ∩ q(D)) = R× ×(z0 F0 ∩ D) = ∂ −1 (z0 F0 ) .
C-Monoids and Congruence Monoids in Krull Domains
95
We fix an element w ∈ F ∩ −g, and we set E = {x ∈ F ∩ g | x(F ∩ −g) ⊂ f} ,
a = w(F ∩ g) ∪ {0} and b = (wE) ∪ {0} .
Then a is a divisorial ideal of R, and b ⊂ a. We shall prove the following assertions: 1) b is an ideal of R; 2) af ⊂ b; 3) a/b is finite; 4) If x, y ∈ F ∩ g \ F × and F wx ≡ wy mod bσ, then [x]F H = [y]H . × Once this is done, the finiteness of the set {[x]F H | x ∈ F ∩ g \ F } follows. Indeed, by 4) there is a surjective map × , given by [wx]bσ → [x]F Z = [wx]bσ x ∈ F ∩g\F × → [x]F H x ∈ F ∩g\F H
and clearly Z ⊂ {[a]bσ | a ∈ a}. Since a/b is finite and every residue class modulo b splits into finitely many residue classes modulo bσ (by [9, Lemma 3.2]), it follows that Z is finite. 1) We prove that b, b ∈ b and c ∈ R implies b + b ∈ b and cb ∈ b. We may assume that b, b , b + b and c are all different from zero. Then b = wx, b = wx and b + b = wy, where x, x , y ∈ F ∩ g, x(F ∩ −g) ⊂ f and x (F ∩ −g) ⊂ f. If z ∈ F ∩ −g, then yz = yw(w−1 z) = (xw + x w)w−1 z = xz + x z ∈ f. Hence b + b ∈ b, and cx(F ∩ −g) ⊂ f implies cb = wcx ∈ b. 2) If 0 = a ∈ a and c ∈ f, then a = wx, where x ∈ F ∩ g, ca = w(cx), and cx(F ∩ −g) ⊂ cR ⊂ f. 3) Since fa ⊂ b, it follows that a/b is an R/f-module, and since R/f is finite, it is sufficient to prove that a/b is a finitely generated R/f-module. If R is noetherian, then a is finitely generated, and consequently a/b is also finitely generated. If f is divisorial, then all prime ideals containing f are minimal over f. Hence they are divisorial, and there are only finitely many of them, say p1 , . . . , pk (see [16, Proposition 6.6 and Theorem 24.2]). If S = R \ (p1 ∪ . . . ∪ pk ), then S −1 R is a semilocal Krull domain and {S −1 p1 , . . . , S −1 pk } = max(S −1 R). Hence S −1 R is one-dimensional, and therefore it is a principal ideal domain, and a/b = S −1 (a/b) = S −1 a/S −1 b is a finitely generated module over S −1 (R/f) = R/f (the latter argument is due to F. Kainrath). 4) Suppose that x, y ∈ F ∩ g \ F × = F ∩ g \ R× and wx ≡ wy mod bσ. Then wx − wy ∈ b = wE ∪ {0}, say wx − wy = wu for some u ∈ E ∪ {0}. We must prove that, for all z ∈ F , zx ∈ H implies zy ∈ H. If z ∈ F and zx ∈ H, then z ∈ F ∩ −g, and therefore zu ∈ f. Since zu = (zw−1 )(wu) = zx − zy and σ(zx) = σ(zw−1 )σ(wx) = σ(zw−1 )σ(wy) = σ(zy), it follows that zx ≡ zy mod fσ. Since x ∈ / R× , we have zx = 1 and hence zy ∈ H. Corollary 6.4. Let A be a noetherian domain, R its integral closure and f = AnnA (R/A) = {0}. 1. R is a Krull domain, and A• is a congruence monoid defined in R modulo f by A/f. 2. If C(R) and R/f are finite, then A• is a C-monoid.
96
Halter-Koch
Proof. By [5, Theorem 4.3], R is a Krull domain, and obviously A• is a congruence monoid defined in R modulo f by A/f (see also [11] and [9, Example 3.3.1]). Thus the assertions follow by Theorem 6.3. An even stronger version of Corollary 6.4 was proved by W. Hassler [17, Theorem 3.2], who also showed the finiteness of the unit factor group R× /A× .
Bibliography [1] D. D. Anderson (ed.), Factorization in integral domains, Marcel Dekker, 1997. [2] D. F. Anderson, Elasticity of factorizations in integral domains: a survey, Factorization in integral domains, Lecture Notes in Pure Appl. Math., Marcel Dekker 189 (1997), 1–29. [3] S.T. Chapman and A. Geroldinger, Krull domains and monoids, their sets of lengths and associated combinatorial problems, Factorization in integral domains, Lecture Notes in Pure Appl. Math., Marcel Dekker 189 (1997), 73–112. [4] A. Foroutan and A. Geroldinger, Monotone chains of factorizations in Cmonoids, these Proceedings. [5] R.M. Fossum, The divisor class group of a Krull domain, Springer, 1973. [6] A. Geroldinger, On the structure and arithmetic of finitely primary monoids, Czech. Math. J. 46 (1996), 677–695. [7] A. Geroldinger, The catenary degree and tameness of factorizations in weakly Krull domains, Factorization in integral domains, Lecture Notes in Pure Appl. Math., Marcel Dekker 189 (1997), 113–153. [8] A. Geroldinger and F. Halter-Koch, Transfer principles in the theory of nonunique factorizations, these Proceedings. [9] A. Geroldinger and F. Halter-Koch, Congruence monoids, Acta Arith. 112 (2004), 263–296. [10] A. Geroldinger, F. Halter-Koch, W. Hassler, and F. Kainrath, Finitary Monoids, Semigroup Forum 67 (2003), 1–21. [11] A. Geroldinger, F. Halter-Koch, and J. Kaczorowski, Non-unique factorizations in orders of global fields, J. Reine Angew. Math. 459 (1995), 89–118. [12] F. Halter-Koch, Halbgruppen mit Divisorentheorie, Expo. Math. 8 (1990), 27– 66. [13] F. Halter-Koch, Arithmetical Semigroups Defined by Congruences, Semigroup Forum 42 (1991), 59–62. [14] F. Halter-Koch, Ein Approximationssatz f¨ ur Halbgruppen mit Divisorentheorie, Result. Math. 19 (1991), 74–82. 97
98
Halter-Koch
[15] F. Halter-Koch, Finitely generated monoids, finitely primary monoids and factorization properties of integral domains, Factorization in integral domains, Lecture Notes in Pure Appl. Math., Marcel Dekker 189 (1997), 73–112. [16] F. Halter-Koch, Ideal systems. An introduction to multiplicative ideal theory, Marcel Dekker, 1998. [17] W. Hassler, Factorization in finitely generated domains, J. Pure Appl. Algebra 186 (2004), 151–168. [18] F. Kainrath, Elasticity of finitely generated domains, Houston J. Math. 30 (2004).
Chapter 5
Monotone Chains of Factorizations in C-Monoids by
1
Andreas Foroutan and Alfred Geroldinger1
Introduction and Main Result
C-monoids were recently introduced by F. Halter-Koch as a common generalization of various types of auxiliary monoids studied in factorization theory. C-monoids are suitably defined submonoids of factorial monoids (cf. Definition 2.1), and they include Krull monoids with finite class groups and congruence monoids in Krull domains satisfying some natural finiteness conditions. In particular, let A be a noetherian domain, R its integral closure and f = AnnA (R/A) = {0}. Then the multiplicative monoid A• of A is a congruence monoid in R, and if the class group C(R) and R/f are finite, then A• is a C-monoid ([12, Theorem 3.2] and [9, Corollary 6.4]). C-monoids have nice algebraic and arithmetical properties. Every C-monoid H
is a Krull monoid with finite class is v-noetherian, its complete integral closure H
group and the conductor (H : H) is nonempty ([9, Theorem 4.6]). Moreover, H is locally tame, has finite catenary degree, satisfies the Structure Theorem for Sets of Lengths, and there is an explicit criterion for the finiteness of its elasticity ([7, Theorem 5.9], [5, Theorem 7.2] and [9, Theorem 5.9]). This chapter continues the investigations of the arithmetic of C-monoids. We discuss the main result which is formulated below (Theorem 1.1). Let H be a monoid (i.e., a commutative, cancellative semigroup with unit element) and H × its group of invertible elements. Then H is atomic, if every nonunit a ∈ H \ H × has a factorization (product decomposition) into atoms (irreducible elements) of H, and H is factorial, if it is atomic and every nonunit has a unique factorization 1 This
work was supported by the Austrian Science Fund FWF (Project-Nr. P16770-N12)
99
100
Foroutan and Geroldinger
into atoms. Suppose that H is atomic but not factorial. Then there exists some a ∈ H \ H × having two distinct factorizations z and z , say z = u1 · . . . · ul · v1 · . . . · vm
and z = u1 · . . . · ul · w1 · . . . · wn
where ui , vj , wk are atoms and vj H × = wk H × for all i ∈ [1, l], j ∈ [1, m] and k ∈ [1, n]. Then |z| = l + m (resp. |z | = l + n) is called the length of z (resp. the length of z ), and d(z, z ) = max{m, n} is called the distance between z and z . A simple observation shows that for every N ∈ N there exist some aN ∈ H \ H × and factorizations zN , zN of aN such that d(zN , zN ) ≥ N . The monoid H has finite catenary degree, if there exists some constant M ∈ N such that for every a ∈ H \H × each two factorizations z, z of a can be concatenated by an M -chain of factorizations (i.e., there exists a finite sequence of factorizations (z = z0 , z1 , . . . , zk+1 = z ) of a such that d(zi−1 , zi ) ≤ M for every i ∈ [1, k + 1]). It is well-known that C-monoids have finite catenary degree, but up to now there was no information about length or structure of concatenating chains. Theorem 1.1. Let H be a C-monoid. Then there exists some constant M ∈ N having the following property: for every a ∈ H and for each two factorizations z, z of a there exist factorizations z = z0 , z1 , . . . , zk+1 = z of a such that, for every i ∈ [1, k + 1], d(zi−1 , zi ) ≤ M
and (either |z1 | ≤ . . . ≤ |zk | or |z1 | ≥ . . . ≥ |zk | ).
Thus there exists some M ∈ N such that for every a ∈ H and each two factorizations of a there is a concatenating M -chain for which the associated sequence of lengths (|z0 |, |z1 |, . . . , |zk |, |zk+1 |) is monotone, with possible exceptions at the first and the last step. These exceptions do not occur in Krull monoids with finite class groups (see [4, Theorem 5.1]). Let A be a one-dimensional local noetherian domain A with integral closure R such that f = AnnA (R/A) = {0} and R/f is finite, whence A• is a C-monoid. W. Hassler proved an arithmetical property for A• implying Theorem 1.1, but on the other hand he could show that these exceptions actually occur. Thus there is a domain A as above for which there is no M ∈ N such that for every a ∈ A• each two factorizations of a can be concatenated by a monotone M -chain of factorizations (see [11, Theorem 4.1 and Example 6.3]). The first step in the proof of Theorem 1.1 is to reduce the problem to those C-monoids which are submonoids of finitely generated factorial monoids (see [5, Theorem 7.2]). This allows to apply Dickson’s Finiteness Theorem on minimal points of subsets S ⊂ Ns0 . Furthermore, these simpler C-monoids are finitary in the sense of [8], and we can use the machinery of tamely generated ideals as developed in [6].
2
Preliminaries
Our terminology and our notations are consistent with [7], [9] and [5]. For convenience we recall some key notions. We denote by N the set of positive integers and
Monotone Chains of Factorizations in C-Monoids
101
set N0 = N ∪ {0}. For integers m, n ∈ Z let [m, n] = {x ∈ Z | m ≤ x ≤ n}, and for a set X we denote by |X| ∈ N0 ∪ {∞} its cardinality. Basic Notions on Monoids. Throughout this chapter, a semigroup is a nonempty set with a commutative and associative law of composition possessing a unit element. We use multiplicative notation and denote the unit element by 1. By a monoid, we mean a cancellative semigroup. Let H be a monoid. Then H × denotes its group of invertible elements and Hred = {aH × | a ∈ H} the associated reduced monoid of H. We say that H is reduced, if H × = {1}. An element u ∈ H is called irreducible (or an atom of H), if u ∈ / H × and, for all a, b ∈ H, u = ab × × implies that a ∈ H or b ∈ H . We denote by A(H) the set of atoms of H, and we say that H is atomic if every a ∈ H \ H × is a product of atoms. An element p ∈ H is called a prime of H, if p ∈ / H × , and if a, b ∈ H, then p | ab implies that p | a or p | b. Every prime is an atom, and a monoid is factorial if and only if it is atomic and every atom is a prime. If H is atomic and p ∈ H is a prime element of H, then every a ∈ H may be written in the form a = pn b where b ∈ H and n ∈ N0 . The exponent n is uniquely determined by the classes aH × and pH × in Hred , and we call n = vp (a) the p-adic value of a. For a set P , we denote by F (P ) the free abelian monoid with basis P . Every a ∈ F(P ) has a unique representation in the form pvp (a) where vp (a) ∈ N0 and vp (a) = 0 for all but finitely many p ∈ P . a= p∈P
For a, b ∈ F(P ), we set |a| =
p∈P
vp (a)
and d(a, b) = max
b a , . gcd(a, b) gcd(a, b)
Note that | · | : F (P ) → N0 is a homomorphism, and d : F (P ) × F(P ) → N0 is a metric. For every element a ∈ H we set [[a]] = {b ∈ H | b | an for some n ∈ N} ⊂ H (then [[a]] is the smallest divisor-closed submonoid containing a). A subset a ⊂ H is called an s-ideal of H, if aH = a. Finitary Monoids. Let H be a monoid with H = H × . A subset U ⊂ H \ H × is called an almost generating set of H, if there exists some n ∈ N such that (H \ H × )n ⊂ U H. We denote by M(U ) the smallest possible n ∈ N for which the above inclusion holds. If U is an almost generating set, then U [θ] = {uθ | u ∈ U } is an almost generating set for every θ ∈ N (cf. [8, Lemma 3.4.1]). The monoid H is called finitary, if it satisfies the ascending chain condition on principal ideals, and if it has some finite almost generating set U . Finitary monoids were introduced in [8] as a powerful tool in factorization theory. Main examples of finitary monoids are finitely generated monoids, strongly primary monoids, v-noetherian G-monoids and abstract congruence monoids. Let H be a finitary monoid, a ⊂ H an s-ideal, U ⊂ H \ H × a finite almost generating set and u ∈ U . We denote by Hu the set of all a ∈ H without a divisor in [[u]] \ H × , by a(U, u) the set of all a ∈ a ∩ u2 H such that [[u]] is maximal in the set {[[v]] | v ∈ U, a ∈ v 2 H}, and we set a[U, u] = Hu ∩ (u[[u]])−1 a(U, u) .
102
Foroutan and Geroldinger
A simple calculation gives that a⊂ u[[u]] a[U, u] ∪ a \ U [2] H u∈U
(cf. [6, Proposition 5.5]), and we say that a is U -generated, if equality holds. Clearly, the s-ideal H is U -generated. A finite almost generating set W ⊂ H is called full, if there exists some m ∈ N such that H[W, w] ⊂ H \ W m H for all w ∈ W , and every finitary monoid has such an almost generating set. Class semigroups. Class semigroups were recently introduced in [7, Section 4] as a refinement of ordinary class groups in algebraic number theory. We repeat the definition for a situation which is sufficient for our requirements. Let D be a monoid and H ⊂ D a submonoid. Two elements y, y ∈ D are called H-equivalent, −1 if y −1 H ∩ D = y H ∩ D. H-equivalence is a congruence relation on D. For y ∈ D, D let [y]H denote the congruence class of y, and let ∗ D × C(H, D) = {[y]D H | y ∈ D} and C (H, D) = {[y]H | y ∈ (D \ D ) ∪ {1}}.
Then C(H, D) is a semigroup with unit element [1]D H (called the class semigroup of H in D) and C ∗ (H, D) ⊂ C(H, D) is a subsemigroup (called the reduced class semigroup of H in D). If C(H, D) is a torsion group, then H ⊂ D is saturated and cofinal, and if H ⊂ D is saturated and cofinal, then C(H, D) is isomorphic to the factor group of the quotient groups of D and H (cf. [9, Section 3]). C-monoids and C0 -monoids. C-monoids generalize abstract congruence monoids defined in factorial monoids and Z-monoids (cf. [7] and [12]). For their relevance and their properties we refer to the paper of F. Halter-Koch in this volume (see [9]). Here we only give the definition and a characterization of C0 -monoids which is important for the present investigations. Definition 2.1. A monoid H is called a C-monoid, if it is a submonoid of a factorial monoid F such that H ∩ F × = H × and C ∗ (H, F ) is finite. A C0 -monoid is a C-monoid H defined in a factorial monoid F having only finitely many pairwise nonassociated prime elements. Theorem 2.2. Let F = F × × [p1 , . . . , ps ] be a factorial monoid with pairwise nonassociated prime elements p1 , . . . , ps , and let H ⊂ F be a submonoid such that H ∩ F × = H × . Then the following assertions are equivalent: 1. H is a C0 -monoid defined in F . 2. There exists some α ∈ N and a subgroup V ⊂ F × such that (F × : V ) | α, V (H \ H × ) ⊂ H, and for all j ∈ [1, s] and a ∈ pα j F we have a ∈ H if and a ∈ H. only if pα j In particular, every C0 -monoid in the sense of Definition 2.1 is a C0 -monoid in the sense of [7, Definition 5.1], and conversely. Let H ⊂ F be a C0 -monoid with all notations as in Theorem 2.2. Then a simple inductive argument shows that H satisfies the following congruence condition (C), which will turn out to be crucial for our investigations:
Monotone Chains of Factorizations in C-Monoids
103
(C) If u ∈ F and (n1 , . . . , ns ), (n1 , . . . , ns ) ∈ Ns0 are such that,
either ni = ni or ni ≡ ni mod α and min{ni , ni } ≥ α for each i ∈ [1, s], then u
s
pni ∈ H
implies
i=1
u
s
pni ∈ H .
i=1
Factorization Theory. Let H be a monoid. The monoid Z(H) = F (A(Hred )) is called the factorization monoid of H. Let π : Z(H) → Hred denote the unique homomorphism satisfying π(u) = u for all u ∈ A(Hred ). Then H is atomic if and only if π is surjective. For every a ∈ H the elements in Z(a) = π −1 (aH × ) are called factorizations of a. It was a crucial new idea, introduced in [4], to study arithmetical invariants (such as sets of lengths, catenary and tame degrees) with respect to a given subset of factorizations X ⊂ Z(H). We shall make substantial use of this idea and give the necessary definitions. Suppose that H is an atomic monoid, a ∈ H and X ⊂ Z(H) a subset. Note that in case X = Z(H), the forthcoming definitions coincide with the usual ones. Let ZX (a) = Z(a) ∩ X denote the set of factorizations of a which are in X and X for k ∈ N0 let ZX k (a) = {z ∈ Z (a) | |z| = k}. The set X ⊂ Z(H) is called M -dense for some nonnegative integer M ∈ N0 , if for every b ∈ H and every z ∈ Z(b) there exists some z ∈ ZX (b) such that d(z, z ) ≤ M . We say that X is a dense subset, if it is M -dense for some M ∈ N0 . We denote by LX (a) = {|z| | z ∈ ZX (a)} ⊂ N0 the set of lengths of a with respect to X. H is called a BF-monoid, if all sets of lengths LZ(H) (a) are finite. Finitary monoids are BF-monoids. Sets of lengths and all invariants derived from them, such as the elasticity of a monoid, are central objects of interest in factorization theory (cf. [2], [1], [3], [13]). Distances: Let L ⊂ Z. If m ∈ L and d ∈ N are such that [m, m + d] ∩ L = {m, m + d}, then m and m + d are called successive lengths of L, and d is called a distance of L. We denote by ∆(L) ⊂ N the set of all distances of L, and call ∆(LX (a)) ⊂ N ∆X (H) = a∈H
the set of distances of H with respect to X. For subsets Z, Z ⊂ Z(H) we set d(Z, Z ) = min{d(z, z ) | z ∈ Z, z ∈ Z } ∈ N0 . Let a ∈ H. If z, z ∈ ZX (a), then z = z if and only if d(z, z ) = 0; if z = z , then 2 ≤ d(z, z ) ≤ sup LX (a). We set X δ X (a) = sup{d({z}, ZX k (a)) | z ∈ Z (a),
|z| and k are successive lengths in LX (a)} ∈ N0 ∪ {∞} and δ X (H) = sup{δ X (a) | a ∈ H} ∈ N0 ∪ {∞}.
104
Foroutan and Geroldinger
Chains of Factorizations: If a ∈ H, z, z ∈ ZX (a) and N ∈ N0 , then an N -chain of X-factorizations from z to z is a finite sequence (z0 , z1 , . . . , zk ) in ZX (a) such that z = z0 , zk = z and d(zi−1 , zi ) ≤ N for all i ∈ [1, k]. We denote by cX (a) the smallest N ∈ N0 ∪ {∞} such that for each two factorizations z, z ∈ ZX (a) there is an N -chain of X-factorizations from z to z . We set cX (H) = sup{cX (a) | a ∈ H} ∈ N0 ∪ {∞}. If cX (H) < ∞, then ∆X (H) is finite. We say that H has finite catenary degree, if cZ(H) (H) < ∞. A chain of X-factorizations (z0 , . . . , zk ) is called monotone, if either |z0 | ≤ . . . ≤ |zk | or |z0 | ≥ . . . ≥ |zk |. We denote by cX m (a) the smallest N ∈ N0 ∪ {∞} such that for each two factorizations z, z ∈ ZX (a) there is a monotone N -chain of Xfactorizations from z to z . We call X cX m (H) = sup{cm (a) | a ∈ H} ∈ N0 ∪ {∞}
the monotone catenary degree of H with respect to X. Tameness: For a ∈ H and u ∈ Z(H), let tX (a, u) denote the smallest integer N ∈ N0 with the following property: if z ∈ ZX (a) and ZX (a) ∩ uZ(H) = ∅, then there exists some z ∈ ZX (a) ∩ uZ(H) such that d(z, z ) ≤ N . For subsets H ⊂ H and U ⊂ Z(H) we define tX (H , U ) = sup{tX (a, u) | a ∈ H , u ∈ U } ∈ N0 ∪ {∞}. H is called locally tame, if tZ(H) (H, u) < ∞ for all u ∈ A(Hred ). Let a ⊂ H be an s-ideal. A subset E ⊂ a is called a tame generating set of a (with bound M ∈ N), if for every a ∈ a there exists some e ∈ E satisfying e | a, sup L(e) ≤ M and tZ(H) (a, Z(e)) ≤ M (cf. [6, Definition 3.3 and Proposition 3.8]). For a ∈ H and u ∈ Z(H), let tX m (a, u) denote the smallest integer N ∈ N0 with the following property: if z ∈ ZX (a) and z ∈ ZX (a) ∩ uZ(H), then there exists some z ∈ ZX (a) ∩ uZ(H) such that d(z, z ) ≤ N and (either |z| ≤ |z | ≤ |z| or |z| ≤ |z | ≤ |z|). For subsets H ⊂ H and U ⊂ Z(H) we define X tX m (H , U ) = sup{tm (a, u) | a ∈ H , u ∈ U } ∈ N0 ∪ {∞}.
Whenever an arithmetical invariant appears without an upper index specifying the set of factorizations X ⊂ Z(H), then it is supposed that X = Z(H), so L(a) = LZ(H) (a), c(H) = cZ(H) (H) and so on. All arithmetical invariants introduced above are in fact invariants of the associated reduced monoid Hred . Hence we may suppose that H is reduced whenever this is convenient.
3
Reduction of the Theorem to the Main Proposition
In this section we formulate a Main Proposition and show how it implies Theorem 1.1. The proof of the Main Proposition will be given in Sections 4 and 5.
Monotone Chains of Factorizations in C-Monoids
105
Proposition 3.1 (Main Proposition). Let H be a reduced C0 -monoid defined in a factorial monoid F having a finite group of units F × . Then there exist a finite set A ⊂ A(H), a finite almost generating set W of H, sets of factorizations Xw ⊂ Z(H) for every w ∈ W, a set of factorizations Y ⊂ Z(H) and a constant M ∈ N such that the following conditions are satisfied: 1. W is full and H=
w[[w]]H[W, w] ∪ (H \ W[2] H).
w∈W w 2. A is an almost generating set, AXw ⊂ Xw , A−1 Xw ∩Z(H) ⊂ Xw and ZX k (a)∩ Xw AZ(H) = ∅ for every a ∈ H, w ∈ W and every k ∈ L (a) with k ≥ M.
3. Y is M-dense. 4. Let w ∈ W, X = Xw and a ∈ w[[w]]H[W, w]. H[W, w], b ∈ Z(b) and a ∈ [[w]] such that a = b. Furthermore, for every z ∈ ZY (a) there are factorizations z = z0 , . . . , zk = z ∈ Z(a) such d(zi−1 , zi ) = 2 for every i ∈ [1, k].
Then there exist some b ∈ wa b and ZY (a) ⊂ Z(wa ) · some z ∈ ZX (wa ) · b and that |z0 | = . . . = |zk | and
5. tXw (H, v) < ∞ and ∆Xw (H) is finite for every v ∈ A and every w ∈ W. 6. δ Xw (H) < ∞ for every w ∈ W. Lemma 3.2. Let H be a reduced BF-monoid, X ⊂ Z(H) and A ⊂ A(H) such that AX ⊂ X and A−1 X ∩ Z(H) ⊂ X. 1. If there is some M ∈ N such that ZX (a) ∩ AZ(H) = ∅ for every a ∈ H with max LX (a) > M , then cX (H) ≤ sup{M, tX (H, A)}. 2. If there is some M ∈ N such that ZX k (a) ∩ AZ(H) = ∅ for every a ∈ H and every k ∈ LX (a) with k ≥ M , then X cX m (H) ≤ sup{M, tm (H, A)}.
Proof. 1. If tX (H, A) = ∞, then there is nothing to show. Suppose that this is not the case, and let a ∈ H. We prove that cX (a) ≤ max{M, tX (H, A)} = M ∗ . We proceed by induction on max LX (a). If max LX (a) ≤ M , then cX (a) ≤ max LX (a) ≤ M . Suppose that max LX (a) > M , and let z, z ∈ ZX (a). By assumption there exists some u ∈ A such that ZX (a) ∩ uZ(H) = ∅, and we set b = u−1 a. Then there are y = ux, y = ux ∈ ZX (a), with x, x ∈ Z(b), such that d(z, ux) ≤ tX (H, u) and d(z, ux ) ≤ tX (H, u). Since
106
Foroutan and Geroldinger
A−1 X ∩ Z(H) ⊂ X, it follows that x, x ∈ ZX (b). Since max LX (b) < max LX (a), there exists an M ∗ -chain (x, x1 , . . . , xk , x ) of X-factorizations from x to x . Since AX ⊂ X, (z, ux, ux1 , . . . , uxk , ux , z ) is an M ∗ -chain of X-factorizations from z to z. 2. [4, Lemma 3.5]. We briefly analyze the assumption occurring in part 1. of Lemma 3.2. If A = A(H), then it holds with M = 1. Suppose that X = Z(H). Then there exists some finite set A ⊂ A(H) such that the assumption holds if and only if H is finitary. Lemma 3.3. Let H be a reduced atomic monoid and X ⊂ Z(H). 1. If u ∈ A(H) such that uX ⊂ X and u−1 X ∩ Z(H) ⊂ X, then X X X X tX m (H, u) ≤ δ (H) t (H, u) + sup ∆ (H) + t (H, u). 2. If there exists some a ∈ H with |ZX (a)| ≥ 2, then 2 + sup ∆X (H) ≤ cX (H). In particular, if cX (H) < ∞, then ∆X (H) is finite. Proof. 1. follows from [4, Lemma 3.7], and 2. from [4, Lemma 3.3]. Proof of Theorem 1.1. A suitable transfer homomorphism (as derived in [5, Lemma 3.5 and Theorem 7.2]) shows that it suffices to prove Theorem 1.1 for C0 -monoids defined in factorial monoids having finite groups of units. By [9, Proposition 4.5], we may restrict to reduced monoids. Let H be a reduced C0 -monoid defined in a factorial monoid F having a finite group of units F × . Thus H is as in the Main Proposition, and let A, W, Xw , Y and M be as there. First we show that, for every X ∈ {Xw | w ∈ W}, we have cX m (H) < ∞. By Proposition 3.1(5. and 6.) and Lemma 3.3.1, it follows that tX m (H, u) < ∞ for all u ∈ A. Therefore, Lemma 3.2.2 implies that cX (H) < ∞. m Now we show that the assertion of Theorem 1.1 holds with the constant w M = max{M(W[2] ), M, 2, cX m (H) | w ∈ W} ∈ N.
Let a ∈ H and z, z ∈ Z(a). If a ∈ H \ W[2] H, then d(z, z ) ≤ max L(a) ≤ M(W[2] ). Suppose that a ∈ W[2] H whence a ∈ w[[w]]H[W, w] for some w ∈ W and set X = Xw . Since Y is M-dense, there are z, z ∈ ZY (a) such that d(z, z) ≤ M and d(z , z ) ≤ M. By Proposition 3.1.4, there are y, y ∈ ZX (H), some b ∈ Z(H) and 2-chains of factorizations, all factorizations having the same lengths, from z to yb ∈ Z(a) and from z to y b. Since cX m (H) < ∞, there exists a monotone M -chain of factorizations ( y b, y1 b, . . . , yk b, y b) from yb to y b. Thus we obtain a monotone M -chain of factorizations from z to z , and the assertion follows.
Monotone Chains of Factorizations in C-Monoids
4
107
Construction of A, W, Xw , Y and M
We fix our notations which remain valid throughout the rest of this chapter. Let H be as in the Main Proposition, whence H ⊂ F = F × × [p1 , . . . , ps ] is a reduced C0 -monoid in the factorial monoid F , where F × is finite and p1 , . . . , ps ∈ F are pairwise nonassociated primes of F . Let α ∈ N be as in Theorem 2.2. In particular, we have H ∩ F × = H × = {1}, and H satisfies the congruence condition (C). By [7, Theorem 5.9], H is finitary, locally tame and has finite catenary degree. For x ∈ F we call supp(x) = {i ∈ [1, s] | vpi (x) > 0} the support of x. A subset E ⊂ [1, s] is called H-essential, if there exists some a ∈ H such that E = supp(a), and we denote by EH the set of all nonempty H-essential subsets of [1, s]. Construction 4.1. We define A = {u ∈ A(H) | vpi (u) < 4α for all i ∈ [1, s]}. Since F × is finite, A is finite, and obviously every uI = i∈I pα i , where I ∈ EH , has some irreducible divisor lying in A. Since {uI | I ∈ EH } is an almost generating set of H by [7, Proposition 5.6], A is an almost generating set by [8, Lemma 3.4.2]. Lemma 4.2. There exists a map Θ : H → H satisfying the following two properties: 1. For every a ∈ H and every i ∈ [1, s] we have: if vpi (a) < 4α, then vpi (a) = vpi (Θ(a)). If vpi (a) ≥ 4α, then vpi (a) ≡ vpi (Θ(a)) mod α and vpi (Θ(a)) ∈ [2α, 3α − 1]. 2. Θ(A(H)) ⊂ A. Proof. Let a ∈ H and i ∈ [1, s]. If vpi (a) < 4α, we set ki = 0. If vpi (a) ≥ 4α, let ki ∈ N such that vpi (a) − ki α ∈ [2α, 3α − 1]. We define Θ(a) = a ·
s
iα p−k . i
i=1
Then (C) implies that Θ(a) ∈ H. Suppose that a ∈ A(H) and assume to the contrary that Θ(a) = a1 a2 with a1 , a2 ∈ H \ H × . We construct a1 , a2 ∈ H \ H × such that a = a1 a2 , a contradiction. We set a1 = a1 ·
s i=1
l
pi1,i
α
and a2 = a2 ·
s
l
pi2,i
α
i=1
where l1,1 , ..., l1,s , l2,1 , ..., l2,s ∈ N0 are defined as follows. Let i ∈ [1, s]. If ki = 0, then l1,i = l2,i = 0 whence vpi (aj ) = vpi (aj ) for j ∈ [1, 2]. Suppose that ki ∈ N. If vpi (a1 ) ≥ α, then l1,i = ki and l2,i = 0. If vpi (a1 ) < α, then vpi (a2 ) = vpi (Θ(a)) − vpi (a1 ) ≥ α and we set l1,i = 0 and l2,i = ki . Then (C) implies that a1 , a2 ∈ H \ F × = H \ {1}, and by construction, we have a = a1 a2 .
108
Foroutan and Geroldinger
Lemma 4.3. Let u ∈ A(H), i ∈ [1, s] and n ∈ N0 . ∈ A(H). 1. If vpi (u) − nα ≥ 2α, then up−nα i 2. If vpi (u) ≥ 4α, then upnα ∈ A(H). i . Since pnα Proof. 1. Suppose that vpi (u) − nα ≥ 2α and set a = up−nα i a = u ∈ H, i it follows from (C) that a ∈ H. Assume to the contrary that a = a1 a2 with a1 , a2 ∈ H \ {1} and vpi (a1 ) ≥ vpi (a2 ). Then vpi (a1 ) ≥ α whence a1 pnα ∈ H \ {1} i and u = (a1 pnα ) · a , a contradiction. 2 i 2. Suppose that vpi (u) ≥ 4α. Again (C) implies that upnα ∈ H. Assume to i the contrary that upnα = a1 a2 with a1 , a2 ∈ H \ {1}. Without restriction we may i suppose that vpi (a1 ) ≥ 2α. We set vpi (a2 )−vpi (Θ(a2 ))−nα
a1 = a1 pi
vpi (Θ(a2 ))−vpi (a2 )
and a2 = a2 pi
.
Obviously, we have u = a1 a2 . We assert that a1 , a2 ∈ H \ {1} which implies a contradiction. Since vpi (a1 ) ≡ vpi (a1 ) mod α, and
vpi (a1 ) ≥ 2α
vpi (a1 ) = vpi (a1 ) + vpi (a2 ) − vpi (Θ(a2 )) − nα = vpi (u) + nα − vpi (Θ(a2 )) − nα ≥ 4α − 3α = α,
it follows that a1 ∈ H \ {1}. If vpi (a2 ) < 4α, then vpi (Θ(a2 )) = vpi (a2 ) whence a2 = a2 ∈ H \ {1}. If vpi (a2 ) ≥ 4α, then vpi (a2 ) = vpi (Θ(a2 )) ∈ [2α, 3α − 1] and since vpi (a2 ) ≡ vpi (a2 ) mod α, it follows that a2 ∈ H \ {1}. Let I ∈ EH be an H-essential subset. In the next step we define the subset XI ⊂ Z(H) (later, the elements of W will be indexed by EH and we shall write XI = XwI , see 4.6). Let I ⊂ I denote the set of all j ∈ I for which there exists some atom u ∈ A(H) with supp(u) ⊂ I
and vpj (u) ≥ 4α,
(∗)
and we set ΛI = {(I, j) | j ∈ I}. Let λ = (I, j) ∈ ΛI and nλ ∈ N0 . We fix some atom uλ ∈ A(H) having property (∗) and set (n ) pλ = pj and uλ λ = uλ pλnλ α . (nλ )
Then Lemma 4.3 implies that uλ
∈ A(H).
Construction 4.4. We define ΛI ΦI : NA 0 × N0
(m, n)
−→ Z(H) (n ) u mu uλ λ −→ u∈A
and set
λ∈ΛI
ΛI . XI = Φ NA 0 × N0
Monotone Chains of Factorizations in C-Monoids
109
For X = XI , we obviously have AX ⊂ X and A−1 X∩Z(H) ⊂ X. Furthermore, for every a ∈ H and every k ∈ LX (a) with k ≥ |ΛI |+1, it follows that ZX k (a)∩AZ(H) = ∅. Thus 2. in the Main Proposition holds, provided that M ≥ |ΛI | + 1 (cf. 4.6). We continue with a construction of a set Y which is dense in the set of all factorizations. Clearly, every tame generating set of a monoid gives rise to a dense subset of factorizations. We perform this construction for the canonical tame generating sets of complete ideals. Lemma 4.5. For I ∈ EH , we define wI =
α(s+1−|I|)
pi
i∈I
and we set W = {wI | I ∈ EH }. Then there exists some θ ∈ N with the following properties: 1. W [θ] is a full almost generating set of H and w[[w]]H[W [θ] , w] ∪ (H \ W [2θ] H). H= w∈W [θ]
2. For every I ∈ EH ,
λ∈ΛI
uλ divides wIθ .
3. There exists some M ∈ N with the following property: for every w ∈ W [θ] and every a ∈ w[[w]]H[W [θ] , w] there exist some a ∈ [[w]] and some b ∈ H[W [θ] , w] such that a = wa b and t(a, Z(wb)) ≤ M . Proof. We show that 1., 2., and 3. hold for all sufficiently large θ ∈ N. 1. The first assertion follows from [7, Proposition 5.7.1], and the second assertion from [6, Proposition 5.5]. 2. Since supp( λ∈ΛI uλ ) ⊂ I = supp(wI ), the assertion follows from [9, Lemma 4.2.2.(d)]. 3. We are going to apply [6, Theorem 5.10]. To do so, we must prove the following assertion: Assertion: There exists some M ∈ N such that for every w ∈ W and every a ∈ H(W [θ] , wθ ) there exist a ∈ [[w]] and some b ∈ H[W [θ] , wθ ] such that a = wθ a b and t(a, Z(b)) ≤ M . Once this is done, then the set
E= wθ H[W [θ] , wθ ] ∪ H \ W [2θ] H w∈W
is a tame generating set of H. In fact, the proof of [6, Theorem 5.10] shows the more precise statement of the Lemma. It remains to prove the Assertion. Let I ∈ EH , w = wI and a ∈ H(W [θ] , wθ ). By [7, Lemma 5.8.4], there exist some a ∈ [[w]] and some b ∈ H[W [θ] , wθ ] such that a = wθ a b and vpi (b) ≤ 2α − 1 for all i ∈ I. Since H[W [θ] , wθ ] ⊂ [[w]]−1 [[w]]H(W [θ] , wθ ) ∩ H,
110
Foroutan and Geroldinger
we may apply [7, Lemma 5.8.5 and Proposition 5.6.2] and [6, Lemma 5.9.1] to obtain that t(a, Z(b)) ≤ M for some bound M ∈ N depending only on H ⊂ F . Construction 4.6. Let W , θ and M be as in Lemma 4.5. We define W = W [θ]
and XwI = XI for every I ∈ EH .
For a ∈ H \ W[2] H, we set Z (a) = Z(a). For w ∈ W, we fix a factorization w ∈ Z(w) ∩ λ∈ΛI uλ Z(H). If a = wa b ∈ w[[w]]H[W, w] where a and b are as in Lemma 4.5.3, then we fix some b ∈ Z(b) and set Z (a) = wZ(a )b. We define Y= Z (a) ⊂ Z(H). a∈H
Then Y is M -dense by construction, and we define M = max{M, |ΛI | + 1 | I ∈ EH }. Thus 1., 2. and 3. of the Main Proposition hold true