• Sonuç bulunamadı

Bilinear multipliers of weighted Wiener amalgam spaces and variable exponent Wiener amalgam spaces

N/A
N/A
Protected

Academic year: 2021

Share "Bilinear multipliers of weighted Wiener amalgam spaces and variable exponent Wiener amalgam spaces"

Copied!
23
0
0

Yükleniyor.... (view fulltext now)

Tam metin

(1)

R E S E A R C H

Open Access

Bilinear multipliers of weighted Wiener

amalgam spaces and variable exponent

Wiener amalgam spaces

Öznur Kulak

1*

and Ahmet Turan Gürkanlı

2

Dedicated to Professor Ravi P Agarwal.

*Correspondence: oznurn@omu.edu.tr 1Department of Mathematics, Faculty of Arts and Sciences, Ondokuz Mayıs University, Kurupelit, Samsun, 55139, Turkey Full list of author information is available at the end of the article

Abstract

Let

ω

1,

ω

2be slowly increasing weight functions, and let

ω

3be any weight function

onRn. Assume that m(ξ,

η) is a bounded, measurable function on

Rn× Rn. We define

Bm(f , g)(x) =  Rn  Rn ˆf(ξ)ˆg(

η)m(ξ

,

η)e

2πiξ+η,xd

ξ

d

η

for all f , g∈ Cc∞(Rn). We say that m(ξ,η) is a bilinear multiplier onRnof type

(W(p1, q1,ω1; p2, q2,

ω

2; p3, q3,

ω

3)) if Bmis a bounded operator from

W(Lp1, Lq1 ω1)× W(L p2, Lq2 ω2) to W(L p3, Lq3 ω3), where 1≤ p1≤ q1<∞, 1 ≤ p2≤ q2<∞,

1 < p3, q3≤ ∞. We denote by BM(W(p1, q1,

ω

1; p2, q2,

ω

2; p3, q3,ω3)) the vector space

of bilinear multipliers of type (W(p1, q1,

ω

1; p2, q2,

ω

2; p3, q3,

ω

3)). In the first section of

this work, we investigate some properties of this space and we give some examples of these bilinear multipliers. In the second section, by using variable exponent Wiener amalgam spaces, we define the bilinear multipliers of type

(W(p1(x), q1,

ω

1; p2(x), q2,ω2; p3(x), q3,

ω

3)) from W(Lp1(x), Lqω11)× W(L

p2(x), Lq2

ω2) to

W(Lp3(x), Lq3

ω3), where p∗1, p∗2, p∗3<∞, p1(x)≤ q1, p2(x)≤ q2, 1≤ q3≤ ∞ for all

p1(x), p2(x), p3(x)∈ P(Rn). We denote by BM(W(p1(x), q1,

ω

1; p2(x), q2,ω2; p3(x), q3,ω3))

the vector space of bilinear multipliers of type

(W(p1(x), q1,

ω

1; p2(x), q2,ω2; p3(x), q3,

ω

3)). Similarly, we discuss some properties of this

space.

MSC: 42A45; 42B15; 42B35

Keywords: bilinear multipliers; weighted Wiener amalgam space; variable exponent

Wiener amalgam space

1 Introduction

Throughout this paper we will work onRn with Lebesgue measure dx. We denote by

Cc∞(Rn), C

c(Rn) and S(Rn) the space of infinitely differentiable complex-valued functions

with compact support onRn, the space of all continuous, complex-valued functions with

compact support onRn and the space of infinitely differentiable complex-valued func-tions onRnthat rapidly decrease at infinity, respectively. Let f be a complex-valued mea-surable function onRn. The translation, character and dilation operators T

x, Mxand Ds

are defined by Txf(y) = f (y – x), Mxf(y) = eπ ix,yf(y) and Dptf(y) = t

n pf(y

t), respectively,

©2014Kulak and Gürkanlı; licensee Springer. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

(2)

for x, y∈ Rn,  < p, t <∞. With this notation out of the way, one has, for  ≤ p ≤ ∞ andp+  p = , (Txf)ˆ(ξ) = M–xˆf(ξ), (Mxf)ˆ(ξ) = Txˆf(ξ),  Dptfˆ(ξ) = Dpt– ˆf(ξ).

For ≤ p ≤ ∞, Lp(Rn) denotes the usual Lebesgue space. A continuous function ω

satis-fying ≤ ω(x) and ω(x + y) ≤ ω(x)ω(y) for x, y ∈ Rnwill be called a weight function onRn.

If ω(x)≤ ω(x) for all x∈ Rn, we say that ω≤ ω. For ≤ p ≤ ∞, we set

LpωRn=f : f ω∈ LpRn.

It is known that Lpω(Rn) is a Banach space under the norm

f p,ω= f ω p=  Rn f(x)ω(x)pdxp , ≤ p < ∞ or f ∞,ω= f ω ∞= ess sup x∈Rn f(x)ω(x), p=∞.

The dual of the space Lpω(Rn) is the space Lqω–(Rn), wherep +q=  and ω–(x) =ω(x). We

say that a weight function υsis of polynomial type if υs(x) = ( +|x|)sfor s≥ . Let f be a

measurable function onRn. If there exist C >  and N∈ N such that

f(x) ≤C + xN

for all x∈ Rn, then f is said to be a slowly increasing function []. It is easy to see that

polynomial-type weight functions are slowly increasing. For f ∈ L(Rn), the Fourier trans-form of f is denoted by ˆf. We know that ˆf is a continuous function onRnwhich vanishes at

infinity and it has the inequality ˆf ≤ f . We denote by M(Rn) the space of bounded

regular Borel measures, by M(ω) the space of μ in M(Rn) such that

μ ω=



Rn

ωd|μ| < ∞.

If μ∈ M(Rn), the Fourier-Stieltjes transform of μ is denoted by ˆμ []. The space (Lp(Rn))

loc consists of classes of measurable functions f onRn such that

f χK∈ Lp(Rn) for any compact subset K⊂ Rn, where χK is the characteristic function of

