Mathematics Asked by nizar on February 1, 2021
Let $0<x_1leqdotsleq x_m<1$, I denote
$$a=sum_{i=1}^mx_i,qquad b=sum_{i=1}^mfrac{1}{x_i},qquad c=sum_{i=1}^mfrac{x_i}{1-x_i}.$$
Im trying to prove that
$$(b-m)(c+1-frac{c}{a})geq m(m-1).$$
I did prove it for the case of $ageq 1$ using the Cauchy-Schwartz inequality. I implement a simulation in Python to construct a counterexample but in vain.
For $sumlimits_{i=1}^mx_igeq1$ it's nice:
Since $(x_1,x_2,...,x_m)$ and $left(frac{1-x_1}{x_1},frac{1-x_2}{x_2},...,frac{1-x_m}{x_m}right)$ have opposite ordering,
by C-S and Chebyshov we obtain: $$(b-m)left(c+1-frac{c}{a}right)=sum_{i=1}^mfrac{1-x_i}{x_i}left(sum_{i=1}^mfrac{x_i}{1-x_i}left(1-frac{1}{sumlimits_{i=1}^mx_i}right)+1right)geq$$ $$geq m^2-frac{m^2}{sumlimits_{i=1}^mx_i}+sum_{cyc}frac{1-x_i}{x_i}=$$ $$=m^2-m+frac{1}{sumlimits_{i=1}^mx_i}left(sum_{i=1}^mx_isum_{i=1}^mfrac{1-x_i}{x_i}-msum_{i=1}^m(1-x_i)right)geq m^2-m.$$
The proof without condition $sumlimits_{i=1}^mx_igeq1$.
Since $$left(frac{1-x_1}{x_1},frac{1-x_2}{x_2},...,frac{1-x_m}{x_m}right)$$ and $$left(frac{x_1(a-x_1)}{1-x_1},frac{x_2(a-x_2)}{1-x_2},...,frac{x_m(a-x_m)}{1-x_m}right)$$ have an opposite ordering, by Chebyshov we obtain: $$(b-m)left(c+1-frac{c}{a}right)=sum_{i=1}^mfrac{1-x_i}{x_i}left(sum_{i=1}^mfrac{x_i}{1-x_i}+1-frac{sumlimits_{i=1}^mfrac{x_i}{1-x_i}}{sumlimits_{i=1}^mx_i}right)=$$ $$=sum_{i=1}^mfrac{1-x_i}{x_i}left(sum_{i=1}^mfrac{x_i}{1-x_i}+frac{sumlimits_{i=1}^mleft(x_i-frac{x_i}{1-x_i}right)}{sumlimits_{i=1}^mx_i}right)=$$ $$=sum_{i=1}^mfrac{1-x_i}{x_i}left(sum_{i=1}^mfrac{x_i}{1-x_i}-frac{sumlimits_{i=1}^mfrac{x_i^2}{1-x_i}}{sumlimits_{i=1}^mx_i}right)=frac{sumlimits_{i=1}^mfrac{1-x_i}{x_i}sumlimits_{i=1}^mfrac{x_i(a-x_i)}{1-x_i}}{sumlimits_{i=1}^mx_i}geq$$ $$geqfrac{msumlimits_{i=1}^mleft(frac{1-x_i}{x_i}cdotfrac{x_i(a-x_i)}{1-x_i}right)}{sumlimits_{i=1}^mx_i}=frac{msumlimits_{i=1}^m(a-x_i)}{sumlimits_{i=1}^mx_i}=m(m-1).$$
Answered by Michael Rozenberg on February 1, 2021
Let $ displaystyle g=frac{b}{m}-1=frac{1}{m}sum_{i=1}^mfrac{1-x_i}{x_i} $, the arithmetic mean of $ displaystyle frac{x_1}{1-x_1},$$ displaystyle frac{x_2}{1-x_2},$$dots$$displaystyle frac{x_m}{1-x_m} $. Since $ displaystylefrac{m}{c} $ is their harmonic mean, $ displaystyle ggefrac{m}{c} $ by the harmonic mean-arithmetic mean inequality. Likewise, $ displaystylefrac{1}{1+g}=frac{b}{m} $ is the harmonic mean of $ x_1,$$x_2,$$dots,$$x_m $, and $ displaystylefrac{a}{m} $ is their arithmetic mean, so $ displaystylefrac{1}{1+g}le$$displaystylefrac{a}{m} $.
Therefore begin{align} b-m&= mg ,\ frac{c}{a}&lefrac{(1+g)c}{m} ,\ c+1-frac{c}{a}&ge c+1-frac{(1+g)c}{m} ,\ &=frac{c(m-1-g)}{m}+1\ &ge frac{(m-1-g)}{g}+1\ &= frac{m-1}{g} text{, and}\ (b-m)left(c+1-frac{c}{a}right)&ge mgleft(frac{m-1}{g}right)\ &=m(m-1) . end{align}
Answered by lonza leggiera on February 1, 2021
Get help from others!
Recent Questions
Recent Answers
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP