TheoremBase

Proof

Since xx and zz lie in DD and hence in CC, and since 0≤λ0\le\lambda and λ≤1\lambda\le1, Convex Real-Valued Function on a Convex Subset of Rn\mathbb{R}^n applies to the representation y=λz+(1−λ)xy=\lambda z+(1-\lambda)x and gives

u(y)≤λ u(z)+(1−λ) u(x).u(y)\le\lambda\,u(z)+(1-\lambda)\,u(x).

Adding −u(x)-u(x) to both sides, by claim 3 of Elementary Order Arithmetic in an Ordered Field, and simplifying the right-hand side by the field axioms,

u(y)−u(x)≤λ u(z)+(1−λ) u(x)−u(x)=λ(u(z)−u(x)).u(y)-u(x)\le\lambda\,u(z)+(1-\lambda)\,u(x)-u(x)=\lambda\bigl(u(z)-u(x)\bigr).

Since z∈Dz\in D we have u(z)≤Mu(z)\le M, and since x∈Dx\in D we have m≤u(x)m\le u(x), so adding −u(x)-u(x) to the first inequality and then MM to the second, again by claim 3 of Elementary Order Arithmetic in an Ordered Field, gives

u(z)−u(x)≤M−u(x)≤M−m.u(z)-u(x)\le M-u(x)\le M-m .

Multiplying by the nonnegative number λ\lambda, by claim 5 of Elementary Arithmetic in an Ordered Field, gives λ(u(z)−u(x))≤λ(M−m)\lambda(u(z)-u(x))\le\lambda(M-m), and claim 1 of Elementary Order Arithmetic in an Ordered Field combines the two displayed inequalities into

u(y)−u(x)≤λ (M−m).u(y)-u(x)\le\lambda\,(M-m).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…