ScalingStacks

Démonstration. [01UI]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Démonstration.

La première propriété résulte de ce qu’un maximum de fonctions convexes est convexe. La fonction faf_{a} est lisse sur 𝐑n\mathbf{R}^{n} ; pour démontrer qu’elle est convexe, il suffit de démontrer que sa hessienne est positive. On a en effet

∂2∂xi​∂xj​fa=∂∂xi​aj​exp⁡(xj)∑ak​exp⁡(xk)=ai​exp⁡(xi)∑ak​exp⁡(xk)​δi​j−ai​aj​exp⁡(xi)​exp⁡(xj)(∑ak​exp⁡(xk))2.\frac{\partial^{2}}{\partial x_{i}\partial x_{j}}f_{a}=\frac{\partial}{\partial x_{i}}\frac{a_{j}\exp(x_{j})}{\sum a_{k}\exp(x_{k})}=\frac{a_{i}\exp(x_{i})}{\sum a_{k}\exp(x_{k})}\delta_{ij}-\frac{a_{i}a_{j}\exp(x_{i})\exp(x_{j})}{(\sum a_{k}\exp(x_{k}))^{2}}.

Par suite, pour tout y∈𝐑ny\in\mathbf{R}^{n}, on a

D2​fa​(y,y)=∑i=1nai​yi2​exp⁡(xi)∑ak​exp⁡(xk)−ai​yi​aj​yj​exp⁡(xi)​exp⁡(xj)(∑ak​exp⁡(xk))2.D^{2}f_{a}(y,y)=\sum_{i=1}^{n}\frac{a_{i}y_{i}^{2}\exp(x_{i})}{\sum a_{k}\exp(x_{k})}-\frac{a_{i}y_{i}a_{j}y_{j}\exp(x_{i})\exp(x_{j})}{(\sum a_{k}\exp(x_{k}))^{2}}.

Posons ui=ai​exp⁡(xi)u_{i}=a_{i}\exp(x_{i}). Comme la fonction y↦y2y\mapsto y^{2} est convexe, on a

(∑ui​yi2)​(∑ui)≥(∑ui​yi)2,(\sum u_{i}y_{i}^{2})(\sum u_{i})\geq(\sum u_{i}y_{i})^{2},

si bien que D2​fa​(y,y)≥0D^{2}f_{a}(y,y)\geq 0.

Soit x∈𝐑nx\in\mathbf{R}^{n}. Pour tout i∈{1,…,n}i\in\{1,\dots,n\}, on a

fa​(x)≥log⁡(ai​exp⁡(xi))=log⁡(ai)+xi,f_{a}(x)\geq\log(a_{i}\exp(x_{i}))=\log(a_{i})+x_{i},

si bien que

fa​(x)\displaystyle f_{a}(x) ≥min⁡(log⁡(a1),…,log⁡(an))+max⁡(x1,…,xn)\displaystyle\geq\min(\log(a_{1}),\dots,\log(a_{n}))+\max(x_{1},\dots,x_{n})
=min⁡(log⁡(a1),…,log⁡(an))+f⁡(x),\displaystyle=\min(\log(a_{1}),\dots,\log(a_{n}))+f(x),

tandis que

fa​(x)≤log⁡(∑i=1nai​exp⁡(max⁡(x1,…,xn)))≤log⁡(∑i=1nai)+f⁡(x).f_{a}(x)\leq\log\big(\sum_{i=1}^{n}a_{i}\exp(\max(x_{1},\dots,x_{n}))\big)\leq\log\big(\sum_{i=1}^{n}a_{i}\big)+f(x).

Par conséquent, si ε>0\varepsilon>0, on a

ε​min⁡(log⁡(a1),…,log⁡(an))+f⁡(x)≤ε​fa​(x/ε)≤ε​log⁡(∑i=1nai)+f⁡(x),\varepsilon\min(\log(a_{1}),\dots,\log(a_{n}))+f(x)\leq\varepsilon f_{a}(x/\varepsilon)\leq\varepsilon\log\big(\sum_{i=1}^{n}a_{i}\big)+f(x),

ce qui entraîne que ε​fa​(x/ε)\varepsilon f_{a}(x/\varepsilon) converge uniformément vers f⁡(x)f(x) lorsque ε\varepsilon tend vers 00 par valeurs supérieures. ∎

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.