Kakeya Inequalities by Maximal Functions in Hardy Spaces
Abstract
In this paper, we will introduce and study several types of Kakeya inequalities by the maximal functions in Hardy spaces in ℝn, (n ≥ 2), and we could obtain several inequalities associated with the Kakeya inequalities. We will show that , when f(x) ∈ Lp(ℝn) and .
1. Introduction
1.1. Main Result
We will obtain several inequalities in Proposition 6, Theorem 7, and Theorem 8. In Proposition 6, though the coefficient in Formula (71) is not better than the factor δ−(n − 1)/p−ε in Formula (6), we use a way different to [3, 4] and [5]. And we could obtain Formula (70) which is different to the classical case δ = 1. In Theorem 7, the coefficient is the same as the factor δ−ε in Formula (4) when . In Theorem 8, the coefficient is independent on δ when .
1.2. Notations
As usual, we use n to denote the dimension of ℝn. suppf(x) is the support set of f(x). If x ∈ ℝn: x = (x1, x2, ⋯, xn), |x|e denotes For α ∈ ℕn: α = (α1, α2, ⋯, αn), |α| denotes |α| = α1 + α2 + ⋯+αn. We use ‖.‖p to denote and O(ℝn) to denote the n × n unit orthogonal matrix in ℝn: O(ℝn) = {A : ATA = 1.AT is the transposed matrix of A}.S(ℝn) designates the space of C∞ functions on ℝn rapidly decreasing together with their derivatives. Sα,β(ℝn) denotes and ε a positive fixed number (may be very small): ε > 0.
If X and Y are two quantities, X≲Y or Y ≳ X denotes that X ≤ CY for some absolute constant C > 0. More generally, given some parameters a1, ⋯, ak, we use or to denote the statement that for some constant which can depend on the parameter a1, ⋯, ak. We use X ~ Y to denote the statement X≲Y≲X, and similarly, denotes .
2. Preliminaries
Let f to be a distribution, and Hardy spaces Hp(ℝn) are (c.f. [9]): , for 0 < p < ∞ with appropriate α and β depending on p. It is known that Hp = Lp for p > 1:
Lemma 1 (see [9].)For any ψ ∈ S(ℝn), 1 < p < ∞, f ∈ Lp(ℝn), and N > n/p, we could obtain
Lemma 2 (see[10]). Let 0 < C0 < ∞ and 0 < r < ∞. Then, there exist constants C1 and C2 (that depend only on n, C0, and r) such that for all t > 0 and for all C1(ℝn) functions u on ℝn whose Fourier transform is supported in the ball |ξ|e ≤ C0t and that satisfies for some B > 0, we have the estimation
Lemma 3 (Phragmen-Lindelöf Lemma). Let F be analytic in the open strip S = {z ∈ ℂ : 0 < Rez < 1}, continuous, and bounded on its closure, such that |F(z)| ≤ C0 when Rez = 0 and |F(z)| ≤ C1 when Rez = 1. Then, when Rez = θ for any 0 < θ < 1.
3. The Case when 2 ≤ δ−ε
When 1 ≤ δ−ε ≤ 2, the case that δ~ε1 is trival for the Kakeya type inequalities; thus, we only want to discuss the case when 0 < δ ≪ 1. In the following of this paper, we will discuss under the assumption that 2 ≤ δ−ε.
3.1. Decomposition of the Phase Space
where 2s ~ δ−4ε.
3.2. Two Lemmas
In this section, we will estimate the integrals (in Lemmas 4 and 5) associated with and given in Formulas (32) and (33).
Lemma 4. For N ≥ 0, N ∈ ℝ, k ∈ ℕ, k ≥ 2, and Y ∈ Sα,β(ℝn) with appropriate α, β depending on ε, n, N, we have
Proof. First, we will prove that for l ∈ ℝ, l ≥ 0, k ∈ ℕ, and k ≥ 2, the following inequality holds:
Notice that the following inequality holds for 0 < δ < 1, for any m ∈ ℤ, m ≥ 0:
Thus, by the formula of integration by parts, we could deduce the following for any m ∈ ℤ, m ≥ 0:
Make a variable substitution:
We could write Formula (37) as
Thus, , and
When , k ≥ 2, and δ−ε ≥ 2, we could deduce that
That is,
Then, we could deduce that
Thus, similar to Formula (44), we could obtain
By Lemma 3 and Formula (45), for l ∈ ℝ, l ≥ 0, k ∈ ℕ, and k ≥ 2, the following inequality holds:
Then, we could obtain the following inequality for N ≥ 0, N ∈ ℝ, k ∈ ℕ, and k ≥ 2,
By Formulas (46) and (48), we could deduce that for N ≥ 0, N ∈ ℝ, k ∈ ℕ, and k ≥ 2, the following Formulas (49) and (50) hold:
Then, we could obtain the Lemma 4 directly from Formulas (49) and (50). This proves the Lemma.
Lemma 5. For N ≥ 0, N ∈ ℝ, k ∈ ℕ, and 0 ≤ k ≤ s where 2s ~ δ−4ε, Y ∈ Sα,β(ℝn), with appropriate α, β depending on ε, n, N, the following two inequalities hold:
Proof. Notice that 2s ~ δ−4ε, thus, for any k ∈ {0, 1, ⋯, s} and N ≥ 0, N ∈ ℝ, we have
Notice that 2−(k + 1)δ|ξ|e ≤ 1 holds, when . Thus, we could obtain
Then, we could write as
It is clear that the following Formulas (56)–(60) hold:
By Young inequality, we could have
By the formula of integration by parts, we could deduce the following for any m ∈ ℕ:
By Young Inequality, Formulas (62) and (56)–(60), we could obtain
By Lemma 3 and Formulas (61) and (63), we could deduce the following Formula (64).
By Formulas (61) and (64), the following two inequalities hold for N ≥ 0, k ∈ {0, 1, ⋯, s}:
From Formulas (53), (65), and (66), we could obtain the Formula (51) and (52) together. This proves the Lemma.
3.3. Main Results
From Formulas (67)–(69), we will obtain our main results in this section:
Proposition 6. For p > 1 with appropriate α, β depending on ε, n, p, we have
Proof. Notice that f ∈ Lp(ℝn) is a distribution. By Formula (33), we could obtain
Similar to Formula (72), we could also obtain
Notice that 2s ~ δ−4ε; thus, Lemma 1 and Formulas (67), (68), and (74) yield to
Let N be N = (n/p) + ε. From Formulas (73) and (75), we could prove the Proposition 6.
Theorem 7. For ∞>p > r > 1, 0 < t ≤ δ−ε, f(x) ∈ Lp(ℝn), and . Then, with appropriate α, β depending on ε, n, r, we could obtain
Proof. By Formula (33), we could write as
where 2s ~ δ−4ε.
By Holder inequality, and are both bounded functions for any x ∈ ℝ, δ > 0, k ∈ ℕ, and t > 0. Thus, for some B > 0, we could have
It is also clear that , and . We could also deduce that . Thus, by Lemma 2, we could obtain
Notice that 2s ~ δ−4ε, by Formulas (67), (69), (77), (79), and (80), we could deduce that for ∞>p > r > 1, 0 < t ≤ 1
When 1 < t ≤ δ−ε, notice that
hold. From Formulas (67), (69), (77), (79), (80), (82), and (83), we could deduce that for ∞>p > r > 1, 1 < t ≤ δ−ε
This proves the Theorem.
Theorem 8. For ∞>p > 1, 0 < t ≤ δ−ε, f(x) ∈ Lp(ℝn), and , then with appropriate α, β depending on ε, n, p, we could obtain
Conflicts of Interest
The author declares that there are no conflicts of interest.
Open Research
Data Availability
There is no data in my paper; thus, the date is available.