• Aucun résultat trouvé

Titchmarsh's theorem for the dunkl transform in the space L2(Rd, wk(x)dx)

N/A
N/A
Protected

Academic year: 2021

Partager "Titchmarsh's theorem for the dunkl transform in the space L2(Rd, wk(x)dx)"

Copied!
10
0
0

Texte intégral

(1)

Titchmarsh’s Theorem for the Dunkl transform in the space L 2 (R d , w k (x)dx)

Radouan Daher and

Mohamed El Hamma University of Hassan II, Morocco

Received : February 2013. Accepted : August 2013

Universidad Cat´ olica del Norte Antofagasta - Chile

Abstract

Using a generalized spherical mean operator, we obtain a general- ization of Titchmarsh’s theorem for the Dunkl transform for functions satisfying the (ψ, α, β)-Dunkl Lipschitz condition in L

2

(R

d

, w

k

(x)dx).

Keywords : Dunkl operator, Dunkl transform, generalized spher- ical mean operator.

Mathematics Subject Classification : 47B48; 33C52.

(2)

1. Intoduction and preliminaries

In [10], E. C. Titchmarsh characterized the set of functions in L 2 (R) satis- fying the Cauchy Lipschitz condition for the Fourier transform, namely we have

Theorem 1.1. Let α ∈ (0, 1) and assume that f ∈ L 2 (R). Then the following are equivalents

1. k f (x + h) − f(x) k L

2

( R ) = O(h α ) as h −→ 0, 2. R

|

λ

|≥

r | F(λ) | 2 dλ = O(r

) as r −→ + ∞ , where F stands for the Fourier transform of f.

The main aim of this paper is to establish a generalization of Theorem 1.1 in the Dunkl transform setting by means of the generalized spherical mean operator.

In this paper we consider the Dunkl operators T j , j = 1, 2, ..., d, which are the differential-difference operators introduced by C.F. Dunkl in [3].

These operators are very important in pure mathematics and in physics.

In the first we collect some notations and results on Dunkl operators and the Dunkl kernel (see [3], [4], [6]).

We consider R d with the Euclidean scalar product h ., . i and | x | = p h x, x i . For α ∈ R d \{ 0 } , let σ α be the reflection in the hyperplane H α ⊂ R d orthogonal to α.

i.e.,

σ α (x) = x − 2 h α, x i

| x | 2 α.

A finite set R ⊂ R d \{ 0 } is called a root system, if R ∩ R.α = { α, − α } and σ α R = R for all α ∈ R. For a given root system R the reflection σ α , α ∈ R, generate a finite group W ⊂ O(d), the reflection group associ- ated with R. We fix β ∈ R d \ ∪ α

R H α and define a positive root system R + = { α ∈ R/ h α, β i > 0 } .

A function k : R −→ C on a root system R is called a multiplicity func-

(3)

If one regards k as a function on the corresponding reflections, this means that k is constant on the conjugacy classes of reflections in W .

We consider the weight function w k (x) = Y

α

R

+

|h α, x i| 2k(α) ,

where w k is W -invariant and homogeneous of degree 2γ where γ = X

α

R

+

k(α).

We let η be the normalized surface measure on the unit sphere S d

1 in R d and set

dη k (y) = w k (y)dη(y).

Then η k is a W -invariant measure on S d

1 , we let d k = η k (S d

1 ).

Introduced by C.F. Dunkl in [3] the Dunkl operators T j , 1 ≤ j ≤ d, on R d associated with the reflection group W and the multiplicity function k are the first-order differential-difference operators given by

T j f (x) = ∂f

∂x j

(x) + X

α

R

+

k(α)α j

f (x) − f (σ α (x))

h α, x i , f ∈ C 1 (R d ), where α j = h α, e j i ; (e 1 , ...., e d ) being the canonical basis of R d and C 1 (R d ) is the space of functions of class C 1 on R d .

The Dunkl kernel E k on R d × R d has been introduced by C.F. Dunkl in [5]. For y ∈ R d the function x 7−→ E k (x, y) can be viewed as the solution on R d of the following initial problem

