If $prodlimits_n(1+a_n)$ converges, does $sumlimits_nfraca_n1+a_n$ converge?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
5
down vote

favorite
2












I have a sequence of complex numbers $a_1,a_2,...$ such that $a_i neq -1$. I then have the infinite product $prodlimits_n=1^infty(1+a_n)$ which I know converges to a non zero complex number. I was wondering if this is enough to guarantee the convergence of $sumlimits_n=1^inftyfraca_n1+a_n$.



I couldn't come up with an obvious counterexample and my first idea for proving it was assuming $prodlimits_n=1^infty(1+a_n)=S$, so $sumlimits_n=1^inftyln(1+a_n)=ln S$ converges but have no idea how to deal with this since $1+a_i$ is complex.



If this diverges in general, I was wondering if there are any necessary and sufficient conditions for the sum to converge such as $sumlimits_n|a_n|<infty$ or that the $a_n$ are positive real numbers.



Any help would be awesome,and thanks for taking a look!










share|cite|improve this question























  • I believe $sum ln(1+a_n) $ converging implies $sum a_n$ converges, even for complex numbers, but I'm still looking for the proof (@twakhare it was, people keep giving diverging to 0 products).
    – user24142
    Aug 11 '15 at 0:49















up vote
5
down vote

favorite
2












I have a sequence of complex numbers $a_1,a_2,...$ such that $a_i neq -1$. I then have the infinite product $prodlimits_n=1^infty(1+a_n)$ which I know converges to a non zero complex number. I was wondering if this is enough to guarantee the convergence of $sumlimits_n=1^inftyfraca_n1+a_n$.



I couldn't come up with an obvious counterexample and my first idea for proving it was assuming $prodlimits_n=1^infty(1+a_n)=S$, so $sumlimits_n=1^inftyln(1+a_n)=ln S$ converges but have no idea how to deal with this since $1+a_i$ is complex.



If this diverges in general, I was wondering if there are any necessary and sufficient conditions for the sum to converge such as $sumlimits_n|a_n|<infty$ or that the $a_n$ are positive real numbers.



Any help would be awesome,and thanks for taking a look!










share|cite|improve this question























  • I believe $sum ln(1+a_n) $ converging implies $sum a_n$ converges, even for complex numbers, but I'm still looking for the proof (@twakhare it was, people keep giving diverging to 0 products).
    – user24142
    Aug 11 '15 at 0:49













up vote
5
down vote

favorite
2









up vote
5
down vote

favorite
2






2





I have a sequence of complex numbers $a_1,a_2,...$ such that $a_i neq -1$. I then have the infinite product $prodlimits_n=1^infty(1+a_n)$ which I know converges to a non zero complex number. I was wondering if this is enough to guarantee the convergence of $sumlimits_n=1^inftyfraca_n1+a_n$.



I couldn't come up with an obvious counterexample and my first idea for proving it was assuming $prodlimits_n=1^infty(1+a_n)=S$, so $sumlimits_n=1^inftyln(1+a_n)=ln S$ converges but have no idea how to deal with this since $1+a_i$ is complex.



If this diverges in general, I was wondering if there are any necessary and sufficient conditions for the sum to converge such as $sumlimits_n|a_n|<infty$ or that the $a_n$ are positive real numbers.



Any help would be awesome,and thanks for taking a look!










share|cite|improve this question















I have a sequence of complex numbers $a_1,a_2,...$ such that $a_i neq -1$. I then have the infinite product $prodlimits_n=1^infty(1+a_n)$ which I know converges to a non zero complex number. I was wondering if this is enough to guarantee the convergence of $sumlimits_n=1^inftyfraca_n1+a_n$.



I couldn't come up with an obvious counterexample and my first idea for proving it was assuming $prodlimits_n=1^infty(1+a_n)=S$, so $sumlimits_n=1^inftyln(1+a_n)=ln S$ converges but have no idea how to deal with this since $1+a_i$ is complex.



If this diverges in general, I was wondering if there are any necessary and sufficient conditions for the sum to converge such as $sumlimits_n|a_n|<infty$ or that the $a_n$ are positive real numbers.



Any help would be awesome,and thanks for taking a look!







sequences-and-series convergence infinite-product






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 30 at 0:10









Robson

47320




47320










asked Aug 11 '15 at 0:26









twakhare

404




