SUM of LOGARITHMS, LOGARITHM of PRODUCT We Begin with An

SUM of LOGARITHMS, LOGARITHM of PRODUCT We Begin with An

SUM OF LOGARITHMS, LOGARITHM OF PRODUCT We begin with an easy observation. Let z1; z2;::: lie in C. Suppose that the sequence of their partial sums converges, N X N f zng = fsN g ! s: n=1 Because the exponential is a continuous homomorphism from (C; +) to (C×; ·), the sequence of partial products of the exponentials converges correspondingly, N Y zn N s f e g = fpN g ! p where p = e : n=1 P Q zn s Briefly, if n zn = s then n e = e . × We want a converse result. Let z1; z2;::: lie in C . Suppose that the sequence of their partial products converges in C× (convergence to 0 is not convergence in the multiplicative group C×), N Y N f zng = fpN g ! p 6= 0: n=1 We will show that for any appropriately sensible chosen branch of the complex log- arithm, the sequence of partial sums of the logarithms converges to some logarithm of the product, N X N f log zng = fsN g ! s; where s 2 log p + 2πiZ: n=1 But because no branch of the logarithm is a homomorphism, no claim can be made Q that s = log p for the branch of log that is being used. Briefly, if zn = p 6= 0 then P log zn 2 log p + 2πiZ. × To begin the argument, recall that we have a sequence z1; z2;::: in C such that QN × the sequence f n=1 zng = fpN g of partial products converges to some p in C . Note that the multiplicative analogue of the nth term test applies to the sequence × of partial products: Because fpN g converges to p in C , the individual terms zN must converge to 1, pN N p fzN g = ! = 1: pN−1 p Also, the disk D about p of radius jpj=2 misses 0, and all but finitely many of 0 the partial products pN lie in D, and the disk D about 1 of radius 1=2 misses 0, 0 and all but finitely many of the zN lie in D . Take a branch cut that misses D and 0 misses D and misses the finitely many terms zN and partial products pN outside of the two disks. Specifically, the branch cut can be chosen as a ray from the origin, not R≥0, and then the logarithm can be chosen so that log 1 = 0. 1 2 SUM OF LOGARITHMS, LOGARITHM OF PRODUCT Because the sequence fpN g converges to p in the domain of our branch of the logarithm, which is continuous, also N flog pN g ! log p: P But our concern is the convergence of the sum n log zn, whose partial sums PN n=1 log zn need not equal log pN , and so we need to consider how they differ. Because flog pN g converges, we have N flog pN − log pN−1g ! 0: Also, note that log pN − log pN−1 = log(pN−1zN ) − log pN−1 = log pN−1 + log zN + 2πikN − log pN−1 for some kN 2 Z = log zN + 2πikN : So now we have N flog zN + 2πikN g ! 0: N But fzN g ! 1 and log 1 = 0, so in fact N fkN g ! 0: Because each kN is an integer, there exists a starting index No such that kN = 0 for all N ≥ No: This shows that the logarithm does behave homomorphically on the partial products of large index, log pN = log pN−1 + log zN for all N ≥ No: And one integer k captures the non-homomorphic behavior up to the starting index where the homomorphic behavior begins, N Xo log zn = log pNo + 2πik for some k 2 Z: n=1 Thus the sequence of partial sums of the logarithms of the sequence terms is, from the Noth term onwards, N X f log zngN≥No = flog pN gN≥No + 2πik: n=1 We know that the sequence flog pN g converges to log p, and so the claim is estab- lished, N X N f log zng ! log p + 2πik: n=1.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    2 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us