跳到主要内容

京都大学 情報学研究科 知能情報学専攻 2022年2月実施 基礎科目 F1-2

Author​

祭音Myyura (co-authored with GPT 5.6 SOL)

Description​

Q.1​

(1) Prove

log⁡(xy)=log⁡x+log⁡y(x,y>1)\log(xy)=\log x+\log y\qquad (x,y>1)

using the definition

log⁡x=∫1x1t dt.\log x=\int_1^x\frac1t\,dt.

(2) Let f(x)=axf(x)=a^x, where a>0a>0. Derive df(x)/dxdf(x)/dx using the chain rule.

Q.2​

Let

f(p1,p2,…,pn)=−∑i=1npilog⁡pi,f(p_1,p_2,\ldots,p_n)=-\sum_{i=1}^{n}p_i\log p_i,

where

∑i=1npi=1,0<pi<1,n≥2,\sum_{i=1}^{n}p_i=1,\qquad 0<p_i<1,\qquad n\ge2,

and log⁡\log denotes the natural logarithm.

(1) Prove that ff is strictly concave and non-negative.

(2) Using Lagrange multipliers, derive the pip_i that maximize ff and give the maximum value.

题目描述​

  1. 使用 log⁡x=∫1xdt/t\log x=\int_1^xdt/t 的定义证明 log⁡(xy)=log⁡x+log⁡y\log(xy)=\log x+\log y(x,y>1x,y>1);再用链式法则求 f(x)=axf(x)=a^x(a>0a>0)的导数。

  2. 在 ∑ipi=1\sum_i p_i=1、0<pi<10<p_i<1、n≥2n\ge2 下,令

    f(p1,…,pn)=−∑i=1npilog⁡pi.f(p_1,\ldots,p_n)=-\sum_{i=1}^{n}p_i\log p_i.
    1. 证明 ff 严格凹且非负;
    2. 用拉格朗日乘数法求最大化 ff 的 pip_i 及最大值。

Kai​

Q.1​

(1)​

Split the integral at xx and substitute t=xut=xu in the second part:

log⁡(xy)=∫1xydtt=∫1xdtt+∫xxydtt=log⁡x+∫1yx duxu=log⁡x+log⁡y.\begin{aligned} \log(xy) &=\int_1^{xy}\frac{dt}{t}\\ &=\int_1^x\frac{dt}{t}+\int_x^{xy}\frac{dt}{t}\\ &=\log x+\int_1^y\frac{x\,du}{xu}\\ &=\boxed{\log x+\log y}. \end{aligned}

(2)​

Because f(x)>0f(x)>0,

log⁡f(x)=log⁡(ax)=xlog⁡a.\log f(x)=\log(a^x)=x\log a.

Differentiating both sides by the chain rule,

f′(x)f(x)=log⁡a.\frac{f'(x)}{f(x)}=\log a.

Thus

f′(x)=axlog⁡a.\boxed{f'(x)=a^x\log a}.

Q.2​

(1)​

For 0<pi<10<p_i<1, log⁡pi<0\log p_i<0, so every term −pilog⁡pi-p_i\log p_i is positive. Hence f>0f>0, and in particular ff is non-negative.

Its Hessian is

∇2f=−diag⁡(1p1,…,1pn).\nabla^2f= -\operatorname{diag}\left(\frac1{p_1},\ldots,\frac1{p_n}\right).

For every nonzero vector v\boldsymbol{v},

vT∇2f v=−∑i=1nvi2pi<0.\boldsymbol{v}^{\mathsf T}\nabla^2f\,\boldsymbol{v} =-\sum_{i=1}^{n}\frac{v_i^2}{p_i}<0.

Therefore ff is strictly concave on the positive orthant, and hence also on the probability simplex.

(2)​

Use the Lagrangian

L=−∑i=1npilog⁡pi+λ(∑i=1npi−1).\mathcal{L} =-\sum_{i=1}^{n}p_i\log p_i +\lambda\left(\sum_{i=1}^{n}p_i-1\right).

The stationary conditions are

∂L∂pi=−(log⁡pi+1)+λ=0.\frac{\partial\mathcal{L}}{\partial p_i} =-(\log p_i+1)+\lambda=0.

Thus all pip_i are equal. The constraint gives

pi=1n(i=1,…,n).\boxed{p_i=\frac1n\qquad(i=1,\ldots,n)}.

Strict concavity makes this stationary point the unique global maximum, whose value is

fmax⁡=−∑i=1n1nlog⁡1n=log⁡n.\boxed{ f_{\max} =-\sum_{i=1}^{n}\frac1n\log\frac1n =\log n.}