Convergence of Series: Proving the Relationship Between Two Converging Series

Click For Summary

Homework Help Overview

The discussion revolves around a problem from Rudin's Principles of Mathematical Analysis concerning the convergence of two series, specifically proving that the convergence of the series SUM[an] implies the convergence of the series SUM[sqrt(an)/n] under the condition that an >= 0.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • The original poster attempts to understand the relationship between the two series and considers the relevance of the Archimedean property and supremums based on the instructor's hint. Some participants discuss the AM-GM inequality as a potential tool for proving the relationship.

Discussion Status

Participants are exploring various aspects of the problem, with some providing insights into the AM-GM inequality and its implications for the series in question. There is a mix of attempts to clarify concepts and share knowledge, but no consensus has been reached regarding the proof itself.

Contextual Notes

The discussion includes references to specific mathematical concepts and inequalities, indicating a level of complexity in the problem. The original poster expresses difficulty in solving the problem, and the instructor's hint suggests a focus on foundational concepts from earlier chapters.

pository
Messages
2
Reaction score
0
Our instructor assigned a problem from Rudin's Principles of Mathematical Analysis; a problem which I have been unable to solve after giving it good thought.

The statement is:
"Prove that the convergence of SUM[an] implies the convergence of SUM[sqrt(an)/n], if an >= 0."

The instructor did give us a hint: "Review the ideas of chapter one," from which I gleaned the archimedean property or supremums might be important. Anyway, if anyone is familiar with how this can be proved, I would appreciate a nudge in the right direction. Thanks.
 
Physics news on Phys.org
In case anyone else read this, I have found the solution on the internet. It was embarassingly simple. By the AM-GM inequality:

[tex]a_n + \frac{1}{n^2} \ge 2\frac{\sqrt{a_n}}{n}.[/tex]​

The left hand series converges, so by direct comparison, the right hand series also converges.
 
Last edited:
Cool, I didn't know of this inequality. What does AM-GM stands for?
 
Harmonic - Geometric - Arithmetic Mean Inequality

AM-GM = Arithmetic Mean - Geometric Mean

In full, the Harmonic - Geometric - Arithmetic Mean inequality is (for sequences)

[tex]\frac{n}{\frac{1}{a_{1}}+\frac{1}{a_{2}}+\cdot\cdot\cdot +\frac{1}{a_{n}}}\leq \left( a_{1}a_{2}\cdot\cdot\cdot a_{n}\right) ^{\frac{1}{n}}\leq \frac{a_{1}+a_{2}\cdot\cdot\cdot + a_{n}}{n}[/tex]

where equality holds iff the [itex]a_{i}[/itex]'s are all equal, and it is understood that [itex]a_{i}\geq 0,\forall i[/itex].
 
Harmonic - Geometric - Arithmetic Mean inequality is (for functions)

Suppose that the real-valued function [tex]f(x)[/tex] is defined, properly integrable, and strictly positive on the interval [tex]\left[ x_{1}, x_{2}\right][/tex].

Then the Harmonic - Geometric - Arithmetic Mean inequality is (for functions)

[tex]\frac{x_{1} - x_{2}}{\int_{x_{1}}^{x_{2}} \frac{dx}{f(x)}} \leq \exp\left( \frac{1}{x_{1} - x_{2}}\int_{x_{1}}^{x_{2}} \log f(x) dx\right) \leq \frac{1}{x_{1} - x_{2}} \int_{x_{1}}^{x_{2}} f(x)dx[/tex]
 
Last edited:
Great, I'm noting all of this down.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K