Limit (sequence)
- Note: see Limit page for other kinds of limits
Contents
[hide]Definition
Given a sequence (xn)∞n=1⊆X, a metric space (X,d) (that is complete) and a point x∈X, the sequence (xn) is said to[1][Note 1]:
- have limit x or converge to x
When:
- ∀ϵ>0∃N∈N∀n∈N[n>N⟹d(x,xn)<ϵ][Note 2]
- (note that ϵ∈R, obviously - as the co-domain of d is R)
- Read this as:
- for all ϵ greater than zero, there exists an N in the natural numbers such that for all n that are also natural we have that:
- whenever n is beyond N that xn is within ϵ of x
- for all ϵ greater than zero, there exists an N in the natural numbers such that for all n that are also natural we have that:
Equivalent definitions
- Note: where it is not obvious changes have a { underneath them
Discussion
Requiring x∈X
If x∉X then d(xn,x) is undefined, as d:X×X→R≥0, that is the distance metric is only defined for things in X
Process
The idea is that defining "tends towards x" is rather difficult, to sidestep this we just say "we can get as close as we like to" instead. This is the purpose of ϵ.
We say that "if you give me an ϵ>0 - as small as you like - I can find you a point of the sequence (N) where all points after are within ϵ of x (where d(⋅,⋅) is our notion of distance)
- That is after N in the sequence, so that's xn+1,xn+1,… the distance between xN+i and x is <ϵ
- This is exactly what n>N⟹d(xn,x)<ϵ says, it says that:
- whenever n>N we must have d(xn,x)<ϵ
- This is exactly what n>N⟹d(xn,x)<ϵ says, it says that:
As per the nature of implies we may have d(xn,x)<ϵ without n>N, it is only important that WHENEVER we are beyond N in the sequence that d(xn,x)<ϵ
Notice that at x=1 that , in fact the curve is within ±ϵ several times before we reach the vertical line, this is the significance of the implies sign, when we write A⟹B we require that whenever A is true, B must be true, but B may be true regardless of what A is.
Note that after the vertical line the function is always within the bounds.
Because of this any N′>N may be used too, as if n>N′ and N′>N then n>N′>N so n>N - this proves that if N works then any larger N′ will too. There is no requirement to find the smallest N that'll work, just an N such that n>N⟹d(xn,x)<ϵ
See also
Notes
- Jump up ↑ Actually Maurin gives:
- ∀ϵ>0∃N∈N∀n[n≥N⟹d(xn,x)<ϵ](the change is the ≥ sign between the n and N) but as we shall see this doesn't matter
- ∀ϵ>0∃N∈N∀n[n≥N⟹d(xn,x)<ϵ]
- Jump up ↑ In Krzysztof Maurin's notation this can be written as:
- ⋀ϵ>0⋁N∈N⋀n>Nd(xn,x)<ϵ
- ⋀ϵ>0⋁N∈N⋀n>Nd(xn,x)<ϵ
References
- Jump up ↑ Krzysztof Maurin - Analysis - Part 1: Elements