Next Article in Journal
Local Existence and Regularity of Mild Solutions for Hadamard Fractional Semilinear Integro-Differential Equations with Compact Semigroups
Previous Article in Journal
Formulation of Fuzzy Implication Modeling Theory
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Explicit 2 Decoupling in Rn, Part I: Bounds for Constants in an Alternate Formulation

School of Mathematics, North University of China, Taiyuan 030051, China
*
Author to whom correspondence should be addressed.
Axioms 2026, 15(5), 349; https://doi.org/10.3390/axioms15050349
Submission received: 6 April 2026 / Revised: 1 May 2026 / Accepted: 5 May 2026 / Published: 8 May 2026

Abstract

Z.K. Li established the first explicit decoupling estimate for the parabola in the range 4 < p < 6 . Such explicit bounds are essential in number theory applications. Following the approach of J. Bourgain and C. Demeter, we derive an explicit bound for the implicit constant in an alternate form of decoupling in J. Bourgain and C. Demeter’s work. This is the first part of our three-part project to extend Z.K. Li’s result on the explicit bound for the decoupling constant to the n-dimensional case.

1. Introduction

The 2 decoupling theorem for the paraboloid, established by J. Bourgain and C. Demeter [1], has found numerous applications in harmonic analysis, number theory, and PDE, cf. [2,3,4,5,6,7,8,9,10]. In particular, the explicit ϵ -dependence of the decoupling constant is crucial for extracting numerically sharp bounds in Vinogradov-type problems. Z.K. Li obtained the first such explicit bound in the two-dimensional case, covering the range 4 < p < 6 for the parabola, cf. [11]. L. Guth, D. Maldague, and H. Wang obtained a better result in the 2-dimensional case when p = 6 in [12]. Extending Z.K. Li’s result to the n-dimensional paraboloid is a natural next step and is essential for advancing the corresponding moment curve decoupling theory.
We aim to follow the approach of J. Bourgain and C. Demeter in [13] to get an explicit expression of the decoupling constant in the n-dimensional case, clarifying its dependence on ϵ . This paper is the first part of our three-part project for this purpose, and presents the explicit bound of an implicit constant in an alternate decoupling form. In the forthcoming part II (about 30 pp.), estimates about the implicit constant in the multilinear-to-linear decoupling recursion theorem will be presented. The final goal will be addressed in the planned Part III. In the present paper (Part I), we establish only an intermediate explicit estimate for the constant in an alternate decoupling formulation, not the full explicit n-dimensional decoupling theorem.

1.1. Preliminaries

First we introduce key notations, definitions and fundamental results of the 2 decoupling theorem that will be used in the sequel.
Let P n 1 be the truncated elliptic paraboloid in R n , i.e., let
P n 1 : = ( ξ 1 , , ξ n 1 , ξ 1 2 + + ξ n 1 2 ) | 0 ξ i 1 .
Let N be the set of natural numbers. For each r R 0 , set r N = r m | m N . Let Q [ 0 , 1 ] n 1 be a cube with side length l ( Q ) 2 N . Given α 2 N ( 0 , l ( Q ) ) , we denote by Part α ( Q ) the unique partition of Q by using cubes Q α with side length l ( Q α ) = α . For δ < 1 and Q 0 , 1 n 1 , we define the δ -neighborhood N δ ( Q ) of P n 1 above Q as
N δ ( Q ) = ξ 1 , , ξ n 1 , ξ 1 2 + + ξ n 1 2 + t | ξ i Q , 0 t δ .
For each f L 1 ( R n ) and each measurable set S R n , we write
f S ( x ) = S f ^ ( ξ ) e ( x · ξ ) d ξ
for the Fourier restriction of f on S, where e ( z ) = e 2 π i z . A positive weight ω ( x ) is a function in R n satisfying
ω ( x ) 0 and R n ω ( x ) d x < + .
For a positive weight v : R n [ 0 , ) and f : R n C satisfying f v 1 p L p , set the weighted integral
f L p ( v ) = R n | f ( x ) | p v ( x ) d x 1 p .
For a cube B R n , we shall use the shorthand notation
f L p B = f L p χ B = B | f | p 1 p .
We write B R for a cube whose side length is R. A cube B R R n centered at c is denoted by B c , R . Let
ω B c , R ( x ) = 1 + | x c | R 100 n ,
and for E 100 n , set
ω B c , R , E ( x ) = 1 + | x c | R E .
For any cube Q [ 0 , 1 ] n 1 and g L 1 ( Q ) , set
E Q g ( x ) = Q g ( ξ 1 , , ξ n 1 ) e ξ 1 x 1 + + ξ n 1 x n 1 + ξ 1 2 + + ξ n 1 2 x n d ξ ,
where ξ = ξ 1 , , ξ n 1 and x = x 1 , , x n . We shall use the shorthand notation
E g = E [ 0 , 1 ] n 1 g .
For 2 p and δ 4 N , let Dec n ( δ , p , E ) be the optimal constant such that the inequality
E g L p ( ω B δ 1 , E ) Dec n ( δ , p , E ) Q Part δ 1 / 2 [ 0 , 1 ] n 1 E Q g L p ω B δ 1 , E 2 1 2 , g : [ 0 , 1 ] n 1 C
holds for all cubes B δ 1 , and Dec n ( δ , p ) be the optimal constant such that the inequality
E g L p ( ω B δ 1 ) Dec n ( δ , p ) Q Part δ 1 / 2 [ 0 , 1 ] n 1 E Q g L p ω B δ 1 2 1 2 , g : [ 0 , 1 ] n 1 C
holds for all cubes B δ 1 .
For a cube B R n and a function f : R n C satisfying f L p ( B ) , we set
f L p B = 1 | B | B | f | p 1 p ,
where | B | is the Lebesgue measure of B. We denote by I R the interval [ R / 2 , R / 2 ] . As in [14], we denote by σ S n 1 the surface measure of the unit sphere in R n . A tiling is a collection of subsets (the tiles) of R n such that the union of all tiles is exactly R n , and that the interiors of any two distinct tiles are disjoint. For a set A, we denote by card ( A ) the cardinality of A. Let [ n ] = Z [ 1 , n ] , where Z is the set of integers. We denote by supp f the support of a function f. Regarding basic properties of the Fourier transform, we refer to [15,16].
In 2016, J. Bourgain proved the following 2 decoupling theorem in [1].
Theorem 1. 
When 2 p 2 ( n + 1 ) n 1 , we have
Dec n ( δ , p ) C δ ϵ ,
where the implicit constant C depends on ϵ, p, and n, but is independent of δ.
Theorem 5.1 in [13] states that there exists a sufficiently large constant Γ n ( E ) such that for all F Γ n ( E ) , p 2 , f : R n C with Fourier transform supported in N 1 / R ( [ 0 , 1 ] n 1 ) , and cube B R , there exists a constant C depending on n and E such that
f L p ω B R , E C · Dec n R 1 , p , F Q Part R 1 / 2 [ 0 , 1 ] n 1 f N 1 R ( Q ) L p ω B R , E 2 1 / 2 .

1.2. Main Results and a Roadmap

Denote by S ( R n ) the Schwartz space on R n . Let η S ( R ) be a Schwartz function satisfying
η ( x ) = 1 , x [ n , n ]     and     supp η [ ( n + 1 ) , n + 1 ] .
Let M j S ( R ) be a Schwartz function with a compact support satisfying
M j ( t ) = t j , t [ 0 , 1 2 ]     and     d k d t k M j L ( R ) C ˜ k ,
where C ˜ k is a constant depending on k but independent of j. For any s N , set
ρ ( s ) = sup | x l η ( m ) ( x ) | | l , m [ 0 , s ] N ,
where η ( x ) is defined as in (1).
Our main result derives an explicit lower bound for Γ n ( E ) and an explicit upper bound for C as follows.
Theorem 2. 
Let p 2 , R 1 4 N , and f : R n C be a function satisfying supp f ^ N 1 / R ( [ 0 , 1 ] n 1 ) . Consider η ( x ) S ( R ) as (1), M j ( t ) S ( R ) as (2), and ρ ( s j ) as satisfying (3). Then for any E 100 n , F 2 ( n 1 ) E + ( n 1 ) ( p 1 ) + 2 , and each cube B R R n , we have
f L p ω B R , E C 0 Dec n R 1 , p , F · Q Part R 1 / 2 [ 0 , 1 ] n 1 f N 1 R ( Q ) L p ω B R , E 2 1 / 2 ,
where C 0 = max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E p ( 9 n ) F p ( 30 n ) E .
To clarify the meaning and motivation of the constants in the above alternate formulation, we provide a theorem on recursion that we have obtained in our ongoing Part II as follows.
Theorem 3. 
Assume that Dec 2 δ , p , Γ 2 ( 10 E ) D ϵ · δ ϵ . Let K 11 satisfy K N + . For any m 1 and R K 2 m with R K N + , if ϵ 3 , then
E g L p ω B R , E ( 6 3 ) E · 3 362 · A + C 0 · D ϵ · 10 10 E · ( 6 3 ) 10 E p · ( α Part K 1 [ 0 , 1 ] 2 E α g L p ( ω B R , E ) 2 ) 1 2 + ( 6 3 ) E · 3 · C 0 · D ϵ · 10 10 E · ( 6 3 ) 10 E p · K ϵ · ( β Part 1 k [ 0 , 1 ] 2 E β g L p ( ω B R , E ) 2 ) 1 2 + ( 6 3 ) E · 3 · A + C 0 · Dec 3 ( R 1 , p , K 2 , m , E ) · 10 10 E · K 16 · ( Δ Part 1 R [ 0 , 1 ] 2 E Δ g L p ( ω B R , E ) 2 ) 1 2 .
Note that the constant C 0 in the above theorem is exactly the same as the constant in Theorem 2, and it is the crucial step in the multilinear-to-linear decoupling recursion.
Our paper is organized as follows: Section 2 collects several auxiliary lemmas concerning weight functions, convolution estimates, and derivative bounds that will be needed in the proof of the main result. Section 3 presents the proof of Theorem 2 through a five-step argument, ultimately leading to the explicit constant C 0 . A brief discussion of the result is given in Section 4.

