• Nem Talált Eredményt

A STUDY OF THE REAL HARDY INEQUALITY

N/A
N/A
Protected

Academic year: 2022

Ossza meg "A STUDY OF THE REAL HARDY INEQUALITY"

Copied!
18
0
0

Teljes szövegt

(1)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page

Contents

JJ II

J I

Page1of 18 Go Back Full Screen

Close

A STUDY OF THE REAL HARDY INEQUALITY

MOHAMMAD SABABHEH

Department of Science and Arts

Princess Sumaya University for Technology Amman 11941 Jordan

EMail:sababheh@psut.edu.jo

Received: 11 November, 2008

Accepted: 20 October, 2009

Communicated by: L. Pick

2000 AMS Sub. Class.: 42A16, 42A05, 42B30.

Key words: Hardy’s inequality, inequalities involving Fourier transforms.

Abstract: We show that some Hardy-type inequalities on the circle can be proved to be true on the real line. Namely, we discuss the idea of getting Hardy inequalities on the real line by the use of corresponding inequalities on the circle. In the last section, we prove the truth of a certain open problem under some restrictions.

(2)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page2of 18 Go Back Full Screen

Close

Contents

1 Introduction 3

2 Setup 5

3 From The Circle To The Line 7

4 Another Hardy Inequality 10

(3)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page3of 18 Go Back Full Screen

Close

1. Introduction

When McGehee, Pigno and Smith [4] proved the Littlewood conjecture, many ques- tions regarding the best possible generalization of Hardy’s inequality were asked.

The longstanding question is: Does there exist a constantc >0such that (1.1)

X

n=1

|fˆ(n)|

n ≤ckfk1+c

X

n=1

|f(−n)|ˆ n

for allf ∈ L1(T)? The truth of this inequality is an open problem. Many attempts were made to answer this question and many partial results were obtained. We refer the reader to [2], [3], [6] and [7] for some partial results.

Almost all articles in the literature treat Hardy-type inequalities on the circle and a very few articles treat them on the real line.

In [8] it was proved that a constantc > 0exists such that for all f ∈

g ∈L1(R) : Z x

−∞

g(t)dt ∈L1(R)

we have

Z 0

|f(ξ)|ˆ 2

ξ dξ≤ckfk21+c Z

0

|f(−ξ)|ˆ 2 ξ dξ.

Although this is not the first proved Hardy inequality on the real line, its proof is the first proof which uses the construction of a bounded function on R whose Fourier coefficients have some desired decay properties.

We have two main goals in this article. The first is to prove Hardy inequalities on the real line using well known inequalities on the circle and the second is to prove a real Hardy inequality on the real line which is related to the open problem (1.1).

(4)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page4of 18 Go Back Full Screen

Close

Proving a Hardy inequality usually involves quite a difficult construction and this is because of the way we prove such inequalities. Again we refer the reader to [2], [4], [6], [7] and [8] for more information on how and why we construct bounded functions with desired Fourier coefficients.

(5)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page5of 18 Go Back Full Screen

Close

2. Setup

LetL1denote the space of all integrable functions (equivalent classes) defined onR. Forf ∈L1, we define the Fourier transform off to be

fˆ(ξ) = Z

R

f(x)e−ixξdξ.

Iffˆ∈L1then the inversion formula forf holds:

f(x) = 1 2π

Z

R

fˆ(ξ)eiξxdξ.

Iff ∈L2then the Fourier transform off is defined to be theL2−limit:

fˆ(ξ) = lim

n→∞

Z n

−n

f(x)e−iξxdx.

In this casefˆ∈L2 and f(x) = lim

n→∞

1 2π

Z n

−n

fˆ(ξ)eixξdξ, in theL2 sense.

The Plancheral theorem then says:

kfk2 = 1

√2πkfkˆ 2.

Lemma 2.1. Forf, g∈L2 we have Z

R

f(x)g(x)dx= 1 2π

Z

R

fˆ(ξ) ˆg(ξ)dξ.

(6)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page6of 18 Go Back Full Screen

Close

We refer the reader to any standard book in analysis for more on these concepts, see for example [5].

Observe that if f ∈ L1 is such thatfˆis compactly supported, thenfˆ∈ L2 and hencef ∈L2.

Now, givenf ∈L1(R), define (2.1) ϕN(t) = 2π

X

j=−∞

fN(t+ 2πj), wherefN(x) =N f(N x).

Then we have

(2.2) ϕN ∈L1(T),ϕˆN(n) = ˆfn N

and lim

N→∞NkL1(T) =kfkL1(R). For a discussion of this idea we refer the reader to [1, p. 160-162].

Thus, the equations in (2.1) and (2.2) enable us to move from a function integrable on the line to a function integrable on the circle. This idea will be used efficiently in the next section to prove some Hardy-type inequalities on the real line using only a corresponding inequality on the circle.

