Generic Flatness for Strongly Noetherian Algebras

Total Page:16

File Type:pdf, Size:1020Kb

Generic Flatness for Strongly Noetherian Algebras Journal of Algebra 221, 579–610 (1999) Article ID jabr.1999.7997, available online at http://www.idealibrary.com on Generic Flatness for Strongly Noetherian Algebras M. Artin* Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 View metadata, citation and similar papersE-mail: at core.ac.uk [email protected] brought to you by CORE provided by Elsevier - Publisher Connector L. W. Small Department of Mathematics, University of California at San Diego, La Jolla, California 92093 E-mail: [email protected] and J. J. Zhang Department of Mathematics, Box 354350, University of Washington, Seattle, Washington 98195 E-mail: [email protected] Communicated by J. T. Stafford Received November 18, 1999 Key Words: closed set; critically dense; generically flat; graded ring; Nullstellen- satz; strongly noetherian; universally noetherian. © 1999 Academic Press CONTENTS 0. Introduction. 1. Blowing up a critically dense sequence. 2. A characterization of closed sets. 3. Generic flatness. 4. Strongly noetherian and universally noetherian algebras. 5. A partial converse. *All three authors were supported in part by the NSF and the third author was also supported by a Sloan Research Fellowship. 579 0021-8693/99 $30.00 Copyright © 1999 by Academic Press All rights of reproduction in any form reserved. 580 artin, small, and zhang 0. INTRODUCTION In general, A will denote a right noetherian associative algebra over a commutative noetherian ring R.LetR0 be a commutative R-algebra. If R0 is finitely generated over R, then a version of the Hilbert basis theorem 0 asserts that A ⊗R R is right noetherian. We call an algebra A strongly right 0 0 noetherian if A ⊗R R is right noetherian whenever R is noetherian. The terms strongly noetherian and strongly graded noetherian are defined in a similar way. An example of Resco and Small [RS] shows that a finitely generated, right noetherian algebra may not be strongly right noetherian. This exam- ple is reviewed at the end of the paper (Example 5.11). But many standard constructions such as module-finite extension, localization, and Ore exten- sion preserve the strongly noetherian property (see Section 4). In general, one hopes that algebras which are sufficiently algebro-geometric will be strongly noetherian. This is true for the Sklyanin algebras (Corollary 4.12). It is not known whether or not every locally finite, -graded, right noethe- rian R-algebra is strongly right noetherian. (“Locally finite” means that An is a finite R-module for every n.) −1 If s is a nonzero element of a domain R, we call the ring Rs D Rs a simple localization. We say that an R-module M is generically flat over a do- main R if there is a simple localization Rs such that Ms D M ⊗R Rs is flat over Rs. Generically projective and generically free modules are defined sim- ilarly. It is a theorem of Grothendieck that every finite right A-module is generically free, if A is a finitely generated commutative R-algebra [EGA, IV3, 11.2.6.1; Ei2, 14.4]. This principle was first applied to noncommutative ring theory by Hall [Ha] and Quillen [Qu], and its applications were devel- oped further by Duflo [Du], Irving [Ir1], Joseph [Jo], McConnell [Mc], and Robson [McR1]. In most places, including those we have cited, people use the phrase “generically flat” to mean what we are calling “generically free.” However, the two notions are not equivalent, and we want to distinguish them. In- deed, one object of this paper is to prove Theorem 0.1, which is stated below and proved in Section 3. We call a commutative ring R or a scheme X admissible if it is of finite type over a ground ring which is either a field or an excellent Dedekind domain. (One can find the definition of excellent ring in [EGA, IV2, p. 214] or [Ma, p. 259].) Theorem 0.1. Let A be a strongly right noetherian algebra over an ad- missible domain R. Every finite right A-module is generically flat over R. The case that R is a polynomial ring kx and that A D M is its field of fractions shows that the word “flat” cannot be replaced by “free” in generic flatness 581 this statement. Moreover, Irving has given a general method to construct a finitely generated, strongly noetherian algebra A over a commutative noetherian domain R, and a finite A-module M which is not generically free over R. An example taken from [Ir1], in which R D , is reviewed at the end of this paper (Example 5.9). On the other hand, suppose that A =⊕An is a locally finite graded R- algebra and that M is a finite graded right A-module. Then each graded component Mn is a finite R-module, and M is flat over R if and only if Mn is projective over R for every n. In this case M is generically flat if and only if it is generically a graded projective, meaning that all of the graded pieces Mn can be made projective by inverting a single element of R. Furthermore, a theorem of Bass [Ba, 4.5] asserts that an infinitely generated projective module over a commutative domain is free, and of course a finitely generated projective module is generically free. Combining these remarks with Theorem 0.1 yields Theorems 0.2 and 0.3 below. These theorems are proved in Section 3, and Section 5 contains a partial converse to 0.2. Theorem 0.2. Let G be a group, let R be an admissible domain, and let A a be a locally finite, G-graded R-algebra. If A is strongly graded right noetherian, then every finite graded right A-module M is generically graded projective. According to Bass’ theorem, the graded module M is actually generically free, if one ignores the grading. We do not know whether or not all of its graded components can be made free using a single simple localization. If G is a polycyclic-by-finite group, then graded right noetherian is equiv- alent with right noetherian [CQ, 2.2]; hence strongly graded right noethe- rian is equivalent with strongly right noetherian. This is not true for all G. For example, a group algebra over a right noetherian ring is always graded right noetherian, but not necessarily right noetherian as an ungraded algebra. Note that Theorem 0.2 includes algebras graded by an abelian semigroup 0 with cancellation law such as -graded algebras, because such a semi- group embeds into a group G, and A can be G-graded by setting Ag D 0 if g 62 0. Theorem 0.3. Let R be an admissible domain, and let A be an -filtered R-algebra whose associated graded algebra is locally finite and strongly right noetherian. Then every finite right A-module is generically free. An algebra A is called a Jacobson algebra if every prime ideal is an in- tersection of primitive ideals. Following Irving, we say that an algebra A over a field k satisfies the Nullstellensatz if EndAM is algebraic over k for every simple right A-module M. (This is called the “endomorphism prop- 582 artin, small, and zhang erty” in [McR2].) If A is a finitely generated algebra over an uncountable field k, then A is a Jacobson algebra and the Nullstellensatz holds. It fol- lows from Quillen’s ideas that this is also true if A is right noetherian and if every finite right At-module is generically free over kt. On the other hand, Irving [Ir2] gave an example of a finitely generated right noetherian algebra A over a field which does not satisfy the Nullstellensatz, so there is a finite right At-module M which is not generically free over kt. The next theorem, which is proved in Section 3, does not depend on the pre- vious results. It is true because generic freeness is automatic for filtered algebras over a principal ideal domain: Theorem 0.4. Let A be an -filtered algebra over a field k, whose asso- ciated graded ring is locally finite and right noetherian. Then A is a Jacobson algebra which satisfies the Nullstellensatz. Our proof of Theorem 0.1 uses an infinite blowing up process to reduce to codimension one. The method seems interesting in its own right, and it might have another application. The following “curve criterion” for closed sets, which is proved in Section 2, is a simplified version: Theorem 0.5. A subset C of an admissible scheme X is closed if for every map φx X0 ! X, where X0 D Spec R0 and R0 is a Dedekind domain, the inverse image φ−1C is closed. In this theorem, it is not sufficient to take Dedekind domains of finite type over the ground ring as test rings, but see Theorem 2.1. We thank Paul Smith for supplying a graded version of the density the- orem (Theorem 4.21), Johan de Jong for Theorem 5.1, and Toby Stafford for suggesting a simplification in the proof of Theorem 5.4. 1. BLOWING UP A CRITICALLY DENSE SEQUENCE In the next two sections, the rings are commutative. An infinite subset C of a noetherian scheme X will be called critically dense if it consists of closed points, and if either of the following equivalent conditions holds: (1) for every proper closed subset Y ⊂ X, Y \ C is finite, or (2) every infinite subset of C is dense. Proposition 1.1. (1) An infinite subset of a critically dense set is criti- cally dense. (2) A scheme which contains a critically dense subset is irreducible.
Recommended publications
  • Fundamental Algebraic Geometry
    http://dx.doi.org/10.1090/surv/123 hematical Surveys and onographs olume 123 Fundamental Algebraic Geometry Grothendieck's FGA Explained Barbara Fantechi Lothar Gottsche Luc lllusie Steven L. Kleiman Nitin Nitsure AngeloVistoli American Mathematical Society U^VDED^ EDITORIAL COMMITTEE Jerry L. Bona Peter S. Landweber Michael G. Eastwood Michael P. Loss J. T. Stafford, Chair 2000 Mathematics Subject Classification. Primary 14-01, 14C20, 13D10, 14D15, 14K30, 18F10, 18D30. For additional information and updates on this book, visit www.ams.org/bookpages/surv-123 Library of Congress Cataloging-in-Publication Data Fundamental algebraic geometry : Grothendieck's FGA explained / Barbara Fantechi p. cm. — (Mathematical surveys and monographs, ISSN 0076-5376 ; v. 123) Includes bibliographical references and index. ISBN 0-8218-3541-6 (pbk. : acid-free paper) ISBN 0-8218-4245-5 (soft cover : acid-free paper) 1. Geometry, Algebraic. 2. Grothendieck groups. 3. Grothendieck categories. I Barbara, 1966- II. Mathematical surveys and monographs ; no. 123. QA564.F86 2005 516.3'5—dc22 2005053614 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294, USA.
    [Show full text]
  • Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces 3
    GENERIC GLOBAL RIGIDITY IN COMPLEX AND PSEUDO-EUCLIDEAN SPACES STEVEN J. GORTLER AND DYLAN P. THURSTON Abstract. In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo- Euclidean space (Rd with a metric of indefinite signature). We show that a graph is generically globally rigid in Euclidean space iff it is generically globally rigid in a complex or pseudo-Euclidean space. We also establish that global rigidity is always a generic property of a graph in complex space, and give a sufficient condition for it to be a generic property in a pseudo-Euclidean space. Extensions to hyperbolic space are also discussed. 1. Introduction The property of generic global rigidity of a graph in d-dimensional Euclidean space has recently been fully characterized [4, 7]. It is quite natural to study this property in other spaces as well. For example, recent work of Owen and Jackson [8] has studied the number of equivalent realizations of frameworks in C2. In this paper we study the property of generic global rigidity of graphs embedded in Cd as well as graphs embedded in a pseudo Euclidean space (Rd equipped with an indefinite metric signature). We show that a graph Γ is generically globally rigid (GGR) in d-dimensional Euclidean space iff Γ is GGR in d-dimensional complex space. Moreover, for any metric signature, s, We show that a graph Γ is GGR in d-dimensional Euclidean space iff Γ is GGR in d- dimensional real space under the signature s.
    [Show full text]
  • A Generic Property of the Bounded Syzygy Solutions Author(S): Florin N
    A Generic Property of the Bounded Syzygy Solutions Author(s): Florin N. Diacu Source: Proceedings of the American Mathematical Society, Vol. 116, No. 3 (Nov., 1992), pp. 809-812 Published by: American Mathematical Society Stable URL: http://www.jstor.org/stable/2159450 Accessed: 16/11/2009 21:52 Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at http://www.jstor.org/action/showPublisher?publisherCode=ams. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. American Mathematical Society is collaborating with JSTOR to digitize, preserve and extend access to Proceedings of the American Mathematical Society. http://www.jstor.org PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 116, Number 3, November 1992 A GENERIC PROPERTY OF THE BOUNDED SYZYGY SOLUTIONS FLORIN N.
    [Show full text]
  • Lids-R-904 Robust Stability of Linear Systems
    LIDS-R-904 ROBUST STABILITY OF LINEAR SYSTEMS - SOME COMPUTATIONAL CONSIDERATIONS* by Alan J. Laub** 1. INTRODUCTION In this paper we shall concentrate on some of the computational issues which arise in studying the robust stability of linear systems. Insofar as possible, we shall use notation consistent with Stein's paper [11 and we shall make frequent reference to that work. As we saw in [1] a basic stability question for a linear time-invariant system with transfer matrix G(s) is the following: given that a nominal closed-loop feedbadk system is stable, does the feedback system remain stable when subjected to perturbations and how large can those perturba- tions be? It turned out, through invocation of the Nyquist Criterion, that the size of the allowable perturbations was related to the "nearness to singularity" of the return difference matrix I + G(jW). Closed-loop stability was said to be "robust" if G could tolerate considerable perturbation before I + G became singular. Invited Paper presented at the Second Annual Workshop on the Informa- tion Linkage between Applied Mathematics and Industry held at Naval Postgraduate School, Monterey, California, Feb. 20-24, 1979; this research was partially supported by NASA under grant NGL-22-009-124 and the Department of Energy under grant ET-78-(01-3395). ** Laboratory for Information and Decision Systems, Pm. 35-331, M.I.T., Cambridge, MA 02139. -2- We shall now indulge in a modicum of abstraction and attempt to formalize the notion of robustness. The definition will employ some jargon from algebraic geometry and will be applicable to a variety of situations.
    [Show full text]
  • Generic Continuous Functions and Other Strange Functions in Classical Real Analysis
    Georgia State University ScholarWorks @ Georgia State University Mathematics Theses Department of Mathematics and Statistics 4-17-2008 Generic Continuous Functions and other Strange Functions in Classical Real Analysis Douglas Albert Woolley Follow this and additional works at: https://scholarworks.gsu.edu/math_theses Part of the Mathematics Commons Recommended Citation Woolley, Douglas Albert, "Generic Continuous Functions and other Strange Functions in Classical Real Analysis." Thesis, Georgia State University, 2008. https://scholarworks.gsu.edu/math_theses/44 This Thesis is brought to you for free and open access by the Department of Mathematics and Statistics at ScholarWorks @ Georgia State University. It has been accepted for inclusion in Mathematics Theses by an authorized administrator of ScholarWorks @ Georgia State University. For more information, please contact [email protected]. GENERIC CONTINUOUS FUNCTIONS AND OTHER STRANGE FUNCTIONS IN CLASSICAL REAL ANALYSIS by Douglas A. Woolley Under the direction of Mihaly Bakonyi ABSTRACT In this paper we examine continuous functions which on the surface seem to defy well-known mathematical principles. Before describing these functions, we introduce the Baire Cate- gory theorem and the Cantor set, which are critical in describing some of the functions and counterexamples. We then describe generic continuous functions, which are nowhere differ- entiable and monotone on no interval, and we include an example of such a function. We then construct a more conceptually challenging function, one which is everywhere differen- tiable but monotone on no interval. We also examine the Cantor function, a nonconstant continuous function with a zero derivative almost everywhere. The final section deals with products of derivatives. INDEX WORDS: Baire, Cantor, Generic Functions, Nowhere Differentiable GENERIC CONTINUOUS FUNCTIONS AND OTHER STRANGE FUNCTIONS IN CLASSICAL REAL ANALYSIS by Douglas A.
    [Show full text]
  • Non-Commutative Cryptography and Complexity of Group-Theoretic Problems
    Mathematical Surveys and Monographs Volume 177 Non-commutative Cryptography and Complexity of Group-theoretic Problems Alexei Myasnikov Vladimir Shpilrain Alexander Ushakov With an appendix by Natalia Mosina American Mathematical Society http://dx.doi.org/10.1090/surv/177 Mathematical Surveys and Monographs Volume 177 Non-commutative Cryptography and Complexity of Group-theoretic Problems Alexei Myasnikov Vladimir Shpilrain Alexander Ushakov With an appendix by Natalia Mosina American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE Ralph L. Cohen, Chair MichaelA.Singer Jordan S. Ellenberg Benjamin Sudakov MichaelI.Weinstein 2010 Mathematics Subject Classification. Primary 94A60, 20F10, 68Q25, 94A62, 11T71. For additional information and updates on this book, visit www.ams.org/bookpages/surv-177 Library of Congress Cataloging-in-Publication Data Myasnikov, Alexei G., 1955– Non-commutative cryptography and complexity of group-theoretic problems / Alexei Myas- nikov, Vladimir Shpilrain, Alexander Ushakov ; with an appendix by Natalia Mosina. p. cm. – (Mathematical surveys and monographs ; v. 177) Includes bibliographical references and index. ISBN 978-0-8218-5360-3 (alk. paper) 1. Combinatorial group theory. 2. Cryptography. 3. Computer algorithms. 4. Number theory. I. Shpilrain, Vladimir, 1960– II. Ushakov, Alexander. III. Title. QA182.5.M934 2011 005.82–dc23 2011020554 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society.
    [Show full text]
  • 2 Negligible Sets 15 2.1 Porosity
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by idUS. Depósito de Investigación Universidad de Sevilla FACULTAD DE MATEMATICAS´ DEPARTAMENTO DE ANALISIS´ MATEMATICO´ GENERICITY OF THE FIXED POINT PROPERTY UNDER RENORMING Ph. D. Thesis presented by Supaluk Phothi UNIVERSIDAD DE SEVILLA FACULTAD DE MATEMATICAS´ DEPARTAMENTO DE ANALISIS´ MATEMATICO´ GENERICITY OF THE FIXED POINT PROPERTY UNDER RENORMING Memoria presentada por Supaluk Phothi para optar al grado de Doctora en Matemticas por la Universidad de Sevilla Fdo. Supaluk Phothi V◦.B◦.: Director del trabajo Fdo. Tom´asDom´ınguezBenavides Catedr´aticodel Departamento de An´alisisMatem´atico de la Universidad de Sevilla Sevilla, Julio de 2010 RESUMEN Una aplicaci´on T definida de un espacio m´etrico M en M se dice no expan- siva si d(T x; T y) ≤ d(x; y) para todo x; y 2 M. Diremos que un espacio de Banach X tiene la Propiedad D´ebildel Punto Fijo (w-FPP) si para toda aplicaci´onno expansiva T definida de un subconjunto d´ebilmente compacto convexo C de X en C tiene un punto fijo. En esta disertaci´on,estudiamos principalmente la w-FPP como una propiedad gen´ericaen el conjunto de todas las normas equivalentes de un espacio de Banach reflexivo dado. Una propiedad P se dice gen´ericaen un conjunto A si todos los elementos de A sat- isfacen P excepto aquellos pertenecientes a un conjunto de tama~nopeque~no. Con el fin de establecer los resultados de este trabajo, consideraremos varias nociones de conjuntos peque~nos,como por ejemplo los conjuntos de Baire de primera categor´ıa,conjuntos porosos, conjuntos nulos Gausianos o conjuntos direccionalmente porosos.
    [Show full text]
  • Higher Dimensional Trichotomy Conjectures in Model Theory By
    Higher Dimensional Trichotomy Conjectures in Model Theory by Benjamin Castle A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Thomas Scanlon, Chair Associate Professor Pierre Simon Associate Professor Adityanand Guntuboyina Spring 2021 Higher Dimensional Trichotomy Conjectures in Model Theory Copyright 2021 by Benjamin Castle 1 Abstract Higher Dimensional Trichotomy Conjectures in Model Theory by Benjamin Castle Doctor of Philosophy in Mathematics University of California, Berkeley Professor Thomas Scanlon, Chair In this thesis we study the Restricted Trichotomy Conjectures for algebraically closed and o-minimal fields. These conjectures predict a classification of all sufficiently complex, that is, non-locally modular, strongly minimal structures which can be interpreted from such fields. Such problems have been historically divided into `lower dimensional' and `higher dimen- sional' cases; this thesis is devoted to a number of partial results in the higher dimensional cases. In particular, in ACF0 and over o-minimal fields, we prove that all higher dimensional strongly minimal structures whose definable sets satisfy certain geometric restrictions are locally modular. We also make progress toward verifying these geometric restrictions in any counterexample. Finally, in the last chapter we give a full proof of local modularity for strongly minimal expansions of higher dimensional groups in ACF0. i To Katrina and Justin ii Contents Contents ii 1 Introduction 1 1.1 Historical Background . 1 1.2 The Challenge of Working in Higher Dimensions . 3 1.3 Outline of Results . 5 2 Preliminaries on Strongly Minimal Sets 7 2.1 Strong Minimality and Dimension .
    [Show full text]
  • CHARACTERIZING GENERIC GLOBAL RIGIDITY 1. Introduction In
    CHARACTERIZING GENERIC GLOBAL RIGIDITY STEVEN J. GORTLER, ALEXANDER D. HEALY, AND DYLAN P. THURSTON d Abstract. A d-dimensional framework is a graph and a map from its vertices to E . d Such a framework is globally rigid if it is the only framework in E with the same graph and edge lengths, up to rigid motions. For which underlying graphs is a generic framework globally rigid? We answer this question by proving a conjecture by Connelly, that his sufficient condition is also necessary. The condition comes from considering the geometry of the length-squared mapping `; essentially, the graph is generically locally rigid iff the rank of ` is maximal, and it is generically globally rigid iff the rank of the Gauss map on the image of ` is maximal. We also show that this condition is efficiently checkable with a randomized algorithm. 1. Introduction In this paper we characterize those generic frameworks which are globally rigid in d- dimensional Euclidean space. We do this by proving a conjecture of Connelly [8], who described a sufficient condition for generic frameworks to be globally rigid, and conjectured that this condition was necessary. As the truth of this condition depends only on the graph and the dimension d, and not on the specific framework of that graph, we can conclude that generic global rigidity in Ed is a property of a graph. We further show that this property can be checked in probabilistic polynomial time. Global rigidity has applications in chemistry, where various technologies measure inter- atomic distances. From this data one may try to infer the geometry of the configuration [9, inter alia].
    [Show full text]
  • On the Generic Low-Rank Matrix Completion
    On the Generic Low-Rank Matrix Completion Yuan Zhang, Yuanqing Xia∗, Hongwei Zhang, Gang Wang, and Li Dai Abstract—This paper investigates the low-rank matrix com- where the matrix to be completed consists of spatial coordi- pletion (LRMC) problem from a generic vantage point. Unlike nates and temporal (frame) indices [9, 10]. most existing work that has focused on recovering a low-rank matrix from a subset of the entries with specified values, the The holy grail of the LRMC is that, the essential information only information available here is just the pattern (i.e., positions) of a low-rank matrix could be contained in a small subset of of observed entries. To be precise, given is an n × m pattern matrix (n ≤ m) whose entries take fixed zero, unknown generic entries. Therefore, there is a chance to complete a matrix from values, and missing values that are free to be chosen from the a few observed entries [5, 11, 12]. complex field, the question of interest is whether there is a matrix completion with rank no more than n − k (k ≥ 1) for almost all Thanks to the widespread applications of LRMC in di- values of the unknown generic entries, which is called the generic verse fields, many LRMC techniques have been developed low-rank matrix completion (GLRMC) associated with (M,k), [4, 5, 8, 12–16]; see [11, 17] for related survey. Since the rank and abbreviated as GLRMC(M,k). Leveraging an elementary constraint is nonconvex, the minimum rank matrix completion tool from the theory on systems of polynomial equations, we give a simple proof for genericity of this problem, which was first (MRMC) problem which asks for the minimum rank over observed by Kirly et al., that is, depending on the pattern of the all possible matrix completions, is NP-hard [4].
    [Show full text]
  • The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
    Journal of Machine Learning Research 16 (2015) 1391-1436 Submitted 4/13; Revised 8/14; Published 8/15 The Algebraic Combinatorial Approach for Low-Rank Matrix Completion Franz J. Kir´aly [email protected] Department of Statistical Science University College London London WC1E 6BT, United Kingdom and Mathematisches Forschungsinstitut Oberwolfach 77709 Oberwolfach-Walke, Germany Louis Theran [email protected] Aalto Science Institute and Department of Information and Computer Science∗ Aalto University 02150 Espoo, Finland Ryota Tomioka [email protected] Toyota Technological Institute at Chicago 6045 S. Kenwood Ave. Chicago, Illinois 60637, USA Editor: G´abor Lugosi Abstract We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the treatment of single entries in a closed theoretical and practical framework. More specifically, apart from introducing an algebraic combinatorial theory of low-rank matrix completion, we present probability- one algorithms to decide whether a particular entry of the matrix can be completed. We also describe methods to complete that entry from a few others, and to estimate the error which is incurred by any method completing that entry. Furthermore, we show how known results on matrix completion and their sampling assumptions can be related to our new perspective and interpreted in terms of a completability phase transition.1 Keywords: Low-rank matrix completion, entry-wise completion, matrix reconstruction, algebraic combinatorics ∗. Author's current address. Research was carried out while the author was at Freie Universit¨atBerlin and supported by the European Research Council under the European Union's Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement no 247029-SDModels 1.
    [Show full text]
  • Hilbert Specialization of Parametrized Varieties 2 Holds in the Case of a K(T )-Variety of Codimension Bigger Than 1
    HILBERT SPECIALIZATION OF PARAMETRIZED VARIETIES ANGELO IADAROLA Abstract. Hilbert specialization is an important tool in Field Arithmetic and Arithmetic Geometry, which has usually been intended for polynomials, hence hypersurfaces, and at scalar values. In this article, first, we extend this tool to prime ideals, hence affine varieties, and offer an application to the study of the irreducibility of the intersection of varieties. Then, encouraged by recent results, we consider the more general situation in which the specialization is done at polynomial values, instead of scalar values. 1. Introduction Hilbert Irreducibility Theorem has been a core result in Field Arithmetic for many decades. A simple form, see for example [FJ08, Page 218], says that, given an irreducible polynomial P (T, Y ) in Q(T )[Y ], one can find infinitely many t ∈ Q such that the so-called specialized polynomial P (t, Y ) is irreducible in Q[Y ]. This result has been generalized under many aspects. First of all, the notion of Hilbertian field has been introduced to identify all those fields K for which the previous statement is verified in the case of polynomials, which are separable in Y , if we replace Q with K, see for example [FJ08, Page 218]. Moreover, if K is of characteristic 0 or imperfect, the same result holds if we replace a separable irreducible polynomial in two variables P (T, Y ) in K(T )[Y ] with several irreducible polynomials P1(T , Y ),...,Pn(T , Y ) in K(T )[Y ] in two arrays of variables, T = (T1,...,Tr) and Y = (Y1,...,Ys) for r, s positive integers: we can find a Zariski- r dense subset H ⊂ AK such that the polynomial Pi(t, Y ) is irreducible in K[Y ] for every t ∈ H and i =1,...,n, see for example [FJ08, Section 12.1].
    [Show full text]