Prove Xn->x is Integer if Xn is Sequence of Real Numbers

  • Thread starter Thread starter sleventh
  • Start date Start date
  • Tags Tags
    Integers Sequence
Click For Summary
If Xn is a sequence of integers converging to a limit x in the reals, then x must also be an integer. A convergent sequence is bounded and Cauchy, meaning that for any ε > 0, there exists an N such that for n, m > N, |Xn - Xm| < ε. Since Xn consists of integers, the difference between any two terms is also an integer, which implies that x cannot lie between two integers without violating the convergence condition. Thus, if x were not an integer, the distance |Xn - x| could not be made arbitrarily small, leading to a contradiction. Therefore, x must be an integer, confirming that the limit of a convergent sequence of integers is itself an integer.
sleventh
Messages
61
Reaction score
0
if Xn is a sequence of integers and Xn--->x as n----> infinity and x is an element of the reals. show that x must be an integer.

i know that since the sequence is convergent it will be bounded. i don't however see how i can prove the above. thank you very much for any help.
 
Physics news on Phys.org
A convergent sequence also has to be Cauchy. See what you can get out of that
 
im not exactly sure what you mean by ''bounded away'', is this the same as will not converge? it seems to me that even if x were a real value that |Xn-x|<e given that e>0. is this wrong?
 
If x_n\to x, then, given any \epsilon, there exist N such that if n> N, |x- x_n|&lt; \epsilon. Take \epsilon to be less than 1 and remember that x_n is an integer.
 
using what you said in that a convergent sequence has a cauchy sequence, and from hallsofly, could the argument go as follows:
the sequence Xn converges and therefore is a cauchy sequence, by definition for any value n,m>N where N is a natural number |Xn-Xm|<e, given e>0 must be true. each element of Xn,m however is an integer and by the commutative ring of integers Xn-Xm will also produce an integer. if x were a real number it would then be between to integer values. The nearest value Xn can assume are these two integers, therefore taking e<1 |Xn-Xm|<e will not hold
 
No, that's not true and not my point. The difference of two integers can be 0!
 
it seems like i need to show that x must be an integer in order for the |Xn-x| to equal zero, but i do not see why |Xn-x|<e would not hold if Xn was an integer and x Real. is it because there is a set distance between a integer and a real value, and if epsilon was set to be this value, |Xn-x|could not be less then epsilon?
 
sleventh said:
it seems like i need to show that x must be an integer in order for the |Xn-x| to equal zero, but i do not see why |Xn-x|<e would not hold if Xn was an integer and x Real. is it because there is a set distance between a integer and a real value, and if epsilon was set to be this value, |Xn-x|could not be less then epsilon?
Integers are real numbers! The converse is not necessarily true, though.

If you have a sequence of integers, it either doesn't converge or converges to an integer. Examples of each kind:
{1, 2, 3, 4, ..., n, ...}
{4, 3, 2, 1, 0, 0, 0, ..., 0, ...}
 
assuming x is a value between two successive integers, there will be a finite distance E between x and the nearest integer. if e<E then |Xn-x|<e will not hold. therefore by contradiction x must be an integer. This also shows that |Xn-x|=0, and therefore Xn will eventually be a constant value.
How does that sound?
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 34 ·
2
Replies
34
Views
3K
Replies
4
Views
2K
Replies
2
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 3 ·
Replies
3
Views
828
  • · Replies 3 ·
Replies
3
Views
2K