Cofiniteness and Associated Primes of Local Cohomology Modules
Total Page:16
File Type:pdf, Size:1020Kb

Load more
Recommended publications
-
Scott Spaces and the Dcpo Category
SCOTT SPACES AND THE DCPO CATEGORY JORDAN BROWN Abstract. Directed-complete partial orders (dcpo’s) arise often in the study of λ-calculus. Here we investigate certain properties of dcpo’s and the Scott spaces they induce. We introduce a new construction which allows for the canonical extension of a partial order to a dcpo and give a proof that the dcpo introduced by Zhao, Xi, and Chen is well-filtered. Contents 1. Introduction 1 2. General Definitions and the Finite Case 2 3. Connectedness of Scott Spaces 5 4. The Categorical Structure of DCPO 6 5. Suprema and the Waybelow Relation 7 6. Hofmann-Mislove Theorem 9 7. Ordinal-Based DCPOs 11 8. Acknowledgments 13 References 13 1. Introduction Directed-complete partially ordered sets (dcpo’s) often arise in the study of λ-calculus. Namely, they are often used to construct models for λ theories. There are several versions of the λ-calculus, all of which attempt to describe the ‘computable’ functions. The first robust descriptions of λ-calculus appeared around the same time as the definition of Turing machines, and Turing’s paper introducing computing machines includes a proof that his computable functions are precisely the λ-definable ones [5] [8]. Though we do not address the λ-calculus directly here, an exposition of certain λ theories and the construction of Scott space models for them can be found in [1]. In these models, computable functions correspond to continuous functions with respect to the Scott topology. It is thus with an eye to the application of topological tools in the study of computability that we investigate the Scott topology. -
Journal of Pure and Applied Algebra Cofiniteness Conditions, Projective
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Pure and Applied Algebra 213 (2009) 458–475 Contents lists available at ScienceDirect Journal of Pure and Applied Algebra journal homepage: www.elsevier.com/locate/jpaa Cofiniteness conditions, projective covers and the logarithmic tensor product theory Yi-Zhi Huang ∗ Institut des Hautes Études Scientifiques, Le Bois-Marie, 35, Route De Chartres, F-91440 Bures-sur-Yvette, France article info a b s t r a c t Article history: We construct projective covers of irreducible V -modules in the category of grading- Received 11 March 2008 restricted generalized V -modules when V is a vertex operator algebra satisfying the Received in revised form 26 June 2008 following conditions: 1. V is C1-cofinite in the sense of Li. 2. There exists a positive integer Available online 29 August 2008 N such that the differences between the real parts of the lowest conformal weights of Communicated by C.A. Weibel irreducible V -modules are bounded by N and such that the associative algebra AN .V / is finite dimensional. This result shows that the category of grading-restricted generalized MSC: V -modules is a finite abelian category over . Using the existence of projective covers, we 17B69 C 81T40 prove that if such a vertex operator algebra V also satisfies Condition 3 that irreducible 18D10 V -modules are R-graded and C1-cofinite in the sense of the author, then the category of × grading-restricted generalized V -modules is closed under operations P.z/ for z 2 C . -
Endomorphisms of Symbolic Algebraic Varieties
J. Eur. Math. Soc. 1, 109–197 c Springer-Verlag & EMS 1999 M. Gromov Endomorphisms of symbolic algebraic varieties Received August 3, 1998 / final version received January 22, 1999 Abstract. The theorem of Ax says that any regular selfmapping of a complex algebraic variety is either surjective or non-injective; this property is called surjunctivity and investi- gated in the present paper in the category of proregular mappings of proalgebraic spaces. We show that such maps are surjunctive if they commute with sufficiently large automorphism groups. Of particular interest is the case of proalgebraic varieties over infinite graphs. The paper intends to bring out relations between model theory, algebraic geometry, and symbolic dynamics. 1. Ax’ surjunctivity theorem 1.A. Strict embeddings and surjunctivity. A map between sets is called a strict embedding, denoted f : X ⊂ Y, if it is one-to-one but not onto. 6= Then, following Gottschalk, (see [Gott, 1972]) a map f : X → Y is called surjunctive if it is not a strict embedding. In other words f is surjunctive iff it is either surjective or non-injective. 1.B. Theorem [Ax]1. Every regular selfmapping of a complex algebraic variety X is surjunctive. In other words no X admits a strict embedding X ⊂ X. Or, put it yet 6= another way, “one-to-one” implies “onto” for every regular map f : X → X. If X = Cn this specializes to the following earlier result by Bialynicki- Barula and Rosenlicht, (see [BB-R, 1962]). 1.B0. Every complex polynomial self-mapping of Cn is surjunctive. Repeat, this signifies that no strict polynomial embedding Cn ⊂ Cn is 6= possible, i.e. -
Pacific Journal of Mathematics Vol 230 Issue 2, Apr 2007
PACIFIC JOURNAL OF MATHEMATICS Pacific Journal of Mathematics Volume 230 No. 2 April 2007 Pacific Journal of Mathematics 2007 Vol. 230, No. 2 Volume 230 No. 2 April 2007 PACIFIC JOURNAL OF MATHEMATICS http://www.pjmath.org Founded in 1951 by E. F. Beckenbach (1906–1982) F. Wolf (1904–1989) EDITORS V. S. Varadarajan (Managing Editor) Department of Mathematics University of California Los Angeles, CA 90095-1555 pacifi[email protected] Vyjayanthi Chari Darren Long Sorin Popa Department of Mathematics Department of Mathematics Department of Mathematics University of California University of California University of California Riverside, CA 92521-0135 Santa Barbara, CA 93106-3080 Los Angeles, CA 90095-1555 [email protected] [email protected] [email protected] Robert Finn Jiang-Hua Lu Jie Qing Department of Mathematics Department of Mathematics Department of Mathematics Stanford University The University of Hong Kong University of California Stanford, CA 94305-2125 Pokfulam Rd., Hong Kong Santa Cruz, CA 95064 fi[email protected] [email protected] [email protected] Kefeng Liu Alexander Merkurjev Jonathan Rogawski Department of Mathematics Department of Mathematics Department of Mathematics University of California University of California University of California Los Angeles, CA 90095-1555 Los Angeles, CA 90095-1555 Los Angeles, CA 90095-1555 [email protected] [email protected] [email protected] PRODUCTION pacifi[email protected] Paulo Ney de Souza, Production Manager Silvio Levy, Senior Production Editor Alexandru Scorpan, Production Editor SUPPORTING INSTITUTIONS ACADEMIA SINICA, TAIPEI UNIVERSIDAD DE LOS ANDES UNIV. OF CALIF., SANTA CRUZ CALIFORNIA INST. OF TECHNOLOGY UNIV. -
Right Ideals of a Ring and Sublanguages of Science
RIGHT IDEALS OF A RING AND SUBLANGUAGES OF SCIENCE Javier Arias Navarro Ph.D. In General Linguistics and Spanish Language http://www.javierarias.info/ Abstract Among Zellig Harris’s numerous contributions to linguistics his theory of the sublanguages of science probably ranks among the most underrated. However, not only has this theory led to some exhaustive and meaningful applications in the study of the grammar of immunology language and its changes over time, but it also illustrates the nature of mathematical relations between chunks or subsets of a grammar and the language as a whole. This becomes most clear when dealing with the connection between metalanguage and language, as well as when reflecting on operators. This paper tries to justify the claim that the sublanguages of science stand in a particular algebraic relation to the rest of the language they are embedded in, namely, that of right ideals in a ring. Keywords: Zellig Sabbetai Harris, Information Structure of Language, Sublanguages of Science, Ideal Numbers, Ernst Kummer, Ideals, Richard Dedekind, Ring Theory, Right Ideals, Emmy Noether, Order Theory, Marshall Harvey Stone. §1. Preliminary Word In recent work (Arias 2015)1 a line of research has been outlined in which the basic tenets underpinning the algebraic treatment of language are explored. The claim was there made that the concept of ideal in a ring could account for the structure of so- called sublanguages of science in a very precise way. The present text is based on that work, by exploring in some detail the consequences of such statement. §2. Introduction Zellig Harris (1909-1992) contributions to the field of linguistics were manifold and in many respects of utmost significance. -
Contents 3 Homomorphisms, Ideals, and Quotients
Ring Theory (part 3): Homomorphisms, Ideals, and Quotients (by Evan Dummit, 2018, v. 1.01) Contents 3 Homomorphisms, Ideals, and Quotients 1 3.1 Ring Isomorphisms and Homomorphisms . 1 3.1.1 Ring Isomorphisms . 1 3.1.2 Ring Homomorphisms . 4 3.2 Ideals and Quotient Rings . 7 3.2.1 Ideals . 8 3.2.2 Quotient Rings . 9 3.2.3 Homomorphisms and Quotient Rings . 11 3.3 Properties of Ideals . 13 3.3.1 The Isomorphism Theorems . 13 3.3.2 Generation of Ideals . 14 3.3.3 Maximal and Prime Ideals . 17 3.3.4 The Chinese Remainder Theorem . 20 3.4 Rings of Fractions . 21 3 Homomorphisms, Ideals, and Quotients In this chapter, we will examine some more intricate properties of general rings. We begin with a discussion of isomorphisms, which provide a way of identifying two rings whose structures are identical, and then examine the broader class of ring homomorphisms, which are the structure-preserving functions from one ring to another. Next, we study ideals and quotient rings, which provide the most general version of modular arithmetic in a ring, and which are fundamentally connected with ring homomorphisms. We close with a detailed study of the structure of ideals and quotients in commutative rings with 1. 3.1 Ring Isomorphisms and Homomorphisms • We begin our study with a discussion of structure-preserving maps between rings. 3.1.1 Ring Isomorphisms • We have encountered several examples of rings with very similar structures. • For example, consider the two rings R = Z=6Z and S = (Z=2Z) × (Z=3Z). -
A Remark About Algebraicity in Complete Partial Orders
A remark ab out algebraicity in complete partial orders Draft Leonid Libkin Department of Computer and Information Science University of Pennsylvania Philadelphia PA USA Email libkinsaulcisupennedu Abstract I prove a characterization theorem for algebraic b ounded complete cp os similar to that for algebraic lattices It is wellknown that a lattice is algebraic i it isomorphic to a lattice of subalgebras of an algebra Algebraicity plays the central role in denotational semantics for programming languages but the structures used there are not exactly algebraic lattices they are complete algebraic partial orders In this note I shall characterize such p osets as p osets of certain subalgebras of partial algebras Let me recall the denitions A p oset is called complete and is usually abbreviated as a cpo if it contains least upp er b ounds or suprema of directed subsets I shall use t for supremum An element x of D is called compact if x tX where X D is directed implies x x for some x X A cp o is called algebraic if for any x D the set of compact elements b elow x is directed and its supremum equals x A cp o D is bounded complete if supremum of X D denoted by tX as well exists whenever X is b ounded ab ove in D ie there is a D such that a x for all x X I shall use a more convenient notation a a instead of tfa a g An element x of a b ounded complete cp o D is compact 1 n 1 n if whenever tX exists and x tX x tX where X X is nite In a b ounded complete cp o the set of compact elements b elow any element is always -
An Outline of Algebraic Set Theory
An Outline of Algebraic Set Theory Steve Awodey Dedicated to Saunders Mac Lane, 1909–2005 Abstract This survey article is intended to introduce the reader to the field of Algebraic Set Theory, in which models of set theory of a new and fascinating kind are determined algebraically. The method is quite robust, admitting adjustment in several respects to model different theories including classical, intuitionistic, bounded, and predicative ones. Under this scheme some familiar set theoretic properties are related to algebraic ones, like freeness, while others result from logical constraints, like definability. The overall theory is complete in two important respects: conventional elementary set theory axiomatizes the class of algebraic models, and the axioms provided for the abstract algebraic framework itself are also complete with respect to a range of natural models consisting of “ideals” of sets, suitably defined. Some previous results involving realizability, forcing, and sheaf models are subsumed, and the prospects for further such unification seem bright. 1 Contents 1 Introduction 3 2 The category of classes 10 2.1 Smallmaps ............................ 12 2.2 Powerclasses............................ 14 2.3 UniversesandInfinity . 15 2.4 Classcategories .......................... 16 2.5 Thetoposofsets ......................... 17 3 Algebraic models of set theory 18 3.1 ThesettheoryBIST ....................... 18 3.2 Algebraic soundness of BIST . 20 3.3 Algebraic completeness of BIST . 21 4 Classes as ideals of sets 23 4.1 Smallmapsandideals . .. .. 24 4.2 Powerclasses and universes . 26 4.3 Conservativity........................... 29 5 Ideal models 29 5.1 Freealgebras ........................... 29 5.2 Collection ............................. 30 5.3 Idealcompleteness . .. .. 32 6 Variations 33 References 36 2 1 Introduction Algebraic set theory (AST) is a new approach to the construction of models of set theory, invented by Andr´eJoyal and Ieke Moerdijk and first presented in [16]. -
A New Proof of the Completeness of the Lukasiewicz Axioms^)
A NEW PROOF OF THE COMPLETENESS OF THE LUKASIEWICZ AXIOMS^) BY C. C. CHANG The purpose of this note is to provide a new proof for the completeness of the Lukasiewicz axioms for infinite valued propositional logic. For the existing proof of completeness and a history of the problem in general we refer the readers to [l; 2; 3; 4]. The proof as was given in [4] was essentially metamathematical in nature; the proof we offer here is essentially algebraic in nature, which, to some extent, justifies the program initiated by the author in [2]. In what follows we assume thorough familiarity with the contents of [2] and adopt the notation and terminology of [2]. The crux of this proof is con- tained in the following two observations: Instead of using locally finite MV- algebras as the basic building blocks in the structure theory of MV-algebras, we shall use linearly ordered ones. The one-to-one correspondence between linearly ordered MV-algebras and segments of ordered abelian groups enables us to make use of some known results in the first-order theory of ordered abelian groups(2). We say that P is a prime ideal of an MV-algebra A if, and only if, (i) P is an ideal of A, and (ii) for each x, yEA, either xyEP or xyEP- Lemma 1. If P is a prime ideal of A, then A/P is a linearly ordered MV- algebra. Proof. By 3.11 of [2], we have to prove that given x/P and y/P, either x/P^y/P or y/P^x/P. -
On the Definition and K-Theory Realization of a Modular Functor
ON THE DEFINITION AND K-THEORY REALIZATION OF A MODULAR FUNCTOR IGOR KRIZ AND LUHANG LAI Abstract. We present a definition of a (super)-modular functor which includes certain interesting cases that previous definitions do not allow. We also introduce a notion of topological twisting of a modular functor, and construct formally a realization by a 2- dimensional topological field theory valued in twisted K-modules. We discuss, among other things, the N = 1-supersymmetric mini- mal models from the point of view of this formalism. 1. Introduction This paper is being written on the 10th anniversary of the publi- cation of the first author’s paper [32], and it grew out of a project of writing a sequel of [32], solving certain questions posed there, and also commenting on how the material relates to some topics of cur- rent interest. During the process of writing the paper, the authors received many comments asking for examples of their theory. Supple- mented with those examples, which required venturing into other fields of mathematics, the scope of the paper now exceeds by far what was originally intended. The original aim of [32] was to work out the modularity behavior arXiv:1310.5174v3 [math.KT] 7 Jan 2018 of certain series known in mathematical physics as partition functions of chiral conformal field theories with 1-dimensional conformal anom- aly. The author intended to use the outline of Segal [49], and work things out in more mathematical detail. However, unexpected compli- cations arose. In correspondence with P. Deligne [11] (see also [10]), the author learned that an important example of 1-dimensional confor- mal anomaly, known as the Quillen determinant of a Riemann surface, only satisfies the desired gluing axioms when considered as a super- line instead of just an ordinary complex line. -
Lattice Theory Lecture 2 Distributive Lattices
Lattice Theory Lecture 2 Distributive lattices John Harding New Mexico State University www.math.nmsu.edu/∼JohnHarding.html [email protected] Toulouse, July 2017 Distributive lattices Distributive law for all x; y; z x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z) Modular law if x ≤ z then x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z) Definition The lattices M5 and N5 are as follows: z x y z y x M5 N5 Note M5 is Modular, not distributive, and N5 is Non-modular. Both have 5 elements. 2 / 44 Recognizing distributive lattices Theorem Let L be a lattice. 1. L is modular iff N5 is not a sublattice of L 2. L is distributive iff neither M5; N5 is a sublattice of L Proof The \⇒" direction of each is obvious. For 1 \⇐" if L is not modular, there are x < z with x ∨ (y ∧ z) < (x ∨ y) ∧ (x ∨ z) (why?) Then the following is a sublattice of L. x ∨ y x y z y ( ∨ ) ∧ x ∨ (y ∧ z) y ∧ z 3 / 44 Exercise Give the details that the figure on the previous page is a sublattice. Do the 2 \⇐" direction. The lattice N5 is \projective" in lattices, meaning that if L is a lattice and f ∶ L → N5 is an onto lattice homomorphism, then there is a one-one lattice homomorphism g ∶ N5 → L with f ○ g = id. 4 / 44 Complements Definition Elements x; y of a bounded lattice L are complements if x ∧ y = 0 and x ∨ y = 1. In general, an element might have no complements, or many. 5 / 44 Complements Theorem In a bounded distributive lattice, an element has at most one complement. -
SEQUENCES FREED from ORDER 1. on Definitions of Sequence And
SEQUENCES FREED FROM ORDER SZYMON DOLECKI AND FRED´ ERIC´ MYNARD Abstract. Traditional definition of convergence of a sequence uses the order on the set of its indices, but the only structure, needed on that set to characterize convergence, is the cofinite topology. The only as- pect of a sequence from convergence point of view is that of the filter it generates. Sequential filters, the filters generated by sequences, are pre- cisely the images of cofinite filters of countably infinite sets. One cannot totally substitute sequences by the corresponding filters, because se- quences serve to list, but often it is useful to replace them by quences, that is, maps from countably infinite sets. 1. On definitions of sequence and subsequence A sequence on a set X is usually defined as a map from the ordered set of natural numbers to X and denoted by (x ) : Of course, a sequence can N n n N 2 be, and typically is, specified as the ordered list of its terms x0; x1; x2;::: Example 1.1. Consider the following sequences 1 1 1 (1.1) 1; 2 ; 3 ;::: n ;::: 1 1 1 (1.2) 1; 2 ; 1; 2 ; 1; 2 ;::: 1 1 1 1 1 1 1 (1.3) 1; 2 ; 2 ; 3 ; 3 ; 3 ;:::; n ;:::; n ;::: | {z } n times 1 1 1 1 1 1 1 (1.4) 1; 1; 2 ; 1; 2 ; 3 ; 1; 2 ; 3 ; 4 :::; 1;:::; n ;::: | {z } n terms on the set R (of real numbers). The sequence (1.1) is one-to-one, while (1.3) is finite-to-one.