On an effect of inhomogeneous constraints
for a maximizing problem of the Sobolev embedding associated with the space
of bounded variation
Michinori Ishiwata 1 and Hidemitsu Wadade 2
(1*Department of Systems Innovation
Graduate School of Engineering Science, Osaka University,
1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan
2Faculty of Mechanical Engineering, Institute of Science and Engineering, Kanazawa University,
Kakuma, Kanazawa, Ishikawa 920-1192, Japan*)
Abstract
In this paper, we consider a maximizing problem associated with the Sobolev type embedding
BV(RN)↪Lr(RN) for 1≤r≤1∗:=N−1N
with N≥2 as follows : for given α>0,
[TABLE]
where 1<q≤1∗, a,b>0, we show that, although the maximizing problem
associated with Dα(a,b,1∗) suffers from both of the non-compactness of BV↪L1 and BV↪L1∗ called vanishing and concentrating phenomena, there exists a maximizer for some range of a, b.
Furthermore, we show that
any maximizer u∈BV of Dα(a,b,q) must be given by a characteristic function on a ball.
2010 Mathematics Subject Classification.
47J30 ; 46E35 ; 26D10.
*Key words : Sobolev’s embedding ; maximizing problem ; space of bounded variation ;
Gagliardo-Nirenberg inequality ; isoperimetrical inequality*
1 Introduction and main results
In this paper, we consider a maximizing problem associated with
Sobolev type embedding BV(RN)↪Lr(RN) for 1≤r≤1∗:=N−1N with N≥2, where BV denotes the space of bounded variation,
see [3] and Section 2. The inequality associated with the embedding BV↪L1∗ is Mazya’s inequality with its best-constant E given by
[TABLE]
where ωN−1 denotes the surface area of the N-dimensional unit ball, see [14].
It is well-known that (1.1) is
equivalent to the isoperimetric inequality,
and maximizers of E consist of functions of the form λχB∈BV with λ∈R∖{0} and a ball B⊂RN. A variational problem investigated in this paper is formulated as follows : for given α>0,
[TABLE]
where 1<q≤1∗ and a,b>0. Especially for the critical case q=1∗, the maximizing problem associated with Dα suffers from both of the non-compactness of BV↪L1 and BV↪L1∗ called vanishing and concentrating phenomena, respectively.
One of our goals is to clarify an effect of the exponents a and b in
the inhomogeneous constraints on the (non-)attainability of Dα.
The attainability of maximizing problems corresponding to
the Sobolev embedding W1,p↪Lr, where 1<p<N,
p≤r≤p∗:=N−pNp, were studied in [7, 16].
The authors in [7] treated the variational problem given by
[TABLE]
where p<q<p∗ and a,b>0. This problem contains a difficulty coming from the
non-compactness of W1,p↪Lp
due to a vanishing phenomenon.
After that, the author in [16] considered the same problem for the critical case q=p∗.
In this case, the problem becomes more complicated since one needs to exclude
both of vanishing and concentrating behaviors of a maximizing sequence
due to the non-compact embeddings W1,p↪Lp and W1,p↪Lp∗, respectively.
The usual way in attacking this problem will be to compute the thresholds with respect to vanishing and concentrating phenomena and to investigate behaviors of a maximizing sequence in order to recover the compactness of the functional,
which was a strategy used in [7]. However, the author in [16] gave
an alternative way in discussing the problem without a use
of the variational method directly. A main key used in [16] is to give
another expression of the functional in terms of the corresponding 1-dimensional function
by a scaling argument. Based on these known results,
we consider the remaining case p=1, which leads to the problem (1.2).
In fact, we observe that the method used in [16] can work for the marginal case p=1
by replacing W1,1 with BV. Also, as an advantage of the case p=1,
we know the exact forms of maximizers of E through the isoperimetric inequality,
and as a result, we obtain a characterization of maximizers of Dα,
see Theorem 1.5.
In order to state our main results, we start from the problem (1.2) with the subcritical case 1<q<1∗.
In this case, the embedding BVrad↪Lq is compact,
where BVrad denotes the set of radially symmetric functions in BV,
and hence, the term ∥u∥q in the functional will make an aid
to admit a maximizer of Dα, see [2].
On the other hand, Dα suffers from the non-compactness
of BV↪L1, which comes from
the scaling un(x):=nN1u(nx) with a fixed
u∈BV∖{0}. In general, we call {un}n⊂BV “ a vanishing sequence ” if {un}n satisfies the conditions :
[TABLE]
We also introduce the value αv=αv(a,b,q)∈[0,∞) defined by
[TABLE]
If there exists a maximizing sequence {un}n of Dα
such that {un}n is also a vanishing sequence,
we easily see Dα≤1. On the other hand, since α>αv is equivalent to Dα>1, the value αv is expected to be the threshold of α on the attainability of Dα.
Our first result is stated as follows :
Theorem 1.1**.**
Let 1<q<1∗, a>0 and b>0.
(Non-threshold case α=αv)**
(i)* Let a>N(q−1). Then there holds αv=0, and Dα is attained for α>0.*
(ii)* Let a≤N(q−1). Then there holds αv>0, and Dα is attained for α>αv, while Dα is not attained for α<αv.*
(Threshold case α=αv)**
(iii)* Let a<N(q−1), or let a=N(q−1), 2(N−1)2N−1<q<1∗ and b<b0:=(q−1)(N−1)−(N−(N−1)q).
Then Dαv is attained.*
(iv)* Let a=N(q−1) and {2(N−1)2N−1<q<1∗ and b≥b0,or 1<q≤2(N−1)2N−1. Then Dαv is not attained.*
Next, we estimate the value αv. To this end, we introduce
the best-constant of the Gagliardo-Nirenberg type inequality Eq :
[TABLE]
One can calculate Eq=(NN−1ωN−11)q−1
and remark that E1∗=E is Mazya’s best-constant, see Proposition 2.1 (i).
By means of Eq, the value αv is estimated as follows :
Theorem 1.2**.**
Let 1<q<1∗, a>0 and b>0.
(i)* There hold *$\alpha_{v}\begin{cases}=0\quad\text{when ,}a>N(q-1),\
0\quad\text{when ,}a\leq N(q-1).\end{cases}$**
(ii)* Let a=N(q−1). Then there hold*
[TABLE]
(iii)* (Asymptotic behaviors of αv on the parameters a and b)*
(a)* There holds lima↓0αv=∞.*
(b)* Let 2(N−1)2N−1<q<1∗ and b≥b0, or let 1<q≤2(N−1)2N−1.
Then there holds lima↑N(q−1)αv=bEq1.*
(c)* Let a≤N(q−1). Then there hold limb↓0αv=∞
and limb→∞αv=0.*
(d)* Let a=N(q−1) and 2(N−1)2N−1<q<1∗. Then there holds
limb↑b0αv=b0Eq1.*
We proceed to the critical case q=1∗.
In this case, Dα(a,b,1∗) suffers from
the non-compactness of not only BV↪L1 but also BV↪L1∗. The latter non-compactness comes from the scaling
un(x):=nN−1u(nx) with a fixed u∈BV∖{0}.
In general, we call {un}n⊂BV “ a concentrating sequence ” if
{un}n satisfies the conditions :
[TABLE]
We also introduce the value αc=αc(a,b)∈(0,∞] defined by
[TABLE]
where note E−∥u∥1∗1∗≥E(1−∥u∥TV1∗)>0 since 0<∥u∥TV<1.
If there exists a maximizing sequence {un}n of Dα
such that {un}n is also a concentrating sequence,
it is easy to see Dα≤αE. On the other hand, since α<αc is equivalent to Dα>αE, the value αc is expected to be the threshold of α on the attainability of Dα regarding to the concentrating phenomenon.
In fact, we can show that Dα with α in the region (αv,αc) admits a maximizer whenever αv<αc, see Lemma 4.2 (iii).
We now state the attainability result on Dα=Dα(a,b,1∗) :
Theorem 1.3**.**
Let a>0 and b>0.
(Non-threshold case α=αv and α=αc)**
(i)* Let a>1∗ and b>1. Then there hold αv=0 and αc=∞,
and Dα is attained for α>0.*
(ii)* Let a>1∗ and b≤1. Then there hold αv=0 and αc<∞,
and Dα is attained for 0<α<αc,
while Dα is not attained for α>αc.*
(iii)* Let a≤1∗ and b>1. Then there hold αv>0 and αc=∞,
and Dα is attained for α>αv, while Dα is not attained for α<αv.*
(iv)* Let a≤1∗ and b≤1. Then there holds 0<αv=αc<∞,
and Dα is not attained for α=αv(=αc).*
(Threshold case α=αv or α=αc)**
(v)* Let a>1∗. Then D_{\alpha_{c}}\begin{cases}&\text{ is attained when b<1},\\
&\text{ is not attained when b=1}.\end{cases}*
(vi)* Let a=1∗. Then D_{\alpha_{v}}\begin{cases}&\text{ is attained when b=1},\\
&\text{ is not attained when b\neq 1}.\end{cases}*
(vii)* Let a<1∗. Then D_{\alpha_{v}}\begin{cases}&\text{ is attained when b>1},\\
&\text{ is not attained when b\leq 1}.\end{cases}*
Next, we estimate αv and αc by means of E as follows :
Theorem 1.4**.**
Let a>0 and b>0.
(i)* Let a>1∗. Then there hold αv=0
and {αc=∞ when b>1,E1<αc<∞ when b≤1.*
In particular, there holds αc=1∗Ea when b=1.
(ii)* Let a≤1∗. Then there hold {0<αv<E1 and αc=∞ when b>1,αv=αc=E1 when b≤1.*
In particular, there holds αv=bE1 when a=1∗ and b>1.
(iii)* (Asymptotic behaviors of αv and αc on the parameters a and b)*
(a)* Let b>1. Then there hold lima↓0αv=E1 and lima↑1∗αv=bE1.*
(b)* Let b≤1. Then there hold lima↓1∗αc=E1 and lima→∞αc=∞.*
(c)* Let a>1∗. Then there hold limb↓0αc=E1
and limb↑1αc=1∗Ea.*
(d)* Let a≤1∗. Then there hold limb↓1αv=E1
and limb→∞αv=0.*
In the end, we characterize the set of all maximizers of Dα for 1<q≤1∗
by means of the corresponding 1-dimensional function :
Theorem 1.5**.**
Let 1<q≤1∗, α>0, a>0 and b>0.
Introduce 1-dimensional functions r(t), μ(t) and fα(t) by
[TABLE]
for t>0. Then it holds Dα=supt>0fα(t).
Furthermore, letting Σ and Π be sets defined by
[TABLE]
we obtain
Σ={±μ(t0)χBr(t0)(x0)∈BV∣t0∈Π and x0∈RN}.
Theorem 1.5 is essentially proved by a scaling argument in [16]
together with the fact that maximizers of Eq consist of functions of the form
u=λχB with λ∈R∖{0} and a ball B⊂RN, see Proposition 2.1 (ii), namely the information on maximizers of E1∗ (the isoperimetric inequality) is transmitted to Eq for any 1<q≤1∗. On the other hand, it seems to be difficult to obtain a similar characterization to the problem based on W1,p with 1<p<N
since we do not know the relation between maximizers of the Sobolev inequality (called Talenti’s function) and those of the corresponding Gagliardo-Nirenberg inequality.
For the limiting case p=N, a maximizing problem on W1,N corresponding to (1.2) was considered in [6].
As another characterization of Sobolev’s embedding in this case,
we know the Moser-Trudinger type inequalities.
Attainability problems associated with those inequalities
also have been investigated in rich literature.
Among others, we refer to [4, 5, 12, 17, 18] and related works [8, 9, 10, 11, 13, 15], in which similar problems to Dα were studied.
This paper is organized as follows. Section 2 is devoted to prepare preliminary facts
and to prove Theorem 1.5. We show Theorem 1.1-1.2 and Theorem 1.3-1.4 in Section 3 and Section 4, respectively. Throughout the paper, the notation ∥⋅∥p denotes the standard Lp-norm. We pass to subsequences freely.
2 Preliminaries
In this section, we collect several lemmas needed for the proofs of main theorems.
First, we recall the definition of the space of bounded variation BV.
BV is a Banach space endowed with the norm ∥u∥BV:=∥u∥TV+∥u∥1,
where the total variation ∥u∥TV is given by
[TABLE]
The Sobolev type embedding on BV states W1,1↪BV↪Lr for 1≤r≤1∗.
We introduce Eq and E~q by
[TABLE]
and similarly Dα and D~α by
[TABLE]
for 1<q≤1∗ and a,b,α>0.
Proposition 2.1**.**
Let 1<q≤1∗.
(i)* There holds Eq=E~q=(NN−1ωN−11)q−1.*
(ii)* Eq is attained by functions of the form u=λχB∈BV with λ∈R∖{0} and a ball B⊂RN.
Moreover, the maximizer of Eq necessarily has this form.*
(iii)* E~q is not attained in W1,1∖{0}.*
Proof.
First, recall the facts that it holds
E1∗=NωN−1N−111 and E1∗ is attained only by functions of the form u=λχB∈BV with λ∈R∖{0} and a ball B⊂RN.
(i) By Hölder’s inequality and Mazya’s inequality, we have for u∈BV
[TABLE]
which implies Eq≤(NN−1ωN−11)q−1.
Let u0=χB1(0)∈BV. Then we can compute
∥u0∥1=∥u0∥qq=NωN−1 and ∥u0∥TV=ωN−1,
and then we observe Eq(u0)=(NN−1ωN−11)q−1.
Hence, u0 is a maximizer of Eq and it follows Eq=(NN−1ωN−11)q−1.
Next, we prove Eq=E~q.
It is enough to show Eq≤E~q since the converse inequality is obtained
by the facts W1,1⊂BV and ∥∇u∥1=∥u∥TV for u∈W1,1.
Let u0∈BV∖{0} be a maximizer of Eq,
where note that the existence of u0 has been already established as above.
By an approximation argument, there exists a sequence {un}n=1∞⊂BV∩C∞
such that un→u0 in L1 and ∥un∥TV→∥u0∥TV,
and up to a subsequence, un→u0 a.e. on RN.
We observe that un∈W1,1 with ∥un∥TV=∥∇un∥1.
Indeed, by using the fact that there holds ∥v∥TV(Ω)=∫Ω∣∇v∣ for any v∈BV(Ω)∩C∞(Ω) with a bounded domain having its sufficiently smooth boundary,
we see
[TABLE]
where the last equality is shown by Lebesgue’s monotone convergence theorem.
Then it holds un=0 in W1,1 for large n since
∥∇un∥1=∥un∥TV→∥u0∥TV>0 as n→∞.
Now we see by the convergences of un together with Fatou’s lemma,
[TABLE]
Thus the assertion (i) has been proved.
(ii) Let u0=λχB∈BV for λ∈R∖{0} and a ball B=BR(x0)
with a radius R>0 centered at x0∈RN.
Then we can compute
[TABLE]
and thus these relations together with the assertion (i) show
Eq(u0)=(NN−1ωN−11)q−1=Eq.
Hence, u0 is a maximizer of Eq.
Next, assume that Eq is attained by u0∈BV∖{0}.
Then by Hölder’s inequality and the assertion (i), we have
[TABLE]
which shows that u0 is a maximizer of E1∗.
Hence, u0=λχB for some λ∈R∖{0} and a ball B⊂RN.
The assertion (ii) has been proved.
(iii) By contradiction, assume that E~q is attained by u0∈W1,1∖{0}.
Then the assertion (i) and the facts W1,1⊂BV and ∥∇u∥1=∥u∥TV
for u∈W1,1 imply that u0∈BV∖{0} is a maximizer of Eq.
Then the assertion (ii) shows that u0=λχB for λ∈R∖{0} and a ball B⊂RN,
which is a contradiction to u0∈W1,1.
The assertion (iii) has been proved.
∎
Lemma 2.2**.**
Let 1<q≤1∗, α>0, a>0 and b>0.
Then there hold Dα=supt>0fα(t) and αv=Eq1inft>0g(t) where for t>0,
[TABLE]
Proof.
For u∈BV with ∥u∥TVa+∥u∥1b=1, we see
[TABLE]
which yields Dα≤supt>0fα(t).
On the other hand, let v∈BV∖{0} be a maximizer of Eq.
The existence of v was obtained by Proposition 2.1 (ii).
For λ>0, we define vλ(x):=Kλv(λN1x),
where K=K(λ)>0 is determined uniquely by
[TABLE]
Then we observe for λ>0,
[TABLE]
By the equation (2.1), we see that K=K(λ) is a continuous
function on (0,∞) satisfying K<∥v∥11 for λ>0, limλ↓0K=∥v∥11 and limλ→∞K=0. Thus we obtain
Dα≥supλ>0fα(Kb∥v∥1b1−1)=supt>0fα(t). Thus we have proved Dα=supt>0fα(t).
Next, for u∈BV with ∥u∥TVa+∥u∥1b=1, we see
[TABLE]
and thus there holds αv≥Eq1inft>0g(t).
On the other hand, let v∈BV∖{0} be a maximizer of Eq
and define vλ as above. Then we see for λ>0,
[TABLE]
and thus we get αv≤Eq1infλ>0g(Kb∥v∥1b1−1)=Eq1inft>0g(t).
Thus we have proved αv=Eq1inft>0g(t).
∎
Lemma 2.3**.**
Let 1<q≤1∗, α>0, a>0 and b>0. Assume that Dα is attained by u0∈BV. Then there exist R>0, x0∈RN and λ0∈R∖{0} such that
u0=λ0χBR(x0), where the coefficient λ0 satisfies
[TABLE]
In addition, supt>0fα(t) is attained at t=(RN)b(∣λ0∣RN−1ωN−1)a−b.
Proof.
By Lemma 2.2, we see
[TABLE]
which implies that u0 is a maximizer of Eq. By applying Proposition 2.1 (ii),
we can write u0=λ0χBR(x0) for some λ0∈R∖{0}, R>0 and x0∈RN.
Moreover, since ∥u0∥1=∣λ0∣RNNωN−1 and ∥u0∥TV=∣λ0∣RN−1ωN−1,
the coefficient λ0 satisfies
[TABLE]
In addition, the relation (2.3) also implies that supt>0fα(t) is attained at
[TABLE]
The proof of Lemma 2.3 is complete.
∎
Corollary 2.4**.**
Let 1<q≤1∗, α>0, a>0 and b>0. Then D~α is not attained.
Proof.
On the contrary, assume that D~α is attained by u0∈W1,1.
Then recalling ∥∇u0∥1=∥u0∥TV, we see that
u0 also becomes a maximizer of Dα. Then by Lemma 2.3,
we have u0=λ0χB with some λ0∈R∖{0}
and some ball B⊂RN, which is a contradiction to u0∈W1,1.
∎
We are ready to prove Theorem 1.5 :
Proof of Theorem 1.5.
First, we show Σ⊃{±μ(t0)χBr(t0)(x0)∈BV∣t0∈Π and x0∈RN}. To this end, let t0∈Π, x0∈RN and R>0.
Recall that v:=±χBR(x0′) is a maximizer of Eq,
where x0′:=NRt0a1(t0+1)aba−bx0.
For λ>0, define vλ(x):=Kλv(λN1x),
where K=K(λ)>0 is determined uniquely by
[TABLE]
Then we see
[TABLE]
Note that the relation (2.4) shows limλ↓0K=∥v∥11, limλ→∞K=0 and
[TABLE]
Hence, the relation (2.5) implies that there exists λ0>0 uniquely such that
[TABLE]
Combining (2.4) with (2.6), we can compute
[TABLE]
where we have used ∥v∥1=RNNωN−1 and ∥v∥TV=RN−1ωN−1.
By Lemma 2.2, we see
[TABLE]
which implies that vλ0 is a maximizer of Dα. Moreover, by (2.6) and (2.7), we can compute
vλ0=±μ(t0)χBr(t0)(x0).
Next, we show Σ⊂{±μ(t0)χBr(t0)(x0)∈BV∣t0∈Π and x0∈RN}. To this end, let u0∈BV be a maximizer of Dα.
Then by Lemma 2.3, we can write u0=λ0χBR(x0) with some R>0, x0∈RN and λ0∈R∖{0},
where λ0 satisfies (2.2).
We take t0>0 uniquely determined by the equation R=r(t0)
and put ν:=μ(t0).
Then we observe that R and ν satisfy (νRN−1ωN−1)a+(νRNNωN−1)b=1,
which implies ν=∣λ0∣ since ∣λ0∣ satisfies the same equation by (2.2).
Therefore, in order to complete the proof, it suffices to prove t0∈Π.
Noting that u0 is a maximizer both of Dα and Eq together with
Lemma 2.2, we see
[TABLE]
where we have used ∥u0∥1b∥u0∥TVa=t0.
Hence, it follows supt>0fα(t)=fα(t0), which means t0∈Π.
The proof of Theorem 1.5 is complete.
∎
3 Proof of Theorems 1.1-1.2
In this section, we shall prove Theorems 1.1-1.2.
We start from the following lemma :
Lemma 3.1**.**
Let 1<q<1∗, a>0 and b>0.
(i)* Let α>αv. Then Dα is attained.*
(ii)* Assume αv>0 and let 0<α<αv. Then Dα is not attained.*
Proof.
By Theorem 1.5, we see that Dα is attained if and only if supt>0fα(t)
is attained.
(i) Let α>αv. Note that the condition q<1∗ shows limt→∞fα(t)=0. By the assumption α>αv and Lemma 2.2,
there exists t0>0 such that α>Eq1g(t0), which implies fα(t0)>1=limt↓0fα(t). Hence, supt>0fα(t) is attained.
(ii) Assume αv>0 and let 0<α<αv.
By contradiction, assume that there exists t0>0 such that
supt>0fα(t)=fα(t0). First, note supt>0fα(t)≥limt↓0fα(t)=1. By the assumption α<αv and Lemma 2.2, we obtain
α<αv≤Eq1g(t0), which implies fα(t0)<1.
Then we see 1≤supt>0fα(t)=fα(t0)<1, which is a contradiction.
Thus supt>0fα(t) is not attained.
∎
Lemma 3.2**.**
Let 1<q<1∗, a>0 and b>0.
(i)* Let a>N(q−1). Then there holds αv=0,
and Dα is attained for α>0.*
(ii)* Let a<N(q−1). Then there holds αv>0,
and Dα is attained for α≥αv,
while Dα is not attained for 0<α<αv.*
Proof.
(i) Let a>N(q−1). In this case, since limt↓0g(t)=0 and g(t)>0 for t>0,
by Lemma 2.2, we obtain αv=Eq1inft>0g(t)=Eq1limt↓0g(t)=0,
and then Lemma 3.1 (i) implies that Dα is attained for α>0.
(ii) Let a<N(q−1). The conditions a<N(q−1) and q<1∗ imply limt↓0g(t)=limt→∞g(t)=∞.
Since g(t)>0 for t>0, there exists t0>0 such that inft>0g(t)=g(t0)>0,
and then Lemma 2.2 shows αv=Eq1inft>0g(t)=Eq1g(t0)>0.
By Lemma 3.1, it remains to prove Dαv is attained,
which is equivalent to supt>0fαv(t) is attained.
Note that αv=Eq1g(t0) implies fαv(t0)=1. Recalling limt↓0fαv(t)=1
and limt→∞fαv(t)=0, we can conclude that supt>0fαv(t) is attained.
∎
Lemma 3.3**.**
Let 1<q<1∗, a=N(q−1) and b>0.
(i)* Let 2(N−1)2N−1<q<1∗ and b≥b0:=(q−1)(N−1)−(N−(N−1)q)>0.
Then there holds αv=bEq1, and Dα is attained for α>αv,
while Dα is not attained for 0<α≤αv.*
(ii)* Let 2(N−1)2N−1<q<1∗ and b<b0.
Then there holds 0<αv<bEq1, and Dα is attained for α≥αv,
while Dα is not attained for 0<α<αv.*
(iii)* Let 1<q≤2(N−1)2N−1. Then there holds αv=bEq1,
and Dα is attained for α>αv,
while Dα is not attained for 0<α≤αv.*
Proof.
First, note limt↓0g(t)=b1, and then αv=Eq1inft>0g(t)≤bEq1.
(i) Let 2(N−1)2N−1<q<1∗ and b≥b0. Define the function ϕ(t) for t>0 by
[TABLE]
We can compute
[TABLE]
and ϕ′′(t)=(1+t)−1−b(q−1)(N−1)φ(t), where
[TABLE]
We see that the condition b≥b0 implies φ(t)>φ(0)≥0 for t>0.
Hence, ϕ′(t)>ϕ′(0)=0 for t>0, and then ϕ(t)>ϕ(0)=0 for t>0,
which is equivalent to g(t)>b1 for t>0. Therefore, there holds αv=Eq1inft>0g(t)≥bEq1,
and it follows αv=bEq1. It remains to prove that Dαv is not attained.
Indeed, since g(t)>b1 for t>0 is equivalent to fαv(t)<1 for t>0,
we know that Dαv=supt>0fαv(t)=1 is not attained.
(ii) Let 2(N−1)2N−1<q<1∗ and b<b0. In this case, since the condition b<b0 implies φ(0)<0,
there exists a unique t0>0 such that ϕ′′(t0)=0, ϕ′′(t)<0 for t∈(0,t0) and ϕ′′(t)>0 for t∈(t0,∞).
Then by noting ϕ′(0)=0 and limt→∞ϕ′(t)=∞, we see that
there exists a unique t1∈(t0,∞) such that ϕ′(t1)=0,
ϕ′(t)<0 for t∈(0,t1) and ϕ′(t)>0 for t∈(t1,∞).
Similarly, the facts ϕ(0)=0 and limt→∞ϕ(t)=∞ imply that
there exists a unique t2∈(t1,∞) such that ϕ(t2)=0,
ϕ(t)<0 for t∈(0,t2) and ϕ(t)>0 for t∈(t2,∞).
Note that ϕ(t)<0 for t∈(0,t2) is equivalent to g(t)<b1 for t∈(0,t2),
which implies αv=Eq1inft>0g(t)<bEq1.
Moreover, since limt↓0g(t)=b1, limt→∞g(t)=∞ and g(t)>0 for t>0,
we obtain αv=Eq1inft>0g(t)>0. It remains to check that Dαv is attained.
The signs of ϕ from the above observations give g(t2)=b1, g(t)<b1 for t∈(0,t2) and g(t)>b1 for t∈(t2,∞).
These facts together with limt↓0g(t)=b1 yield that there exists t3∈(0,t2) satisfying inft>0g(t)=g(t3),
and hence, αv=Eq1inft>0g(t)=Eqg(t3).
Therefore, we obtain αvEq=g(t3) which is equivalent to fαv(t3)=1=limt↓0fαv(t).
Recalling limt→∞fαv(t)=0, we see that Dαv=supt>0fαv(t) is attained.
(iii) Let 1<q≤2(N−1)2N−1. In this case, we see ϕ′′(t)>0 for t>0,
and hence, in the same way as in the case (i), we get the desired result.
∎
Proposition 3.4**.**
Let 1<q<1∗, a>0 and b>0.
(i)* Let 2(N−1)2N−1<q<1∗ and a=N(q−1). Then there hold
limb↓0αv=∞ and limb↑b0αv=b0Eq1.*
(ii)* Let a<N(q−1). Then there hold limb↓0αv=∞ and limb→∞αv=0.*
(iii)* There holds lima↓0αv=∞.*
(iv)* Let 2(N−1)2N−1<q<1∗ and b≥b0, or let 1<q≤2(N−1)2N−1.
Then there holds lima↑N(q−1)αv=bEq1.*
Proof.
(i) Let 2(N−1)2N−1<q<1∗, a=N(q−1) and b<b0.
In the proof of Lemma 3.3 (ii), we proved that inft>0g(t) is attained by some t=tb∈(0,∞), and then
[TABLE]
Noting b<b0<(q−1)(N−1) and thus 1−b(q−1)(N−1)<0, and using the inequality
t(1+t)1+bN−q(N−1)−1≥1+bN−q(N−1) for t>0, we see
[TABLE]
which implies limb↓0αv=∞.
Next, we prove limb↑b0αv=b0Eq1.
To this end, we claim limb↑b0t2=0, which implies limb↑b0t3=0 since 0<t3<t2,
where the numbers t2 and t3 are the ones introduced in the proof of Lemma 3.3 (ii).
We write t2=t2(b) and t3=t3(b) for b<b0. Take any positive sequence {bi}i=1∞ satisfying
bi↑b0 as i→∞. Recall that for each i, t2(bi) satisfies
[TABLE]
Since 1−bi(q−1)(N−1)→1−b0(q−1)(N−1)<0 as i→∞,
the equation (3.1) shows that the sequence {t2(bi)}i=1∞ is bounded,
and hence, we may assume that limi→∞t2(bi)=c0 for some c0≥0.
Then letting i→∞ in (3.1) gives ϕ(c0)=0, which implies c0=0
since we proved ϕ(t)>0 for t>0 when b=b0 in the proof of Lemma 3.3 (i).
Therefore, the fact limb↑b0t3(b)=0 has been proved. Now we see
[TABLE]
On the other hand, since inft>0g(t)≤limt↓0g(t)=b1 for b<b0,
we obtain limsupb↑b0αv=Eq1limsupb↑b0(inft>0g(t))≤b0Eq1.
As a result, the fact limb↑b0αv=b0Eq1 has been proved.
(ii) Let a<N(q−1). We first prove limb↓0αv=∞.
Since limt↓0g(t)=limt→∞g(t)=∞, there exists tb∈(0,∞) such that inft>0g(t)=g(tb)>0.
Take any positive sequence {bj}j=1∞ satisfying bj↓0 as j→∞.
First, suppose liminfj→∞tbj∈(0,∞]. In this case, we may assume tbj≥c for j with some c>0.
Then we see for j,
[TABLE]
as j→∞. Hence, there holds limb↓0αv=∞.
Next, suppose liminfj→∞tbj=0, and we may assume tbj↓0 as j→∞.
Since bj<1 for large j∈N, there holds
(1+t)bj1−1≥t(1+t)bj1−1 for t>0.
By using this inequality and the condition a<N(q−1), we see
[TABLE]
as j→∞. Then there holds limb↓0αv=∞. Next, we see
[TABLE]
as b→∞, and thus it follows limb→∞αv=0.
(iii) We prove lima↓0αv=∞.
Let a<N(q−1). Then since limt↓0g(t)=limt→∞g(t)=∞,
there exists ta∈(0,∞) such that inft>0g(t)=g(ta)>0.
Take any positive sequence {aj}j=1∞ satisfying N(q−1)>aj↓0 as j→∞.
First, suppose liminfj→∞taj∈(0,∞].
In this case, we may assume taj≥c for j with some c>0.
Then we see for j,
[TABLE]
Suppose liminfj→∞taj=∞. Then by (3.2), we have
[TABLE]
as j→∞, and hence limj→∞αv=∞.
Suppose liminfj→∞taj∈(0,∞). Then we may assume that c≤taj≤c~ for j with some c~>c.
Hence, by (3.2), we see
[TABLE]
as j→∞, and hence limj→∞αv=∞.
Next, suppose liminfj→∞taj=0, and we may assume taj↓0 as j→∞.
Then we see
[TABLE]
as j→∞, and hence, limj→∞αv=∞.
As a conclusion, we have proved lima↓0αv=∞.
(iv) Let 2(N−1)2N−1<q<1∗ and b≥b0, or let 1<q≤2(N−1)2N−1.
We prove lima↑N(q−1)αv=bEq1.
For a>0, we write αv=αv(a) and g=ga. Letting a<N(q−1), we see
αv(a)≤Eqga(t) for t>0, and then
limsupa↑N(q−1)αv(a)≤EqgN(q−1)(t) for t>0.
Taking the infimum for t∈(0,∞) in this relation yields limsupa↑N(q−1)αv(a)≤αv(N(q−1))=bEq1,
where we have used Lemma 3.3 (i) and (iii).
Next, let a<N(q−1), and let ta∈(0,∞) be a point satisfying inft>0ga(t)=ga(ta),
and hence, αv(a)=Eqga(ta).
Take any positive sequence {aj}j=1∞ satisfying
aj↑N(q−1) as j→∞. First, suppose limj→∞taj∈(0,∞), and then we may assume
taj→t0∈(0,∞) as j→∞. We see
[TABLE]
where we have used Lemma 3.3 (i) and (iii).
On the other hand, since we have already proved limj→∞αv(aj)≤bEq1,
we obtain gN(q−1)(t0)=b1. However, this is impossible since we observed gN(q−1)(t)>b1 for t>0
in the proof of Lemma 3.3 (i) and (iii). Next, suppose limj→∞taj=∞, and then we may assume
taj→∞ as j→∞. We see for j,
[TABLE]
as j→∞, and hence, limj→∞αv(aj)=∞,
which is a contradiction since we have already proved limsupj→∞αv(aj)≤bEq1.
As a result, it holds limj→∞taj=0, and hence, lima↑N(q−1)ta=0.
Then we see
[TABLE]
As a conclusion, we have lima↑N(q−1)αv(a)=bEq1.
∎
Proof of Theorems 1.1-1.2.
Gathering up Lemmas 3.2-3.3 and Proposition 3.4, we have the results stated in Theorems 1.1-1.2.
∎
4 Proof of Theorems 1.3-1.4
In this section, we shall prove Theorems 1.3-1.4.
We start from the following lemma :
Lemma 4.1**.**
Let α>0, a>0 and b>0. Then there hold Dα=supt>0fα(t),
αv=E1∗1inft>0g(t) and αc=E1∗1supt>0h(t) where for t>0,
[TABLE]
Proof.
The former two equalities are obtained by putting q=1∗ in Lemma 2.2.
Hence, we consider αc. For u∈BV with ∥u∥TVa++∥u∥1b=1, we see
[TABLE]
which shows αc≤E1∗1supt>0h(t).
On the other hand, let v∈BV∖{0} be a maximizer of E1∗.
For λ>0, define vλ(x):=Kλv(λN1x),
where K=K(λ)>0 is uniquely determined by
[TABLE]
Then for λ>0, we observe
[TABLE]
Since K=K(λ) is a continuous function on (0,∞)
satisfying K<∥v∥11 for λ>0,
limλ↓0K=∥v∥11 and limλ→∞K=0,
we obtain
[TABLE]
Hence, the proof of Lemma 4.1 is complete.
∎
Lemma 4.2**.**
Let a>0 and b>0.
(i)* Assume αc<∞ and let α>αc.
Then Dα is not attained.*
(ii)* Assume αv>0 and let α<αv.
Then Dα is not attained.*
(iii)* Assume αv<αc and let αv<α<αc.
Then Dα is attained.*
Proof.
By Theorem 1.5, we see that Dα is attained if and only if supt>0fα(t) is attained.
(i) Assume αc<∞ and let α>αc.
By contradiction, assume that there exists t0>0 such that
supt>0fα(t)=fα(t0). First, note supt>0fα(t)≥limt→∞fα(t)=αE1∗. By Lemma 4.1 and the assumption α>αc,
we obtain α>αc≥E1∗1h(t0), which implies fα(t0)<αE1∗.
Then we see αE1∗≤supt>0fα(t)=fα(t0)<αE1∗,
which is a contradiction. Thus supt>0fα(t) is not attained.
(ii) Assume αv>0 and let α<αv.
By contradiction, assume that there exists t0>0 such that supt>0fα(t)=fα(t0).
First, note supt>0fα(t)≥limt↓0fα(t)=1.
By Lemma 4.1 and the assumption α<αv, we obtain
α<αv≤E1∗1g(t0), which implies fα(t0)<1.
Then we see 1≤supt>0fα(t)=fα(t0)<1, which is a contradiction. Thus supt>0fα(t) is not attained.
(iii) Assume αv<αc and let αv<α<αc.
First, note that limt↓0fα(t)=1 and limt→∞fα(t)=αE1∗.
By the assumption α>αv, there exists t0>0 such that
α>E1∗1g(t0), which implies fα(t0)>1.
On the other hand, by the assumption α<αc,
there exists t1>0 such that α<E1∗1h(t1), which implies fα(t1)>αE1∗. As a result, supt>0fα(t) is attained.
∎
Lemma 4.3**.**
Let a>1∗ and b>0. Then there hold
[TABLE]
In particular, there hold
limb↓0αc=E1∗1,
limb↑1αc=1∗E1∗a, αc=1∗E1∗a when b=1,
lima↓1∗αc=E1∗1 when b≤1 and lima→∞αc=∞ when b≤1.
Moreover,
[TABLE]
while
[TABLE]
Proof.
Let a>1∗. First, we can compute
[TABLE]
and then noting g(t)>0 for t>0, we have
αv=E1∗1inft>0g(t)=E1∗1limt↓0g(t)=0.
Next, we see limt↓0h(t)=1 and
[TABLE]
We distinguish between three cases.
First, let b>1. Then it holds αc=E1∗1supt>0h(t)=E1∗1limt→∞h(t)=∞,
and then by Lemma 4.2 together with αv=0,
Dα is attained for α>0.
Next, let b=1. In this case, it follows limt→∞h(t)=1∗a.
By a direct computation, we obtain for t>0,
[TABLE]
where h~(t):=1+at1∗−(t1+t)a1∗.
Since limt→∞h~(t)=0, we observe h~(t)>0 for t>0,
which implies h′(t)>0 for t>0. Summing-up, we have limt↓0h(t)=1,
limt→∞h(t)=1∗a>1 and h′(t)>0 for t>0, which show
αc=E1∗1supt>0h(t)=E1∗1limt→∞h(t)=1∗E1∗a and 1<h(t)<1∗a for t>0.
Thus by Lemma 4.2, Dα is attained for 0<α<αc(=1∗E1∗a), while Dα is not attained for α>αc.
Furthermore, the relation h(t)<1∗a=αcE1∗ for t>0
implies fαc(t)<αcE1∗=lims→∞fαc(s)≤sups>0fαc(s) for t>0. Hence, supt>0fαc(t) is not attained,
which is equivalent to the non-attainability of Dαc by Theorem 1.5. Next, let b<1. By a direct computation, we have for t>0,
[TABLE]
where h~(t):=1+atb1∗−(t1+t)a1∗. Then we obtain
[TABLE]
where t0:=1−ba−1∗aba−1∗a>0.
Since limt→∞h~(t)=0 and
h~(t)=t1(ab1∗+t−t1−a1∗(1+t)a1∗)→∞ as t↓0, there exists t1∈(0,t0) such that
[TABLE]
which implies
[TABLE]
This fact together with limt↓0h(t)=1 and limt→∞h(t)=0 shows
αc=E1∗1supt>0h(t)=E1∗1h(t1),
and then it follows E1∗1<αc<∞.
Thus by Lemma 4.2, Dα is attained for 0<α<αc, while Dα is not attained for α>αc.
Furthermore, note that αc=E1∗1h(t1)
is equivalent to fαc(t1)=αcE1∗.
This fact together with limt↓0fαc(t)=1
and limt→∞fαc(t)=αcE1∗=h(t1)>1,
we can conclude that supt>0fαc(t) is attained,
and hence, Dαc is attained by Theorem 1.5.
It remains to show the asymptotic behaviors of αc on a and b.
First, we prove limb↓0αc=E1∗1.
Since 0<t1<t0→0 as b↓0, we have t1→0 as b↓0,
and then we see limb↓0h(t1)=1, which implies
limb↓0αc=E1∗1limb↓0h(t1)=E1∗1.
Next, we prove limb↑1αc=1∗E1∗a.
We write t1=t1(b) for 0<b<1. First, we claim limb↑1t1(b)=∞.
On the contrary, assume limb↑1t1(b)<∞.
Then we can pick up a sequence {bj}j=1∞⊂(0,1) satisfying
bj↑1 as j→∞ and limj→∞t1(bj)=t1∈[0,∞).
Recall that t1(bj) satisfies h~(t1(bj))=0, which implies
[TABLE]
for each j. Letting j→∞ in (4.1), we obtain
[TABLE]
which shows that t1>0 is a solution of h~(t)=0 for t>0 with b=1.
On the other hand, in the same way as above, we see that h~(t)
for t>0 with b=1 satisfies limt↓0h~(t)=∞,
limt→∞h~(t)=0 and h~′(t)<0 for t>0,
and hence, it holds h~(t)>0 for t>0,
which is a contradiction to h~(t1)=0.
As a result, we obtain limb↑1t1(b)=∞,
which is equivalent to limb↑1t1(b)=∞.
Now we compute limb↑1h(t1).
Since t1 satisfies h~(t1)=0, we have
(1+t1)a1∗=t1−aa−1∗(ab1∗+t1).
Plugging this relation to h(t1), we obtain
[TABLE]
Since t1(b)→∞ as b↑1, in order to prove limb↑1h(t1)=1∗a, it is enough to show that limb↑1t11−b=1.
Recalling 0<t1<t0, we have (1−b)logt1≤(1−b)logt0→0 as b↑1,
which shows limb↑1(1−b)logt1(b)=0,
and hence, it holds limb↑1t11−b=1.
As a conclusion, we obtain limb↑1h(t1)=1∗a,
which gives limb↑1αc=1∗E1∗a.
Next, we prove lima→∞αc=∞ when b≤1.
We may assume b<1 since we have already proved αc=1∗E1∗a when a>1∗ and b=1.
Noting t0→1−bb as a→∞, we see h(t0)→∞ as a→∞.
Then since t1(<t0) is the maximum point of h(t) for t>0, we see h(t1)>h(t0)→∞ as a→∞,
which shows lima→∞h(t1)=∞, and hence, it holds lima→∞αc=E1∗1lima→∞h(t1)=∞.
Next we show lima↓1∗αc=E1∗1 when b≤1.
In the same reason as above, we may assume b<1.
Since b<1, we see 0<t1<t0→0 as a↓1∗, and hence, it holds lima↓1∗t1=0.
Then we have lima↓1∗h(t1)=1, which is equivalent to lima↓1∗αc=E1∗1.
The proof of Lemma 4.3 is complete.
∎
Lemma 4.4**.**
Let a=1∗ and b>0.
(i)* Let b>1. Then there hold αv=bE1∗1 and αc=∞,
and Dα is attained for α>αv,
while Dα is not attained for 0<α≤αv.*
(ii)* Let b=1. Then there holds αv=αc=E1∗1,
and Dα is not attained for α=αv,
while Dαv is attained.*
(iii)* Let b<1. Then there holds αv=αc=E1∗1,
and Dα is not attained for α>0.*
Proof.
(i) Let a=1∗ and b>1. Since g(t)=t(1+t)(1−(1+t)−b1)
for t>0, we see limt↓0g(t)=b1 and limt→∞g(t)=1.
We can compute for t>0, g′(t)=t−2(1+t)−b1g~(t),
where g~(t):=1+bt−(1+t)b1,
and we obtain for t>0,
g~′(t)=b1−b1(1+t)b1−1>0 since b>1.
Then noting limt↓0g~(t)=0, we have g~(t)>0 for t>0,
which implies g′(t)>0 for t>0.
Here, recalling limt↓0g(t)=b1<1 and limt→∞g(t)=1,
we obtain αv=E1∗1inft>0g(t)=bE1∗1.
On the other hand, since h(t)=(1+t)1−b1 for t>0, we obtain
αc=E1∗1supt>0h(t)=∞ since b>1.
Thus by Lemma 4.2, Dα is attained for α>αv, while Dα is not attained for 0<α<αv.
Next, we consider the case α=αv.
Note αvE1∗=b1<g(t) for t>0, which implies
fαv(t)<1=lims↓0fαv(s)≤sups>0fαv(s)
for t>0. Hence, supt>0fαv(t) is not attained,
which is equivalent to the non-attainability of Dαv by Theorem 1.5.
(ii) Let a=1∗ and b=1.
In this case, since g(t)=1 for t>0, it follows
αv=E1∗1inft>0g(t)=E1∗1.
On the other hand, since h(t)=1 for t>0, it follows
αc=E1∗1supt>0h(t)=E1∗1.
Thus there holds αv=αc=E1∗1,
and by Lemma 4.2, Dα is not attained for α=αv(=αc). Next, we consider the case α=αv.
In this case, we see fαv(t)=1 for t>0,
and hence, supt>0fαv(t) is attained, which is equivalent
to the attainability of Dαv by Theorem 1.5.
(iii) Let a=1∗ and b<1. First, recall limt↓0g(t)=b1
and limt→∞g(t)=1. In the same way as in the case (i), we see
g′(t)=t−2(1+t)−b1g~(t)
with g~(t):=1+bt−(1+t)b1 for t>0.
Then we obtain g~′(t)=b1−b1(1+t)b1−1<0
for t>0 since b<1. Thus noting limt↓0g~(t)=0, we have
g~(t)<0 for t>0, which implies g′(t)<0 for t>0.
Since limt↓0g(t)=b1>1 and limt→∞g(t)=1,
it follows αv=E1∗1inft>0g(t)=E1∗1.
On the other hand, since h(t)=(1+t)1−b1 for t>0,
it follows αc=E1∗1supt>0h(t)=E1∗1.
Hence, we obtain αv=αc=E1∗1,
and then by Lemma 4.2, Dα is not attained for α=αv(=αc). Next, we consider the case α=αv.
Note αvE1∗=1<g(t) for t>0, which implies fαv(t)<1=lims↓0fαv(s)≤sups>0fαv(s) for t>0. Hence, supt>0fαv(t)
is not attained, which is equivalent to the non-attainability of Dαv by Theorem 1.5.
∎
Lemma 4.5**.**
Let a<1∗ and b>0.
(i)* Let b>1. Then there hold 0<αv<E1∗1 and αc=∞,
and Dα is attained for α≥αv,
while Dα is not attained for 0<α<αv.
Moreover, there hold limb↓1αv=E1∗1, limb→∞αv=0,
lima↓0αv=E1∗1 and lima↑1∗αv=bE1∗1.*
(ii)* Let b≤1. Then there holds αv=αc=E1∗1,
and Dα is not attained for α>0.*
Proof.
(i) Let a<1∗ and b>1. First, we see limt↓0g(t)=∞ and limt→∞g(t)=1. By a direct computation, we have for t>0,
g′(t)=t−a1∗−1(1+t)a1∗−b1−1g~(t),
where g~(t):=bt+a1∗(1−(1+t)b1),
and g~′(t)=b1−ab1∗(1+t)b1−1.
Then we observe
[TABLE]
where t0:=(a1∗)b−1b−1>0.
Note
[TABLE]
since b>1. Hence, there exists t1>t0 such that
[TABLE]
which implies
[TABLE]
Then recalling limt↓0g(t)=∞ and limt→∞g(t)=1,
we have αv=E1∗1inft>0g(t)=E1∗1g(t1)>0,
which gives 0<αv<E1∗1.
On the other hand, we see
[TABLE]
since b>1. Hence, we obtain αc=E1∗1supt>0h(t)=∞.
As a result, Dα is attained for α>αv,
while Dα is not attained for 0<α<αv.
Next, we consider the case α=αv.
Note αvE1∗=g(t1) implies fαv(t1)=1.
Combining this fact with limt↓0fαv(t)=1
and limt→∞fαv(t)=αvE1∗=g(t1)<1,
we can conclude that supt>0fαv(t) is attained, which is equivalent
to the attainability of Dαv by Theorem 1.5.
Next, we prove the asymptotic behaviors of αv on a and b.
First, we show limb→∞αv=0.
By a direct computation, we have for b>1,
[TABLE]
as b→∞. Since t1 is the minimum point of g(t) for t>0,
we have 0<g(t1)<g(t0)→0 as b→∞,
and thus it holds limb→∞g(t1)=0,
which shows αv=E1∗1g(t1)→0 as b→∞.
Next, we show limb↓1αv=E1∗1.
First, since g(t1)<1 for b>1, we obtain limb↓1g(t1)≤1.
On the other hand, recall that t1 satisfies g~(t1)=0, which implies
1+t1=(1+b1∗at1)b. Plugging this relation to g(t1), we see for b>1,
[TABLE]
as b↓1, where we used t1>t0→∞ as b↓1,
which gives limb↓1t1=∞. Furthermore, we observe for b>1,
[TABLE]
as b↓1, and hence, it holds
[TABLE]
Combining (4.2) with (4.3), we obtain
limb↓1g(t1)≥(1∗a)a1∗(a1∗)a1∗=1.
As a conclusion, we have limb↓1g(t1)=1,
which yields limb↓1αv=E1∗1limb↓1g(t1)=E1∗1.
Next, we show lima↓0αv=E1∗1.
Since g(t1)<1, we have lima↓0g(t1)≤1.
On the other hand, noting t1>t0→∞ as a↓0, we see
[TABLE]
as a↓0, and thus it holds lima↓0g(t1)≥1.
As a conclusion, we obtain lima↓0g(t1)=1, which implies lima↓0αv=E1∗1.
Next, we show lima↑1∗αv=bE1∗1.
We write t1=t1(a) for a<1∗.
First, we claim lima↑1∗t1(a)=0.
To this end, assume that lima↑1∗t1(a)=t1∈(0,∞].
Then we can pick up a sequence {aj}j=1∞∈(0,1∗) such that aj↑1∗ as j→∞
and limj→∞t1(aj)=t1. Recall that t1(aj) satisfies g~(t1(aj))=0, which implies
[TABLE]
for each j. First, assume that t1=∞. Then letting j→∞ in (4.4), we obtain b1=0, which is a contradiction.
Hence, it holds t1∈(0,∞). Now letting j→∞ in (4.4) again, we have
[TABLE]
which yields 1+t1−(1+bt1)b=0. However, this is a contradiction since we can check 1+t−(1+bt)b<0 for t>0.
As a result, we have lima↑1∗t1=0, which is equivalent to lima↑1∗t1=0.
Now we compute g(t1). By a direct computation, we see
[TABLE]
as a↑1∗, where we used lima↑1∗t1=0. Hence, in order to prove lima↑1∗g(t1)=b1,
it is enough to show lima↑1∗t1a1∗−1=1.
Since 0<t0<t1→0 as a↑1∗, we see for a<1∗ close enough to 1∗,
[TABLE]
as a↑1∗, which gives lima↑1∗(a1∗−1)logt1=0, and hence, it holds
lima↑1∗t1a1∗−1=1. As a conclusion, we obtain lima↑1∗g(t1)=b1,
which shows lima↑1∗αv=E1∗1lima↑1∗g(t1)=bE1∗1.
(ii) Let a<1∗ and b≤1.
In the same way as in the case (i), we have for t>0,
[TABLE]
where g~(t):=bt+a1∗(1−(1+t)b1).
Then we see bg~′(t)=1−a1∗(1+t)b1−1≤1−a1∗<0
for t>0 since a<1∗ and b≤1, and thus it holds g~′(t)<0 for t>0.
Then since limt↓0g~(t)=0, we obtain g~(t)<0 for t>0,
which implies g′(t)<0 for t>0.
This fact together with limt→∞g(t)=1, we have
αv=E1∗1inft>0g(t)=E1∗1.
On the other hand, we see limt↓0h(t)=1 and
[TABLE]
In the same way as in the case (i), we see for t>0,
[TABLE]
since a<1∗ and b≤1, where h~(t):=atb1∗+1−(t1+t)a1∗.
Hence, it follows h~′(t)>0 for t>0. Since limt→∞h~(t)=0,
we obtain h~(t)<0 for t>0, which shows h′(t)<0 for t>0.
This fact together with limt↓0h(t)=1 and
limt→∞h(t)={1∗a<1 when b=1,0 when b<1 gives αc=E1∗1supt>0h(t)=E1∗1.
As a result, we have αv=αc=E1∗1,
and then Dα is not attained for α=αv(=αc).
Next, we consider the case α=αv.
Note that (1=)αvE1∗<g(t) for t>0 implies
fαv(t)<1=lims↓0fαv(s)≤sups>0fαv(s)
for t>0. Hence, supt>0fαv(t) is not attained,
which is equivalent to the non-attainability of Dαv by Theorem 1.5.
The proof of Lemma 4.5 is complete.
∎
Proof of Theorems 1.3-1.4.
Gathering up Lemmas 4.3-4.5 we have the results stated in Theorems 1.3-1.4.
∎