Do Divergent Series Always Imply Logical Equivalences in Convergence Statements?

  • Level: Graduate 
  • Thread starter Thread starter evagelos
  • Start date Start date
  • Tags Tags
    Convergent Series
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
25 replies · 5K views
evagelos
Messages
314
Reaction score
0
Suppose the series [tex]\sum a_{n}[/tex] diverges to [tex]+\infty[/tex],

Then if the series does not diverge to infinity it means that the series converges, and

consequently the statement : if [tex]\sum a_{n}[/tex] diverges ,then [tex]\sum b_{n}[/tex] diverges,is equivalent to :

if [tex]\sum b_{n}[/tex] converges ,then [tex]\sum a_{n}[/tex] converges??
 
Physics news on Phys.org
You need an additional condition on the [itex]b_n[/itex]; if [itex]\sum a_{n}[/itex] diverges and [itex]|b_n| \geq |a_n|[/itex] for all n then [tex]\sum b_{n}[/tex] diverges also. & conversely, if [tex]\sum a_{n}[/tex] converges and [itex]|b_n| \leq |a_n|[/itex] for all n then [tex]\sum b_{n}[/tex] converges. (it's called the comparison test)

ps- to anybody else who knows, how do I put the latex in line?
 
Last edited:
fourier jr said:
You need an additional condition on the [itex]b_n[/itex]; if [itex]\sum a_{n}[/itex] diverges and [itex]|b_n| \geq |a_n|[/itex] for all n then [tex]\sum b_{n}[/tex] diverges also. & conversely, if [tex]\sum a_{n}[/tex] converges and [itex]|b_n| \leq |a_n|[/itex] for all n then [tex]\sum b_{n}[/tex] converges. (it's called the comparison test)

ps- to anybody else who knows, how do I put the latex in line?

So if we say that :if [tex]\sum a_{n}[/tex] diverges, then prove that ,[tex]\sum(1+1/n)a_{n}[/tex] diverges ,

it is not equivalent to :

if [tex]\sum(1+1/n)a_{n}[/tex] converges ,then [tex]\sum a_{n}[/tex] converges
 
So if we say that :if [tex]\sum a_{n}[/tex] diverges, then prove that ,[tex]\sum(1+1/n)a_{n}[/tex] diverges ,

it is not equivalent to :

if [tex]\sum(1+1/n)a_{n}[/tex] converges ,then [tex]\sum a_{n}[/tex] converges

Contrapositive?
 
evagelos said:
So if we say that :if [tex]\sum a_{n}[/tex] diverges, then prove that ,[tex]\sum(1+1/n)a_{n}[/tex] diverges ,

it is not equivalent to :

if [tex]\sum(1+1/n)a_{n}[/tex] converges ,then [tex]\sum a_{n}[/tex] converges

if [tex]b_{n} = (1+1/n)a_{n}[/tex] then they're equivalent. they're converses of each other
 
Assuming the series [tex]\sum a_{n}[/tex] diverges to +[tex]\infty[/tex], then we have to show that the series [tex]\sum(1+1/n)a_{n}[/tex] diverges to +[tex]\infty[/tex].

But according to contrapositive law it is equivalent to show:

if [tex]\sum(1+1/n)a_{n}[/tex] does not diverge to [tex]+\infty[/tex] ,then [tex]\sum a_n}[/tex] does not diverge to [tex]+\infty[/tex]

is that O.K
 
that's right, although people usually just say converge rather than "does not diverge" even though they mean the same thing. & if this is for a homework problem you should probably mention the comparison test somewhere.
 
Last edited:
The statement, "if the series does not diverge to infinity it means that the series converges" is true for positive series. The series [itex]\sum_{n=0}^\infty (-1)^n[/itex] neither diverges to infinity nor converges.
 
fourier jr said:
that's right, although people usually just say converge rather than "does not diverge" even though they mean the same thing. & if this is for a homework problem you should probably mention the comparison test somewhere.

But,

when we say that a series [tex]\sum b_{n}[/tex] does not converge to [tex]+\infty[/tex] it does not mean that the series converges to a limit b,

because

When [tex]\sum b_{n}[/tex] diverges to [tex]+\infty[/tex] ,by definition we have:

for all ε>0 there exists a natural No N such that for all ,[tex]n\geq N\Longrightarrow[/tex] [itex]\sum_{k=1}^{n}b_{k}\geq\epsilon[/itex]

and consequently,

if the series does not diverge to infinity we have:

there exists an ε>0 and for all natural Nos N there exists an ,[tex]n\geq N[/tex] and [itex]\sum_{k=1}^{n}b_{k}<\epsilon[/itex].

Does that mean that [tex]\sum b_{n}[/tex] converges to b ??
 
Last edited:
let me make sure i have my facts straight (& practicing my itex-messaging...)

- a series converges to A if for all [itex]\epsilon > 0[/itex] there is an N with the property that for k>N, [itex]|(\sum_{n=1}^{k}a_{n}) - A| < \epsilon[/itex]

- & if it doesn't converge it diverges, either to infinity or it alternates forever like (-1)^n because there's no N with the above property (thx to halls for reminding me :redface:)

- the comparison test says that if [itex]\sum_{n=1}^{\infty}a_n[/itex] converges, and [itex]|b_n| \leq |a_n|[/itex] for all n, then [itex]\sum_{n=1}^{\infty}b_n[/itex] converges. or conversely, if [itex]\sum_{n=1}^{\infty}a_n[/itex] diverges, and [itex]|b_n| \geq |a_n|[/itex] for all n, then [itex]\sum_{n=1}^{\infty}b_n[/itex] diverges.

- in particular (set [itex]b_n = (1+1/n)a_n[/itex]), if given that [itex]\sum_{n=1}^{\infty}(1+1/n)a_n[/itex] converges, then [itex]\sum_{n=1}^{\infty}a_n[/itex] converges by comparison with [itex]\sum_{n=1}^{\infty}(1+1/n)a_n[/itex], since [itex]|(1+1/n)a_n| \geq |a_n|[/itex] for all n

- or looking at it the other way, if [itex]\sum_{n=1}^{\infty}a_n[/itex] diverges, then [itex]\sum_{n=1}^{\infty}(1+1/n)a_n[/itex] diverges by comparison with [itex]\sum_{n=1}^{\infty}a_n[/itex] since [itex]|(1+1/n)a_n| \geq |a_n|[/itex] for all n
 
fourier jr said:
let me make sure i have my facts straight (& practicing my itex-messaging...)

- a series converges to A if for all [itex]\epsilon > 0[/itex] there is an N with the property that for k>N, [itex]|(\sum_{n=1}^{k}a_{n}) - A| < \epsilon[/itex]

- & if it doesn't converge it diverges, either to infinity or it alternates forever like (-1)^n because there's no N with the above property (thx to halls for reminding me :redface:)

- the comparison test says that if [itex]\sum_{n=1}^{\infty}a_n[/itex] converges, and [itex]|b_n| \leq |a_n|[/itex] for all n, then [itex]\sum_{n=1}^{\infty}b_n[/itex] converges. or conversely, if [itex]\sum_{n=1}^{\infty}a_n[/itex] diverges, and [itex]|b_n| \geq |a_n|[/itex] for all n, then [itex]\sum_{n=1}^{\infty}b_n[/itex] diverges.

- in particular (set [itex]b_n = (1+1/n)a_n[/itex]), if given that [itex]\sum_{n=1}^{\infty}(1+1/n)a_n[/itex] converges, then [itex]\sum_{n=1}^{\infty}a_n[/itex] converges by comparison with [itex]\sum_{n=1}^{\infty}(1+1/n)a_n[/itex], since [itex]|(1+1/n)a_n| \geq |a_n|[/itex] for all n

- or looking at it the other way, if [itex]\sum_{n=1}^{\infty}a_n[/itex] diverges, then [itex]\sum_{n=1}^{\infty}(1+1/n)a_n[/itex] diverges by comparison with [itex]\sum_{n=1}^{\infty}a_n[/itex] since [itex]|(1+1/n)a_n| \geq |a_n|[/itex] for all n



Nowhere is given that [itex]\sum_{n=1}^{\infty}(1+1/n)a_n[/itex] converges.

And i think that the converse of divergence to infinity, is not convergence ,as i tried to show in my post # 10
 
a series converges (to a number A) if for all [itex]\epsilon > 0[/itex] there is an N with the property that for k>N, [itex]|(\sum_{n=1}^{k}a_{n}) - A| < \epsilon[/itex] (not what you wrote in post #10) & it diverges if there is no N. The opposite of diverge is converge, which means there is such an N for all epsilon. It doesn't matter whether it diverges to infinity or oscillates forever. & if, as in the original post, you want to use one series to determine convergence or divergence of another there needs to be a way of comparing them, and the usual way, at least if you want to use the comparison test it's whether or not [itex]|b_n| \leq |a_n|[/itex]
 
fourier jr said:
a series converges (to a number A) if for all [itex]\epsilon > 0[/itex] there is an N with the property that for k>N, [itex]|(\sum_{n=1}^{k}a_{n}) - A| < \epsilon[/itex] (not what you wrote in post #10) & it diverges if there is no N.

Do you agree that the negation of the above definition implies divergence of the series ?
 
that's what I said. It diverges if there's no N.
 
fourier jr said:
that's what I said. It diverges if there's no N.


But the negation of the definition of convergence is the following :

For all ,A there exists ε>0 and for all N there exists k>N and
[itex]|(\sum_{n=1}^{k}a_{n}) - A| \geq\epsilon[/itex].

Do you agree that this denotes the divergence of the series??
 
I think that looks pretty close. I would change the "there exists k>N" to something like "when k>N" or "for all k>N"
 
Would you agree then that the denial to the divergence of a series to [tex]+\infty[/tex] is :

There exists an ε>0 and for all natural Nos N there exists an [tex]n\geq N[/tex] and [itex]\sum_{k=1}^{n}a_{k}) <\epsilon[/itex]

Provided the definition of a series diverging to [tex]+\infty[/tex] is:

for all ε>0 there exists a natural No N and for all ,n :[tex]n\geq N\Longrightarrow[/tex] [itex]\sum_{k=1}^{n}a_{k} \geq\epsilon[/itex] ??
 
the above "definition" of divergence doesn't necessarily mean it goes to infinity, it means that the partial sums doesn't get closer to that number A.
 
How would you define a series that go to [tex]+\infty[/tex]
 
If you remember, the sum of an infinite series is the limit of the sequence of partial sums, in other words, [itex]\sum_{k=0}^{\infty}a_k = \lim_{n \rightarrow \infty}\sum_{k=0}^{n}a_k[/itex]. The series diverges if limit doesn't exist, or is infinite. Sorry for the confusion, I should have mentioned it a long time ago.
 
Last edited:
K.G.BINMORE in his book Mathematical Analysis ,pages 38 ,39 gives a definition for a sequence diverging to [tex]+\infty[/tex],which is the following:

" We say that a sequence [tex]x_{n}[/tex] diverges to [tex]+\infty[/tex] and write [tex]x_{n}\rightarrow +\infty[/tex] as [tex]n\rightarrow +\infty[/tex] if, for any H>0,we can find an N such that,for any n>N, [tex]x_{n}>H[/tex]"

Now if [itex]X_{n}[/itex] denotes the partial sums of a series ,then for a series to diverge to [tex]+\infty[/tex] the above definition is applicable.

That definition i have repeatedly written in my previous posts ,but you have not accepted.
 
i had never heard of that before. the definition i learned was just that it didn't converge, and that the limit didn't exist. if you know what you're talking about why are you asking then?
 
evagelos said:
But,

when we say that a series [tex]\sum b_{n}[/tex] does not converge to [tex]+\infty[/tex] it does not mean that the series converges to a limit b,

because

When [tex]\sum b_{n}[/tex] diverges to [tex]+\infty[/tex] ,by definition we have:

for all ε>0 there exists a natural No N such that for all ,[tex]n\geq N\Longrightarrow[/tex] [itex]\sum_{k=1}^{n}b_{k}\geq\epsilon[/itex]

and consequently,

if the series does not diverge to infinity we have:

there exists an ε>0 and for all natural Nos N there exists an ,[tex]n\geq N[/tex] and [itex]\sum_{k=1}^{n}b_{k}<\epsilon[/itex].

Does that mean that [tex]\sum b_{n}[/tex] converges to b ??

You cannot infer that. Halls already showed a series in post #9 that neither diverges to infinity nor converges to a limit.
 
This whole discussion baffles me. I haven't seen so many undefined variables, lapses of logic, mismatched brackets and meaningless statements in one place for a long time.

What exactly does this mean, for example,

So if we say that "if A then prove that B"

it is not equivalent to "if C then D"

I have a vague feeling that I'm asked to prove something, but I'm not sure what...
 
Last edited:
Why use words you do not understand. What are "lapses of logic"