On a Ky Fan's inequality and some related inequalities between means (Q1304196)

If \(0<a_i< 1/2\), \(1\leq i\leq n\) then \[ {\sum a_i^{-1}\over {\sum(1- a_i)^{-1}}}\geq \left({\prod a_i}\over {\prod(1- a_i)}\right)^{1/n} \] is known as Wang's inequality and the first part of this paper gives a new proof based on some elementary inequalities satisfied by the sums on the left-hand side of this inequality. The second part of the paper proves the inequality \[ \prod_r!\left({{\sum_{j=1}^ra_{i_j}}}\over{{\sum_{j=1}^r(1-a_{i_j})}}\right)^{\lambda_i}\geq\left({{\sum_r! \lambda_i\left(\sum_{j=1}^ra_{i_j}\right)}\over{\sum_r! \lambda_i\left(\sum_{j=1}^r(1-a_{i_j})\right)}}\right)^{ \lambda}; \] where \( \lambda = \lambda_1 + \cdots+ \lambda_{n\choose r}\) and \(\sum_r!, \prod_r!\), denotes the sum, resp. product, over all \(n\choose r\) choices of \(a_{i_j}, 1\leq j\leq r\). The proof is based on the convexity of \(\log (x^{-1} -1), 0< x\leq 1/2\). If \(r=1\) this result reduces to the weighted form of Ky Fan's inequality.