# Is this inequality true? If true what is the simplest proof?

Suppose we have $$\frac{a_i^1}{b_i^1+c}>\frac{a_i^2}{b_i^2+c},~\forall ~i\in\{1,2,\cdots L\}$$ and $a_i^1<a_i^2$, $b_i^1<b_i^2$ $\forall ~i\in\{1,2,\cdots L\}$. Then can we say that following inequality is true $$\frac{\sum_{i=1}^La_i^1}{\sum_{i=1}^{L}b_i^1+Lc}>\frac{\sum_{i=1}^La_i^2}{\sum_{i=1}^{L}b_i^2+Lc}?$$ Please note that $a_i,b_i$ and $c$ are non-negative values. Further please note that the superscripts do not represent powers.

• WLOG $c=0$, you can absorb it in the $b$'s. – Yves Daoust Jul 9 '18 at 9:13
• @YvesDaoust yes I agree with you. But what do you think about the inequality? Is it always true? – Frank Moses Jul 9 '18 at 9:14
• @YvesDaoust I am trying to show it for $L=2$ then will look for induction to extend the case to general $L$ case. This inequality look very simple. I am wondering whether there is some result present in the literature. – Frank Moses Jul 9 '18 at 9:25
• @YvesDaoust Unfortunately I am unable to show it even for $L=2$ case – Frank Moses Jul 9 '18 at 9:26

A geometrical disproof:

WLOG $c=0$, you can absorb it in the $b$'s.

Now, in a $(b,a)$ coordinate system, the individual points that fulfill the constraints are contained in an axis aligned right triangle with a vertex at the origin.

We choose a blue $p_1:=(a_1^1,b_1^1)$ and the locus of $q_1:=(a_1^2,b_1^2)$ follows. Similarly with a green $p_2:=(a_2^1,b_2^1)$.

Now take the sum of $p_1$ and $p_2$, or equivalently their arithmetic average, to get $p$. The inequation to be proven expresses that the average of $q_1$ and $q_2$ must lie below the straight line by $p$.

But it is clear that we can pick a $q_1$ and a $q_2$ such that this is invalidated.

Finding numerical values shouldn't be a big deal.