ISSN 2219-7184; Copyright ICSRS Publication, 2010c www.i-csrs.org
Available free online at http://www.geman.in
Fourier Transform in L
p(R) Spaces, p ≥ 1
Devendra Kumar and Dimple Singh Department of Mathematics
Research and Post Graduate Studies
M.M.H.College, Model Town, Ghaziabad-201001, U.P.India E-mail:d [email protected]
(Received: 17-11-10/ Accepted: 31-12-10) Abstract
A method for restricting the Fourier transform of f ∈Lp(R),1≤p≤ ∞, spaces have been discussed by using the approximate identities.
Keywords: Approximate identities, convolution operator, Schwartz space and atomic measure.
1 Introduction
Letf ∈ L1(R).The Fourier transform of f(x) is denoted by ˆf(ξ) and defined by
f(ξ) =ˆ 1
√2π Z
R
f(x)e−iξxdx, ξ∈R. (1) Iff ∈L1(R) and ˆf ∈L1(R), then the inverse Fourier transform of ˆf is defined by
f(x) = 1
√2π Z
R
f(ξ)eˆ iξxdξ (2)
for a.e. x∈R. If f is continuous, then(1.2) holds for everyx.
It is known that several elementary functions, such as constant function, sinwt, coswt, do not belongs to L1(R) and hence they do not have Fourier transforms. But when these functions are multiplied by characteristic function, the resulting functions belongs to L1(R) and have Fourier transforms. Many
applications, including the analysis of stationary signals and real time signal processing, make an effective use of Fourier transform in time and frequency domains.
The remarkable success of the Fourier transform analysis is due to the fact that, under certain conditions, the signal can be reconstructed by the Fourier inversion formula. Thus the Fourier transform theory has been very useful for analyzing harmonic signals or signals for which there is no need for local information. On the other hand, Fourier transform analysis has also been very useful in many other areas, including quantum mechanics, wave motion and turbulence.
By Lebesgue lemma we have if f ∈ L1(R) then lim|ξ|→∞|fˆ(ξ)| = 0, it fol- lows that Fourier transform is a continuous linear operator from L1(R) into Co(R), the space of all continuous functions on R which decay at infinity, that is, f(x) → 0 as |x| → ∞. Roughly we say that if f ∈ L1(R), it does not necessarily imply that ˆf also belongs toL1(R).
Bellow [1] and Reinhold - Larsson [2] constructed examples of sequence of natural numbers along which the individual ergodic theorem holds in someLp spaces (good behavior) and not in others (bad behaviour). In particular, well behaved sequences were perturbed in such a way that good behavior persists only in certain spaces.
In the present work we provide a method for restricting the Fourier trans- form of f ∈ Lp(R) spaces using the pointwise convergence of convolution operators for approximate identities.
Definition 1.1. Let ϕ ∈ L1(R) such that ˆϕ(0) = 1. Then ϕε(x) = ε−1ϕ(x/ε) is called an approximate identity if
(i)R
Rϕε(x)dx= 1 (ii) supε>0R
R|ϕε(x)|dx <+∞, (iii) limε→0
R
|x|>δ|ϕε(x)|dx= 0,for all δ >0.
Proof. Properties (i) and (ii) can be proved by observing Z
R
ϕε(x)dx = Z
R
ε−1ϕ(x/ε)dx= Z
R
ϕ(x/ε)d(x/ε) = 1.
For (iii), we have Z
|x|>δ
ϕε(x)dx= Z
|x|>δ
1
εϕ(x/ε)dx= Z ∞
δ
1
εϕ(x/ε)dx+ Z −δ
−∞
1
εϕ(x/ε)dx.
Substitutingy=x/ε, we get
limε→0
Z ∞
δ/ε
ϕ(y)dy+ Z −δ/ε
−∞
ϕ(y)dy= 0.
Definition 1.2. A sequence of functions {φn}n∈N such that φn(x) = nφ(nx) where n = 1ε, n → ∞, ε −→ 0 is called an approximate identity if
(i)R
Rφn(x)dx= 1 for all n, (ii)supnR
R|φn(x)|dx <+∞, (iii)limn→∞
R
|x|>δ|φn(x)|dx= 0 for everyδ >0.
In the consequence of above Definition 1.2, we can easily prove the follow- ing proposition.
Proposition 1.1. A sequence of functions{φn}n∈N with φn ≥0,φˆn(0) = 1 is an approximate identity if for every ε > 0 there exists no ∈ N so that for alln≥no we have Rε
−εφn >1−ε.
Let us consider the class S(R) of rapidly decreasing C∞−functions on R i.e., Schwartz class such that
S(R) = {f :R→R,sup
x∈R
(xn dm
dxmf)(x)<∞}n, m∈N ∪(0).
It is well known that iff ∈S(R) then ˆf ∈ S(R) and S(R)⊂Lp(R).To prove the denseness ofS(R)∈Lp(R), we have
ρ∈S(R)⇒ |ρ(x)| ≤ c 1 +|x|n. For 1≤p <∞,
Z
R
|ρ(x)|pdx≤ Z
R
cp
(1 +|x|n)p <∞
which gives ρ∈Lp(R). Define a sequence {ρN} such that
ρN(x) =
f(x), if −N ≤x≤N; 0, otherwise ;
⇒ ∃ρN ∈S(R), f ∈Lp(R) such that Z
R
|ρN −f|pdx→0 asN → ∞. Hence S(R) is dense in Lp(R).
Remark 1.1. If 0≤φ(x)∈S(R) and ˆφ(0) = 1. Then φn(x) = nφ(nx) is an approximate identity.
Proposition 1.2. If f ∈L1(R) and φ ∈S(R) thenφ∗f ∈S(R).
Proof. We have
φ∗f = Z
R
φ(y)f(x−y)dy
dn
dxn(φ∗f) = Z
R
φ(y) dn
dxnf(x−y)dy or
|x|n dn
dxn(φ∗f) =|x|n Z
R
f(x−y) dn
dynφ(y)dy, substitutingx−y=z, we obtain,
= Z
R
f(y)|x|n dn
dxnφ(x−y)dy using|x−y| ≤ |x|+|y| ≤ 3|x|2 , we get
= Z
|y|>|x|2
f(y)|x|n dn
dxnφ(x−y)dy+ Z
|y|≤|x|2
f(y)|x|n dn
dxnφ(x−y)dy→0.
Proposition 1.3. Ifφn(x) is an approximate identity andf ∈Lp(R) then φn∗f →f ∈Lp(R).
Proof. Consider [
Z
R
|(φn∗f)(x)−f(x)|pdx]1/p = [ Z
R
dx|
Z
R
φn(x−y)f(y)dy−f(x)|p]1/p
= [ Z
R
dx|
Z
R
φn(y)f(x−y)dy−f(x)|p]1/p
usingf(x) =R
Rf(x)φn(y)dy in above we obtain [R
Rdx|R
Rφn(y)(f(x−y)−f(x))dy|p]1/p
≤ [ Z
R
dx Z
|y|>δ
|φn(y)|p|f(x−y)−f(x)|pdy]1/p + [
Z
R
dx Z
|y|≤δ
|φn(y)|p.|f(x−y)−f(x)|p]1/p (3)
≤ Z
|y|>δ
dy|φn(y)|[
Z
R
dx|f(x−y)−f(x)|p]1/p +
Z
|y|≤δ
dy|φn(y)|[
Z
R
|f(x−y)−f(x)|pdx]1/p (4)
≤ Z
|y|>δ
dy|φn(y)|(2kf kp) + Z
|y|≤δ
dy|φn(y)|sup
|y|≤δ
[ Z
R
|f(x−y)−f(x)|pdx]1/p.
Proceeding limits asn → ∞, the right hand side tends to zero since sup
|y|<δ
[ Z
R
|f(x−y)−f(x)|pdx]1/p →0.
Hence the proof is completed.
Proposition 1.4. Let φn=αnϕn+ (1−αn)σn,where {ϕn}n∈N, {σn}n∈N
are approximate identities and 0≤αn≤1.
(a) For 1 ≤ p < +∞ and every f ∈ Lp(R), limn→∞(φn−ϕn)∗f → 0 and limn→∞(φn−σn)∗f →0.
(b)For every f ∈L∞(R), limn→∞(φn−ϕn)∗f →0 a.e. . (c) For 1 ≤ p < ∞, if P
n(1 − αn)p < +∞, then for every f ∈ Lp(R), limn→∞(φn−ϕn)∗f →0 a.e. .
Proof.(a) Set 1 ≤p≤ ∞, andf ∈Lp(R).In view of Minkowski’s inequal- ity
k(φn−ϕn)∗f kp≤(1−αn)(kσn∗f −f kp +kϕn∗f −f kp) and using Proposition 1.3 we obtain k(φn−σn)∗f kp→0.
(b)Forf ∈L∞(R), |(φn−ϕn)∗f| ≤k(φn−ϕn)∗f k→0 by part(a).
(c)Forf ∈Lp(R) Z
R
X
n
(1−αn)p|σn∗f(x)|pdx = X
n
k(1−αn)σn∗f kpp
≤ X
n
(1−σn)p kf kpp<+∞.
Then (1−αn)σn∗f →0 a.e. . Similarly (αn−1)ϕn∗f →0 a.e. .
Definition 1.3. An approximate identity {φn} is called Lp− good if φn ∗f → f a.e. for all f ∈ Lp(R), and it is called good if it is Lp−good for every 1 ≤ p ≤ +∞. An approximate identity {φn} is called Lp−bad if there exists f ∈Lp(R) such that φn∗f 9f on a set of positive measure.
Definition 1.4. Let {ϕn}n∈N and {σn}n∈N be approximate identities, αn be a sequence of real numbers with 0 ≤ αn ≤ 1 and αn → 1. We call per- turbed approximate identities any approximate identity{φn}n∈N of the form φnϕn+ (1−αn)σn.
2 Main Results
Theorem 2.1.
(i)Given any good approximate identity {ϕn}n∈N there exists a perturbed approximate identity {φn}n∈N such thatf ∈Lq(R)
(φn∗ˆf)(ξ) = ˆφn(ξ) ˆf(ξ) ˆ
φˆn(ξ) ˆf(ξ)
→f(x) forq ≥p, p∈[1,∞) and
( ˆφn(ξ) ˆˆf(ξ))9f(x) for 1≤q < p.
(ii) ˆ
( ˆφn(ξ) ˆf(ξ))→f(x) forq > p and ( ˆφn(ξ) ˆˆf(ξ))9f(x) for 1 ≤q ≤p.
(iii) ˆ
( ˆφn(ξ) ˆf(ξ))→f(x) forq=∞
( ˆφn(ξ) ˆˆf(ξ))9f(x) for 1 ≤q <∞.
Proof. (i) Let
gn(x) = 1
√2π Z
R
eixξφˆn(ξ) ˆf(ξ)dξ
= 1
√2π Z
R
eixξ φˆn(ξ)
√2π Z
R
e−iξyf(y)dydξ
= 1
2π Z
R
ei(x−y)ξφˆn(ξ) Z
R
f(y)dy
= 1
√2π Z
R
φn(x−y)f(y)dy or = (φn∗f)(x)
( ˆφn(ξ) ˆˆf(ξ)) = 1
√2π Z
R
eixξφˆn(ξ) ˆf(ξ)dξ = (φn∗f)(x).
Fixq ≥p and taking 1−αn = (nlog12n)1/p Since Σn(1−αn)q <+∞ and ϕn is anLq−good approximate identity, using Proposition 1.4 we obtain that {φn} is also an Lq−good approximate identity.
Hence for q≥p,(φn∗f)(x)→f(x).
Now we have to prove that for each 1 ≤ q < p. there exists fq ∈ Lq(R) so that lim supκ|x|κ ddxκκ(φκ∗fq → ∞) on a set of positive measure.
Set
fq(x) = 1
(xlog2(x/2))1/qχ[0,1](x)∈Lq(R).
Choose
rn = 1
n1+1/p(logn)2/p, an =r
1 p+1
n = 1
n1/p(logn)p(p+1)2 ,
Jn = [an−rn, an+rn] and
Un= [−an+rn,−an+1+rn+1], for sufficiently large n and for allκ≥n,x∈Uκ,
φκ∗fq(x) ≥ (1−ακ)σκ∗fq(x)
≥ 1
(κlog2κ)1/p Z
−Jκ
σκ(y)fq(x−y)dy.
Now, we get
φκ∗fq(x)≥ fq(Crκ(logκ)2/p+1) (κlog2κ)1/p
Z
−Jκ
σκ(y)dy or
fq(Crκ(logκ)2/p+1) = κ1/q+1/pq(logκ)pq(p+1)2
C1/q(log(C/2κ(p+1)/p(logκ)2/p(p+1)))2/q. Then
φκ∗fq(x)≥Cκ1q−p1+pq1 Hq(κ)> κδ ≥nδ, where
Hq(κ) = (logκ)pq(p+1)2 −2p
C1/q(logC/2κ(p+1)/p(logκ)2/p(p+1))2/q and
0< δ <1/q−1/p+ 1/pq.
So
dκ
dxκ(φκ∗fq(x))≥C dκ
dxκ(κ1/q−1/p+1/pq
Hq(κ)) or
|x|n dn
dxn(φn∗fq(x))≥ |x|n Z
−Jκ
fq(x−y) dn
dynσκ(y)dy forκ≥n
|x|κ dκ
dxκ(φκ ∗fq(x))≥ |x|n dn
dxnnδ ≥ |x|n dn
dxn( 1 (x−y)pδ)
= |x|n(−1)n(pδ+n−1)!
(pδ)!(x−y)pδ+n
≥ |x|n (−1)n(pδ+n−1)!
(pδ)!Crn(logn)2/p+1(logn)2δ/p+1
→ ∞ asn → ∞.
In view of Sawyer’s Principle [3] there exists a functionsf ∈Lq([0,1)) ⊆Lq(R) such that lim supn|x|n ddxnn(φn∗f)→ ∞a.e. on a set of positive measure in R, It follows that φn∗f not belongs to S(R) or φn∗f 9f orφˆn(ξ) ˆˆf(ξ)9 f(x)
for 1≤q < p.
(ii) Let pn be a decreasing sequence of real numbers such that p1 > p2 >
....pn > ... & p. for each pi we can construct a perturbation {φin}n of {ϕn} that is Lq−good for q ≥ pi, and Lq−bad for 1≥ q < pi. Consider a sequence of blocks {Bκ}κ∈N, where Bκ = {φκnκ−1+1, ..., φκnκ,} and {nκ} is a sequence of positive integers increasing to infinity. Let Dκ = {nκ−1 + 1, ..., nκ}, and let {φn}n = UκBκ. Now fix q > p. There exists no ∈N so that for all n > no we havepn< q,
∞
X
κ=no
X
n∈Dκ
(1−ακn)q ≤
∞
X
κ=no
X
n∈Dκ
1 (nlog2n)q/pno
≤ X
n
( 1
nlog2n)q/pno <+∞.
Using Proposition 1.4(c) we get φn ∗ f → f for f ∈ Lq(R), q > p, or ˆ ˆ
φn(ξ) ˆf(ξ)→f(x) forq > p.
Now consider a sequence CiN → ∞ as i → ∞. Since {φin}n is Lq−bad for allq < pi, it is also Lp−bad. These existsfi ∈Lp([0,1)) andλNi >0 such that
|{ sup
n>ni−1
φin∗fi(x)}| >
Z
−Jκ
|φin(x)fi(y)|pdy
> CN kfi(x−λNi )kpp
= 2CiN,[kfi(x−λNi )kp= 21−i, CN = 2(i−1)p+1CiN].
It follows that there exists ni > ni−1, so that
|{ sup
ni−1<n≤ni
(φin∗fi)}|> CiN. Set
f˜=X
i
fi, then kf˜kp≤X
i
kfi kp≤2.
Suppose that{φn}satisfies a weak (p, p) inequality inLp([0,1)). We know that ifµbe a finite positive Borel measure, then these exists a sequence µn of atomic measure that converges to µweakly or if f has compact support then
Z
R
dµnf(x)→ Z
R
f(x)dµ or
µn→µweakly .
Iff ∈L1(R), dµ=|f(x)|dx is a finite Borel measure, so we can find
µn =
N
X
ı=1
CiNδλN
i →µ weakly.
Consider
|{sup
n
(φin∗f)}| = Z
−Jκ
|φin(y)f(x−y)|pdy
≤ Z
−Jκ
|φin(y)dµn(x−y)|pdy
≤ k
N
X
i=1
f(x−λNi )CiN kpp
≤
N
X
i=1
CiN kf(x−λNi )kpp
≤ CoN kf kpp
= 2pCoN. (1)
On the other hand,
|{sup
n
(φn∗f)}| ≤ |{ sup
ni−1<n≤ni
(φin∗f(i))}|> CiN (2) Combining Equations (2.1) and (2.2) we get
CoN > CiN
But CiN → ∞ as i → +∞. Hence φn∗f 9 f in Lp([0,1)). Since the spaces Lq([0,1)) are nested, {φn} is Lq([0,1))-bad for all 1 ≤q ≤p. Therefore, such a choice of {nκ} makes {φn}Lq(R)−bad for all 1 ≤ q ≤ p. This implies that
ˆ ˆ
φn(ξ) ˆf(ξ)9f(x) for 1≤q≤p.
(iii) Let {ϕn}n∈N be a good approximate identity, and let {ζn}n∈N be any approximate identity. Let {pn} be a sequence of real numbers satisfying
1≤p1 < p2 < ... < pn % ∞
Consider the blocks{Bκ}, where each blockBκ is related topκ.fori∈Dκ, let φi =ακiϕκi + (1−ακi)σiκ.
Choose nκ such that ακi →1. Then since {ϕn} is L∞ good, ϕn∗f →f a.e. for all f ∈L∞(R), and
ακiϕκi ∗f →f a.e. for all f ∈L∞(R).
Since
σiκ∗f(x)≤kf k∞ .
(1−ακi)σiκ∗f →0 a.e. for all f ∈L∞(R).
It follows thatφn∗f →fa.e, for allf ∈L∞(R).This implies that ˆ
( ˆφn(ξ) ˆf(ξ))→ f(x) forq =∞.
The approximate identity {φκn}n is Lpm−bad for every m ∈ {1, ..., κ}, since it is Lq−bad for every 1 ≤ q ≤ pκ. There exists fmκ ∈ Lpm([0,1)) with kfmκ(x−λκ(Nm ))k= 2−κ, λκ(N)m >0 and nκm > mκ−1 so that
|{ sup
nκ−1<n≤nκm
(φκn∗fmκ)}| > CN kfmκ(x−λκ(Nm ))kppmm
= CκN 2κpm Let ˜f =P
κ≥κofκκo, then kf˜kpκo<2.
So
|{sup
n
(φn∗f˜)}| ≤ C0./kf˜kppκoκo
≤ 2pκoCoN. (3) Hence
|{sup
n
(φn∗f˜)}| ≥ |{ sup
nκ−1<n≤nκ
(φκn∗fκκo)}|
> CκN
2κpκo (4)
using (2.3) and (2.4) we get
CoN > CκN
2κpκo(κ+1) →+∞
.Thus we conclude that ˆ ˆ
φn(ξ) ˆf(ξ)9f(x) For 1≤q <∞.
Hence the proof is completed.
References
[1] A. Bellow, Perturbation of a sequence, Advances in Mathematics, 78(1989), 131-139.
[2] K. Reinhold-Larsson, Discrepancy of behaviour of perturbed sequences inLp spaces, Proc. Amer. Math. Soc., 120 (1994), 865-874.
[3] S. Sawyer, Maximal inequalities of weak type, Ann. of Math., 84 (2)(1966), 157-174.