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

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

The discussion centers on proving that if the limit superior (limsup) of two sequences, an and bn, are finite, then limsup(an + bn) is less than or equal to the sum of their respective limsup values. The proof presented assumes that both sequences are bounded and demonstrates that for any values a and b greater than their respective limsup values, the inequality holds. The conclusion is that limsup(an + bn) ≤ limsup(an) + limsup(bn) is valid under the given conditions.

PREREQUISITES
  • Understanding of limit superior (limsup) in real analysis
  • Knowledge of bounded sequences in mathematical analysis
  • Familiarity with the properties of inequalities
  • Basic proof techniques in mathematical reasoning
NEXT STEPS
  • Study the properties of limit superior in more depth
  • Explore bounded sequences and their implications in analysis
  • Learn about counterexamples in mathematical proofs
  • Investigate the relationship between limsup and convergence of sequences
USEFUL FOR

Students of real analysis, mathematicians working with sequences, and anyone interested in understanding the properties of limit superior in mathematical proofs.

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
2K
  • · 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
2K
Replies
3
Views
10K
  • · Replies 24 ·
Replies
24
Views
6K
  • · Replies 27 ·
Replies
27
Views
3K