brian44
- 23
- 0
Hi, I am trying to prove that
<br /> \{n\}_{n\in \mathbb{N}}<br />
does not converge (based on definition of convergence).
I can prove this by contradiction saying assume it converges, fix \epsilon , then x_n < \epsilon + a (for n \ge N where N is fixed) (by fundamental theorem of ineq.) but by Archimedean Principle, I can find a natural number that surpasses this bound, i.e. \exists m , m x_n > \epsilon + a which is an element of the sequence x_n which means for some M, n \ge M \rightarrow x_n > \epsilon + a which is a contradiction.
However this seems like a long complicated proof for a very simple and obvious fact, I was wondering if there is not some easier, more elegant way to prove this that I am missing?
Thanks for your help.
-Brian
<br /> \{n\}_{n\in \mathbb{N}}<br />
does not converge (based on definition of convergence).
I can prove this by contradiction saying assume it converges, fix \epsilon , then x_n < \epsilon + a (for n \ge N where N is fixed) (by fundamental theorem of ineq.) but by Archimedean Principle, I can find a natural number that surpasses this bound, i.e. \exists m , m x_n > \epsilon + a which is an element of the sequence x_n which means for some M, n \ge M \rightarrow x_n > \epsilon + a which is a contradiction.
However this seems like a long complicated proof for a very simple and obvious fact, I was wondering if there is not some easier, more elegant way to prove this that I am missing?
Thanks for your help.
-Brian