2. Auxiliary Lemmas

Lemma 1. 
Let W be the set of all positive weights in R n . Fix R > 0 and E. Let O 1 , O 2 : W [ 0 , ] be maps satisfying the following properties:
(W1) 
there exists C R + , such that O 1 χ B C · O 2 ω B , E , B = B ( c , R ) R n ;
(W2) 
O 1 ( α u + β v ) α O 1 ( u ) + β O 1 ( v ) , u , v W , α , β > 0 ;
(W3) 
O 2 ( α u + β v ) α O 2 ( u ) + β O 2 ( v ) , u , v W , α , β > 0 ;
(W4) 
if u v , then O i ( u ) O i ( v ) , i 1 , 2 .
Then
O 1 ω B , E C 6 n E O 2 ω B , E , B = B R R n .
Proof. 
Let B be a tiling of R n satisfying [ 0 , R ] n B , whose tiles are cubes with the form B = B ( c B , R ) . First we claim that
ω B , E ( x ) 1 + n 2 E B B χ B ( x ) ω B , E c B
and
B B ω B , E ( x ) ω B , E c B 3 · 2 2 E E n 1 ω B , E ( x )
hold for each x R n .
To prove (4), note that | c B x | ( n / 2 ) R , x B . Thus, we only need to prove
ω B , E ( x ) 1 + n 2 E ω B , E c B ,
which follows directly from
1 + | c B c B | R 1 + | x c B | R 1 + | c B x | + | x c B | R 1 + | x c B | R 1 + n 2 .
For (5), it suffices to prove that
B B 1 + | c B x | R 1 + | c B x | R 1 + | c B c B | R E 3 · 2 2 E E n 1 , x R n .
With the substitution u = c B / R and v = x / R , the inequality above is equivalent to
I : = B B 1 + | u v | 1 + | c B R u | 1 + | c B R v | E 3 · 2 2 E E n 1 , x R n .
Let | u v | = A . Define
B 1 = B B | c B R u | < A 2     and     B 2 = B B | c B R u | A 2 .
Note that each B in B 1 satisfies | c B / R v | | u v | | c B / R u | A / 2 . Thus,
I = B B 1 + B B 2 1 + | u v | 1 + | c B R u | 1 + | c B R v | E B B 1 1 + A 1 + A 2 E 1 1 + | c B R u | E + B B 2 1 + A 1 + A 2 E 1 1 + | c B R v | E 2 E B B 2 1 1 + | c B R u | E + 2 E B B 2 1 1 + | c B R v | E 2 E + 1 ( 1 + i = 1 ( 2 i + 1 ) n ( 1 + 2 i 1 2 ) E ) 2 E + 1 ( 1 + 2 n 1 2 + 1 x E n x ) 3 · 2 2 E E n 1 .
We provide an interpretation of (6). Let B / R = B / R | B B . Then B / R is a tiling of R n with integer lattice points as vertices. By applying a suitable translation if necessary, we may assume that v [ 0 , 1 ] n . Let
B ( i ) = B R B R | B R [ i , i + 1 ] n ( 1 i , i ) n .
We have B / R = [ 0 , 1 ] n B ( 1 ) B ( 2 ) . Moreover,
card ( B ( i ) ) = ( 2 i + 1 ) n ( 2 i 1 ) n ( 2 i + 1 ) n .
For any B / R B / R , we have | c B / R v | 2 i 1 / 2 . Thus, the inequality (6) holds.
Now we return to the proof of the lemma. By (4), (W4), (W2), and (W1), we have
O 1 ω B , E O 1 1 + n 2 E B B χ B ( x ) ω B , E c B 1 + n 2 E B B ω B , E c B O 1 χ B ( x ) C 1 + n 2 E B B ω B , E c B O 2 ω B , E
By (5), (W3), and (W4), we have
C 1 + n 2 E B B ω B , E c B O 2 ω B , E C 1 + n 2 E O 2 B B ω B , E c B ω B , E
C 1 + n 2 E · 3 · 2 2 E E n 1 O 2 ω B , E C 6 n E O 2 ω B , E .  
Remark 1. 
As Bourgain noted in Remark 4.2 in [13], for any f : R n C and positive weight ν, the map O 1 ( v ) : = | | f | | L p ( v ) p satisfies (W2) and (W4). Also, for any p 2 , f i : R n C , and positive weight ν satisfying f i v 1 / p L p , the map O 2 ( v ) : = i f i L p ( v ) 2 p / 2 satisfies (W3) and (W4) by Minkowski’s inequality.
Lemma 2. 
Let f : R C be a smooth function. We have
[ f ( x 2 ) ] ( n ) = k = 0 n 2 n ! ( n 2 k ) ! k ! ( 2 x ) n 2 k f ( n k ) ( x 2 ) .
Proof. 
By Faà di Bruno’s Formula (cf. [17]), for two functions g and f with a sufficient number of derivatives, we have
[ f ( g ( x ) ) ] ( n ) = n ! b 1 ! b n ! f ( l ) ( g ( x ) ) 1 i n b i > 0 ( g ( i ) ( x ) i ! ) b i ,
where the sum is over all different solutions in nonnegative integers b 1 , , b n of
b 1 + 2 b 2 + + n b n = n ,
and l : = b 1 + + b n . Let g ( x ) = x 2 . We have g ( i ) ( x ) = 0 , i 3 . Hence,
1 i n b i > 0 ( g ( i ) ( x ) i ! ) b i 0
if and only if b i = 0 , i 3 . Consequently, b 1 + 2 b 2 + + n b n = n reduces to b 1 + 2 b 2 = n , and correspondingly we have l = b 1 + b 2 . Let k = b 2 . Then all integers 0 k n / 2 are in one-to-one correspondence with the nonnegative integer solutions ( b 1 , b 2 ) of b 1 + 2 b 2 = n . In this case, we obtain b 1 = n 2 k and l = n 2 k + k = n k . Substituting into (10) yields (9). □
Remark 2. 
Let g ( t ) = f ( a t + b ) . Then g ( x 2 ) = f ( a x 2 + b ) . By denoting I ( n , k ) = 2 n 2 k n ! / ( ( n 2 k ) ! k ! ) , it follows from (9) that
[ f ( a x 2 + b ) ] ( n ) = [ g ( x 2 ) ] ( n ) = k = 0 n 2 I ( n , k ) x n 2 k g ( n k ) ( x 2 ) = k = 0 n 2 I ( n , k ) x n 2 k ( a ) n k f ( n k ) ( a x 2 + b )
and
k = 0 n 2 I ( n , k ) = k = 0 n 2 C n n 2 k C 2 k k k ! 2 n 2 k n ! 2 n ( 1 + 2 ) n = 6 n n ! .
In the rest of this section, the cube B R is centered at the origin.
Lemma 3. 
We have
ω B R , E 1 R n ω B R , E 6 E σ S n 1 B ( E n , n ) ω B R , E , R 0 , R ,
where B ( E n , n ) is the Beta function.
Proof. 
We have the following equivalent forms of (13):
1 1 + | x t | R E · 1 ( R ) n · 1 1 + | t | R E d t 6 E σ S n 1 B ( E n , n ) 1 1 + | x | R E , x R n 1 + | x | R 1 + | x t | R E · 1 ( R ) n · 1 1 + | t | R E d s 6 E σ S n 1 B ( E n , n ) , x R n y = x R 1 + | y | 1 + | y t R | E · 1 ( R ) n · 1 1 + | t | R E d s 6 E σ S n 1 B ( E n , n ) , y R n s = t R θ = R R 1 θ n 1 + | y | 1 + | y s | E · 1 1 + | s | θ E d s 6 E σ S n 1 B ( E n , n ) , y R n .
We distinguish two cases.
Case 1. | y | 1 / 2 . By Corollary 2.51 in [14], we have
1 + | y | 1 + | y s | E · 1 1 + | s | θ E d s 1 + 1 2 1 + | s | 1 2 E · 1 1 + | s | θ E d s = 3 2 E σ S n 1 0 + 1 r + 1 2 E · 1 1 + r θ E r n 1 d r .
By the substitution r = θ u , we get
3 2 E σ S n 1 0 + 1 r + 1 2 E · 1 1 + r θ E r n 1 d r = 3 2 E σ S n 1 θ n 0 + 1 θ u + 1 2 E u n 1 1 + u E d u 3 E σ S n 1 θ n 0 + u n 1 1 + u E d u .
Hence,
1 + | y | 1 + | y s | E · 1 1 + | s | θ E d s 3 E σ S n 1 θ n 0 + u n 1 1 + u E d u .
Thus, (13) holds.
Case 2. | y | > 1 / 2 . Consider
1 + | y | 1 + | y s | E · 1 1 + | s | θ E d s = | s | < 3 4 | y | + | s | 3 4 | y | 1 + | y | 1 + | y s | E · 1 1 + | s | θ E d s .
Let A and B be the first and the second summand in the right-hand side of the equality above, respectively. On the one hand,
A | s | < 3 4 | y | 1 + | y | 1 + 1 4 | y | E · 1 1 + | s | θ E d s 4 E 1 1 + | s | θ E d s .
Let s = θ u . We have
4 E 1 1 + | s | θ E d s = 4 E θ n 1 1 + | u | E d u = 4 E θ n σ S n 1 0 + r n 1 1 + r E d r .
Hence, we have
A 4 E θ n σ S n 1 0 + r n 1 1 + r E d r .
On the other hand, by | s | 3 / 4 | y | and θ 1 , we have
1 + | s | θ | s | θ 3 | y | 4 θ ,
and therefore
1 1 + | s | / θ 4 θ 3 | y | .
Thus, we have
B | s | 3 4 | y | 1 + | y | 1 + 3 4 θ | y | E · 1 1 + | y s | E d s | s | 3 4 | y | 4 θ 1 + | y | 3 | y | E · 1 1 + | y s | E d s 4 θ E · 1 1 + | y s | E d s .
By the substitution u = s y , we get
4 θ E · 1 1 + | y s | E d s = 4 E θ E 1 1 + | u | E d u 4 E θ n σ S n 1 r n 1 1 + r E d r ,
which implies that
B 4 E θ n σ S n 1 r n 1 1 + r E d r .
By (15)–(17), and E 100 n , we have (13) again. □
Corollary 1. 
We have
ω I R , E 1 R ω I R , E 6 E ω I R , E , R 0 , R ,
Proof. 
Note that σ ( S 0 ) = 2 , B ( E 1 , 1 ) = 1 E 1 , and 2 E 1 1 . □
Corollary 2. 
We have
ω B R , E ( 1 ( R ) n χ B R ) ( 1 + n 2 ) E 6 E σ S n 1 B ( E n , n ) ω B R , E , R 0 , R .
Proof. 
When x B R , we have | x | ( R / 2 ) 2 n = R n / 2 . Thus,
ω B R , E ( x ) = 1 + | x | R E 1 + n 2 E .
From (13), it follows that
ω B R , E 1 R n χ B R ( 1 + n 2 ) E ω B R , E 1 R n ω B R , E ( 1 + n 2 ) E 6 E σ S n 1 B ( E n , n ) ω B R , E .
Corollary 3. 
We have
χ B R ( 1 ( R ) n ω B R , E ) ( 1 + n 2 ) E 6 E σ S n 1 B ( E n , n ) ω B R , E , R 0 , R .
Proof. 
Similarly to the proof of (19), just note that when x B R , we have
| x | ( R / 2 ) 2 n = R n / 2
and
ω B R , E ( x ) = 1 + | x | R E 1 + n 2 E .
From (18)–(20), we have the following corollary by setting n = 1 .
Corollary 4. 
For any R 0 , R , we have
ω I R , E ( 1 R χ I R ) 9 E ω I R , E   a n d   χ I R ( 1 R ω I R , E ) 9 E ω I R , E .
Lemma 4. 
Let x = ( x 1 , , x n ) . If i = 1 n E i E , where E i > 0 , i [ n ] , then
ω B R , E ( x ) i = 1 n ω I R , E i ( x i ) .
Proof. 
Clearly,
ω B R , E ( x ) = ( 1 + x 1 2 + + x n 2 R ) E i = 1 n ( 1 + x 1 2 + + x n 2 R ) E i i = 1 n ( 1 + x i 2 R ) E i = i = 1 n ω I R , E i ( x i ) .
Lemma 5. 
Let x = ( x 1 , , x n ) . Then
k = 1 n ω I R , E ( x k ) ω B R , E ( x ) .
Proof. 
Note that
k = 1 n ( 1 + | x k | R ) 1 + i = 1 n | x i | R 1 + i = 1 n x i 2 R = 1 + | x | R ,
which implies that
k = 1 n ω I R , E ( x k ) ω B R , E ( x ) .
Lemma 6. 
Let u i 0 , 1 , i n 1 , and u = ( u 1 , , u n 1 ) . Then
1 6 n | y | y n 2 + j = 1 n 1 y j ± 2 y n u j 2 6 n | y | , y = y 1 , , y n R n .
Proof. 
For each i n 1 , set
δ i = 4 u i 2 4 u i 2 + 1 n 0 , 4 4 + 1 n .
Consider the matrices
( δ i 2 u i 2 u i 1 n + 4 u i 2 )   a n d   ( δ i 2 u i 2 u i 1 n + 4 u i 2 ) .
We have δ i 0 , 1 / n + 4 u i 2 0 , and
δ i ( 1 n + 4 u i 2 ) 4 u i 2 = 0 .
Thus, both matrices are positive semi-definite. Then
I i : = δ i y i 2 + 1 n + 4 u i 2 y n 2 ± 4 u i y i y n 0 .
From
1 δ i 1 4 1 n + 4 = 1 1 + 4 n 1 6 n ,
it follows that
i = 1 n 1 y i ± 2 y n u i 2 + y n 2 = i = 1 n 1 y i 2 + 1 + 4 i = 1 n 1 u i 2 y n 2 ± 4 y n i = 1 n 1 u i y i = i = 1 n 1 1 δ i y i 2 + 1 n y n 2 + i = 1 n 1 I i 1 6 n | y | 2 .
Moreover, we have
i = 1 n 1 y i ± 2 y n u i 2 + y n 2 = | y | 2 + 4 y n 2 i = 1 n 1 u i 2 ± 4 y n i = 1 n 1 u i y i | y | 2 + 4 y n 2 ( n 1 ) + 2 i = 1 n 1 y i 2 + y n 2 6 n | y | 2 .
For any y = ( y 1 , , y n ) R n , set y = ( y 1 , , y n 1 ) .
Corollary 5. 
Let u be as in Lemma 6. Then
ω B R , E ( y + 2 y n u , y n ) ( 6 n ) E ω B R , E ( y ) , y = ( y 1 , , y n ) R n .
Proof. 
By (24), we have
ω B R , E ( y + 2 y n u , y n ) = ( 1 + j = 1 n 1 y j ± 2 y n u j 2 + y n 2 R ) E ( 1 + | y | ( 6 n ) E R ) E ( 6 n ) E ω B R , E ( y ) .
In the rest of this work, we assume that R 1 4 N and f : R n C is a function satisfying supp f ^ N 1 / R ( [ 0 , 1 ] n 1 ) .
Lemma 7. 
For f : R n C , the following inequalities hold:
1 2 n F f L p ω B R , F p f L p ( B ( y , R ) ) p ω B R , F ( y ) d y 2 n F f L p ω B R , F p .
Proof. 
Clearly,
f L p ( B ( y , R ) ) p ω B R , F ( y ) d y = 1 | B ( y , R ) | [ B ( y , R ) | f ( x ) | p x ] ω B R , F ( y ) d y = 1 R n | f ( x ) | p ω B R , F ( y ) χ B ( y , R ) ( x ) d x d y = 1 R n | f ( x ) | p [ ω B R , F ( y ) χ B ( y , R ) ( x ) d y ] d x = 1 R n | f ( x ) | p B ( x , R ) ω B R , F ( y ) d y d x .
Let y = x + s , we have
B ( x , R ) ω B R , F ( y ) d y = B ( 0 , R ) ω B R , F ( x + s ) d s = B ( 0 , R ) 1 1 + | x + s | R F d s .
By the substitution s = R t , we have
1 ω B R , F ( x ) · 1 R n B ( 0 , R ) 1 1 + | x + s | R F d s = 1 R n B ( 0 , R ) 1 + | x | R 1 + | x + s | R F d s = B ( 0 , 1 ) 1 + | x | R 1 + | x R + t | F d t .
Hence,
f L p ( B ( y , R ) ) p ω B R , F ( y ) d y = | f ( x ) | p ω B R , F [ B ( 0 , 1 ) 1 + | x | R 1 + | x R + t | F d t ] d x .
Next, let z = x / R . Since t B ( 0 , 1 ) , we have
1 + | z | 1 + | z + t | 1 + | z | 1 + | z | + | t | 1 + | z | 1 + | z | + n 2 1 + | z | 1 + n 2 1 2 n .
Furthermore,
1 + | z | 1 + | z + t | 1 + n , 0 | z | n , 1 + | z | 1 + | z | | t | 1 + | z | 1 + | z | n 2 1 + n 1 + n 2 2 n , | z | n .
The proof is complete. □
For any s R n 1 and j N , let
g j ( s ) = 0 1 R f ^ s , | s | 2 + t R t 2 j d t .
For any cube Q [ 0 , 1 ] n 1 , by the definition of E Q g j ( x ) , we have
E Q g j ( x ) = Q e s · x + | s | 2 x n g j ( s ) d s = Q d s 0 1 R e s · x + | s | 2 x n f ^ s , | s | 2 + t R t 2 j d t .
Take the cube Q = i = 1 n 1 u i , u i + R 1 / 2 [ 0 , 1 ] n 1 . Set u = u 1 , , u n 1 . Define
A Q = E n 1 2 u T 0 1     and     b Q = u , | u | 2 ,
where E n 1 is the identity matrix of order n 1 . Clearly, for any ξ R n , ξ A Q + b Q N 1 / R ( Q ) if and only if ξ N 1 / R [ 0 , 1 / R ] n 1 .
Lemma 8. 
Let η , x R n . We have
E Q g j ( x ) = e x · u + | u | 2 x n · N 1 R 0 , 1 R n 1 e x · η + x n | η | 2 + 2 u · η f ^ η A Q + b Q R η n | η | 2 2 j d η .
Proof. 
By (27) and applying the transformation
s , | s | 2 + t = η A Q + b Q = η + u , 2 η · u + η n + | u | 2 ,
we have
E Q g j ( x ) = N 1 R 0 , 1 R n 1 e x · u + η + | u + η | 2 x n f ^ η A Q + b Q R η n | η | 2 2 j d η 1 d η n = e x · u + | u | 2 x n · N 1 R 0 , 1 R n 1 e x · η + x n | η | 2 + 2 u · η f ^ η A Q + b Q R η n | η | 2 2 j d η ,
which completes the proof. □
Lemma 9. 
For any y R n and j N , set
h j y = N 1 R 0 , 1 R n 1 e η · y + y n | η | 2 f ^ η A Q + b Q R η n | η | 2 2 j d η .
We have
E Q g j L p ω B R , F 6 n F p h j L p ω B R , F .
Proof. 
From (29) and (24), it follows that
E Q g j L p ω B R , F p = | h j x + 2 x n u , x n | p ω B R , F ( x ) d x = | h j y | p 1 1 + | y 2 y n u | 2 + y n 2 R F d y | h j y | p 1 1 + 1 6 n | y | R F d y | h j y | p 6 n 1 + | y | R F d y = 6 n F | h j y | p 1 1 + | y | R F d y .
Lemma 10. 
For a cube Q [ 0 , 1 ] n 1 , set F = f N 1 / R ( Q ) . We have
supp F ^ N 1 R ( Q )   a n d   F ^ ( x ) = f ^ ( x ) , x N 1 R ( Q ) .
Proof. 
Take a test function h S ( R n ) . We have
F ^ h = F h ^ = R n N 1 R ( Q ) f ^ ( ξ ) e ( x · ξ ) d ξ h ^ ( x ) d x = N 1 R ( Q ) f ^ ( ξ ) h ^ ( x ) e ( x · ξ ) d x d ξ = N 1 R ( Q ) f ^ ( ξ ) h ( ξ ) d ξ ,
which implies that supp F ^ N 1 R ( Q ) . Furthermore, by
F ^ f ^ h = N 1 R ( Q ) f ^ ( ξ ) h ( ξ ) d ξ N 1 R 0 , 1 n 1 f ^ ( ξ ) h ( ξ ) d ξ = N 1 R 0 , 1 n 1 N 1 R ( Q ) f ^ ( ξ ) h ( ξ ) d ξ ,
we have supp F ^ f ^ N 1 R 0 , 1 n 1 N 1 R ( Q ) , which means that F ^ = f ^ in N 1 R ( Q ) . □
For any y , z R n and any j N , define
ψ j ( y , z ) = N 1 R 0 , 1 R n 1 f ^ η A Q + b Q R η n | η | 2 2 j e η · y e z n | η | 2 η n d η ,
where A Q and b Q are defined as in (28). Let η S ( R ) be a Schwartz function satisfying (1), and M j S ( R ) be a Schwartz function with a compact support and satisfying (2).
Lemma 11. 
Let Q [ 0 , 1 ] n 1 be a cube and F = f N 1 / R ( Q ) . We have
ψ j ( y , z ) = F ^ ( ξ A Q + b Q ) m j ( ξ ) e ξ · y + ξ n y n z n d ξ , y , z R n ,
where
m j ( ξ ) = e ( | ξ | 2 z n ) M j ( R ( ξ n | ξ | 2 ) 2 ) η ( R 1 2 ξ 1 ) η ( R 1 2 ξ n 1 ) η ( R ξ n ) .
Proof. 
Note that m j is actually a function of z. For notational simplicity, this dependence will be omitted in what follows.
Note that when F ^ ( ξ A Q + b Q ) 0 , we have ξ A Q + b Q N 1 / R ( Q ) by (32). It means ξ N 1 / R 0 , 1 / R n 1 . Thus,
R ξ n | ξ | 2 2 0 , 1 2   and   ξ i 0 , 1 R , i n 1 ,
which implies that
0 R ξ n 1 + R | ξ | 2 1 + ( n 1 ) = n .
It follows that
F ^ ξ A Q + b Q m j ( ξ ) e ξ · y + ξ n y n z n d ξ = N 1 R 0 , 1 R n 1 F ^ ξ A Q + b Q R ξ n | ξ | 2 2 j e ( ξ · y ) e z n | ξ | 2 ξ n d ξ = ψ j ( y , z ) .
Lemma 12. 
For any s N , let ρ ( s ) be defined as in (3). For any s 1 , , s n N , we have
| ξ 1 s 1 ξ n s n m j ( ξ ) | C 0 ( s 1 , , s n ) ( R + | z n | R ) s 1 + + s n 1 R s n ,
where m j ( ξ ) is defined as in (35),
C 0 ( s 1 , , s n ) = max C ˜ 0 , , C ˜ i = 1 n s i ( j = 1 n ρ ( s j ) ) ( k = 1 n 1 s k ! ) 2 ( 14 n ) i = 1 n s i ,
and C ˜ 0 , , C ˜ i = 1 n s i are given by (2).
Proof. 
By supp η [ ( n + 1 ) , n + 1 ] , for each ξ R n satisfying that there exists i [ n 1 ] such that | ξ i | > ( n + 1 ) / R , we have m j ( ξ ) = 0 . Thus, without loss of generality, we may assume that | ξ i | ( n + 1 ) R , i [ n 1 ] . Observing that
ξ 1 s 1 ξ n s n m j ( ξ ) = α + β = s n s n ! α ! β ! R α ( R 2 ) β η ( α ) ( R ξ n ) · u n 1 + v n 1 + w n 1 = s n 1 s n 1 ! u n 1 ! v n 1 ! w n 1 ! R v n 1 2 ξ n 1 u n 1 e ( z n ξ n 1 2 ) · η ( v n 1 ) ( R 1 2 ξ n 1 ) u 1 + v 1 + w 1 = s 1 s 1 ! u 1 ! v 1 ! w 1 ! R v 1 2 ξ 1 u 1 e ( z n ξ 1 2 ) · η ( v 1 ) ( R 1 2 ξ 1 ) · ξ 1 w 1 ξ n 1 w n 1 M j ( β ) ( R ( ξ n | ξ | 2 ) 2 ) ,
by (11) and the definition of M j ( t ) , we have
| ξ 1 w 1 ξ n 1 w n 1 M j ( β ) ( R ( ξ n | ξ | 2 ) 2 ) | = k n 1 = 0 w n 1 2 k 1 = 0 w 1 2 I ( w n 1 , k n 1 ) I ( w 1 , k 1 ) ξ n 1 w n 1 2 k n 1 ξ 1 w 1 2 k 1 · ( R 2 ) w n 1 k n 1 ( R 2 ) w 1 k 1 M j ( β + i = 1 n 1 ( w i k i ) ) ( R ( ξ n | ξ | 2 ) 2 ) max C ˜ 1 , , C ˜ i = 1 n s i r = 1 n 1 k r = 0 w r 2 ( I ( w r , k r ) | ξ r | w r 2 k r ( R 2 ) w r k r ) max C ˜ 0 , , C ˜ i = 1 n s i r = 1 n 1 k r = 0 w r 2 ( I ( w r , k r ) ( n + 1 R ) w r 2 k r ( R 2 ) w r k r ) max C ˜ 0 , , C ˜ i = 1 n s i r = 1 n 1 ( ( n + 1 ) w r R w r 2 k r = 0 w r 2 I ( w r , k r ) ) .
By (12), we get
r = 1 n 1 ( ( n + 1 ) w r R w r 2 k r = 0 w r 2 I ( w r , k r ) ) ( 6 ( n + 1 ) R ) j = 1 n 1 w j j = 1 n 1 s j ! .
Thus,
| ξ 1 w 1 ξ n 1 w n 1 M j ( β ) ( R ( ξ n | ξ | 2 ) 2 ) | max C ˜ 0 , , C ˜ i = 1 n s i ( 6 ( n + 1 ) R ) j = 1 n 1 w j j = 1 n 1 s j ! .
For any i [ n 1 ] , we have
| ξ i u i e ( z n ξ i 2 ) · η ( v i ) ( R 1 2 ξ i ) | = | η ( v i ) ( R 1 2 ξ i ) k = 1 u i 2 u i ! ( u i 2 k ) ! k ! ( 2 ξ i ) u i 2 k ( 2 π i z n ) u i k e ( z n ξ i 2 ) | k = 1 u i 2 u i ! ( u i 2 k ) ! k ! | η ( v i ) ( R 1 2 ξ i ) | | 2 R 1 2 ξ i | u i 2 k R 1 2 ( u i 2 k ) | 2 π z n | u i k ρ ( s i ) k = 0 u i 2 u i ! ( u i 2 k ) ! k ! ( 2 R ) u i 2 k | 2 π z n | u i k = ρ ( s i ) k = 0 u i 2 u i ! ( u i k ) ! k ! ( u i k ) ! ( u i 2 k ) ! ( R 2 ) k ( 4 π | z n | R ) u i k ρ ( s i ) s i ! ( R 2 + 4 π | z n | R ) u i .
By (37)–(39), we have
ξ 1 s 1 ξ n s n m j ( ξ ) max C ˜ 0 , , C ˜ i = 1 n s i ( i = 1 n ρ ( s i ) ) ( j = 1 n 1 s j ! ) 2 · α + β = s n s n ! α ! β ! R α ( R 2 ) β · u n 1 + v n 1 + w n 1 = s n 1 s n 1 ! u n 1 ! v n 1 ! w n 1 ! R v n 1 2 ( R 2 + 4 π | z n | R ) u n 1 ( 6 ( n + 1 ) R ) w n 1 u 1 + v 1 + w 1 = s 1 s 1 ! u 1 ! v 1 ! w 1 ! R v 1 2 ( R 2 + 4 π | z n | R ) u 1 ( 6 ( n + 1 ) R ) w 1 .
Finally, by
α + β = s n s n ! α ! β ! R α ( R 2 ) β · u n 1 + v n 1 + w n 1 = s n 1 s n 1 ! u n 1 ! v n 1 ! w n 1 ! R v n 1 2 ( R 2 + 4 π | z n | R ) u n 1 ( 6 ( n + 1 ) R ) w n 1 u 1 + v 1 + w 1 = s 1 s 1 ! u 1 ! v 1 ! w 1 ! R v 1 2 ( R 2 + 4 π | z n | R ) u 1 ( 6 ( n + 1 ) R ) w 1 = ( 3 R 2 ) s n ( ( 6 ( n + 1 ) + 3 2 ) R + 4 π | z n | R ) j = 1 n 1 s j ( 14 n ) i = 1 n s i R s n ( R + | z n | R ) j = 1 n 1 s j ,
we complete the proof. □
Lemma 13. 
Let z n be consistent with the choice in (35). For any x = ( x 1 , , x n ) R n and s 1 , , s n N , set
ϕ k ( x k ) = 1 R ( 1 + | x k | R + | z n | R ) s k , k [ n 1 ] , 1 R ( 1 + | x n | R ) s n , k = n .
We have
| m j ^ ( x ) | C 0 ( s 1 , , s n ) ( 4 n ) n 2 i = 1 n s i j = 1 n ϕ j ( x j ) ,
where m j is defined as in (35).
Proof. 
Actually, when k n , ϕ k are also functions of z. These dependences will be omitted in what follows.
Let a k = | x k |   / ( R + | z n | / R ) for each k [ n 1 ] , and a n = | x n | / R . Let I = k [ n ] | a k 1 . Clearly, we have
supp m j [ ( n + 1 ) / R , ( n + 1 ) / R ] n 1 × [ ( n + 1 ) / R , ( n + 1 ) / R ] = : Ω .
By (36),
| ( k I ξ k s k ) m j ( ξ ) | C 0 ( s 1 , , s n ) ( R + | z n | R ) k I [ n 1 ] s k R k I { n } s k
and
k I ξ k s k m j ^ ( x ) = ( k I ( 2 π i x k ) s k ) m j ^ ( x ) ,
we obtain
| m j ^ ( x ) | ( k I | x k | s k ) | ( k I ξ k s k ) m j ( ξ ) e ( x ξ ) d ξ | ( k I | x k | s k ) Ω | ( k I ξ k s k ) m j ( ξ ) | d ξ ( k I | x k | s k ) C 0 ( s 1 , , s n ) ( R + | z n | R ) k I [ n 1 ] s k R k I { n } s k ( 2 ( n + 1 ) R ) n 1 2 ( n + 1 ) R = C 0 ( s 1 , , s n ) [ 2 ( n + 1 ) ] n ( 1 R ) n 1 1 R ( k I [ n 1 ] ( 1 a k ) s k ) ( k I { n } ( 1 a k ) s k ) C 0 ( s 1 , , s n ) [ 2 ( n + 1 ) ] n ( 1 R ) n 1 1 R k I 2 s k ( 1 1 + a k ) s k C 0 ( s 1 , , s n ) [ 2 ( n + 1 ) ] n ( 1 R ) n 1 1 R ( k I 2 s k ( 1 1 + a k ) s k ) ( k [ n ] I 2 s k ( 1 1 + a k ) s k ) C 0 ( s 1 , , s n ) ( 4 n ) n 2 i = 1 n s i j = 1 n ϕ j ( x j ) ,
which implies (40). □
Lemma 14. 
We have
| m j ^ ( x ) | x C m ( 1 + | z n | R ) n 1 ,
where C m = max C ˜ 0 , , C ˜ 2 n ( ρ ( 2 ) ) n ( 30 n ) 3 n and m j is defined as in (35).
Proof. 
It follows from (40) that
| m j ^ ( x ) | C 0 ( 2 , , 2 ) ( 4 n ) n 2 2 n 1 R ( 1 + | x n | R ) 2 k = 1 n 1 1 R ( 1 + | x k | R + | z n | R ) 2 .
We have
C 0 ( 2 , , 2 ) ( 4 n ) n 2 2 n = max C ˜ 0 , , C ˜ 2 n ( ρ ( 2 ) ) n 2 2 ( n 1 ) ( 14 n ) 2 n ( 4 n ) n 2 2 n max C ˜ 0 , , C ˜ 2 n ( ρ ( 2 ) ) n ( ( 28 n ) 2 16 n ) n ,
1 R ( 1 + | x n | R ) 2 d x n = 2 0 ( 1 1 + t ) 2 d t = 2 ,
and
1 R ( 1 + | x k | R + | z n | R ) 2 d x k = 2 0 ( 1 + t 1 + | z n | R ) 2 d t = 2 ( 1 + | z n | R ) 1 1 + t 1 + | z n | R 0 + = 2 ( 1 + | z n | R ) .
From (42)–(45), it follows that
| m j ^ ( ξ ) | ξ max C ˜ 0 , , C ˜ 2 n ( ρ ( 2 ) ) n ( ( 28 n ) 2 16 n ) n 2 n ( 1 + | z n | R ) n 1 max C ˜ 0 , , C ˜ 2 n ( ρ ( 2 ) ) n ( 30 n ) 3 n ( 1 + | z n | R ) n 1 ,
which implies (41). □