( T j u(x, y) = y j u(x, y) f or 1 ≤ j ≤ d u(0, y) = 1 f or all y ∈ R d

This kernel has unique holomorphic extension to C d × C d .

M. R¨ osler has proved in [8] the following integral representation for the

Dunkl kernel

(4)

E k (x, z) = Z

R

d

e

h

y,z

i

dµ x (y), x ∈ R d , z ∈ C d ,

where µ x is a probability measure on R d with support in the closed ball B(0, | x | ) of center 0 and raduis | x | .

Proposition 1.2. [6]: Let z, w ∈ C d and λ ∈ C. Then 1. E k (z, 0) = 1,

2. E k (z, w) = E k (w, z), 3. E k (λz, w) = E k (z, λw),

4. For all ν = (ν 1 , ..., ν d ) ∈ N d , x ∈ R d , z ∈ C d , we have

| D ν z E k (x, z) | ≤ | x |

|

ν

|

exp( | x || Rez | ), where

D z ν = ∂

|

ν

|

∂z 1 ν

1

...∂z d ν

d

; | ν | = ν 1 + ... + ν d . In particulier

| D ν z E k (ix, z) | ≤ | x |

|

ν

|

, for all x, z ∈ R d .

The Dunkl transform is defined for f ∈ L 1 k (R d ) = L 1 (R d , w k (x)dx) by f b (ξ) = c

k 1

Z

R

d

f (x)E k ( − iξ, x)w k (x)dx, where the constant c k is given by

c k = Z

R

d

e

|z|

2

2

w k (z)dz.

(5)

1. When both f and f b are in L 1 k (R d ), we have the inversion formula f (x) =

Z R

d

f b (ξ)E k (ix, ξ)w k (ξ)dξ, x ∈ R d ,

2. (Plancherel’s theorem) The Dunkl transform on S(R d ), the space of Schwartz functions, extends uniquely to an isometric isomorphism on L 2 k (R d ).

K. Trim` eche has introduced [11] the Dunkl translation operators τ x , x ∈ R d . For f ∈ L 2 k (R d ) and we have

x d (f ))(ξ) = E k (ix, ξ) f(ξ), b and

τ x (f )(y) = c

k 1 Z

R

d

f b (ξ)E k (ix, ξ)E k (iy, ξ)w k (ξ)dξ.

The generalized spherical mean operator for f ∈ L 2 k (R d ) is defined by M h f(x) = 1

d k

Z S

d1

τ x (hy)dη k (y), x ∈ R d , h > 0.

From [7], we have M h f ∈ L 2 k (R d ) whenever f ∈ L 2 k (R d ) and k M h f k L

2k

≤ k f k L

2k

.

For p ≥ − 1 2 , we introduce the normalized Bessel functuion j p defined by

j p (z) = Γ(p + 1) X

n=0

( − 1) n (z/2) 2n

n!Γ(n + p + 1) , z ∈ C, where Γ is the gamma-function.

Lemma 1.3. [1] The following inequalities are fulfilled 1. | j p (x) | ≤ 1,

2. 1 − j p (x) = O(x 2 ); 0 ≤ x ≤ 1.

(6)

Lemma 1.4. The following inequality is true

| 1 − j p (x) | ≥ c, with | x | ≥ 1, where c > 0 is a certain constant.

(Analog of lemma 2.9 in [2])

Proposition 1.5. Let f ∈ L 2 k (R d ). Then (M d h f)(ξ) = j γ+

d

2−

1 (h | ξ | ) f(ξ). b (See [7])

For any function f(x) ∈ L 2 k (R d ) we define differences of the order m (m ∈ { 1, 2, ... } ) with a step h > 0.

m h f (x) = (M h − I ) m f (x), (1.1)

here I is the unit operator.

Lemma 1.6. Let f ∈ L 2 k (R d ). Then k ∆ m h f (x) k 2 L

2k

=

Z

R

d

| 1 − j γ+

d

2−

1 (h | ξ | ) | 2m | f b (ξ) | 2 w k (ξ)dξ.

From formula (1.1) and proposition 1.5, we have (∆ d m h f )(ξ) = (j γ+

d

2−

1 (h | ξ | ) − 1) m f b (ξ).

By Parseval’s identity, we obtain k ∆ m h f (x) k 2 L

2

k

= Z

R

d

| 1 − j γ+

d

2−

1 (h | ξ | ) | 2m | f b (ξ) | 2 w k (ξ)dξ.

The lemma is proved 2. Main Results

In this section we give the main result of this paper. We need first to define

(7)

Definition 2.1. Let α > 0 and β > 0. A function f ∈ L 2 k (R d ) is said to be in the (ψ, α, β)-Dunkl Lipschitz class, denoted by Lip(ψ, α, β); if:

k ∆ m h f (x) k L

2k

= O(h α ψ(h β )) as h −→ 0; m ∈ { 1, 2, ... } ,

where ψ(t) is a continuous increasing function on [0, ∞ ), ψ(0) = 0 and ψ(ts) = ψ(t)ψ(s) for all t, s ∈ [0, ∞ ) and this function verify

Z 1/h 0

r 2m

1 ψ(r

)dr = O(h

2m ψ(h )) as h −→ 0.

Theorem 2.2. Let f ∈ L 2 k (R d ). Then the following are equivalents 1. f ∈ Lip(ψ, α, β),

2. R

|

ξ

|≥

s | f b (ξ) | 2 w k (ξ)dξ = O(s

ψ(s

)) as s −→ + ∞ . 1) = ⇒ 2) Assume that f ∈ Lip(ψ, α, β). Then we have

k ∆ m h f (x) k L

2k

= O(h α ψ(h β )) as h −→ 0, From lemma 1.6, we have

k ∆ m h f (x) k 2 L

2k

= Z

R

d

| 1 − j γ+

d

2−

1 (h | ξ | ) | 2m | f(ξ) b | 2 w k (ξ)dξ.

If | ξ | ∈ [ 1 h , 2 h ] then h | ξ | ≥ 1 and lemma 1.4 implies that 1 ≤ 1

c 2m | 1 − j γ+

d

2−

1 (h | ξ | ) | 2m . Then

Z

1

h≤|

ξ

|≤2h

| f b (ξ) | 2 w k (ξ)dξ ≤ 1 c 2m

Z

1

h≤|

ξ

|≤2h

| 1 − j γ+

d

2−

1 (h | ξ | ) | 2m | f b (ξ) | 2 w k (ξ)dξ

≤ 1 c 2m

Z

R

d

| 1 − j γ+

d

2−

1 (h | ξ | ) | 2m | f(ξ) b | 2 w k (ξ)dξ

≤ Ch (ψ(h β )) 2 = Ch ψ(h ).

Therefore Z

s

≤|

ξ

|≤

2s | f(ξ) b | 2 w k (ξ)dξ ≤ Cs

ψ(s

).

(8)

Furthermore, we have R

|

ξ

|≥

s | f b (ξ) | 2 w k (ξ)dξ

= ³R s

≤|

ξ

|≤

2s + R 2s

≤|

ξ

|≤

4s + R 4s

≤|

ξ

|≤

8s +... ´ | f b (ξ) | 2 w k (ξ)dξ

≤ C ³ s

ψ(s

) + (2s)

ψ((2s)

) + (2 2 s)

ψ((2 2 s)

) + ... ´

≤ C ³ s

ψ(s

) + 2

s

ψ(s

) + (2

) 2 s

ψ(s

) + .... ´

≤ Cs

ψ(s

)(1 + 2

+ (2

) 2 + (2

) 3 + ...)

≤ K α s

ψ(s

),

where K α = C(1 − 2

)

1 . This proves that

Z

|

ξ

|≥

s | f b (ξ) | 2 w k (ξ)dξ = O(s

ψ(s

)) as s −→ + ∞ 2) = ⇒ 1) Suppose now that

Z

|

ξ

|≥

s | f b (ξ) | 2 w k (ξ)dξ = O(s

ψ(s

)) as s −→ + ∞ . We have to show that

Z

0

r 2γ+d

1 | 1 − j γ+

d

2−

1 (hr) | 2m φ(r)dr = O(h ψ(h )), where we have set

φ(r) = Z

S

d1

| f b (ry) | 2 w k (y)dy.

We write I 1 =

Z 1/h 0

r 2γ+d

1 | 1 − j γ+

d

2−

1 (hr) | 2m φ(r)dr, and

I 2 = Z

1/h

r 2γ+d

1 | 1 − j γ+

d

2−

1 (hr) | 2m φ(r)dr.

Firstly, from (1) in lemma 1.3 we see that I 2 ≤ 4 m

Z

1/h

r 2γ+d

1 φ(r)dr = O(h ψ(h )) as h −→ 0.

(9)

g(r) = Z

r

x 2γ+d

1 φ(x)dx.

From (2) in lemma 1.3, an integration by parts yields

I 1 ≤ − C 1 h 2m Z 1/h

0

r 2m g

0

(r)dr

≤ − C 1 g(1/h) + 2mC 1 h 2m Z 1/h

0

r 2m

1 g(r)dr

≤ 2mC 1 h 2m Z 1/h

0

r 2m

1 r

ψ(r

)dr

≤ 2mC 1 h 2m Z 1/h

0

r 2m

1 ψ(r

)dr

≤ C 2 h 2m h

2m ψ(h )

≤ C 2 h ψ(h ),

where C 1 and C 2 are positive constants, and this ends the proof

References

[1] V. A. Abilov and F. V. Abilova, Approximation of Functions by Fourier-Bessel Sums, Izv. Vyssh. Uchebn. Zaved. Mat., No. 8, pp.

3-9 (2001).

[2] E. S. Belkina and S.S. Platonov, Equivalence of K-Functionals and Modulus of Smoothness Constructed by Generalized Dunkl Transla- tions, Izv. Vyssh. Uchebn. Zaved. Mat, No. 8, pp. 3-15 (2008).

[3] C. F. Dunkl, Differential-difference operators associated to reflection group, Trans. Amer. Math. Soc. 311, pp. 167-183, (1989).

[4] C. F. Dunkl, Hankel transforms associated to finite reflection groups, Contemp. Math. 138, pp. 123-138, (1992).

[5] C. F. Dunkl, Integral kernels with reflection group invariance , Canad.

J. Math. 43, pp. 1213-1227, (1991).

(10)

[6] M. F. E. Jeu, The Dunkl transform, Invent. Math. 113, pp. 147-162, (1993).

[7] M. Maslouhi, An anlog of Titchmarsh’s Theorem for the Dunkl trans- form, J. Integral. Trans. Spec. Funct, Vol. 21, Issue 10, pp. 771-778, (2010).

[8] M. R¨ osler, Posotivity of Dunkl’s intertwining operator, Duke Math. J.

98, pp. 445-463, (1999). [arxiv.org/abs/q-alg/9710029].

[9] M. R¨ osler, M. Voit, Markov processes with Dunkl operators, Adv. in Appl. Math. 21, pp. 575-643, (1998).

[10] E. S. Titchmarsh, Introduction to the Theory of Fourier Integrals, Ox- ford University Press, Amen House, London, E. C. 4. (1948).

[11] K. Trim` eche, Paley-Wiener theorems for the Dunkl transform and Dunkl translation operators, Integral Transforms Spec. Funct. 13, pp.

17-38, (2002).

Radouan Daher

Department of Mathematics, Faculty of Sciences A¨ ın Chock,

University of Hassan II, Casablanca, Morocco e-mail: rjdaher024@gmail.com

and

Mohamed El Hamma

Department of Mathematics, Faculty of Sciences A¨ ın Chock, University of Hassan II, Casablanca,

Morocco

e-mail: m elhamma@yahoo.fr

Références

Documents relatifs

Les composés B et D présentent le même nombre de formes limites, pour comparer la basicité de ces deux composés on compare la force de l’effet attracteur

When C 0 ⊂ X has minuscule multiplicity C k at p with the corresponding minus- cule representation V, we define (When X is a del Pezzo surface, we use lines in X to construct

Estimates for the Fourier transform of the characteristic function of a convex set.. INGVAR SVENSSON University of Lund,

We were using Forest Inventory and Analysis (FIA) data to validate the diameter engine of the Forest Vegetation Simulator (FVS) by species. We’d love to have used the paired

proved two useful estimates for the Fourier transform in the space of square integral multivariable functions on certain classes of functions characterized by the generalized

Abstract: Using a generalized translation operator, we obtain a generalization of Titchmarsh’s theorem of the Jacobi transform for functions satisfying the ψ- Jacobi

In Chapter 5, we use the adap- tively damped Picard iterations and a restricted unigrid method to solve nonlinear diffusion problems and ensure the positivity of approximate

It is only for very shallow trees ( max_depth=1 or 2 ) and high relevance that X 2 is identified with higher confidence than in ETs... Im- portance scores are normalized by the sum