(7)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page7of 18 Go Back Full Screen

Close

3. From The Circle To The Line

In this section we discuss how one can use a Hardy inequality on the circle to obtain an inequality on the real line.

Recall that Hardy’s inequality on the circle states that a constant C > 0 exists such that for allf ∈L1(T)withfˆ(n) = 0, n <0we have

X

n=1

|fˆ(n)|

n ≤Ckfk1.

As a matter of notation, letH1(R)be defined by H1(R) =

n

f ∈L1(R) : ˆf(ξ) = 0, ∀ξ <0 o

.

In the following theorem we use the above stated Hardy’s inequality to get the well known Hardy inequality on the line. We should remark that proving such an inequality (on the line) is a difficult task, but transforming the problem from the circle to the line greatly simplifies the proof.

Theorem 3.1. There exists an absolute constantC >0such that Z

0

|fˆ(ξ)|

ξ ≤Ckfk1

for allf ∈H1(R).

Proof. Letf ∈H1(R)be arbitrary and let, forN ∈N,ϕN (as in (2.1) and (2.2)) be such that:

ϕN ∈L1(T), lim

N→∞NkL1(T)=kfkL1(R) and ϕˆN(n) = ˆf(n/N).

(8)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page8of 18 Go Back Full Screen

Close

ClearlyϕˆN(n) = 0, ∀n <0, hence Hardy’s inequality applies and we have

X

n=1

|ϕˆN(n)|

n ≤CkϕNkL1(T). However, this implies that

N

X

n=1

1 N

|fˆ(n/N)|

n/N ≤CkϕNkL1(T).

We take the limit asN → ∞to get (3.1)

Z 1 0

|f(ξ)|ˆ

ξ ≤Ckfk1.

Thus, we have shown (3.1) for any function inH1(R). Now we proceed to prove the inequality stated in the theorem. That is, we would like to replace the upper limit of the above integral by∞.For this, letM ∈Nbe arbitrary and puth(x) =f(x/M).

Then

khk1 =Mkfk1 and ˆh(ξ) =Mf(M ξ).ˆ Now apply (3.1) onhto obtain

Z 1 0

|ˆh(ξ)|

ξ ≤Ckhk1 ⇒ Z 1

0

|f(M ξ)|ˆ

ξ dξ ≤Ckfk1. PutM ξ =tto get

(3.2)

Z M 0

|fˆ(ξ)|

ξ dξ ≤Ckfk1. Now, lettingM tend to∞,we obtain the result.

(9)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page9of 18 Go Back Full Screen

Close

In fact, the idea of this proof can be used to prove many Hardy inequalities on the real line!

It is proved that, see for example [3], for all functionsf ∈L1(T)we have

X

n=1

|fˆ(n)|2

n ≤Ckfk21+C

X

n=1

|fˆ(−n)|2

n .

Using an argument similar to that of Theorem3.1we can prove:

Theorem 3.2. There exists a constantC > 0such that for all functionsf ∈ L1(R) we have

Z 0

|f(ξ)|ˆ 2

ξ dξ ≤Ckfk21+C Z

0

|f(−ξ)|ˆ 2 ξ dξ.

This modifies the result proved in [8].

(10)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page10of 18 Go Back Full Screen

Close

4. Another Hardy Inequality

In this section we prove (1.1) on the real line under a certain condition on the signs of the Fourier coefficients.

We should remark here that the method used to prove this inequality is standard and all recent articles use this idea; we need a bounded function whose Fourier coefficients obey some desired decay conditions.

One last remark before proceeding, although the given proof is for a real Hardy inequality, we can imitate the given steps to prove a similar inequality on the circle.

Forj ≥1put

fj(x) = 1 4j

Z 4j 4j−1

eixξdξ, x∈R. Then we have our first lemma:

Lemma 4.1. Letfj be as above, then

