• No results found

On the Composition of Distributions x−sln|x| and |x|μ

N/A
N/A
Protected

Academic year: 2020

Share "On the Composition of Distributions x−sln|x| and |x|μ"

Copied!
9
0
0

Loading.... (view fulltext now)

Full text

(1)

Volume 2007, Article ID 60129,9pages doi:10.1155/2007/60129

Research Article

On the Composition of Distributions

x

−s

ln

|

x

|

and

|

x

|

μ

Biljana Jolevska-Tuneska and Emin ¨

Ozc¸a¯g

Received 31 January 2007; Revised 11 May 2007; Accepted 12 June 2007

Recommended by Michael M. Tom

LetF be a distribution and let f be a locally summable function. The distributionF(f) is defined as the neutrix limit of the sequence{Fn(f)}, whereFn(x)=F(x)∗δn(x) and

{δn(x)}is a certain sequence of infinitely differentiable functions converging to the Dirac

delta-functionδ(x). The composition of the distributionsx−sIn|x|and|x|μis evaluated

fors=1, 2,...,μ >0 andμs=1, 2,....

Copyright © 2007 B. Jolevska-Tuneska and E. ¨Ozc¸a¯g. This is an open access article dis-tributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is prop-erly cited.

In the following, we letᏰbe the space of infinitely differentiable functions with com-pact support, letᏰ(a,b) be the space of infinitely differentiable functions with support contained in the interval (a,b), and letᏰbe the space of distributions defined onᏰ.

We define the locally summable functions

+,xλ−,+lnx+,x−λlnx−,|x|λ, and|x|λln|x| forλ >−1 (see [1]) by

x+λ=

⎧ ⎨ ⎩x

λ, x >0,

0, x <0, x

λ −=

⎧ ⎨ ⎩|x|

λ, x <0,

0, x >0,

+lnx+=

⎧ ⎨ ⎩x

λlnx, x >0,

0, x <0, x

λ lnx−=

⎧ ⎨ ⎩|x|

λln|x|, x <0,

0, x >0, |x|λ=xλ

++x−λ, |x|λln|x| =x+λlnx++xλ−lnx−.

(1)

The distributions

+andx−λ are then defined inductively forλ <−1 andλ= −2,−3,...by

+

=

λxλ−1 + ,

= −

λxλ−1

(2)

It follows that ifris a positive integer and−r−1< λ <−r, then

+,ϕ(x)

=

0 x λ

ϕ(x)−r −1

k=0 ϕ(k)(0)

k! xk

dx,

,ϕ(x)= 0

−∞|x| λ

ϕ(x)−r −1

k=0 ϕ(k)(0)

k! xk

dx

(3)

for arbitraryϕinᏰ. In particular, ifϕhas its support contained in the interval [−1, 1], then

+,ϕ(x)

= 1

0x λ

ϕ(x)

r1

k=0 ϕ(k)(0)

k! x

k

dx+

r1

k=0

ϕ(k)(0) k!(λ+k+ 1),

xλ−,ϕ(x)

= 0

1|x| λ

ϕ(x)

r1

k=0 ϕ(k)(0)

k! x

k

dx+

r1

k=0

(−1)kϕ(k)(0) k!(λ+k+ 1),

(4)

|x|λ,ϕ(x)= 1 1|x|

λ

ϕ(x)

r1

k=0 ϕ(k)(0)

k! x

k

dx+

r1

k=0

1 + (−1)kϕ(k)(0) k!(λ+k+ 1) ,

|x|λln|x|,ϕ(x)= 1 1|x|

λln|x|

ϕ(x)

r1

k=1 ϕ(k)(0)

k! x

k

dx+

r1

k=0

1 + (−1)kϕ(k)(0) k!(λ+k+ 1)2

(5)

if−r−1< λ <−r.

We define the distributionx−1ln|x|by

x−1ln|x| =1 2

ln2|x|, (6)

and we define the distributionx−r−1ln|x|inductively by

x−r−1ln|x| =x−r−1−

x−rln|x|

r (7)

forr=1, 2,.... It follows by induction that

x−r−1ln|x| =φ(r)x−r−1+(−1)r

x−1ln|x|(r)

r! (r)x

−r−1+(−1)r

ln2|x|(r+1) 2r! , (8)

where

φ(r)=

⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩

r

i=1

i−1, r=1, 2,...,

0, r=0.

(9)

(3)

sums of the functions

lnr−1

n, lnrn, λ >0,r=1, 2,... (10)

as well as all functions which converge to zero in the usual sense asntends to infinity. Now letρ(x) be an infinitely differentiable function having the following properties:

(i)ρ(x)=0 for|x| ≥1, (ii)ρ(x)0,

(iii)ρ(x)(−x), (iv)11ρ(x)dx=1.

