1
$\begingroup$

Let $x$ be a small real number, say $1/10

Using the triangle inequality it's easy to find an upper bound for the above sum, but I don't know any method for finding a lower bound.

Would a lower bound like $\vert a_n\vert \geq 2^n$ help?

  • 0
    I don't understand what restrictions you are looking for on $(a_n)$. You could use things like $\left|\sum\limits_{n=1}^\infty a_n x^n\right|\geq\left|\sum\limits_{n=1}^m a_n x^n\right| -\left|\sum\limits_{n=m+1}^\infty a_n x^n\right|$.2011-12-04
  • 0
    Yes, this way I just have to bound the last term from above. This can be done explicitly using the triangle inequality. In fact, the last term you write down is bounded from above by $(3x)^m/(1-3x)$. But how do I bound the first term from below? My only guess is that I require the exact values of $a_n$ for $n=1,\ldots,m$ and then use a computer to approximate this number.2011-12-04
  • 0
    @Federico: With only an upper bound for the $a_n$ and the information that $f(x) = \sum_{n=1}^\infty a_nx^n$ has not zeroes except at $x=0$, you can always have something like $f(x) = a_1 x$ with arbitrarily small $|a_1|>0$. So you definitely need more information, i.e. a lower bound for the $a_n$ to be able to give a lower bound for $f$. In this case, Jonas Meyer already has poitned out the way to go.2011-12-04
  • 0
    @Sam. Your comment convinced me that I will need a lower bound on the $a_n$. But I still dont know how to find a lower bound for the term $\vert \sum_{n=1}^m a_n x^n\vert$ in Jonas' answer. I can only think of using a computer, but you can only compute a finite number of values of $f$ this way. Anyway, as I said in my above comment, I know that $\vert \sum_{n= m+1}^\infty a_n x^n\vert \leq (3x)^m/(1-3x)$, but how do I get a lower bound for $\vert\sum_{n=1}^\infty a_n x^n\vert$?2011-12-04
  • 0
    You could set $m=1$ and get $\left|\textstyle\sum_{n=1}^\infty a_nx^n \right| \ge \left|a_1x \right| - \left|\textstyle\sum_{n=2}^\infty a_nx^n \right|$ for example. But it always depends on what exactly you're trying to do...2011-12-06

0 Answers 0