Difference between revisions of "Sequences and Their Limits"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
Line 50: Line 50:
  
 
*'''Law 1 (Addition Law of Convergent Sequences):''' If the limits of the sequences <math>\{ a_n \}</math> and <math>\{ b_n \}</math> are convergent, that is <math>\lim_{n \to \infty} a_n = A</math> and <math>\lim_{n \to \infty} b_n = B</math> then <math>\lim_{n \to \infty} (a_n + b_n) = \lim_{n \to \infty} a_n + \lim_{n \to \infty} b_n = A + B</math>.  
 
*'''Law 1 (Addition Law of Convergent Sequences):''' If the limits of the sequences <math>\{ a_n \}</math> and <math>\{ b_n \}</math> are convergent, that is <math>\lim_{n \to \infty} a_n = A</math> and <math>\lim_{n \to \infty} b_n = B</math> then <math>\lim_{n \to \infty} (a_n + b_n) = \lim_{n \to \infty} a_n + \lim_{n \to \infty} b_n = A + B</math>.  
 +
 +
 +
:*'''Proof of Law 1:''' Let <math>\{ a_n \}</math> and <math>\{ b_n \}</math> be convergent sequences. By the definition of a sequence being convergent, we know that <math>\lim_{n \to \infty} a_n = A</math> and <math>\lim_{n \to \infty} b_n = B</math> for some <math>A, B \in \mathbb{R}</math>.
 +
 +
 +
:*Now let <math>\epsilon > 0</math> be given, and recall that <math>\lim_{n \to \infty} a_n = A</math> implies that <math>\forall \epsilon  \exists N_1 \in \mathbb{N}</math> such that if <math>n \geq N_1</math> then <math>\mid a_n - A \mid < \frac{\epsilon}{2}</math>. Similarly, <math>\lim_{n \to \infty} b_n = B</math> implies that <math>\forall \epsilon  \exists N_2 \in \mathbb{N}</math> such that if <math>n \geq N_2</math> then <math>\mid b_n - B \mid < \frac{\epsilon}{2}</math>.
 +
 +
 +
:*We will choose <math>N = \mathrm{max} \{ N_1, N_2 \}</math>. By choosing the larger of <math>N_1</math> and <math>N_2</math>, we ensure that the if <math>n \geq \mathrm{max} \{ N_1, N_2 \}</math>, then <math>\mid a_n - A \mid < \frac{\epsilon}{2}</math> and <math>\mid b_n - B \mid < \frac{\epsilon}{2}</math>. We now want to show that if <math>n \geq N</math>, then <math>\mid (a_n + b_n) - (A + B) \mid < \epsilon</math>. By the triangle inequality we obtain that:
 +
 +
 +
<div style="text-align: center;"><math>\begin{align} \quad \quad \mid (a_n + b_n) - (A + B) \mid = \mid (a_n - A) + (b_n - B) \mid \leq \mid a_n + A \mid + \mid b_n + B \mid < \frac{\epsilon}{2} + \frac{\epsilon}{2} = \epsilon \end{align}</math></div>
 +
 +
 +
:*Therefore <math>\lim_{n \to \infty} (a_n + b_n) = A + B</math>. <math>\blacksquare</math>
 +
  
  
Line 74: Line 90:
  
 
Let <math>f(n) = \frac{n^2 - 1}{n + 1}</math> be a function analogous to our sequence. When we factor the numerator and cancel like-terms, we get that <math>\lim_{n \to \infty} f(n) = \lim_{n \to \infty} \frac{n^2 - 1}{n + 1} = \lim_{n \to \infty} \frac{(n +1)(n - 1)}{n + 1} = \lim_{n \to \infty} n - 1 = \infty</math>. Therefore the sequence <math>\left \{ \frac{x^2 - 1}{x + 1} \right \}_{n=1}^{\infty}</math> is divergent.
 
