Sequences
A sequence is a function who’s domain is where m is usually 0 or 1. Attaches each integer to that iteration of the sequence. Instead of we usually write .
We denote a sequence as for . If the starting point is 1, we denote it as . This makes sense as it is just the natural numbers 1 to inf.
Look at this example
We can essentially think of this sequence as .
Now it is important to denote differences between a sequence and its set of values. A sequence is its ordered output (such as a list and denoted as such too), while a set of values acts like a set (no order, no duplicate values, etc). Often, is ordered by in the order of .
Take a look at the example to view the difference:

Limit
The limit of a sequence is a real number that the values of are close to for all large .
Definition of convergence
A sequence is set to converge to the real number provided that: For any there exists a number such that If we have it so converges to , then we can sat or . is the limit of . If some sequence does not converge it diverges.
Some books assume is a natural number. I like this. The last remark shows that you can always make into a natural number.
Another way tho think about it is, limit is the value that is close to or approaching for some very large . Greater than is a formal way to say this, and is a way to measure how close.
i.e. There exists such where if then the distance between and its convergence point is less than . This has to hold for any giving us one convergence point and showing that as epsilon gets smaller this must still exist, however epsilon is never 0 so is never the exact same as .
Before the sequence can be really far away from its convergence, but after we need some control and the sequence should be less than away.
will have to be large for some small . This makes sense, as the further you are in the sequence the closer you get to the convergence point, reducing the distance or ,
This means, usually, that if you pick a smaller you need a larger because then the distance between and its limit is reduced with a larger .
You can also pick multiple for one epsilon. For example, take the sequence . Then, suppose I pick to be or . Then, we know that works for this case, but also work for this case. can always be replaced by a larger number, so if works also works. This is because .
We usually only care about and use a very small positive . We want the sequence to be extremely close to the limit.
Infinite number of statements satisfy this condition, one for every , so it can be satisfied for .
Usually you can find a common for two sequences.
Limits are unique:
if and then we have it so .
todo understand this proof more. Also in hw 2 and end of video 3.
Last property from video 3
If and you change finitely many ( is just with some finitely many terms change), we still have it so
This is because we can always find an after the last changed such that . Then the limit definition is applied.
Essentially, if you change finitely many elements in a sequence, the limit does not change.