Daniel M. Oberlin Department of Mathematics, Florida State University. May 2004

Similar documents
Separation Properties for Locally Convex Cones

1 Norms and Vector Spaces

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

DISINTEGRATION OF MEASURES

Extremal equilibria for reaction diffusion equations in bounded domains and applications.

Mathematics Course 111: Algebra I Part IV: Vector Spaces

The Ideal Class Group

Inner Product Spaces

ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction

Reference: Introduction to Partial Differential Equations by G. Folland, 1995, Chap. 3.

Chapter 5. Banach Spaces

and s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

Duality of linear conic problems

Differentiating under an integral sign

The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line

A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang

1. Prove that the empty set is a subset of every set.

1 if 1 x 0 1 if 0 x 1

t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

Convex analysis and profit/cost/support functions

2.3 Convex Constrained Optimization Problems

Notes on metric spaces

Properties of BMO functions whose reciprocals are also BMO

The Mean Value Theorem

MATH 425, PRACTICE FINAL EXAM SOLUTIONS.

How To Prove The Dirichlet Unit Theorem

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Tail inequalities for order statistics of log-concave vectors and applications

Solutions of Equations in One Variable. Fixed-Point Iteration II

Lecture 7: Finding Lyapunov Functions 1

4.5 Linear Dependence and Linear Independence

CHAPTER IV - BROWNIAN MOTION

x a x 2 (1 + x 2 ) n.

TOPIC 4: DERIVATIVES

Rate of convergence towards Hartree dynamics

Fixed Point Theorems

How To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra

Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand

MA651 Topology. Lecture 6. Separation Axioms.

BANACH AND HILBERT SPACE REVIEW

Metric Spaces. Chapter Metrics

Scalar Valued Functions of Several Variables; the Gradient Vector

No: Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

Numerical Verification of Optimality Conditions in Optimal Control Problems

Lecture Notes 10

Vector and Matrix Norms

An optimal transportation problem with import/export taxes on the boundary

Extension of measure

THE CENTRAL LIMIT THEOREM TORONTO

Metric Spaces. Chapter 1

The sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].

Gambling Systems and Multiplication-Invariant Measures

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

Shape Optimization Problems over Classes of Convex Domains

NOTES ON LINEAR TRANSFORMATIONS

Error Bound for Classes of Polynomial Systems and its Applications: A Variational Analysis Approach

LEARNING OBJECTIVES FOR THIS CHAPTER

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

GROUPS ACTING ON A SET

The Heat Equation. Lectures INF2320 p. 1/88

ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction

MEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich

MATHEMATICAL METHODS OF STATISTICS

University of Ostrava. Fuzzy Transforms

I. Pointwise convergence

Mathematical Methods of Engineering Analysis

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

Section Inner Products and Norms

Real Roots of Univariate Polynomials with Real Coefficients

Online Learning, Stability, and Stochastic Gradient Descent

1. Let X and Y be normed spaces and let T B(X, Y ).

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Rolle s Theorem. q( x) = 1

T ( a i x i ) = a i T (x i ).

Finite dimensional topological vector spaces

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

DEFINABLE TYPES IN PRESBURGER ARITHMETIC

3. INNER PRODUCT SPACES

Adaptive Online Gradient Descent

Date: April 12, Contents

1 Local Brouwer degree

0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup

Math 4310 Handout - Quotient Vector Spaces

UNIVERSITETET I OSLO

Lectures 5-6: Taylor Series

Ideal Class Group and Units

Cost Minimization and the Cost Function

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Walrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.

Quotient Rings and Field Extensions

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

General Theory of Differential Equations Sections 2.8, , 4.1

BIG DATA PROBLEMS AND LARGE-SCALE OPTIMIZATION: A DISTRIBUTED ALGORITHM FOR MATRIX FACTORIZATION

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x

Transcription:

