This site utilises several optional online services that might collect information about you. By continuing visiting this site (whether or not you dismiss this dialog), you acknowledge that you accept our privacy notice.
Nyuwa, the mother goddess of Chinese mythology, mends the sky according to an ancient Chinese legend. Today, Nyuwa is asked to mend the epigraph of a continuous function over an open set so that the function becomes convex. What can we say about this?
Let K⊆Rn be non-empty, convex and open. Let f:K→R be continuous. Its biconjugate, or the convex envelope, is
f∗∗(x)=g affine∀y∈K:g(y)≤f(y)supg(x).
The convex envelope of a function is the largest convex function that lower bounds it. The convex envelope can also be characterized using the epigraphs. The epigraph of a function is
epi(f)={(x,y)∣y≥f(x)},
i.e., everything above the function’s graph. Taking the convex envelope of a function turns its epigraph into the closed convex hull, i.e., epi(f∗∗)=Conv(epi(f)). See the figure below for a classical illustration.
We can imagine Nyuwa is mending the epigraph of a function to make it closed and convex with the least effort. In the illustration, ‘where the function is not convex’, it is replaced with a segment, or an affine function. It is tempting to assume that anywhere a continuous function does not agree with its convex envelope, it is affine within some neighbourhood, which is not generally true for 2- or higher-dimensional spaces. The correct generalisation is that the convex conjugate will be affine on some segment of the domain.
Proposition Suppose f:K→R (K is a convex and open subset of some Euclidean space) is continuous and has its biconjugate f∗∗ defined everywhere in K. If f∗∗ is strictly convex, then f=f∗∗.
Remarks The assumption of f being continuous simplifies the exposition. This requirement can be relaxed to f being lower semi-continuous. However, completely removing the assumption falsifies the conclusion. For example, the function
f(x)={1,x2,x=0;x̸=0;
has convex envelope x2 and they do not agree at 0, yet the convex envelope cannot be affine within any open set. The fault is due to f not being lower semi-continuous at 0.
Corollary Using the same notations, if f is not convex, then its biconjugate f∗∗ must be affine on some segment. In other words, it always suffices to just make any non-convex function non-strictly convex, and Nyuwa will not waste her effort.
Remarks The strict convexities of such a function and its biconjugate are equivalent. The other direction isn’t particulary interesting, because we know f∗∗=f if f is ‘already’ convex.
Proof We prove by contradiction. Suppose f(y)̸=f∗∗(y) for some y∈K. Define
ε=21(f(y)−f∗∗(y))>0.
Note that f−f∗∗ is continuous in K, therefore, there exists some δ>0 such that f(x)−f∗∗(x)>ε whenever ∣x−y∣<2δ.
Let g be a supporting hyperplane of f∗∗ at y. Since f∗∗ is strictly convex, we have f∗∗(x)−g(x)>0 whenever ∣x−y∣=δ. The sphere centered at y with radius δ is compact and is a subset of K, whence the function f∗∗−g has positive minimum, say s, over that sphere.
Write t=min{ε,s}>0. Consider any x∈K. If ∣x−y∣<δ, we have
f(x)>f∗∗(x)+ε≥g(x)+t.
Otherwise, ∣x−y∣≥δ, let λ=∣x−y∣δ≤1 and z=y+λ(x−y). Note that ∣z−y∣=δ. By the convexity of f∗∗−g and that f∗∗(y)=g(y), we have
f(x)−g(x)≥f∗∗(x)−g(x)≥λ(f∗∗(x)−g(x))=λ(f∗∗(x)−g(x))+(1−λ)(f∗∗(y)−g(y))≥f∗∗(z)−g(z)≥s≥t.
Summarised, f(x)≥g(x)+t for all x∈K. Since the biconjugate takes a supremum,
f∗∗(y)≥g(y)+t=f∗∗(y)+t,
but t>0. →∥
Please enable JavaScript to view the comments powered by Disqus.