404











  • I believe $sum ln(1+a_n) $ converging implies $sum a_n$ converges, even for complex numbers, but I'm still looking for the proof (@twakhare it was, people keep giving diverging to 0 products).
    – user24142
    Aug 11 '15 at 0:49

















  • I believe $sum ln(1+a_n) $ converging implies $sum a_n$ converges, even for complex numbers, but I'm still looking for the proof (@twakhare it was, people keep giving diverging to 0 products).
    – user24142
    Aug 11 '15 at 0:49
















I believe $sum ln(1+a_n) $ converging implies $sum a_n$ converges, even for complex numbers, but I'm still looking for the proof (@twakhare it was, people keep giving diverging to 0 products).
– user24142
Aug 11 '15 at 0:49





I believe $sum ln(1+a_n) $ converging implies $sum a_n$ converges, even for complex numbers, but I'm still looking for the proof (@twakhare it was, people keep giving diverging to 0 products).
– user24142
Aug 11 '15 at 0:49











2 Answers
2






active

oldest

votes

















up vote
7
down vote



accepted










The infinite product $prod_n (1+a_n)$ converges (to a nonzero value) if and only if $sum_n log(1+a_n)$ converges (for a branch of $log$ that is analytic in a neighbourhood of $1$, with $log(1) = 0$). This does not in general imply $sum_n dfraca_n1+a_n$ converges. For example, take a positive sequence $b_k to 0 + $ and let $c_k = 1/(1+b_k) - 1$. Thus
$log(1+c_k) = -log(1+b_k)$. On the other hand,
$$ dfracc_k1+c_k + dfracb_k1+b_k = dfrac-b_k^21+ b_k ne 0$$
Consider a sequence $a_n$ that, for each $k$, repeats $b_k, c_k$ enough times for the partial sum of $a_n/(1+a_n)$ to change by $1$, before progressing to the next $k$. Then $sum log(1+a_n)$ converges to $0$ but
$sum a_n/(1+a_n)$ diverges.






share|cite|improve this answer
















  • 1




    Very nice. A simple sequence constructed using this idea is $a_n =colorredfrac12,-frac13,frac12,-frac13$, $colorbluefrac13,-frac14,frac13,-frac14,frac13,-frac14$, $colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,ldots$. Then $prod(1+a_n) = colorred1cdot colorblue1cdot colorgreen1cdots$ while $sumfraca_n1+a_n = -left(colorredfrac13 + colorbluefrac14 + colorgreenfrac15 + ldotsright)$.
    – Winther
    Aug 11 '15 at 1:36


















up vote
2
down vote













It's OK for absolute convergence. But not in general.



Take $log(1+a_n) = (-1)^n/sqrtn$ for $n ge 1$, so
$sum log(1+a_n) = sum (-1)^n/sqrtn$ converges (conditionally). But
$$
fraca_n1+a_n = frac(-1)^nsqrtn - frac12n +Oleft(frac1n^3/2right)
$$
and thus $sum a_n/(1+a_n)$ diverges.






