DOCSLIB.ORG

Introduction to Dirichlet Series and the Dedekind Zeta Function

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introduction to Dirichlet Series and the Dedekind Zeta Function Introduction to Dirichlet series and the Dedekind zeta function Gil Moss November 11th, 2008 These notes are meant to give an introduction to the basic analysis behind Dirichlet series and the Dedekind zeta function. They include a description of the conditions which make Dirichlet series converge uniformly to continuous functions, using Abel’s summation formula, computing a residue at x = 1 of the Riemann zeta function, defining an Euler product of Dirichlet series, and concluding with a definition of the Dedekind zeta function, proving its convergence and Euler product formula, and stating a theorem describing its residue at x = 1. Dirichlet series and Abel summation P∞ −x A general Dirichlet series is defined for a sequence {ai} of complex numbers to be i=1 aii . We can prove the following proposition regarding its convergence: P∞ −x Proposition. If i=1 aii converges absolutely at x0, then it converges uniformly on [x0, ∞). Proof. Take x > x0, then a i−x i x0−x −x = n aii 0 P∞ −x converges to zero as n goes to infinity. Since the absolute value of the ratio of the coefficients of i=1 aii P∞ −x0 P∞ −x and i=1 aii converges, the comparison test tells us that i=1 aii converges absolutely. To show uniform convergence, notice −x −x0 0 ≤ |aii | ≤ |aii |, −x P so that each term |aii | is bounded by a constant Mi such that Mi converges. This demonstrates uniform Pn −x convergence on the interval [x0, ∞), since the convergence of the partial sums i=1 |aii | is thus controlled independently of x. This is also called the Weierstrass M-test. Because a uniform limit of continuous functions is continuous, the Dirichlet series on this interval is thus continuous (it is a uniform limit of its partial sums, each of which is continuous). Now we introduce Abel summation, which will be useful for Dirichlet series. Pn Abel summation. Let {ai}, {bi} be sequences, let An = i=m+1 ai. Then n n X X aibi = Anbn+1 − Ambm+1 − Ai(bi+1 − bi) m+1 m+1 . 1 Proof. n n X X aibi = (Ai − Ai−1)bi i=m+1 i=m+1 n n X X = Aibi − Ai−1bi i=m+1 i=m+1 n n X X = Aibi − ( Aibi+1 + Ambm+1 − Anbn+1) i=m+1 i=m+1 n X = Anbn+1 − Ambm+1 − Ai(bi+1 − bi) m+1 Before applying Abel summation to Dirichlet series, we prove the following lemma. Lemma. Given {ai}, {bi} sequences, assume |An| is bounded and {bi} is monotonically decreasing, con- P∞ verging to zero. Then i=1 aibi converges. Proof. Use Abel summation and the absolute value inequalities: n n X X | aibi| ≤ |An|bn+1 + |Am|bm+1 + |Ai|(bi − bi+1), i=m+1 i=m+1 then if M is the bound for |An|, and for m, n sufficiently large, this expression is less than n X M(bn+1) + M(bm+1) + M (bi − bi+1) = M(bn+1 + bm+1 + bm+1 − bn+1) i=m+1 ≤ M(/2M + /2M) = Pn Hence the partial sums | i=m+1 aibi| form a Cauchy sequence and hence converge as desired. We now apply the Abel business to Dirichlet series. Pn Proposition. Assume the partial sums of the sequence {ai}, | i=1 ai| are bounded for each n. Then P∞ −x i=1 aii converges uniformly on [y, ∞) for all y > 0, and hence defines a continuous function on (0, ∞). −y P∞ −y Proof. Letting bi = i for y > 0 we note that i=1 aii converges on y > 0 since the conditions of the Lemma are fulfilled. 0 −y 0 −x 0 Pn 0 Now take x ≥ 0 and let ai = aii , bi = i , Ai = i=m+1 ai. Then we have n n X −(x+y) 0 −x 0 −x X 0 −x −x | aii | ≤ |An|(n + 1) + |Am|(m + 1) + |Ai|(i − (i + 1) ) i=m+1 i=m+1 n X ≤ (/2)(n + 1)−x + (/2)(m + 1)−x + (/2)(i−x − (i + 1)−x) i=m+1 = (/2)((n + 1)−x + (m + 1)−x + (m + 1)−x − (n + 1)−x) ≤ 2/2 = , 0 P∞ 0 where the second inequality assumes m, n sufficiently large that |An| < /2, which is valid since i=1 ai converges. The last inequality is due to the fact that (m+1)−x ≤ 1 when x ≥ 0. This shows the convergence on [y, ∞) is uniform since it does not rely on y. The continuity of the Dirichlet series again follows from the uniformity of convergence. 2 The Riemann zeta function at x = 1 P∞ i −x The previous proposition then shows that i=1(−1) i converges to a continuous function on (0, ∞). P∞ −x However the Riemann zeta function i=1 i does not fulfill the hypotheses of the proposition, but is convergent and continuous on (1, ∞) by our very first proposition. We will now compute the residue of the Riemann zeta function at x = 1. 1 Proposition. Let φ(x) = ζ(x) − x−1 , then φ is continuous on (1, ∞) and 0 ≤ φ(x) ≤ 1 for x in this range. Proof. Continuity follows from the continuity of the Riemann zeta function on (1, ∞). To show the second part of the theorem, take x > 1, then for n ≥ 1, we have Z n+1 (n + 1)−x ≤ y−xdy ≤ n−x, n since for n ≤ y ≤ n + 1 we have (n + 1)−x ≤ y−x ≤ n−x, and the interval of integration has length 1. Then summing over all n we have R ∞ −x ζ(x) − 1 ≤ 1 y dy ≤ ζ(x) 1 ζ(x) − 1 ≤ x−1 ≤ ζ(x), which shows 0 ≤ φ(x) ≤ 1. Corollary. lim (x − 1)ζ(x) = 1 x→1+ 1 Proof. Since φ takes values in [0, 1], limx→1+ (x − 1)φ(x) = 0, so limx→1+ (x − 1)(ζ(x) − x−1 ) = 0 and thus limx→1+ (x − 1)ζ(x) = 1. Euler products for Dirichlet series Q∞ First we recall some facts about infinite products. i=1(1 + bi) for bi 6= −1 is convergent if the partial Qn products i=1(1 + bi) are convergent. Similarly to sums, an infinite product converges absolutely when Q∞ i=1(1 + |bi|) is convergent. Re-ordering of an absolutely convergent product does not change its value and an absolutely convergent product is convergent. Q∞ P∞ Lemma. i=1(1 + |bi|) converges iff i=1 |bi| converges. Qn Pn Proof. Expanding partial products we have the inequality i=1(1 + |bi|) ≥ i=1 |bi|, proving one direction of the lemma. To prove the other direction, note that for x ≥ 0, ex ≥ 1 + x by its power series expansion. Then Pn n i=1 |bi| Q e ≥ i=1(1 + |bi|) and if the partial sums converge, then so do the partial products. A multiplicative sequence is a sequence {ai} such that aiaj = aij when i, j are relatively prime. Theorem. The following two conditions are equivalent: P∞ −ix Q∞ P∞ −ix 1. i=1 api p converges absolutely and i=1(1 + i=1 |api |p ) converges P∞ −x 2. 1 + i=2 aii converges absolutely. P∞ −ix P∞ −x Proof. (1 ⇐ 2) Since i=1 api p is a subseries of 1 + i=2 aii , it converges absolutely. Now let S be a finite set of primes, then we have the equality ∞ Y X −ix X −x (1 + |api |p ) = 1 + aii p∈S i=1 i≥2,S3p|i 3 (where the sum on the right hand side is taken over all i such that p|i for some p ∈ S), since expanding the product will give us products of infinite series which, for two different primes p 6= p0 look like ∞ ∞ ∞ X −ix X 0−ix X X −dx 0−(i−d)x ( |api |p )( |ap0i |p ) = |apd ap0i−d |p p , i=1 i=1 i=1 d≤i and since the sequence is multiplicative, this is ∞ X X d 0(i−d) −x |apdp0i−d |(p p ) , i=1 d≤i and expanding the finite product will give all combinations of powers of primes in S, yielding the sum on the P −x right. But this sum 1 + i≥2,S3p|i aii is bounded above by assumption, so that all the partial products Q P∞ −ix are bounded, and thus the product p(1 + i=1 |api |p ) converges. (1 ⇒ 2) We use a similar argument to prove the opposite direction. Let Sm be the set of primes dividing an integer m. Then we have m Y X −ix X −x (1 + |api |p ) ≤ 1 + aii p i=1 i≥2,Sm3p|i ∞ Y X −ix = (1 + |api |p ) p∈Sm i=1 ∞ Y X −ix ≤ (1 + |api |p ), p i=1 which converges by assumption. Using the equality from the previous proof, ∞ X −x Y X −ix 1 + aii = (1 + |api |p ). i≥2,Sm3p|i p∈Sm i=1 Then assuming the two equivalent convergence conditions of the previous theorem hold, these two partial sums converge to the same thing as m → ∞. The Dedekind zeta function and its Euler product If K is a number field of finite degree over Q, we defined the Dedekind zeta function of K to be X −x ζK (x) = NI , I⊂OK where the sum ranges over all nonzero integral ideals I. We consider when this series converges and prove its Euler product representation. Theorem. ζK (x) converges on (1, ∞) and on this interval, Y −x −1 ζK (x) = (1 − NP ) , P where P denotes a prime ideal of OK .
Load more