3. The Main Theorem

We now recall our main theorem.
Theorem 4. 
Let p 2 , R 1 4 N , and f : R n C be a function satisfying supp f ^ N 1 / R ( [ 0 , 1 ] n 1 ) . Consider η ( x ) S ( R ) as (1), M j ( t ) S ( R ) as (2), and ρ ( s j ) as satisfying (3). Then for all E 100 n , F 2 ( n 1 ) E + ( n 1 ) ( p 1 ) + 2 , and each cube B R R n , we have
f L p ω B R , E C 0 Dec n R 1 , p , F · Q Part R 1 / 2 [ 0 , 1 ] n 1 f N 1 R ( Q ) L p ω B R , E 2 1 / 2 ,
where C 0 = max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E p ( 9 n ) F p ( 30 n ) E .
Proof. 
By Lemma 1 and Remark 1, we only need to prove that there exists a constant C 1 , such that
f L p B R C 1 Dec n R 1 , p , F Q Part R 1 / 2 ( [ 0 , 1 ] n 1 ) f N 1 R ( Q ) L p ω B R , E 2 1 / 2 ,
and
( 6 n ) E C 1 C 0 .
In the rest of the proof, for Q = i = 1 n 1 [ u i , u i + R 1 / 2 ] Part R 1 / 2 ( [ 0 , 1 ] n 1 ) , we always assume that the corresponding A Q and b Q are defined as in (28).
  • Step 1: First, we show that, without loss of generality, the center of the cube may be assumed to be at the origin.