Putting δn(x)=nρ(nx) forn=1, 2,..., it follows that{δn(x)}is a regular sequence of

infinitely differentiable functions converging to the Dirac delta-functionδ(x). Next, for an arbitrary distribution f inᏰ, we define

fn(x)=f ∗δn(x)=f(t),δn(x−t) (11)

forn=1, 2,.... It follows that {fn(x)} is a regular sequence of infinitely differentiable

functions converging to the distribution f(x). The following definition was given in [3].

Definition 1. LetF be a distribution and let f be a locally summable function. Say that the distributionF(f(x)) exists and is equal tohon the open interval (a,b) if

Nlim

n→∞

−∞Fn

f(x)ϕ(x)dx=h(x),ϕ(x) (12)

for all test functionsϕwith compact support contained in (a,b).

The following theorems were proved in [4,5] and [6], respectively.

Theorem 2. The distribution (xr)−sexists and

xr−s=x−rs (13)

forr,s=1, 2,....

Theorem 3. The distribution (|x|μ)−sexists and

|x|μ−s= |

x|−μs (14)

fors=1, 2,...,μ >0 andμs=1, 2,....

Theorem 4. IfFs(x) denotes the distributionx−sln|x|, then the distributionFs(xr) exists

and

Fs

xr=rF

rs(x) (15)

forr,s=1, 2,....

(4)

Lemma 5.

1

−1v

iρ(r)(v)dv=

⎧ ⎨ ⎩

0, 0≤i < r,

(−1)rr!, i=r (16)

forr=0, 1, 2,....

We now prove the following theorem on the composition of distributions in the neu-trix setting.

Theorem 6. IfFs(x) denotes the distributionx−sln|x|, then the distributionFs(|x|μ) exists

and

Fs|x|μ=μ|x|−μsln|x| (17)

fors=1, 2,...,μ >0 andμs=1, 2,....

Proof. We will suppose thatr < μs < r+ 1 for some positive integerr. We put

Fs

|x|μ n=Fs

|x|μδ n(x)

(s−1)|x|μ−s n−

(−1)s

2(s−1)! 1/n

1/nln 2

|x|μtδ(s) n (t)dt,

(18)

and note that

1

−1x k 1/n

−1/nln 2|

x|μtδ(s) n (t)dt dx

=

⎧ ⎪ ⎨ ⎪ ⎩

0, kodd,

2 1

0x k 1/n

−1/nln 2|

x|μtδ(s)

n (t)dt dx, keven.

(19)

Then

1

0x k 1/n

−1/nln 2

xμ−tδ(s) n (t)dt dx

= 1/n −1/nδ

(s) n (t)

n−1

0 x kln2

tdx dt

+ 1/n

1/nδ (s) n (t)

1

n−1/μx kln2

xμ−tdx dt

=n(μs−k−1)/μ μ

1

−1ρ (s)(v) 1

0u

−(μ−k−1)/μln2u−v n

dudv

+n

(μs−k−1) μ

1

1ρ (s)(v) n

1 u

(μ−k−1)ln2u−v n

dudv

=I1+I2,

(20)

(5)

It is easily seen that

Nlim

n→∞ I1=0 (21)

fork=0, 1,...,r−1. Now,

I2=n(μs−k−1) μ

1

1ρ (s)(

v)

n

1u

(μ−k−1)ln1−v u

+ lnu−lnn2dudv

=n(μs−k−1)/μ μ

1

−1ρ (s)(v) n

1u

−(μ−k−1)/μln21−v u

dudv

+2n

(μs−k−1) μ

1

1ρ (s)(v) n

1u

(μ−k−1)lnuln1−v u

dudv

2n(μs−k−1)/μ μ lnn

1

−1ρ (s)(v) n

1u

−(μ−k−1)/μln1−v u

dudv

=J1+J2+J3,

(22)

since−11 ρ(s)(v)dv=0 fors=1, 2,..., by Lemma5.

It is easily seen that

Nlim

n→∞ J3=0. (23)

Next, we have

J1=n(μs−k−1) μ

1

1ρ (s)(v) n

1 u

(μ−k−1)

i=1 vi iui

2 dudv

=2n(μs−k−1)/μ μ

i=1 φ(i) i+ 1

1

−1v

i+1ρ(s)(v) n 1 u

(k+1)/μ−i−2dudv

=2n(μs−k−1)/μ μ

i=1 φ(i) i+ 1

μn(k+1)/μ−i−11 k−μ(i+ 1) + 1

1

−1v

i+1ρ(s)(v)dv,

(24)

and it follows that

Nlim

n→∞ J1=

2φ(s−1) s(μs−k−1)

1

−1v sρ(s)(

v)dv=2(−1)(s−1)(s−1)!

μs−k−1 , (25)

on using Lemma5, fork=0, 1,...,r−1. Finally,