Recommended publications
  • 1.1 Constructing the Real Numbers
    18.095 Lecture Series in Mathematics IAP 2015 Lecture #1 01/05/2015 What is number theory? The study of numbers of course! But what is a number? • N = f0; 1; 2; 3;:::g can be defined in several ways: { Finite ordinals (0 := fg, n + 1 := n [ fng). { Finite cardinals (isomorphism classes of finite sets). { Strings over a unary alphabet (\", \1", \11", \111", . ). N is a commutative semiring: addition and multiplication satisfy the usual commu- tative/associative/distributive properties with identities 0 and 1 (and 0 annihilates). Totally ordered (as ordinals/cardinals), making it a (positive) ordered semiring. • Z = {±n : n 2 Ng.A commutative ring (commutative semiring, additive inverses). Contains Z>0 = N − f0g closed under +; × with Z = −Z>0 t f0g t Z>0. This makes Z an ordered ring (in fact, an ordered domain). • Q = fa=b : a; 2 Z; b 6= 0g= ∼, where a=b ∼ c=d if ad = bc. A field (commutative ring, multiplicative inverses, 0 6= 1) containing Z = fn=1g. Contains Q>0 = fa=b : a; b 2 Z>0g closed under +; × with Q = −Q>0 t f0g t Q>0. This makes Q an ordered field. • R is the completion of Q, making it a complete ordered field. Each of the algebraic structures N; Z; Q; R is canonical in the following sense: every non-trivial algebraic structure of the same type (ordered semiring, ordered ring, ordered field, complete ordered field) contains a copy of N; Z; Q; R inside it. 1.1 Constructing the real numbers What do we mean by the completion of Q? There are two possibilities: 1.
    [Show full text]
  • Be a Metric Space
    2 The University of Sydney show that Z is closed in R. The complement of Z in R is the union of all the Pure Mathematics 3901 open intervals (n, n + 1), where n runs through all of Z, and this is open since every union of open sets is open. So Z is closed. Metric Spaces 2000 Alternatively, let (an) be a Cauchy sequence in Z. Choose an integer N such that d(xn, xm) < 1 for all n ≥ N. Put x = xN . Then for all n ≥ N we have Tutorial 5 |xn − x| = d(xn, xN ) < 1. But xn, x ∈ Z, and since two distinct integers always differ by at least 1 it follows that xn = x. This holds for all n > N. 1. Let X = (X, d) be a metric space. Let (xn) and (yn) be two sequences in X So xn → x as n → ∞ (since for all ε > 0 we have 0 = d(xn, x) < ε for all such that (yn) is a Cauchy sequence and d(xn, yn) → 0 as n → ∞. Prove that n > N). (i)(xn) is a Cauchy sequence in X, and 4. (i) Show that if D is a metric on the set X and f: Y → X is an injective (ii)(xn) converges to a limit x if and only if (yn) also converges to x. function then the formula d(a, b) = D(f(a), f(b)) defines a metric d on Y , and use this to show that d(m, n) = |m−1 − n−1| defines a metric Solution.
    [Show full text]
  • Dirichlet Series
    数理解析研究所講究録 1088 巻 1999 年 83-93 83 Overconvergence Phenomena For Generalized Dirichlet Series Daniele C. Struppa Department of Mathematical Sciences George Mason University Fairfax, VA 22030 $\mathrm{U}.\mathrm{S}$ . A 84 1 Introduction This paper contains the text of the talk I delivered at the symposium “Resurgent Functions and Convolution Equations”, and is an expanded version of a joint paper with T. Kawai, which will appear shortly and which will contain the full proofs of the results. The goal of our work has been to provide a new approach to the classical topic of overconvergence for Dirichlet series, by employing results in the theory of infinite order differential operators with constant coefficients. The possibility of linking infinite order differential operators with gap theorems and related subjects such as overconvergence phenomena was first suggested by Ehrenpreis in [6], but in a form which could not be brought to fruition. In this paper we show how a wide class of overconvergence phenomena can be described in terms of infinite order differential operators, and that we can provide a multi-dimensional analog for such phenomena. Let us begin by stating the problem, as it was first observed by Jentzsch, and subsequently made famous by Ostrowski (see [5]). Consider a power series $f(z)= \sum_{=n0}^{+\infty}anZ^{n}$ (1) whose circle of convergence is $\triangle(0, \rho)=\{z\in C : |z|<\rho\}$ , with $\rho$ given, therefore, by $\rho=\varliminf|a_{n}|^{-1/}n$ . Even though we know that the series given in (1) cannot converge outside of $\Delta=\Delta(0, \rho)$ , it is nevertheless possible that some subsequence of its sequence of partial sums may converge in a region overlapping with $\triangle$ .
    [Show full text]
  • Lagrange Inversion Theorem for Dirichlet Series Arxiv:1911.11133V1
    Lagrange Inversion Theorem for Dirichlet series Alexey Kuznetsov ∗ November 26, 2019 Abstract We prove an analogue of the Lagrange Inversion Theorem for Dirichlet series. The proof is based on studying properties of Dirichlet convolution polynomials, which are analogues of convolution polynomials introduced by Knuth in [4]. Keywords: Dirichlet series, Lagrange Inversion Theorem, convolution polynomials 2010 Mathematics Subject Classification : Primary 30B50, Secondary 11M41 1 Introduction 0 The Lagrange Inversion Theorem states that if φ(z) is analytic near z = z0 with φ (z0) 6= 0 then the function η(w), defined as the solution to φ(η(w)) = w, is analytic near w0 = φ(z0) and is represented there by the power series X bn η(w) = z + (w − w )n; (1) 0 n! 0 n≥0 where the coefficients are given by n−1 n d z − z0 bn = lim n−1 : (2) z!z0 dz φ(z) − φ(z0) 0 This result can be stated in the following simpler form. We assume that φ(z0) = z0 = 0 and φ (0) = 1. We define A(z) = z=φ(z) and check that A is analytic near z = 0 and is represented there by the power series arXiv:1911.11133v1 [math.NT] 25 Nov 2019 X n A(z) = 1 + anz : (3) n≥1 Let us define B(z) implicitly via A(zB(z)) = B(z): (4) Then the function η(z) = zB(z) solves equation η(z)=A(η(z)) = z, which is equivalent to φ(η(z)) = z. Applying Lagrange Inversion Theorem in the form (2) we obtain X an(n + 1) B(z) = zn; (5) n + 1 n≥0 ∗Dept.
    [Show full text]
  • Formal Power Series Rings, Inverse Limits, and I-Adic Completions of Rings
    Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely many variables over a ring R, and show that it is Noetherian when R is. But we begin with a definition in much greater generality. Let S be a commutative semigroup (which will have identity 1S = 1) written multi- plicatively. The semigroup ring of S with coefficients in R may be thought of as the free R-module with basis S, with multiplication defined by the rule h k X X 0 0 X X 0 ( risi)( rjsj) = ( rirj)s: i=1 j=1 s2S 0 sisj =s We next want to construct a much larger ring in which infinite sums of multiples of elements of S are allowed. In order to insure that multiplication is well-defined, from now on we assume that S has the following additional property: (#) For all s 2 S, f(s1; s2) 2 S × S : s1s2 = sg is finite. Thus, each element of S has only finitely many factorizations as a product of two k1 kn elements. For example, we may take S to be the set of all monomials fx1 ··· xn : n (k1; : : : ; kn) 2 N g in n variables. For this chocie of S, the usual semigroup ring R[S] may be identified with the polynomial ring R[x1; : : : ; xn] in n indeterminates over R. We next construct a formal semigroup ring denoted R[[S]]: we may think of this ring formally as consisting of all functions from S to R, but we shall indicate elements of the P ring notationally as (possibly infinite) formal sums s2S rss, where the function corre- sponding to this formal sum maps s to rs for all s 2 S.
    [Show full text]
  • Absolute Convergence in Ordered Fields
    Absolute Convergence in Ordered Fields Kristine Hampton Abstract This paper reviews Absolute Convergence in Ordered Fields by Clark and Diepeveen [1]. Contents 1 Introduction 2 2 Definition of Terms 2 2.1 Field . 2 2.2 Ordered Field . 3 2.3 The Symbol .......................... 3 2.4 Sequential Completeness and Cauchy Sequences . 3 2.5 New Sequences . 4 3 Summary of Results 4 4 Proof of Main Theorem 5 4.1 Main Theorem . 5 4.2 Proof . 6 5 Further Applications 8 5.1 Infinite Series in Ordered Fields . 8 5.2 Implications for Convergence Tests . 9 5.3 Uniform Convergence in Ordered Fields . 9 5.4 Integral Convergence in Ordered Fields . 9 1 1 Introduction In Absolute Convergence in Ordered Fields [1], the authors attempt to dis- tinguish between convergence and absolute convergence in ordered fields. In particular, Archimedean and non-Archimedean fields (to be defined later) are examined. In each field, the possibilities for absolute convergence with and without convergence are considered. Ultimately, the paper [1] attempts to offer conditions on various fields that guarantee if a series is convergent or not in that field if it is absolutely convergent. The results end up exposing a reliance upon sequential completeness in a field for any statements on the behavior of convergence in relation to absolute convergence to be made, and vice versa. The paper makes a noted attempt to be readable for a variety of mathematic levels, explaining new topics and ideas that might be confusing along the way. To understand the paper, only a basic understanding of series and convergence in R is required, although having a basic understanding of ordered fields would be ideal.
    [Show full text]
  • Infinitesimals Via Cauchy Sequences: Refining the Classical Equivalence
    INFINITESIMALS VIA CAUCHY SEQUENCES: REFINING THE CLASSICAL EQUIVALENCE EMANUELE BOTTAZZI AND MIKHAIL G. KATZ Abstract. A refinement of the classic equivalence relation among Cauchy sequences yields a useful infinitesimal-enriched number sys- tem. Such an approach can be seen as formalizing Cauchy’s senti- ment that a null sequence “becomes” an infinitesimal. We signal a little-noticed construction of a system with infinitesimals in a 1910 publication by Giuseppe Peano, reversing his earlier endorsement of Cantor’s belittling of infinitesimals. June 2, 2021 1. Historical background Robinson developed his framework for analysis with infinitesimals in his 1966 book [1]. There have been various attempts either (1) to obtain clarity and uniformity in developing analysis with in- finitesimals by working in a version of set theory with a concept of infinitesimal built in syntactically (see e.g., [2], [3]), or (2) to define nonstandard universes in a simplified way by providing mathematical structures that would not have all the features of a Hewitt–Luxemburg-style ultrapower [4], [5], but nevertheless would suffice for basic application and possibly could be helpful in teaching. The second approach has been carried out, for example, by James Henle arXiv:2106.00229v1 [math.LO] 1 Jun 2021 in his non-nonstandard Analysis [6] (based on Schmieden–Laugwitz [7]; see also [8]), as well as by Terry Tao in his “cheap nonstandard analysis” [9]. These frameworks are based upon the identification of real sequences whenever they are eventually equal.1 A precursor of this approach is found in the work of Giuseppe Peano. In his 1910 paper [10] (see also [11]) he introduced the notion of the end (fine; pl.
    [Show full text]
  • Practice Problems for the Final
    Practice problems for the final 1. Show the following using just the definitions (and no theorems). (a) The function ( x2; x ≥ 0 f(x) = 0; x < 0; is differentiable on R, while f 0(x) is not differentiable at 0. Solution: For x > 0 and x < 0, the function is clearly differentiable. We check at x = 0. The difference quotient is f(x) − f(0) f(x) '(x) = = : x x So x2 '(0+) = lim '(x) = lim = 0; x!0+ x!0+ x 0 '(0−) = lim '(x) = lim = 0: x!0− x!0− x 0 Since '(0+) = '(0−), limx!0 '(x) = 0 and hence f is differentiable at 0 with f (0) = 0. So together we get ( 2x; x > 0 f 0(x) = 0; x ≤ 0: f 0(x) is again clearly differentiable for x > 0 and x < 0. To test differentiability at x = 0, we consider the difference quotient f 0(x) − f 0(0) f 0(x) (x) = = : x x Then it is easy to see that (0+) = 2 while (0−) = 0. Since (0+) 6= (0−), limx!0 (x) does not exist, and f 0 is not differentiable at x = 0. (b) The function f(x) = x3 + x is continuous but not uniformly continuous on R. Solution: We show that f is continuous at some x = a. That is given " > 0 we have to find a corresponding δ. jf(x) − f(a)j = jx3 + x − a3 − aj = j(x − a)(x2 + xa + a2) + (x − a)j = jx − ajjx2 + xa + a2 + 1j: Now suppose we pick δ < 1, then jx − aj < δ =) jxj < jaj + 1, and so jx2 + xa + a2 + 1j ≤ jxj2 + jxjjaj + a2 + 1 ≤ 3(jaj + 1)2: To see the final inequality, note that jxjjaj < (jaj + 1)jaj < (jaj + 1)2, and a2 + 1 < (jaj + 1)2.
    [Show full text]
  • Infinitesimals
    Infinitesimals: History & Application Joel A. Tropp Plan II Honors Program, WCH 4.104, The University of Texas at Austin, Austin, TX 78712 Abstract. An infinitesimal is a number whose magnitude ex- ceeds zero but somehow fails to exceed any finite, positive num- ber. Although logically problematic, infinitesimals are extremely appealing for investigating continuous phenomena. They were used extensively by mathematicians until the late 19th century, at which point they were purged because they lacked a rigorous founda- tion. In 1960, the logician Abraham Robinson revived them by constructing a number system, the hyperreals, which contains in- finitesimals and infinitely large quantities. This thesis introduces Nonstandard Analysis (NSA), the set of techniques which Robinson invented. It contains a rigorous de- velopment of the hyperreals and shows how they can be used to prove the fundamental theorems of real analysis in a direct, natural way. (Incredibly, a great deal of the presentation echoes the work of Leibniz, which was performed in the 17th century.) NSA has also extended mathematics in directions which exceed the scope of this thesis. These investigations may eventually result in fruitful discoveries. Contents Introduction: Why Infinitesimals? vi Chapter 1. Historical Background 1 1.1. Overview 1 1.2. Origins 1 1.3. Continuity 3 1.4. Eudoxus and Archimedes 5 1.5. Apply when Necessary 7 1.6. Banished 10 1.7. Regained 12 1.8. The Future 13 Chapter 2. Rigorous Infinitesimals 15 2.1. Developing Nonstandard Analysis 15 2.2. Direct Ultrapower Construction of ∗R 17 2.3. Principles of NSA 28 2.4. Working with Hyperreals 32 Chapter 3.
    [Show full text]
  • Uniform Convergence
    2018 Spring MATH2060A Mathematical Analysis II 1 Notes 3. UNIFORM CONVERGENCE Uniform convergence is the main theme of this chapter. In Section 1 pointwise and uniform convergence of sequences of functions are discussed and examples are given. In Section 2 the three theorems on exchange of pointwise limits, inte- gration and differentiation which are corner stones for all later development are proven. They are reformulated in the context of infinite series of functions in Section 3. The last two important sections demonstrate the power of uniform convergence. In Sections 4 and 5 we introduce the exponential function, sine and cosine functions based on differential equations. Although various definitions of these elementary functions were given in more elementary courses, here the def- initions are the most rigorous one and all old ones should be abandoned. Once these functions are defined, other elementary functions such as the logarithmic function, power functions, and other trigonometric functions can be defined ac- cordingly. A notable point is at the end of the section, a rigorous definition of the number π is given and showed to be consistent with its geometric meaning. 3.1 Uniform Convergence of Functions Let E be a (non-empty) subset of R and consider a sequence of real-valued func- tions ffng; n ≥ 1 and f defined on E. We call ffng pointwisely converges to f on E if for every x 2 E, the sequence ffn(x)g of real numbers converges to the number f(x). The function f is called the pointwise limit of the sequence. According to the limit of sequence, pointwise convergence means, for each x 2 E, given " > 0, there is some n0(x) such that jfn(x) − f(x)j < " ; 8n ≥ n0(x) : We use the notation n0(x) to emphasis the dependence of n0(x) on " and x.
    [Show full text]
  • Cauchy's Construction of R
    CAUCHY’S CONSTRUCTION OF R TODD KEMP CONTENTS 1. Motivation 1 2. Cauchy Sequences 2 3. Equivalence Relations 3 4. Cauchy’s Construction of R 5 References 11 1. MOTIVATION We are used to thinking of real numbers as successive approximations. For example, we write π = 3:14159 ::: to mean that π is a real number which, accurate to 5 decimal places, equals the above string. To be precise, this means that jπ − 3:14159j < 10−5. But this does not tell us what π is. If we want a more accurate approximation, we can calculate one; to 10 decimal places, we have π = 3:1415926536 ::: Continuing, we will develop a sequence of rational approximations to π. One such sequence is 3; 3:1; 3:14; 3:142; 3:1416; 3:14159;::: But this is not the only sequence of rational numbers that approximate π closer and closer (far from it!). For example, here is another (important) one: 22 333 355 104348 1043835 3; ; ; ; ; ::: 7 106 113 33215 332263 (This sequence, which represents the continued fractions approximations to π [you should read about continued fractions for fun!], gives accuracies of 1; 3; 5; 6; 9; 9 decimal digits, as you can readily check.) More’s the point, here is another (somewhat arbitrary) rational approximating sequence to π: 0; 0; 157; −45; −10; 3:14159; 0; 3:14; 3:1415; 3:151592; 3:14159265;::: While here we start with a string of numbers that really have nothing to do with π, the sequence eventually settles down to approximate π closer and closer (this time by an additional 2 decimal places each step).
    [Show full text]
  • Interplay Between Number Theory and Analysis for Dirichlet Series
    Mathematisches Forschungsinstitut Oberwolfach Report No. 51/2017 DOI: 10.4171/OWR/2017/51 Mini-Workshop: Interplay between Number Theory and Analysis for Dirichlet Series Organised by Fr´ed´eric Bayart, Aubi`ere Kaisa Matom¨aki, Turku Eero Saksman, Helsinki Kristian Seip, Trondheim 29 October – 4 November 2017 Abstract. In recent years a number of challenging research problems have crystallized in the analytic theory of Dirichlet series and its interaction with function theory in polydiscs. Their solutions appear to require unconventional combinations of expertise from harmonic, functional, and complex analysis, and especially from analytic number theory. This MFO workshop provided an ideal arena for the exchange of ideas needed to nurture further progress and to solve important problems. Mathematics Subject Classification (2010): 11xx, 30xx. Introduction by the Organisers The workshop ’Interplay between number theory and analysis for Dirichlet series’, organised by Fr´ed´eric Bayart (Clermont Universit´e), Kaisa Matom¨aki (Univer- sity of Turku), Eero Saksman (University of Helsinki) and Kristian Seip (NTNU, Trondheim) was held October 29th – November 4th, 2017. This meeting was well attended with around 25 participants coming from a number of different countries, including participants form North America. The group formed a nice blend of re- searchers with somewhat different mathematical backgrounds which resulted in a fruitful interaction. About 17 talks, of varying lengths, were delivered during the five days. The talks were given by both leading experts in the field as well as by rising young re- searchers. Given lectures dealt with e.g. connections between number theory and 3036 Oberwolfach Report 51/2017 random matrix theory, operators acting on Dirichlet series, distribution of Beurl- ing primes, growth of Lp-norms of Dirichlet polynomials, growth and density of values of the Riemann zeta on boundary of the critical strip, Rado’s criterion for kth powers, Sarnak’s and Elliot’s conjectures, and Hardy type spaces of general Dirichlet series.
    [Show full text]