
TL;DR
This paper investigates norm equivalences between functions and their Hankel transforms within weighted Lebesgue and Lorentz spaces, extending Boas'-type results to real-valued monotone functions and also providing analogous Fourier transform results.
Contribution
It introduces new Boas'-type theorems for Hankel transforms involving real-valued monotone functions in weighted and Lorentz spaces, expanding existing Fourier analysis literature.
Findings
Established norm equivalences in weighted Lebesgue spaces
Extended Boas'-type results to Lorentz spaces
Provided analogous results for Fourier transforms
Abstract
Norm equivalences between a function and its Hankel transform are studied both in the context of weighted Lebesgue spaces with power weights, and in Lorentz spaces. Boas'-type results involving real-valued general monotone functions are obtained. Corresponding results for the Fourier transform are also given.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Boas’ problem on Hankel transforms
A. Debernardi111E-mail: [email protected]
Centre de Recerca Matemàtica, 08193, Bellaterra, Barcelona, Spain,
and Bar-Ilan University, 52900, Ramat-Gan, Israel
AMS 2010 Primary subject classification: 42A38, 26D15. Secondary: 26A48.
Keywords: Boas’ conjecture, Hankel transform, general monotonicity, weighted Lebesgue spaces, Lorentz spaces
Abstract
Norm equivalences between a function and its Hankel transform are studied both in the context of weighted Lebesgue spaces with power weights, and in Lorentz spaces. Boas’-type results involving real-valued general monotone functions are obtained. Corresponding results for the Fourier transform are also given.
††Acknowledgements: The author acknowledges the remarks of the anonymous referee that contributed to significantly improve the manuscript.††This research was partially funded by the CERCA Programme of the Generalitat de Catalunya, Centre de Recerca Matemàtica, the grant MTM2017–87409–P from the Spanish Ministerio de Economía, Industria y Competitividad, the ERC starting grant No. 713927, and the ISF grant No. 447/16.
1 Introduction
Given a -periodic function with Fourier series
[TABLE]
a classical problem is to study relations between the integrability of and the summability of its Fourier coefficients , . One of the most celebrated results in this direction is the Hardy-Littlewood theorem [20], which states that for there exist a constant such that
[TABLE]
This representation of norms of functions via the weighted norms of their Fourier coefficients is useful for applications in other problems (cf. [18, 30, 33] and the references therein). Thus, two interesting problems are to study what kind of weights may be incorporated in (1.1) and what generalizations of monotone sequences may be considered in such a way that relation (1.1) still holds. It is worth mentioning that such a relation with Lorentz norms instead of Lebesgue norms has also been object of study, although we omit such results for the sake of simplicity.
Extensions of the equivalence (1.1) have been given for more general weights in [34], and the monotonicity condition was replaced by general monotonicity in [12, 13, 40, 42], among several other works. It is worth to mention that a general monotone sequence need not be nonnegative (although it is a typical assumption in this kind of problem, in order to show the left-hand side inequality of (1.1)). Thus, one may wonder if (1.1) also holds when the nonnegativity assumption is replaced by a milder one. The answer is positive if we consider and to be real-valued and to satisfy the general monotonicity condition
[TABLE]
for all , where are absolute constants. More precisely, in [12], the authors proved that for real-valued sequences and satisfying (1.2), the equivalence
[TABLE]
holds, with the usual modification for . Here and in what follows the symbol is defined as follows: if , where is independent of essential quantities of and , we write . Likewise, will denote , and if and simultaneously, we write .
A converse equivalence for Lorentz norms was also obtained in [12], i.e.,
[TABLE]
where denotes the decreasing rearrangement of (defined below), and and are the decreasing rearrangements of and respectively, or in other words, the sequences and rearranged in decreasing order.
Before discussing the analogous inequalities to those presented above for Fourier transforms instead of Fourier series, let us introduce the basic notions we will use. All functions considered in this paper will be defined on an interval of (mostly on ) and Lebesgue measurable. Non-weight functions are also assumed to be locally integrable on their interval of definition.
For and a weight , the weighted Lebesgue space is defined as the set of all complex-valued measurable functions for which the functional
[TABLE]
is finite. A particular example of weighted Lebesgue space that plays a significant role in this paper is the space with and (where in the case we take the convention and in the case , we set ). Following Sagher [34], such a space will be denoted by , and obviously . We may also refer to Lebesgue spaces for functions defined on ; in this case the integration is obviously performed on , and if the corresponding functional is finite we write that .
We also define the Lorentz spaces , introduced in [27] (see also [2]). To this end, recall that for a function defined on an interval , the distribution function of (with respect to the Lebesgue measure) is
[TABLE]
where denotes the Lebesgue measure of a set . The decreasing rearrangement of is then defined as
[TABLE]
The Lorentz space , with , is the set of all complex-valued functions defined on for which the functional
[TABLE]
is finite. We will denote the corresponding Lorentz space of functions defined on as . It is well known that for any , , and for any , is a subspace of [19], or in other words, there exists a constant such that for every ,
[TABLE]
Note that if we restrict ourselves to considering only decreasing functions, the spaces and coincide. Another useful expression for the Lorentz norm is [19]
[TABLE]
As one may expect, the equivalence (1.1) has its analog in the case of Fourier transforms, whose one-dimensional version reads as
[TABLE]
for any even function nonincreasing on (cf. [41, Ch. IV]). What is more, Boas conjectured [3] that a similar relation to (1.4) with weights should be satisfied for sine and cosine transforms. More precisely, the conjecture is as follows. Let , where is either or . If is nonnegative and nonincreasing and , then
[TABLE]
An extended version of this conjecture was proved by Sagher in [34], where he also considered Lorentz spaces in place of the Lebesgue spaces . Recent developments on general monotone functions (whose definition is analogous to (1.2), cf. Section 3) gave rise to further generalizations of Boas’ conjecture, see [23, 39, 40]. In particular, Boas’ problem was studied for the one-dimensional Fourier transform [24] (see also [25]), the multidimensional Fourier transform of radial functions [16], and for Hankel transforms [8]. In these works the involved functions were assumed to be nonnegative.
A complex-valued function defined on and locally of bounded variation is said to be general monotone () [23] if there exist constants and (depending on ) such that
[TABLE]
Our main goal is to prove a version of Boas’ conjecture for Hankel transforms of general monotone functions with the assumption replaced by real-valued, from which all previous results, such as Hardy-Littlewood theorem, can be derived. We also give corresponding integrability theorems on Lorentz spaces. We emphasize that results in this direction were obtained very recently for Fourier series in the paper [12].
For , the Hankel transform of a function (see [41, Ch. VIII] and [38, Ch. IV]) is defined as
[TABLE]
where denotes the Bessel function of order (cf. Subsection 2.1). It is well known that Hankel transforms describe the Fourier transforms of radial functions defined on . More precisely, if and , its Fourier transform is also radial, and moreover
[TABLE]
see [38, Ch. IV, Theorem 3.3]. Furthermore, since the Fourier transform in one dimension can be written as a sum of two Hankel transforms (see Subsection 2.1 below), obtaining Boas-type results for Hankel transforms allows to derive the corresponding theorems for the Fourier transform.
In what follows we consider the Hankel transform of to be the pointwise limit
[TABLE]
Our main results read as follows.
Theorem 1.1**.**
Let be real-valued. For and , one has
[TABLE]
or in other words, if and only if .
Theorem 1.2**.**
Let be real-valued. For and , one has
[TABLE]
or in other words, if and only if .
Theorem 1.1 was proved for nonnegative and in [8] (see also [16] for the case of Fourier transforms of radial functions, and the earlier [24, 25] for the sine and cosine transforms).
It is worth mentioning that the inequality in Theorem 1.1 is a particular case of the well-known Pitt’s inequality (see, e.g., [1, 7, 17, 31, 32]). Such kind of inequalities are often studied excluding the cases .
With Theorem 1.1 in hand, we can easily derive the promised integrability results for the Fourier transform in one dimension, and also for Fourier transforms of radial functions in several dimensions. The corresponding Boas theorem for the Fourier transform in one dimension reads as follows (a version of this result was proved for nonnegative functions in [5]).
Corollary 1.3**.**
Let be a function defined on and such that the even and odd parts of ,
[TABLE]
are real-valued functions (when restricted to ). Then, for , , and ,
[TABLE]
In higher dimensions, identity (1.7) allows to characterize power weights for which Pitt’s inequality (on ) for radial functions holds.
Corollary 1.4**.**
Let be a real-valued radial function defined on , i.e., , and such that . Then
[TABLE]
if and only if and .
Finally, we also give a generalization of Hardy-Littlewood theorem for the Fourier transform of real-valued radial functions [41, Ch. IV], which immediately follows from Corollary 1.4 with the appropriate choice of and .
Corollary 1.5**.**
Let be a real-valued radial function defined on , and such that . Then
[TABLE]
if and only if , and
[TABLE]
if and only if .
The paper is structured in the following way. In Section 2 we introduce the preparatory material concerning Hankel transforms, which includes their definition in the distributional sense. Section 3 is devoted to the discussion of general monotone functions. In particular, we prove Theorem 3.3, which relates weighted norm inequalities between a general monotone function and its maximal averaging operator, a central tool to carry out this work. Section 4 is devoted to find sufficient conditions on a function so that its Hankel transform is well defined as an improper integral (where we also assume is general monotone), and as a distribution. Finally, in Section 5, we put everything together in order to prove our main results, namely Theorems 1.1 and 1.2. The mentioned results for the Fourier transforms (Corollaries 1.3 and 1.4) are also proved.
2 Preliminary concepts
2.1 Bessel functions
For , the Bessel function of order , , is defined as
[TABLE]
and the series converges absolutely and uniformly on every compact interval. Let us now mention some useful properties of , which can be found in [15], together with alternative definitions and several additional properties. First of all, we have the upper estimate
[TABLE]
or equivalently, . For , one has
[TABLE]
so that the cosine and sine transforms of are equal (up to a constant) to and , respectively.
For , let us denote by
[TABLE]
so that
[TABLE]
Such a function is well defined, since is continuous and vanishes as . For , it follows from (2.2) that satisfies (2.3).
It is shown in [10] (see also [8]) that
[TABLE]
This estimate is particularly useful when integrating by parts.
2.2 Distributional Hankel transforms
Under the assumption , the integral in (1.6) is absolutely and uniformly convergent on , and if , the inversion formula
[TABLE]
holds. Furthermore, if and are in , and and denote the direct and inverse Hankel transforms of order of and , respectively, Parseval’s formula
[TABLE]
holds.
However, such integrability conditions for the above theory to work are rather restrictive. We can define the Hankel transform of functions from wider spaces in the distributional sense, analogously as done for the Fourier transform [19], based on Parseval’s formula (2.6). We follow the theory of Zemanian. In [43], he constructed, for any , topological linear spaces of test functions defined on for which the Hankel transform is an automorphism. We now briefly present the basic elements of this theory that will be useful for our purpose. Before proceeding further, we refer to [22, 26, 29], where the reader may also find a distributional approach to the Fourier transform of radial functions.
Definition 2.1**.**
A complex-valued function belongs to if for any nonnegative integers ,
[TABLE]
where .
The space is linear over , and its topology is the one given by the seminorms (2.7). In [43], the author also proved the following.
Lemma 2.2**.**
Let . Then the Hankel transform is an isomorphism from onto itself.
For a fixed , the space in the theory of the Hankel transform (of order ) plays an analogous role as the Schwartz space in the theory of the Fourier transform. For a more exhaustive treatment of the spaces , see Section 2 of [43].
Let us denote . By we denote the space of smooth functions supported on , with the topology that makes its dual the space of Schwartz distributions on (cf. [36, Ch. III] for further details). Under these definitions, it turns out that
Lemma 2.3**.**
The space is a subspace of for any .
It should also be mentioned that the space is not dense in .
The analogue to the space of tempered Schwartz distributions is defined as follows. We denote by the dual space of , which is a linear space. By , we denote the complex number that assigns to .
The spaces are equipped with the weak topology generated by the seminorms
[TABLE]
Moreover, for any , there exist and such that for every ,
[TABLE]
which is proved in an analogous way as its counterpart for tempered distributions [44].
Let us now define the Hankel transform of a distribution . It is defined similarly as the Fourier transform of a tempered Schwartz distribution, that is, via Parseval’s theorem (2.6).
Definition 2.4**.**
The Hankel transform of order of , , is defined by the relation
[TABLE]
Relation (2.8) determines a functional on , and it can also be used to define the inverse transform .
Theorem 2.5**.**
Let . Then the Hankel transform is an isomorphism from onto itself.
The ordinary Hankel transform defined for functions is then a special case of the distributional Hankel transform (2.8).
We emphasize that all the results presented in this section can be found with more detail in Sections 2–5 of [43].
3 General monotone functions
The concept of general monotonicity (already defined in (1.5)) was first introduced by Tikhonov for sequences in [39, 40] (see also [23] for a comprehensive survey on functions and sequences). Note that without loss of generality, if , we may take a different constant with in place of . For convenience, we will use this property repeatedly.
We now list some properties of functions that will be useful later.
Lemma 3.1** ([23]).**
Let .
- (i)
The function is general monotone for any . 2. (ii)
For any and any , . 3. (iii)
For any and any , . 4. (iv)
Let . If , then as . If , then as .
Remark 3.2**.**
It is shown in [9] that if instead of , the function is real-valued and converges in the improper sense, then as .
The following result due to B. Booton [4] relates the Lorentz and weighted Lebesgue norms of functions. It was originally stated in more generality, but we present a simplified version that is enough for our purpose.
Theorem A**.**
Let . For and , or , one has
[TABLE]
Define, for ,
[TABLE]
where . We also denote
[TABLE]
Note that if , then M\Phi_{g}(t)=\displaystyle\sup_{x\geq t}\bigg{|}\frac{1}{x}\int_{0}^{x}g(u)\,du\bigg{|}. We now aim to prove a norm inequality for a weighted averaging operator applied to functions, which is the key result of our approach. The statement is as follows.
Theorem 3.3**.**
Let . Let be real valued, vanishing at infinity, and such that as for some . Define , assume is supported on the interval , and that for . Let be a weight satisfying for all and . Then
[TABLE]
In order to prove Theorem 3.3 we need some auxiliary results. From now on, we assume without loss of generality that the constant (see (1.5)) equals for some . Let us define, for any function and any ,
[TABLE]
Given , for , we say that is a good number if . The rest of integer numbers consists of bad numbers. Recall that the constant comes from the condition. The parameter will be arbitrarily chosen at each point according to our convenience. In contrast with [9, 14], here we consider a slightly different definition of good numbers by incorporating the parameter (in the cited papers is fixed). The reason to do this is that every power function (which is a function for any ) will have an infinite amount of good numbers if is chosen appropriately according to . We give two examples illustrating this fact. On the one hand, if , since
[TABLE]
then , and all natural numbers (associated to ) are good (with ). On the other hand, if , since
[TABLE]
then , thus all natural numbers are good if , and bad if .
Lemma 3.4**.**
Let be a function. For any good number , there holds
[TABLE]
where and are the constants from the condition.
Proof.
The proof just consists on rewriting that of [9] in the context of functions, with the difference that in the mentioned work the parameter is fixed (see also [14], where this idea was originally carried out for sequences). Assume (3.3) does not hold for . Let us define . Then, since is good,
[TABLE]
The condition implies that for any ,
[TABLE]
which contradicts our assumption. ∎
Note that in particular, Lemma 3.4 implies that if is a good number, then . Before stating the next lemma, let us introduce the following notation:
[TABLE]
Lemma 3.5**.**
Let be a real-valued function. For any good number there is an interval such that at least one of the following holds:**
for any , there holds and
[TABLE] 2. 2.
for any , there holds and
[TABLE]
where and are the constants from the condition and is the parameter from the definition of good numbers.
Proof.
On the first place, by Lemma 3.4, either or . We assume the former, and prove that item 1. holds.
Let us construct a system of disjoint intervals in \big{[}2^{n-\nu},2^{n+\nu}+\varepsilon 2^{n}\big{]} (where will be conveniently chosen later) as follows: Let , and
[TABLE]
If such does not exist, then we simply let and the conclusion follows with . Contrarily, we define
[TABLE]
Once we have the first interval , if , we let , and define similarly as above, thus obtaining a new interval . We continue this process until our collection of intervals is such that
[TABLE]
By construction, for any , we can find such that , and such that . Thus,
[TABLE]
Hence,
[TABLE]
On the other hand, the property and the fact that is good imply that
[TABLE]
We can deduce from the above estimates that
[TABLE]
By the pigeonhole principle (or Dirichlet’s box principle), there is an integer such that
[TABLE]
Given this , we set and , and the result follows. ∎
Concerning bad numbers, we have the following result.
Lemma 3.6**.**
Let be vanishing at infinity and such that as for some . Then, for every bad number there exists either a finite sequence
[TABLE]
or
[TABLE]
such that are bad, is good, and the inequalities
[TABLE]
hold for every . In particular, there are infinitely many good numbers associated to .
Proof.
Let be a bad number. Then , and we can find satisfying and . Let
[TABLE]
We now have two possibilities, either , or . Assume first . Then either is a good number, or there exists satisfying for which . Note that in this case , otherwise we arrive at a contradiction. Set
[TABLE]
Continuing this procedure, we can prove that we eventually find a good number , so that the sequence
[TABLE]
is such that are bad numbers, and for . Indeed, if we could not find such a , then there would exist an infinite sequence of bad numbers
[TABLE]
so that and
[TABLE]
for all . Now, note that
[TABLE]
Combining this with (3.6), we obtain, since ,
[TABLE]
Letting , we find that as , which contradicts our hypotheses. This concludes the part of the proof corresponding to the case . Let us now assume . Then either is good, or there exists such that , and (the case is not possible, as it leads to a contradiction). We now define
[TABLE]
and similarly as above, we can continue this procedure and obtain a finite sequence
[TABLE]
where the numbers are bad, is good, and moreover,
[TABLE]
for all . If we could not find the finite sequence from (3.7), then there would exist an infinite sequence of bad numbers
[TABLE]
and we would obtain
[TABLE]
thus contradicting the hypothesis that vanishes at infinity. ∎
Note that in the proof Lemma 3.6, for any bad number , the number obtained in (3.4) or (3.5) is uniquely determined. The natural number will be called the length of the bad number . We also define the sets
[TABLE]
and note that for every and . Moreover, if we denote by the set of good numbers, one has
[TABLE]
where all the unions are disjoint.
Remark 3.7**.**
For any good number and any , each of the sets , , contain at most bad numbers of length . Let us discuss the case (the case is analogous). Indeed, if is a bad number such that the construction (3.6) yields , then necessarily , so that there are at most bad numbers of length in . If is a bad number such that the construction (3.6) yields , we should count all possible choices of satisfying
[TABLE]
We know that there are at most possible choices of , and that , so that there are at most possible choices satisfying (3.8). Continuing the argument inductively proves our claim.
We are now in a position to prove Theorem 3.3.
Proof of Theorem 3.3.
We first prove that for any good number , the inequality holds. Indeed, let be the interval obtained from Lemma 3.5. Then
[TABLE]
By Lemma 3.5, we have
[TABLE]
and thus, by the choice of , we obtain
[TABLE]
valid for any good number . Let us now consider two subcases, namely and . Let denote the set of good numbers associated to and . Then, for the case ,
[TABLE]
On the one hand, by (3.9)
[TABLE]
where the last inequality follows from the fact that is nonincreasing. On the other hand, in order to estimate , let us first observe that there exists such that for every ,
[TABLE]
Now, for any bad number of length , it follows from the inequalities and (cf. Lemma 3.6) that
[TABLE]
and similarly, for any bad number , it follows from the inequalities and that
[TABLE]
From now on, we now assume without loss of generality that . By Remark 3.7
[TABLE]
which concludes the proof of the case . For the case , the proof is similar. First of all, note that
[TABLE]
Further, for any bad number of length , it follows from the inequalities and that
[TABLE]
Finally, if has length , it follows from the inequalities and that
[TABLE]
Joining the above estimates we get . ∎
4 Well-definiteness of in function spaces
In this section we show that the Hankel transform is well defined both as the pointwise limit (1.8) (provided that is ) and also as an element of , whenever is from a suitable function space. Both facts put together imply that the inversion formula (2.5) holds almost everywhere for general monotone functions from such a space, in virtue of Theorem 2.5.
4.1 Pointwise convergence of
The goal is to show that the limit (1.8) exists for all whenever is from certain function spaces; in other words, is well defined as an improper integral.
Lemma 4.1**.**
Let and .
If with , or 2. 2.
if with ,
then the limit
[TABLE]
exists for all .
Proof.
We show that for with as in the hypotheses and given ,
[TABLE]
The result for will follow just by Theorem A. Since for all , by Hölder’s inequality, if ,
[TABLE]
for any . If , we have
[TABLE]
and if ,
[TABLE]
with all the estimates valid for any .
Integrating by parts and using (2.4), we get
[TABLE]
By Lemma 3.1, for , as , and so does (in the case , trivially vanishes at infinity). Therefore,
[TABLE]
and by Hölder’s inequality, for ,
[TABLE]
For , it is clear that
[TABLE]
and finally, for ,
[TABLE]
4.2 Weighted Lebesgue spaces
We first give sufficient conditions on the weight so that whenever .
Proposition 4.2**.**
Let , where and is a weight function satisfying
- (i)
* for some , if ;* 2. (ii)
* for some , if ;* 3. (iii)
* for some , if .*
Then the functional
[TABLE]
is continuous.
Proof.
Let . By Hölder’s inequality, we have
[TABLE]
In order to estimate the weighted norm of , we first obtain pointwise estimates for such a function. On the first place, for one has . Indeed, since for and for , we have
[TABLE]
Secondly, for and any there holds . Indeed, integration by parts together with (2.4) yield
[TABLE]
Assume first that . Then
[TABLE]
Note that the suprema involving and need not be functionals from the collection of seminorms (2.7), but they can be trivially estimated from above by linear combinations of those.
For the case , similar calculations yield . Finally, if ,
[TABLE]
which completes the proof. ∎
Proposition 4.2 allows to easily derive sufficient conditions on the parameters , so that induces a continuous operator .
Corollary 4.3**.**
Let and . Let . Then, , provided that
- (i)
, if ; 2. (ii)
, if .
Proof.
It is a direct consequence of Proposition 4.2 with different choices of : for , we use , for we use , and finally, for we use . ∎
4.3 Lorentz spaces
We now show that if is a function from a certain Lorentz space it also induces continuous operator . First, let us introduce the following notation. For , we say that an integral operator is of type if is bounded. Here we need Calderón’s rearrangement inequality [6] (see also [21]).
Theorem 4.4**.**
Let be a sublinear operator of types and , for some . Then
[TABLE]
Remark 4.5**.**
The Hankel transform (1.6) is of types and for every , see [7, 28].
Proposition 4.6**.**
Let , with and . Then the functional defined by (4.1) is continuous.
Proof.
Let . By Hölder’s inequality on Lorentz spaces (cf. [2, Ch. IV, Theorem 4.7]) and the fact that for any (see [19, Ch. I]), we have
[TABLE]
We now estimate from above by a finite linear combination of seminorms of on , which will yield . We have, by Theorem 4.4 (see also Remark 4.5),
[TABLE]
On the one hand, since is decreasing, , and (see [2, 19]),
[TABLE]
On the other hand, similarly as before,
[TABLE]
Combining all estimates, we get
[TABLE]
which yields the desired result. ∎
5 Boas’ conjecture
The goal of this section is to prove Theorems 1.1 and 1.2. The approaches we follow are similar to those considered in [34] and [5], respectively. It is worth emphasizing, as mentioned at the beginning of Section 4, that the inversion formula (2.5) holds for functions from the weighted Lebesgue space with and (and thus, also for those from the Lorentz space with and , by Theorem A).
5.1 Weighted Lebesgue norm inequalities
First of all, we prove a Pitt-type inequality for the Hankel transform of functions that includes the cases (for the case this was proved in [8, 11]).
Theorem 5.1**.**
Let , , and . If , then and
[TABLE]
In order to prove Theorem 5.1 we will need Hardy’s inequalities [45, p. 20].
Theorem B**.**
Let and . Then, for every measurable ,
[TABLE]
and
[TABLE]
where the involved constants do not depend on .
Proof of Theorem 5.1.
We proceed similarly as in Theorem 4 of [5], where an analogous result was proved for sine and cosine transforms. First of all, it follows by Lemma 4.1 that is well defined as an improper integral. We now apply the estimate (2.1) to obtain, for any ,
[TABLE]
Integration by parts, the estimate (2.4), and the fact that vanishes at infinity (which follows from and , by Lemma 3.1) imply that
[TABLE]
where in the last inequality we used the estimate , which is valid since vanishes at infinity. Thus, we deduce by (iii) of Lemma 3.1,
[TABLE]
Note that since , , and , the right-hand side is finite, by Hölder’s inequality. Hence, by letting we obtain
[TABLE]
where in the last inequality we applied the change of variables . On the one hand, since , Hardy’s inequality yields
[TABLE]
whilst on the other hand, again by Hardy’s inequality,
[TABLE]
The case is similar and is omitted (in fact, this complementary case is dealt with in full detail in the case of Lorentz spaces, in Theorem 5.5 below; note that Hardy’s inequalities are not needed in this case). ∎
Lemma 5.2**.**
Let , with
- (i)
* and , or* 2. (ii)
* and .*
Then the inequality
[TABLE]
holds for any .
Remark 5.3**.**
Given , the operator was defined in (3.1) for a given function . However, if and is a function for which , abusing of notation we may write
[TABLE]
as done in (5.1), taking into account the definition of (2.8). This notation is adopted in what follows.
Proof of Lemma 5.2.
The proof is carried out exactly in the same lines as [34, Theorem 3.1]. Indeed, Hölder’s inequality implies
[TABLE]
so that the operator maps into . Fixing and interpolating between different values of , the interpolation theorem with change of measures by Stein and Weiss (cf. [37]) yields
[TABLE]
as desired. ∎
Finally, we are in a position to prove our main result concerning weighted Lebesgue spaces.
Proof of Theorem 1.1.
It follows from Theorem 5.1 that
[TABLE]
By Lemma 5.2 (with in place of ), we get
[TABLE]
for any . Finally, Theorem 3.3 together with the appropriate choice of yields
[TABLE]
with all the estimates valid for the ranges and . The hypothesis as needed to apply Theorem 3.3 follows from the fact that and Lemma 3.1. ∎
Remark 5.4**.**
Note that in Theorem 3.3, rather than choosing , we allow to be supported on , so that it is also valid for some choice of , which is needed to prove Theorem 1.1.
5.2 Lorentz norm inequalities
In order to prove Theorem 1.2, we need to establish some auxiliary estimates on Lorentz norms.
Theorem 5.5**.**
Let , and assume that with and . Then , and moreover
[TABLE]
Proof.
First of all, we apply the estimate (2.1) to obtain, for any ,
[TABLE]
Integration by parts, the estimate (2.4), and the fact that vanishes at infinity (which follows from (cf. Theorem A) and Lemma 3.1) imply that
[TABLE]
and thus we deduce
[TABLE]
where the right-hand side is finite, since and . From this point, the proof for the case is exactly the same as the one of [5, Theorem 4] (and similar to that of Theorem 5.1) and is therefore omitted. We give a detailed proof for the case . Since for , we have
[TABLE]
i.e., . ∎
We now prove a relation between the norm of from a certain Lorentz space and the corresponding norm of in the corresponding space (cf. (3.1) and (3.2)), given . This is an extension of the result by Y. Sagher for the Fourier transform given in [34] and is proved in the same way.
Lemma 5.6**.**
Let and . If , then
[TABLE]
Proof.
Let . Since , we have, by Hölder’s inequality,
[TABLE]
Hence, . In other words, the sublinear operator defined by is bounded from to . Interpolating, we obtain the boundedness of the operator from to for any (see [35, Theorem 26]), i.e., (5.2) holds. ∎
Corollary 5.7**.**
Let and . If and is a function, then .
Proof.
By Lemma 5.6 and Theorem 3.3, we get
[TABLE]
Finally, Theorem A yields the desired result. ∎
We are now in a position to prove Theorem 1.2.
Proof of Theorem 1.2.
First of all, combining Theorem 5.5 and Lemma 5.6 we obtain
[TABLE]
for . Now, Theorem 3.3 together with the appropriate choice of yields . Finally, Theorem A completes the proof. ∎
Putting together Theorems 1.1, 1.2, and A, we can derive the following equivalence.
Corollary 5.8**.**
Let be real-valued and let . Then, for any ,
[TABLE]
5.3 Boas’ conjecture for the Fourier transform
5.3.1 One-dimensional Fourier transforms
Let be a function defined on . We denote
[TABLE]
the even and odd part of , respectively, so that . Theorems 1.1 and 1.2 together with (2.2) and the well-known representation of the Fourier transform allow us to easily derive the solution to the Boas’ conjecture for the Fourier transform, in the case of real-valued functions. For the sake of completeness, we first prove a preliminary lemma.
Lemma 5.9**.**
Let . Let be an even weight and . Then if and only if .
Proof.
The “if” part is trivial. For the “only if” part, we have, in the case ,
[TABLE]
where we used the inequality . This shows that and therefore also . For the case , triangle inequality yields
[TABLE]
and the result follows similarly as before. ∎
Lemma 5.10**.**
Let and . Then if and only if .
Proof.
Again, the “if” part is trivial. For the “only if” part, note that
[TABLE]
Since
[TABLE]
or in other words, , it follows that by (1.3), and also . ∎
We are in a position to prove Corollary 1.3, dealing with one-dimensional Fourier transforms.
Proof of Corollary 1.3.
The result readily follows from the representation , together with Corollary 5.8 and Lemmas 5.9 and 5.10. ∎
The interval for in Corollary 1.3 cannot be extended even for weighted Lebesgue spaces as done in Theorem 1.1, where , because the even part of corresponds to the cosine transform, i.e., the Hankel transform of order , and the optimal interval for the cosine transform is , according to Theorem 1.1.
Proof of Corollary 1.4.
The result follows by using the relation (1.7), and by Theorem 1.1 with , and . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. J. Benedetto and H. P. Heinig, Weighted Fourier Inequalities: New Proofs and Generalizations , J. Fourier Anal. Appl. 9 (2003), 1–37.
- 2[2] C. Bennett and R. Sharpley, Interpolation of Operators , Academic Press, Inc., Boston, 1988.
- 3[3] R. P. Boas Jr., The integrability class of the sine transform of a monotonic function , Studia Math. 44 (1972), 365–369.
- 4[4] B. Booton, General monotone functions and their Fourier coefficients , J. Math. Anal. Appl. 426 (2) (2015), 805–823.
- 5[5] B. Booton, Rearrangements of general monotone functions and of their Fourier transforms , Math. Inequal. Appl. 21 (3) (2018), 871–883.
- 6[6] A. P. Calderón, Spaces between L 1 superscript 𝐿 1 L^{1} and L ∞ superscript 𝐿 L^{\infty} and the theorem of Marcinkiewicz , Studia Math. 26 (1966), 273–299.
- 7[7] L. De Carli, On the L p superscript 𝐿 𝑝 L^{p} - L q superscript 𝐿 𝑞 L^{q} norm of the Hankel transform and related operators , J. Math. Anal. Appl. 348 (2008), 366–382.
- 8[8] L. De Carli, D. Gorbachev and S. Tikhonov, Pitt and Boas inequalities for Fourier and Hankel transforms , J. Math. Anal. Appl. 408 (2) (2013), 762–774.