j(ξ) = (

4j, 4j−1 < ξ <4j, 0, otherwise.

Proof. Let

gj(ξ) = (

4j, 4j−1 < ξ <4j, 0, otherwise,

thengj ∈L2. Therefore,gj is the Fourier transform of some functionhj ∈L2and hj(x) = 1

2π Z

R

g(ξ)eixξ

=f(x).

(11)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page11of 18 Go Back Full Screen

Close

However,ˆhj =gj,which impliesfˆj =gj as claimed.

Observe that the above proof implies thatfj ∈L2and Lemma 4.2. Forfj as above, we have

kfjk2 =

√6π

4j/2 . Proof. Sincefj ∈L2 we have

kfjk2 = 1

√2πkfˆjk2

= 1

√2π 2π

4j

Z 4j 4j−1

!12

=

√6π 4j/2 .

Lemma 4.3. Forfj as above and forM ∈N, let

FM(x) =

M

X

j=1

fj(x)−fj(x) ,

thenkFMk≤CwhereCis some absolute constant (independent ofM).

(12)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page12of 18 Go Back Full Screen

Close

Proof. Observe first that

fj(x)−fj(x) = 2

4j

Z 4j 4j−1

sin(xξ)dξ

= 2 4j

cos(4jx)−cos(4j−1x) x

= 2 4j

2 sin2(4j−1x/2) [−1 + 16 cos2(4j−1x) cos2(4j−1x/2)]

x

≤ 60 4j

sin2(4j−1x/2)

|x| .

Note thatFM is an even function, so it suffices to consider only the casex >0.

Now, fixx >0and observe that FM(x)≤60

X

j=1

1 4j

sin2(4j−1x/2) x

= 60

 X

4−j≤x

1 4j

sin2(4j−1x/2)

x + X

4−j>x

1 4j

sin2(4j−1x/2) x

,

where, by convention, the second sum is zero if4−j ≤xfor allj ≥1.

Now

X

4−j≤x

1 4j

sin2(4j−1x/2)

x ≤ 1

x

X

j=kx

1 4j,

wherekx is the smallest positive integer such that4−j ≤xfor allj ≥kx.

(13)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page13of 18 Go Back Full Screen

Close

Consequently

X

4−j≤x

1 4j

sin2(4j−1x/2)

x ≤ 1

x 4 3

1 4kx

≤ 1 x

4 3x= 4

3. On the other hand, ifP

4−j>x 1 4j

sin2(4j−1x/2)

x is not zero, we get X

4−j>x

1 4j

sin2(4j−1x/2)

x =

log4(1/x)

X

j=1

1 4j

sin2(4j−1x/2) x

log4(1/x)

X

j=1

1 4jx

1 24j−1x

2

= 1 64x

log4(1/x)

X

j=1

4j

≤ 1

64x4log4(1/x)−4 3

≤ 1 192. Thus, we have

FM(x)≤60 4

3+ 1 192

:=C.

(14)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page14of 18 Go Back Full Screen

Close

Now letX be the set of allf ∈ L1 such that the sign of f(ξ)ˆ is constant in the block(4j−1,4j). Then we have our main result:

Theorem 4.4. There is an absolute constantK >0such that

(4.1)

Z 1

|f(ξ)|ˆ

ξ dξ ≤Kkfk1+K Z

1

|f(−ξ)|ˆ ξ dξ

for allf ∈X.

Proof. Letf ∈ X be such thatfˆis compactly supported, letfj be as above and let M ∈Nbe such that the support offˆis contained in[−M, M]. Denote the sign offˆ in the block(4j−1,4j)byσj and put

F(x) =

M

X

j=1

σj

fj(x)−fj(x) .

ThenkFk ≤ C,whereCis the constant of Lemma 4.3. Moreover,Fˆ(ξ) = 4jσj, wherejis the unique index such thatξ∈[4j−1,4j]∪[−4j,−4j−1]if−4M ≤ξ ≤4M andFˆ(ξ) = 0otherwise.

Moreover, since fˆis of compact support, we have f ∈ L2. Now we apply a standard duality argument:

Ckfk1 ≥ Z

R

f(x)F(x)dx

= 1 2π

Z

R

fˆ(ξ) ˆF(ξ)dξ

(see Lemma 2.1)

(15)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page15of 18 Go Back Full Screen

Close

≥ 1 2π

X

j=1

Z 4j 4j−1

fˆ(ξ) ˆF(ξ)dξ

− 1 2π

Z 1

−1

fˆ(ξ) ˆF(ξ)dξ

− 1 2π

X

j=1

Z 4j 4j−1

f(−ξ) ˆˆ F(−ξ)dξ .

That is, (4.2) 1

X

j=1

Z 4j 4j−1

fˆ(ξ) ˆF(ξ)dξ

≤Ckfk1+ 1 2π

Z 1

−1

fˆ(ξ) ˆF(ξ)dξ

+ 1 2π

X

j=1

Z 4j 4j−1

f(−ξ) ˆˆ F(−ξ)dξ .

However, whenξ ∈ (4j−1,4j)∪(−4j,4j−1), we have Fˆ(ξ) = 4jσj, where σj is the sign offˆin(4j,4j−1). Thus, whenξ ∈ (4j−1,4j)we have f(ξ) ˆˆ F(ξ) = |fˆ(ξ)|.

Moreover

Z 1

−1

f(ξ) ˆˆ F(ξ)dξ

≤ kfk1 Z 1

−1

Fˆ(ξ) dξ

≤ kfk1 Z 1

−1

12 Z 1

−1

|Fˆ(ξ)|212

≤√

2kfk1kFˆk2

=√

2kfk1

2πkFk2

(16)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page16of 18 Go Back Full Screen

Close

≤2√

πkfk1×2

X

j=1

kfjk2

= 4√

6πkfk1,

where we have used the facts F(x) =

M

X

j=1

σj

fj(x)−fj(x)

and kfjk2 =√

6π4−j/2.

Consequently, (4.2) becomes (4.3)

X

j=1

Z 4j 4j−1

|fˆ(ξ)|

4j dξ ≤Ckfk1+ 2√

6kfk1+

X

j=1

Z 4j 4j−1

|fˆ(−ξ)|

4j dξ.

However, whenξ∈[4j−1,4j]we have 1

4j ≤ 1

ξ and 1 4j ≥ 1

4ξ. Therefore, (4.3) boils down to

Z 1

|fˆ(ξ)|

ξ ≤Kkfk1+K Z

1

|fˆ(−ξ)|

ξ dξ, whereK = 4(C+ 2√

6)and whereCis the constant of Lemma4.3.

This completes the proof for f ∈ X with the property thatfˆis compactly sup- ported. Now for generalf ∈ X, consider the convolutionf ∗Kλ whereKλ is the Fejer Kernel of orderλ. A standard limiting process yields the result.

(17)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page17of 18 Go Back Full Screen

Close

Remark:

1. We note that the above proof can be adopted to prove that: There is an ab- solute constant C0 > 0 such that for any functionf ∈ L1(T)whose Fourier coefficients have the same sign on the block[4j−1,4j)we have

X

n=1

|f(n)|ˆ

n ≤C0kfk1+C0

X

n=1

|fˆ(−n)|

n .

2. Observe that the condition that fˆhas the same sign on the block (4j−1,4j) is flexible. This is because functions in Lp are in fact equivalent classes. There- fore, even iffˆobeys our condition but for a set of measure zero, then we may modify our choice by changing the values of fˆso that the newfˆsatisfies our condition.

We should remark that this process does not effect the proof above.

(18)

Real Hardy Inequality Mohammad Sababheh vol. 10, iss. 4, art. 104, 2009

Title Page Contents

JJ II

J I

Page18of 18 Go Back Full Screen

Close

References

[1] Y. KATZNELSON, An Introduction To Harmonic Analysis, John Wiley and Sons, Inc., 1968.

[2] I. KLEMES, A note on Hardy’s inequality, Canad. Math. Bull., 36(4) (1993), 442–448.

[3] P. KOOSIS, Conference On Harmonic Analysis in Honour of Antoni Zygmund, Volume 2, Wadsworth International Group, Belmont, California, A Division of Wadsworth, Inc., (1981), 740–748.

[4] O.C. McGEHEE, L. PIGNO AND B. SMITH, Hardy’s inequality and the L1 norm of exponential sums, Annals of Math., 113 (1981), 613–618.

[5] W. RUDIN, Real and Complex Analysis, 3rd edition, McGraw-Hill Book Co., New York, 1987.

[6] M. SABABHEH, Two-sided probabilistic versions of Hardy’s inequality, J.

Fourier Anal. and Applics., (2007), 577–587.

[7] M. SABABHEH, On an argument of Körner and Hardy’s inequality, Analysis Mathematica, 34 (2008), 51–57.

[8] M. SABABHEH, Hardy-type inequalities on the real line, J. Inequal. in Pure and Appl. Math., 9(3) (2008), Art. 72. [ONLINE:http://jipam.vu.edu.

au/article.php?sid=1009].

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

The purpose of this note is to prove Hadamard product versions of the Chebyshev and the Kantorovich inequalities for positive real numbers.. We also prove a generalization of

Although this is not the first proved Hardy inequality on the real line, its proof is the first proof which uses the construction of a bounded function on R whose Fourier

Key words: Inequalities, multiple Hilbert’s inequality, multiple Hardy-Hilbert’s inequality, equivalent inequalities, non-conjugate parameters, gamma function, Selberg’s integral,

Abstract: We prove a certain type of inequalities concerning the integral of the Fourier transform of a function integrable on the real line.... Hardy-Type Inequalities On The Real

Although the first proof of Hardy’s inequality does not depend on such a construction, many proofs were given later depending on the construction of bounded functions whose

Key words: Dunkl operators, Dunkl transform, Dunkl translation operators, Dunkl convolu- tion, Besov-Dunkl spaces.. Abstract: In this paper, we define subspaces of L p by

The objective of this paper is to obtain further generalizations of the classical Hardy integral inequality which will be useful in applications by using some elementary methods

The authors establish the Hardy integral inequality for commutators generated by Hardy operators and Lipschitz functions.. Key words and phrases: Hardy’s integral