K. Let us fix an open set Q⊂ Rnwith compact closure and ≤ p, q ≤ ∞. The weighted

Wiener amalgam space W (Lp, Lqω) consists of all elements f ∈ (Lp(Rn))locsuch that Ff(z) =

f χz+Q pbelongs to Lqω(Rn); the norm of W (Lp, Lqω) is f W(Lp,Lq

ω)= Ff q,ω[–]. In this paper, P(Rn) denotes the family of all measurable functions p :Rn→ [, ∞). We

put

p∗= ess inf

x∈Rn p(x), p

= ess sup

(3)

We shall also use the notation ∞=x∈ Rn: p(x) =∞.

The variable exponent Lebesgue spaces (or generalized Lebesgue spaces) Lp(x)(Rn) are

defined as the set of all (equivalence classes) measurable functions f onRn such that

p(λf ) <∞ for some λ > , equipped with the Luxemburg norm

f p(x)= inf  λ>  : p f λ ≤  . If p∗<∞, then f ∈ Lp(x)(Rn) if

p(f ) <∞. The set Lp(x)(Rn) is a Banach space with the norm

· p(x). If p(x) = p is a constant function, then the norm · p(x)coincides with the usual

Lebesgue norm · p[]. The spaces Lp(x)(Rn) and Lp(Rn) have many common properties.

A crucial difference between Lp(x)(Rn) and the classical Lebesgue spaces Lp(Rn) is that

Lp(x)(Rn) is not invariant under translation in general. If p<∞, then C

c (Rn) is dense in

Lp(x)(Rn). The space Lp(x)(Rn) is a solid space, that is, if f∈ Lp(x)(Rn) is given and g∈ L loc(Rn)

satisfies|g(x)| ≤ |f (x)| a.e., then g ∈ Lp(x)(Rn) and g

p(x)≤ f p(x)by []. In this paper we

will assume that p∗<∞. The space (Lp(x)(Rn))

loc consists of classes of measurable functions f onRnsuch that

f χK ∈ Lp(x)(Rn) for any compact subset K ⊂ Rn. Let us fix an open set Q⊂ Rn with

compact closure, p(x)∈ P(Rn) and ≤ q ≤ ∞. The variable exponent amalgam space W(Lp(x), Lq

ω) consists of all elements f ∈ (Lp(x)(Rn))locsuch that Ff(z) = f χz+Q p(x)belongs

to Lqω(Rn); the norm of W (Lp(x), Lqω) is f W(Lp(x),Lq

ω)= Ff q,ω[].

2 The bilinear multipliers space BM[W(p1, q1,ω1; p2, q2,

ω

2; p3, q3,

ω

3)]

Lemma . Let≤ p ≤ q < ∞ and ω be a slowly increasing weight function. Then Cc∞(Rn)

is dense in the Wiener amalgam space W(Lp, Lq ω).

Proof Since Cc(Rn) = Lqω(Rn) [], we have Cc(Rn) = W (Lp, Lqω) by a lemma in []. Also we

have the inclusion Cc∞Rn⊂ Cc  Rn⊂ WLp, Lq ω  .

For the proof that Cc (Rn) is dense in W (Lp, Lq

ω), take any f ∈ W(Lp, Lqω). For given ε > ,

there exists g∈ Cc(Rn) such that

f – g W(Lp,Lq ω)<

ε

. (.)

Also, since g∈ Cc(Rn)⊂ Lqω(Rn) and Cc∞(Rn) is dense in Lqω(Rn), by Lemma . in [],

there exists h∈ Cc∞(Rn) such that

g – h q,ω<

ε .

Furthermore, by using the inequality p≤ q, we write g – h W(Lp,Lq

ω)≤ g – h q,ω< ε

(4)

(see [] and []). Combining (.) and (.), we obtain f – h W(Lp,Lq

ω)≤ f – g W(Lp,Lqω)+ h – g W(Lp,Lqω)< ε.

This completes the proof. 

Definition . Let ≤ p≤ q<∞,  ≤ p≤ q<∞,  < p, q≤ ∞ and ω, ω, ωbe

weight functions onRn. Assume that ω

, ωare slowly increasing functions and m(ξ , η) is

a bounded, measurable function onRn× Rn. Define

Bm(f , g)(x) =  Rn  Rnˆf(ξ)ˆg(η)m(ξ,η)e π iξ+η,xdξ dη for all f , g∈ Cc∞(Rn).

mis said to be a bilinear multiplier onRnof type (W (p

, q, ω; p, q, ω; p, q, ω)) if

there exists C >  such that

Bm(f , g) W(Lp,Lqω)≤ C f W(Lp,Lqω) g W(Lp,Lqω)

for all f , g∈ Cc∞(Rn). That means that B

m extends to a bounded bilinear operator from

W(Lp, Lqω)× W(Lp, L qω) to W (Lp, L qω).

We denote by BM[W (p, q, ω; p, q, ω; p, q, ω)] the space of all bilinear multipliers

of type (W (p, q, ω; p, q, ω; p, q, ω)) and m (W (p,q;p,q;p,q))= Bm .

The following theorem is an example to a bilinear multiplier onRnof type (W (p, q, ω;

p, q, ω; p, q, ω)). Theorem . Let p  +  p =  p,  q +  q =  qand ω≤ ω. If K∈ Lω(R n), then m(ξ , η) =

ˆK(ξ – η) defines a bilinear multiplier and m (W (p,q;p,q;p,q))≤ K ,ω.

Proof We know by Theorem . in [] that for f , g∈ Cc (Rn), Bm(f , g)(t) =



Rn

f(t – y)g(t + y)K (y) dy. (.)

Also by Proposition .. in [], Tyf ∈ W(Lp, Lqω), T–yg∈ W(Lp, Lqω). So, we write FTyfLq

ω(Rn), FT–yg∈ L

q

ω(Rn).

Using the Minkowski inequality and the generalized Hölder inequality, we have Bm(f , g) W(Lp,Lqω) = Bm(f , g)χQ+x pq

= 

Rnf(t – y)g(t + y)K (y) dy χQ+x pq ≤ Rn f(t – y)g(t + y)χQ+x(t) pqK(y)dy ≤  Rn

