Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this community
I have been wondering about this question for some time now and would greatly appreciate if anyone had any leads on how to proceed.
Let $\{A_{i}\}_{i \in N}$ such that for, $i \neq j$, $A_{i} \cap A_{j} = \emptyset$ and $\bigcup{A_{i}} = N$. Let $(a_{i})_{i \in N}$ be a sequence in $R$. If, for all $A_{i}$, $\sum_{j \in A_{i}}{a_{j}} \geq 0$ (taking the usual ordering in $A_{i}$), is it true that $\sum_{i \leq n}{a_{i}} \geq 0$ infinitely often?
Let $a_0=-1$, $a_1=-1$, $a_2=1$, $a_3=-1$, $a_4=1$, $a_5=-1$, $a_6=1$ and so on. Then all partial sums are negative, alternating between $-1$ and $-2$.
Let $A_0=\{0,2\}$, $A_1=\{1,4\}$, $A_2=\{3,6\}$, $A_3=\{5,8\}$, and so on. Then for any $j$ the sum of the elements of $A_j$ is $0$.
Thus there are quite simple partitions of the natural numbers for which the desired result fails.
Remark: We can produce a convergent series that converges to $0$ with the same property. Let $a_0=-1$. Let $a_1=1/2$, $a_2=1/3$. Adding $1/4$ would make the partial sum $\ge 0$, so $a_3=-1/4$. Now we can go forward again, twice. Let $a_4=1/5$ and $a_5=1/6$. Adding $1/7$ would make the partial sum positive, so $a_6=-1/7$. Continue. Again, we can partition the natural numbers into (finite) parts so that the sum over any part is $\ge 0$.
