Analysis period 1.2 Flashcards
Sequence
A sequence is a real-valued function whose domain is a set of the form {n∈Z| n>=m} when m is a fixed integer
Convergence
A sequence {an} coverges to A ∈R <=> ∀ epsilon >0 there exists n* ∈N : |an - A| < epsilon ∀n >= n*. Here A is the limit of the sequence {an}
Proving convergence
- Always start with let epsilon > 0 be given
- Start with |an - A| and get rid of the absolute values as much as you can.
- Next, you can make this term smaller than any other, bigger term. If you can get the latter term smaller than epsilon, then the term you began with is also smaller than epsilon. Note: It could be that your inequality is only valid from a certain point. Take this point into account when finding your n*
- Let n* be the maximum of the values fir which your inequalities hold and the function of epsilon
- Mention that there exist n∈N s.t. |an - A| < epsilon for all n >= n and draw your conclusion.
Can two covergent sequences have the same limits?
Any two limits of a convergent sequence are the same. This means that a convergent sequence has a unique limit
When is a sequence said to be bounded?
A sequence {an} is said to be bounded <=> there exist M>0: |an| <= M for all n∈N.
If a sequence is not bounded, then it is said to be unbounded
Is a convergent sequence bounded?
Yes
Take note that an bounded sequence does not have to be convergent.
Sequences unequal to 0
Consider a sequence {an} that converges to A =/ 0
Then there exists n∈ N: an =/ 0 for all n >= n. In fact, |an| >= |A|/2 for all n >= n*.
Special sequence
If a real number, r, satisfies |r| < 1, then lim r^n = 0
Absolute value of the sequence
The sequence {an} coverges to 0 if and only if the sequence {|an|} converges to 0
Squeeze theorem
Suppose that {an}, {bn} and {cn} are three sequences and suppose that there exists n1 s.t. an <= bn <= cn for all n >= n1. If {an} and {cn} both converge to A, then {bn} must also converge to A.
Product of sequence
If sequence {an} converges to 0 and sequence {bn} is bounded, then {anbn} converges to 0.
Proof product of sequence
Let epsilon > 0 be given. We want to have that |anbn - 0| < epsilon. To do so, we have to find nstar.
|anbn - 0| = |anbn| = |an| x |bn|
|anbn| <= M x |an|
there exists nstar ∈N: |an - 0| = |an| < epsilon / M
there exists nstar ∈N: |anbn - 0| <= M x |an| < M x epsilon/ M = epsilon
So the sequence {anbn} converges to 0
Diverging sequence
A sequence {an} diverges to infinity if and only if for all M>0 there exist nstar ∈ N: an > M for all n >= nstar.
If this is the case, we say that lim (n to inf) an = infinity
If -an > M for all n >= nstar then lim ( n to inf) an = - infinity so we have divergence to - infinity
ut
Comparison theorem
If a sequence {an} diverges to infinity and there exist n1 ∈ N s.t. an <= bn for all n >= n1, then the sequence {bn} must also diverge to infinity
Proving divergence to +- infinity
- Always start with Let M>0 be given
- Start with (-)an
- Next you can find an inequality with this term to some other, smaller term. If you can find a way to get the latter term bigger than M, the term you began with is bigger than M as well. Note: It could be that your inequality is only valid form a certain point. Take this point into account when finding nstar.
- Let nstar be the maximum of values for which your inequalities are valid and the function of M.
- Stay that there exist nstar ∈ N s.t.: (-)an > M for all n>= nsatr and draw your conclusion.