Let <math>f(n) = \frac{n^2 - 1}{n + 1}</math> be a function analogous to our sequence. When we factor the numerator and cancel like-terms, we get that <math>\lim_{n \to \infty} f(n) = \lim_{n \to \infty} \frac{n^2 - 1}{n + 1} = \lim_{n \to \infty} \frac{(n +1)(n - 1)}{n + 1} = \lim_{n \to \infty} n - 1 = \infty</math>. Therefore the sequence <math>\left \{ \frac{x^2 - 1}{x + 1} \right \}_{n=1}^{\infty}</math> is divergent.
 +
 +
== Licensing ==
 +
Content obtained and/or adapted from:
 +
* [http://mathonline.wikidot.com/limit-of-a-sequence Limit of a Sequence, mathonline.wikidot.com] under a CC BY-SA license

Revision as of 16:30, 21 November 2021

Consider the sequence . As , it appears as though . In fact, we know that this is true since . We will now formalize the definition of a limit with regards to sequences.

Definition: If is a sequence, then means that for every there exists a corresponding such that if , then . If this limit exists, then we say that the sequence Converges, and if this limit doesn't exist then we say say the sequence Diverges.

We note that our definition of the limit of a sequence is very similar to the limit of a function, in fact, we can think of a sequence as a function whose domain is the set of natural numbers . From this notion, we obtain the very important theorem:

Theorem 1: If is a sequence and a function , then if where and , then .
  • Proof of Theorem 1: Let be given. We know that which implies that such that if then .


  • Now we want to show that such that if then . We will choose . This ensures that is an integer.


  • Now since then it follows that if then . But and so so .
Important Note: The converse of this theorem is not implied to be true! That is if and , then this does NOT imply that . For example, consider the sequence . Clearly this sequence converges at 0. However, the function does not converge, instead, it diverges as it oscillates between and .

For example, consider the sequence . If we let be a function whose domain is the natural numbers, then we calculate the limit of this function like we have in the past, namely:


Therefore the limit of our sequence is 1, that is, converges to 1 as .

Now let's look at another major theorem.

Theorem 2: If and a function is continuous at , then .
  • Proof of Theorem 2: If is a continuous function at , then we know that is defined and that . By the definition of a limit, such that if then . Let so then if then .


  • We want to show that , that is such that if then , which is what we showed above.


We will now look at some important limit laws regarding sequences

Limit Laws of Convergent Sequences

We will now look at some very important limit laws regarding convergent sequences, all of which are analogous to the limit laws for functions that we already know of.


  • Law 1 (Addition Law of Convergent Sequences): If the limits of the sequences and are convergent, that is and then .


  • Proof of Law 1: Let and be convergent sequences. By the definition of a sequence being convergent, we know that and for some .


  • Now let be given, and recall that implies that such that if then . Similarly, implies that such that if then .


  • We will choose . By choosing the larger of and , we ensure that the if , then and . We now want to show that if , then . By the triangle inequality we obtain that:



  • Therefore .


  • Law 2 (Difference Law of Convergent Sequences): If the limits of the sequences and are convergent, that is and then .


  • Law 3 (Product Law of Convergent Sequences): If the limits of the sequences and are convergent, that is and , then .


  • Law 4 (Quotient Law of Convergent Sequences): If the limits of the sequences and are convergent, that is and , then provided that .


  • Law 5 (Constant Multiple Law of Convergent Sequences): If the limit of the sequence is convergent, that is , and is a constant, then .


  • Law 6 (Power Law of Convergent Sequences): If the limit of the sequence is convergent, that is and is a non-negative integer, then provided that .


  • Law 7 (Squeeze Theorem for Convergent Sequences): If the limits of the sequences , , and are convergent and is true always after some term, if , then .


Example 1

Determine whether the sequence is convergent or divergent.

Let be a function analogous to our sequence. When we factor the numerator and cancel like-terms, we get that . Therefore the sequence is divergent.

Licensing

Content obtained and/or adapted from: