Proving convergence of rational sequence

In summary, proving the convergence of a rational sequence involves demonstrating that the sequence approaches a specific limit as its terms increase. This typically requires showing that for any given tolerance level, there exists a point in the sequence beyond which all terms remain within that tolerance of the limit. Techniques such as the epsilon-delta definition of limits, bounding terms, and employing properties of convergent sequences can be utilized to establish convergence.
  • #1
member 731016
Homework Statement
Please see below
Relevant Equations
Please see below
For this problem,
1714352561495.png

The solution is,
1714352579289.png

However, does someone please know why this did not use ##2n ≤ 2n^2 + 2n + 1## which would give

##\frac{3n - 1}{2n^2 + 2n + 1} ≤ \frac{3n}{2n} = \frac{3}{2}##?

In general, after solving many problems, it seems that when proving the convergence of a rational function from first principles, we want to find a expression for ##\epsilon## in terms of ##n## i.e ##n(\epsilon)##, which is found by making sure that there is always a ##n## in the denominator so does not cancel when finding the fraction that bounds the sequence we are trying to prove convergence from i.e something of the form ##\frac{a}{n^b}## where ##a## is a constant and ##b ≥ 1## .

However, however, is ##\frac{3}{2}## allowed for proving that this rational function converges to zero? Please correct me if I am wrong, but it means that we know for sure that the rational function in this case is bounded above by ##\frac{3}{2}## but nothing else. To me, this seems anagolus to when you don't divide out polynomial solutions, but you solve for zero. Is that the same sort of case here?

I've never seen anybody talk about not eliminating the ##n## from first principles proofs of convergence in any real analysis textbook I have read.

Thanks for any help!
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
ChiralSuperfields said:
In general, after solving many problems, it seems that when proving the convergence of a rational function from first principles, we want to find a expression for ##\epsilon## in terms of ##n## i.e ##n(\epsilon)##, which is found by making sure that there is always a ##n## in the denominator so does not cancel when finding the fraction that bounds the sequence we are trying to prove convergence from i.e something of the form ##\frac{a}{n^b}## where ##a## is a constant and ##b ≥ 1## .
ChiralSuperfields said:
However, however, is ##\frac{3}{2}## allowed for proving that this rational function converges to zero? Please correct me if I am wrong, but it means that we know for sure that the rational function in this case is bounded above by ##\frac{3}{2}## but nothing else. To me, this seems anagolus to when you don't divide out polynomial solutions, but you solve for zero. Is that the same sort of case here?
When you a limit of a sequence using the definition of the limit, you need to determine the number n that depends on the given ##\epsilon##. [/quote]

In the work that you did, you established that ##\frac{3n - 1}{2n^2 + 2n + 1} ≤ \frac{3n}{2n} = \frac{3}{2}##, but that's not what you were asked to do. For large n, ##\frac{3n - 1}{2n^2 + 2n + 1} ≤\frac{3}{2}##, but what you're asked to do is to show that the rational expression can be made smaller than any given positive number ##\epsilon##. IOW, that the limit of this expression is 0.
 
  • Like
  • Love
Likes member 731016, FactChecker and docnet
  • #3
Alternatively,
[tex]
\frac{3n-1}{2n^2+2n+1} = \frac{3-\frac{1}{n}}{2n+2+\frac{1}{n}} < \varepsilon \Leftrightarrow \frac{2n+2+\frac{1}{n}}{3-\frac{1}{n}} > \frac{1}{\varepsilon} \Leftarrow 2n+2+\frac{1}{n}> \frac{3}{\varepsilon} \Leftarrow 2n > \frac{3}{\varepsilon},
[/tex]
which implies taking ## n > \frac{3}{2\varepsilon} ## is sufficient. There are many paths to victory. The end goal is to find an index such that all indices after make the expression under the limit sign smaller than ## \varepsilon ##. Once we have ## N> \frac{3}{2\varepsilon} ## we could also take ## N> \frac{3}{2\varepsilon} + 10^6 ## or what have you.
 
  • Love
Likes member 731016

FAQ: Proving convergence of rational sequence

What is a rational sequence?

A rational sequence is a sequence of numbers where each term can be expressed as a fraction of two integers, that is, in the form a_n = p_n/q_n, where p_n and q_n are integers and q_n ≠ 0. Rational sequences can converge to a limit, which may or may not be a rational number.

How do you determine if a rational sequence converges?

To determine if a rational sequence converges, you can analyze the limit of the sequence as n approaches infinity. If the limit exists and is finite, the sequence converges. This can often be done by simplifying the sequence and applying limit laws or using techniques such as the squeeze theorem or L'Hôpital's rule.

What is the difference between convergence and divergence of a rational sequence?

Convergence of a rational sequence means that as the index n increases, the terms of the sequence approach a specific finite limit. Divergence, on the other hand, indicates that the terms do not approach any finite limit; they may grow without bound or oscillate indefinitely without settling on a single value.

Can a rational sequence converge to an irrational number?

Yes, a rational sequence can converge to an irrational number. For example, the sequence a_n = 1 + 1/n converges to the limit of 1 as n approaches infinity, which is rational, but the sequence b_n = (√2 + 1/n) converges to √2, which is irrational. The terms of the sequence can be rational even if the limit is irrational.

What techniques can be used to prove the convergence of a rational sequence?

Several techniques can be used to prove the convergence of a rational sequence, including the epsilon-delta definition of limits, the comparison test, the ratio test, and the squeeze theorem. Additionally, algebraic manipulation to simplify the terms or applying known limits can also help establish convergence.

Similar threads

Back
Top