f(t – y)χQ+x(t) p g(t + y)χQ+x(t) p qK(y)dy

= 

Rn

(5)

Again, by using Proposition .. in [] and the assumption ω≤ ω, we write

FTyfωq≤ ω(y) f W(Lp,Lqω)<∞. (.)

From this result, we find FTyf ∈ L

q

ω(Rn). Hence by (.), (.) and the generalized Hölder

inequality, we obtain Bm(f , g) W(Lp,Lqω)≤  Rn FTyf(x)ω(x) q FT–yg(x) qK(y)dy ≤  Rn f W(Lp,Lqω) g W(Lp,Lqω) K(y)ω(y) dy = f W(Lp,Lqω) g W(Lp,Lqω) K ,ω= C f W(Lp,Lqω) g W(Lp,Lqω), (.)

where C = K ,ω. Then m(ξ , η) = ˆK(ξ – η) defines a bilinear multiplier. Finally, using

(.), we obtain m (W (p,q;p,q;p,q))= sup f W(Lp ,Lq ω )≤, g W(Lp ,Lqω )≤ Bm(f , g) W(Lp,Lqω) f W(Lp,Lqω) g W(Lp,Lqω) ≤ K ,ω. 

Definition . Let ≤ p≤ p<∞,  ≤ q≤ q<∞,  < p, q≤ ∞ and ω, ω, ωbe

weight functions onRn. Suppose that ω

, ωare slowly increasing functions. We denote

by ˜M[(p, q, ω; p, q, ω; p, q, ω)] the space of measurable functions M :Rn→ C such

that m(ξ , η) = M(ξ – η)∈ BM[W(p, q, ω; p, q, ω; p, q, ω)], that is to say,

BM(f , g)(x) =  Rn  Rnˆf(ξ)ˆg(η)M(ξ – η)e π iξ+η,xdξ dη

extends to a bounded bilinear map from W (Lp, Lq

ω)× W(Lp, L qω) to W (Lp, L qω). We denote M (W (p,q;p,q;p,q))= BM .

Let ω be a weight function. The continuous function ω– cannot be a weight

func-tion. But the following lemma can be proved easily by using the technique of the proof of Lemma ..

Lemma . Let≤ p ≤ q < ∞ and ω be a slowly increasing continuous weight function. Then Cc∞(Rn) is dense in W (Lp, Lq

ω–) Wiener amalgam space. Theorem . Letp  +  p = ,  q + 

q = , q ≥ p≥  and ωbe a continuous, symmetric

slowly increasing weight function. Then m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)] if and

only if there exists C>  such that  Rn  Rnˆf(ξ)ˆg(η)ˆh(ξ + η)m(ξ,η)dξ dη   ≤ C f W(Lp,Lqω) g W(Lp,Lqω) h W(Lp,Lq ω–) for all f, g, h∈ Cc∞(Rn).

(6)

Proof We assume that m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)]. By Theorem . in [],

we write, for all f , g, h∈ Cc∞(Rn),

 Rn  Rnˆf(ξ)ˆg(η)ˆh(ξ + η)m(ξ,η)dξ dη   =Rnh(y) ˜Bm(f , g)(y) dy   ≤ Rn h(y)˜Bm(f , g)(y)dy, (.)

where ˜Bm(f , g)(y) = Bm(f , g)(–y). If we set –t = u, we have

˜Bm(f , g) W(Lp,Lqω)= F Q ˜Bm(f ,g) q= Bm(f , g)(u)χQ+x(–u) pq = Bm(f , g)(u)χ–Q–x(u) p q= FB–Qm(f ,g)(–x) q. (.)

Since ωis a symmetric weight function, if we set –x = y, we have

˜Bm(f , g) W(Lp,Lqω)= F –Q

Bm(f ,g)(y) q. (.)

We know from [] and [] that the definition of W (Lp, Lq

ω) is independent of the choice

of Q. Then there exists C >  such that FB–Qm(f ,g)(y) q

≤ CF

Q

Bm(f ,g)(y) q. (.)

Hence, by (.) and (.), we have ˜Bm(f , g) W(Lp,Lqω)≤ CF

Q

Bm(f ,g)(y) q= CBm(f , g) W(Lp,Lqω). (.) Since from the assumption m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)] the right-hand side

of (.) is finite, thus ˜Bm(f , g)∈ W(Lp, Lωq). On the other hand, since m∈ BM[W(p, q,

ω; p, q, ω; p, q, ω)], there exists C>  such that

Bm(f , g) W(Lp,Lqω)≤ C f W(Lp,Lqω) g W(Lp,Lqω). (.)

Combining (.) and (.), we have

˜Bm(f , g) W(Lp,Lqω)≤ CC f W(Lp,Lqω) g W(Lp,Lqω). (.)

If we apply the Hölder inequality to the right-hand side of inequality (.) and use inequal-ity (.), we obtain  Rn  Rnˆf(ξ)ˆg(η)ˆh(ξ + η)m(ξ,η)dξ dη   ≤ ˜Bm(f , g) W(Lp,Lqω) h W(Lp,Lq ω–) ≤ CC f W(Lp,Lωq) g W(Lp,Lqω) h W(Lp,Lq ω– ) .

(7)

For the proof of converse, assume that there exists a constant C >  such that  Rn  Rnˆf(ξ)ˆg(η)ˆh(ξ + η)m(ξ,η)dξ dη   ≤ C f W(Lp,Lqω) g W(Lp,Lqω) h W(Lp,Lq ω– ) (.)

for all f , g, h∈ Cc (Rn). From the assumption and (.), we write

 Rnh(y) ˜Bm(f , g)(y) dy   ≤ C f W(Lp,Lqω) g W(Lp,Lqω) h W(Lp,Lq ω– ) . (.)

Define a function from Cc∞(Rn)⊂ W(Lp, Lq   ω–) toC such that (h) =  Rn

h(y) ˜Bm(f , g)(y) dy.