J2=2n(μs−k−1)/μ μ

i=1 1

i 1

−1v

iρ(s)(v) n 1u

(k+1)/μ−i−1lnududv

=2

i=1 1 i

ns−ilnn k−μi+ 1

μns−in(μs−k−1)/μ

(k−μi+ 1)2

1

1v

iρ(s)(v)dv,

(6)

and it follows that

Nlim

n→∞ J2=

2μ(−1)s−1(s1)!

(μs−k−1)2 , (27)

on using Lemma5, fork=0, 1,...,r−1. Hence,

Nlim

n→∞ 1

0x k 1/n

−1/nln 2

xμ−tδn(s)(t)dt dx

=2(−1)s(s1)! φ(s−1) μs−k−1

μ (μs−k−1)2

(28)

fork=0, 1,...,r−1, on using (19) to (23). Then using (19) and (25), we see that

Nlim

n→∞ 1

−1x k 1/n

−1/nln 2

|x|μtδ(s) n (t)dt dx

=2(−1)s(s1)! φ(s−1) μs−k−1

μ (μs−k−1)2

(−1)k+ 1

(29)

fork=0, 1,...,r−1.

Whenk=r, (18) still holds, but now we have

I1=n(μs−r−1) μ

1

1ρ (s)(v) 1

0u

−(μ−r−1)/μln2u−v n

dudv, (30)

and it follows that for any continuous functionψ

lim

n→∞ n−1

0 x r 1/n

−1/nln 2

|x|μtδ(s)

n (t)dt ψ(x)dx=0. (31)

Similarly,

lim

n→∞ 0

−n−1/μx r 1/n

−1/nln 2

|x|μtδ(s)

n (t)dt ψ(x)dx=0. (32)

Next, when|x|μ1/n, we have

1/n

−1/nln 2

|x|μtδ(s)

n (t)dt=ns 1

−1ln 2

|x|μv/nρ(s)(v)dv

=ns 1 1

ln|x|μ i=1

vi ini|x|μi

2

ρ(s)(v)dv

=

i=s

−2 ln|x|μ+ 2φ(i1) ini−s|x|μi

1

1v iρ(s)(

v)dv.

(33)

It follows that

1/n

1/nln 2|

x|μtδ(s) n (t)dt

i=s

4μln|x|+ 4φ(i−1)Ks

(7)

fors=1, 2,..., where

Ks= 1

1

ρ(s)(v)dv. (35)

If nown−1< η <1, then

η

n−1/μx r

1/n

1/nln 2

|x|μtδ(s) n (t)

dt dx

i=s

4Ksμ ini−s

η

n−1/μx

r−μilnx dx+ i=s

4Ksφ(s−1) ini−s

η

n−1/μx r−μidx

=

i=s

4Ksμ ini−s

ηr+1−μilnηni−(r+1)lnn1

r+ 1−μi

ηr+1−μini−(r+1)

(r+ 1−μi)2

+

i=s

4Ksφ(s−1) ini−s

ηr+1−μini−(r+1) r+ 1−μi .

(36)

It follows that

lim

n→∞ η

n−1/μx r

1/n

1/nln 2

|x|μtδ(s) n (t)

dt dx=O(ηlnη) (37)

fors=1, 2,....

Thus, ifψis a continuous function, then

lim

n→∞

η

n−1/μx

rψ(x) 1/n −1/nln

2

|x|μtδ(s) n (t)dt dx

=O(ηlnη) (38)

fors=1, 2,.... Similarly,

lim

n→∞

−n−1

−η x

rψ(x) 1/n 1/nln

2

|x|μtδ(s) n (t)

dt dx=O(ηlnη) (39)

fors=1, 2,....

Now let ϕ(x) be an arbitrary function inᏰwith support contained in the interval [−1, 1].By Taylor’s theorem, we have

ϕ(x)=

r−1

k=0 xk k!ϕ

(k)(0) +xr r!ϕ