Noting that
f ( · + c ) ^ ( ξ ) = e ( c ξ ) f ^ ( ξ ) ,
we have
f N 1 R ( Q ) ( y + c ) = N 1 / R ( Q ) f ^ ( ξ ) e ( ( y + c ) ξ ) d ξ = N 1 R ( Q ) f ( · + c ) ^ ( ξ ) e ( y ξ ) d ξ = f ( · + c ) N 1 R ( Q ) ( y ) ,
which implies that
f N 1 R ( Q ) L p ω B ( c , R ) , E p = | f N 1 R ( Q ) ( x ) | p ω B ( c , R ) , E ( x ) d x = x = y + c | f N 1 R ( Q ) ( y + c ) | p ω B ( 0 , R ) , E ( y ) d y .
Simultaneously,
| | f | | L p B ( c , R ) p = B ( c , R ) | f ( x ) | p d x = B ( 0 , R ) | f ( y + c ) | p d y = | | f ( · + c ) | | L p B ( 0 , R ) p .
Thus, without loss of generality, we may assume that the center of B ( c , R ) is at the origin, and denote the cube by B R .
  • Step 2: We show that the validity of (46) is guaranteed by
E Q g j L p ω B R , F C 2 f N 1 R ( Q ) L p ω B R , E , Q Part R 1 2 ( [ 0 , 1 ] n 1 ) ,
where C 1 = 1 + n 2 F p e 2 π C 2 .
Set x = x 1 , , x n , ξ = ξ 1 , , ξ n , x = x 1 , , x n 1 , and s = s 1 , , s n 1 . By applying the transformation
ξ i = s i , ξ n = | s | 2 + t , i [ n 1 ] ,
we have
f x = N 1 / R ( [ 0 , 1 ] n 1 ) f ^ ( ξ ) e ( ξ · x ) d ξ = [ 0 , 1 ] n 1 s 0 1 R f ^ s , | s | 2 + t e x · s + | s | 2 x n e t x n d t = j 0 ( 2 π ) j j ! 2 i x n R j [ 0 , 1 ] n 1 d s 0 1 R f ^ s , | s | 2 + t e x · s + | s | 2 x n R t 2 j d t .
For the last equality, since f ^ is bounded, we have
sup | f ^ | j 0 ( 2 π | x n | ) j j ! ( j + 1 ) R j + 1 sup | f ^ | R e 2 π | x n | R < .
Thus, Fubini’s theorem justifies the interchange of the sum and the integral. Combining with (27), we obtain
| f ( x ) | j 0 ( 2 π ) j j ! | E g j ( x ) | , x B R ,
which, together with Minkowski’s inequality and (48), implies that
f L p B R j 0 ( 2 π ) j j ! E g j L p ( B R ) 1 + n 2 F p j 0 ( 2 π ) j j ! E g j L p ω B R , F 1 + n 2 F p Dec n R 1 , p , F j 0 ( 2 π ) j j ! Q Part R 1 / 2 ( [ 0 , 1 ] n 1 ) E Q g j L p ω B R , F 2 1 / 2 1 + n 2 F p Dec n R 1 , p , F e 2 π C 2 Q Part R 1 / 2 ( [ 0 , 1 ] ) f N 1 R ( Q ) L p ω B R , E 2 1 / 2 = C 1 Q Part R 1 / 2 ( [ 0 , 1 ] ) f N 1 R ( Q ) L p ω B R , E 2 1 / 2 .
Thus, (48) implies (46) as claimed.
  • Step 3: We show that for any Q Part R 1 2 ( [ 0 , 1 ] n 1 ) and ψ j ( y , z ) defined as in (33), the inequality