is linear and bounded by (.). Also, since q≥ p≥ , we have Cc∞(Rn) = W (Lp, Lq

ω–)

by Lemma .. Thus extends to a bounded function from W (Lp, Lq

ω– ) toC. Then ∈ (W (Lp, Lq   ω– )) ∗= W (Lp, Lq

ω). Again, since the definition of W (Lp, L

q

ω) is independent of

the choice of Q, there exists C>  such that

Bm(f , g) W(Lp,Lqω)≤ C ˜Bm(f , g) W(Lp,Lqω). (.)

Combining (.) and (.), we obtain

Bm(f , g) W(Lp,Lqω)≤ C ˜Bm(f , g) W(Lp,Lqω) = C = C sup h W(Lp ,Lq ω– ) ≤ | (h)| h W(Lp,Lq ω– ) ≤ CC f W(Lp,Lqω) g W(Lp,Lqω).

This completes proof. 

The following theorem is a generalization of Theorem ..

Theorem . Letp +  p =  p,  q +  q =  q, ω≤ ωand υ(x) = C( + x)N, C≥ ,

N ∈ N be a weight function. If μ ∈ M(υ) and m(ξ, η) = ˆμ(αξ + βη) for α, β ∈ R, then m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)]. Moreover,

m (W (p,q;p,q;p,q))≤ μ υ if|α| ≤ ,

m (W (p,q;p,q;p,q))≤ |α| N μ

υ if|α| > .

Proof Let f , g∈ Cc (Rn). By Theorem . in [], we have

Bm(f , g)(t) =



(8)

Also by [] we write the inequalities

Tαyf W(Lp,Lqω)≤ ω(αy) f W(Lp,Lqω) (.)

and

Tβyg W(Lp,Lqω)≤ ω(αy) g W(Lp,Lqω). (.)

From these inequalities, we have FTαyf∈ L

q

ω(R

n) and F Tβyg∈ L

q

ω(Rn). If we use the

in-equality ω≤ ωand set x – αt = u, we obtain

FTαyfωq≤ FTαyfωq≤ ω(αy) f W(Lp,Lqω), (.)

and hence FTαyfω∈ Lq(Rn). Then by (.), (.), (.), (.) and the Hölder inequality,

we have Bm(f , g) W(Lp,Lqω)≤ Rn f(t – αy)g(t – βy)χQ+x(t) pd|μ|(y) q ≤  Rn f(t – αy)χQ+x(t) p g(t – βy)χQ+x(t) pd|μ|(y) q ≤  Rn

FTαyf(x)FTβyg(x) qd|μ|(y) ≤  Rn FTαyf(x)ω(x) qFTβyg(x) qd|μ|(y) ≤  Rn ω(αy) f W(Lp,Lqω) g W(Lp,Lq)d|μ|(y) ≤ f W(Lp,Lqω) g W(Lp,Lqω)  Rn ω(αy) d|μ|(y). (.)

Now, suppose that α≤ . Since ω is a slowly increasing weight function, there exist

C≥  and N ∈ N such that ω(x)≤ C   + xN= υ(x). Then  Rn ω(αy) d|μ|(y) ≤  Rn C + αyNd|μ|(y) ≤  Rn C + yNd|μ|(y) = μ υ. Hence by (.) Bm(f , g) W(Lp,Lqω)≤ f W(Lp,Lqω) g W(Lp,Lqω) μ υ. (.)

Thus m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)], and by (.) we obtain

m (W (p,q;p,q;p,q))= sup f W(Lp ,Lq ω )≤, g W(Lp ,Lqω)≤ Bm(f , g) W(Lp,Lqω) f W(Lp,Lqω) g W(Lp,Lqω) ≤ μ υ.

(9)

Similarly, if α > , then  Rn ω(αy) d|μ|(y) ≤  RnC  α+ αyNd|μ|(y) = αN  Rn υ(y) d|μ|(y) = αN μ υ. Therefore by (.) we have Bm(f , g) W(Lp,Lqω)≤ α N f W(Lp,Lqω) g W(Lp,Lqω) μ υ. (.)

Hence, we obtain m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)], and by (.)

m (W (p,q;p,q;p,q))= sup f W(Lp ,Lqω )≤, g W(Lp ,Lqω)≤ Bm(f , g) W(Lp,Lqω) f W(Lp,Lqω) g W(Lp,Lqω) ≤ αN μ υ. 

Now, we will give some properties of the space BM[W (p, q, ω; p, q, ω; p, q, ω)]. Theorem . Let m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)].

(a) T(ξ)m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)]for each (ξ, η)∈ Rnand

T(ξ)m (W (p,q;p,q;p,q))= m (W (p,q;p,q;p,q)).

(b) M(ξ)m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)]for each (ξ, η)∈ R nand

M(ξ)m (W (p,q;p,q;p,q))

≤ ω(–ξ(–η) m (W (p,q;p,q;p,q)).

Proof (a) Let f , g∈ Cc∞(Rn). From Theorem . in [], we write the equality

BT(ξ,η)m(f , g)(x) = eπ iξ,xBm(M–ξf, M–ηg)(x). (.)

Also the equalities M–ξf W(Lp,Lωq)= f W(Lp,Lqω) and M–ηg W(Lp,Lqω)= g W(Lp,Lqω)

are satisfied. Then, using equality (.) and the assumption m∈ BM[W(p, q, ω; p, q,

ω; p, q, ω)], we have BT(ξ,η)m(f , g) W(Lp,Lqω) = e π iξ,xB m(M–ξf, M–ηg) W(Lp,Lqω) = Bm(M–ξf, M–ηg) W(Lp,Lqω) ≤ C f W(Lp,Lqω) g W(Lp,Lqω)

for some C > . Thus T(ξ)m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)]. Moreover, we

ob-tain T(ξ)m (W (p,q;p,q;p,q)) = BT(ξ,η)m = sup f W(Lp ,Lq ω )≤, g W(Lp ,Lqω)≤ BT(ξ,η)m(f , g) W(Lp,Lqω) f W(Lp,Lqω) g W(Lp,Lqω)

(10)

