Polyconvex function

In the calculus of variations, the notion of polyconvexity is a generalization of the notion of convexity for functions defined on spaces of matrices. The notion of polyconvexity was introduced by John M. Ball as a sufficient conditions for proving the existence of energy minimizers in nonlinear elasticity theory. It is satisfied by a large class of hyperelastic stored energy densities, such as Mooney-Rivlin and Ogden materials. The notion of polyconvexity is related to the notions of convexity, quasiconvexity and rank-one convexity through the following diagram:

f convex⟹f polyconvex⟹f quasiconvex⟹f rank-one convex

Motivation

Let Ω⊂ℝn be an open bounded domain, u:Ω→ℝm and W1,p(Ω,ℝm) denote the Sobolev space of mappings from Ω to ℝm. A typical problem in the calculus of variations is to minimize a functional, E:W1,p(Ω,ℝm)→ℝ of the form

E[u]=∫Ωf(x,∇u(x))dx,

where the energy density function, f:Ω×ℝm×n→[0,∞) satisfies p-growth, i.e., |f(x,A)|≤M(1+|A|p) for some M>0 and p∈(1,∞). It is well-known from a theorem of Morrey and Acerbi-Fusco that a necessary and sufficient condition for E to be weakly lower-semicontinuous on W1,p(Ω,ℝm) is that f(x,⋅) is quasiconvex for almost every x∈Ω. With coercivity assumptions on f and boundary conditions on u, this leads to the existence of minimizers for E on W1,p(Ω,ℝm). However, in many applications, the assumption of p-growth on the energy density is often too restrictive. In the context of elasticity, this is because the energy is required to grow unboundedly to +∞ as local measures of volume approach zero. This led Ball to define the more restrictive notion of polyconvexity to prove the existence of energy minimizers in nonlinear elasticity.

Definition

A function f:ℝm×n→ℝ is said to be polyconvex if there exists a convex function Φ:ℝτ(m,n)→ℝ such that

f(F)=Φ(T(F))

where T:ℝm×n→ℝτ(m,n) is such that

T(F):=(F,adj2(F),...,adjm∧n(F)).

Here, adjs stands for the matrix of all s×s minors of the matrix F∈ℝm×n, 2≤s≤m∧n:=min⁡(m,n) and

τ(m,n):=∑s=1m∧nσ(s),

where σ(s):=(ms)(ns).

When m=n=2, T(F)=(F,det⁡F) and when m=n=3, T(F)=(F,cofF,det⁡F), where cofF denotes the cofactor matrix of F.

In the above definitions, the range of f can also be extended to ℝ∪{+∞}.

Properties

f(F)≤α(1+|F|p) for every F∈ℝm×n, then f is convex.

Examples

f(A)={1det⁡(A),det⁡(A)>0;+∞,det⁡(A)≤0;