TheoremBase

The point (x, f(x)) lies outside the interior of the convex epigraph, so the supporting hyperplane theorem in Rn+1R^{n+1} gives a unit normal (b, beta); beta is negative because x is interior, and -b/beta is a subgradient.

Proof

Let E=epi⁡f⊆Rn+1E=\operatorname{epi}f\subseteq\mathbb{R}^{n+1} be the epigraph of ff (Epigraph of a Real-Valued Function on a Subset of Rn\mathbb{R}^n (i)) and p=(x,f(x))p=(x,f(x)). Throughout, pairs are added, scaled, paired by the dot product and measured as in Convex Functions on Rn\mathbb{R}^n: Standing Notation (ii), and a point of Rn+1\mathbb{R}^{n+1} determines its pair uniquely.

By A Function on a Convex Subset of Rn\mathbb{R}^n Is Convex If and Only If Its Epigraph Is Convex (i), EE is a convex subset of Rn+1\mathbb{R}^{n+1}. Moreover pp is not an interior point of EE. Indeed, let r>0r>0 and q=(x,f(x)−r/2)q=(x,f(x)-r/2). Then q−p=(0,−r/2)q-p=(0,-r/2), so

dE(p,q)=∥q−p∥=r/2<rd_{E}(p,q)=\lVert q-p\rVert=r/2<r

(Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (ii), with n+1n+1 in place of nn), and q∈B(p,r)q\in B(p,r) in Rn+1\mathbb{R}^{n+1} (Open Ball in a Metric Space (ii)). But q∉Eq\notin E, since its second entry f(x)−r/2f(x)-r/2 is less than f(x)f(x). So no open ball about pp lies in EE, and p∉int⁡Ep\notin\operatorname{int}E by Interior of a Subset of a Metric Space (ii).

By The Supporting Hyperplane Theorem in Rn\mathbb{R}^n (i), with n+1n+1 in place of nn, applied to EE and pp, there is w∈Sw\in\mathbb{S} (so ∥w∥=1\lVert w\rVert=1) with w⋅e≤w⋅pw\cdot e\le w\cdot p for every e∈Ee\in E. Write w=(b,β)w=(b,\beta) with b∈Rnb\in\mathbb{R}^{n} and β∈R\beta\in\mathbb{R}. Then ∥b∥2+β2=1\lVert b\rVert^{2}+\beta^{2}=1 and

b⋅y+βμ≤b⋅x+βf(x)for every (y,μ)∈E.(1)b\cdot y+\beta\mu\le b\cdot x+\beta f(x)\qquad\text{for every }(y,\mu)\in E. \tag{1}

We show that β<0\beta<0. The point (x,f(x)+1)(x,f(x)+1) lies in EE, and (1) gives β(f(x)+1)≤βf(x)\beta(f(x)+1)\le\beta f(x), that is, β≤0\beta\le0. Suppose that β=0\beta=0. Then ∥b∥=1\lVert b\rVert=1, and (1) with μ=f(y)\mu=f(y) gives b⋅y≤b⋅xb\cdot y\le b\cdot x for every y∈Cy\in C. Since xx is an interior point of CC, Interior of a Subset of a Metric Space (i) gives a real ρ>0\rho>0 with B(x,ρ)⊆CB(x,\rho)\subseteq C. The point y=x+(ρ/2)by=x+(\rho/2)b satisfies dE(x,y)=(ρ/2)∥b∥=ρ/2<ρd_{E}(x,y)=(\rho/2)\lVert b\rVert=\rho/2<\rho (Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (ii), Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v)), so y∈Cy\in C; but

b⋅y=b⋅x+(ρ/2)∥b∥2=b⋅x+ρ/2>b⋅x,b\cdot y=b\cdot x+(\rho/2)\lVert b\rVert^{2}=b\cdot x+\rho/2>b\cdot x,

a contradiction. Hence β<0\beta<0.

Finally let a=(−1/β) ba=(-1/\beta)\,b. For y∈Cy\in C the point (y,f(y))(y,f(y)) lies in EE, and (1) gives β(f(y)−f(x))≤− b⋅(y−x)\beta\bigl(f(y)-f(x)\bigr)\le-\,b\cdot(y-x). Dividing by −β>0-\beta>0,

f(y)≥f(x)+a⋅(y−x)for every y∈C.f(y)\ge f(x)+a\cdot(y-x)\qquad\text{for every }y\in C.

So aa is a subgradient of ff at xx, hence a∈∂f(x)a\in\partial f(x) by Subgradients and the Subdifferential of a Real-Valued Function on a Subset of Rn\mathbb{R}^n (ii), and ∂f(x)≠∅\partial f(x)\neq\emptyset.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…