Prove that a converging sequence is bounded

Click For Summary

Homework Help Overview

The discussion revolves around proving that a converging sequence is bounded, specifically focusing on the sequence {an} and its properties as it converges to a limit.

Discussion Character

  • Conceptual clarification, Assumption checking, Exploratory

Approaches and Questions Raised

  • Participants discuss the implications of convergence for the sequence and explore how to demonstrate that the sequence remains bounded for indices less than N. There is a mention of finite sets being bounded and the potential use of maximum values for these sets.

Discussion Status

The conversation includes attempts to clarify the boundedness of both the converging part of the sequence and the finite initial segment. Some participants affirm that finite sets are indeed bounded and suggest methods to prove this, while others are exploring the implications of convergence further.

Contextual Notes

There is an underlying assumption that the sequence converges, and participants are considering the implications of this convergence on the boundedness of the entire sequence, including its finite initial segment.

kehler
Messages
103
Reaction score
0

Homework Statement


Suppose that the sequence {an}converges. Show that the sequence {an} is bounded.

The Attempt at a Solution


Since the sequence converges, for every delta>0, there must exist a number N such that for every n>=N,
|an - x|< delta. Therefore, for n>=N, -delta+x < an < delta + x.
So I've proven that for n>=N, the sequence is bounded between -delta+x and delta+x.

But I don't know how to prove that for n<N, an is also bounded. I know that there are only a finite number of elements before the sequence starts to converge. Is there a theorem stating that all finite sets are bounded?
 
Physics news on Phys.org
kehler said:
But I don't know how to prove that for n<N, an is also bounded. I know that there are only a finite number of elements before the sequence starts to converge. Is there a theorem stating that all finite sets are bounded?

I would consider looking at the maximum of a finite set.
 
To expand a little:
Pick an [tex]\varepsilon > 0[/tex], and use convergence to conclude that

[tex] |x_i - a | < \varepsilon[/tex]

for all [tex]i \ge N[/tex].

You now have two sets of elements of the sequence: those with [tex]i \ge N[/tex] and those for smaller [tex]i[/tex]. You should be able to argue that both sets are bounded, which means ...
 
Last edited by a moderator:
Yes. All finite sets are bounded. Prove it by induction. (If you really need a proof).
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
4
Views
2K
Replies
6
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K