New and Old Observations About Morrey's Quasi-Convexity

-
Vladimir Sverak , University of Minnesota
IAS - Simonyi Hall 101

Let M(n,m) denote the real m×n matrices. A continuous function f:M(n,m)\R is called {\it Morrey quasi-convex} if \Rn(f(A+\vf(x))f(A))dx0 for each smooth, compactly supported \vf:\Rn\Rm and each AM(n,m). The inequality can be interpreted as a stability requirement for variational integrals \Omf(u(x))dx, and with some natural assumptions it is equivalent to the weak lower semi-continuity of the corresponding functional, as proved by Ch.\ B.\ Morrey in the early 1950s. A simple necessary condition for the quasi-convexity is that f be convex along lines tA+tB with A,BM(n,m) and rankB=1. For smooth functions f, the strict form of this {\it rank-one convexity} condition corresponds to the classical ellipticity  (the {\it Legendre-Hadamard condition}) for the associated Euler-Lagrange equation. An easy sufficient condition for the quasi-convexity is {\it polyconvexity} --- the possibility of expressing f(X) as a convex function of the minors of X. For m=1 or n=1 all these notions reduce to standard convexity, but when n,m2 the relations between the various notions of convexity become interesting. 

It is known that the rank-one convexity of f is not sufficient for the quasi-convexity when n2 and m3, but the situation with n2 and m=2 remains open. It was observed by several authors that the problem of optimal constants in the Lp estimates for the complex Hilbert transform (with p>1) is a special case. The geometry related to the various convexity notions can also be used for constructing examples relevant to the regularity theory of the variational integrals above.

This talk will discuss some of these topics, including possible linear programming experiments aimed at investigating the validity of some of the unresolved inequalities.