Lim sup(an+bn) less than or equal to

  • Thread starter Thread starter spenghali
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around proving the inequality involving the limit superior of the sums of two sequences, specifically that if the limit superiors of two sequences \( (a_n) \) and \( (b_n) \) are finite, then the limit superior of their sum is less than or equal to the sum of their limit superiors.

Discussion Character

  • Exploratory, Assumption checking

Approaches and Questions Raised

  • The original poster attempts a proof based on the boundedness of the sequences and the properties of limit superiors. Some participants question the necessity of the boundedness assumption and suggest that it may not be required for the proof.

Discussion Status

Participants are engaging with the proof provided, with some expressing agreement on its validity while others raise concerns about the assumptions made. There is an ongoing exploration of the implications of boundedness in the context of the proof.

Contextual Notes

There is a mention of a specific counterexample involving an unbounded sequence, which highlights the potential limitations of the original proof's assumptions.

spenghali
Messages
11
Reaction score
0

Homework Statement


If limsup(an) and limsup(bn) are finite, prove that limsup(an+bn) \leq limsup(an) + limsup(bn).


Homework Equations





The Attempt at a Solution


My proof seems a bit short, so if someone could please reassure me this is a valid proof, thanks in advance.

Proof: Assuming an and bn are bounded sequence. Let a > limsup(an) and b > limsup(bn). Then a+b > an+bn for all but finitely many n's. This implies that a+b \geq limsup(an+bn). Since this hold for any a \geq limsup(an) and any b > limsup(bn), this implies limsup(an+bn) \leq limsup(an) + limsup(bn). QED
 
Physics news on Phys.org
looks reasonable to me (though i am rusty at this)

so just to sum up

an > limsup(an), bn > limsup(bn) for only finitley many n

an + bn > limsup(an + bn) for only finitley many n

which implies
limsup(an + bn) <= limsup(an) + limsup(bn)
 
Last edited:
thanks for the input, unfortunately my professor refused to tell me if i was right.
 
spenghali said:

If limsup(an) and limsup(bn) are finite, prove that limsup(an+bn) \leq limsup(an) + limsup(bn).

...

Proof: Assuming an and bn are bounded sequence. Let a > limsup(an) and b > limsup(bn). Then a+b > an+bn for all but finitely many n's. This implies that a+b \geq limsup(an+bn). Since this hold for any a \geq limsup(an) and any b > limsup(bn), this implies limsup(an+bn) \leq limsup(an) + limsup(bn). QED


Your first sentence is too strong an assumption. E.g., let x_n = -n, if n even, 1 otherwise. Then lim sup x_n = 1, but the sequence {x_n} is not bounded.

Edit: oops, I just looked at your proof, you didn't even use the boundedness...
 
Last edited:

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
4
Views
6K
Replies
2
Views
2K
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
Replies
3
Views
3K
Replies
3
Views
10K
  • · Replies 24 ·
Replies
24
Views
7K
  • · Replies 27 ·
Replies
27
Views
3K