THE SECOND DERIVATIVE OF A CONVEX FNCTION Daniel M. Oberlin Department of Mathematics, Florida State niversity May 004 Suppose f is a convex function on an open interval I. The following facts are well known and easy to verify: (a the second (distributional derivative of f is a nonnegative locally finite Borel measure on I, and any such measure is the second derivative of a convex function f which is unique up to the addition of an affine function; (b it follows from (a that (1 f, φ 0 whenever φ Cc (I is nonnegative; conversely, if f is a distribution on I which satisfies (1, then f is a convex function. The purpose of this note is to describe certain analogues of these facts for functions of several variables and then to prove Theorem below. Thus let be a convex open subset of R n. Suppose f is a convex function on. Then, as a continuous function, f defines a distribution on. The derivatives of f mentioned below are to be interpreted in that sense. In particular, the second derivative D f is the Hessian matrix of distributions on whose entries are the second-order partial derivatives f xix j of f. Let B 0 ( be the collection of all Borel sets E having compact closures contained in. An analogue of (a is Theorem 1. Suppose f is convex on. For 1 i, j n there are real-valued set functions µ ij : B 0 ( C which are complex measures on any compact subset of. For all φ C 0 ( and k = 1,, n, the µ ij satisfy the equations ( f xix j, φ = µ ij, φ, (3 µ ij, φ xk = µ ik, φ xj. Further, the symmetric matrix µ(e = ( µ ij (E is positive definite for all E B 0 (. Conversely, if µ = (µ ij 1 Typeset by AMS-TEX

DANIEL M. OBERLIN is such a (positive definite matrix valued set function, then there is a convex function f on with D f = µ. Such an f is unique up to the addition of an affine function. The following analogue of (b is a corollary of Theorem 1. Corollary. Suppose f is a distribution on satisfying f xix j, φ i φ j 0 whenever φ i C 0 (. Then f is a convex function on. More interestingly, there is a lower bound on the Hausdorff dimension of the support of D f for nontrivial convex functions f: Theorem. With D f = µ as above, if µ is supported on a Borel set having Hausdorff dimension less than n 1, then f is affine. To begin the proofs, suppose that η is a nonnegative and radial C function supported in B(0, 1 and having integral 1. With η ɛ (x = ɛ n η(x/n for ɛ > 0 and for ρ a distribution on, let ρ ɛ = η ɛ ρ be the usual ɛ-mollification of ρ, a distribution acting on those φ C 0 ( whose support is distant at least ɛ from. Proof of Theorem 1: Suppose that f is convex on. Fix an open V such that V has compact closure contained in and choose ɛ 0 > 0 such that V + B(0, 3ɛ 0. Then if 0 < ɛ < ɛ 0, f ɛ is convex and C on V. Suppose ψ C0 is nonnegative, identically 1 on V, and supported in V + B(0, ɛ 0. Since 0 as ɛ 0, the nonnegative measures V fx ɛ ix i (x dx fx ɛ ix i (xψ(xdx = f ɛ (xψ xix i (x dx f(xψ xix i (x dx χ V (xf ɛ x ix i (x dx have uniformly bounded total variations on V. Since fx ɛ ix j fx ɛ ix i 1/ fx ɛ jx j 1/ f x ɛ ix i + fx ɛ jx j, the same is true for the complex measures χ V (xf ɛ x ix j (x dx. Taking weak* its gives complex measures µ ij on V satisfying ( and (3 if φ C0 (V. Letting V then yields the set functions µ ij whose existence is

THE SECOND DERIVATIVE OF A CONVEX FNCTION 3 the first claim of Theorem. (The statement about the positive definite character of µ(e follows from V f ɛ x ix j (xφ i (xφ j (x dx 0 and a it argument. Suppose now that µ = ( µ ij is as in Theorem. Suppose that V and ɛ0 are as above and suppose additionally that V is C 1. Fix i, j = 1,..., n. For ɛ < ɛ 0, the C functions µ ɛ ij have uniformly bounded L1 (V + B(0, ɛ norms (since the set functions µ ij are complex measures on V + B(0, ɛ 0. The conditions (3 and the symmetry of µ imply that there are C functions f ɛ on V + B(0, ɛ 0 with f ɛ x i x j = µ ɛ ij. The Poincaré-Sobolev inequalities and the uniform bounds on µ ɛ ij L 1 (V +B(0,ɛ 0 show that there is q = q(n > 1 such that the functions f ɛ can be chosen to have f ɛ L q (V +B(0,ɛ 0 C for some positive C independent of ɛ. Passing to a subsequence which converges weakly in L q (V + B(0, ɛ 0 shows that there is f L q (V + B(0, ɛ 0 satisfying (4 f x i x j = µ ij (in the sense of distributions on V + B(0, ɛ 0. To check that f is equal a.e. to a convex function on V, we begin by noting that, for 0 < ɛ < ɛ 0, (4 and the positive definite assumption on µ show that the mollifications f ɛ are convex on V. The formula g (0 = 1 Σ n 1 0 r η(rσ r d dt g(tσrn 1 dr dσ + g(0 for the -mollification of a twice differentiable function g at 0 shows that -mollifications of twice differentiable convex functions decrease pointwise as 0. In particular, if B(x, V and 0 < < 0, this applies to (f ɛ (x for each ɛ and so, in the it as ɛ 0, to f (x. If 0 f (x = held for any x V, it would follow from convexity that f L 0 q (V. Thus the decreasing it 0 f (x

4 DANIEL M. OBERLIN gives a realization of f as a convex function on V. Now suppose that Ṽ satisfies the same hypotheses as V and is such that V Ṽ. Then the argument above yields a convex function f on Ṽ satisfying (4 on Ṽ. Such an f can be adjusted by the addition of an affine function to agree with f on V. Considering a sequence V 1 V of such open sets with V n = furnishes a convex f on satisfying D f = µ on. Since such an f is clearly unique up to the addition of an affine function, the proof of Theorem 1 is complete. Proof of Corollary: If f is a distribution on satisfying the hypothesis, then it is clear that each f xix i is nonnegative and therefore realizable as a nonnegative Borel measure µ ii on. The hypothesis also implies that f xix j, φ ζ i ζ j 0 for all real numbers ζ 1,..., ζ n whenever φ C 0 (. It follows that f xix j, φ f x ix i, φ + f xjx j, φ = µ ii, φ + µ jj, φ for φ C 0 (. This implies that each f xix j is realizable as a complex Borel measure µ ij on each open and bounded V. Thus the desired result follows from Theorem 1. Proof of Theorem : It follows from the proof of Theorem 1 that if f is convex on, each of the distributions f xj is realizable as a function on. Thus Theorem can be proved by applying the following result to each f xj : Lemma 1. Suppose the locally integrable function g on has the property that each of the distributions g xj is realized by a Borel measure µ j supported on a set of Hausdorff dimension less than n 1. Then g is equal a.e. to a constant function. The proof depends on a simple fact: Lemma. Suppose E R n is a set of Hausdorff dimension less than n 1. Then the n-dimensional Lebesgue measure of is 0. t>0 ( te Proof of Lemma : The mapping π : x x x is Lipschitz on E. = E { < x < 1/} for each > 0. Thus π(e has (n 1-dimensional measure 0 in Σ n 1 and the desired result follows by integrating in polar coordinates. Proof of Lemma 1: Assume without loss generality that 0 and that gɛ (0 = g(0.

THE SECOND DERIVATIVE OF A CONVEX FNCTION 5 This is possible since the local integrability of g implies that gɛ (x = g(x for a.e. x. If h is C 1 on and x, then leads to h(x = 1 0 x j h xj (xt dt + h(0 h(xφ(x dx = h(0 φ(x dx + for φ C 0 ( and = (φ > 0. Thus [ g ɛ (0 φ(x dx + Letting φ t (x = φ(x/t, we have uniformly for t 1 and so 1 g, φ = g ɛ, φ = 1 φ( x t n φ( x t n gx ɛ j (xx j φ t (x dx = g xj, x j φ t (5 g, φ = ( g ɛ (0 φ(x dx + 1 x j h xj (x dt dx tn+1 x j g ɛ x j (x dt t n+1 dx]. φ( x t n x j g xj (x dt dx. tn+1 If E is a set of Hausdorff dimension less than n 1 which supports each of the measures g xj, then (5 implies that g, φ = ( g ɛ (0 φ(x dx + φ(x dν(x where the measure ν is supported on the set t>0 ( te. By Lemma, that set has Lebesgue measure 0. Since g is a locally integrable function, it must be the case that ν = 0, and Lemma 1 follows.