= sup M–ξf W(Lp ,Lqω )≤, M–ηg W(Lp ,Lqω)≤ BT(ξ,η)m(M–ξf, M–ηg) W(Lp,Lqω) M–ξf W(Lp,Lqω) M–ηg W(Lp,Lqω) = Bm = m (W (p,q;p,q;p,q)).

(b) For any f , g∈ Cc∞(Rn), we write

BM(ξ,η)m(f , g)(x) = Bm(T–ξf, T–ηg)(x) (.)

by Theorem . in []. Also, the inequalities T–ξf W(Lp,Lqω)≤ ω(–ξ) f W(Lp,Lqω)and

T–ηg W(Lp,Lqω)≤ ω(–η) g W(Lp,Lqω) are satisfied []. Since m∈ BM[W(p, q, ω; p,

q, ω; p, q, ω)], by (.) we have

BM(ξ,η)m(f , g) W(Lp,Lqω) = Bm(T–ξf, T–ηg) W(Lp,Lqω)

≤ Bm T–ξf W(Lp,Lqω) T–ηg W(Lp,Lqω)

≤ ω(–ξ(–η) Bm f W(Lp,Lqω) g W(Lp,Lqω) (.)

and hence M(ξ)m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)]. So, by (.) we obtain

M(ξ)m (W (p,q;p,q;p,q)) = sup f W(Lp ,Lq ω )≤, g W(Lp ,Lqω)≤ BM(ξ,η)m(f , g) W(Lp,Lqω) f W(Lp,Lqω) g W(Lp,Lqω) ≤ ω(–ξ(–η) Bm = ω(–ξ(–η) m (W (p,q;p,q;p,q)).  Lemma . If ω is a slowly increasing weight function such that ω(x)≤ C( + x)N= υ(x)

and f ∈ W(Lp, Lq ω), then Dpyf ∈ W(Lp, Lqυ). Moreover, Dpyf W(Lp,Lq ω)≤ C f W(Lp,L q υ) if y≤ , Dpyf W(Lp,Lq ω)< Cy n q+N f W(Lp,Lq υ) if y>  for some C> .

Proof Take any f ∈ W(Lp, Lq

ω). If we get ty= u, we obtain Dpyf W(Lp,Lq ω)= Rn Dpyf(t)χQ+x(t)pdtp q,ω =  Rn  ynp f t y  pχQ+x(t) dtp q,ω =  Rn f(u)y–Q+y–x(u) dup q,ω = Ffy–Qy–x q. (.)

(11)

Again, if we say y–x= s and use ω to be slowly increasing, then there exist C >  and N∈ N such that Dpyf W(Lp,Lq ω) =  Rn Ffy–Qy–xqω(x)qdxq = ynq  Rn Ffy–Q(s)qω(ys)qdsq ≤ ynq  Rn Ffy–Q(s)qC   + ysNqdsq (.) by equation (.).

Let y≤ . Using inequality (.), we have Dpyf W(Lp,Lq ω)≤  Rn Ffy–Q(s)qC   + sNqdsq = Ffy–Q q. (.) Since y–Qis a compact set and the definition of W (Lp, Lq

υ) is independent of the choice

of a compact set Q, then there exists C >  such that

Ffy–Q q≤ C FfQ q (.) by [, ]. Then by (.) we write Dpyf W(Lp,Lq ω)≤ F y–Q f q,υ≤ C F Q f q,υ= C f W(Lp,Lq υ). Thus we have Dpyf ∈ W(Lp, Lqυ).

Now, assume that y > . Similarly, by (.) and (.), we get Dpyf W(Lp,Lq ω) < y n q  Rn Ffy–Q(s)qC  y+ ysNqdsq = ynq+N  Rn Ffy–Q(s)qυ(s)qdsq ≤ ynq+N f W(Lp,Lq υ). Hence Dpyf ∈ W(Lp, Lqυ). 

Theorem . Let υi(x) = Ci( + x)Ni, Ci> , Ni>  for i = , , , and let ωbe a slowly

in-creasing weight function. Ifq=p

+ 

p– 

p,  < y <∞ and m ∈ BM[W(p, q, ω; p, q, ω;

p, q, υ)], then Dqym∈ BM[W(p, q, υ; p, q, υ; p, q, ω)]. Moreover, then

Dqym (W (p,q;p,q;p,q)) ≤ Cyqn–N m (W (p,q;p,q;p,q)) if y≤ , Dqym (W (p,q;p,q;p,q)) < Cyqn+qn+N+N m (W (p,q;p,q;p,q)) if y> .

(12)

Proof Let f ∈ W(Lp, Lqω

) and g∈ W(Lp, L

q

ω) be given. From Lemma ., we have D

p

y f

W(Lp, Lqω ) and D

p

y g∈ W(Lp, Lqω). Also it is known by Theorem . in [] that

BDq ym(f , g)(y) = D py–Bm  Dpyf, Dpyg  (y). If we use this equality, we write

B Dqym(f , g) W(Lp,Lqω)= Rn Dpy–Bm  Dpyf, Dpyg  (t)χQ+x(t) pdtp q =  Rn  yn pBmDpyf, Dpyg  t y– χQ+x(t)  pdtp q =  Rny nB m  Dpyf, Dpyg  (ty)χQ+x(t)pdtp q .

If we say yt = u in the last equality, we have BDq ym(f , g) W(Lp,Lqω)= Rn Bm  Dpy f, Dpyg 

(u)χyQ+yx(u)pdt

p q = FyQ Bm(Dpy f,Dpy g)(yx) q. (.)

On the other hand, since ωis a slowly increasing weight function, there exist C> ,

N>  such that ω(x)≤ C( + x)N= υ(x). If we make the substitution yx = s in equality

(.), we obtain BDq ym(f , g) W(Lp,Lqω) = F yQ Bm(Dpy f,Dpy g)(yx) q =  Rn FyQ Bm(Dpy f,Dpy g)(s) qω  y–sqy–ndsq = yqn  Rn FyQ Bm(Dpy f,Dpy g)(s) qω   y–sqdsq ≤ yqn Rn FyQ Bm(Dpy f,Dpy g)(s) q C   + y–sNqdsq . We assume that y≤ . Then

BDq ym(f , g) W(Lp,Lqω)≤ yqn Rn FyQ Bm(Dpy f,Dpy g)(s) q C  y–+ y–sNqdsq = yqn–NFyQ Bm(Dpy f,Dpy g) q.

Also, since yQ is a compact set, we have BDq ym(f , g) W(Lp,Lqω)≤ Cyqn–NFQ Bm(Dpyf,Dpy g) q= Cyqn–NBm  Dpy f, Dpyg W(Lp,Lqυ). (.)

(13)

Since m∈ BM[W(p, q, ω; p, q, ω; p, q, υ)], by Lemma . and inequality (.), we obtain BDq ym(f , g) W(Lp,Lqω) ≤ Cyqn–N m (W (p,q;p,q;p,q)) f W(Lp,Lqυ) g W(Lp,Lqυ). (.)

Then Dqym∈ BM[W(p, q, υ; p, q, υ; p, q, ω)], and by (.) we have

Dqym (W (p

,q;p,q;p,q))≤ Cy

qn–N m

(W (p,q;p,q;p,q)).

Now let y > . Again, since m∈ BM[W(p, q, ω; p, q, ω; p, q, υ)], by Lemma . and

inequality (.), we obtain BDq ym(f , g) W(Lp,Lqω) < C Bm  Dpyf, Dpyg W(Lp,Lqυ) < Cyqn+qn+N+N m (W (p,q;p,q;p,q)) f W(Lp,Lqυ) g W(Lp,Lqυ). (.)

Thus Dqym∈ BM[W(p, q, υ; p, q, υ; p, q, ω)], and by (.) we have

Dqym (W (p,q;p,q;p,q))< Cy n q+qn+N+N m (W (p,q;p,q;p,q)).  Theorem . Let m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)].