ψ j ( y , z ) L p ( B ( z , R ) ) p ω B R , F ( z ) z C 3 p f N 1 R ( Q ) L p ω B R , E p
implies (48), where C 3 is the constant satisfying C 2 = 2 6 n F p e 2 π C 3 .
In fact, by
e η · y + | η | 2 y n = e η · y e y n | η | 2 η n = e η · y e z n | η | 2 η n e y n z n | η | 2 η n
and
e y n z n | η | 2 η n = k 0 2 π k k ! 2 i z n y n R k R η n | η | 2 2 k ,
when y B ( z , R ) , we have
| h j ( y ) | k 0 2 π k k ! | N 1 R 0 , 1 R n 1 f ^ η A Q + b Q R η n | η | 2 2 k + j e η · y e z n | η | 2 η n d η | = k 0 2 π k k ! | ψ k + j ( y , z ) | ,
where h j ( y ) is defined as in (30). We briefly justify the interchange of the integral and the sum in the inequality above. Denote by V the volume of N 1 / R 0 , 1 / R n 1 . On the domain of integration we have
0 R ( η n | η | 2 ) 2 1 2 ,
and when y B ( z , R ) , | y n z n | R . Then
k 0 2 π k k ! N 1 R 0 , 1 R n 1 | f ^ η A Q + b Q R η n | η | 2 2 k + j e η · y e z n | η | 2 η n | d η k 0 V · ( 2 π R ) k k ! ( 1 2 ) j + k sup | f ^ | R n + 1 < .
Thus, Fubini’s theorem justifies it.
Now, by (31), (26), (50), Minkwoski’s inequality, and (49), we have
E Q g j L p ω B R , F 6 n F p h j L p ω B R , F 6 n F p 2 n F p h j L p ( B ( z , R ) ) p ω B R , F ( z ) d z 1 p 2 6 n F p k 0 2 π k k ! ψ k + j ( · , z ) L p ( B ( z , R ) ) p ω B R , F ( z ) d z 1 p 2 6 n F p k 0 2 π k k ! ψ k + j ( · , z ) L p ( B ( z , R ) ) p ω B R , F ( z ) z d 1 p 2 6 n F p e 2 π C 3 f N 1 R ( Q ) L p ω B R , E = C 2 f N 1 R ( Q ) L p ω B R , E .
Thus, (49) implies (48) as claimed.
Step 4: We show that to prove (49), it suffices to verify, for each Q Part R 1 / 2 ( [ 0 , 1 ] n 1 ) , the inequality below:
( | m j ^ | R n χ B R ) ( η A Q T + z n ϵ z ) ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) z C 4 p ω B R , E ( η ) , η R n ,
where ϵ = ( 0 , , 0 , 1 ) , C 4 p = C m 1 p C 3 p , i.e., C 3 = C 4 C m 1 q , and C m is defined as in Lemma 14.
For F = f N 1 / R ( Q ) , note that
F ^ ( · A Q + b Q ) ^ ( ξ ) = e ( ξ · b Q A Q 1 ) F ^ ( · A Q ) ^ ( ξ ) = e ( ξ · b Q A Q 1 ) F ^ ^ ( ξ ( A Q 1 ) T ) = e ( ξ · b Q A Q 1 ) F ( ξ ( A Q 1 ) T ) .
From (34) it follows that
| ψ j ( y , z ) | = | F ^ ( ξ A Q + b Q ) m j ( ξ ) e ( ξ · y + ξ n ( y n z n ) ) d ξ | = | F ^ ( ξ A Q + b Q ) m j ( ξ ) e ( ξ · ( y z n ϵ ) ) d ξ | = | F ^ ( · A Q + b Q ) m j ^ ( · ) ( y + z n ϵ ) | = | ( F ^ ( · A Q + b Q ) ^ m j ^ ) ( y + z n ϵ ) | = | e ( ξ · b Q A Q 1 ) F ( ξ ( A Q 1 ) T ) m j ^ ( y + z n ϵ ξ ) d ξ | .
By performing the transformation η = ξ ( A Q 1 ) T , we have
| e ( ξ · b Q A Q 1 ) F ( ξ ( A Q 1 ) T ) m j ^ ( y + z n ϵ ξ ) d ξ | = | e ( ( η A Q T ) · b Q A Q 1 ) F ( η ) m j ^ ( y + z n ϵ + η A Q T ) d η | | F ( η ) m j ^ ( y + z n ϵ + η A Q T ) | d η = | F ( η ) | | m j ^ ( y + z n ϵ + η A Q T ) | 1 p | m j ^ ( y + z n ϵ + η A Q T ) | 1 1 p d η .
Let 1 / q = 1 1 / p . By Hölder’s inequality, we obtain
| F ( η ) | | m j ^ ( y + z n ϵ + η A Q T ) | 1 p | m j ^ ( y + z n ϵ + η A Q T ) | 1 1 p d η ( | F ( η ) | p | m j ^ ( y + z n ϵ + η A Q T ) | d η ) 1 p ( | m j ^ ( y + z n ϵ + η A Q T ) | d η ) 1 q = ( | m j ^ ( η ) | d η ) 1 q ( | F ( η ) | p | m j ^ ( y + z n ϵ + η A Q T ) | d η ) 1 p .
By (41), we have
| | ψ j ( · , z ) | | L p ( B ( z , R ) ) p ( | m j ^ ( η ) | d η ) p q 1 R n B ( z , R ) [ | F ( η ) | p | m j ^ ( y + z n ϵ + η A Q T ) | d η ] d y C m p q 1 R n ( 1 + | z n | R ) ( n 1 ) ( p 1 ) B ( z , R ) [ | F ( η ) | p | m j ^ ( y + z n ϵ + η A Q T ) | d η ] d y .
Thus,
| | ψ j ( · , z ) | | L p ( B ( z , R ) ) p ω B R , F ( z ) d z C m p q R n ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) { B ( z , R ) [ | F ( η ) | p | m j ^ ( y + z n ϵ + η A Q T ) | d η ] d y } d z = C m p q R n | F ( η ) | p { [ | m j ^ ( y + z n ϵ + η A Q T ) | χ B ( z , R ) ( y ) d y ] ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z } d η .
Let Y = y + z n ϵ + η A T . Then
| m j ^ ( y + z n ϵ + η A Q T ) | χ B ( z , R ) ( y ) d y = | m j ^ ( Y ) | χ B ( 0 , R ) ( z n ϵ + η A Q T Y z ) d Y = ( | m j ^ | χ B ( 0 , R ) ) ( z n ϵ + η A Q T z ) .
Thus, by (51), we have
| | ψ j ( · , z ) | | L p ( B ( z , R ) ) p ω B R , F ( z ) d z C m p 1 | F ( η ) | p { [ ( | m j ^ | 1 R n χ B ( 0 , R ) ) ( z n ϵ + η A Q T z ) ] ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z } d η C m p 1 | F ( η ) | p C 4 p ω B R , E ( η ) d η = C m p 1 C 4 p | | f N 1 R ( Q ) | | L p ( ω B R , E ) p = C 3 p | | f N 1 R ( Q ) | | L p ( ω B R , E ) p .
Hence, (49) holds.
Our main theorem shows that the inequality holds when
F 2 ( n 1 ) E + ( n 1 ) ( p 1 ) + 2 ,
where the term ( n 1 ) ( p 1 ) actually comes from Hölder’s inequality and (52). Note that in [13], for n = 2 , Theorem 5.1 shows that the result holds under the condition F 2 E + 2 . According to our result, this would instead require F 2 E + 2 + ( p 1 ) . We have not found a way to eliminate p by the proof in [13], and therefore we can only provide a slightly looser bound.
  • Step 5: We start to prove (51).
