26.1 Sequences
A sequence is a lot of numbers, one after the other. Usually the terms are related in some way to the previous terms. For example, in this sequence11 1 Known as the Fibonacci sequence, each term is the sum of the two previous terms22 2 If we set that the first term is and the second then to get the third term, we add the previous two, so . This process continues for the rest of the terms in the sequence.
We can also write the nth term of a sequence as , and denote the entire sequence as
26.1.1 Convergence of sequences
Sometimes a sequence can converge, which informally means that the value of the th term in the sequence gets closer and closer to a specific value - infinitely close in fact!
Can we say more than \saythis sequence looks like it’s getting closer and closer to this value though? Yes! Another way of saying that something is getting \saycloser to a value, is to say that the distance between the two is decreasing. Using the modulus function 33 3 There is a section on the modulus function in the ”Algebra” chapter of this document, and another section on how we can write distances in terms of the modulus function in the vectors chapter. we can write the distance between any two points and as
What about "really close"? The way to do this is to say that for every value of where is a real number and as we have that
then converges to . As we can pick any (but not ) what we are in effect saying is that the distance is infinitely close to zero, but not equal to zero. That is, it converges to but is not equal to zero.
26.1.2 A sequence can only converge to one value
Before proving this, it’s helpful to formulate precisely what we want to prove.
What 44 4 Note that there exists is the negation of for every. It helps me to imagine a haystack. If you tell me that \saythere exists a needle in this haystack, then the only way I can disprove you is to search through all of (for every) the haystack and show that there is no needle. If I say \sayfor every piece of hay in this haystack, none of them is hiding a needle, then you can disprove me by showing that at least one piece of hay is hiding a needle.we want to show is that for every converging sequence, there exists a unique value to which it converges. The only way this could not be true is if there exists at least one sequence which converges to more than one value.
To prove this by contradiction, let us assume that there is indeed a sequence which converges to both and , where . In this case we have that for all that as ,
(26.4) |
We would like to show that , or that (as this would be a contradiction). We know that
Using the triangle inequality we can write that
(26.6) | ||||
(26.7) | ||||
(26.8) |
Therefore, overall we have that
However, we can pick any value which is greater than for here. If as we are assuming, then for any constant we also have that is greater than . If we set to something less than (e.g. ) then we would have that
This is definitely not true, and hence we have derived a contradiction; thus there can only be one.