每天一道数学题(2021-06-30)

题目:

0 < x 1 ≤ x 2 2 ≤ ⋯ ≤ x n n , 0 ≤ y n ≤ y n − 1 ≤ ⋯ ≤ y n 0<x_1\leq \frac{x_2}{2}\leq\cdots\leq\frac{x_n}{n},0\leq y_n\leq y_{n-1}\leq\cdots\leq y_n 0<x12x2nxn,0ynyn1yn ,证明:
( ∑ k = 1 n x k y k ) 2 ≤ ( ∑ k = 1 n y k ) ( ∑ k = 1 n ( x k 2 − 1 4 x k x k − 1 ) y k ) (\sum^n_{k=1}x_ky_k)^2\leq(\sum^n_{k=1}y_k)(\sum^n_{k=1}(x_k^2-\frac{1}{4}x_kx_{k-1})y_k) (k=1nxkyk)2(k=1nyk)(k=1n(xk241xkxk1)yk)
(约定 x 0 = 0 x_0=0 x0=0

答案:

我们先证明 y 1 = y 2 = ⋯ = y n y_1=y_2=\cdots=y_n y1=y2==yn 时不等式成立,既有
( ∑ k = 1 n x k ) 2 ≤ n ∑ k = 1 n ( x k 2 − 1 4 x k x k − 1 ) (1) (\sum^n_{k=1}x_k)^2\leq n\sum^n_{k=1}(x_k^2-\frac{1}{4}x_kx_{k-1})\tag{1} (k=1nxk)2nk=1n(xk241xkxk1)(1)
用归纳法, n = 1 n=1 n=1 时显然,此后有
R − L = n ∑ k = 1 n ( x k 2 − 1 4 x k x k − 1 ) − ( ∑ k = 1 n x k ) 2 ≥ n n − 1 ( ∑ k = 1 n − 1 x k ) 2 + n x n 2 − n 4 x n x n − 1 − ( ∑ k = 1 n x k ) 2 = [ 1 n − 1 ( ∑ k = 1 n − 1 x k ) 2 + n − 1 4 x n 2 − x n ∑ k = 1 n − 1 x k ] + [ 3 ( n − 1 ) 2 4 x n 2 − n 4 x n x n − 1 − x n ∑ k = 1 n − 1 x k ] ≥ 0 \begin{aligned} R-L&=n\sum^n_{k=1}(x_k^2-\frac{1}{4}x_kx_{k-1})-(\sum^n_{k=1}x_k)^2\\ &\geq\frac{n}{n-1}(\sum^{n-1}_{k=1}x_k)^2+nx_n^2-\frac{n}{4}x_nx_{n-1}-(\sum^n_{k=1}x_k)^2\\ &=[\frac{1}{n-1}(\sum^{n-1}_{k=1}x_k)^2+\frac{n-1}{4}x_n^2-x_n\sum^{n-1}_{k=1}x_k]+[\frac{3(n-1)^2}{4}x_n^2-\frac{n}{4}x_nx_{n-1}-x_n\sum^{n-1}_{k=1}x_k]\geq0 \end{aligned} RL=nk=1n(xk241xkxk1)(k=1nxk)2n1n(k=1n1xk)2+nxn24nxnxn1(k=1nxk)2=[n11(k=1n1xk)2+4n1xn2xnk=1n1xk]+[43(n1)2xn24nxnxn1xnk=1n1xk]0
第一个中括号内的式子由基本不等式知其为正,第二个中括号内的式子由 x k ≤ k n x n x_k\leq\frac{k}{n}x_n xknkxn 知其为正

于是(1)式成立

y 1 = ⋯ = y r y_1=\cdots=y_r y1==yr,则 r = n r=n r=n 的情形已经证明,现在对 n − r n-r nr 归纳:

记欲证不等式为 f ( y 1 , ⋯   , y r , y r + 1 , ⋯   , y n ) = f ( y r , ⋯   , y r , y r + 1 , ⋯   , y n ) = f r ( y r ) ≥ 0 f(y_1,\cdots,y_r,y_{r+1},\cdots,y_n)=f(y_r,\cdots,y_r,y_{r+1},\cdots,y_n)=f_r(y_r)\geq0 f(y1,,yr,yr+1,,yn)=f(yr,,yr,yr+1,,yn)=fr(yr)0

则有
∂ f r ∂ y r = ∑ i = 1 r ∂ f ∂ y i = ∑ i = 1 r ∂ R ∂ y i − ∑ i = 1 r ∂ L ∂ y i = ∑ i = 1 r ∑ k = 1 n ( x k 2 + x i 2 − 1 4 x i x i + 1 − 1 4 x k x k + 1 − 2 x k x i ) y k = ∑ k = 1 n ( r x k 2 − r 4 x k x k − 1 + ∑ i = 1 r x i 2 − 1 4 ∑ i = 1 r x i x i − 1 − 2 x k ∑ i = 1 r x i ) y k \begin{aligned} \dfrac{\partial f_r}{\partial y_r}&=\sum^r_{i=1}\dfrac{\partial f}{\partial y_i}=\sum^r_{i=1}\dfrac{\partial R}{\partial y_i}-\sum^r_{i=1}\dfrac{\partial L}{\partial y_i}\\ &=\sum^r_{i=1}\sum^n_{k=1}(x_k^2+x_i^2-\frac{1}{4}x_ix_{i+1}-\frac{1}{4}x_kx_{k+1}-2x_kx_i)y_k\\ &=\sum^n_{k=1}(rx_k^2-\frac{r}{4}x_kx_{k-1}+\sum^r_{i=1}x_i^2-\frac{1}{4}\sum^r_{i=1}x_ix_{i-1}-2x_k\sum^r_{i=1}x_i)y_k\\ \end{aligned} yrfr=i=1ryif=i=1ryiRi=1ryiL=i=1rk=1n(xk2+xi241xixi+141xkxk+12xkxi)yk=k=1n(rxk24rxkxk1+i=1rxi241i=1rxixi12xki=1rxi)yk
我们指出,对上述和式中 k > r k>r k>r 的部分,由于 x i ≥ i x 1 x_i\geq ix_1 xiix1
∑ k = 1 n ( r x k 2 − r 4 x k x k − 1 + ∑ i = 1 r x i 2 − 1 4 ∑ i = 1 r x i x i − 1 − 2 x k ∑ i = 1 r x i ) y k ≥ r x 1 2 [ ( r − k ) 2 + ( k − 1 ) ( 2 k − 2 r − 1 ) ] y k ≥ 0 \begin{aligned} &\sum^n_{k=1}(rx_k^2-\frac{r}{4}x_kx_{k-1}+\sum^r_{i=1}x_i^2-\frac{1}{4}\sum^r_{i=1}x_ix_{i-1}-2x_k\sum^r_{i=1}x_i)y_k\\ &\geq rx_1^2[(r-k)^2+(k-1)(2k-2r-1)]y_k\geq0 \end{aligned} k=1n(rxk24rxkxk1+i=1rxi241i=1rxixi12xki=1rxi)ykrx12[(rk)2+(k1)(2k2r1)]yk0
而对和式中 k ≤ r k\leq r kr 的部分,由于 y 1 = ⋯ = y r y_1=\cdots=y_r y1==yr
∑ k = 1 r ( r x k 2 − r 4 x k x k − 1 + ∑ i = 1 r x i 2 − 1 4 ∑ i = 1 r x i x i − 1 − 2 x k ∑ i = 1 r x i ) y k = 2 ( r ∑ i = 1 r ( x i 2 − 1 4 x i x i − 1 ) − ( ∑ i = 1 r x i ) 2 ) y r ≥ 0 \begin{aligned} &\sum^r_{k=1}(rx_k^2-\frac{r}{4}x_kx_{k-1}+\sum^r_{i=1}x_i^2-\frac{1}{4}\sum^r_{i=1}x_ix_{i-1}-2x_k\sum^r_{i=1}x_i)y_k\\ &=2(r\sum^r_{i=1}(x_i^2-\frac{1}{4}x_ix_{i-1})-(\sum^r_{i=1}x_i)^2)y_r\geq0 \end{aligned} k=1r(rxk24rxkxk1+i=1rxi241i=1rxixi12xki=1rxi)yk=2(ri=1r(xi241xixi1)(i=1rxi)2)yr0
这恰恰是已经证明的式(1)

于是有 f r ( y r ) ≥ f r ( y r + 1 ) = f ( y r + 1 , ⋯   , y r + 1 , y r + 2 , ⋯   , y n ) f_r(y_r)\geq f_r(y_{r+1})=f(y_{r+1},\cdots,y_{r+1},y_{r+2},\cdots,y_n) fr(yr)fr(yr+1)=f(yr+1,,yr+1,yr+2,,yn)

这就回到了归纳假设,于是 r = 1 r=1 r=1 的情形得证,问题解决。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值