Take s 1 = = s n = E . By (40), we have
( | m j ^ | 1 R n χ B R ) ( ξ ) C 0 ( E , , E ) ( 4 n ) n 2 n E k = 1 n ( ϕ k 1 R χ I R ) ( ξ k ) .
When k = n , from (21), it follows that
( ϕ n 1 R χ I R ) ( ξ n ) = 1 R ( ω I R , E 1 R χ I R ) ( ξ n ) 1 R 9 E ω I R , E ( ξ n ) .
When k [ n 1 ] , consider the cover of 0 , +
0 , + = [ 0 , R ] i = 0 log 2 R 1 2 2 i R , 2 i + 1 R i N 2 i R 3 2 , 2 i + 1 R 3 2 .
Case 1. | z n | R . We have
ϕ k ( x k ) 1 R ( 1 + | x k | 2 R ) E 1 R 2 E ω I R , E ( x k ) .
From (21), it follows that
( ϕ k 1 R χ I R ) ( ξ k ) 2 E 1 R 9 E ω I R , E ( ξ k ) = 1 R 18 E ω I R , E ( ξ k ) .
Case 2. 2 i R < | z n | 2 i + 1 R , i [ log 2 R 1 2 ] 0 . We have
ϕ k ( x k ) 1 R ( 1 + | x k | ( 1 + 2 i + 1 ) R ) E 1 R ( 1 + | x k | 2 i + 2 R ) E 1 R 4 E ( 1 + | x k | 2 i R ) E = 2 i 4 E 1 2 i R ω I 2 i R , E ( x k ) .
Note that 2 i R 2 log 2 R 1 2 R = R . By (21), we obtain
( ϕ k 1 R χ I R ) ( ξ k ) 2 i 4 E 1 R [ χ I R ( 1 2 i R ω I 2 i R , E ) ] ( ξ k ) 2 i 4 E 1 R 9 E ω I R , E ( ξ k ) = 2 i 36 E R ω I R , E ( ξ k ) .
Case 3. 2 i R 3 2 < | z n | 2 i + 1 R 3 2 , i N . We have
ϕ k ( x k ) 1 R ( 1 + | x k | R + 2 i + 1 R ) E 1 R ( 1 + | x k | 2 i + 2 R ) E = 1 R ω I 2 i + 2 R , E ( x k ) .
Note that 2 i + 2 R > R . Thus, similarly to the case above, applying (21), we obtain
( ϕ k 1 R χ I R ) ( ξ k ) 1 R 9 E ω I 2 i + 2 R , E ( ξ k ) .
By (53) and (54), we have
J : = ( | m j ^ | 1 R n χ B ( 0 , R ) ) ( η A Q T + z n ϵ z ) C 0 ( E , , E ) ( 4 n ) n 2 n E ( ϕ n 1 R χ I R ) ( η n ) k = 1 n 1 ( ϕ k 1 R χ I R ) ( η k + 2 η n u k z k ) 1 R 9 E C 0 ( E , , E ) ( 4 n ) n 2 n E ω I R , E ( η n ) k = 1 n 1 ( ϕ k 1 R χ I R ) ( η k + 2 η n u k z k ) = : A ( η n ) k = 1 n 1 ( ϕ k 1 R χ I R ) ( η k + 2 η n u k z k ) .
Let z = ( z , z n ) . We have
J · ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z = J · ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z n d z | z n | R J · ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z n d z + i = 0 log 2 R 1 2 2 i R < | z n | 2 i + 1 R J · ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z n d z + j = 0 + 2 j R 3 2 < | z n | 2 j + 1 R 3 2 J · ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z n d z .
Let U 1 , U 2 , and U 3 be the first, the second, and the third summand in the inequality above, respectively. For U 1 , when ( n 1 ) E + ( n 1 ) ( p 1 ) F , by (22), we obtain
( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω I R , ( n 1 ) ( p 1 ) ( z n ) k = 1 n 1 ω I R , E ( z k ) = k = 1 n 1 ω I R , E ( z k ) .
It follows from (55) and (58) that
J A ( η n ) k = 1 n 1 ( ϕ k 1 R χ I R ) ( η k + 2 η n u k z k ) k = 1 n 1 1 R 18 E ω I R , E ( η k + 2 η n u k z k ) .
Thus, by (59), we have
| z n | R J · ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z n A ( η n ) | z n | R ( k = 1 n 1 1 R 18 E ω I R , E ( η k + 2 η n u k z k ) ) ( k = 1 n 1 ω I R , E ( z k ) ) d z n = A ( η n ) 18 E ( n 1 ) 2 R k = 1 n 1 ( 1 R ω I R , E ( η k + 2 η n u k z k ) · ω I R , E ( z k ) ) .
Meanwhile, by (18), we have
U 1 A ( η n ) 18 E ( n 1 ) 2 R k = 1 n 1 ( 1 R ω I R , E ( η k + 2 η n u k z k ) · ω I R , E ( z k ) ) d z A ( η n ) 18 E ( n 1 ) 2 R · 6 E ( n 1 ) k = 1 n 1 ω I R , E ( η k + 2 η n u k ) .
For U 2 , let Φ i = [ 2 i R , 2 i + 1 R ] . When
( n 1 ) E + ( ( n 1 ) ( p 1 ) + ( n + 1 ) ) F ,
applying a similar approach as in (59), we have
( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) ω I R , n + 1 ( z n ) k = 1 n 1 ω I R , E ( z k ) .
Now, it follows from (56), (58) and (61) that
| z n | Φ i J · ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z n A ( η n ) 36 E ( n 1 ) 2 i ( n 1 ) ( k = 1 n 1 ω I R , E ( η k + 2 η n u k z k ) R ω I R , E ( z k ) ) | z n | Φ i ω I R , n + 1 ( z n ) d z n ,
where
| z n | Φ i ω I R , n + 1 ( z n ) d z n = | z n | Φ i ( 1 + | z n | R ) ( n + 1 ) d z n = 2 R 2 i < t 2 i + 1 ( 1 + t ) ( n + 1 ) d t 2 R · 2 i ( 1 + 2 i ) ( n + 1 ) 2 R ( 2 i ) n .
By (18), we have
U 2 i = 0 log 2 R 1 2 A ( η n ) 36 E ( n 1 ) 2 i ( n 1 ) ( k = 1 n 1 ω I R , E ( η k + 2 η n u k z k ) R ω I R , E ( z k ) ) 2 R ( 2 i ) n d z A ( η n ) 36 E ( n 1 ) 4 R · 6 E ( n 1 ) k = 1 n 1 ω I R , E ( η k + 2 η n u k ) .
For U 3 , when
( n 1 ) E + ( ( n 1 ) E + 2 + ( n 1 ) ( p 1 ) ) F ,
applying a similar approach as in (59), we have
( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) ω I R , ( n 1 ) E + 2 ( z n ) k = 1 n 1 ω I R , E ( z k ) .
Let Ψ j = [ 2 j R 3 2 , 2 j + 1 R 3 2 ] . From (57), (58) and (63), it follows that
| z n | Ψ j J · ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z n A ( η n ) | z n | Ψ j ( k = 1 n 1 1 R 9 E ω I 2 j + 2 R , E ( η k + 2 η n u k z k ) ) ω I R , ( n 1 ) E + 2 ( z n ) · ( k = 1 n 1 ω I R , E ( z k ) ) d z n A ( η n ) ( 9 E R ) n 1 R n 1 k = 1 n 1 ( ω I 2 j + 2 R , E ( η k + 2 η n u k z k ) 1 R ω I R , E ( z k ) ) · | z n | Ψ j ω I R , ( n 1 ) E + 2 ( z n ) d z n ,
where
| z n | Ψ j ω I R , ( n 1 ) E + 2 ( z n ) d z n = | z n | Ψ j ( 1 + | z n | R ) ( n 1 ) E 2 d z n = 2 R 2 j R < t 2 j + 1 R ( 1 + t ) ( n 1 ) E 2 d t 2 R · 2 j R ( 2 j R ) ( n 1 ) E 2 = 2 R ( 2 j R ) ( n 1 ) E 1 .
Thus, we obtain
U 3 j = 0 + A ( η n ) ( 9 E R ) n 1 R n 1 · 2 R ( 2 j R ) ( n 1 ) E 1 · ( k = 1 n 1 ( ω I 2 j + 2 R , E ( η k + 2 η n u k z k ) 1 R ω I R , E ( z k ) ) ) d z = j = 0 + A ( η n ) 9 E ( n 1 ) R n 1 2 2 R ( 2 j R ) ( n 1 ) E 1 · k = 1 n 1 ( ω I 2 j + 2 R , E ( 1 R ω I R , E ) ) ( η k + 2 η n u k ) .
By (18) and the condition 2 j + 2 R > R , we have
ω I 2 j + 2 R , E ( 1 R ω I R , E ) 6 E ω I 2 j + 2 R , E .
Thus,
U 3 j = 0 + A ( η n ) 9 E ( n 1 ) R n 1 2 2 R ( 2 j R ) ( n 1 ) E 1 k = 1 n 1 6 E ω I 2 j + 2 R , E ( η k + 2 η n u k ) .
Moreover, from
ω I 2 j + 2 R , E ( x ) = ( 1 + | x | 2 j + 2 R ) E 2 ( j + 2 ) E ω I R , E ( x ) ,
it follows that
U 3 j = 0 + A ( η n ) 9 E ( n 1 ) R n 1 2 2 R ( 2 j R ) ( n 1 ) E 1 2 ( j + 2 ) E ( n 1 ) · k = 1 n 1 6 E ω I R , E ( η k + 2 η n u k ) = j = 0 + 2 j A ( η n ) 9 E ( n 1 ) R n 1 2 2 R · R ( n 1 ) E 1 2 6 E ( n 1 ) 2 2 E ( n 1 ) k = 1 n 1 ω I R , E ( η k + 2 η n u k ) = 4 R · A ( η n ) ( 9 × 6 × 4 ) E ( n 1 ) R ( n 1 ) ( E 1 ) 1 2 k = 1 n 1 ω I R , E ( η k + 2 η n u k ) 4 R · A ( η n ) ( 36 × 6 ) E ( n 1 ) k = 1 n 1 ω I R , E ( η k + 2 η n u k ) .
Now, since E 100 n , we have
( n 1 ) E + ( n 1 ) ( p 1 ) ( n 1 ) E + ( ( n 1 ) ( p 1 ) + ( n + 1 ) ) 2 ( n 1 ) E + 2 + ( n 1 ) ( p 1 ) .
Thus, when
2 ( n 1 ) E + 2 + ( n 1 ) ( p 1 ) F ,
the inequalities (60), (62) and (64) hold simultaneously. Under this condition, recalling the definition of A ( η n ) as in (58), we obtain
J · ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z 12 R · A ( η n ) ( 36 × 6 ) E ( n 1 ) k = 1 n 1 ω I R , E ( η k + 2 η n u k ) = 12 · 9 E C 0 ( E , , E ) ( 4 n ) n 2 n E ( 36 × 6 ) E ( n 1 ) · ω I R , E ( η n ) k = 1 n 1 ω I R , E ( η k + 2 η n u k ) .
From (23), it follows that
ω I R , E ( η n ) k = 1 n 1 ω I R , E ( η k + 2 η n u k ) ω B R , E ( η · A Q T ) .
The inequality (25) implies that
ω B R , E ( η k + 2 η n u k , η n ) 6 n E ω B R , E ( η ) .
Hence, combining the above three inequalities, we get
J · ( 1 + | z n | R ) ( n 1 ) ( p 1 ) ω B R , F ( z ) d z 12 · 9 E C 0 ( E , , E ) ( 4 n ) n 2 n E ( 36 × 6 ) E ( n 1 ) 6 n E ω B R , E ( η ) .
By Stirling’s inequality
E ! 2 π E ( E e ) E e 1 12 E ,
we have
12 · 9 E C 0 ( E , , E ) ( 4 n ) n 2 n E ( 36 × 6 ) E ( n 1 ) 6 n E = 12 · 9 E ( 4 n ) n 2 n E ( 36 × 6 ) E ( n 1 ) max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n ( E ! ) 2 ( n 1 ) ( 14 n ) n E 6 n E max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n e n E ( ln ( 36 × 6 × 2 × 14 n ) + ln ( 6 n ) n ) + ln 12 + E ln 9 + n ln 4 n + 2 ( n 1 ) ln ( E ! ) max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n e n E ( 13 + ln n ) + 3 + 3 E + n ln 4 n + 2 ( n 1 ) ln ( 2 π E ( E e ) E e 1 12 E ) .
Moreover,
n E ( 13 + ln n ) + 3 + 3 E + n ln 4 n + 2 ( n 1 ) ln ( 2 π E ( E e ) E e 1 12 E ) n E ( 13 + ln n ) + 3 + 3 E + n ln 4 n + 2 n [ ln 2 π E + E ( ln E 1 ) + 1 12 E ] 2 n [ E 13 + ln n 2 + 1 + E + ln 4 n 2 + ln 2 π E + E ( ln E 1 ) + 1 12 E ] 2 n [ E ( 13 + ln n 2 + ln E + 3 ) ] 2 n E · 10 ln E = 20 n E ln E .
Thus,
12 · 9 E C 0 ( E , , E ) ( 4 n ) n 2 n E ( 36 × 6 ) E ( n 1 ) 6 n E max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E .
Let C 4 p = max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E . At this stage, we restate the definitions mentioned before as follows:
1.
C 4 p = max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E ;
2.
C m = max C ˜ 0 , , C ˜ 2 n ( ρ ( 2 ) ) n ( 30 n ) 3 n ;
3.
C 3 = C 4 C m 1 q ;
4.
C 2 = ( 2 6 n ) F p C 3 e 2 π ;
5.
C 1 = ( 1 + n 2 ) F p e 2 π C 2 .
Then we show that such a choice of C 1 guarantees the validity of (47). We have
C 3 = ( max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E ) 1 p ( max C ˜ 0 , , C ˜ 2 n ( ρ ( 2 ) ) n ( 30 n ) 3 n ) 1 q max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E p ( 30 n ) 3 n q ,
which shows that
C 2 ( 2 6 n ) F p e 2 π max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E p ( 30 n ) 3 n q ,
C 1 [ 6 n ( 2 + n ) ] F p e 4 π max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E p ( 30 n ) 3 n q ,
and
( 6 n ) E C 1 ( 6 n ) E ( 9 n ) F p e 4 π max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E p ( 30 n ) 3 n q max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E p ( 9 n ) F p e 4 π ( 6 n ) E ( 30 n ) 3 n .
Since E 100 n , we have
e 4 π ( 6 n ) E ( 30 n ) 3 n = e 4 π + E ln ( 6 n ) + 3 n ln ( 30 n ) e E ln ( 30 n ) = ( 30 n ) E .
Finally, we obtain
( 6 n ) E C 1 max C ˜ 0 , , C ˜ n E ( ρ ( E ) ) n E 20 n E p ( 9 n ) F p ( 30 n ) E .
Hence, C 1 is a constant satisfying (47). □

4. Conclusions

In this paper, we have established an explicit upper bound for the implicit constant in an alternate form of the 2 decoupling inequality on the n-dimensional truncated paraboloid. More precisely, for any p 2 , E 100 n , and
F 2 ( n 1 ) E + ( n 1 ) ( p 1 ) + 2 ,
we proved that the inequality
f L p ( ω B R , E ) C 0 Dec n ( R 1 , p , F ) Q f N 1 / R ( Q ) L p ( ω B R , E ) 2 1 / 2
holds for every function f with Fourier support in N 1 / R ( [ 0 , 1 ] n 1 ) and every cube B R R n , where the constant
C 0 = max { C ˜ 0 , , C ˜ n E } ( ρ ( E ) ) n E 20 n E p ( 9 n ) F p ( 30 n ) E
is completely explicit in terms of n, p, E, F, and the auxiliary functions η and M j .
Our result constitutes the first part of a larger project aimed at obtaining fully explicit decoupling estimates in R n , extending the two-dimensional work of Z.K. Li [11] to higher dimensions. The explicit control of constants obtained here is essential for number-theoretic applications such as Vinogradov-type mean value theorems, where the dependence of the decoupling constant on ϵ must be tracked precisely.

Author Contributions

Conceptualization, F.C. and G.B.; methodology, F.C. and G.B.; validation, G.B.; writing—original draft preparation, F.C.; writing—review and editing, S.W. and F.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

Special thanks go to Zane Kun Li for his insightful suggestions and the information about advances in Harmonic Analysis.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Bourgain, J.; Demeter, C. The Proof of the l2 Decoupling Conjecture. Ann. Math. 2015, 182, 351–389. [Google Scholar] [CrossRef] [Scilit]
  2. Pierce, L.B. The Vinogradov mean value theorem [after Wooley, and Bourgain, Demeter and Guth]. In Séminaire Bourbaki; Exposés 1120–1135; Societe Mathematique de France: Paris, France, 2019; Volume 2016/2017, pp. 479–564. [Google Scholar]
  3. Demeter, C. Fourier Restriction, Decoupling, and Applications; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
  4. Bourgain, J.; Demeter, C. Mean Value Estimates for Weyl Sums in Two Dimensions. J. Lond. Math. Soc. 2016, 94, 814–838. [Google Scholar] [CrossRef] [Scilit]
  5. Bourgain, J.; Demeter, C.; Guth, L. Proof of the Main Conjecture in Vinogradov’s Mean Value Theorem for Degrees Higher than Three. Ann. Math. 2016, 184, 633–682. [Google Scholar] [CrossRef] [Scilit]
  6. Deng, Y.; Germain, P.; Guth, L. Strichartz Estimates for the Schrödinger Equation on Irrational Tori. J. Func. Anal. 2017, 273, 2846–2869. [Google Scholar] [CrossRef] [Scilit]
  7. Demeter, C.; Germain, P. L2 to Lp Bounds for Spectral Projectors on the Euclidean Two-dimensional Torus. Proc. Edinb. Math. Soc. 2024, 67, 431–459. [Google Scholar] [CrossRef] [Scilit]
  8. Guth, L. Restriction Estimates Using Polynomial Partitioning II. Acta Math. 2018, 221, 81–142. [Google Scholar] [CrossRef] [Scilit]
  9. Gressman, P.T.; Guo, S.; Pierce, L.B.; Roos, J.; Yung, P. Reversing a philosophy: From counting to square functions and decoupling. J. Geom. Anal. 2021, 31, 7075–7095. [Google Scholar] [CrossRef] [Scilit]
  10. Herr, S.; Kwak, B. Strichartz Estimates and Global Well-posedness of the Cubic NLS on T2. Forum Math. Pi 2024, 12, 14–21. [Google Scholar] [CrossRef] [Scilit]
  11. Li, Z.K. Effective l2 Decoupling for the Parabola. Mathematika 2020, 66, 681–712. [Google Scholar] [CrossRef] [Scilit]
  12. Guth, L.; Maldague, D.; Wang, H. Improved Decoupling for the Parabola. J. Eur. Math. Soc. 2024, 26, 875–917. [Google Scholar] [CrossRef] [Scilit]
  13. Bourgain, J.; Demeter, C. A Study Guide for the l2 Decoupling Theorem. Chin. Ann. Math. Ser. B 2017, 38, 173–200. [Google Scholar] [CrossRef] [Scilit]
  14. Folland, G.B. Real Analysis: Modern Techniques and their Applications; John Wiley & Sons: Hoboken, NJ, USA, 1999. [Google Scholar]
  15. Grafakos, L. Classical and Modern Fourier Analysis; Prentice Hall & Sons: Upper Saddle River, NJ, USA, 2003. [Google Scholar]
  16. Stein, E.M. Harmonic Analysis; Princeton University Press & Sons: Princeton, NJ, USA, 1993. [Google Scholar]
  17. Johnson, W.P. The Curious History of Faà di Bruno’s Formula. Am. Math. Mon. 2002, 109, 217–234. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Bian, G.; Chen, F.; Wu, S. Explicit 2 Decoupling in Rn, Part I: Bounds for Constants in an Alternate Formulation. Axioms 2026, 15, 349. https://doi.org/10.3390/axioms15050349

AMA Style

Bian G, Chen F, Wu S. Explicit 2 Decoupling in Rn, Part I: Bounds for Constants in an Alternate Formulation. Axioms. 2026; 15(5):349. https://doi.org/10.3390/axioms15050349

Chicago/Turabian Style

Bian, Guomengchao, Feifei Chen, and Senlin Wu. 2026. "Explicit 2 Decoupling in Rn, Part I: Bounds for Constants in an Alternate Formulation" Axioms 15, no. 5: 349. https://doi.org/10.3390/axioms15050349

APA Style

Bian, G., Chen, F., & Wu, S. (2026). Explicit 2 Decoupling in Rn, Part I: Bounds for Constants in an Alternate Formulation. Axioms, 15(5), 349. https://doi.org/10.3390/axioms15050349

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop