DOCSLIB.ORG

Course Digest for MATH 831 Spring 2021 Lecture 25 (Thursday, April 29) Our Goal for the Day Was to Prove the Theorem: If M Is A

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Course Digest for MATH 831 Spring 2021 Lecture 25 (Thursday, April 29) Our Goal for the Day Was to Prove the Theorem: If M Is A Course Digest for MATH 831 Spring 2021 Lecture 25 (Thursday, April 29) Our goal for the day was to prove the Theorem: If M is a nonzero finitely-generated D-module, then n ≤ dimD(M) ≤ 2n. To establish the upper bound, we related the D-module dimension and multiplicity of finitely-generated D-modules appearing in a short exact sequence of D-modules. As a corollary of this, we proved that D-module dimension cannot increase upon taking quotients, and that the behavior of D-module dimension and multiplicity is well-behaved with respect to the formation of direct sums. We then used this to establish the upper bound of 2n on the dimension of a nonzero finitely generated D-module. We also proved that the D-module dimension of a quotient M=N must be less than M when M = D, and N is a left ideal of D. This result used the fact that multiplicity is additive across short exact sequences when the dimensions of the outer terms agree. After this, we presented a sketch of a proof of Bernstein's Inequality, which is the lower bound on dimensions given above. This was only a sketch, because we did not prove one key step, which is described in the exercises below, and may appear in our last worksheet. Exercises Suppose that M is a finitely-generated D-module, and consider a good filtration G• such that G0, and hence Gi for all i, is nonzero (we recalled why such a filtration exists in lecture). Then, prove that the map i i 2i B ! Hom|(G ;G ) that maps an operator P to the |-linear map given by left multiplication by P . Hint: Induce on i. More hints may appear in the worksheet, but just give it a try on your own for now. Lecture 24 (Tuesday, April 27) We started off by discussing some more general facts of Hilbert polynomials. After that, we re-presented our proof that good filtrations are small (since it was rushed last time), and then used this fact to prove the following fact: If M is a finitely-generated • • D-module, with good filtrations G and H , then there exist positive integers `1; `2 such that i−` i i+` H 2 ⊆ G ⊆ H 1 for each i ≥ 0. Taking |-dimensions, and then interpreting this in terms of the associated Hilbert polynomials hG• (t) and hH• (t), we concluded that the degrees and leading terms of these polynomials must agree. Using this fact, we were able to define the notions of dimension and multiplicity for D-modules. To illustrate this definition, by considering some canonical good filtrations on D and R, we proved that the D-module dimension of D is 2n, that the D-module dimension of R is n, and that the D-module multiplicity of each of these modules is 1. We concluded by stating (but not proving) a result that shows that these two dimensions are extremal. Exercises Consider a function H : Z ! Z. Prove that there exists a numeric polynomial h(t) 2 Q[t] such that H(s) = h(s) for all s 0 if and only if there exists a numeric polynomial g(t) 2 Q[t] such that the function ΣH : Z ! Z defined by s 7! H(0) + ··· + H(s) agrees with g(s) for all s 0. Note: This is meant to show that the existence of a Hilbert polynomial for the function s 7! dim| M0 +··· dim| Ms, which is how we defined Hilbert functions associated to graded modules 1 M = ⊕i=0Mi over polynomial rings over |, is equivalent to the existence of a Hilbert polynomial for the function s 7! dim| Ms, which is how Hilbert functions associated to graded modules are also commonly defined. Of course, our choice of Hilbert function comes from the fact that the ΣH version is most convenient when dealing when graded modules coming from a filtration. 1 2 Lecture 23 (Thursday, April 22) Having developed the basic theory of Hilbert polynomials, we returned today to looking at D-module theory. We call a filtered (D; B•)-module (M; G•) good • 0 • if each component of G finite dimensional over | = B , and gr(M; G ) is finitely-generated over the polynomial ring S = gr(D; B•). In this case, the Hilbert function associated to gr(M; G•) s is simply s 7! dim| G , and we call the associated Hilbert polynomial hG• (t) 2 Q[t] the Hilbert polynomial associated to the filtration G•. Most of the lecture was dedicated to studying properties of good filtrations. For example, we proved that if M is a finitely-generated D-module, then good filtrations on M exist; when combined with a problem from our most recent worksheet, we see that good filtrations exist on a D-module M if and only if M is finitely-generated over D. We also characterized good filtrations (M; G•) as exactly those such that each Gi is finite-dimensional over 0 j∗ i j∗ i+j∗ | = B , and such that there exists a definitive component G , in the sense that B G = G for each i ≥ 0. Using this, we concluded the lecture by demonstrating that good filtrations must be small. Lecture 22 (Tuesday, April 20) Today, we focused on proving the existence of Hilbert polynomials. t t t We started off by describing how to use the Q-basis 0 ; 1 ;:::; d for Q[t]≤d to describe numeric polynomials of degree d, and using this, and some corollaries, we gave a proof of the existence of Hilbert polynomials. We concluded by returning to the setting of rings of differential operators, and explaining how we can use this to define the D-module dimension. There are still some issues concerning the existence of so-called good filtrations that we will need to consider. Exercises Take another close look at the Worksheet, which has updates that address some feed- back/questions from the class. In particular, the problems about exact sequences induced from filtrations has changed. The new problem is less ambitious, but it is correct, and should cover a number of applications, both in the worksheet, as well as in some upcoming lectures. Also, a sequence of ideals that more efficiently illustrates non-Noetherianity in prime characteristic has been included. If you used the original sequence, it still works, and you shouldn't need to modify your write-up, if you have already completed it. Lecture 21 (Thursday, April 15) We continued our discussion of filtered rings. After recalling the construction of (A; F •) 7! gr(A; F •). Then, we defined what it means for (M; G•) to be a left (A; F •)-module, and went over the construction (M; G•) 7! gr(M; G•), the associated graded module. Motivated by this, we discussed graded modules over graded rings, in general, and mo- tivated by our desire to have a good dimension theory in the graded case, we defined the notion of Hilbert functions associated to graded modules, and we computed them for polynomial rings in a small number of variables. Motivated by the existence of Hilbert polynomials (which we stated, but will only prove next time), we temporarily shifted our focus to studying numerical, or numeric, polynomials f(t) 2 Q[t]. We discussed a characterization using a nice basis of binomial polynomials in Q[t], and will pick up here next time. Exercises (1) Start the new worksheet. 1 (2) If R = |[x1; : : : ; xn] is a polynomial ring, and M = ⊕i=0Mi is a finitely-generated and graded R-module, then dim|(Mi) < 1 for every i. Hint: Use the worksheet to see that M 3 can be generated by finitely many homogeneous elements, and also to see how to describe elements in Mi in terms of such a generating set. Finally, use that dim| Ri < 1 for each i. Lecture 20 (Tuesday, April 13) Our focus today was on graded and filtered rings. We started by getting some practice with graded ideals, by proving that a graded ideal of a graded ring that is prime with respect to homogeneous elements is a prime ideal. After this, we defined what it means for (A; F •) to be an (ascending, exhaustive, multiplicative) filtered ring, and we connected this notion to graded rings. We pointed out some canonical examples from differential • • operators, defining the order filtration D = DR=k on D = DR=k for an arbitrary inclusion k ⊆ R of commutative rings. In the special case that R = |[x1; : : : ; xn], and | is a field of characteristic zero, then we also defined the Bernstein filtration B• = B• by the rule R=| i u v B = |fx @ : kuk + kvk ≤ ig We observed how this is a filtration of D by finite dimensional |-vector spaces, and after defining associated graded rings, we proved that gr(D; B•) is a polynomial ring in 2n-variables. We briefly discussed the consequences of this. p Exercises Prove that if R is a graded ring, and I is a graded ideal, the the radical I = ff 2 I : f n 2 Ig is a graded ideal of R. Lecture 19 (Thursday, April 8) Announcement: There is an upcoming worksheet on Noether- ian rings and modules, in the context of differential operators. We continued our discussion of D-modules. After revisiting the D-module C[x1; : : : ; xn]f , we shifted our attention to homo- geneous systems of linear PDEs. More precisely, we proved that if P1(f) = ··· Pm(f) = 0 is such a system, then the space of polynomial solutions of this system can be identified with P HomD(D= DPi; C[x1; : : : ; xn]).
Load more

Recommended publications
  • Dynamic Algebras: Examples, Constructions, Applications
    Dynamic Algebras: Examples, Constructions, Applications Vaughan Pratt∗ Dept. of Computer Science, Stanford, CA 94305 Abstract Dynamic algebras combine the classes of Boolean (B ∨ 0 0) and regu- lar (R ∪ ; ∗) algebras into a single finitely axiomatized variety (BR 3) resembling an R-module with “scalar” multiplication 3. The basic result is that ∗ is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result is that free dynamic algebras are residu- ally finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of propositional dynamic logic, and yet another notion of regular algebra. Key words: Dynamic algebra, logic, program verification, regular algebra. This paper originally appeared as Technical Memo #138, Laboratory for Computer Science, MIT, July 1979, and was subsequently revised, shortened, retitled, and published as [Pra80b]. After more than a decade of armtwisting I. N´emeti and H. Andr´eka finally persuaded the author to publish TM#138 itself on the ground that it contained a substantial body of interesting material that for the sake of brevity had been deleted from the STOC-80 version. The principal changes here to TM#138 are the addition of footnotes and the sections at the end on retrospective citations and reflections. ∗This research was supported by the National Science Foundation under NSF grant no.
    [Show full text]
  • Algebra + Homotopy = Operad
    Symplectic, Poisson and Noncommutative Geometry MSRI Publications Volume 62, 2014 Algebra + homotopy = operad BRUNO VALLETTE “If I could only understand the beautiful consequences following from the concise proposition d 2 0.” —Henri Cartan D This survey provides an elementary introduction to operads and to their ap- plications in homotopical algebra. The aim is to explain how the notion of an operad was prompted by the necessity to have an algebraic object which encodes higher homotopies. We try to show how universal this theory is by giving many applications in algebra, geometry, topology, and mathematical physics. (This text is accessible to any student knowing what tensor products, chain complexes, and categories are.) Introduction 229 1. When algebra meets homotopy 230 2. Operads 239 3. Operadic syzygies 253 4. Homotopy transfer theorem 272 Conclusion 283 Acknowledgements 284 References 284 Introduction Galois explained to us that operations acting on the solutions of algebraic equa- tions are mathematical objects as well. The notion of an operad was created in order to have a well defined mathematical object which encodes “operations”. Its name is a portemanteau word, coming from the contraction of the words “operations” and “monad”, because an operad can be defined as a monad encoding operations. The introduction of this notion was prompted in the 60’s, by the necessity of working with higher operations made up of higher homotopies appearing in algebraic topology. Algebra is the study of algebraic structures with respect to isomorphisms. Given two isomorphic vector spaces and one algebra structure on one of them, 229 230 BRUNO VALLETTE one can always define, by means of transfer, an algebra structure on the other space such that these two algebra structures become isomorphic.
    [Show full text]
  • On Minimally Free Algebras
    Can. J. Math., Vol. XXXVII, No. 5, 1985, pp. 963-978 ON MINIMALLY FREE ALGEBRAS PAUL BANKSTON AND RICHARD SCHUTT 1. Introduction. For us an "algebra" is a finitary "universal algebra" in the sense of G. Birkhoff [9]. We are concerned in this paper with algebras whose endomorphisms are determined by small subsets. For example, an algebra A is rigid (in the strong sense) if the only endomorphism on A is the identity id^. In this case, the empty set determines the endomorphism set E(A). We place the property of rigidity at the bottom rung of a cardinal-indexed ladder of properties as follows. Given a cardinal number K, an algebra .4 is minimally free over a set of cardinality K (K-free for short) if there is a subset X Q A of cardinality K such that every function f\X —-> A extends to a unique endomorphism <p e E(A). (It is clear that A is rigid if and only if A is 0-free.) Members of X will be called counters; and we will be interested in how badly counters can fail to generate the algebra. The property "«-free" is a solipsistic version of "free on K generators" in the sense that A has this property if and only if A is free over a set of cardinality K relative to the concrete category whose sole object is A and whose morphisms are the endomorphisms of A (thus explaining the use of the adverb "minimally" above). In view of this we see that the free algebras on K generators relative to any variety give us examples of "small" K-free algebras.
    [Show full text]
  • The Freealg Package: the Free Algebra in R
    The freealg package: the free algebra in R Robin K. S. Hankin 2021-04-19 Introduction The freealg package provides some functionality for the free algebra, using the Standard Template library of C++, commonly known as the STL. It is very like the mvp package for multivariate polynomials, but the indeterminates do not commute: multiplication is word concatenation. The free algebra A vector space over a commutative field F (here the reals) is a set V together with two binary operations, addition and scalar multiplication. Addition, usually written +, makes (V, +) an Abelian group. Scalar multiplication is usually denoted by juxtaposition (or sometimes ×) and makes (V, ·) a semigroup. In addition, for any a, b ∈ F and u, v ∈ V, the following laws are satisfied: • Compatibility: a (bv) = (ab)v • Identity: 1v = v, where 1 ∈ F is the multiplicative identity • Distributivity of vector addition: a (u + v) = au + bv • Distributivity of field addition: (a + b)v = av + bv An algebra is a vector space endowed with a binary operation, usually denoted by either a dot or juxtaposition of vectors, from V × V to V satisfying: • Left distributivity: u · (v + w) = u · v + u · w. • Right distributivity: (u + v) · w = u · w + v · w. • Compatibility: (au) · (bv) = (ab)(u · v). There is no requirement for vector multiplication to be commutative. Here we assume associativity so in addition to the axioms above we have • Associativity: (u · v) · w = u · (v · w). The free associative algebra is, in one sense, the most general associative algebra. Here we follow standard terminology and drop the word ‘associative’ while retaining the assumption of associativity.
    [Show full text]
  • The Clifford Algebra and the Group of Similitudes
    THE CLIFFORD ALGEBRA AND THE GROUP OF SIMILITUDES MARIA J. WONENBURGER Let C(M, Q) be the Clifford algebra of an even dimensional vector space M relative to a quadratic form Q. When Q is non-degenerate, it is well known that there exists an isomorphism of the orthogonal group 0(Q) onto the group of those automorphisms of C(M, Q) which leave invariant the space M C C(M, Q). These automorphisms are inner and the group of invertible elements of C(M, Q) which define such inner automorphisms is called the Clifford group. If instead of the group 0(Q) we take the group of similitudes y(Q) or even the group of semi-similitudes Ty(Q), it is possible to associate in a natural way with any element of these groups an automorphism or semi-automorphism, respectively, of the subalgebra of even elements C+(M, Q) C C(M, Q). Each one of the automorphisms of C+(M, Q) so defined can be extended, as it is shown here (Theorem 2), to an inner automorphism of C(M, Q), although the extension is not unique. A semi-automorphism of C+(M, Q) associated to a semi-similitude of Q can be extended to all of C(M, Q) if and only if the ratio of the semi-similitude satisfies the conditions given in Theorem 3. Although the extension is not unique, Theorem 3 gives all the possible ex­ tensions. We do not know if there exist semi-similitudes whose ratios do not satisfy the conditions of Theorem 3.
    [Show full text]
  • Monads and Algebras - an Introduction
    Monads and Algebras - An Introduction Uday S. Reddy April 27, 1995 1 1 Algebras of monads Consider a simple form of algebra, say, a set with a binary operation. Such an algebra is a pair hX, ∗ : X × X → Xi. Morphisms of these algebras preserve the binary operation: f(x ∗ y) = f(x) ∗ f(y). We first notice that the domain of the operation is determined by a functor F : Set → Set (the diagonal functor FX = X ×X). In general, given an endofunctor F : C → C on a category C, we can speak of the “algebras” for F , which are pairs hX, α : FX → Xi of an object X of C and an arrow α : FX → X. Morphism preserve the respective operations, i.e., F f FX - FY α β ? f ? X - Y Now, in algebra, it is commonplace to talk about “derived operators.” Such an operator is determined by a term made up of variables (over X) and the operations of the algebra. For example, for the simple algebra with a binary operation, terms such as x, x ∗ (y ∗ z), and (x ∗ y) ∗ (z ∗ w) determine derived operators. From a categorical point of view, such derived operators are just compositions of the standard operators and identity arrows: id X X- X id ×α α X × (X × X) X - X × X - X α×α α (X × X) × (X × X) - X × X - X To formalize such derived operators, we think of another functor T : C → C into which we can embed the domains of all the derived operators. In particular, we should have embeddings I →.
    [Show full text]
  • Gorenstein Subrings of Invariants Under Hopf Algebra Actions ∗ E
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Algebra 322 (2009) 3640–3669 Contents lists available at ScienceDirect Journal of Algebra www.elsevier.com/locate/jalgebra Gorenstein subrings of invariants under Hopf algebra actions ∗ E. Kirkman a, J. Kuzmanovich a, J.J. Zhang b, a Department of Mathematics, PO Box 7388, Wake Forest University, Winston-Salem, NC 27109, United States b Department of Mathematics, Box 354350, University of Washington, Seattle, WA 98195, United States article info abstract Article history: This paper concerns conditions on the action of a finite dimensional Received 19 November 2008 semisimple Hopf algebra on an Artin–Schelter regular algebra Available online 24 September 2009 that force the subring of invariants to satisfy the Artin–Schelter Communicated by Michel Van den Bergh Gorenstein condition. Classical results such as Watanabe’s Theorem and Stanley’s Theorem are extended from the case of a group Keywords: Artin–Schelter regular algebra action to the context of a Hopf algebra action. A Hopf algebra Hopf algebra action version of the homological determinant is introduced, and it Invariant subring becomes an important tool in the generalization from group actions to Hopf algebra actions. © 2009 Elsevier Inc. All rights reserved. Contents Introduction.................................................................... 3641 1. Preliminariesongradedrings.................................................. 3642 2. PreliminariesonHopfactions.................................................
    [Show full text]
  • Equational Theories of Tropical Semirings Basic Research in Computer Science
    BRICS Basic Research in Computer Science BRICS RS-01-21 Aceto et al.: Equational Theories of Tropical Semirings Equational Theories of Tropical Semirings Luca Aceto Zoltan´ Esik´ Anna Ingolfsd´ ottir´ BRICS Report Series RS-01-21 ISSN 0909-0878 June 2001 Copyright c 2001, Luca Aceto & Zoltan´ Esik´ & Anna Ingolfsd´ ottir.´ BRICS, Department of Computer Science University of Aarhus. All rights reserved. Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Report Series publications. Copies may be obtained by contacting: BRICS Department of Computer Science University of Aarhus Ny Munkegade, building 540 DK–8000 Aarhus C Denmark Telephone: +45 8942 3360 Telefax: +45 8942 3255 Internet: [email protected] BRICS publications are in general accessible through the World Wide Web and anonymous FTP through these URLs: http://www.brics.dk ftp://ftp.brics.dk This document in subdirectory RS/01/21/ Equational Theories of Tropical Semirings Luca Aceto∗ Zolt´an Esik´ y Anna Ing´olfsd´ottir∗ Abstract This paper studies the equational theory of various exotic semirings presented in the literature. Exotic semirings are semirings whose un- derlying carrier set is some subset of the set of real numbers equipped with binary operations of minimum or maximum as sum, and addition as product. Two prime examples of such structures are the (max; +) semiring and the tropical semiring. It is shown that none of the exotic semirings commonly considered in the literature has a finite basis for its equations, and that similar results hold for the commutative idempotent weak semirings that underlie them.
    [Show full text]
  • Monomial Orderings, Rewriting Systems, and Gröbner Bases for The
    Monomial orderings, rewriting systems, and Gr¨obner bases for the commutator ideal of a free algebra Susan M. Hermiller Department of Mathematics and Statistics University of Nebraska-Lincoln Lincoln, NE 68588 [email protected] Xenia H. Kramer Department of Mathematics Virginia Polytechnic Institute and State University Blacksburg, VA 24061 [email protected] Reinhard C. Laubenbacher Department of Mathematics New Mexico State University Las Cruces, NM 88003 [email protected] 0Key words and phrases. non-commutative Gr¨obner bases, rewriting systems, term orderings. 1991 Mathematics Subject Classification. 13P10, 16D70, 20M05, 68Q42 The authors thank Derek Holt for helpful suggestions. The first author also wishes to thank the National Science Foundation for partial support. 1 Abstract In this paper we consider a free associative algebra on three gen- erators over an arbitrary field K. Given a term ordering on the com- mutative polynomial ring on three variables over K, we construct un- countably many liftings of this term ordering to a monomial ordering on the free associative algebra. These monomial orderings are total well orderings on the set of monomials, resulting in a set of normal forms. Then we show that the commutator ideal has an infinite re- duced Gr¨obner basis with respect to these monomial orderings, and all initial ideals are distinct. Hence, the commutator ideal has at least uncountably many distinct reduced Gr¨obner bases. A Gr¨obner basis of the commutator ideal corresponds to a complete rewriting system for the free commutative monoid on three generators; our result also shows that this monoid has at least uncountably many distinct mini- mal complete rewriting systems.
    [Show full text]
  • Lie Algebras by Shlomo Sternberg
    Lie algebras Shlomo Sternberg April 23, 2004 2 Contents 1 The Campbell Baker Hausdorff Formula 7 1.1 The problem. 7 1.2 The geometric version of the CBH formula. 8 1.3 The Maurer-Cartan equations. 11 1.4 Proof of CBH from Maurer-Cartan. 14 1.5 The differential of the exponential and its inverse. 15 1.6 The averaging method. 16 1.7 The Euler MacLaurin Formula. 18 1.8 The universal enveloping algebra. 19 1.8.1 Tensor product of vector spaces. 20 1.8.2 The tensor product of two algebras. 21 1.8.3 The tensor algebra of a vector space. 21 1.8.4 Construction of the universal enveloping algebra. 22 1.8.5 Extension of a Lie algebra homomorphism to its universal enveloping algebra. 22 1.8.6 Universal enveloping algebra of a direct sum. 22 1.8.7 Bialgebra structure. 23 1.9 The Poincar´e-Birkhoff-Witt Theorem. 24 1.10 Primitives. 28 1.11 Free Lie algebras . 29 1.11.1 Magmas and free magmas on a set . 29 1.11.2 The Free Lie Algebra LX ................... 30 1.11.3 The free associative algebra Ass(X). 31 1.12 Algebraic proof of CBH and explicit formulas. 32 1.12.1 Abstract version of CBH and its algebraic proof. 32 1.12.2 Explicit formula for CBH. 32 2 sl(2) and its Representations. 35 2.1 Low dimensional Lie algebras. 35 2.2 sl(2) and its irreducible representations. 36 2.3 The Casimir element. 39 2.4 sl(2) is simple.
    [Show full text]
  • Finitely Generated Simple Algebras: a Question of Bi Plotkin
    FINITELY GENERATED SIMPLE ALGEBRAS: A QUESTION OF B. I. PLOTKIN A. I. LICHTMAN AND D. S. PASSMAN Abstract. In his recent series of lectures, Prof. B. I. Plotkin discussed ge- ometrical properties of the variety of associative K-algebras. In particular, he studied geometrically noetherian and logically noetherian algebras and, in this connection, he asked whether there exist uncountably many sim- ple K-algebras with a fixed finite number of generators. We answer this question in the affirmative using both crossed product constructions and HNN extensions of division rings. Specifically, we show that there exist un- countably many nonisomorphic 4-generator simple Ore domains, and also uncountably many nonisomorphic division algebras having 2 generators as a division algebra. 1. Introduction In his recent series of lectures [Pl], B. I. Plotkin discussed some geometrical properties of the variety of associative K-algebras. In particular, he considered geometrically noetherian and logically noetherian algebras and, in this connec- tion, he asked whether there exist uncountably many simple K-algebras with a fixed finite number of generators. We answer this question in the affirmative using both crossed product constructions and HNN extensions of division rings. To be precise, we show that there exist uncountably many nonisomorphic 4-generator simple Ore domains, and also uncountably many nonisomorphic division algebras having 2 generators as a division algebra. These results can be viewed as algebra analogs of the well-known theorem [N] which asserts that there exist uncount- ably many nonisomorphic 2-generator groups. Indeed, it was shown in [H] that there exist uncountably many nonisomorphic 6-generator simple groups (see [LS, Theorems IV.3.3 and IV.3.5]).
    [Show full text]
  • Arxiv:2001.01064V1 [Math.RA] 4 Jan 2020 Eis Rncnetlpwrseries
    GRADED ALGEBRAS WITH PRESCRIBED HILBERT SERIES VESSELIN DRENSKY Abstract. For any power series a(t) with exponentially bounded nonnega- tive integer coefficients we suggest a simple construction of a finitely generated monomial associative algebra R with Hilbert series H(R, t) very close to a(t). If a(t) is rational/algebraic/transcendental, then the same is H(R, t). If the growth of the coefficients of a(t) is polynomial, in the same way we construct a graded algebra R preserving the polynomial growth of the coefficients of its Hilbert series H(R, t). Applying a classical result of Fatou from 1906 we ob- tain that if a finitely generated graded algebra R has a finite Gelfand-Kirillov dimension, then its Hilbert series is either rational or transcendental. In par- ticular the same dichotomy holds for the Hilbert series of finitely generated algebras R with polynomial identity. Introduction We consider finitely generated unitary associative algebras R over an arbitrary field K of any characteristic. The algebra R is graded if R is a direct sum of vector subspaces R0, R1, R2,... called homogeneous components of R and RmRn Rm+n, m,n =0, 1, 2,.... ⊂ In the sequel we consider graded algebras only. We assume that R0 =0or R0 = K and the generators of R are of first degree. The formal power series n H(R,t)= dim(Rn)t , n≥0 X is called the Hilbert series of R. In the sequel, when we speak about algebraic and transcendental power series we shall mean over Q(t). Let K Xd = K x1,...,xd be the free d-generated unitary associative algebra h i h i and let Xd be the set of all monomials in K Xd .
    [Show full text]