TheoremBase

Writes the maximiser as a convex combination of an arbitrary point of the domain and a nearby point of the set, uses convexity of the convexified function together with the maximum property at that nearby point, and lets the interpolation parameter tend to zero; the quadratic bound follows by expanding the square of the norm.

Proof

Since xx is an interior point of AA in Rn\mathbb{R}^{n}, claim 1 of Interior Points in the Metric Topology are Exactly the Centres of Contained Closed Balls supplies σ∈R\sigma\in\mathbb{R} with 0<σ0<\sigma and

BˉdE(x,σ)⊆A,\bar{B}_{d_{E}}(x,\sigma)\subseteq A ,

closed balls being those of Closed Ball in a Metric Space. Throughout we use the bilinearity and symmetry of the dot product (The Dot Product on Rn\mathbb{R}^n Is Symmetric, Bilinear and Positive Definite) and the identity ∥z∥2=z⋅z\lVert z\rVert^{2}=z\cdot z of claim 1 of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square.

Proof of claim 1. Let y∈Uy\in U. If y=xy=x the asserted inequality reads G(x)≥G(x)G(x)\ge G(x) and holds, so assume y≠xy\ne x and put v=y−xv=y-x; then ∥v∥>0\lVert v\rVert>0 by claim 3 of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square.

Let t∈Rt\in\mathbb{R} satisfy 0<t0<t and t ∥v∥≤σt\,\lVert v\rVert\le\sigma, and put zt=x−t vz_{t}=x-t\,v. Then

dE(x,zt)=∥zt−x∥=∥(−t) v∥=t ∥v∥≤σd_{E}(x,z_{t})=\lVert z_{t}-x\rVert=\lVert(-t)\,v\rVert=t\,\lVert v\rVert\le\sigma

by claims 2 and 5 of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square, so zt∈BˉdE(x,σ)⊆A⊆Uz_{t}\in\bar{B}_{d_{E}}(x,\sigma)\subseteq A\subseteq U.

The real numbers t1+t\tfrac{t}{1+t} and 11+t\tfrac{1}{1+t} are nonnegative and sum to 11, and

t1+t y+11+t zt=t y+x−t (y−x)1+t=x+t x1+t=x.\frac{t}{1+t}\,y+\frac{1}{1+t}\,z_{t}=\frac{t\,y+x-t\,(y-x)}{1+t}=\frac{x+t\,x}{1+t}=x .

Since UU is convex and y,zt∈Uy,z_{t}\in U, convexity of GG on UU (Convex Real-Valued Function on a Convex Subset of Rn\mathbb{R}^n, applied with the coefficient t1+t\tfrac{t}{1+t}, which lies between 00 and 11) gives

G(x)≤t1+t G(y)+11+t G(zt).G(x)\le\frac{t}{1+t}\,G(y)+\frac{1}{1+t}\,G(z_{t}).

Multiplying by the positive number 1+t1+t and rearranging,

t G(y) ≥ (1+t) G(x)−G(zt) = t G(x)+(G(x)−G(zt)).(∗)t\,G(y)\ \ge\ (1+t)\,G(x)-G(z_{t})\ =\ t\,G(x)+\bigl(G(x)-G(z_{t})\bigr). \tag{$\ast$}

We bound G(x)−G(zt)G(x)-G(z_{t}) from below. As zt∈Az_{t}\in A, the maximum hypothesis gives φ(zt)+p⋅zt≤φ(x)+p⋅x\varphi(z_{t})+p\cdot z_{t}\le\varphi(x)+p\cdot x, that is,

φ(zt)≤φ(x)+p⋅(x−zt)=φ(x)+t (p⋅v).\varphi(z_{t})\le\varphi(x)+p\cdot(x-z_{t})=\varphi(x)+t\,(p\cdot v).

Moreover

∥zt∥2=(x−t v)⋅(x−t v)=∥x∥2−2t (x⋅v)+t2 ∥v∥2,\lVert z_{t}\rVert^{2}=(x-t\,v)\cdot(x-t\,v)=\lVert x\rVert^{2}-2t\,(x\cdot v)+t^{2}\,\lVert v\rVert^{2},

so that

