1 Introduction
In this paper, we study the exterior Dirichlet problem of the Hessian quotient equation
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn1.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn2.png?pub-status=live)
where
$n\geq 2$
,
$0\leq l<k\leq n$
,
$\Omega $
is a smooth, bounded, strictly convex open set in
${\mathbb R}^{n}$
,
$\phi \in C^2(\partial \Omega )$
,
$0<g\in C^{0}(\mathbb {R}^{n}\backslash \Omega )$
,
$S_0(D^2u):=\sigma _0(\lambda (D^2u)):=1$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu1.png?pub-status=live)
denotes the jth elementary symmetric function of
$\lambda (D^2u)=(\lambda _1,\lambda _2,\dots ,\lambda _n)$
, the eigenvalues of the Hessian matrix of u.
Equation (1.1) has received a lot of attentions since the classical work of Caffarelli, Nirenberg, and Spruck [Reference Caffarelli, Nirenberg and Spruck7] and Trudinger [Reference Trudinger22]. For
$l=0$
, it is the k-Hessian equation. In particular, if
$k=1$
, it is the Poisson equation, while it is the Monge–Ampère equation if
$k=n$
. For
$n=k=3$
and
$l=1$
, it is the special Lagrangian equation which is closely connected with geometric problems: If u satisfies
$\mbox {det} D^2u=\Delta u$
in
$\mathbb {R}^3$
, then the graph of
$Du$
in
$\mathbb {C}^3$
is a special Lagrangian submanifold, that is, its mean curvature vanishes everywhere and the complex structure on
$\mathbb {C}^3$
sends the tangent space of the graph to the normal space at every point.
A classical theorem of Jörgens (
$n=2$
) [Reference Jörgens15], Calabi (
$n\leq 5$
) [Reference Calabi8], and Pogorelov (
$n\geq 2$
) [Reference Pogorelov21] states that any convex classical solution of
$\det D^2u=1$
in
$\mathbb {R}^n$
must be a quadratic polynomial. Caffarelli and Li [Reference Caffarelli and Li6] extended the Jörgens–Calabi–Pogorelov theorem and studied the existence of solutions of Monge–Ampère equations in exterior domains with prescribed asymptotic behavior. They proved that for
$n\geq 3$
, given any
$b\in \mathbb {R}^n$
and any
$n\times n$
real symmetric positive definite matrix A with
$\det A=1$
, there exists some constant
$c^*$
depending on n,
$\Omega $
,
$\phi $
, b, and A such that for every
$c>c^*$
, the Monge–Ampère equation
$\det D^2u=1$
in
${\mathbb R}^{n}\setminus \bar {\Omega }$
with the Dirichlet boundary condition (1.2) and the following prescribed asymptotic behavior at infinity
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn3.png?pub-status=live)
admits a unique viscosity solution
$u\in C^{\infty }(\mathbb {R}^n\setminus \bar {\Omega })\cap C^0(\mathbb {R}^n\setminus \Omega )$
. Based on this work, Li and Lu [Reference Li and Lu19] completed the characterization of the existence and non-existence of solutions in terms of the above asymptotic behaviors. For more results concerning the exterior Dirichlet problem for Monge–Ampère equations, we refer to [Reference Bao and Li1, Reference Bao, Li and Zhang3–Reference Bao, Xiong and Zhou5, Reference Hong13] and the references therein.
After the work of Caffarelli and Li [Reference Caffarelli and Li6], there have been extensive studies on the existence of fully nonlinear elliptic equations in exterior domains.
For the exterior Dirichlet problem of the Hessian equations, Dai and Bao [Reference Dai and Bao12] first obtained the existence of solutions satisfying the asymptotic behavior (1.3) with
$A=(1/\binom {n}{k})^{\frac {1}{k}}I$
. Later on, Bao, Li, and Li [Reference Bao, Li and Li2] proved that for
$n\geq 3$
, given any
$b\in \mathbb {R}^n$
and any
$n\times n$
real symmetric positive definite matrix A with
$S_{k}(A)=1$
, there exists some constant
$c^*$
depending on n,
$\Omega $
,
$\phi $
, b, and A such that for every
$c>c^*$
, the Hessian equation
$S_k(D^2u)=1$
in
${\mathbb R}^{n}\setminus \bar {\Omega }$
with the Dirichlet boundary condition (1.2) and the following prescribed asymptotic behavior at infinity
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu2.png?pub-status=live)
admits a unique viscosity solution
$u\in C^{\infty }(\mathbb {R}^n\setminus \bar {\Omega })\cap C^0(\mathbb {R}^n\setminus \Omega )$
, where
$\theta \in [\frac {k-2}{n-2},1]$
is a constant depending on
$n, k$
, and A. For more results concerning the exterior Dirichlet problem for Hessian equations, we refer to [Reference Cao and Bao9, Reference Dai10] and the references therein.
For the exterior Dirichlet problem of the Hessian quotient equation (1.1) with
$g\equiv 1$
and the Dirichlet boundary condition (1.2), Dai [Reference Dai11] first obtained the existence of solutions with asymptotic behavior
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu3.png?pub-status=live)
where
$n\geq 3$
,
$\bar {c}=(\binom {n}{l}/\binom {n}{k})^{\frac {1}{k-l}}$
, and
$k-l\geq 3$
. Subsequently, Li and Dai [Reference Li and Dai17] obtained the existence result for the case
$k-l=1$
and
$k-l=2$
. Later on, Li and Li [Reference Li and Li16] proved that for
$n\geq 3$
and, given any
$b\in \mathbb {R}^n$
and any A in the set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu4.png?pub-status=live)
with
$\frac {k-l}{\overline {t}_k-\underline {t}_l}>2$
, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn4.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn5.png?pub-status=live)
there exists some constant
$c^*$
depending on n, k, l,
$\Omega $
,
$\phi $
, b, and A such that for every
$c>c^*$
, the Hessian equation
$S_k(D^2u)/S_{l}(D^{2}u)=1$
in
${\mathbb R}^{n}\setminus \bar {\Omega }$
with the Dirichlet boundary condition (1.2) and the following prescribed asymptotic behavior at infinity
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu5.png?pub-status=live)
admits a unique viscosity solution
$u\in C^0(\mathbb {R}^n\setminus \Omega )$
, where
$m\in (2,n]$
is a constant depending on
$n, k$
, l, and A. Recently, we have just learned that Jiang, Li, and Li [Reference Jiang, Li and Li14] generalized this result to
$g=1+O(r^{-\beta })$
with
$\beta>2$
. For more results concerning the exterior Dirichlet problem for Hessian equations, we refer to [Reference Li, Li and Zhao18] and the references therein.
Our paper consists of two parts. In the first part, we obtain the necessary and sufficient conditions on the existence of radially symmetric solutions of the exterior Dirichlet problem of Hessian quotient equations.
Before stating our result of the first part, we first give the definition of k-convex functions. For
$k=1$
,
$2$
,
$\dots $
, n, we say a
$C^{2}$
function u defined in a domain is k-convex (uniformly k-convex), if
$\lambda (D^{2}u)\in \bar {\Gamma }_{k}$
(
$\Gamma _{k}$
), where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu6.png?pub-status=live)
In particular, a uniformly n-convex function is a convex function. Note that (1.1) is elliptic for uniformly k-convex functions.
For
$n\geq 3$
, consider the following problem:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn6.png?pub-status=live)
where
$B_1$
denotes the unit ball in
$\mathbb {R}^n$
,
$2\leq k\leq n$
,
$0\leq l\leq k-1$
,
$\hat {a}=(\binom {n}{l}/\binom {n}{k})^{\frac {1}{k-l}}$
, b,
$c\in {\mathbb R}$
. Our first result can be stated as follows.
Theorem 1.1 For
$n\geq 3$
, let
$2\leq k\leq m\leq n, 1\leq l<k$
. Then problem (1.6) admits a unique radially symmetric uniformly m-convex solution
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu7.png?pub-status=live)
if and only if
$c\in [\mu (\alpha _{0}),\infty )$
for
$m=k$
and
$c\in [\mu (\alpha _{0}),\mu (\alpha _{m})]$
for
$k+1\leq m\leq n$
, where
$\xi (t)$
denotes the inverse function of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu8.png?pub-status=live)
in the interval
$[a_{0},\infty )$
with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu9.png?pub-status=live)
with
$k+1\leq m\leq n$
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn7.png?pub-status=live)
Remark 1.2 For the case
$l=0$
, the necessary and sufficient conditions on the existence of radially symmetric solutions of the exterior Dirichlet problem of Hessian equations were obtained by Wang and Bao [Reference Wang and Bao23].
For
$n=2$
, consider the following problem:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn8.png?pub-status=live)
where b, c, and
$\rho \in \mathbb {R}$
.
Theorem 1.3 For
$n=2$
, problem (1.8) admits a unique radially symmetric convex solution
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn9.png?pub-status=live)
if and only if
$\rho \geq -1$
, and
$c=\nu (\rho )$
, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu10.png?pub-status=live)
Corollary 1.4 For
$n=2$
, problem (1.8) admits a unique radially symmetric convex solution (1.9) if and only if
$c\leq b-1.$
In the second part of this paper, we obtain the existence of viscosity solutions of the exterior Dirichlet problem of the Hessian quotient equation (1.1) and (1.2).
Before stating our main result, we will first give the definition of viscosity solutions of (1.1) and (1.2).
Definition 1.5 A function
$u\in C^0({\mathbb R}^{n}\setminus \Omega )$
is said to be a viscosity subsolution (supersolution) of (1.1) and (1.2), if
$u\leq \phi $
(
$u\geq \phi $
) on
$\partial \Omega $
and for any
$\bar {x}\in {\mathbb R}^{n}\setminus \bar {\Omega }$
and any uniformly k-convex function
$v\in C^{2}({\mathbb R}^{n}\setminus \bar {\Omega })$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu11.png?pub-status=live)
we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu12.png?pub-status=live)
If
$u\in C^{0}({\mathbb R}^{n}\setminus \Omega )$
is both a viscosity subsolution and a viscosity supersolution of (1.1) and (1.2), we say that u is a viscosity solution of (1.1) and (1.2).
Suppose that
$g\in C^0(\mathbb {R}^n)$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn10.png?pub-status=live)
and for some constant
$\beta>2$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn11.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn12.png?pub-status=live)
and
$g_0\in C^{0}([0,+\infty ))$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu13.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu14.png?pub-status=live)
Our main result can be stated as follows.
Theorem 1.6 For
$n\geq 3$
, let
$0\leq l<k\leq n$
and
$\frac {k-l}{\overline {t}_k-\underline {t}_l}>2$
. Assume that g satisfies (1.10) and (1.11). Then, for any given
$b\in \mathbb {R}^{n}$
and
$A\in \mathcal {A}_{k,l}$
, there exists some constant
$\tilde {c}$
, depending only on
$n,~b,~A,~\Omega ,~g,~g_0$
,
$||\phi ||_{C^{2}(\partial \Omega )}$
, such that for every
$c>\tilde {c}$
, there exists a unique viscosity solution
$u\in C^{0}(\mathbb {R}^{n}\backslash \Omega )$
of (1.1) and (1.2) with the following prescribed asymptotic behavior at infinity:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn13.png?pub-status=live)
or
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn14.png?pub-status=live)
where
$u_0(x)=\int _{0}^{r_A(x)}\theta h_0(\theta )d\theta $
with
$h_{0}$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn15.png?pub-status=live)
Remark 1.7 Under the assumption of
$g_{0}$
, by the classical existence, uniqueness and extension theorem for the solution of the initial value problem of the ODE, we know that (1.15) admits a bounded solution
$h_0$
in
$C^0[0,+\infty )\cap C^1(0,+\infty )$
. In particular, if
$g_{0}\equiv 1$
, then
$h_0\equiv 1$
and
$u_0(x)=\frac {1}{2}x^{T}Ax$
.
The rest of this paper is organized as follows. In Section 2, we will prove Theorems 1.1 and 1.2. In Section 3, we will construct a family of generalized symmetric smooth k-convex subsolutions and supersolutions of (1.1) by analyzing the corresponding ODE. In Section 4, we will finish the proof of Theorem 1.6 by Perron’s method. In Appendix A, we will give the Appendix.
2 Proof of Theorems 1.1 and 1.3
Before proving Theorems 1.1 and 1.3, we will first make some preliminaries.
Consider the function
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu15.png?pub-status=live)
It is easy to see that t is smooth and strictly increasing on the interval
$[a_{0},\infty )$
. Let
$\xi =\xi (t)$
denote the inverse function of t on the interval
$[a_{0},\infty )$
. Then
$\xi $
is smooth and strictly increasing on
$[\alpha _{0},\infty )$
. Moreover,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu16.png?pub-status=live)
Let
$\mu (\alpha )$
be defined as in (1.7). Then
$\mu $
has the following properties.
Lemma 2.1
$\mu $
is smooth, strictly increasing on
$[\alpha _{0},\infty )$
and
$\lim \limits _{\alpha \rightarrow \infty }\mu (\alpha )=\infty $
.
Proof The smoothness of
$\mu $
follows directly from the smoothness of
$\xi $
. Then, by a direct computation,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu17.png?pub-status=live)
Therefore, Lemma 2.1 follows directly from the facts that
$\xi (t)$
is strictly increasing on
$[\alpha _{0},\infty )$
and
$\lim \limits _{t\rightarrow \infty }\xi (t)=\infty $
.
Lemma 2.2 Let
$2\leq k\leq m\leq n$
and
$0\leq l\leq k-1$
. Assume that
$\lambda =(\beta ,\gamma ,\dots ,\gamma )\in {\mathbb R}^{n}$
and
$\sigma _{k}(\lambda )=\sigma _{l}(\lambda )$
. Then
$\lambda \in \Gamma _{m}$
if and only if
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu18.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu19.png?pub-status=live)
Proof If
$\lambda \in \Gamma _{m}$
, we have that for
$j=1$
,
$\dots $
, m,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu20.png?pub-status=live)
which implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu21.png?pub-status=live)
By [Reference Wang and Bao23, Lemma 1], we have that
$\gamma>0$
. It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn16.png?pub-status=live)
for
$j=1$
,
$\dots $
, m.
The equation
$\sigma _{k}(\lambda )=\sigma _{l}(\lambda )$
can be equivalently written as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu22.png?pub-status=live)
Since
$\gamma>0$
, dividing the above equality by
$\gamma ^{l-1}$
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn17.png?pub-status=live)
It is easy to see that
$\gamma \neq a_{0}$
. Indeed, if
$\gamma =a_{0}$
, then the left-hand side of (2.2) equals to
$0$
. However, the right-hand side of (2.2) equals
$a_{0}^{l}\binom {n}{l}\frac {n(k-l)}{k}\neq 0$
, which is a contradiction.
It follows from (2.2) and
$\gamma \neq a_{0}$
that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn18.png?pub-status=live)
Inserting the above equality into (2.1), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn19.png?pub-status=live)
for
$j=1$
,
$\dots $
, m.
Now we claim that
$k\binom {n}{k}\gamma ^{k-l}-l\binom {n}{l}>0$
or equivalently,
$\gamma>a_{0}$
. Indeed, if
$k\binom {n}{k}\gamma ^{k-l}-l\binom {n}{l}<0$
, on one hand, we have that by (2.4)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu23.png?pub-status=live)
On the other hand,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu24.png?pub-status=live)
for any
$l+1\leq j\leq k$
, which is a contradiction.
For
$m=k$
, we have already obtained that
$a_{0}<\gamma <\infty $
. For
$k+1\leq m\leq n$
, by
$\gamma>a_{0}$
and (2.4), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu25.png?pub-status=live)
Then we can conclude that
$a_{0}<\gamma <\gamma _{m}$
.
Conversely, if
$a_{0}<\gamma <\gamma _{m}$
, it is easy to check that
$\lambda \in \Gamma _{m}$
. Indeed, by (2.3), we have that for
$j=1$
,
$\dots $
, m,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu26.png?pub-status=live)
It follows from the above inequality and
$\gamma>0$
that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu27.png?pub-status=live)
Lemma 2.2 is proved.
Proof of Theorem 1.1
If
$c\in [\mu (\alpha _{0}),\infty )$
for
$m=k$
or
$c\in [\mu (\alpha _{0}),\mu (\alpha _{m})]$
for
$k+1\leq m\leq n$
, by the intermediate value theorem and Lemma 2.1, there exists uniquely
$\alpha _{0}\leq \alpha <\infty $
for
$m=k$
or
$\alpha _{0}\leq \alpha \leq \alpha _{m}$
for
$k+1\leq m\leq n$
such that
$c=\mu (\alpha )$
. Consider the function
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn20.png?pub-status=live)
Here and throughout of this section, we use r to denote
$r_{I}$
defined as in (1.12).
Next, we shall prove that u is the unique uniformly m-convex solution to (1.6). The uniqueness of u follows directly from the comparison principle (see [Reference Li, Nguyen and Wang20, Theorem 1.7]). It is obvious that u satisfies the second line in (1.6) by taking
$r=1$
in (2.5). Differentiating (2.5) with respect to
$r>1$
, it follows from the range of
$\alpha $
and the monotonicity of
$\xi $
that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn21.png?pub-status=live)
By (2.6) and Lemma 2.2, we can conclude that u is uniformly m-convex. Since
$\xi (t)$
is the inverse function of
$t=\binom {n}{k}\xi ^{k}-\binom {n}{l}\xi ^{l}$
on the interval
$[a_{0},\infty )$
, then equation (2.6) can be equivalently written as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn22.png?pub-status=live)
By differentiating (2.7) with respect to r, we have that u satisfies the first line in (1.6). It only remains to prove that u satisfies the third line in (1.6). Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu28.png?pub-status=live)
as
$t\rightarrow 0$
, then we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn23.png?pub-status=live)
as
$r\rightarrow \infty $
.
Conversely, suppose that u is the unique radially symmetric uniformly m-convex solution to (1.6). By Lemma 2.2, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn24.png?pub-status=live)
The first line in (1.6) can be written as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu29.png?pub-status=live)
By multiplying the above equation by
$r^{n-1}$
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu30.png?pub-status=live)
Then there exists
$\alpha \in {\mathbb R}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn25.png?pub-status=live)
By (2.9), (2.10), and the monotonicity of
$t=\binom {n}{k}\xi ^{k}-\binom {n}{l}\xi ^{l}$
, we can conclude that
$\alpha _{0}\leq \alpha <\infty $
for
$m=k$
and
$\alpha _{0}\leq \alpha \leq \alpha _{m}$
for
$k+1\leq m\leq n$
. By the definition of
$\xi $
, we can solve
$u'/r$
from (2.10), that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu31.png?pub-status=live)
It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu32.png?pub-status=live)
Then, by (2.8) and Lemma 2.2,
$c=\mu (\alpha )\in [\mu (\alpha _{0}),\mu (\alpha _{1})]$
.
Theorem 1.1 is proved.
Proof of Theorem 1.3
If
$\rho \geq -1$
and
$c=\nu (\rho )$
, we will prove that u defined as in (1.9) is the unique convex solution to (1.8) as follows.
The uniqueness of u follows directly from the comparison principle (see [Reference Li, Nguyen and Wang20, Theorem 1.7]). It is obvious that u satisfies the second line in (1.8) by taking
$r=1$
in (1.9). Differentiating (1.9) with respect to
$r>1$
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn26.png?pub-status=live)
By applying Lemma 2.2 with
$n=m=k=2$
and
$l=1$
, we have that u is convex. By a direct computation,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu33.png?pub-status=live)
which implies that u satisfies the first line in (1.8). It only remains to prove that u satisfies the third line in (1.8). Since
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu34.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu35.png?pub-status=live)
as
$r\rightarrow \infty $
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn27.png?pub-status=live)
as
$r\rightarrow \infty $
, which implies that u satisfies the third line in (1.8).
Conversely, suppose that u is the unique radially symmetric convex solution to (1.8). The first line in (1.8) can be written as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu36.png?pub-status=live)
By multiplying the above equation by
$2r$
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu37.png?pub-status=live)
Then there exists
$\rho \in {\mathbb R}$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn28.png?pub-status=live)
It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu38.png?pub-status=live)
which implies that
$\rho \geq -1$
. By Lemma 2.2 with
$n=m=k=2$
and
$l=1$
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn29.png?pub-status=live)
Combining (2.13) and (2.14), we can solve
$u'$
as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu39.png?pub-status=live)
Integrating the above equality from
$1$
to r, we have that u must take the form as in (1.9). Moreover, by expanding u at infinity as in (2.12), we can conclude that
$c=\nu (\rho )$
.
Theorem 1.3 is proved.
Proof of Corollary 1.4
By the argument in [Reference Wang and Bao23], we have that
$\nu (\rho )$
is increasing on
$[-1,0]$
and decreasing on
$[0,\infty )$
. Thus,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu40.png?pub-status=live)
Then Corollary 1.4 follows from the above inequality and Theorem 1.3.
Remark 2.3 If
$k=n=2,l=0,$
we can refer to Theorem 2 in [Reference Wang and Bao23].
3 Generalized symmetric functions, subsolutions and supersolutions
In this section, we will construct a family of generalized symmetric smooth subsolutions and supersolutions of (1.1).
For any
$A\in \mathcal {A}_{k,l}$
, without loss of generality, we may assume that A is diagonal, that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu41.png?pub-status=live)
where
$a=(a_{1},\dots ,a_{n})\in \mathbb {R}^n$
and
$0<a_1\leq a_2\leq \dots \leq a_n$
.
Definition 3.1 A function u is called a generalized symmetric function with respect to A if u is of the form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu42.png?pub-status=live)
where
$r:=r_{A}(x)$
is defined as in (1.12).
If u is both a generalized symmetric function with respect to A and a subsolution (supersolution, solution) of (1.1), then we say that u is a generalized symmetric subsolution (supersolution, solution) of (1.1).
By the assumptions on g, there exist functions
$\overline {g},\underline {g}\in C^{0}([0,+\infty ))$
satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu43.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn30.png?pub-status=live)
Moreover,
$\underline {g}(r)$
is strictly increasing in r and for some
$C_{1}$
,
$\theta _{0}>0$
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn31.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu44.png?pub-status=live)
In order to construct the subsolutions of (1.1), we want to construct the generalized symmetric subsolutions or solutions of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn32.png?pub-status=live)
However, Proposition A.1 tells us that it is impossible to construct the generalized symmetric solutions of the above equation for
$1\leq k\leq n-1$
directly unless
$A=\hat {a}I$
.
Thus, we will construct the generalized symmetric smooth subsolutions of (3.3). Indeed, we will construct the subsolutions of the form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu45.png?pub-status=live)
where
$\beta _{1}\in {\mathbb R}$
,
$\eta>1$
,
$\delta>\sup _{r\in [1,+\infty )} \overline {g}^{\frac {1}{k-l}}(r)$
, and
$h=h(\theta ,\delta )$
is obtained as follows.
Lemma 3.2 For
$n\geq 3$
,
$0\leq l<k\leq n$
, the following problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn33.png?pub-status=live)
admits a smooth solution
$h=h(r,\delta )$
on
$[1,+\infty )$
satisfying:
-
(i)
$\overline {g}^{\frac {1}{k-l}}(r)\leq h(r,\delta )\leq \delta ,$ and
$\partial _{r}h(r,\delta )\leq 0$ .
-
(ii)
$h(r,\delta )$ is continuous and strictly increasing in
$\delta $ and
$$ \begin{align*}\lim_{\delta\to+\infty}h(r,\delta)=+\infty,\ \forall\ r\geq 1.\end{align*} $$
Proof For brevity, sometimes we write
$h(r)$
or
$h(r,\delta )$
,
$\overline {t}_k(a)$
or
$\overline {t}_k$
and
$\underline {t}_l(a)$
or
$\underline {t}_l$
, when there is no confusion. By (3.4), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn34.png?pub-status=live)
Then
$\partial V/\partial h$
is continuous and V satisfies the local Lipschitz condition in the domain
$(\overline {g}^{\frac {1}{k-l}}(r),\delta )\times (1,+\infty )$
. Since
$\delta> \sup _{r\in [0,+\infty )} \overline {g}^{\frac {1}{k-l}}(r)$
and
$\underline {t}_l/\overline {t}_k<1$
, so by the existence, uniqueness, and extension theorem for the solution of the initial value problem of the ODE, we obtain that problem (3.4) has a smooth solution
$h(r,\delta )$
such that
$\overline {g}^{\frac {1}{k-l}}(r)\leq h(r,\delta )\leq \delta ,$
and
$\partial _{r}h(r,\delta )\leq 0$
. Then assertion (i) of this lemma is proved.
By (3.4), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu47.png?pub-status=live)
that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu48.png?pub-status=live)
Integrating the above equality from
$1$
to r, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu49.png?pub-status=live)
Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn35.png?pub-status=live)
Since
$h(r)^k+\overline {t}_k r h(r)^{k-1}h'(r)>0$
, then
$h(r)^l+\underline {t}_l r h(r)^{l-1}h'(r)>0$
, so also
$(r^{\frac {l}{\underline {t}_l}}h^{l}(r))^{\prime }>0.$
According to the mean value theorem of integrals, we have that there exists
$1\leq \theta _1\leq r$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu50.png?pub-status=live)
i.e.,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn36.png?pub-status=live)
Then we claim that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn37.png?pub-status=live)
Indeed, by (3.7), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn38.png?pub-status=live)
Since
$\underline {t}_l\leq \frac {l}{n}<\frac {k}{n}\leq \overline {t}_k$
and
$\delta ^{k-l}>\sup _{r\in [0,+\infty )}\overline {g}(r)$
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn39.png?pub-status=live)
Inserting the above inequality into (3.9), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu51.png?pub-status=live)
Since
$-\dfrac {\underline {t}_l}{\overline {t}_k}>-\dfrac {k\underline {t}_l}{l\overline {t}_k}$
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu52.png?pub-status=live)
that is, (3.8).
By the implicit function theorem and the existence and uniqueness of solutions of (3.4), (3.7) admits a unique function
$h(r):=h(r,\delta ):=h(r,\delta ,\theta _1)$
. Moreover,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu53.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn40.png?pub-status=live)
By (3.9), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu54.png?pub-status=live)
As
$\delta \to +\infty ,$
the right side of the above equality tends to
$+\infty $
. Since h is increasing in
$\delta $
by (3.11), we can conclude that
$h(r,\delta ,\theta _1)\to +\infty $
, as
$\delta \to +\infty $
. This lemma is proved.
The asymptotic behavior of w can be given as follows.
Lemma 3.3 As
$r\to \infty ,$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn41.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn42.png?pub-status=live)
Proof Let
$h_0$
satisfy (1.15). From the equation in (1.15), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu55.png?pub-status=live)
It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn43.png?pub-status=live)
Integrating the above equality on both sides, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn44.png?pub-status=live)
Rewrite
$w(r)$
as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn45.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu56.png?pub-status=live)
By (3.4),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu57.png?pub-status=live)
It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn46.png?pub-status=live)
that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu58.png?pub-status=live)
Integrating the above equality from
$1$
to r, we obtain that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu59.png?pub-status=live)
It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn47.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu60.png?pub-status=live)
Since by (3.2),
$\overline {g}(r)=g_0(r)+C_1r^{-\beta }, r>\theta _{0}$
, then the last term in (3.16) is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn48.png?pub-status=live)
where
$\delta _0=\delta ^{\frac {(k-l)\overline {t}_k}{\overline {t}_k-\underline {t}_l}}+\int _1^{\theta _{0}} \overline {g}(s)(s^{\frac {k-l}{\overline {t}_k-\underline {t}_l}}h(s)^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}})^{\prime }ds$
and
$\delta _1=\delta _0-\int _{0}^{\theta _{0}}g_0(s) (s^{\frac {k-l}{\overline {t}_k-\underline {t}_l}}h(s)^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}})^{\prime }ds$
. In (3.19), we let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu61.png?pub-status=live)
Then, if
$\beta \not =\frac {k-l}{\overline {t}_k-\underline {t}_l}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn49.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn50.png?pub-status=live)
where
$C_2:=C_2(\theta )=C_1h^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}}(\theta )$
and
$C_3=-C_1\theta _0^{\frac {k-l}{\overline {t}_k-\underline {t}_l}-\beta }h^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}}(\theta _0)$
. In (3.20), we employ the integration by parts and the mean value theorem of integrals and
$\kappa _0\in [\theta _0,\theta ]$
,
$C_4=C_2+\frac {C_1\beta h(\kappa _0)^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}}}{\frac {k-l}{\overline {t}_k-\underline {t}_l}-\beta }$
,
$C_5=C_3-\frac {C_1\beta h(\kappa _0)^{\frac {(k-l)\underline {t}_l}{\overline {t}_k- \underline {t}_l}}}{\frac {k-l}{\overline {t}_k-\underline {t}_l}-\beta }\theta _0^{\frac {k-l}{\overline {t}_k-\underline {t}_l}-\beta }.$
In (3.19), we set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn51.png?pub-status=live)
According to (3.14) and (3.17), we can have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu62.png?pub-status=live)
Consequently,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn52.png?pub-status=live)
On the other hand, in light of (3.14) and (3.17), we know that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu63.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu64.png?pub-status=live)
As a result,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn53.png?pub-status=live)
Likewise, we also have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn54.png?pub-status=live)
From (3.23)–(3.25), we get that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu65.png?pub-status=live)
So
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu66.png?pub-status=live)
And, therefore, the term
$\int _{0}^\theta g_0(s)\left ((s^{\frac {k-l}{\overline {t}_k-\underline {t}_l}}h(s)^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}})^{\prime } -(s^{\frac {k-l}{\overline {t}_k-\underline {t}_l}}h_0(s)^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}})^{\prime }\right )ds$
in (3.22) is bounded and thus
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn55.png?pub-status=live)
where
$c_{10}=c_{10}(\theta )=\int _{0}^\theta g_0(s)\left ((s^{\frac {k-l}{\overline {t}_k-\underline {t}_l}}h(s)^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}})^{\prime } -(s^{\frac {k-l}{\overline {t}_k-\underline {t}_l}}h_0(s)^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}})^{\prime }\right )ds$
. Hence, by (3.21) and (3.26), we know that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn56.png?pub-status=live)
Thus, due to the fact that
$h_0$
is bounded, then (3.27) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu67.png?pub-status=live)
If
$\beta =\frac {k-l}{\overline {t}_k-\underline {t}_l}$
, then by (3.20),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn57.png?pub-status=live)
where
$C_6=C_1\frac {k-l}{\overline {t}_k-\underline {t}_l} h(\kappa _0)^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}},$
$C_7:=C_2+C_3-C_1\frac {k-l}{\overline {t}_k-\underline {t}_l} h(\kappa _0)^{\frac {(k-l)\underline {t}_l}{\overline {t}_k-\underline {t}_l}}\ln \theta _0.$
Therefore, by (3.19), (3.22), and (3.28), we know that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn58.png?pub-status=live)
Hence, by the fact that
$h_0$
is bounded, then (3.29) turns into
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu68.png?pub-status=live)
To sum up, we can get (3.12). By Lemma 3.2(ii), we know that (3.13) holds.
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu69.png?pub-status=live)
where
$E_{\eta }:=\{x\in \mathbb {R}^n:r<\eta \}$
. Then we can conclude that such W is a generalized symmetric smooth subsolution of (1.1) as follows.
Theorem 3.4
W is a smooth k-convex subsolution of (1.1) in
$\mathbb {R}^n\setminus \bar {E}_{\eta }$
.
Proof By the definition of w, we have that
$w'=rh$
and
$w"=h+rh'$
. It follows that for i,
$j=1$
,
$\ldots $
, n,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu70.png?pub-status=live)
By Lemma A.2, we have that for
$j=1$
,
$\ldots $
, k,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn59.png?pub-status=live)
where we have used the facts that
$h\geq \overline {g}^{\frac {1}{k-l}}>0$
and
$h'\leq 0$
for any
$r\geq 1$
by Lemma 3.2(i).
Since
$l<k$
,
$\underline {t}_l\leq \underline {t}_k\leq \frac {k}{n}\leq \overline {t}_k$
, then
$-\frac {\underline {t}_l}{\overline {t}_k}\geq -1.$
It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu71.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu72.png?pub-status=live)
Thus,
$h+\overline {t}_jrh^{\prime }\geq 0.$
Hence, by (3.30),
$S_j(D^2w)\geq 0$
for
$j=1,\dots ,k.$
Moreover, by (3.5) and the fact that
$\sigma _{k}(a)=\sigma _{l}(a)$
, we have that for any
$x\in \mathbb {R}^n\setminus \bar {E}_{\eta }$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu73.png?pub-status=live)
Then we complete the proof.
Next we shall construct the generalized symmetric supersolution of (1.1) of the form
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu74.png?pub-status=live)
where
$\beta _{2}\in {\mathbb R}$
and H is obtained from the following lemma.
Lemma 3.5 For
$n\geq 3$
and
$0\leq l<k\leq n$
. Let
$\frac {\underline {t}_l}{\overline {t}_k}\underline {g}(1)<\tau ^{k-l}<\underline {g}(1)$
. Then the problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn60.png?pub-status=live)
admits a smooth solution
$H(r)=H(r,\tau )$
on
$[1,+\infty )$
satisfying:
-
(i)
$\frac {\underline {t}_l}{\overline {t}_k}\underline {g}(r) <H^{k-l}(r,\tau )<\underline {g}(r),\partial _{r}H(r,\tau )\geq 0$ for
$r\geq 1$ .
-
(ii)
$H(r,\tau )$ is continuous and strictly increasing with respect to
$\tau $ .
Proof For brevity, we sometimes write
$H(r)$
or
$H(r,\tau )$
when there is no confusion. From (3.31), we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn61.png?pub-status=live)
Since
$\frac {\underline {t}_l}{\overline {t}_k}\underline {g}(1)<\tau ^{k-l}<\underline {g}(1)$
and
$\underline {g}(r)$
is strictly increasing, by the existence, uniqueness, and extension theorem for the solution of the initial value problem of the ODE, we can get that the problem has a smooth solution
$H(r,\delta )$
satisfying
$\frac {\underline {t}_l}{\overline {t}_k}\underline {g}(r)<H^{k-l}(r,\tau )<\underline {g}(r),$
and
$\partial _{r}H(r,\tau )\geq 0$
, that is, (i) of this lemma.
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu75.png?pub-status=live)
Then (3.32) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn62.png?pub-status=live)
Differentiating (3.33) with
$\tau $
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu76.png?pub-status=live)
It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu77.png?pub-status=live)
that is, (ii) of this lemma.
Remark 3.6 If
$g\equiv 1$
, then we choose
$\overline {g}\equiv \underline {g}\equiv 1,\delta =\tau =1$
. Then
$h\equiv 1$
and
$H\equiv 1$
satisfy (3.4) and (3.32), respectively.
Analogous to (3.12),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn63.png?pub-status=live)
as
$r\to +\infty $
, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu78.png?pub-status=live)
Theorem 3.7
$\Psi $
is a k-convex supersolution of (1.1) in
$\mathbb {R}^n\backslash E_{\eta }$
.
Proof By Lemma A.2, we have that for
$j=1$
,
$\ldots $
, k,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu79.png?pub-status=live)
where we have used the fact that
$H'\geq 0$
by Lemma 3.5(i). Moreover, by (3.31), we have that for any
$x\in \mathbb {R}^n\backslash E_{\eta }$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn64.png?pub-status=live)
4 Proof of Theorem 1.6
Before proving Theorem 1.6, we will first give some lemmas which will be used later.
Lemma 4.1 Suppose that
$\phi \in C^{2}(\partial \Omega )$
. Then there exists some constant C, depending only on
$g,~ n, ||\phi ||_{C^{2}(\partial \Omega )},$
the upper bound of A, the diameter and the convexity of
$\Omega $
, and the
$C^{2}$
norm of
$\partial \Omega $
, such that, for each
$\varsigma \in \partial \Omega $
, there exists
$\overline {x}(\varsigma )\in \mathbb {R}^{n}$
such that
$|\overline {x}(\varsigma )|\leq C$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu80.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu81.png?pub-status=live)
and
$\frac {\binom {n}{k}\Xi ^k}{\binom {n}{l}\Xi ^l}>\sup \limits _{E_{2R}}\overline {g}$
for some
$R>0$
such that
$E_{1}\subset \subset \Omega \subset \subset E_{R}$
.
Proof The proof of Lemma 4.1 is similar to the proof of Lemma 3.1 in [Reference Cao and Bao9]. We only substitute the constant
$F^{\frac {1}{k}}$
in Lemma 3.1 in [Reference Cao and Bao9] with
$\Xi $
. Here, we omit its proof.
Lemma 4.2 [Reference Dai11, Lemma 2.2]
Let B be a ball in
$\mathbb {R}^n$
, and let
$f\in C^0(\overline {B})$
be nonnegative. Suppose that
$\underline {u}\in C^0(\overline {B})$
satisfies
$S_k(D^2\underline {u})\geq f(x)$
$\mbox { in } B$
in the viscosity sense. Then the Dirichlet problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu82.png?pub-status=live)
admits a unique k-convex viscosity solution
$u\in C^0(\overline {B})$
.
Lemma 4.3 [Reference Dai11, Lemma 2.3]
Let D be a domain in
$\mathbb {R}^n$
, and let
$f\in C^{0}(\mathbb {R}^n)$
be nonnegative. Assume that
$v\in C^{0}(\overline {D})$
and
$u\in C^{0}(\mathbb {R}^n)$
are two k-convex functions satisfying in the viscosity sense
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu83.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu84.png?pub-status=live)
respectively,
$u\leq v$
on
$\overline {D}$
and
$u=v$
on
$\partial D$
.
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu85.png?pub-status=live)
Then
$w\in C^{0}(\mathbb {R}^n)$
is a k-convex function satisfying
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu86.png?pub-status=live)
Proof of Theorem 1.6
Without loss of generality, we may assume that
$A=\mbox {diag}(a_{1},\ldots ,a_{n})\in \mathcal {A}_{k,l}$
,
$0<a_1\leq a_2\leq \cdots \leq a_n$
and
$b=0$
.
For any
$\delta> \sup _{r\in [1,+\infty )} \overline {g}^{\frac {1}{k-l}}(r)$
, let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu87.png?pub-status=live)
where
$r_{A}(x)$
is defined as in (1.12), where
$\rho _{\varsigma }(x)$
and
$h(r,\delta )$
are obtained from Lemmas 4.1 and 3.2, respectively, and
$\kappa _1:=\min _{\substack {x\in \overline {E_{R}}\backslash \Omega \\ \varsigma \in \partial \Omega }}\rho _{\varsigma }(x)$
.
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu88.png?pub-status=live)
Since
$\rho _{\varsigma }$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu89.png?pub-status=live)
then
$\varphi $
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn65.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn66.png?pub-status=live)
By Theorem 3.4, we have that
$W_{\delta }$
is a smooth k-convex subsolution of (1.1), i.e.,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn67.png?pub-status=live)
Since
$\Omega \subset \subset E_{R}$
, we can conclude that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn68.png?pub-status=live)
Moreover, by Lemma 3.2,
$W_{\delta }$
is strictly increasing in
$\delta $
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu90.png?pub-status=live)
By (3.12), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu91.png?pub-status=live)
as
$|x|\to +\infty $
, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu92.png?pub-status=live)
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu93.png?pub-status=live)
where
$\kappa _2$
is any constant,
$\frac {\underline {t}_l}{\overline {t}_k}\underline {g}(1)<\tau ^{k-l}<\underline {g}(1)$
and H is obtained from Lemma 3.5. Then we have that, by (3.35),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn69.png?pub-status=live)
and by (3.34), as
$|x|\to +\infty ,$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu94.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu95.png?pub-status=live)
is convergent.
Since
$W_{\delta }$
is strictly increasing in
$\delta $
, then there exists some
$\hat {\delta }>\sup _{r\in [1,+\infty )} \overline {g}^{\frac {1}{k-l}}(r)$
such that
$\min _{\partial E_{2R}}W_{\hat {\delta }}>\max _{\partial E_{2R}}\varphi $
. It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn70.png?pub-status=live)
Clearly,
$\mu (\delta )$
is strictly increasing in
$\delta $
. By (3.13), we have that
$\lim _{\delta \to +\infty }\mu (\delta )=+\infty $
.
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu96.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu97.png?pub-status=live)
Then, for any
$c>\tilde {c}$
, there is a unique
$\delta (c)$
such that
$\mu (\delta (c))=c.$
Consequently, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn71.png?pub-status=live)
as
$|x|\to +\infty $
, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu98.png?pub-status=live)
By the monotonicity of
$W_{\delta }$
in
$\delta $
and (4.6), we conclude that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn72.png?pub-status=live)
Taking
$\kappa _{2}$
such that
$\nu _{\kappa _2}(\tau )=c$
. Then we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn73.png?pub-status=live)
and as
$|x|\to +\infty $
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn74.png?pub-status=live)
Define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu99.png?pub-status=live)
Then, by (4.8), we have that
$\underline {u}\in C^0(\mathbb {R}^n\backslash \Omega )$
. By (4.1), (4.3), and Lemma 4.3,
$\underline {u}$
satisfies in the viscosity sense
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu100.png?pub-status=live)
By (4.4) and (4.2), we obtain that
$\underline {u}=\phi $
on
$\partial \Omega $
. Moreover, by (4.7), we have that
$\underline {u}$
satisfies the asymptotic behavior (4.10) at infinity.
By the definitions of
$\tilde {c}$
,
$\overline {u}_{\kappa _2}$
, and
$\varphi $
, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn75.png?pub-status=live)
By (4.4),
$W_{\delta (c)}\leq \varphi \leq \overline {u}_{\kappa _2,\tau }$
on
$\partial \Omega $
. By (4.3), (4.5), (4.7), (4.10), and the comparison principle, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn76.png?pub-status=live)
Let
$\overline {u}:=\overline {u}_{\kappa _2,\tau }$
in
$\mathbb {R}^n\backslash \Omega $
. By (4.11), (4.12), and the definition of
$\underline {u}$
, we have that
$\underline {u}\leq \overline {u}$
in
$\mathbb {R}^n\backslash \Omega $
.
For any
$c>\tilde {c}$
, let
$\mathcal {S}_c$
denote the set of
$\varrho \in C^0(\mathbb {R}^n\backslash \Omega )$
which are viscosity subsolutions of (1.1) and (1.2) satisfying
$\varrho =\phi $
on
$\partial \Omega $
and
$\varrho \leq \overline {u}$
in
$\mathbb {R}^n\backslash \Omega $
. Apparently,
$\underline {u}\in \mathcal {S}_c$
, which implies that
$\mathcal {S}_c\neq \emptyset .$
Define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu101.png?pub-status=live)
Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu102.png?pub-status=live)
Hence, by the asymptotic behavior of
$\underline {u}$
and
$\overline {u}$
at infinity, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu103.png?pub-status=live)
as
$|x|\to +\infty $
.
Next, we will show that
$u=\phi $
on
$\partial \Omega .$
On one side, since
$\underline {u}=\phi $
on
$\partial \Omega ,$
we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu104.png?pub-status=live)
On the other side, we want to prove that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu105.png?pub-status=live)
Let
$\vartheta \in C^2(\overline {E_{2R}\backslash \Omega })$
satisfy
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu106.png?pub-status=live)
By Newton’s inequality, for any
$\varrho \in \mathcal {S}_c$
, we have that
$\Delta \varrho \geq 0$
in the viscosity sense. Moreover,
$\varrho \leq \vartheta $
on
$\partial (E_{2R}\backslash \Omega )$
. Then, by the comparison principle, we have that
$\varrho \leq \vartheta \ \ \mbox {in}\ \ E_{2R}\backslash \Omega $
. It follows that
$u\leq \vartheta \ \ \mbox {in}\ \ E_{2R}\backslash \Omega $
. Therefore,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu107.png?pub-status=live)
Finally, we will prove that
$u\in C^0(\mathbb {R}^n\backslash \Omega )$
is a viscosity solution of (1.1). For any
$x\in \mathbb {R}^n\backslash \overline {\Omega },$
choose some
$\varepsilon>0$
such that
$B_{\varepsilon }=B_{\varepsilon }(x)\subset \mathbb {R}^n\backslash \overline {\Omega }.$
By Lemma 4.2, the following Dirichlet problem
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn77.png?pub-status=live)
admits a unique k-convex viscosity solution
$\tilde {u}\in C^0(\overline {B_{\varepsilon }}).$
By the comparison principle,
$u\leq \tilde {u}$
in
$B_{\varepsilon }$
. Define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu108.png?pub-status=live)
Then
$\tilde {w}\in \mathcal {S}_{c}.$
Indeed, by the comparison principle,
$\tilde {u}(y)\leq \overline {u}(y)$
in
$\bar {B}_{\varepsilon }$
. It follows that
$\tilde {w}\leq \overline {u}$
in
$\mathbb {R}^n\backslash B_{\varepsilon }.$
By Lemma 4.3, we have that
$\frac {S_k(D^2\tilde {w})}{S_l(D^2\tilde {w})}\geq g(y)$
in
$\mathbb {R}^n\backslash \overline {\Omega }$
in the viscosity sense. Therefore,
$\tilde {w}\in \mathcal {S}_{c}.$
By the definition of u,
$u\geq \tilde {w}$
in
$\mathbb {R}^n\backslash \Omega $
. It follows that
$u\geq \tilde {u}$
in
$B_{\varepsilon }.$
Hence,
$u\equiv \tilde {u}$
in
$B_{\varepsilon }$
. Since
$\tilde {u}$
satisfies (4.13), then we have that in the viscosity sense,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu109.png?pub-status=live)
In particular, we have that in the viscosity sense,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu110.png?pub-status=live)
Since x is arbitrary, we can conclude that u is a viscosity solution of (1.1).
Theorem 1.6 is proved.
A Appendix
In this appendix, we will show that it is impossible to construct the generalized symmetric solution of (3.3).
Proposition A.1 If there exists a
$C^{2}$
function defined on
$(r_{1},r_{2})$
such that
$T(x):=G(r)$
is a generalized symmetric solution of (3.3), then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu111.png?pub-status=live)
where
$r=r_{A}$
is defined as in (1.12).
Before proving the above proposition, we will first give some elementary lemmas.
Lemma A.2 If
$M=(p_i\delta _{ij}+sq_iq_j)_{n\times n}$
with
$p,q\in \mathbb {R}^n$
and
$s\in \mathbb {R}$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu112.png?pub-status=live)
Proof See [Reference Bao, Li and Li2].
Lemma A.3 Suppose that
$\tilde {\phi }\in C^2[0,+\infty )$
and
$\tilde {\Phi }(x):=\tilde {\phi }(r)$
. Then
$\tilde {\Phi }$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn78.png?pub-status=live)
where
$\tilde {h}(r):=\tilde {\phi }^{\prime }(r)/r$
.
Proof Since
$r^2=x^{T}Ax=\sum _{i=1}^na_ix_i^2,$
we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu113.png?pub-status=live)
It follows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu114.png?pub-status=live)
By Lemma A.2, we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu115.png?pub-status=live)
Lemma A.4 Let
$a=(a_1,a_2,\dots ,a_n)$
satisfy
$0<a_1\leq a_2\leq \dots \leq a_n.$
Then, for
$1\leq k\leq n$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn79.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu116.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu117.png?pub-status=live)
where
$\underline {t}_k$
and
$\overline {t}_{k}$
are defined as in (1.4) and (1.5). Moreover, for
$1\leq k\leq n-1,$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu118.png?pub-status=live)
if and only if
$a_{1}=\cdots =a_{n}=\overline {C}$
for some
$\overline {C}>0$
.
Remark A.5 From (A.2), we know that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu119.png?pub-status=live)
Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu120.png?pub-status=live)
Now we give the proof of Proposition A.1.
Proof For the special case
$l=0,1\leq k\leq n$
, the Hessian equation case, Proposition A.1 can be proved similarly with Proposition 2.2 in [Reference Cao and Bao9]. We only need to prove the case
$1\leq l<k\leq n$
.
Let
$J(r)=G^{\prime }(r)/r$
. By (A.1), we know that T satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu121.png?pub-status=live)
Set
$x=(0,\dots ,0,\sqrt {r/a_i},0,\dots ,0)$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu122.png?pub-status=live)
So
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn80.png?pub-status=live)
Since
$\sigma _k(a)=\sigma _l(a)$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn81.png?pub-status=live)
Noting that the left side of (A.4) is independent of i, so for any
$i\not =j,$
we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu123.png?pub-status=live)
As a result,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn82.png?pub-status=live)
Applying the equality
$\sigma _k(a)=\sigma _{k;i}(a)+a_i\sigma _{k-1;i}(a)$
for all
$i,$
we get that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu124.png?pub-status=live)
Therefore, (A.5) becomes
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu125.png?pub-status=live)
If
$k=n$
, then
$\sigma _{k-1;ij}(a)=0$
for any
$i\not =j$
. But
$\sigma _{l-1;ij}(a)>0$
, so we get that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu126.png?pub-status=live)
If
$1\leq l<k\leq n-1$
, then
$\sigma _{k-1;ij}(a)>0$
and
$\sigma _{l-1;ij}(a)>0$
. Suppose on the contrary that
$a_i\not =a_j$
, then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu127.png?pub-status=live)
Thus,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn83.png?pub-status=live)
Since the left side is independent of r, then
$\overline {g}(r)J(r)^{l-k}$
is a constant
$c_0>0.$
So
$\overline {g}(r)=c_0J(r)^{k-l}.$
Substituting into (A.4), we have that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqn84.png?pub-status=live)
Since the left side of the above equality is independent of i, then for any
$i\not =j$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu128.png?pub-status=live)
so
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu129.png?pub-status=live)
However,
$a_i\not =a_j$
; thus,
$\sigma _{l-1;ij}(a)=\sigma _{k-1;ij}(a)$
. Therefore, by (A.6), we can have
$c_0=1$
. Then, by (A.7), we can get that for all i,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu130.png?pub-status=live)
Recalling the equality
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250209052949335-0953:S0008414X23000834:S0008414X23000834_eqnu131.png?pub-status=live)
we know that
$k\sigma _k(a)=l\sigma _l(a)$
. Since
$A\in \mathcal {A}_{k,l}$
, we can conclude that
$\sigma _k(a)=\sigma _l(a)$
and
$k=l$
, which is a contradiction.