DOCSLIB.ORG

Step 1. Analytic Properties of the Riemann Zeta Function

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Step 1. Analytic Properties of the Riemann Zeta Function Step 1 . Analytic Properties of the Riemann zeta function [2 lectures ] The Riemann zeta function is the infinite sum of terms 1 /n s, n ≥ 1. For each n, the 1 /n s is a continuous function of s, i.e. 1 1 lim = , s s0 s→s0 n n for all s0 ∈ C, and is differentiable, i.e. d 1 d log n = e−s log n = − (log n) e−s log n = − , ds ns ds ns for all s ∈ C. We know from second year analysis that we can add a finite number of continuous (differentiable) functions to get a continuous (differ- entiable) function, but this is not necessarily true for an infinite sum. We need more than the sum converges. C Definition 4.3 A sequence {xn}n≥1 in is a Cauchy Sequence if, and only if, ∀ε > 0, ∃N ≥ 1 : ∀n, m ≥ N, |xn − xm| < ε. Depending on how you have constructed C you may define that a series converges if, and only if, it is a Cauchy Sequence. Unfortunately this was not how convergence of a sequence was defined in MATH20101 say. C Theorem 4.4 A sequence {xn}n≥1 converges in if, and only if, {xn}n≥1 is a Cauchy Sequence. Proof (⇒) Assume that {xn}n≥1 converges to x say. Let ε > 0 be given. Then by the ε − N definition of convergence, ∃N ≥ 1 : |xn − x| < ε/ 2. Let m, n ≥ N then |xn − xm| = |xn − x + x − xm| ≤ | xn − x| + |x − xm| < ε, and we have verified the definition of a Cauchy Sequence. (⇐) This follows as a defining property of C, basically that C is complete. 7 Definition 4.5 Let {Fn (z)}n≥1 be a sequence of functions defined on a set D ⊆ C. The sequence {Fn}n≥1 converges to F on D iff ∀ε > 0, ∀z ∈ D , ∃N = N (ε, z ) : ∀n ≥ N, |Fn (z) − F (z)| < ε. The sequence {Fn}n≥1 converges uniformly to F on D iff ∀ε > 0, ∃N = N (ε) : ∀z ∈ D , ∀n ≥ N, |Fn (z) − F (z)| < ε. Be careful to understand the difference in these definitions, for convergence the value of N depends on the point z, whereas for uniform convergence the N will work simultaneously for all z in the domain D. Equivalently the definition of uniform convergence can be given in terms of a Cauchy sequence as ∀ε > 0, ∃N = N (ε) : ∀z ∈ D , ∀n, m ≥ N, |Fn (z) − Fm (z)| < ε. All definitions for sequences translate into definitions for series, as in ∞ Definition 4.6 A series j=1 fj (z) converges uniformly on D if, and n only if, the sequence of partialP sums Fn (z) = j=1 fj (z) converges uniformly on D. That is, P n ∀ε > 0, ∃N = N (ε) : ∀z ∈ D , ∀n, m ≥ N, fj (z) < ε. j=Xm+1 This leads to Weierstrass’s M-Test for Uniform Convergence of a Series : If there exists a sequence {Mi}i≥1 of non-negative numbers for which |fj (z)| < M j ∞ ∞ for all z ∈ D and all i ≥ 1 and j=1 Mj converges then j=1 fj (z) con- verges uniformly on D. P P Verification In fact, assuming k > ℓ , the partial sums satisfy |Fk (z) − Fℓ (z)| = |fk (z) + fk−1 (z) + ... + fℓ+1 (z)| ≤ | fk (z)| + |fk−1 (z)| + ... + |fℓ+1 (z)| < M k + Mk−1 + ... + Mℓ+1 . On account of the convergence of the series the last sum can be made smaller than a given ε > 0. Hence the sequence of partial sums Fm (z) converges uniformly. 8 The Question then arises what properties of a uniformly converging sequence are inherited by its limit? We have Weierstrass’s Theorem for Series (see Background Notes 0.7) that states Theorem 4.7 Weierstrass’s Theorem for Series . Assume f1 (z) , f 2 (z) , f 3 (z) , ... ∞ are holomorphic in an open set D, and i=1 fi (z) converge uniformly on every closed and bounded subset of D. ThenP ∞ (i) The F (z) = i=1 fi (z) is holomorphic on D, P ∞ (k) (ii) For all k ≥ 1, the series i=1 fi (z) converges on D, and converge uniformly on every closed and boundedP subset of D with limit F (k) (z). (So the series can be differentiated term-by-term.) Our first example of use of this theorem is the Riemann zeta function. The Riemann zeta function is a particular example of a Dirichlet Series, ∞ −s C n=1 ann . For a given s ∈ such a series may converge or not and if it convergesP it may converge absolutely or not. Results on how such regions are connected for general Dirichlet Series are not give in this course. We will, ∞ though, make use of the fact that if a series n=1 an converges absolutely ∞ ∞ then we have an “ infinite” triangle inequality P| n=1 an| ≤ n=1 |an| . P P For Re s ≥ 1 + δ the Riemann zeta function converges absolutely and to ∞ s see this use the Comparison Test on n=1 |1/n |, for each term satisfies s 1+ δ ∞ 1+ δ |1/n | ≤ 1/n and n=1 1/n converges.P P To go further we need to show that the series defining ζ (s) converges uni- formly on some domain. Theorem 4.8 Assume δ > 0. For Re s ≥ 1 + δ the Riemann zeta function ∞ 1 ζ (s) = ns Xn=1 converges uniformly, is holomorphic in Rs > 1, with derivative ∞ log n ζ′ (s) = − ns Xn=1 for Re s > 1. 9 Proof We have to show only that the series defining ζ (s) converges uniformly 1+ δ Re s ≥ 1+ δ. We could simply apply Weierstrass’s M-test with Mn = 1 /n or do it directly as N ∞ ∞ 1 1 1 ζ (s) − = ≤ ns ns ns Xn=1 n=XN+1 n=XN+1 by “infinite” triangle inequality ∞ 1 ≤ since Re s ≥ 1 + δ n1+ δ n=XN+1 ∞ du 1 ≤ 1+ δ = δ . ZN u δN Given any ε > 0, then 1 /δN δ is less than ε when N is sufficiently large, independent of s, showing uniform convergence. We can apply Weierstrass’s Theorem since any closed and bounded subset of Re s > 1 is contained in Re s ≥ 1 + δ for some δ > 0. Each term in the series is holomorphic on C with derivative d 1 d log n = e−s log n = − . ds ns ds ns The stated result then follows from Weierstrass’s Theorem. In Theorem 1.8 we saw 1 −1 ζ (s) = 1 − , ps Yp for Re s > 1. This with Theorem 4.8 shows that the Euler product is con- tinuous and differentiable. This was not obvious. For each prime p, the (1 − 1/p s)−1 is a continuous function of s, i.e. 1 −1 1 −1 lim 1 − = 1 − , s s0 s→s0 p p for all s0 ∈ C, and is differentiable, i.e. d 1 −1 1 −2 d 1 1 −2 d 1 1 − = − 1 − 1 − = 1 − ds ps ps ds ps ps ds ps log p 1 −2 = − 1 − , ps ps 10 for all s ∈ C. We know from second year analysis that we can multiply a finite number of continuous (differentiable) functions to get a continuous (dif- ferentiable) function, but this is not necessarily true for an infinite product. There is a Weierstrass’s Theorem for Infinite Products but it is not given here. Earlier in the course we looked at replacing sums by integrals. In the same vein we can use Partial Summation to replace the Dirichlet Series defining the Riemann zeta-function by an integral. Theorem 4.9 For s =6 1 we have 1 1 N 1−s N du = 1 + + − s {u} (5) ns s − 1 1 − s Z us+1 1≤Xn≤N 1 where {u} is the fractional part of u (so {u} = u − [u]). Proof By Partial Summation (and this argument, for s = 1, has been seen before in the previous Chapter) 1 1 1 1 = − − ns N s N s ns 1≤Xn≤N 1≤Xn≤N N N du = − (−s) N s Z us+1 1≤Xn≤N n N N du = + s 1 N s Z us+1 1 1≤Xn≤u N N du = s + s [u] s+1 N Z1 u N N du N du = s + s u s+1 − s (u − [u]) s+1 N Z1 u Z1 u N s N du = + N 1−s − 1 − s {u} . (6) N s 1 − s Z us+1 1 Let N → ∞ to get 11 Theorem 4.10 For Re s > 1, 1 ∞ {u} ζ (s) = 1 + − s 1+ s du. (7) s − 1 Z1 u Further, the right hand side of (7) defines a function holomorphic in Re s > 0, except for a simple pole, residue 1 at s = 1 . This is an example of an analytic continuation of ζ (s). The right hand side of (7) defines a function holomorphic on a region containing Re s > 1, where it agrees with the Dirichlet series definition of ζ (s). It is in fact possible to continue analytically ζ (s) to all of C, though we do not do so in this course. For the remainder of the course when we talk of the Riemann zeta function we will be thinking of the function given by the right hand side of (7) for Re s > 0. When Re s > 1 we will know that it has an alternative definition as a Dirichlet Series.
Load more