share|cite|improve this answer






















    Your Answer




    StackExchange.ifUsing("editor", function ()
    return StackExchange.using("mathjaxEditing", function ()
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    );
    );
    , "mathjax-editing");

    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "69"
    ;
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function()
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled)
    StackExchange.using("snippets", function()
    createEditor();
    );

    else
    createEditor();

    );

    function createEditor()
    StackExchange.prepareEditor(
    heartbeatType: 'answer',
    convertImagesToLinks: true,
    noModals: false,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );













     

    draft saved


    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1392584%2fif-prod-limits-n1a-n-converges-does-sum-limits-n-fraca-n1a-n%23new-answer', 'question_page');

    );

    Post as a guest






























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    7
    down vote



    accepted










    The infinite product $prod_n (1+a_n)$ converges (to a nonzero value) if and only if $sum_n log(1+a_n)$ converges (for a branch of $log$ that is analytic in a neighbourhood of $1$, with $log(1) = 0$). This does not in general imply $sum_n dfraca_n1+a_n$ converges. For example, take a positive sequence $b_k to 0 + $ and let $c_k = 1/(1+b_k) - 1$. Thus
    $log(1+c_k) = -log(1+b_k)$. On the other hand,
    $$ dfracc_k1+c_k + dfracb_k1+b_k = dfrac-b_k^21+ b_k ne 0$$
    Consider a sequence $a_n$ that, for each $k$, repeats $b_k, c_k$ enough times for the partial sum of $a_n/(1+a_n)$ to change by $1$, before progressing to the next $k$. Then $sum log(1+a_n)$ converges to $0$ but
    $sum a_n/(1+a_n)$ diverges.






    share|cite|improve this answer
















    • 1




      Very nice. A simple sequence constructed using this idea is $a_n =colorredfrac12,-frac13,frac12,-frac13$, $colorbluefrac13,-frac14,frac13,-frac14,frac13,-frac14$, $colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,ldots$. Then $prod(1+a_n) = colorred1cdot colorblue1cdot colorgreen1cdots$ while $sumfraca_n1+a_n = -left(colorredfrac13 + colorbluefrac14 + colorgreenfrac15 + ldotsright)$.
      – Winther
      Aug 11 '15 at 1:36















    up vote
    7
    down vote



    accepted










    The infinite product $prod_n (1+a_n)$ converges (to a nonzero value) if and only if $sum_n log(1+a_n)$ converges (for a branch of $log$ that is analytic in a neighbourhood of $1$, with $log(1) = 0$). This does not in general imply $sum_n dfraca_n1+a_n$ converges. For example, take a positive sequence $b_k to 0 + $ and let $c_k = 1/(1+b_k) - 1$. Thus
    $log(1+c_k) = -log(1+b_k)$. On the other hand,
    $$ dfracc_k1+c_k + dfracb_k1+b_k = dfrac-b_k^21+ b_k ne 0$$
    Consider a sequence $a_n$ that, for each $k$, repeats $b_k, c_k$ enough times for the partial sum of $a_n/(1+a_n)$ to change by $1$, before progressing to the next $k$. Then $sum log(1+a_n)$ converges to $0$ but
    $sum a_n/(1+a_n)$ diverges.






    share|cite|improve this answer
















    • 1




      Very nice. A simple sequence constructed using this idea is $a_n =colorredfrac12,-frac13,frac12,-frac13$, $colorbluefrac13,-frac14,frac13,-frac14,frac13,-frac14$, $colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,ldots$. Then $prod(1+a_n) = colorred1cdot colorblue1cdot colorgreen1cdots$ while $sumfraca_n1+a_n = -left(colorredfrac13 + colorbluefrac14 + colorgreenfrac15 + ldotsright)$.
      – Winther
      Aug 11 '15 at 1:36













    up vote
    7
    down vote



    accepted







    up vote
    7
    down vote



    accepted






    The infinite product $prod_n (1+a_n)$ converges (to a nonzero value) if and only if $sum_n log(1+a_n)$ converges (for a branch of $log$ that is analytic in a neighbourhood of $1$, with $log(1) = 0$). This does not in general imply $sum_n dfraca_n1+a_n$ converges. For example, take a positive sequence $b_k to 0 + $ and let $c_k = 1/(1+b_k) - 1$. Thus
    $log(1+c_k) = -log(1+b_k)$. On the other hand,
    $$ dfracc_k1+c_k + dfracb_k1+b_k = dfrac-b_k^21+ b_k ne 0$$
    Consider a sequence $a_n$ that, for each $k$, repeats $b_k, c_k$ enough times for the partial sum of $a_n/(1+a_n)$ to change by $1$, before progressing to the next $k$. Then $sum log(1+a_n)$ converges to $0$ but
    $sum a_n/(1+a_n)$ diverges.






    share|cite|improve this answer












    The infinite product $prod_n (1+a_n)$ converges (to a nonzero value) if and only if $sum_n log(1+a_n)$ converges (for a branch of $log$ that is analytic in a neighbourhood of $1$, with $log(1) = 0$). This does not in general imply $sum_n dfraca_n1+a_n$ converges. For example, take a positive sequence $b_k to 0 + $ and let $c_k = 1/(1+b_k) - 1$. Thus
    $log(1+c_k) = -log(1+b_k)$. On the other hand,
    $$ dfracc_k1+c_k + dfracb_k1+b_k = dfrac-b_k^21+ b_k ne 0$$
    Consider a sequence $a_n$ that, for each $k$, repeats $b_k, c_k$ enough times for the partial sum of $a_n/(1+a_n)$ to change by $1$, before progressing to the next $k$. Then $sum log(1+a_n)$ converges to $0$ but
    $sum a_n/(1+a_n)$ diverges.







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Aug 11 '15 at 0:54









    Robert Israel

    307k22201443




    307k22201443







    • 1




      Very nice. A simple sequence constructed using this idea is $a_n =colorredfrac12,-frac13,frac12,-frac13$, $colorbluefrac13,-frac14,frac13,-frac14,frac13,-frac14$, $colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,ldots$. Then $prod(1+a_n) = colorred1cdot colorblue1cdot colorgreen1cdots$ while $sumfraca_n1+a_n = -left(colorredfrac13 + colorbluefrac14 + colorgreenfrac15 + ldotsright)$.
      – Winther
      Aug 11 '15 at 1:36













    • 1




      Very nice. A simple sequence constructed using this idea is $a_n =colorredfrac12,-frac13,frac12,-frac13$, $colorbluefrac13,-frac14,frac13,-frac14,frac13,-frac14$, $colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,ldots$. Then $prod(1+a_n) = colorred1cdot colorblue1cdot colorgreen1cdots$ while $sumfraca_n1+a_n = -left(colorredfrac13 + colorbluefrac14 + colorgreenfrac15 + ldotsright)$.
      – Winther
      Aug 11 '15 at 1:36








    1




    1




    Very nice. A simple sequence constructed using this idea is $a_n =colorredfrac12,-frac13,frac12,-frac13$, $colorbluefrac13,-frac14,frac13,-frac14,frac13,-frac14$, $colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,ldots$. Then $prod(1+a_n) = colorred1cdot colorblue1cdot colorgreen1cdots$ while $sumfraca_n1+a_n = -left(colorredfrac13 + colorbluefrac14 + colorgreenfrac15 + ldotsright)$.
    – Winther
    Aug 11 '15 at 1:36





    Very nice. A simple sequence constructed using this idea is $a_n =colorredfrac12,-frac13,frac12,-frac13$, $colorbluefrac13,-frac14,frac13,-frac14,frac13,-frac14$, $colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,colorgreenfrac14,-frac15,ldots$. Then $prod(1+a_n) = colorred1cdot colorblue1cdot colorgreen1cdots$ while $sumfraca_n1+a_n = -left(colorredfrac13 + colorbluefrac14 + colorgreenfrac15 + ldotsright)$.
    – Winther
    Aug 11 '15 at 1:36











    up vote
    2
    down vote













    It's OK for absolute convergence. But not in general.



    Take $log(1+a_n) = (-1)^n/sqrtn$ for $n ge 1$, so
    $sum log(1+a_n) = sum (-1)^n/sqrtn$ converges (conditionally). But
    $$
    fraca_n1+a_n = frac(-1)^nsqrtn - frac12n +Oleft(frac1n^3/2right)
    $$
    and thus $sum a_n/(1+a_n)$ diverges.






    share|cite|improve this answer


























      up vote
      2
      down vote













      It's OK for absolute convergence. But not in general.



      Take $log(1+a_n) = (-1)^n/sqrtn$ for $n ge 1$, so
      $sum log(1+a_n) = sum (-1)^n/sqrtn$ converges (conditionally). But
      $$
      fraca_n1+a_n = frac(-1)^nsqrtn - frac12n +Oleft(frac1n^3/2right)
      $$
      and thus $sum a_n/(1+a_n)$ diverges.






      share|cite|improve this answer
























        up vote
        2
        down vote










        up vote
        2
        down vote









        It's OK for absolute convergence. But not in general.



        Take $log(1+a_n) = (-1)^n/sqrtn$ for $n ge 1$, so
        $sum log(1+a_n) = sum (-1)^n/sqrtn$ converges (conditionally). But
        $$
        fraca_n1+a_n = frac(-1)^nsqrtn - frac12n +Oleft(frac1n^3/2right)
        $$
        and thus $sum a_n/(1+a_n)$ diverges.






        share|cite|improve this answer














        It's OK for absolute convergence. But not in general.



        Take $log(1+a_n) = (-1)^n/sqrtn$ for $n ge 1$, so
        $sum log(1+a_n) = sum (-1)^n/sqrtn$ converges (conditionally). But
        $$
        fraca_n1+a_n = frac(-1)^nsqrtn - frac12n +Oleft(frac1n^3/2right)
        $$
        and thus $sum a_n/(1+a_n)$ diverges.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Aug 11 '15 at 1:16

























        answered Aug 11 '15 at 1:10









        GEdgar

        58.9k265165




        58.9k265165



























             

            draft saved


            draft discarded















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1392584%2fif-prod-limits-n1a-n-converges-does-sum-limits-n-fraca-n1a-n%23new-answer', 'question_page');

            );

            Post as a guest













































































            這個網誌中的熱門文章

            tkz-euclide: tkzDrawCircle[R] not working

            How to combine Bézier curves to a surface?

            1st Magritte Awards