(a) If ∈ L(Rn), then ∗ m ∈ BM[W(p, q, ω; p, q, ω; p, q, ω)]and

 ∗ m (W (p,q;p,q;p,q))≤  m (W (p,q;p,q;p,q)).

(b) If ∈ L

ω(Rn)such that ω(u, υ) = ω(u)ω(υ), then

ˆm ∈ BM[W(p, q, ω; p, q, ω; p, q, ω)]and

ˆm (W (p,q;p,q;p,q))≤  ,ω m (W (p,q;p,q;p,q)).

Proof (a) Let f , g∈ Cc∞(Rn) be given. By Proposition . in []

B∗m(f , g)(y) =



Rn 

Rn

(u, v)BT(u,v)m(f , g)(y) du dv.

If we use Theorem . and the assumption m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)], we

have B∗m(f , g) W(Lp,Lqω) ≤  Rn  Rn (u, v)BT(u,v)m(f , g) W(Lp,Lqω)du dv ≤  Rn  Rn (u, v) T(u,v)m (W (p,q;p,q;p,q)) f W(Lp,Lωq) g W(Lp,Lqω)du dv = m (W (p,q;p,q;p,q))  f W(Lp,Lqω) g W(Lp,Lqω)<∞. (.)

(14)

Hence ∗ m ∈ BM[W(p, q, ω; p, q, ω; p, q, ω)], and by (.) we obtain

 ∗ m (W (p,q;p,q;p,q))≤  m (W (p,q;p,q;p,q)).

(b) Let ∈ Lω(Rn). Take any f , g∈ Cc (Rn). It is known by Proposition . in [] that

Bˆm(f , g)(x) =  Rn  Rn (u, v)BM(–u,–v)m(f , g)(x) du dv.

Since m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)], we have M(–u,–v)m∈ BM[W(p, q, ω; p,

q, ω; p, q, ω)] and M(–u,–v)m (W (p,q;p,q;p,q))≤ ω(u)ω(v) m (W (p,q;p,q;p,q)) by Theorem .. Then Bˆm(f , g) W(Lp,Lq ω) ≤  Rn  Rn (u, v)BM(–u,–v)m(f , g) W(Lp,Lqω)du dv ≤  Rn  Rn (u, v) M(–u,–v)m (W (p,q;p,q;p,q)) f p g pdu dv ≤  Rn  Rn (u, v)ω(u)ω(υ) m (W (p,q;p,q;p,q)) × f W(Lp,Lqω) g W(Lp,Lqω)du dv = m (W (p,q;p,q;p,q)) f W(Lp,Lqω) g W(Lp,Lqω)  ,ω. (.)

Thus from (.) we obtain ˆm∈ BM[W(p, q, ω; p, q, ω; p, q, ω)] and

ˆm (W (p,q;p,q;p,q))≤  ,ω m (W (p,q;p,q;p,q)).  Theorem . Let m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)]. If Q, Qare bounded

mea-surable sets inRn, then

h(ξ , η) =μ(Q× Q)  Q×Qm(ξ + u, η + v) du dv ∈ BM W(p, q, ω; p, q, ω; p, q, ω)  .

Proof Let f , g∈ Cc (Rn). We know by Theorem . in [] that Bh(f , g)(x) =μ(Q× Q)  Q×QBT(–u,–v)m(f , g)(x) du dv.

From Theorem ., we have Bh(f , g) W(Lp,Lqω) ≤  μ(Q× Q)  Q×QBT(–u,–v)m(f , g) W(Lp,Lqω)du dv

(15)

≤  μ(Q× Q) Q×Q T(–u,–v)m (W (p,q;p,q;p,q)) × f W(Lp,Lqω) g W(Lp,Lqω)du dv =  μ(Q× Q) m (W (p,q;p,q;p,q)) × f W(Lp,Lqω) g W(Lp,Lqω)μ(Q× Q) = m (W (p,q;p,q;p,q)) f W(Lp,Lqω) g W(Lp,Lqω). Hence, we obtain h(ξ , η)∈ BM[W(p, q, ω; p, q, ω; p, q, ω)].  Theorem . Let ωbe a continuous, symmetric, slowly increasing weight function,

