• No results found

How to recognize

N/A
N/A
Protected

Academic year: 2021

Share "How to recognize"

Copied!
1
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

152

NAW 5/1 nr. 2 juni 2000 How to recognize functions in Lp(R) + Lq(R) G. Helmberg

G. Helmberg

Institut für Technische Mathematik und Geometrie

Universität Innsbruck, Technikerstrasse 13, A-6020 Innsbruck Gilbert.Helmberg@uibk.ac.at

How to recognize

functions in L p ( R ) + L q ( R )

Consider two function spaces Lp = Lp(R)and Lq =Lq(R) (0<

pq). The interest in the space Lp+Lq = {f = fp+fq : fpLp, fqLq}originates in Fourier analysis [2 (p.18)]: for any function f = f1+f2L1+L2it is possible to define a Fourier transform ˆf= ˆf1+ ˆf2C0+L2and ˆf is well-defined even if the representation of f= f1+f2is not unique.

This definition extends the Fourier transform to all functions fLs(1≤ s≤ 2), since it is easy to see that LsLp+Lqfor p <

s<q [1 (13.19)]; for any fLswe have Z

{| f |>1}

|f|pdx≤ Z {| f |>1}

|f|sdx<∞, Z

{| f |≤1}

|f|qdx≤ Z {| f |≤1}

|f|sdx<∞ if q<∞,

f =f 1{| f |>1}+f 1{| f |≤1}Lp+Lq. (1)

Not every function in Lp+Lq, however, needs to belong to some space Ls, as demonstrated by the functions fL1+L2defined by f(x) =xαfor α∈] −1,−12[.

If one wants to apply a Fourier transformation ˆf= ˆf1+ ˆf2 to a given function f on R, one has to make sure that f belongs to L1+L2and one has to exhibit the components f1and f2of some representation of f as in (1). Since in general|fp+fq| may be small if|fp|and|fq| are both large and either of these may be small if|fp+fq|is large it is not obvious that in general the func- tions f> = f 1{| f |>1} and f<= f 1{| f |≤1}

serve to determine indices p and q and furnish a decomposition as in (1). Concerning the latter remark we have the following the- orem.

Theorem. A complex-valued function f belongs to Lp+Lq(0< pq)if and only if f>Lpand f<Lq.

Proof. Since f = f 1{| f |>1}+f 1{| f |≤1}the ‘if’-part is clear.

Conversely, if f = fp+fq( fpLp, fqLqwithout loss of gener- ality we assume 0<pq), then we have

|f|1{| f |>1}≤ |f|1{| f

p|>12}+|f|1{| f

q|>12}

≤ |fp|1{| f

p|>12}+|fq|1{| f

p|>12}+|fp|1{| f

q|>12}+|fq|1{| f

q|>12}. (2) Since the sets{|fp| > 12}and{|fq| > 12}have finite measure, all four functions on the right side of (2) and therefore also f 1{| f |>1}

belong to Lp. Furthermore,

|f|1{| f |≤1}≤ (|fp|+|fq|)1{| fp|≤1,| fq|≤1}+1{| fp|>1}+1{| fq|>1}

≤ |fp|1{| fp|≤1}+|fq|1{| fq|≤1}+1{| fp|>1}+1{| fq|>1}. (3) Again all four functions on the right side of (3) belong to Lq, there-

fore also f 1{| f |≤1}. 

Since for a given function f on R the integralsR{| f |>1}|f|sdx and R

{| f |≤1}|f|sdx are monotone increasing respectively decreasing functions of s we obtain Lp+LqLp+Lq for 0 < ppqq. For a given function f on R having the property that

f>Lpand f<Lq(0<pq) define

p =sup{p : f>Lp}, q=inf{q>0 : f<Lq}. Then, for finite p respectively q, the integralsR{| f |>1}|f|pdx and R

{| f |≤1}|f|qdx may be finite or not [1 (13.28)].

As a consequence of the theorem we obtain the following corol- lary:

Corollary. If p > q then fLs for all s ∈ ]q, p[. If pq then fLp+Lqfor all p<p and all q>q. If p<q then f /Lsfor all s>0.

The mentioned statements can be carried over to functions on a σ-finite, infinite non-atomic measure space. k

References

1 Hewitt, Edwin/Stromberg, Karl: Real and Abstract Analysis. Springer Verlag Berlin Heidelberg New York, 1965.

2 Stein, Elias M./Weiss, Guido: Introduc- tion to Fourier analysis on Euclidean spaces.

Princeton University Press, 1971.

Referenties

GERELATEERDE DOCUMENTEN

In other words, any arbitrary Fourier opti- cal filtering system acts on the input in a way that is equivalent to applying consecutive filters in frac- tional Fourier domains..

A buyer has a tougher job than just product selection A buyer has a tougher job than just product selection Gains are marginal, its hard work finding value!. Gains are marginal,

In this model recognizing in small firms is redefined, due new empirical insights, as: A firm’s capability to see new opportunities, search for new knowledge and estimate its

Of course, Di- richlet had proved in a series of papers written between 1837 and 1840 that there are infinitely many primes in any coprime arithmetic progression using analytic and

ERRATA: FOURIER ANALYSIS.

The Blocks Database is a collection of blocks representing known protein families that can be used to compare a protein or DNA sequence with documented families of proteins

Rediscovering the Islamic Classics: How Editors and Print Culture Transformed an Intellectual Tradition offers a timely and much needed intervention in the narra- tives of Nah ḍa

demonstrated the rhetorical use of genealogy and ‘tribe’ in the political life of the Gulf states. The themes alluded to by the mufti ‒ genealogy and kinship as ​ ​ criteria of