DOCSLIB.ORG

Uniform Convergence

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Uniform Convergence Uniform Convergence Where is it prove that one obtains the derivative of an infinite series by taking derivative of each term ? - - -Niels Henrik Abel We have already studied sequences and series of (constant) real numbers. In most problems, however, it is desirable to approximate functions by more elementary ones that are easier to in- vestigate. We have already done this on a few occasions. For example, we looked at the uniform approximation of continuous functions by step, piecewise linear, and polynomial functions. Also, we proved that each bounded continuous function on a closed bounded interval is a uniform limit of regulated functions. Now all these approximations involve estimates on the distance between the given continuous function and the elementary functions that approximate it. This in turn sug- gests the introduction of sequences (and hence also series) whose terms are functions defined, in most cases, on the same interval. 1 Sequence and Series of Functions (i) For a set E ⊂ R, let us denote by F(E; R) the set of all functions from E to R. We are interested in sequences and series in the sets F(E; R). For each sequence hfni 2 F(E; R)N and each x 2 E, the numerical sequence hfn(x)i 2 RN may or may not converge. Let x fn : [0; 1] ! R be a function, given by fn(x) = n ; x 2 [0; 1], then hfni is a sequence of functions on [0; 1]. (ii) Let E ⊂ R and let huni 2 F(E; R)N. Then the formal sum 1 X u1 + u2 + ··· + un + ··· = un n=1 is called an infinite series of functions with general term un. For each x 2 E, we have a numerical series 1 X u1(x) + u2(x) + ··· + un(x) + ··· = un(x) n=1 For each n 2 N, we can then define the partial sum n X sn(x) = u1(x) + u2(x) + ··· + uk(x) = uk(x) k=1 This defines a sequence hsni 2 F(E; R)N. 1 2 Small Overview On Uniform Convergence 2 Pointwise Convergence Definition 1. [Pointwise Convergent Sequence of functions ]: For each hfni 2 F(E; R)N; let E0 ⊂ E be the set of all points x 2 E such that the numerical sequence hfn(x)i 2 RN converges and let f(x) = lim fn(x); 8x 2 E0 (1) n−!1 which, in detail, means that, corresponding to an " > 0, 9N = N(x; ") 2 N, depends on both x and ", such that jfn(x) − f(x)j < "; whenever n ≥ N (2) The sequence hfni is then said to be pointwise convergent (or simply convergent) on E0 and the function f 2 F(E0; R); defined by (1) is called the pointwise limit (or simply limit) of hfni on E0. For example, let X = f1; 2; 3g and let fn(k) ≡ n(modk); k = 1; 2; 3 where n(modk) is the remainder when n is divided by k. Let a = 1, then fn(1) = 0 for n 2 N and hence fn(1) ! 0. On the other hand hfn(2)i = h1; 0; 1; 0; · · · i and hence the sequence is not convergent. Hence the sequence hfni is not pointwise convergent on X. We now look at a few examples and examine their pointwise convergence. Pay attention to the graphs of these functions to get an idea of what is going on. As far as possible, we shall investigate whether the given sequence is pointwise convergent and if so, we shall determine the limit function. EXAMPLE 1. (A discontinuous limit of continuous functions) Consider, the sequence hfn(x)in, n where, fn(x) = x , for all x 2 [0; 1] as y 6 depicted in the Fig. 1. For x 2 [0; 1). 1 We then have lim fn(x) = 0. On n−!1 the other hand, lim fn(1) = 1. The n−!1 n =n 1= 2 sequence is therefore pointwise conver- n = 5 gent to a function f(x), on [0; 1], where - x ( O ! 0; if 0 ≤ x < 1; f(x) = Figure 1: fn(x) for n = 1; 2; 3; 4; 5. 1; if x = 1 Note that each function fn(x) of the sequence is continuous on [0; 1], but the limit function is not continuous on [0; 1], it has a jump discontinuity at the point x = 1. nx n=2 EXAMPLE 2. Consider, the sequence hf (x)i , where, f (x) = 1 − ; n ≥ 1 for n n n n + 1 all x 2 (−∞; 1]. We then have lim fn(x) = 0, for 0 < x < 1 and lim fn(x) = 1, for n−!1 n−!1 x < 0. On the other hand, lim fn(0) = 1. Thus, the sequence hfn(x)in converges pointwise on n−!1 E0 = [0; 1] to the limit function f defined by ( 0; if 0 ≤ x ≤ 1; f(x) = 1; if x = 0 Dr. Prasun Kumar Nayak Home Study Materiel 3 Small Overview On Uniform Convergence n −nx EXAMPLE 3. Consider, the sequence hfn(x)in, where, fn(x) = x e ; n ≥ 1 and x ≥ 0, as y y 6 6 y = n y = e−n y = fn(x) 2 n −nx − − 1 - y = fn(x) = x e n n 1 2 e O n n x e - ee y = −n O (a) 1 x q (b) n −nx Figure 2: (a) fn(x) = x e (b) fn(x). 0 n−1 −nx depicted in the Fig. 2(a). Now, fn(x) = nx e (1 − x) = 0, gives x = 1 and the maximum −n −n value of fn(x) on [0; 1) is e . Therefore jfn(x)j ≤ e , and so lim fn(x) = 0 for all x ≥ 0. n!1 The limit function in this case is identically zero on [0; 1). EXAMPLE 4. Consider, the sequence hfn(x)in, where, for n ≥, 8 0; x < − 2 > for n > 2 1 > −n(2 + nx); for − n ≤ x < − n < 2 1 1 fn(x) = n x; for − n ≤ x < n > n(2 − nx); for 1 ≤ x < 2 > n n :> 2 0; for x ≥ n defined on (−∞; 1), as depicted in the Fig. 2(b). Here lim fn(0) = 0, for all n and lim fn(x) = n!1 n!1 2 0 if n ≥ jxj . Therefore f(x) = lim fn(x) = 0; −∞ < x < 1; n!1 so, the limit function in this case is identically zero on (−∞; 1). EXAMPLE 5. (Uniform limits of differentiable functions need not be differentiable): Consider, y 6 the sequence hfn(x)in, where fn : r f (x) 1 1 ! defined by f (x) = x2 + , R R n n f2(x) n 2 N, as depicted in the Figure 3, for all x 2 R. Here we clearly have y = jxj lim fn(x) = jxj for all x 2 . Thus, n-−!1 R O thex sequence is pointwise convergent on R. We also observe that fn is dif- Figure 3: Uniform limits of differen- ferentiable on R for all n 2 N with tiable functions need not be differen- 0 x fn(x) = q . tiable 2 1 x + n On the other hand, the limit function f(x) = jxj is not differentiable at x = 0. sin(n2x) EXAMPLE 6. Consider, the sequence hf (x)i , where, f (x) = for all x 2 and n n n n R n 2 N. Dr. Prasun Kumar Nayak Home Study Materiel 4 Small Overview On Uniform Convergence as depicted in the Figure 6. Since j sin αj ≤ 1 for all α 2 y 6 sin x R, we have obvious estimate f1(x) = 1 1 jfn(x)j ≤ n for any x 2 R. Here the limit function, f; O π is the (identically) zero func- - −π x sin(n2x) tion. Indeed, ≤ n 1 holds for all x 2 and n R 1 n 2 N and lim = 0. n−!1 n Figure 4: Graph of fn(x) of Example 6 0 Therefore, f(x) = f (x) = 0 for all x 2 R. On the other hand, cos(n2x) f 0 (x) = n2 · = n cos(n2x) n n does not converge to 0. In fact, lim f 0 (0) = lim (n) = 1: n−!1 n n−!1 2 EXAMPLE 7. Consider, the sequence hfn(x)in, where, fn(x) = [cos (n!πx)], for all x 2 [0; 1] p where, for each t 2 R, [t] denotes the greatest integer ≤ t. If x = q with (relatively prime) positive integers p and q; then n!x is an integer for all n ≥ q and hence cos2(n!πx) = 1. On the 2 other hand, if x 2 Q, then cos (n!πx) 2 (0; 1). It follows that the (pointwise) limit function, f, is given by ( 0; if x 2 \ [0; 1]; f(x) = Q 1; if x 2 [0; 1]=Q In other words, f is the Dirichlet function which is nowhere continuous on [0; 1]. In particular, f is not Riemann integrable. On the other hand, each fn has only a finite (in fact n! + 1) number of discontinuity points and hence is Riemann integrable. 2 n EXAMPLE 8. Consider the functions fn(x) = nx(1 − x ) , for all x 2 [0; 1]. The (pointwise) limit, f; is the identically zero function: f(x) = 0; 8x 2 [0; 1]. This is obvious for x = 0 and x = 1, and for x 2 (0; 1) it follows from the fact that lim nαn = 0, for all α 2 (0; 1). Now n−!1 Z 1 nhx(1 − x2)n+1 i1 n fn(x)dx = − = 0 2 n + 1 0 2(n + 1) Z 1 1 R 1 It follows that lim fn(x)dx = ; and yet 0 f(x)dx = 0.
Load more

Recommended publications
  • Exercise Set 13 Top04-E013 ; November 26, 2004 ; 9:45 A.M
    Prof. D. P.Patil, Department of Mathematics, Indian Institute of Science, Bangalore August-December 2004 MA-231 Topology 13. Function spaces1) —————————— — Uniform Convergence, Stone-Weierstrass theorem, Arzela-Ascoli theorem ———————————————————————————————– November 22, 2004 Karl Theodor Wilhelm Weierstrass† Marshall Harvey Stone†† (1815-1897) (1903-1989) First recall the following definitions and results : Our overall aim in this section is the study of the compactness and completeness properties of a subset F of the set Y X of all maps from a space X into a space Y . To do this a usable topology must be introduced on F (presumably related to the structures of X and Y ) and when this is has been done F is called a f unction space. N13.1 . (The Topology of Pointwise Convergence 2) Let X be any set, Y be any topological space and let fn : X → Y , n ∈ N, be a sequence of maps. We say that the sequence (fn)n∈N is pointwise convergent,ifforeverypoint x ∈X, the sequence fn(x) , n∈N,inY is convergent. a). The (Tychonoff) product topology on Y X is determined solely by the topology of Y (even if X is a topological X X space) the structure on X plays no part. A sequence fn : X →Y , n∈N,inY converges to a function f in Y if and only if for every point x ∈X, the sequence fn(x) , n∈N,inY is convergent. This provides the reason for the name the topology of pointwise convergence;this topology is also simply called the pointwise topology andisdenoted by Tptc .
    [Show full text]
  • 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]
  • Rearrangement of Divergent Fourier Series
    The Australian Journal of Mathematical Analysis and Applications AJMAA Volume 14, Issue 1, Article 3, pp. 1-9, 2017 A NOTE ON DIVERGENT FOURIER SERIES AND λ-PERMUTATIONS ANGEL CASTILLO, JOSE CHAVEZ, AND HYEJIN KIM Received 20 September, 2016; accepted 4 February, 2017; published 20 February, 2017. TUFTS UNIVERSITY,DEPARTMENT OF MATHEMATICS,MEDFORD, MA 02155, USA [email protected] TEXAS TECH UNIVERSITY,DEPARTMENT OF MATHEMATICS AND STATISTICS,LUBBOCK, TX 79409, USA [email protected] UNIVERSITY OF MICHIGAN-DEARBORN,DEPARTMENT OF MATHEMATICS AND STATISTICS,DEARBORN, MI 48128, USA [email protected] ABSTRACT. We present a continuous function on [−π, π] whose Fourier series diverges and it cannot be rearranged to converge by a λ-permutation. Key words and phrases: Fourier series, Rearrangements, λ-permutations. 2000 Mathematics Subject Classification. Primary 43A50. ISSN (electronic): 1449-5910 c 2017 Austral Internet Publishing. All rights reserved. This research was conducted during the NREUP at University of Michigan-Dearborn and it was sponsored by NSF-Grant DMS-1359016 and by NSA-Grant H98230-15-1-0020. We would like to thank Y. E. Zeytuncu for valuable discussion. We also thank the CASL and the Department of Mathematics and Statistics at the University of Michigan-Dearborn for providing a welcoming atmosphere during the summer REU program. 2 A. CASTILLO AND J. CHAVEZ AND H. KIM 1.1. Fourier series. The Fourier series associated with a continuous function f on [−π, π] is defined by ∞ X inθ fe(θ) ∼ ane , n=−∞ where Z π 1 −inθ an = f(θ)e dθ . 2π −π Here an’s are called the Fourier coefficients of f and we denote by fethe Fourier series associ- ated with f.
    [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]
  • The Summation of Power Series and Fourier Series
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Computational and Applied Mathematics 12&13 (1985) 447-457 447 North-Holland The summation of power series and Fourier . series I.M. LONGMAN Department of Geophysics and Planetary Sciences, Tel Aviv University, Ramat Aviv, Israel Received 27 July 1984 Abstract: The well-known correspondence of a power series with a certain Stieltjes integral is exploited for summation of the series by numerical integration. The emphasis in this paper is thus on actual summation of series. rather than mere acceleration of convergence. It is assumed that the coefficients of the series are given analytically, and then the numerator of the integrand is determined by the aid of the inverse of the two-sided Laplace transform, while the denominator is standard (and known) for all power series. Since Fourier series can be expressed in terms of power series, the method is applicable also to them. The treatment is extended to divergent series, and a fair number of numerical examples are given, in order to illustrate various techniques for the numerical evaluation of the resulting integrals. Keywork Summation of series. 1. Introduction We start by considering a power series, which it is convenient to write in the form s(x)=/.Q-~2x+&x2..., (1) for reasons which will become apparent presently. Here there is no intention to limit ourselves to alternating series since, even if the pLkare all of one sign, x may take negative and even complex values. It will be assumed in this paper that the pLk are real.
    [Show full text]
  • Divergent and Conditionally Convergent Series Whose Product Is Absolutely Convergent
    DIVERGENTAND CONDITIONALLY CONVERGENT SERIES WHOSEPRODUCT IS ABSOLUTELYCONVERGENT* BY FLORIAN CAJOKI § 1. Introduction. It has been shown by Abel that, if the product : 71—« I(¥» + V«-i + ■•• + M„«o)> 71=0 of two conditionally convergent series : 71—0 71— 0 is convergent, it converges to the product of their sums. Tests of the conver- gence of the product of conditionally convergent series have been worked out by A. Pringsheim,| A. Voss,J and myself.§ There exist certain conditionally- convergent series which yield a convergent result when they are raised to a cer- tain positive integral power, but which yield a divergent result when they are raised to a higher power. Thus, 71 = «3 Z(-l)"+13, 7>=i n where r = 7/9, is a conditionally convergent series whose fourth power is con- vergent, but whose fifth power is divergent. || These instances of conditionally * Presented to the Society April 28, 1900. Received for publication April 28, 1900. fMathematische Annalen, vol. 21 (1883), p. 327 ; vol. 2(5 (1886), p. 157. %Mathematische Annalen, vol. 24 (1884), p. 42. § American Journal of Mathematics, vol. 15 (1893), p. 339 ; vol. 18 (1896), p. 195 ; Bulletin of the American Mathematical Society, (2) vol. 1 (1895), p. 180. || This may be a convenient place to point out a slight and obvious extension of the results which I have published in the American Journal of Mathematics, vol. 18, p. 201. It was proved there that the conditionally convergent series : V(_l)M-lI (0<r5|>). Sí n when raised by Cauchy's multiplication rule to a positive integral power g , is convergent whenever (î — l)/ï <C r ! out the power of the series is divergent, if (q— 1 )¡q > r.
    [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]
  • Notes on Euler's Work on Divergent Factorial Series and Their Associated
    Indian J. Pure Appl. Math., 41(1): 39-66, February 2010 °c Indian National Science Academy NOTES ON EULER’S WORK ON DIVERGENT FACTORIAL SERIES AND THEIR ASSOCIATED CONTINUED FRACTIONS Trond Digernes¤ and V. S. Varadarajan¤¤ ¤University of Trondheim, Trondheim, Norway e-mail: [email protected] ¤¤University of California, Los Angeles, CA, USA e-mail: [email protected] Abstract Factorial series which diverge everywhere were first considered by Euler from the point of view of summing divergent series. He discovered a way to sum such series and was led to certain integrals and continued fractions. His method of summation was essentialy what we call Borel summation now. In this paper, we discuss these aspects of Euler’s work from the modern perspective. Key words Divergent series, factorial series, continued fractions, hypergeometric continued fractions, Sturmian sequences. 1. Introductory Remarks Euler was the first mathematician to develop a systematic theory of divergent se- ries. In his great 1760 paper De seriebus divergentibus [1, 2] and in his letters to Bernoulli he championed the view, which was truly revolutionary for his epoch, that one should be able to assign a numerical value to any divergent series, thus allowing the possibility of working systematically with them (see [3]). He antic- ipated by over a century the methods of summation of divergent series which are known today as the summation methods of Cesaro, Holder,¨ Abel, Euler, Borel, and so on. Eventually his views would find their proper place in the modern theory of divergent series [4]. But from the beginning Euler realized that almost none of his methods could be applied to the series X1 1 ¡ 1!x + 2!x2 ¡ 3!x3 + ::: = (¡1)nn!xn (1) n=0 40 TROND DIGERNES AND V.
    [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]
  • Euler and His Work on Infinite Series
    BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 44, Number 4, October 2007, Pages 515–539 S 0273-0979(07)01175-5 Article electronically published on June 26, 2007 EULER AND HIS WORK ON INFINITE SERIES V. S. VARADARAJAN For the 300th anniversary of Leonhard Euler’s birth Table of contents 1. Introduction 2. Zeta values 3. Divergent series 4. Summation formula 5. Concluding remarks 1. Introduction Leonhard Euler is one of the greatest and most astounding icons in the history of science. His work, dating back to the early eighteenth century, is still with us, very much alive and generating intense interest. Like Shakespeare and Mozart, he has remained fresh and captivating because of his personality as well as his ideas and achievements in mathematics. The reasons for this phenomenon lie in his universality, his uniqueness, and the immense output he left behind in papers, correspondence, diaries, and other memorabilia. Opera Omnia [E], his collected works and correspondence, is still in the process of completion, close to eighty volumes and 31,000+ pages and counting. A volume of brief summaries of his letters runs to several hundred pages. It is hard to comprehend the prodigious energy and creativity of this man who fueled such a monumental output. Even more remarkable, and in stark contrast to men like Newton and Gauss, is the sunny and equable temperament that informed all of his work, his correspondence, and his interactions with other people, both common and scientific. It was often said of him that he did mathematics as other people breathed, effortlessly and continuously.
    [Show full text]
  • Pointwise Convergence Ofofof Complex Fourier Series
    Pointwise convergence ofofof complex Fourier series Let f(x) be a periodic function with period 2 l defined on the interval [- l,l]. The complex Fourier coefficients of f( x) are l -i n π s/l cn = 1 ∫ f(s) e d s 2 l -l This leads to a Fourier series representation for f(x) ∞ i n π x/l f(x) = ∑ cn e n = -∞ We have two important questions to pose here. 1. For a given x, does the infinite series converge? 2. If it converges, does it necessarily converge to f(x)? We can begin to address both of these issues by introducing the partial Fourier series N i n π x/l fN(x) = ∑ cn e n = -N In terms of this function, our two questions become 1. For a given x, does lim fN(x) exist? N→∞ 2. If it does, is lim fN(x) = f(x)? N→∞ The Dirichlet kernel To begin to address the questions we posed about fN(x) we will start by rewriting fN(x). Initially, fN(x) is defined by N i n π x/l fN(x) = ∑ cn e n = -N If we substitute the expression for the Fourier coefficients l -i n π s/l cn = 1 ∫ f(s) e d s 2 l -l into the expression for fN(x) we obtain N l 1 -i n π s/l i n π x/l fN(x) = ∑ ∫ f(s) e d s e n = -N(2 l -l ) l N = ∫ 1 ∑ (e-i n π s/l ei n π x/l) f(s) d s -l (2 l n = -N ) 1 l N = ∫ 1 ∑ ei n π (x-s)/l f(s) d s -l (2 l n = -N ) The expression in parentheses leads us to make the following definition.
    [Show full text]