ω(u, v) = ω(u)ω(v), ω≤ ω,q+q =q,p+p =p,p+p  = ,  q+  q =  and q ≥ p. Assume that ∈ Lω(Rn), ∈ Lω(R n) and ∈ Lω(R n). If m(ξ , η) = ˆ(ξ ) ˆ(ξ , η) ˆ(η), then m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)].

Proof Take any f , g, h∈ Cc (Rn). Then, by Theorem . in [], we write

 Rn  Rnˆf(ξ)ˆg(η)ˆh(ξ + η)m(ξ,η)dξ dη   ≤Rn h(y) ˜Bˆ(f∗ , g∗ )(y)dy.

On the other hand, we know that the inequalities

f ∗ W(Lp,Lqω)≤ C f W(Lp,Lqω) ,ω (.)

and

g ∗ W(Lp,Lqω)≤ C g W(Lp,Lqω) ,ω (.)

hold, where C> , C>  by []. That means f∗∈ W(Lp, Lωq) and g∗∈ W(Lp, L

q

ω).

Also, every constant function is bilinear multiplier of type (W (p, q, ω; p, q, ω; p, q,

ω)) under the given conditions. So, by Theorem ., we have ˆ∈ BM[W(p, q, ω; p, q,

ω; p, q, ω)]. Now, if we say that –y = u, we have

˜Bˆ(f∗ , g∗ )(y) W(Lp,Lqω) =  Rn Bˆ(f ∗ , g∗ )(u) pχ–Q–x(u) dup q = FB–Q ˆ(f∗,g∗)(–x) q.

In this here, we set –x = u and use ωto be symmetric. Then we have

˜Bˆ(f∗ , g∗ )(y) W(Lp,Lqω)≤ CF

Q

Bˆ(f∗,g∗) q

(16)

by []. Using the Hölder inequality, inequalities (.), (.), (.) and ˆ∈ BM[W(p, q, ω; p, q, ω; p, q, ω)], we find  Rn  Rnˆf(ξ)ˆg(η)ˆh(ξ + η)m(ξ,η)dξ dη   ≤ h W(Lp,Lq ω– ) Bˆ(f∗ , g∗ ) W(Lp,Lqω) ≤ CCC h W(Lp,Lq ω– ) Bˆ ,ω ,ω f W(Lp,Lqω) g W(Lp,Lqω).

If we say C = CCC Bˆ ,ω ,ω, then we obtain

 Rn  Rnˆf(ξ)ˆg(η)ˆh(ξ + η)m(ξ,η)dξ dη   ≤ C f W(Lp,Lqω) g W(Lp,Lqω) h W(Lp,Lq ω– ) .

From Theorem ., we have m∈ BM[W(p, q, ω; p, q, ω; p, q, ω)].  Theorem . Let≤ p, p≤ p ≤ ,  ≤ q, q≤ r ≤ , p≥ p, q≥ r and q ≥ p

such that p  =  p +  p –  p andq =  q +  q – 

r. Assume that ωis a continuous,

bounded, symmetric weight function. If m∈ W(Lp(Rn), Lr(Rn))∩ L(Rn), then m

BM[W (p, q, ω; p, q, ω; p, q, ω)].

Proof Firstly, we show that m∈ BM[W(p, r, ω; p, r, ω;∞, ∞, ω)]. Take any f , g, h

Cc∞(Rn). Let A× B ⊂ Rn be a closed and bounded rectangle. Since the definition of

W(Lp(Rn), Lr(Rn)) is independent of the choice of a compact set Q, then, by using

Fubini’s theorem, we get ˆf(ξ )ˆg(η) W(Lp(Rn),Lr(Rn))

= FQˆfˆg Lr(Rn)≤ CFAˆfˆg×B Lr(Rn)

= C ˆf χx+A p ˆgχy+B p Lr(Rn)= CFAˆf(x)FˆgB(y) Lr(Rn)

= CFAˆf r FBˆg r= C ˆf W(Lp,Lr) ˆg W(Lp,Lr) (.) for some C> . So, we have ˆf(ξ )ˆg(η) ∈ W(Lp



(Rn), Lr(Rn)). By using the Hölder

inequal-ity, the Hausdorff-Young inequality and equality (.), we obtain  Rn  Rnˆf(ξ)ˆg(η)ˆh(ξ + η)m(ξ,η)dξ dη   ≤ C h  ˆf(ξ )ˆg(η) W(Lp(Rn),Lr(Rn)) m W(Lp(Rn),Lr(Rn)) ≤ C h ˆf W(Lp,Lr) ˆg W(Lp,Lr) m W(Lp(Rn),Lr(Rn)) ≤ CC h W(L,L) f W(Lp,Lr) g W(Lp,Lr) m W(Lp(Rn),Lr(Rn)) ≤ CC ω ∞ m W(Lp(Rn),Lr(Rn)) f W(Lp,Lr ω) g W(Lp,Lrω) h W(L,Lω– )

(17)

Now, we show that m∈ BM[W(p, r, ω; , , ω; p, r, ω)]. Again, using Fubini’s theorem,

we have

ˆf(–v) ˆh(u) W(Lp(Rn),Lr(Rn))

≤ C ˆf(–v) ˆh(u)χ(x,y)+A×B Lp(Rn) Lr(Rn)

= C ˆf χ–x–A p ˆhχy+B p Lr(Rn)= CF–Aˆf (–x)FˆhB(y) Lr(Rn)

= CF–Aˆf r FˆhB r≤ CC ˆf W(Lp,Lr) ˆh W(Lp,Lr) (.) for some C> , C> . So, ˆf(–v) ˆh(u)∈ W(Lp



(Rn), Lr(Rn)). Similarly, we have

m(–v, u + v) W(Lp(Rn),Lr(Rn))≤ CFm(–A)×(A+B) Lr(Rn)

≤ CC m W(Lp(Rn),Lr(Rn)) (.)

for some C> , C> . That means m(–v, u + v)∈ W(Lp(Rn), Lr(Rn)). We set ξ + η = u