μ2(∥x∥2−∥zt∥2)=μ t (x⋅v)−μ t22 ∥v∥2.\frac{\mu}{2}\bigl(\lVert x\rVert^{2}-\lVert z_{t}\rVert^{2}\bigr)=\mu\,t\,(x\cdot v)-\frac{\mu\,t^{2}}{2}\,\lVert v\rVert^{2}.

Adding the two displays,

G(x)−G(zt)=(φ(x)−φ(zt))+μ2(∥x∥2−∥zt∥2) ≥ t ((μ x−p)⋅v)−μ t22 ∥v∥2.G(x)-G(z_{t})=\bigl(\varphi(x)-\varphi(z_{t})\bigr)+\frac{\mu}{2}\bigl(\lVert x\rVert^{2}-\lVert z_{t}\rVert^{2}\bigr)\ \ge\ t\,\bigl((\mu\,x-p)\cdot v\bigr)-\frac{\mu\,t^{2}}{2}\,\lVert v\rVert^{2}.

Substituting this into (∗)(\ast) and dividing by t>0t>0,

G(y) ≥ G(x)+(μ x−p)⋅v−μ t2 ∥v∥2.G(y)\ \ge\ G(x)+(\mu\,x-p)\cdot v-\frac{\mu\,t}{2}\,\lVert v\rVert^{2}.

Put D=G(y)−G(x)−(μ x−p)⋅vD=G(y)-G(x)-(\mu\,x-p)\cdot v and C=μ2∥v∥2C=\tfrac{\mu}{2}\lVert v\rVert^{2}, so that 0≤C0\le C and

D ≥ −C tfor every real t with 0<t≤σ∥v∥.D\ \ge\ -C\,t\qquad\text{for every real }t\text{ with }0<t\le\frac{\sigma}{\lVert v\rVert}.

Suppose D<0D<0. If C=0C=0 then taking t=σ/∥v∥t=\sigma/\lVert v\rVert gives D≥0D\ge 0, a contradiction. If 0<C0<C, choose a real tt with 0<t0<t, t≤σ/∥v∥t\le\sigma/\lVert v\rVert and t<−D/Ct<-D/C (the smaller of σ/∥v∥\sigma/\lVert v\rVert and half of −D/C-D/C will do, both being positive); then −C t>D-C\,t>D, contradicting the display. Hence 0≤D0\le D, that is,

G(y) ≥ G(x)+(μ x−p)⋅(y−x).G(y)\ \ge\ G(x)+(\mu\,x-p)\cdot(y-x).

As y∈Uy\in U was arbitrary, μ x−p∈∂UG(x)\mu\,x-p\in\partial_{U}G(x) by Subdifferential of a Real-Valued Function on a Convex Subset of Rn\mathbb{R}^n. This proves claim 1.

Proof of claim 2. Let y∈Uy\in U and put v=y−xv=y-x. Expanding as above, ∥y∥2=(x+v)⋅(x+v)=∥x∥2+2 (x⋅v)+∥v∥2\lVert y\rVert^{2}=(x+v)\cdot(x+v)=\lVert x\rVert^{2}+2\,(x\cdot v)+\lVert v\rVert^{2}, so

μ2(∥x∥2−∥y∥2)=−μ (x⋅v)−μ2 ∥v∥2.\frac{\mu}{2}\bigl(\lVert x\rVert^{2}-\lVert y\rVert^{2}\bigr)=-\mu\,(x\cdot v)-\frac{\mu}{2}\,\lVert v\rVert^{2}.

By claim 1,

φ(y)+μ2∥y∥2 ≥ φ(x)+μ2∥x∥2+(μ x−p)⋅v,\varphi(y)+\frac{\mu}{2}\lVert y\rVert^{2}\ \ge\ \varphi(x)+\frac{\mu}{2}\lVert x\rVert^{2}+(\mu\,x-p)\cdot v ,

hence

φ(y) ≥ φ(x)+μ2(∥x∥2−∥y∥2)+μ (x⋅v)−p⋅v = φ(x)−p⋅(y−x)−μ2 ∥y−x∥2,\varphi(y)\ \ge\ \varphi(x)+\frac{\mu}{2}\bigl(\lVert x\rVert^{2}-\lVert y\rVert^{2}\bigr)+\mu\,(x\cdot v)-p\cdot v\ =\ \varphi(x)-p\cdot(y-x)-\frac{\mu}{2}\,\lVert y-x\rVert^{2},

which is claim 2.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…