DOCSLIB.ORG

1 Using Convergence Tests 2 the Cauchy Condensation Test

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
1 Using Convergence Tests 2 the Cauchy Condensation Test 1 Using convergence tests 1. Decide whether each of the following series converge or diverge: 1 1 1 X sin n X (−1)n X n2 ; p ; : n2 4 + n (log log n)log n n=1 n=1 n=3 [Hint for the last one: Rewrite the denominator using ab = eb log a.] 2. Find all real numbers x for which the following series converge: 1 1 X n2xn X xn(1 − x) ; 5n n n=0 n=1 2 The Cauchy condensation test In this section, we state and prove the Cauchy condensation test, an alternative to the integral test which is more \elementary" in the sense that we do not need to develop any further theory than that of sequences and series. (In particular, we do not need to develop integration.) Let (an) be a sequence which is decreasing and converges to 0. (For such a sequence, we may write an & 0.) The Cauchy condensation test states that 1 1 X X k an converges () 2 a2k converges: n=1 k=0 The next two problems give a proof of this result. 1. Let N K X X k SN = an (N 2 N) and TK = 2 a2k (K 2 N [ f0g): n=1 k=0 Show for all K ≥ 0 that 1 S K+1 ≤ T and (T − a ) ≤ S K − a : 2 −1 K 2 K 1 2 1 2. Use the previous bounds together with the convergence of bounded monotone sequences to prove the validity of the Cauchy condensation test. The remaining problems apply the Cauchy condensation test to various series. P p 3.( p-test) Fix p 2 R. Show that 1=n converges if and only if p > 1. 4. The p-test suggests that the harmonic series P 1=n is more-or-less the smallest diverging series, as any power of n in the denominator greater than 1 gives a converging series. 1 X 1 However, there are smaller diverging series: show that diverges. n log n n=2 pn 5. For each n 2 N, let pn denote the n-th prime number. Using the fact that lim = 1, n!1 n log n P a consequence of the Prime Number Theorem, show that 1=pn diverges. 1 3 The limit comparison test Throughout, let (an) and (bn) be positive sequences. P 1. Show that if bn converges and a lim sup n < +1; bn P then an converges. P 2. Show that if bn diverges and a lim inf n > 0; bn P then an diverges. 3. Show that if a 0 < lim n < +1; n!1 bn P P then an converges if and only if bn converges. 4 Summation by parts and alternating series N X 1. (Summation by parts) Let (an) and (bn) be two sequences, then let AN = an be the n=1 P N-th partial sum of an. Use induction on N to show that for all M; N 2 N with M ≤ N, N N−1 X X anbn = (AN bN − AM−1bM ) + An(bn − bn+1): n=M n=M [When N = M, the sum on the right hand side equals 0. Also, we take A0 = 0.] N X 2. (Dirichlet's test) Let (an) and (bn) be two sequences, then let BN = bn be the N-th n=1 P partial sum of bn. Suppose an & 0, i.e. (an) is decreasing and an ! 0, and that the 1 sequence (BN )N=1 is bounded (but not necessarily convergent). (a) Use summation by parts to show that N N−1 X X anbn = aN BN + Bn(an − an+1): n=1 n=1 P (b) Show that jBn(an − an+1)j is absolutely convergent. P (c) Conclude that anbn converges. 3. Use Dirichlet's test to give another proof of the alternating series test. P 4. (Alternating series error bound) Let an be a converging alternating series and let AN P be its N-th partial sum. Show that jAN − anj < jaN+1j. 2 5 Series convergence and rate of decay In this section, we investigate the relationship between the speed at which a (positive) sequence P (an) converges to 0 and the convergence of the series an. Let (an) and (bn) be two positive sequences converging to 0. We say that (an) decays faster than (bn) if an=bn ! 0. In this case, we can also say that (bn) decays slower than (an). 1. Prove the following claims: (a) If p; q > 0, then 1=np decays faster than 1=nq if and only if p > q. (b) If p > 0 and 0 < r < 1, then rn decays faster than 1=np. (c) If 0 < r; s < 1, then rn decays faster than sn if and only if r < s. (d) If 0 < r < 1, then 1=n! decays faster than rn. 2. In this problem, we show that there is no \fastest-decaying diverging series," i.e. given any P positive sequence (bn) converging to 0 for which bn diverges, there is a positive sequence P (an) converging to 0 which decays faster than (bn) yet still has an diverging. P (a) Let (bn) be a positive sequence converging to 0 for which bn diverges, and define bn an = Pn : k=1 bk Show that (an) is a positive sequence converging to 0 which decays faster than (bn). P (b) Let BN be the N-th partial sum of bn. Explain why we can choose natural numbers N1 < N2 < N3 < ··· so that BNk+1 > 2BNk for all k 2 N. (c) Show that Nk+1 X BNk+1 − BNk 1 an ≥ > BNk+1 2 n=Nk+1 P for all k 2 N. Conclude that an diverges. 3. In this problem, we show that there is no \slowest-decaying convergent series." P P (a) Let an be a positive sequence converging to 0 for which an converges, and define a b = n : n pP1 k=n ak Show that (bn) is a positive sequence converging to 0 and (an) decays faster than (bn). P1 P (b) Let TN = n=N an be the N-th tail of an. Explain why the sequence defined recursively by N1 = minfN 2 N j TN ≤ 1=2g and Nk+1 = minfN 2 N j N > Nk and TN ≤ TNk =2g is well-defined and strictly increasing. Note that TNk =2 ≤ TNk+1−1 ≤ TNk . (c) Show that Nk+1−1 r X TNk − TNk+1−1 TN p b ≤ + b ≤ k + a ≤ 2pT ≤ 21−k=2 n p Nk+1−1 Nk+1−1 Nk TNk+1−1 2 n=Nk P for all k 2 N. Conclude that bn converges. 3 6 Rearrangement of series In this section, we investigate the effect of rearranging terms in a series. 1. Let SN and TN be the N-th partial sums of the two series 1 1 1 1 1 1 1 1 1 1 − + − + − · · · and 1 + − + + − + ··· ; 2 3 4 5 3 2 5 7 4 which have the same terms but in different orders. Let 1 1 1 H = 1 + + + ··· + N 2 3 N be the N-th partial sum of the harmonic series. (a) Show that (SN ) converges to a limit S. (b) Show that 1 1 S = H − H and T = H − H − H : 2N 2N N 3N 4N 2 2N 2 N (c) Deduce that TN ! 3S=2. P 2. Let an be an absolutely convergent series and let σ : N ! N be a permutation of N, i.e. a bijective function N ! N. (Informally, σ is a rearrangement of the natural numbers.) In P P this problem, we show that aσ(n) = an, i.e. rearranging the terms of an absolutely convergent series has no effect on its convergence and value. Fix > 0. 1 X (a) Explain why there exists N1 be such that janj < . n=N1+1 (b) Explain why there exists N2 such that f1;:::;N1g ⊆ fσ(1); : : : ; σ(N)g for N ≥ N2. P P (c) Let AN and BN be the N-th partial sums of an and aσ(n). Show that jAN1 − Aj < and jBN − AN1 j < for all N ≥ N2. (d) Deduce that BN ! A. Thus we see that absolute convergence gives us more than just a convenient way to test ordinary convergence: It assures us that we can rearrange terms however we want without changing the value of a series, which can be useful for evaluating them. For much of the rest of the section, we consider series which converge but do not absolutely converge. Such series are called conditionally convergent, and what we will ultimately show is that rearranging the terms of a conditionally convergent series can cause it to fail to converge, and even if the rearranged series remains convergent, it can take on any real value. P 3. Adapt the argument in Problem 2 to show that if an is a series with non-negative terms P P and an = +1, then aσ(n) = +1 for any permutation σ : N ! N. Moreover, this conclusion holds even if there are negative terms as long as the sum of all negative terms is finite. (In particular, the conclusion holds if there are only finitely many negative terms.) 4 P 4. Let an be a convergent series, and let (bk) = (ank ) and (cl) = (anl ) be the \subsequences" of non-negative and negative terms, respectively. Prove that exactly one of the following two cases must hold: P P P (I) k bk and l cl are both finite. In this case, an is absolutely convergent with 1 1 X X X X X X an = bk + cl and janj = bk − cl: n=1 k l n=1 k l (The quotes on \subsequences" are because it is possible for there to only be finitely many non-negative or finitely many negative terms.) P P P (II) k bk and l cl are both infinite.
Load more

Recommended publications
  • Abel's Identity, 131 Abel's Test, 131–132 Abel's Theorem, 463–464 Absolute Convergence, 113–114 Implication of Condi
    INDEX Abel’s identity, 131 Bolzano-Weierstrass theorem, 66–68 Abel’s test, 131–132 for sequences, 99–100 Abel’s theorem, 463–464 boundary points, 50–52 absolute convergence, 113–114 bounded functions, 142 implication of conditional bounded sets, 42–43 convergence, 114 absolute value, 7 Cantor function, 229–230 reverse triangle inequality, 9 Cantor set, 80–81, 133–134, 383 triangle inequality, 9 Casorati-Weierstrass theorem, 498–499 algebraic properties of Rk, 11–13 Cauchy completeness, 106–107 algebraic properties of continuity, 184 Cauchy condensation test, 117–119 algebraic properties of limits, 91–92 Cauchy integral theorem algebraic properties of series, 110–111 triangle lemma, see triangle lemma algebraic properties of the derivative, Cauchy principal value, 365–366 244 Cauchy sequences, 104–105 alternating series, 115 convergence of, 105–106 alternating series test, 115–116 Cauchy’s inequalities, 437 analytic functions, 481–482 Cauchy’s integral formula, 428–433 complex analytic functions, 483 converse of, 436–437 counterexamples, 482–483 extension to higher derivatives, 437 identity principle, 486 for simple closed contours, 432–433 zeros of, see zeros of complex analytic on circles, 429–430 functions on open connected sets, 430–432 antiderivatives, 361 on star-shaped sets, 429 for f :[a, b] Rp, 370 → Cauchy’s integral theorem, 420–422 of complex functions, 408 consequence, see deformation of on star-shaped sets, 411–413 contours path-independence, 408–409, 415 Cauchy-Riemann equations Archimedean property, 5–6 motivation, 297–300
    [Show full text]
  • Cauchy's Cours D'analyse
    SOURCES AND STUDIES IN THE HISTORY OF MATHEMATICS AND PHYSICAL SCIENCES Robert E. Bradley • C. Edward Sandifer Cauchy’s Cours d’analyse An Annotated Translation Cauchy’s Cours d’analyse An Annotated Translation For other titles published in this series, go to http://www.springer.com/series/4142 Sources and Studies in the History of Mathematics and Physical Sciences Editorial Board L. Berggren J.Z. Buchwald J. Lutzen¨ Robert E. Bradley, C. Edward Sandifer Cauchy’s Cours d’analyse An Annotated Translation 123 Robert E. Bradley C. Edward Sandifer Department of Mathematics and Department of Mathematics Computer Science Western Connecticut State University Adelphi University Danbury, CT 06810 Garden City USA NY 11530 [email protected] USA [email protected] Series Editor: J.Z. Buchwald Division of the Humanities and Social Sciences California Institute of Technology Pasadena, CA 91125 USA [email protected] ISBN 978-1-4419-0548-2 e-ISBN 978-1-4419-0549-9 DOI 10.1007/978-1-4419-0549-9 Springer Dordrecht Heidelberg London New York Library of Congress Control Number: 2009932254 Mathematics Subject Classification (2000): 01A55, 01A75, 00B50, 26-03, 30-03 c Springer Science+Business Media, LLC 2009 All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden.
    [Show full text]
  • SFS / M.Sc. (Mathematics with Computer Science)
    Mathematics Syllabi for Entrance Examination M.Sc. (Mathematics)/ M.Sc. (Mathematics) SFS / M.Sc. (Mathematics with Computer Science) Algebra.(5 Marks) Symmetric, Skew symmetric, Hermitian and skew Hermitian matrices. Elementary Operations on matrices. Rank of a matrices. Inverse of a matrix. Linear dependence and independence of rows and columns of matrices. Row rank and column rank of a matrix. Eigenvalues, eigenvectors and the characteristic equation of a matrix. Minimal polynomial of a matrix. Cayley Hamilton theorem and its use in finding the inverse of a matrix. Applications of matrices to a system of linear (both homogeneous and non–homogeneous) equations. Theoremson consistency of a system of linear equations. Unitary and Orthogonal Matrices, Bilinear and Quadratic forms. Relations between the roots and coefficients of general polynomial equation in one variable. Solutions of polynomial equations having conditions on roots. Common roots and multiple roots. Transformation of equations. Nature of the roots of an equation Descarte’s rule of signs. Solutions of cubic equations (Cardon’s method). Biquadratic equations and theirsolutions. Calculus.(5 Marks) Definition of the limit of a function. Basic properties of limits, Continuous functions and classification of discontinuities. Differentiability. Successive differentiation. Leibnitz theorem. Maclaurin and Taylor series expansions. Asymptotes in Cartesian coordinates, intersection of curve and its asymptotes, asymptotes in polar coordinates. Curvature, radius of curvature for Cartesian curves, parametric curves, polar curves. Newton’s method. Radius of curvature for pedal curves. Tangential polar equations. Centre of curvature. Circle of curvature. Chord of curvature, evolutes. Tests for concavity and convexity. Points of inflexion. Multiplepoints. Cusps, nodes & conjugate points. Type of cusps.
    [Show full text]
  • 1 Notes for Expansions/Series and Differential Equations in the Last
    Notes for Expansions/Series and Differential Equations In the last discussion, we considered perturbation methods for constructing solutions/roots of algebraic equations. Three types of problems were illustrated starting from the simplest: regular (straightforward) expansions, non-uniform expansions requiring modification to the process through inner and outer expansions, and singular perturbations. Before proceeding further, we first more clearly define the various types of expansions of functions of variables. 1. Convergent and Divergent Expansions/Series Consider a series, which is the sum of the terms of a sequence of numbers. Given a sequence {a1,a2,a3,a4,a5,....,an..} , the nth partial sum Sn is the sum of the first n terms of the sequence, that is, n Sn = ak . (1) k =1 A series is convergent if the sequence of its partial sums {S1,S2,S3,....,Sn..} converges. In a more formal language, a series converges if there exists a limit such that for any arbitrarily small positive number ε>0, there is a large integer N such that for all n ≥ N , ^ Sn − ≤ ε . (2) A sequence that is not convergent is said to be divergent. Examples of convergent and divergent series: • The reciprocals of powers of 2 produce a convergent series: 1 1 1 1 1 1 + + + + + + ......... = 2 . (3) 1 2 4 8 16 32 • The reciprocals of positive integers produce a divergent series: 1 1 1 1 1 1 + + + + + + ......... (4) 1 2 3 4 5 6 • Alternating the signs of the reciprocals of positive integers produces a convergent series: 1 1 1 1 1 1 − + − + − + ......... = ln 2 .
    [Show full text]
  • Real Analysis Honors Exam 1 Do the Best That You Can to Respond to The
    Real Analysis Honors Exam 1 Do the best that you can to respond to the following problems. It is not required that you respond to every problem, and, in fact, it is much better to provide complete and clearly explained responses to a subset of the given problems than to provide hurried and incomplete responses to all of them. When a complete response is not possible you are encouraged to clearly explain the partial progress that you can achieve. x2 y2 z2 4 1. Prove that the ellipsoid a2 + b2 + c2 = 1 has volume 3 πabc. You may assume that this formula is correct for the spherical case where a = b = c. 2. Newton's Method: Suppose that f : R ! R is continuously differen- tiable. Newton's method is an iterative algorithm designed to approx- imate the zeros of f. Start with a first guess x0, then for each integer n > 0 find the equation of the tangent line to the graph of f at the point (xn−1; f(xn−1))), and solve for the x intercept of that line which is named xn. Show that the sequence (xn) is guaranteed to converge under the following conditions: (a) f has a zero in the interval (a; b). (b) f is twice continuous differentiable with f 0(x) > 0 and f 00(x) > 0 on (a; b). 2 3. A function f : R ! R is Gateux differentiable at x0 if the limit f(x + hv) − f(x ) lim 0 0 ; h!0 h exists for all v 2 R2, i.e.
    [Show full text]
  • Bibliography
    Bibliography 1. E. Artin, The Gamma Function, Holt, Rinehart and Winston, New York, 1964 (translated by M. Butler from the German original, Einfubrung in Die Theorie Der Gamma Function, B. G. Teubner, 1931) 2. F. Bowman, Introduction to Elliptic Functions with Applications, Dover, New York, 1961 3. N. Bourbaki, Function D'une Variable Reel/e (Theorie Elementaire), Hermann, Editeur Des Sciences et Des Arts, Paris, 1949 4. T. J. I. Bromwich, Infinite Series (Second Edition Revised), Macmillan & Co. Limited, London, 1942 5. Burrill and Knudsen, Real Variables, Holt, Rinehart and Winston, New York, 1969 6. G. Chrystal, Textbook of Algebra, Vol. II, Dover Edition 7. Courant and John, Introduction to Calculus and Analysis, Interscience Divi­ sion, John Wiley and Sons, New York, 1965 8. Phillip Franklin, Treatise on Advanced Calculus, John Wiley and Sons, New York, 1940 9. Avmer Friedman, Advanced Calculus, Holt, Rinehart and Winston, New York, 1971 10. Watson Fulks, Advanced Calculus (Third Edition), John Wiley and Sons, New York, 1978 11. Eimar Hille, Analysis, Vol. I, Blaisdell Publishing Co., 1964 Ila. E. W. Hobson, The Theory of Functions of a Real Variable, Vol. II, Dover Edition, New York, 1957 12. Konrad Knopf, Theory and Application of Infinite Series, Blackie and Sons, London, 1951 13. Konrad Knopf, Infinite Sequences and Series, Dover Edition, 1956 14. D. Mitronovic, Analytic Inequalities, Springer-Verlag, New York 15. Poly and Azego, Aufgabe Der Analysis (2 vols.) Dover 16. John Olmsted, Advanced Calculus, Appleton, Century, Crofts, New York, 1956 16a. James Pierpont, Theory of Functions of Real Variables, Vol. II, Ginn and Company, Boston, New York, Chicago, London, 1912 17.
    [Show full text]
  • Sequences (2.2.1) Sequence. a Sequence Is a Function Whose
    Sequences (2.2.1) Sequence. A sequence is a function whose domain is N. ​ ​ ​ ​ (2.2.3) Convergence of a Sequence. A sequence (an) converges to a real number a if, for every ε > 0, ​ ​ ​ ​ ​ there exists an N ∈ N such that whenever n ≥ N, it follows that |an - a| < ε. ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ (2.2.3B) Convergence of a Sequence, Topological Characterization. A sequence (an) converges to a if, ​ ​ ​ ​ ​ given any ε-neighborhoodε V (a) of a, there exists a point in the sequence after which all of the terms ​ ​ ​ ​ ​ ε are in V (aε) ⇔ every V (a) contains all but a finite number of terms of (an). ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ (2.2.7) Uniqueness of Limits. The limit of a sequence, when it exists, must be unique. ​ ​ (2.2.9) Divergence. A sequence that does not converge is said to diverge. ​ ​ (2.3.1) Bounded. A sequence (xn) is bounded if ∃ M > 0 such that |xn| < M for all n ∈ N. ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ (2.3.2) Every convergent sequence is bounded. (2.3.3) Algebraic Limit Theorem. Let lim an = a and lim bn = b. Then, (i) lim(can) = ca for all c ∈ R; (ii) ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ lim(an + bn) = a + b; (iii) lim(anbn) = ab; (iv) lim(an/bn) = a/b provided b ≠ 0. ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​​ ​ ​ ​ ​ ​ ​ ​ (2.3.4) Order Limit Theorem. Assume lim an = a and lim bn = b. Then, (i) if an ≥ 0 for all n ∈ N, then ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ a ≥ 0; (ii) if an ≥ bn for every n ∈ N, then a ≥ b; (iii) If there exists c ∈ R for which c ≤ an for all n ∈ N, ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ ​ then c ≤ a.
    [Show full text]
  • December 16, 2011 Math 323 — Final Exam Make Sure Your Reasoning Is
    December 16, 2011 Math 323 | Final Exam Make sure your reasoning is clear. Points are specified. 1. (20 points) Prove the Mean Value Theorem for Integrals: If f is continuous on [a; b], then R b there is a point c in [a; b] for which f(c) is the \average value" ( a f)=(b − a) of f on [a; b]. (Hint for one possible proof: Denote by m and M the extreme values of f on [a; b], and use R b them to find bounds on a f.) 2. (18 points) Give examples to show the following: (a) The intersection of infinitely many nested, nonempty, bounded, open sets U1 ⊇ U2 ⊇ U3 ⊇ ::: may be empty. (b) A continuous function on a bounded open set may be unbounded. (c) A sequence in an unbounded closed set may not have a convergent subsequence. 3. (24 points) Prove the other half of the Cauchy Condensation Test: If (an) is a decreasing se- P1 P1 k quence of positive numbers and n=1 an converges, then k=0 2 a2k also converges. (Hint: It P1 P1 k−1 is enough to show that the convergence of n=2 an implies the convergence of k=1 2 a2k . Consider the diagram below.) 4. (24 points) True (in every case) or (possibly) false? If true, give a short proof. (For example, refer to a theorem.) If false, give a counterexample. (a) On a closed interval [a; b], every continuous function is the derivative of some (differen- tiable) function. (b) On a closed interval [a; b], every derivative of a (differentiable) function is a continuous function.
    [Show full text]
  • Also Called Cauchy's Condensation Test
    TMA226 17/18 A NOTE ON THE CONDENSATION TEST The condensation test (also called Cauchy's condensation test) is one of several tests that can be used to determine if a series converges or not. It is closely related to integral test, but in many cases the condensation test requires less work than the integral test. This short note presents a self-contained proof of the condensation test. We also look at the connection to the integral test, and some examples. Preliminaries Let us recall a few important definitions before we start. In particular, we define positive, decreasing and converging series. P P1 Definition 1. Let an = n=1 an be infinite series. P • We say that an is positive if an ≥ 0 for all n. P • We say that an is decreasing if an+1 ≤ an for all n. P P Definition 2. Let an be a positive series. We say that an converges if the partial sums sn = a1 + a2 + ··· + an; n = 1; 2;::: are uniformly bounded. That is, if there is some real number M ≥ 0 so that sn ≤ M 8n: (1) P If an does not converge, then we say that it diverges. P1 P Theorem 1. Let n=1 an be a positive series. Then an converges if and only if there exists a positive real number s such that m X s = lim an: (2) m!1 n=1 P Proof. Assume an converges. Then there is some real number M such that a1 + a2 + ··· + an ≤ M | {z } = sn for all n. Then, because of the least upper bound property of the real numbers, there exists some s 2 R such that s = supfs1; s2; s3;:::g: We will now show that s is the limit of the partial sums.
    [Show full text]
  • Week 2: Calculus II Notes
    Christian Parkinson GRE Prep: Calculus II Notes 1 Week 2: Calculus II Notes We concluded the Calculus I notes with Riemann integration, Fundamental Theorem of Calculus and some helpful integration techniques. However, ofter times, you will be asked to identify whether an integral converges or diverges even when you cannot find the value. This is especially true for improper integrals: those in which the integrand had a singularity or the range goes to infinity. We begin the Calculus II notes by discussing some basic convergence results. Proposition 1 (p-test). Let p 2 R. The integral Z 1 dx p 1 x converges if p > 1 and diverges otherwise. The integral Z 1 dx p 0 x converges if p < 1 and diverges otherwise. Note that as a consequence, the integral Z 1 dx p 0 x never converges. These can all be verified by a straight-forward calculation and hint at some good intuition. The borderline case is 1=x where neither integrals converge, so as a general rule, for Z 1 f(x)dx 1 to converge, we will need f(x) ! 0 faster than 1=x as x ! 1 and if g(x) has a singularity at x = 0, then for Z 1 g(x)dx 0 to converge, we need g(x) to blow up slower than 1=x as x ! 0+. Note, these \general rules" should not be seen has hard-and-fast truths, but rather heuristics which can often make it easy to verify if an integral converges or diverges. The following two theorems give more rigorous forms of these general rules.
    [Show full text]
  • MATHEMATICAL SOURCE REFERENCES Original Source
    MATHEMATICAL SOURCE REFERENCES Original source references for common mathematical ideas J. F. Barrett ISVR, University of Southampton First version 2005 Last update July 2016 1 INTRODUCTORY REMARKS This list of references originated from a notebook in which were jotted down interesting original references. Subsequently it seemed a useful project to extend and complete the list as far as time permitted, the task being an unending one. Having reached a certain stage of completeness it is made available hoping it is found useful for those interested in mathematical origins. Generally speaking, the topics mentioned are those met in a degree course in mathematics. For each entry the list attempts to give an exact source reference with comments about priority. There are now available other historical reference sources for mathematics on the internet though with a different style of presentation*. The work has been completed in its present form while Visitor to the Institute of Sound and Vibration Research, University of Southampton. ---------------------------- CONTENTS Page Alphabetical list of topics 3 Primary sources 81 Secondary sources 97 Journal abbreviations 100 ---------------------------------------------------------------------------------------- * E.g. Earliest known uses of some of the words in mathematics http://jeff560.tripod.com/a.html 2 A AFFINE CONNEXION Defined by Weyl in his thesis and used by him in General Relativity. ------------------------ H. Weyl: Reine Infinitesimal Geometrie, Diss. Math. Ann. 78 1917 H. Weyl: Raum, Zeit, Materie, Berlin 1918 (Springer), Engl. transl. from 4th edition: Space, Time, Matter 1922 (Methuen), rpt. NY (Dover) ALGEBRA The word derives from the Arabic "al-jabr" which occurred in the title of a book of the Arabic mathematician al-Khwarizmi (fl.
    [Show full text]
  • Math 5C Discussion Problems 2
    Math 5C Discussion Problems 2 Path Independence 1. Let C be the striaght-line path in R2 from the origin to (3; 1). Define f(x; y) = xyexy. Z (a) Evaluate rf · dr. C Z (b) Evaluate ((1; 0) + rf) · dr. C Z (c) Evaluate ((y; 0) + rf) · dr. C 2. Let C be the positively oriented unit circle in R2 centered at the origin. I (a) Evaluate y dx − x dy. C (b) Use the previous part to explain why (y; −x) isn't the gradient of a function. 3. For each of the following vector fields, determine whether it is the gradient of a function. (a) (4x2 − 4y2 + x; 7xy + ln y) on R2 (b) (3x2 ln x + x2; x3=y) on R2 (c) (x3y; 0; z2) on R3 4. For each of the following, find the function f. (a) f(0; 0; 0) = 0 and rf = (x; y; z) (b) f(1; 2; 3) = 4 and rf = (5; 6; 7) (c) f(1; 1; 1) = 1 and rf = (2xyz + sin x; x2z; x2y) 5. For which a is (ax ln y; 2y + x2=y) the gradient of a function in (some subset of) R2? Z 3 6. Let C be a curve in R2 given by r(t) = (cos5 t; sin t; t4), where 0 ≤ t ≤ π. Evaluate (yz; xz; xy) · dr. C Green's Theorem 1. Let D be the unit disk centered at the origin in R2. I (a) Evaluate dx + x dy. @D I (b) Evaluate arctan(esin x) dx + y dy. @D I (c) Evaluate (x3 − y3) dx + (x3 + y3) dy.
    [Show full text]