and ξ = –v. Then, by using the Hölder inequality, the Hausdorff-Young inequality, (.) and (.), we get  Rn  Rnˆf(ξ)ˆg(η)ˆh(ξ + η)m(ξ,η)dξ dη   =  Rn 

Rnˆf(–v)ˆg(u + v)ˆh(u)m(–v,u + v)dudv   ≤ g  ˆf(–v)ˆg(u) W(Lp(Rn),Lr(Rn)) m(–v, u + v) W(Lp(Rn),Lr(Rn)) ≤ CCCC g ˆf W(Lp,Lr) ˆh W(Lp,Lr) m W(Lp(Rn),Lr(Rn)) ≤ CCCCC ω ∞ m W(Lp(Rn),Lr(Rn)) f W(Lp,Lr ω) g W(L,Lω) h W(Lp,Lrω– ). Thus, by Theorem ., we obtain m∈ BM[W(p, r, ω; , , ω; p, r, ω)]. Similarly, if we

change the variables ξ + η = u and η = –v, then  Rn  Rnˆf(ξ)ˆg(η)ˆh(ξ + η)m(ξ,η)dξ dη   = f   Rn  Rnˆg(–v) ˆh(u) m(u + v, –v)du dv ≤ C ω ∞ m W(Lp(Rn),Lr(Rn)) f W(L,Lω) g W(Lp,Lωr ) h W(Lp,Lrω–  ). Hence m∈ BM[W(, , ω; p, r, ω; p, r, ω)].

We take ˜p, ˜q,˜pand˜qsuch that ≤ ˜p≤ p,  ≤ ˜q≤ r, p≤ ˜p≤ ∞ and r≤ ˜q≤ ∞.

Since m∈ BM[W(p, r, ω; p, r, ω;∞, ∞, ω)] and m∈ BM[W(, , ω; p, r, ω; p, r, ω)], we

have m∈ BM[W(˜p,˜q, ω; p, r, ω;˜p,˜q, ω)] by the interpolation theorem in [, ] such

that  ˜p = – θ p + θ ,  ˜p = – θ ∞ + θ p, (.)  ˜q = – θ r + θ ,  ˜q = – θ ∞ + θ r (.)

(18)

for all  ≤ θ ≤ . On the other hand, from equalities (.) and (.), we obtain the equalities ˜p  –  ˜p =  p and  ˜q –  ˜q = 

r. Similarly, we take ˜p, ˜q, ˜r and ˜s such

that  ≤ ˜p≤ p,  ≤ ˜q≤ r, p ≤ ˜r≤ ∞ and r ≤ ˜s≤ ∞. Again, if we use m ∈

BM[W (p, r, ω; p, r, ω;∞, ∞, ω)] and m∈ BM[W(p, r, ω; , , ω; p, r, ω)], we have m

BM[W (p, r, ω;˜p,˜q, ω;˜r,˜s, ω)] by the interpolation theorem in [, ] such that

˜p = – θ p + θ ,  ˜r = – θ ∞ + θ p, (.)  ˜q = – θ r + θ ,  ˜s = – θ ∞ + θ r (.)

for all ≤ θ ≤ . So, from equalities (.) and (.), we have ˜p

 –  ˜r =  pand  ˜q –  ˜s =  r.

Now, we choose˜p,˜psuch that ≤ ˜p≤ p< p and ≤ ˜p≤ p< p. Let these numbers

have the following conditions:  p –  p= ( – θ )˜p – p , (.)  p –  p= ( – θ )˜p –  p (.) for  < θ < . Again, we choose ˜q, ˜q such that ≤ ˜q≤ q< r and ≤ ˜q≤ q< r. Let

these numbers have the following conditions:  q – r= ( – θ )˜q – r , (.)  q – r= ( – θ )˜q – r (.) for  < θ < . If we use equalities (.), (.), (.), (.), (.) and (.), we write

p = – θ ˜p +θ p,  p = – θ p + θ ˜p , (.)  q = – θ ˜q +θ r,  q = – θ r + θ ˜q . (.)

Moreover, using the equalities ˜p

–  ˜p =  p,  ˜p –  ˜r = 

p, (.) and the assumption

p =  p+  p –  p, we obtain  p = – θ ˜p + θ ˜r . (.)

Similarly, using the equalities ˜q

–  ˜q =  r,  ˜q –  ˜s = 

r, (.) and the assumption

q =  q+  q –  r, we obtain  q = – θ ˜q + θ ˜s . (.) Since m∈ BM[W(˜p,˜q, ω; p, r, ω;˜p,˜q, ω)], m∈ BM[W(p, r, ω;˜p,˜q, ω;˜r,˜s, ω)],

then the bilinear multipliers Bm : W (L˜p, Lω˜q) × W(Lp, Lrω)→ W(L ˜p, L˜q

Referanslar

Benzer Belgeler

Private verilerim As ADODB.Coımection Private depom As AOODB.Recordset Private depoml As ADODB.Recordset Private depom2 As ADODB.Recordset Private depo3 As ADODB.Recordset

This data are: Customer Code: Invoice No: Stock Codes: Customer Name: Invoice Date: Stock Names: Phone Number: Employee Name: Quantities: Customer Address: Sub Total:..

The main aim of this project is to help the Case User or Manager to work efficiently and make easier to product management by manager, customer management, reservation management,

In this Process, we entered customer information and then if we want, we can sell products to customer with use link of Sale button.. : is the Customer Selling Process

According to Figure 4, In &#34;Products&#34; page, you can find 6 different kinds of products under the names of pens, erasers, notebooks, folders, office products and

2.. customer receipt comes automatically then user print the receipt. Payment process: This process provide the easiness to make payment. For example if customer want to

HC: healthy controls; ADHD: attention-deficit hyperactivity disorder; CCN: cognitive control network; DMN: default mode network; SN: salience network; PFC: prefrontal cortex;

Amaç: Elektif septorinoplasti cerrahisi uygulanan hastalarda, cerrahi insizyon öncesi iv deksketoprofen trometamol ve asetaminofen uygulamasının, ameliyat sonrası ağrı