3
$\begingroup$

got stuck on this proof given out of a practice test for my exam. the course is taught in rudin's principles of mathematics.

it says: let $a_n$ be a positive non-increasing sequence, prove: $\sum a_n$ converges if and only if $\sum n a_{n^2}$ converges. Note: the square is on the subscript.

i've been attempting it the same way Rudin proved Theorem 3.27, which was similar but with $2^k a_{2^k}$. however, i can't line up the patterns.

i've been doing two cases, one with $n > k^2$ and one with $n < k^2$. then attempting to show in either case, one sequence of partial sums bounds the other, so that either both are bounded are both are unbounded.

however, i can't quite get the bounding patterns. This may be the wrong method, which would explain why i can't get them. any help is appreciated.

$\endgroup$
  • $\begingroup$ one direct way would be to say that $\sum_n a_n$ converges iff there exists some $\epsilon > 0$ such that $a_n$ is $o(\frac{1}{n^{1+\epsilon}})$ or $o(\frac{1}{n (\ln n)^{1+\epsilon}})$ or $o(\frac{1}{n (\ln n)(\ln \ln n)^{1+\epsilon} })$ or $o(\frac{1}{n (\ln n)(\ln \ln n)(\ln \ln \ln n)^{1+\epsilon} })$, etc. (the Cauchy condensation test you are using with $\sum_k 2^k a_{2^k}$) $\endgroup$ – reuns Mar 28 '16 at 5:49
  • $\begingroup$ It might help to write $\sum_{n=1}^\infty a_n = \sum_{n=0}^\infty \sum_{k=n^2+1}^{(n+1)^2} a_{k} = [a_1] + [a_2+a_3+a_4] + [a_5+a_6+ \ldots + a_9] + \ldots$. Now use that $a_n$ is decreasing, so that for example $a_5,a_6,\ldots,a_9 \geq a_9$, to bound the sum from below. $\endgroup$ – Winther Mar 28 '16 at 5:57
  • $\begingroup$ and the more even direct way, using decreasing-ness if by grouping $a_{n^2}, \ldots, a_{(n+1)^2-1}$ and bounding by $((n+1)^2-1-n^2))a_{(n+1)^2-1}$ $\endgroup$ – reuns Mar 28 '16 at 5:58
  • $\begingroup$ Winther, im not seeing exactly how that would help here. isnt that exactly the same strategy for proving this for 2^k * a(2^k) $\endgroup$ – mac5 Mar 28 '16 at 6:21
  • $\begingroup$ user1952009, your first response is not something we've covered yet. and i'm not understanding your second response $\endgroup$ – mac5 Mar 28 '16 at 6:42
2
$\begingroup$

On the one hand, $$ [a_1]+[a_2+a_3+a_4]+[a_5+\cdots + a_9] + \cdots \geq a_1 + 3 a_4 + 5a_9 + \cdots. $$

On the other hand, $$ [a_1]+[a_2+a_3+a_4]+[a_5+\cdots + a_9] + \cdots \leq a_1 + 3 a_1 + 5a_4 + \cdots. $$

Bounding the odd sequences crudely yields $$ \sum n a_{n^2}\leq \sum a_n \leq a_1+\sum 3n a_{n^2}, $$ from which the result follows.

$\endgroup$
  • $\begingroup$ this shows boundedness of partial sums which implies convergence of non-negative sequences, right? $\endgroup$ – mac5 Mar 28 '16 at 16:07
  • $\begingroup$ Yes. Since the sequence $a_n$ is positive non-increasing, $\sum a_n$ converges if and only if it is finite. (In other words, the only way for such a sum not to converge is if it diverges to positive infinity.) $\endgroup$ – pre-kidney Mar 29 '16 at 0:09

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.