(r)(

(8)

where 0< ξ <1. Then

1/n

1/nln 2|

x|μtδ(s)

n (t)dt,ϕ(x)

= 1

1ϕ(x) 1/n

1/nln 2|

x|μtδ(s) n (t)dt dx

=r− 1

k=0 ϕ(k)(0)

k! 1

−1x k 1/n

−1/nln 2|

x|μtδ(s) n (t)dt dx

+

n−1

−n−1 xr r!ϕ

(r)(ξx) 1/n 1/nln

2|

x|μtδ(s) n (t)dt dx

+ η

n−1 xr

r!ϕ

(r)(ξx) 1/n −1/nln

2

|x|μtδ(s) n (t)dt dx

+ 1

η xr r!ϕ

(r)(ξx) 1/n 1/nln

2|

x|μtδ(s) n (t)dt dx

+ −n−1

−η xr r!ϕ

(r)( ξx)

1/n

−1/nln 2

|x|μtδ(s) n (t)dt dx

+ −η

1 xr r!ϕ

(r)( ξx)

1/n

1/nln 2

|x|μtδ(s)

n (t)dt dx.

(41)

Using equations (27) to (32) and noting that on the intervals [−1,−η] and [η, 1],

lim

n→∞ (−1)s

2(s−1)! 1/n

−1/nln 2

|x|μtδ(s)

n (t)dt=φ(s−1)|x|−μs−μ|x|−μsln|x|. (42)

Since|x|μandF

s(x) are continuous on these intervals, it follows that

Nlim

n→∞

(−1)s

2(s−1)! 1/n

1/nln 2

|x|μtδ(s)

n (t)dt,ϕ(x)

=

r1

k=0

φ(s1)

μs−k−1 μ (μs−k−1)2

ϕ(k)(0)

k!

(−1)k+ 1

+Oη|lnη|+ 1

η xr−μs

r! ϕ

(r)(ξx)φ(s1)μlnxdx

+ −η

1 |x|r−μs

r! ϕ

(r)(ξx)φ(s1)μln|x|dx.

(9)

Sinceηcan be made arbitrarily small, it follows that

Nlim

n→∞

(−1)s

2(s−1)! 1/n

−1/nln 2

|x|μtδ(s)

n (t)dt,ϕ(x)

=

r−1

k=0

φ(s−1) μs−k−1

μ (μs−k−1)2

ϕ(k)(0) k!

(−1)k+ 1

+φ(s−1) 1

1|x| −μs

ϕ(x)

r−1

k=0 xk k!ϕ

(k)(0)

dx

−μ 1

1|x| −μsln|x|

ϕ(x)

r−1

k=0 xk k!ϕ

(k)(0)

dx

(s−1)|x|−μs,ϕ(x)μ|x|−μsln|x|,ϕ(x)

(44)

on using (5). This proves (15) on the interval [−1, 1]. However, (15) clearly holds on any interval not containing the origin, and the proof is complete.

Acknowledgment

The authors would like to thank the referee for valuable remarks and suggestions on the previous version of the paper.

References

[1] I. M. Gel’fand and G. E. Shilov, Generalized Functions. Vol. I: Properties and Operations, Aca-demic Press, New York, NY, USA, 1964.

[2] J. G. van der Corput, “Introduction to the neutrix calculus,” Journal d’Analyse Math´ematique, vol. 7, pp. 281–399, 1960.

[3] B. Fisher, “On defining the change of variable in distributions,” Rostocker Mathematisches

Kollo-quium, no. 28, pp. 75–86, 1985.

[4] J. D. Nicholas and B. Fisher, “A result on the composition of distributions,” Proceedings of the

Indian Academy of Sciences. Mathematical Sciences, vol. 109, no. 3, pp. 317–323, 1999.

[5] B. Fisher and B. Jolevska-Tuneska, “Two results on the composition of distributions,” Thai

Jour-nal of Mathematics, vol. 3, no. 1, pp. 17–26, 2005.

[6] B. Fisher, B. Jolevska-Tuneska, and A. Takaˇci, “On the composition of distributionsx−sIn|x|and xr,” Thai Journal of Mathematics, vol. 1, no. 1, pp. 39–48, 2003.

Biljana Jolevska-Tuneska: Faculty of Electrical Engineering and Information Technologies, Ss. Cyril and Methodius University – Skopje, Karpos II bb, 1000 Skopje, Macedonia

Email address:biljanaj@etf.ukim.edu.mk

Emin ¨Ozc¸a¯g: Department of Mathematics,, Faculty of Science, University of Hacettepe, 06532 Beytepe, Ankara, Turkey

References

Related documents

Function: Within the regional and national context of natural disasters and violent conflicts, design, monitoring and evaluation of emergency response and disaster risk

This implies that construction costs for the larger wineries resulted in a reduced total investment cost per unit, but that savings among winery production sizes may be small

As the delivery of Design Central’s core service is strongly linked to the knowledge and skills of James and Cathy, improvements in managing and sharing their knowledge will have

What are the major issues and challenges related to Business Process Management implementation and adoption in Small- and Medium-sized Enterprises of the Iranian

Resetting the relationship requires a change in not only the way Indigenous policy is enacted at the Federal level, but also the way engagement and business (especially

Ours was the first survey-based study conducted in Ras AL Khaimah, U.A.E which assesses the knowledge, attitude and belief of hospital physicians and community

Using these reference controls and mRNA from whole wing imaginal discs, we detected elevated relative expression of genes that are upregulated after tissue damage, such as puckered

inter-procedural regression testing that deals with both code and specification changes. This technique determines where to place a firewall around modified code modules.