Let n be a positive integer, x1,…,xn and y1,…,yn be positive real numbers satisfying xn=n and yiyi+1≥1 for 1≤i<n and yny1≥1. Moreover, let x0=0. Determine the minimal possible value of the expression i=1∑n(xi−xi−1)2+yi.
Solution
We claim that the minimal value of the desired expression is n2 achieved by xi=i and yi=1 for all i. In what follows below, Y denotes the sum Y=∑i=1nyi. The solution consists of proving two separate inequalities.
By taking the global product of all the inequalities of the form yiyi+1≥1 and yny1≥1 we obtain i=1∏nyi2≥1. Thus from the AGM inequality we obtain i=1∑nyi≥ni=1∏nyi2n1≥n with equality in the left-hand inequality for equal yi and in the right-hand inequality for yi=1. Hence, by combining the two inequalities we obtain i=1∑n(xi−xi−1)2+yi≥n2+Y2≥2n2=n2 with equality iff yi=1 for all i and xi=xi−1+1, i.e. xi=i.
2nd Solution: For the two inequalities we give a second proof, each. First Inequality: Again we consider the yi as constants, and rewrite (xi−xi−1)2+yi=yi1+(yixi−xi−1)2. By considering the second derivative ∂x2∂21+x2=(1+x2)231>0 for all x we find that f(x)=1+x2 is a convex function. Hence, by applying the weighted Jensen's Inequality with weights Yyi we obtain
i=1∑nYyif(yixi−xi−1)i=1∑n(xi−xi−1)2+yi≥f(i=1∑nYxi−xi−1)=f(Yn), i.e.≥n2+Y2 withequalityifandonlyif$yixi−xi−1$isindependentof$i$.Hencetheequalitycasemaybeestablishedidenticallytothefirstsolution.∗∗SecondInequality:∗∗Byrewritingthegiveninequalitiesas$4yiyi+1≥1$,takingtheglobalsumandusingtheRearrangementInequalityweobtain ∑i=1nyi≥∑i=1n4yiyi+1≥ n with equality iff yi=yi+1 and yiyi+1=1 for all i, i.e. yi=1 for all i.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.