3

Let $\{\epsilon_i\}_{n \in \mathbb{N}}$ be a sequence of negligible functions and $q(n)$ be a polynomial in $n$. Then $f(n) = \sum_{i = 1}^{q(n)} \epsilon_i(n)$ need not be a negligible function.

Ideas

A typical negligible function is $2^{-n}$. Maybe we can expand it to the family $2^{-(n+i)}$ and set $q(n)$ to something that will give a sufficient large sum [didn't work]

user1868607
  • 1,243
  • 12
  • 29

1 Answers1

6

Consider the negligible functions $$\epsilon_i(n) = \begin{cases} 1 & \text{if } n \le i \\ 0 & \text{if } n > i \\ \end{cases}$$

and $q(n) = n$

It should be easy to show that each $\epsilon_i$ function is, in fact, negligible, but the sum $f(n)$ is not...

poncho
  • 147,019
  • 11
  • 229
  • 360
  • I would like to add that, using the limit definition will fail, since not all time, the summation of the limit is equal to limit of the sum. – kelalaka Nov 17 '18 at 14:37