- Source: Quasiconvexity (calculus of variations)
In the calculus of variations, a subfield of mathematics, quasiconvexity is a generalisation of the notion of convexity. It is used to characterise the integrand of a functional and related to the existence of minimisers. Under some natural conditions, quasiconvexity of the integrand is a necessary and sufficient condition for a functional
F
:
W
1
,
p
(
Ω
,
R
m
)
→
R
u
↦
∫
Ω
f
(
x
,
u
(
x
)
,
∇
u
(
x
)
)
d
x
{\displaystyle {\mathcal {F}}:W^{1,p}(\Omega ,\mathbb {R} ^{m})\rightarrow \mathbb {R} \qquad u\mapsto \int _{\Omega }f(x,u(x),\nabla u(x))dx}
to be lower semi-continuous in the weak topology, for a sufficient regular domain
Ω
⊂
R
d
{\textstyle \Omega \subset \mathbb {R} ^{d}}
. By compactness arguments (Banach–Alaoglu theorem) the existence of minimisers of weakly lower semicontinuous functionals may then follow from the direct method.
This concept was introduced by Morrey in 1952. This generalisation should not be confused with the same concept of a quasiconvex function which has the same name.
Definition
A locally bounded Borel-measurable function
f
:
R
m
×
d
→
R
{\textstyle f:\mathbb {R} ^{m\times d}\rightarrow \mathbb {R} }
is called quasiconvex if
∫
B
(
0
,
1
)
(
f
(
A
+
∇
ψ
(
x
)
)
−
f
(
A
)
)
d
x
≥
0
{\displaystyle \int _{B(0,1)}{\bigl (}f(A+\nabla \psi (x))-f(A){\bigr )}dx\geq 0}
for all
A
∈
R
m
×
d
{\displaystyle A\in \mathbb {R} ^{m\times d}}
and all
ψ
∈
W
0
1
,
∞
(
B
(
0
,
1
)
,
R
m
)
{\displaystyle \psi \in W_{0}^{1,\infty }(B(0,1),\mathbb {R} ^{m})}
, where B(0,1) is the unit ball and
W
0
1
,
∞
{\displaystyle W_{0}^{1,\infty }}
is the Sobolev space of essentially bounded functions with essentially bounded derivative and vanishing trace.
Properties of quasiconvex functions
The domain B(0,1) can be replaced by any other bounded Lipschitz domain.
Quasiconvex functions are locally Lipschitz-continuous.
In the definition the space
W
0
1
,
∞
{\displaystyle W_{0}^{1,\infty }}
can be replaced by periodic Sobolev functions.
Relations to other notions of convexity
Quasiconvexity is a generalisation of convexity for functions defined on matrices, to see this let
A
∈
R
m
×
d
{\displaystyle A\in \mathbb {R} ^{m\times d}}
and
V
∈
L
1
(
B
(
0
,
1
)
,
R
m
)
{\displaystyle V\in L^{1}(B(0,1),\mathbb {R} ^{m})}
with
∫
B
(
0
,
1
)
V
(
x
)
d
x
=
0
{\displaystyle \int _{B(0,1)}V(x)dx=0}
. The Riesz-Markov-Kakutani representation theorem states that the dual space of
C
0
(
R
m
×
d
)
{\displaystyle C_{0}(\mathbb {R} ^{m\times d})}
can be identified with the space of signed, finite Radon measures on it. We define a Radon measure
μ
{\displaystyle \mu }
by
⟨
h
,
μ
⟩
=
1
|
B
(
0
,
1
)
|
∫
B
(
0
,
1
)
h
(
A
+
V
(
x
)
)
d
x
{\displaystyle \langle h,\mu \rangle ={\frac {1}{|B(0,1)|}}\int _{B(0,1)}h(A+V(x))dx}
for
h
∈
C
0
(
R
m
×
d
)
{\displaystyle h\in C_{0}(\mathbb {R} ^{m\times d})}
. It can be verified that
μ
{\displaystyle \mu }
is a
probability measure and its barycenter is given
[
μ
]
=
⟨
id
,
μ
⟩
=
A
+
∫
B
(
0
,
1
)
V
(
x
)
d
x
=
A
.
{\displaystyle [\mu ]=\langle \operatorname {id} ,\mu \rangle =A+\int _{B(0,1)}V(x)dx=A.}
If h is a convex function, then Jensens' Inequality gives
h
(
A
)
=
h
(
[
μ
]
)
≤
⟨
h
,
μ
⟩
=
1
|
B
(
0
,
1
)
|
∫
B
(
0
,
1
)
h
(
A
+
V
(
x
)
)
d
x
.
{\displaystyle h(A)=h([\mu ])\leq \langle h,\mu \rangle ={\frac {1}{|B(0,1)|}}\int _{B(0,1)}h(A+V(x))dx.}
This holds in particular if V(x) is the derivative of
ψ
∈
W
0
1
,
∞
(
B
(
0
,
1
)
,
R
m
×
d
)
{\displaystyle \psi \in W_{0}^{1,\infty }(B(0,1),\mathbb {R} ^{m\times d})}
by the generalised Stokes' Theorem.
The determinant
det
R
d
×
d
→
R
{\displaystyle \det \mathbb {R} ^{d\times d}\rightarrow \mathbb {R} }
is an example of a quasiconvex function, which is not convex. To see that the determinant is not convex, consider
A
=
(
1
0
0
0
)
and
B
=
(
0
0
0
1
)
.
{\displaystyle A={\begin{pmatrix}1&0\\0&0\\\end{pmatrix}}\quad {\text{and}}\quad B={\begin{pmatrix}0&0\\0&1\\\end{pmatrix}}.}
It then holds
det
A
=
det
B
=
0
{\displaystyle \det A=\det B=0}
but for
λ
∈
(
0
,
1
)
{\displaystyle \lambda \in (0,1)}
we have
det
(
λ
A
+
(
1
−
λ
)
B
)
=
λ
(
1
−
λ
)
>
0
=
max
(
det
A
,
det
B
)
{\displaystyle \det(\lambda A+(1-\lambda )B)=\lambda (1-\lambda )>0=\max(\det A,\det B)}
. This shows that the determinant is not a quasiconvex function like in Game Theory and thus a distinct notion of convexity.
In the vectorial case of the Calculus of Variations there are other notions of convexity. For a function
f
:
R
m
×
d
→
R
{\displaystyle f:\mathbb {R} ^{m\times d}\rightarrow \mathbb {R} }
it holds that
f
convex
⇒
f
polyconvex
⇒
f
quasiconvex
⇒
f
rank-1-convex
.
{\displaystyle f{\text{ convex}}\Rightarrow f{\text{ polyconvex}}\Rightarrow f{\text{ quasiconvex}}\Rightarrow f{\text{ rank-1-convex}}.}
These notions are all equivalent if
d
=
1
{\displaystyle d=1}
or
m
=
1
{\displaystyle m=1}
. Already in 1952, Morrey conjectured that rank-1-convexity does not imply quasiconvexity. This was a major unsolved problem in the Calculus of Variations, until Šverák gave an counterexample in 1993 for the case
d
≥
2
{\displaystyle d\geq 2}
and
m
≥
3
{\displaystyle m\geq 3}
.
The case
d
=
2
{\displaystyle d=2}
or
m
=
2
{\displaystyle m=2}
is still an open problem, known as Morrey's conjecture.
Relation to weak lower semi-continuity
Under certain growth condition of the integrand, the sequential weakly lower semi-continuity (swlsc) of an integral functional in an appropriate Sobolev space is equivalent to the quasiconvexity of the integrand. Acerbi and Fusco proved the following theorem:
Theorem: If
f
:
R
d
×
R
m
×
R
d
×
m
→
R
,
(
x
,
v
,
A
)
↦
f
(
x
,
v
,
A
)
{\displaystyle f:\mathbb {R} ^{d}\times \mathbb {R} ^{m}\times \mathbb {R} ^{d\times m}\rightarrow \mathbb {R} ,(x,v,A)\mapsto f(x,v,A)}
is Carathéodory function and
it holds
0
≤
f
(
x
,
v
,
A
)
≤
a
(
x
)
+
C
(
|
v
|
p
+
|
A
|
p
)
{\displaystyle 0\leq f(x,v,A)\leq a(x)+C(|v|^{p}+|A|^{p})}
. Then the functional
F
[
u
]
=
∫
Ω
f
(
x
,
u
(
x
)
,
∇
u
(
x
)
)
d
x
{\displaystyle {\mathcal {F}}[u]=\int _{\Omega }f(x,u(x),\nabla u(x))dx}
is swlsc in the Sobolev Space
W
1
,
p
(
Ω
,
R
m
)
{\displaystyle W^{1,p}(\Omega ,\mathbb {R} ^{m})}
with
p
>
1
{\displaystyle p>1}
if and only if
f
{\displaystyle f}
is quasiconvex. Here
C
{\displaystyle C}
is a positive constant and
a
(
x
)
{\displaystyle a(x)}
an integrable function.
Other authors use different growth conditions and different proof conditions. The first proof of it was due to Morrey in his paper, but he required additional assumptions.
References
Kata Kunci Pencarian:
- Quasiconvexity (calculus of variations)
- Direct method in the calculus of variations
- Cristiana De Filippis
- Vladimír Šverák
- Polyconvex function
- Pseudoconvex function
- Charles B. Morrey Jr.
- Lawrence C. Evans
- Paolo Marcellini
- Mathematical optimization