Recommended publications
  • Ch. 15 Power Series, Taylor Series
    Ch. 15 Power Series, Taylor Series 서울대학교 조선해양공학과 서유택 2017.12 ※ 본 강의 자료는 이규열, 장범선, 노명일 교수님께서 만드신 자료를 바탕으로 일부 편집한 것입니다. Seoul National 1 Univ. 15.1 Sequences (수열), Series (급수), Convergence Tests (수렴판정) Sequences: Obtained by assigning to each positive integer n a number zn z . Term: zn z1, z 2, or z 1, z 2 , or briefly zn N . Real sequence (실수열): Sequence whose terms are real Convergence . Convergent sequence (수렴수열): Sequence that has a limit c limznn c or simply z c n . For every ε > 0, we can find N such that Convergent complex sequence |zn c | for all n N → all terms zn with n > N lie in the open disk of radius ε and center c. Divergent sequence (발산수열): Sequence that does not converge. Seoul National 2 Univ. 15.1 Sequences, Series, Convergence Tests Convergence . Convergent sequence: Sequence that has a limit c Ex. 1 Convergent and Divergent Sequences iin 11 Sequence i , , , , is convergent with limit 0. n 2 3 4 limznn c or simply z c n Sequence i n i , 1, i, 1, is divergent. n Sequence {zn} with zn = (1 + i ) is divergent. Seoul National 3 Univ. 15.1 Sequences, Series, Convergence Tests Theorem 1 Sequences of the Real and the Imaginary Parts . A sequence z1, z2, z3, … of complex numbers zn = xn + iyn converges to c = a + ib . if and only if the sequence of the real parts x1, x2, … converges to a . and the sequence of the imaginary parts y1, y2, … converges to b. Ex.
    [Show full text]
  • Formal Power Series - Wikipedia, the Free Encyclopedia
    Formal power series - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Formal_power_series Formal power series From Wikipedia, the free encyclopedia In mathematics, formal power series are a generalization of polynomials as formal objects, where the number of terms is allowed to be infinite; this implies giving up the possibility to substitute arbitrary values for indeterminates. This perspective contrasts with that of power series, whose variables designate numerical values, and which series therefore only have a definite value if convergence can be established. Formal power series are often used merely to represent the whole collection of their coefficients. In combinatorics, they provide representations of numerical sequences and of multisets, and for instance allow giving concise expressions for recursively defined sequences regardless of whether the recursion can be explicitly solved; this is known as the method of generating functions. Contents 1 Introduction 2 The ring of formal power series 2.1 Definition of the formal power series ring 2.1.1 Ring structure 2.1.2 Topological structure 2.1.3 Alternative topologies 2.2 Universal property 3 Operations on formal power series 3.1 Multiplying series 3.2 Power series raised to powers 3.3 Inverting series 3.4 Dividing series 3.5 Extracting coefficients 3.6 Composition of series 3.6.1 Example 3.7 Composition inverse 3.8 Formal differentiation of series 4 Properties 4.1 Algebraic properties of the formal power series ring 4.2 Topological properties of the formal power series
    [Show full text]
  • 7. Properties of Uniformly Convergent Sequences
    46 1. THE THEORY OF CONVERGENCE 7. Properties of uniformly convergent sequences Here a relation between continuity, differentiability, and Riemann integrability of the sum of a functional series or the limit of a functional sequence and uniform convergence is studied. 7.1. Uniform convergence and continuity. Theorem 7.1. (Continuity of the sum of a series) N The sum of the series un(x) of terms continuous on D R is continuous if the series converges uniformly on D. ⊂ P Let Sn(x)= u1(x)+u2(x)+ +un(x) be a sequence of partial sum. It converges to some function S···(x) because every uniformly convergent series converges pointwise. Continuity of S at a point x means (by definition) lim S(y)= S(x) y→x Fix a number ε> 0. Then one can find a number δ such that S(x) S(y) <ε whenever 0 < x y <δ | − | | − | In other words, the values S(y) can get arbitrary close to S(x) and stay arbitrary close to it for all points y = x that are sufficiently close to x. Let us show that this condition follows6 from the hypotheses. Owing to the uniform convergence of the series, given ε > 0, one can find an integer m such that ε S(x) Sn(x) sup S Sn , x D, n m | − |≤ D | − |≤ 3 ∀ ∈ ∀ ≥ Note that m is independent of x. By continuity of Sn (as a finite sum of continuous functions), for n m, one can also find a number δ > 0 such that ≥ ε Sn(x) Sn(y) < whenever 0 < x y <δ | − | 3 | − | So, given ε> 0, the integer m is found.
    [Show full text]
  • 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]
  • Uniform Convergence and Differentiation Theorem 6.3.1
    Math 341 Lecture #29 x6.3: Uniform Convergence and Differentiation We have seen that a pointwise converging sequence of continuous functions need not have a continuous limit function; we needed uniform convergence to get continuity of the limit function. What can we say about the differentiability of the limit function of a pointwise converging sequence of differentiable functions? 1+1=(2n−1) The sequence of differentiable hn(x) = x , x 2 [−1; 1], converges pointwise to the nondifferentiable h(x) = x; we will need to assume more about the pointwise converging sequence of differentiable functions to ensure that the limit function is differentiable. Theorem 6.3.1 (Differentiable Limit Theorem). Let fn ! f pointwise on the 0 closed interval [a; b], and assume that each fn is differentiable. If (fn) converges uniformly on [a; b] to a function g, then f is differentiable and f 0 = g. Proof. Let > 0 and fix c 2 [a; b]. Our goal is to show that f 0(c) exists and equals g(c). To this end, we will show the existence of δ > 0 such that for all 0 < jx − cj < δ, with x 2 [a; b], we have f(x) − f(c) − g(c) < x − c which implies that f(x) − f(c) f 0(c) = lim x!c x − c exists and is equal to g(c). The way forward is to replace (f(x) − f(c))=(x − c) − g(c) with expressions we can hopefully control: f(x) − f(c) f(x) − f(c) fn(x) − fn(c) fn(x) − fn(c) − g(c) = − + x − c x − c x − c x − c 0 0 − f (c) + f (c) − g(c) n n f(x) − f(c) fn(x) − fn(c) ≤ − x − c x − c fn(x) − fn(c) 0 0 + − f (c) + jf (c) − g(c)j: x − c n n The second and third expressions we can control respectively by the differentiability of 0 fn and the uniformly convergence of fn to g.
    [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]
  • G: Uniform Convergence of Fourier Series
    G: Uniform Convergence of Fourier Series From previous work on the prototypical problem (and other problems) 8 < ut = Duxx 0 < x < l ; t > 0 u(0; t) = 0 = u(l; t) t > 0 (1) : u(x; 0) = f(x) 0 < x < l we developed a (formal) series solution 1 1 X X 2 2 2 nπx u(x; t) = u (x; t) = b e−n π Dt=l sin( ) ; (2) n n l n=1 n=1 2 R l nπy with bn = l 0 f(y) sin( l )dy. These are the Fourier sine coefficients for the initial data function f(x) on [0; l]. We have no real way to check that the series representation (2) is a solution to (1) because we do not know we can interchange differentiation and infinite summation. We have only assumed that up to now. In actuality, (2) makes sense as a solution to (1) if the series is uniformly convergent on [0; l] (and its derivatives also converges uniformly1). So we first discuss conditions for an infinite series to be differentiated (and integrated) term-by-term. This can be done if the infinite series and its derivatives converge uniformly. We list some results here that will establish this, but you should consult Appendix B on calculus facts, and review definitions of convergence of a series of numbers, absolute convergence of such a series, and uniform convergence of sequences and series of functions. Proofs of the following results can be found in any reasonable real analysis or advanced calculus textbook. 0.1 Differentiation and integration of infinite series Let I = [a; b] be any real interval.
    [Show full text]
  • Series of Functions Theorem 6.4.2
    Math 341 Lecture #30 x6.4: Series of Functions Recall that we constructed the continuous nowhere differentiable function from Section 5.4 by using a series. We will develop the tools necessary to showing that this pointwise convergent series is indeed a continuous function. Definition 6.4.1. Let fn, n 2 N, and f be functions on A ⊆ R. The infinite series 1 X fn(x) = f1(x) + f2(x) + f3(x) + ··· n=1 converges pointwise on A to f(x) if the sequence of partial sums, sk(x) = f1(x) + f2(x) + ··· + fk(x) converges pointwise to f(x). The series converges uniformly on A to f if the sequence sk(x) converges uniformly on A to f(x). Uniform convergence of a series on A implies pointwise convergence of the series on A. For a pointwise or uniformly convergent series we write 1 1 X X f = fn or f(x) = fn(x): n=1 n=1 When the functions fn are continuous on A, each partial sum sk(x) is continuous on A by the Algebraic Continuity Theorem (Theorem 4.3.4). We can therefore apply the theory for uniformly convergent sequences to series. Theorem 6.4.2 (Term-by-term Continuity Theorem). Let fn be continuous functions on A ⊆ . If R 1 X fn n=1 converges uniformly to f on A, then f is continuous on A. Proof. We apply Theorem 6.2.6 to the partial sums sk = f1 + f2 + ··· + fk. When the functions fn are differentiable on a closed interval [a; b], we have that each partial sum sk is differentiable on [a; b] as well.
    [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]
  • Classical Analysis
    Classical Analysis Edmund Y. M. Chiang December 3, 2009 Abstract This course assumes students to have mastered the knowledge of complex function theory in which the classical analysis is based. Either the reference book by Brown and Churchill [6] or Bak and Newman [4] can provide such a background knowledge. In the all-time classic \A Course of Modern Analysis" written by Whittaker and Watson [23] in 1902, the authors divded the content of their book into part I \The processes of analysis" and part II \The transcendental functions". The main theme of this course is to study some fundamentals of these classical transcendental functions which are used extensively in number theory, physics, engineering and other pure and applied areas. Contents 1 Separation of Variables of Helmholtz Equations 3 1.1 What is not known? . .8 2 Infinite Products 9 2.1 Definitions . .9 2.2 Cauchy criterion for infinite products . 10 2.3 Absolute and uniform convergence . 11 2.4 Associated series of logarithms . 14 2.5 Uniform convergence . 15 3 Gamma Function 20 3.1 Infinite product definition . 20 3.2 The Euler (Mascheroni) constant γ ............... 21 3.3 Weierstrass's definition . 22 3.4 A first order difference equation . 25 3.5 Integral representation definition . 25 3.6 Uniform convergence . 27 3.7 Analytic properties of Γ(z)................... 30 3.8 Tannery's theorem . 32 3.9 Integral representation . 33 3.10 The Eulerian integral of the first kind . 35 3.11 The Euler reflection formula . 37 3.12 Stirling's asymptotic formula . 40 3.13 Gauss's Multiplication Formula .
    [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]
  • Sequences and Series of Functions, Convergence, Power Series
    6: SEQUENCES AND SERIES OF FUNCTIONS, CONVERGENCE STEVEN HEILMAN Contents 1. Review 1 2. Sequences of Functions 2 3. Uniform Convergence and Continuity 3 4. Series of Functions and the Weierstrass M-test 5 5. Uniform Convergence and Integration 6 6. Uniform Convergence and Differentiation 7 7. Uniform Approximation by Polynomials 9 8. Power Series 10 9. The Exponential and Logarithm 15 10. Trigonometric Functions 17 11. Appendix: Notation 20 1. Review Remark 1.1. From now on, unless otherwise specified, Rn refers to Euclidean space Rn n with n ≥ 1 a positive integer, and where we use the metric d`2 on R . In particular, R refers to the metric space R equipped with the metric d(x; y) = jx − yj. (j) 1 Proposition 1.2. Let (X; d) be a metric space. Let (x )j=k be a sequence of elements of X. 0 (j) 1 Let x; x be elements of X. Assume that the sequence (x )j=k converges to x with respect to (j) 1 0 0 d. Assume also that the sequence (x )j=k converges to x with respect to d. Then x = x . Proposition 1.3. Let a < b be real numbers, and let f :[a; b] ! R be a function which is both continuous and strictly monotone increasing. Then f is a bijection from [a; b] to [f(a); f(b)], and the inverse function f −1 :[f(a); f(b)] ! [a; b] is also continuous and strictly monotone increasing. Theorem 1.4 (Inverse Function Theorem). Let X; Y be subsets of R.
    [Show full text]