Given a sequence {(−1)nn} show directly from the definition that it converges to 0.
Definition of convergence of a sequence is:
A sequence {pn} converges if for every ϵ>0 there exists an N∈N so that n≥N⟹d(pn,p)<ϵ
My approach
What we want to show is:
For every ϵ>0 there exists an N∈N so that
n≥N⟹d((−1)nn,0)<ϵ
After this step the solution I have stops making sense
Take N so large that N>2ϵ. (No idea why 2 is chosen?
And why this works) Then n≥N⟹|(−1)nn|<2n<2N<ϵ (No idea why this is true or logically progresses)
Edit:
It could be 2/n because |(−1)nn|=|1n| we need at least 2 so that |1n|<2/n
Answer
The inequalities in the last step are simple to explain. First of all, you have the inequality |(−1)nn|<2n.
This is quite a simple inequality, since you should know that |(−1)nn|=1n and since 1n>0, it is clear that 2n>1n.
The second inequality is also simple, that is, 2n≤2N. (yes, there should be a ≤ sign. This follows from the fact that n≥N, meaning that 1n≤1N (since in 1n, you are dividing 1 by a larger number).
The third inequality, 2N<ϵ, comes directly from N>2ϵ (just multiply the inequality by ϵ and divide by N.
No comments:
Post a Comment