1 Introduction
Let \Sigma\subset\R^3 be a compact smooth surface, with induced surface measure d\sigma. Its Fourier extension operator is
We allow smooth boundary. Positive curvature means that the second fundamental form is definite at every point, with the normal chosen on each chart so that the form is positive definite.
Theorem 1.1. Let \Sigma\subset\R^3 be a compact smooth positively curved surface, possibly with smooth boundary. For every 3<p<\infty, there is a finite constant C_{\Sigma,p} such that
for every complex-valued f\in L^p(\Sigma).
The theorem establishes the diagonal extension conjecture in three dimensions for positively curved surfaces. It includes the sphere, compact elliptic paraboloid patches, and general smooth elliptic graphs. The surface and the exponent are fixed throughout each estimate.
Background. The restriction problem originates in Stein’s work; the Tomas–Stein theory gives L^2(\Sigma)\to L^4(\R^3) for positively curved surfaces [19, 15]. The bilinear framework of Tao, Vargas, and Vega [18], Wolff’s cone estimate [22], and Tao’s paraboloid estimate [17] developed the role of wave packets and transverse interactions. Bennett, Carbery, and Tao’s multilinear estimates [1] and Bourgain–Guth’s approach [3] further connected these interactions to the linear problem.
Guth’s polynomial-partitioning argument established the bounded-data estimate for p>13/4 [7, Theorem 0.1]. Shayya obtained diagonal estimates in that range [14, Corollary 2.1(iii)]; see also Kim’s treatment [8, Theorem 1.2 and the following remark]. Wang’s broom method further improved bounded-data restriction for the truncated paraboloid [20, Theorem 1.4]. Wang and Wu proved the diagonal bound for p>22/7 on compact positively curved surfaces, including surfaces with boundary, using decoupling and two-ends Furstenberg inequalities [21, Theorem 0.2].
For the sphere and quadratic graphs, factorization gives a separate route from bounded-data estimates to diagonal estimates with an arbitrarily small increase in the exponent; see Bourgain [2] and Buschenhenke [4, Theorem 1.1 and Remark 1.6]. The argument here treats general smooth elliptic charts through the packet theorem’s full array formulation and the explicit phase continuation. The packet and maximal inputs play distinct roles: the former controls oscillatory coefficients, while the latter controls their positive tube density.
The compact paraboloid case also gives a consequence for free Schrödinger evolution. Let W^{s,p}(\R^2) denote the inhomogeneous Bessel-potential space with norm \|f\|_{W^{s,p}}=\|(I-\Delta)^{s/2}f\|_{L^p(\R^2)}.
Corollary 1.2 (Free Schrödinger local smoothing). For every 3<p<\infty and s>2-6/p, the free Schrödinger propagator, initially defined on Schwartz functions, extends boundedly from W^{s,p}(\R^2) to L^p(\R^2\times[0,1]):
The spacetime norm is global in space and local in time. Rogers’s necessary condition [13, Section 2] shows that the Sobolev threshold cannot be lowered. We deduce the corollary from the compact-frequency transfer of Lee, Rogers, and Seeger [10, Theorem 1.1] in Section 7.
A second consequence concerns local oscillatory integrals with phase N[x\cdot y+\psi(t;y)], where x,y\in\R^2, t\in\R, and the amplitude is smooth and compactly supported. Suppose D_y^2\partial_t\psi is definite and its time derivative is a scalar multiple of itself. A change of output variables then reduces the phase to a fixed elliptic graph. Corollary 7.1 gives the resulting L^p estimate with the scaling factor N^{-3/p} for every finite p>3. The additional phase condition is the translation-invariant form of Bourgain’s condition; we explain the straightening directly in Section 7, following the setting of Gao–Liu–Xi [5].
The proof of Theorem 1.1 uses two theorem inputs. The packet propagation theorem [11, Theorem 6.4] controls arbitrary finite complex coefficient arrays through an elliptic capacity, with coordinate masks permitted. The Kakeya maximal theorem [12, Theorem 1.1] controls nonnegative weighted tube concentration. We state both inputs in the forms used here and verify their hypotheses. The remainder of the proof gives the density conversion, the estimates for rough L^3 graph data, and the passage to general surfaces.
The argument. After fixing a graph chart, an explicit continuation places its phase in the class allowed by the packet theorem. The construction matches the quadratic Taylor data in a transition annulus of a continued spherical patch and preserves uniform ellipticity. It applies equally to boundary charts, where the graph extends smoothly and the datum is extended by zero.
The packet theorem gives a cubic sample estimate with a small spatial power loss and an elliptic-capacity factor. A decomposition according to the capacity of the remaining coefficients allows this factor to be summed using the positive weighted tube estimate. The latter follows from the Kakeya maximal theorem by duality; its direction and position formulation follows the classical weighted tube framework of Tao, Vargas, and Vega [18, arXiv version 1, Section 3].
To pass to L^3 data, we prove one joint estimate for a sparse family of balls. Removing a small union of frequency resonances makes the corresponding packet analyses almost orthogonal. The bound is uniform in the ball locations and in arbitrarily large separations. A covering of each level set then removes the spatial loss. This follows Tao’s sparse-ball strategy for epsilon removal [16]; see the detailed treatments in Bourgain–Guth’s appendix [3] and Kim’s appendix [8]. We prove the precise covering and summation needed for the present estimate.
The resulting graph bound has L^3 input and L^p output for every p>3. A finite chart decomposition, with the surface and physical-space Jacobians retained, gives Equation (1.1) by the finite-measure embedding L^p(\Sigma)\subset L^3(\Sigma).
Figure 1 records the two inputs and the successive reductions.
Figure 1: The two independent inputs meet in the sampled cubic estimate. The sparse-ball bound then supplies the common L^3 control needed for globalization and passage to the surface.
Dependence on the exponent. Let C_{\Sigma,p}^{\mathrm{best}} denote the operator norm in Equation (1.1). Write M(s)\ge1 for the constant in the Kakeya maximal estimate with loss \delta^{-s}, and let P_\Sigma(\kappa,\eta)\ge1 be the largest packet constant among the finitely many fixed chart and window setups used below. For 3<p\le4, put \theta=10^{-6}(p-3)^2. The proof gives
where C(\Sigma) is independent of p\in(3,4]. The two input theorems supply finite constants at each positive loss exponent. No rate for their growth is assumed, so Equation (1.3) records the elementary losses without asserting a polynomial bound in (p-3)^{-1}. For nonempty \Sigma, a fixed smooth datum also gives
Proposition 6.5 proves this comparison.
Conventions and organization. Write e(t)=\exp(2\pi i t). All functions and coefficient arrays may be complex-valued. Constants may depend on the fixed surface, charts, frequency supports, and windows; dependence on the small loss exponents is displayed through P and M. Section 2 fixes the local graph problem. The next sections give the packet interface, the density conversion, and the joint sparse-ball estimate. The global argument tracks the dependence on p, and Section 7 completes the transfer to \Sigma and proves the local-smoothing and oscillatory-integral consequences.
2 Local graphs and fixed parameters
We first explain the class of graph integrals to be estimated. Near each point of \Sigma, choose tangent coordinates and a normal in which the surface is a graph with positive definite Hessian. At a boundary point, a smooth parametrization up to the boundary extends to an open neighborhood of the parameter half-disk; this is the usual smooth-boundary convention [9, Chapter 1, pp. 27–28]. Projection onto the tangent plane has invertible differential there. The inverse function theorem on the extension therefore gives a graph on an open planar neighborhood, whose restriction parametrizes the original surface piece.
After shrinking a chart, Lemma 3.1 gives a fixed invertible affine change of ambient frequency coordinates in which the graph agrees locally with a phase \phi\in C^\infty(\R^2) in the precise continuation class of Theorem 3.4. In particular, this phase satisfies
The elementary arguments below use only Equation (2.1); the packet estimate also uses the continuation form verified in Lemma 3.1.
Fix a smooth nonnegative function \chi supported in a square centered at zero, such that
For example, start with a compactly supported bump positive on [-1,1]^2, and divide it by the square root of the sum of the squares of its integer translates. This denominator is smooth, positive, and periodic. Let D_{\mathrm f}\ge1 be a fixed side length for a square containing the support of \chi.
Write
A partition at scale one reduces each compactly supported graph integral to finitely many functions of the form
Here \nu_*\in\Z^2 is fixed and h\in L^3(\R^2) is supported in a fixed compact set Q_0. To see the reduction, write graph data g=\sum_{\nu_*}(g\chi_1^{\nu_*})\chi_1^{\nu_*}, using Equation (2.2); only finitely many terms meet \supp g. The extra copy of the window is included in h.
All constants for a fixed setup may depend on \phi,Q_0,\chi, D_{\mathrm f}, and \nu_*. These objects, and all label ranges used later, are chosen before the large scale or the small loss exponents vary. In particular,
on \R^2. Thus the velocity map U_\xi=-\nabla\phi(\xi) is bi-Lipschitz on each fixed bounded region and has bounded size there.
The final graph estimate controls Equation (2.3) by \|h\|_3. We record the precise surface Jacobians in Section 7.
3 The packet estimate and its phase class
We need a cubic bound for the samples obtained by synthesizing a finite packet array and analyzing it at a larger scale. The input array must remain arbitrary, since Section 4 splits it into coordinate subarrays. We first verify the precise phase requirement of the cited packet theorem: uniform convexity alone is not its stated hypothesis.
3.1 Continued phases and local changes of coordinates
The setup of [11, Section 6.1] starts with a small spherical graph and extends its phase smoothly to \mathbb R^2, with uniformly definite bounded Hessian and bounded derivatives of every order at least two. Its constants may depend on this fixed continuation, the fixed bounded frequency region, and the windows. The continuation is made by cutting off the difference from the quadratic Taylor polynomial. We shall use continuations of precisely this form: write
and, for a sufficiently small fixed \rho>0, set
Here \zeta is smooth, the product is extended by zero outside B(0,2\rho), and the resulting phase must satisfy Equation (2.1). No radiality is required of the cutoff.
Lemma 3.1 (Insertion of an elliptic graph). Every germ of a smooth graph with positive definite Hessian can be carried by an invertible affine transformation of \mathbb R^3 to a graph agreeing, on an open neighborhood, with a phase of the form in Equation (3.1). The phase, the neighborhood, and the affine transformation can all be fixed independently of the packet scales and of the exponents used below.
Proof. Choose a smooth cutoff \zeta_0 equal to one on B(0,\rho), supported in B(0,2\rho), and identically 1/2 on a neighborhood V of a point \xi_1 with \rho<|\xi_1|<2\rho. It can be chosen by rescaling a fixed cutoff with an annular plateau. The phase
has Hessian I+O(\rho^2): the remainder q_s-Q_s and its derivatives of orders zero, one, and two are respectively O(\rho^4), O(\rho^3), and O(\rho^2) on the support of the cutoff. Fix \rho small enough that q'' is positive definite everywhere.
After translating the target base point, let its height function be h_0 near zero and put H=h_0''(0)>0 and B=q''(\xi_1)>0. Choose an invertible real matrix A with A^{\mathsf T}HA=B; for example, A=H^{-1/2}B^{1/2}. Define, near \xi_1,
Thus \psi and q have the same value, gradient, and Hessian at \xi_1. This change of graph is induced by an invertible affine map of ambient frequency space: its base part is x\mapsto \xi_1+A^{-1}x, and its height part is addition of an affine function of the new base coordinates.
Let \vartheta\in C_c^\infty(B(0,2)) equal one on B(0,1) and take 0\le\vartheta\le1. For a small fixed \epsilon>0 put
Choose \epsilon so that its support is contained in V and the target graph is defined there. Taylor’s theorem and the agreement of the two-jets give
Consequently \phi=q+R_\epsilon remains uniformly convex for sufficiently small \epsilon and agrees with \psi on B(\xi_1,\epsilon). It equals Q_s outside a compact set, so all of its derivatives of order at least two are bounded.
To verify the required continuation form, observe that D=q_s-Q_s is strictly positive for 0<|\xi|<1. Shrink V, if necessary, so that D\ge d_0>0 there. The function R_\epsilon/D, extended by zero outside V, is smooth. Set
On the perturbation support, \zeta_0=1/2 and |R_\epsilon/D|\le C\epsilon^3/d_0. Choosing \epsilon smaller makes this last quantity at most 1/4. Hence 0\le\widetilde\zeta\le1, with the same inner and outer support properties as \zeta_0, and \phi=Q_s+\widetilde\zeta(q_s-Q_s). Every choice was made using only the fixed target graph.
In what follows, the phases to which the cited packet theorem is applied are chosen as in Lemma 3.1. Although the inserted graph lies in the transition annulus, the packet theorem allows arbitrary frequency labels in a fixed bounded region. In particular, those labels need not lie in the spherical region B(0,\rho): [11, Definition 6.3] imposes no such restriction, and its single-step maps act on arbitrary finite input arrays. All windows meeting the inserted graph, and the terminal windows used below, can therefore be included in one fixed bounded frequency region. The constants may depend on the chosen phase, including its higher derivative bounds.
3.2 Frames and the capacity norm
We use the standard frequency and spatial localization of wave packets; see Tao [17, arXiv version 2, Section 4] and the Fourier-series construction of Guo, Oh, Wang, Wu, and Zhang [6, arXiv version 1, Section 4.1]. Square windows give the exact identities below, with the normalization needed for our sample sum.
Fix a dyadic N\ge2 and put \delta=N^{-1} and U_\nu=-\nabla\phi(\nu). For a dyadic factor 1\le m\le N let
Partition [0,1) into intervals I of length r, with left endpoints t_I. At this scale, the indices are
Using the windows fixed in the local setup, define
Synthesis is initially defined for finite arrays and then extended continuously to \ell^2.
Lemma 3.2 (Exact frame identities). For every f\in L^2(\mathbb R^2),
Proof. Since N^2w\theta=1, the vectors N^2z run through (D_{\mathrm f}\theta)^{-1}\mathbb Z^2. For each fixed \nu, Equation (3.3) is the Fourier coefficient array of f\chi_\theta^\nu e(N^2t_I\phi) on a square of side D_{\mathrm f}\theta. Parseval and Fourier inversion give
and, after synthesis, f(\chi_\theta^\nu)^2. Sum over \nu and use \sum_\nu(\chi_\theta^\nu)^2=1. The norm of synthesis follows from \mathsf S_{m,I}=(D_{\mathrm f}\theta)^{-2}\mathsf P_{m,I}^*. These identities first hold for finite partial Fourier sums in L^2 and then for their limits.
For 0<\kappa<1/10, let E be a centered closed ellipse with ordered semiaxes L\ge a>0, of any orientation, and write W_\kappa(E)=L^{1+\kappa}a^{1-\kappa}. For a finite array c in one bin at the scale (\theta,r,w) define
The translations u,v\in\mathbb R^2 are independent, and there is no upper restriction on either semiaxis. On each finite index set let
The domination in this infimum is coordinatewise.
Lemma 3.3 (The atomic norm controls the sample sum). The function A_{\theta,r} is a norm on every finite coordinate space, is monotone under absolute coordinatewise domination, and is contracted by coordinate masks. Moreover,
Proof. The disk of radius \theta, with its two translations chosen independently, contains any prescribed index in both tests. Its weight is \theta^2, so K_{\theta,r}(c)\ge\|c\|_\infty^2 and
For every atomic domination of c, the triangle inequality in \ell^3 now gives
Taking the infimum and summing its cube over bins with weight r proves Equation (3.8). A singleton has cost w^{2/3}|c_{\nu,z}|, so the infimum is finite; the displayed lower bound makes it positive away from zero. Homogeneity, subadditivity, and absolute monotonicity follow directly from the definition, as does contraction under masks.
At the initial scale m=1 there is one bin, [0,1), and we use the notation
In particular, G_{\delta,1}(d)^3=m(d)\mathcal K_\kappa(d)^{1/2}.
3.3 The cited theorem and its specialization
A single-step map T_m synthesizes at factor 1, analyzes in every factor-m time bin, and then applies any coordinate mask. It uses the full matrix between its input and retained output indices. The admissible complexity convention of [11, Definition 6.3] fixes a finite B and a bounded frequency-label region, requires m\le N\le m^B and position labels of size at most m^B, and allows arbitrary finite arrays on those indices. The phase and window constants are fixed throughout this class.
Theorem 3.4 (Packet propagation [11, Theorem 6.4, Equation (6.8)]). For a fixed phase as in Equation (3.1), every fixed admissible complexity range, 0<\kappa<1/10, and \eta>0, there is a finite constant C such that
for all its single-step maps and all its finite complex input arrays. The source also permits A_{\delta,1}(d)^3 on the right. The constant may depend on \kappa, \eta, the complexity range, the phase, and the windows.
In particular, suppose the initial labels \nu\in\delta\mathbb Z^2 and z\in D_{\mathrm f}^{-1}\delta\mathbb Z^2 lie in fixed bounded sets. Define
where \nu'\in\mathbb Z^2, z'\in D_{\mathrm f}^{-1}N^{-2}\mathbb Z^2, and j=0,\ldots,N^2-1. Retain any output coordinate mask for which \nu',z' lie in fixed bounded sets. There is a finite P(\kappa,\eta)\ge1, depending on these fixed sets, the phase, and the windows, such that, for every dyadic N\ge2 and 0<\eta\le1,
The sum is over the retained coordinates.
Specialization of the cited theorem. Set m=N. The scales in Equation (3.2) become
Thus the companion’s synthesis and analysis operators are exactly the displayed operators, with its window constant L_{\mathrm f} equal to our D_{\mathrm f}. The initial gauge is exactly the last expression in Equation (3.13), and Equation (3.8) gives
All bounded label sets fit one fixed admissible complexity range for sufficiently large N, since m=N; the finitely many smaller dyadic scales may be included by enlarging the constant. The bound at any such fixed scale follows from finite-dimensional boundedness and \mathcal K_\kappa(d)\ge\|d\|_\infty^2. Applying Equation (3.10) proves Equation (3.13). This argument uses arbitrary input arrays, so it also applies after any restriction of their support.
Theorem 3.4 is the additional oscillatory input. Its source proves Equation (3.10) in [11, Section 7]; no rate for the dependence of P(\kappa,\eta) on its small parameters is asserted here.
4 From packet capacity to weighted tubes
We first obtain a positive tube estimate from the Kakeya maximal theorem. We then use a decomposition by capacity to apply Theorem 3.4 to an arbitrary initial array without imposing a condition on the sizes of its coefficients. Throughout this section, the frequency and position label bounds are fixed as in the packet setup. The positive tube-duality formulation follows the classical mixed-norm framework of Tao, Vargas, and Vega [18, arXiv version 1, Section 3, Equation (21)]; the capacity decomposition below is proved here.
For an initial array d=(d_{\nu,z}), define
All integrals of tube functions use Lebesgue measure dX\,dt. In particular, |T_{\nu,z}|=\pi\delta^2 and
For clarity, the precise maximal operator used below is
Thus \mathcal T_\rho(a,\omega) is a circular cylinder of length one and volume \pi\rho^2. The companion theorem [12, Theorem 1.1] states that for every s>0 there is a finite constant M(s), which we enlarge to be at least one, such that for every g\in L^3(\mathbb R^3),
Here S^2 carries its usual surface measure. We will use only 0<s\le1.
Lemma 4.1 (Weighted Kakeya estimate). There are fixed constants C and N_0 such that for every dyadic N\ge N_0, every initial array d, and every 0<s\le1,
The constants C,N_0 depend only on the fixed geometric setup.
Proof. By Equation (2.4), the velocity map is bi-Lipschitz on the fixed frequency-label range, where it is bounded. The map U\mapsto (U,1)/\sqrt{1+|U|^2} is bi-Lipschitz on this bounded range: its inverse is \omega\mapsto\omega'/\omega_3, whose derivative is bounded where \omega_3 is bounded away from zero. Thus the directions
are separated by a fixed positive multiple of \delta. Choose spherical caps \Omega_\nu centered at \omega_\nu with radius c_1\delta, where the fixed c_1>0 is small enough that these caps are disjoint. Their surface areas satisfy c_2\delta^2\le |\Omega_\nu|\le C_2\delta^2.
The center segment of T_{\nu,z} has Euclidean length \sqrt{1+|U_\nu|^2}, bounded by a fixed constant. For each \omega\in\Omega_\nu, its distance from the line through (z,0) in direction \omega is O(\delta). Adding the horizontal cross-section of radius \delta preserves this bound. The projection of the entire tube onto that line is an interval of bounded length. Cover that interval by a bounded number of intervals of length one. It follows that T_{\nu,z} is contained in at most C_3 cylinders \mathcal T_{C_4\delta}(a,\omega), where C_3 and C_4\ge1 are fixed. In particular, for every g\in L^3(\mathbb R^3),
Averaging over \Omega_\nu, multiplying by |d_{\nu,z}|^2, and summing gives
Set B_d=\sum_\nu b_\nu(d)\mathbf1_{\Omega_\nu}. Disjointness of the caps gives
Choose N_0 so that C_4\delta<1. Hölder’s inequality on S^2 and Equation (4.3) now yield
We used (C_4\delta)^{-s}\le\delta^{-s}, so the displayed constant is independent of s. Duality between L^{3/2} and L^3, followed by taking the power 3/2, proves Equation (4.4). The sum over positions causes no loss because K_\rho already takes the supremum over cylinder locations.
The next observation compares a single ellipse test with the tube mass. Recall that E is a centered ellipse with semiaxes L\ge a\ge\delta, and
If a nonzero coordinate subarray q of d is supported on U_\nu\in u+E, z\in v+E, then for 0\le t\le1 the horizontal support of H_q(\cdot,t) lies in
Indeed, B(0,\delta)\subset E, and the convexity and central symmetry of E imply E+tE=(1+t)E. Therefore |\operatorname{supp}H_q|\le9\pi La. Equation (4.2) and Hölder’s inequality give
The bound is uniform in the eccentricity L/a, in the independent translations u,v, and in \kappa>0.
Lemma 4.2 (Decomposition by capacity). Let d be a nonzero finite initial array, and let n=\#\operatorname{supp}d. For every 0<\kappa<1/10, there is a decomposition into coordinate subarrays with pairwise disjoint supports,
such that
Both constants are absolute and independent of the nonzero coefficient sizes and of \kappa.
Proof. Write D=\max_{\nu,z}|d_{\nu,z}|^2>0. A disk of radius \delta, independently translated to a prescribed velocity and position, is an admissible test with weight \delta^2. On the other hand, every test has W_\kappa(E)\ge\delta^2. Hence
Capacity is monotone under restriction to a subset of coordinates.
Put A=D/n^2. The cost of any remaining array with capacity at most A is controlled by the contribution of a largest original coefficient to the tube integral. Indeed, any coordinate subarray r with \mathcal K_\kappa(r)\le A satisfies
An original entry whose squared modulus is D contributes D\mathbf1_{T_{\nu,z}} to H_d, whence \int H_d^{3/2}\ge\pi\delta^2D^{3/2}. Thus the cost of any such remainder is controlled by \pi^{-1}\int H_d^{3/2}, independently of which entries remain.
Start with remainder r_1=d. Whenever \mathcal K_\kappa(r_j)>A, choose an ellipse test whose density is at least half of that supremum. Let q_j contain all nonzero coordinates of r_j selected by that test, write E_j for its ellipse, and put
Such a test exists without assuming that the supremum is attained. It selects at least one nonzero entry, so the process terminates after at most n removals. Denote the terminal remainder by r_*; then \mathcal K_\kappa(r_*)\le A, including the possibility r_*=0.
We group the removed bundles by the capacity of the remainder from which they were selected. This controls the capacity of each group by its first remainder, while leaving only logarithmically many groups. For each integer k\ge0, set \lambda_k=2^kA, and group together all q_j for which
Let d_k be the union array at this level, omitting empty levels. The array d_k is a coordinate restriction of the remainder at the first removal in that level. Therefore \mathcal K_\kappa(d_k)<2\lambda_k. Every bundle at this level has \rho_j\ge\lambda_k/2, so additivity of m gives
Use Equation (4.5) for each selected test. Since the q_j are disjoint coordinate subarrays, their tube functions sum to a function bounded by H_d. For nonnegative numbers, \sum_j x_j^{3/2}\le(\sum_jx_j)^{3/2}. Consequently
The stopping estimate applies to r_*. Adding its cost to Equation (4.8) proves Equation (4.6).
Finally, at every removal the capacity lies in (A,nD], by monotonicity and Equation (4.7). The ratio of these endpoints is n^3, so there are at most 1+\lfloor3\log_2 n\rfloor occupied dyadic levels. Including the nonzero remainder gives J\le C\log(2+n). If n=1, then \mathcal K_\kappa(d)=D=A; the process makes no removal and the remainder alone gives the conclusion. No lower bound on the smallest coefficient has been used.
Proposition 4.3 (Discrete critical estimate). Let c be the terminal coefficient array obtained from d by the synthesis and sampling map of Theorem 3.4, with any fixed permitted output mask. For every sufficiently large dyadic N, 0<\kappa<1/10, 0<\eta\le1, and 0<s\le1, put \gamma_0=10\kappa+\eta+3s/2. Then
The constant C and the lower threshold for N are independent of \kappa,\eta,s. Their dependence is only on the fixed phase, windows, and label bounds; all additional parameter dependence is contained in P(\kappa,\eta) and M(s).
Proof. There is nothing to prove if d=0. Otherwise use the decomposition in Lemma 4.2, and let c^{(i)} be the terminal array of d^{(i)} with the same output mask. The sampling map is linear, so c=\sum_i c^{(i)}. The triangle inequality in \ell^3, Hölder’s inequality for the finite sum over i, and Theorem 3.4 give
There are O(N^2) initial frequency labels and O(N^2) initial position labels in the fixed bounded ranges, so n\le C N^4. It follows that
Insert Lemma 4.1 and use \delta^{-3s/2}=N^{3s/2} to obtain Equation (4.9). Every coordinate restriction used above obeys the same label bounds as d, so the same packet constant P(\kappa,\eta) applies to every piece.
5 Joint estimates on sparse balls
The factor N^{\gamma_0} in Proposition 4.3 is a small loss on a bounded region. To remove it later, we need an estimate for many distant regions with a single data norm on the right. The directions in which two translations fail to oscillate are confined to a small frequency set. Discarding that set costs little in L^\infty; the remaining translations are almost orthogonal at the initial packet scale. This joint estimate supplies the input to the sparse-ball strategy for removing a spatial loss [16, 3, 8]; we prove the required estimate for L^3 data with the precise separation and uniformity below.
Proposition 5.1 (Sparse balls). There is a constant \mu_0\in(0,1) depending only on the fixed graph setup with the following property. Suppose that h is supported in Q_0, \|h\|_3\leq1, and 0<\mu\leq\mu_0. Let \mathcal B be a finite family of balls of common radius R such that
where x_B denotes the center of B. Choose a dyadic integer N with 4R\leq N^2<16R. For 0<\kappa<1/10 and 0<\eta,s\leq1, put \gamma_0=10\kappa+\eta+3s/2. Then
The constant C and the threshold \mu_0 are independent of \kappa,\eta,s, of the centers, and of their maximum separation.
Proof. Write \delta=N^{-1} and D=D_{\mathrm f}. Every window \chi_\delta^\nu meeting Q_0 lies in a fixed compact neighborhood Q_1 of Q_0, since \delta\leq1. Fix
The initial spatial labels will satisfy |z|\leq Z and the terminal spatial labels |z'|\leq1. Thus all label bounds used in Proposition 4.3 are fixed independently of the small exponents. Throughout the proof we decrease \mu_0, if necessary, only in terms of this fixed setup. In particular, we may require N to exceed any fixed lower threshold needed below. The hypotheses give
whenever H is the separation of two distinct centers.
Removing resonant frequencies. Set a_B=x_B-(0,0,N^2/2). For each pair of distinct balls write a_B-a_{\widetilde B}=(q,s_0)\in\mathbb R^2\times\mathbb R and H=|(q,s_0)|. Its resonant set is
If this set is nonempty, then
so |s_0|\geq H/[2(G+1)] for sufficiently small \mu_0. For two points of \Omega_{B,\widetilde B}, Equation (2.4) gives
Consequently each resonant set has area at most C\mu^{40}. The union \Omega over all pairs therefore has area at most C\mu^{24}. Define h_*=h\mathbf1_{Q_0\setminus\Omega}, and let F_* be the extension defining F with h replaced by h_*. By Hölder’s inequality,
The powers 20, 40, and 100 provide ample room both for this discarded mass and for the phase estimates below; their precise values are not essential.
A joint bound for the initial coefficients. Let
For u\in\mathcal U and B\in\mathcal B define
Only angular windows meeting Q_0 need be retained. We claim that, uniformly in u,
If h_*\chi_\delta^\nu=0 almost everywhere, the claim is immediate. Otherwise choose a point \xi_g\in\Gamma_\nu\cap(Q_0\setminus\Omega). For this \nu, define the operator on unrestricted L^2(\mathbb R^2) by
We will apply it to f=h_*\mathbf1_{\Gamma_\nu}. This enlargement of the operator domain is useful: the kernel of T_\nu T_\nu^* has the smooth amplitude (\chi_\delta^\nu)^2, with no indicator of the excised set.
For a single ball block, Parseval’s identity on the square of side D\delta containing \Gamma_\nu gives
Here the full spatial sum is understood before its restriction to |z|\leq Z; its Fourier frequencies are N^2z\in(D\delta)^{-1}\mathbb Z^2. It follows that each diagonal ball block of T_\nu T_\nu^* has operator norm at most C\delta^2.
For distinct B,\widetilde B, an entry of this Gram operator is
To estimate it, put \xi=\nu+\delta v and denote the resulting phase by \Psi(v). Let
The direction v_0 is defined because \xi_g avoids every resonant set. On the entire support of the smooth amplitude \chi(v)^2,
For Equation (5.6), the two errors relative to H\mu^{20} are at most C\mu^{30} and 32Z\mu^{20} by Equation (5.2); their sum is at most 1/2 after fixing \mu_0. Equation (5.7) follows from the bounded higher derivatives of \phi and \delta\mu^{-20}\leq\mu^{30}/2.
Repeated integration by parts in the fixed direction v_0 now gives, for each fixed integer k\geq1,
For completeness, use the operator (2\pi iD_{v_0}\Psi)^{-1}D_{v_0} on the exponential. The lower bound for D_{v_0}\Psi and the higher derivative bounds imply that each fixed directional derivative of (D_{v_0}\Psi)^{-1} is O_k(\Lambda^{-1}). Applying the adjoint k times to the fixed smooth bump therefore costs O_k(\Lambda^{-k}). No upper bound on the first derivative is required. In particular, these constants remain uniform as H becomes arbitrarily large: the lower bound and the higher derivative bounds carry the same factor H.
There are at most C_ZN^2 retained spatial labels in each ball block. Thus every row and column of the off-diagonal block matrix has at most C_Z\mu^{-8}N^2\leq C_ZN^3 entries. Taking k=4 in Equation (5.8) and applying the row and column sum bound for the \ell^2 operator norm shows that its norm is at most C\delta^2. Together with the diagonal block estimate, this gives \|T_\nu\|_{2\to2}^2\leq C\delta^2. Applying it to h_*\mathbf1_{\Gamma_\nu} proves Equation (5.5).
Since the windows have bounded overlap and |\Gamma_\nu|\leq C\delta^2, Hölder’s inequality gives the precise power needed for Proposition 4.3:
Reconstruction and the discarded spatial tail. Let d^{B,u} now denote the finite array in Equation (5.4) restricted to |z|\leq Z. Apply the synthesis and sampling map to this array, retaining only \nu'=\nu_*, |z'|\leq1, and 0\leq j<N^2. Write the resulting array as c^{B,u}_{z',j}. We next justify, uniformly in B,u,z',j,
To do so, write \widehat d^{B,u} for the initial analysis array with the spatial grid untruncated. Lemma 3.2 at the initial scale gives
The same lemma gives the exact squared-mass identity
These statements require only h\in L^2(Q_0), which follows from the assumed L^3 bound and compact support. In particular, the possibly very large center modulation does not affect the bound.
A matrix entry from an omitted |z|>Z to a retained output is
After the substitution \xi=\nu+\delta v, the prefactor is D^{-2}, the amplitude has uniformly bounded smooth derivatives, and the derivative of the phase in the direction -z/|z| is at least
All phase derivatives of order at least two are bounded uniformly, because j\delta^2\leq1. The same integration by parts argument therefore gives
There are O(N^2) angular labels, and on the spatial mesh D^{-1}N^{-1}\mathbb Z^2,
Consequently each discarded part of a matrix row has squared \ell^2 norm at most C_kN^{4-2k}. By Equation (5.12), its pairing with \widehat d^{B,u} is at most C_kN^{1-k}. Taking k=4 proves Equation (5.10). One may justify all infinite sums by the L^2 convergence in Equation (5.11); the tail pairing is also absolutely convergent by Cauchy–Schwarz. Thus neither the data nor the sharp excision boundary has been differentiated.
Summing samples and filling the balls. Apply Proposition 4.3 to each retained array and sum over B. Equation (5.9) cancels its factor N^6 exactly and gives
There are O(N^4) terminal spatial labels and N^2 times per ball, so the total number of samples is O(\mu^{-8}N^6)=O(N^7). The cubed errors from Equation (5.10) sum to at most CN^7N^{-9}=CN^{-2}. Using |a+b|^3\leq4(|a|^3+|b|^3) and P,M\geq1, we obtain
uniformly for u\in\mathcal U.
Integrating in the common offset u turns the sum for each ball into an integral over the disjoint half-open cells
These cells cover B. Indeed, for y\in B set r=y-a_B; then
The lower corner \ell' of its horizontal cell in D^{-1}\mathbb Z^2 satisfies |\ell'|\leq N^2/4+\sqrt2/D<N^2 for the fixed large N under consideration. Hence z'=\ell'/N^2 is a retained label, and j=\lfloor r_3\rfloor is one of the retained times. The change of variables has Jacobian one; the offset domain has fixed volume D^{-2}. Equation (5.14) therefore implies
On \{|F|>\mu\}, Equation (5.3) gives |F_*|>\mu/2. Chebyshev’s inequality now proves Equation (5.1).
All choices made in this proof involve only fixed geometric constants and fixed orders of differentiation. Thus \mu_0 is independent of \kappa,\eta,s, as asserted.
6 Global bounds and exponent dependence
To apply Proposition 5.1 globally, we cover each superlevel set by a controlled number of sparse families. The L^4 and gradient bounds below control the number of occupied unit cubes; slow growth of local point counts then selects the radii without a diameter bound.
We retain the fixed graph, support, and window from the preceding sections. All constants in this section, except for the displayed dependence on the small exponents, depend only on that fixed setup. The elementary estimates below use only Equation (2.1). The global estimate for 3<p\leq4 additionally uses Proposition 5.1, and hence the packet input in Theorem 3.4.
6.1 Elementary bounds and the number of occupied cubes
Lemma 6.1 (Basic graph estimates). Let g\in L^2(\mathbb R^2) have compact support, and let
If \phi''\geq cI on \mathbb R^2, then
In particular, for F=E_\phi(h\chi_1^{\nu_*}) with h supported in Q_0, there is a fixed C_{\mathrm b}\geq1 such that
Proof. Let \lambda be the finite complex measure on the graph of \phi whose density in base coordinates is g. For v\in C_c^\infty(\mathbb R^3), Cauchy–Schwarz gives
Put m=\xi+\xi' and w=(\xi-\xi')/2; this linear change has absolute Jacobian one. Write w=r\omega, where r>0 and \omega\in S^1, and set
Uniform convexity implies
Thus H_{m,\omega} is strictly increasing for r>0, and the substitution s=H_{m,\omega}(r) yields
The omitted set r=0 has measure zero. Consequently \lambda*\lambda has an L^2 density with norm at most (\pi/c)^{1/2}\|g\|_2^2, by the L^2 representation theorem. Its Fourier transform is G(-\,\cdot)^2 in the sense of tempered distributions. Plancherel therefore gives Equation (6.1); this reasoning applies to the stated rough data and does not assume the convolution has a density in advance.
For g=h\chi_1^{\nu_*}, compact support and Hölder’s inequality bound \|g\|_2 by a fixed multiple of \|h\|_3. Furthermore
Differentiation under the integral is valid because the integrands are supported in a fixed compact set. Another application of Hölder’s inequality proves Equation (6.2).
For the covering argument, normalize \|h\|_3\leq1 and write
The half-open cubes k+[0,1)^3, k\in\mathbb Z^3, form a partition. Call such a cube occupied if it meets A_\mu.
Lemma 6.2 (Finite occupancy). There is a fixed C_X\geq1 such that at most C_X\mu^{-7} unit cubes are occupied. In particular, if \mu\leq C_X^{-1}, one can choose one point of A_\mu in each occupied cube to obtain a finite set X satisfying \#X\leq\mu^{-8}.
Proof. First take any finite collection \mathcal Q of occupied cubes and choose x_Q\in Q\cap A_\mu for each of them. By Equation (6.2), on B(x_Q,r_\mu), where r_\mu=\mu/(2C_{\mathrm b})\leq1/2, one has |F|>\mu/2. These balls have overlap at most 125: if a point belongs to one of them, its center lies within distance one, and at most 5^3 unit lattice cubes can contain such centers. Separation of the selected points is not required. Therefore
For example, one may take C_X=\max\{1,12000C_{\mathrm b}^7/\pi\}. This bound holds for every finite collection of occupied cubes. An infinite collection would have finite subsets of arbitrarily large cardinality, a contradiction. Thus the full collection is finite with the same bound. Finally C_X\mu^{-7}\leq\mu^{-8} when \mu\leq C_X^{-1}.
6.2 A multiscale cover without a diameter bound
The finite-growth and coloring argument below is the covering step of the sparse-ball method; compare Bourgain–Guth [3, arXiv version 3, Appendix, Lemma A.2]. We retain explicit scale choices to track the dependence on the output exponent.
Fix once and for all a number \mu_0>0 that is no larger than the threshold in Proposition 5.1, C_X^{-1}, and 1/2. In particular, for 0<\mu\leq\mu_0 we have
This choice is independent of all small exponents below.
Lemma 6.3 (Sparse covering). Let 0<\tau\leq1, 0<\mu\leq\mu_0, and let X be the set in Lemma 6.2. Set
The union of the occupied cubes is covered by at most
families of balls. Each family has at most \mu^{-8} balls, all of radius R=4R_j for some 0\leq j<J, and its centers are separated by at least \mu^{-40}R. For the dyadic N chosen in Proposition 5.1,
Proof. If X is empty there is nothing to cover. Otherwise, using open balls throughout, set
For each x there is an index 0\leq j<J with
Indeed, failure at every index would imply n_J(x)>\mu^{-\beta J}n_0(x)\geq\mu^{-\beta J}>\mu^{-8}, since \beta J>8, contrary to \#X\leq\mu^{-8}. Assign each x one such index j and the unique integer k\geq0 for which
There are at most J(1+8\log_2(1/\mu)) nonempty groups with a common pair (j,k).
In one group, choose a maximal pairwise disjoint collection of the open balls B(x,R_j), and denote its centers by Y. The collection is finite. Each unselected ball intersects a selected one, so every center in the group is within distance 2R_j of a point of Y. A point of the unit cube containing that center is within a further distance \sqrt3. Since R_j\geq\mu^{-100}, the balls \{B(y,4R_j):y\in Y\} cover all cubes assigned to the group.
Make a finite graph on Y, joining distinct x,y when |x-y|<R_{j+1}/2. For a fixed vertex x, the original balls B(y,R_j) of all its neighbors are disjoint and lie in B(x,R_{j+1}): Equation (6.3) gives R_j<R_{j+1}/2. Each neighbor ball contains at least 2^k points of X, whereas Equation (6.7) gives
The degree of x is therefore less than 2\mu^{-\beta}. A greedy coloring uses at most 3\mu^{-\beta} colors. Centers of the same color are separated by at least R_{j+1}/2, and
by Equation (6.3). Each color thus supplies a family satisfying the separation condition, with at most \#X\leq\mu^{-8} balls and R=4R_j\geq\mu^{-100}.
Multiplying the group and color counts proves Equation (6.5). A dyadic N with 4R\leq N^2<16R exists, and satisfies
The argument uses neither the absolute locations of the points nor the diameter of X. In particular, different clusters may be arbitrarily far apart. The use of open balls also resolves boundary cases: unselected balls meet selected balls by maximality, and equality in the graph’s distance threshold leaves the desired weak separation inequality intact.
6.3 Integration of the distribution bound
Theorem 6.4 (Global graph estimate). Fix a phase and window setup for which Theorem 3.4 and Proposition 5.1 apply. For 3<p\leq4, put
There is a constant C, independent of p in this interval, such that
for all h\in L^3 supported in Q_0. For 4<p<\infty, Equation (6.2) alone gives \|E_\phi(h\chi_1^{\nu_*})\|_p\leq C_{\mathrm b}\|h\|_3.
Proof. By homogeneity it suffices to take \|h\|_3\leq1. In Proposition 5.1 choose \kappa=\eta=s=\theta. These choices lie in the permitted parameter ranges, and
For J in Equation (6.4), we have
Consequently the scale in every family furnished by Lemma 6.3 satisfies
Applying Proposition 5.1 to each family and summing over the cover yields, for 0<\mu\leq\mu_0,
Here the colors cost \mu^{-\beta}=\mu^{-\tau/4}, while the scale factor costs at most \mu^{-\tau/4}. The group count contributes one factor of J(1+\log(1/\mu)), and the logarithm squared in Proposition 5.1 contributes the other two. All constants and \mu_0 are independent of \tau.
The layer-cake identity, valid by Tonelli even before finiteness of the norm is known, is
For its portion below \mu_0, Equation (6.11) and p=3+\tau reduce the needed integral to
For example, the substitution u=\log(1/\mu) turns the integral into \int_0^\infty e^{-\tau u/2}(1+u)^3\,du, which gives the displayed identity by integrating each monomial. Since p\leq4 and J^3\leq34^3\tau^{-3}, the small-level contribution is at most C P(\theta,\theta)M(\theta)^{3/2}\tau^{-7}.
For the remaining levels, again by Tonelli,
This is uniform for 3<p\leq4 and is absorbed into the previous bound because P,M\geq1 and \tau\leq1. Taking the pth root and restoring homogeneity proves Equation (6.9). If p>4, directly use
The factor \tau^{-7} explicitly records the elementary loss removal argument. The assumptions provide finite constants P(\theta,\theta) and M(\theta), but do not provide rates for them as \theta\downarrow0. Equation (6.9) therefore asserts no polynomial upper bound in (p-3)^{-1} for the full extension constant.
6.4 A necessary divergence at the endpoint
Proposition 6.5 (Lower bound for the best constant). For every nonempty compact smooth surface \Sigma in the stated class there is c_\Sigma>0 such that its best extension constant satisfies
This conclusion does not use the Kakeya or packet estimates.
Proof. Choose a nonempty interior chart; a nonempty smooth surface with boundary also has such a chart. Write it in the affine graph form
where L is invertible, and write d\sigma=J_\Sigma(\xi)\,d\xi on this chart. Take a fixed nonzero g\in C_c^\infty(D) and define f(\Psi(\xi))=g(\xi)/J_\Sigma(\xi) on the chart, with f=0 elsewhere. This is a smooth surface datum with
Let
Horizontal Plancherel and its derivative identity give, for t\geq0,
where one may take B_g=2(2\pi)^{-2}\|\nabla g\|_2^2+2\|g\nabla\phi\|_2^2>0. Set K=\max\{1,(2B_g/A)^{1/2}\}. The integral outside the disk |y'|<K(1+t) is at most B_g/K^2\leq A/2, so at least A/2 of the squared norm lies inside that disk. Hölder’s inequality on the disk implies
uniformly for 3\leq p\leq4, with the explicit positive choice
Integrating Equation (6.14) over t\geq0 yields \|G\|_p^p\geq c_g/(p-3).
The affine coordinates introduce exactly the factors
Hence, on setting d_g=|\det L|^{-1}c_g>0, we obtain
This proves Equation (6.13), with every choice of chart and datum fixed independently of p.
7 Surface estimates and consequences
7.1 Passage to the surface
We now deduce Theorem 1.1 from Theorem 6.4. Cover \Sigma by finitely many sufficiently small charts. By Lemma 3.1, after fixed affine normalizations each chart lies in a graph with a phase admissible for Theorem 3.4. The construction and its constants are fixed separately for each chart and do not depend on p. A measurable partition subordinate to the covering avoids any assumption that the data extend smoothly across chart boundaries.
Write one chart in ambient frequency coordinates as
where L is invertible and A is bounded, possibly cut off by the boundary of the surface. Its surface measure is J_\Sigma(\zeta)\dd\zeta, with J_\Sigma smooth and strictly positive on a neighborhood of the chart. For data supported on this piece, set
Then
The change of physical variables y=L^{\mathsf T}x contributes |\det L|^{-1/p} to the L^p norm. Moreover,
After the finite window partition of Equation (2.2), Theorem 6.4 applies to every resulting term. The determinant, area, window, and chart factors are bounded uniformly for 3<p\le4. Summing the finitely many terms by the triangle inequality gives Equation (1.1) in this range, with the quantitative bound Equation (1.3). Here P_\Sigma is the maximum of the finitely many packet constants, enlarged to be at least one.
For p>4, the local L^4 and L^\infty bounds give the result directly, as in Theorem 6.4, and the same finite chart argument applies. No smoothness of f, nor of its extension by zero on the parameter plane, has been used. Boundary charts are therefore included.
Proposition 6.5 supplies Equation (1.4) for every nonempty surface by choosing a nonzero smooth datum in an interior chart. This completes the proof of Theorem 1.1 and the stated dependence on p.
7.2 Free Schrödinger local smoothing
The extension estimate for a compact paraboloid controls all frequencies of the Schrödinger propagator through the transfer theorem of Lee, Rogers, and Seeger. The strict Sobolev inequality in Corollary 1.2 then supplies the summability across frequency scales.
Proof of Corollary 1.2. On the compact paraboloid \Sigma=\{(y,|y|^2):|y|\le1\}, write \dd\sigma=w(y)\dd y, where w(y)=\sqrt{1+4|y|^2}. Apply Theorem 1.1 to the datum g(y)/w(y) on \Sigma. A fixed change of output variables then gives
This is the compact-frequency extension estimate in Lee–Rogers–Seeger [10, Equation (1.3)] with both exponents equal to p. Their Theorem 1.1, with spatial dimension two and Besov summation exponent two, yields
For an inhomogeneous Littlewood–Paley partition (P_k)_{k\ge0}, the uniform annular multiplier bound \|P_kf\|_p\le C_s2^{-ks}\|(I-\Delta)^{s/2}f\|_p gives
The series converges for s>\alpha. This proves Equation (1.2) on Schwartz functions, and density gives the stated bounded extension.
7.3 Translation-invariant oscillatory integrals
A second application concerns phases whose curvature changes only by a scalar factor in time. Such a phase can be straightened by changing the output variables alone, reducing the estimate to one fixed elliptic graph. This is the translation-invariant setting of the output straightening theorem of Gao–Liu–Xi [5, Theorem 1.12 and Section 4.1]. We give the short argument for the two-dimensional input considered here, then allow a general smooth amplitude by Fourier expansion.
Corollary 7.1 (Elliptic translation-invariant Bourgain phases). Let
be a fixed real smooth phase near the origin. Suppose throughout this neighborhood that
for a smooth real scalar function c. On a sufficiently small fixed product chart, let a be any fixed smooth amplitude with compact support in its interior. For every 3<p<\infty,
where the operator is zero outside the output support of a. The constant may depend on the fixed chart, phase, amplitude and p, but not on N or f.
Proof. Shrink the product neighborhood so that its input domain is a ball. Since M is a Hessian in y, commuting its derivatives in \partial_tM=cM gives
Multiplication by (M^{-1})_{j\ell}, summed over j, yields (\partial_{y_k}c)\delta_{i\ell} =(\partial_{y_i}c)\delta_{k\ell}. For each k, choose \ell=i\ne k; hence \nabla_yc=0. The input ball is connected, so c=c(t). Set
The equation for M now implies D_y^2(\partial_t\psi-\rho h)=0. Thus \partial_t\psi=\rho(t)h(y)+b(t)\cdot y+d(t) for smooth functions b,d. Integrating and using \psi(0;y)=0 gives
Since S'=\rho>0, it has a smooth local inverse t=t(s). The output change \kappa(u,s)=(u-B(t(s)),t(s)) therefore satisfies
Here D_y^2h=M(0,y) is definite. No input coordinate change is needed.
Put z=(u,s) and A(z,y)=a(\kappa(z);y). Extend this fixed amplitude smoothly by zero, and periodically in z across a fixed cube Q of side L whose interior contains its output support. On Q,
Indeed, integration by parts in z gives \|A_k\|_\infty\le C_m(1+|k|)^{-m} for any fixed m>3. All coefficients have a common compact frequency support, and the constants are independent of N. Choose a compact graph patch \Sigma, parametrized by \omega(y)=(y,h(y)), with smooth boundary and parameter domain containing this support, and write \dd\sigma=w(y)\dd y, where w(y)=\sqrt{1+|\nabla h(y)|^2}. For
we have
The factor e^{iNr(s)} is unimodular, and each remaining Fourier term is e^{2\pi i k\cdot z/L}E_\Sigma g_k(Nz/(2\pi)). Minkowski’s inequality and Theorem 1.1, applied globally to each term, bound their sum on Q by
Changing back by \kappa contributes only the bounded factor \sup|\det D\kappa|^{1/p} on the fixed output support. Absolute coefficient summability and the local L^1 integrability of f justify the series and its interchange with the integral. This proves Equation (7.1), with no power loss in N.
References
- [1]Jonathan Bennett, Anthony Carbery, and Terence Tao. On the multilinear restriction and Kakeya conjectures. Acta Mathematica, 196(2):261–302, 2006. doi:
10.1007/s11511-006-0006-4. doi:10.1007/s11511-006-0006-4. - [2]Jean Bourgain. Besicovitch type maximal operators and applications to Fourier analysis. Geometric and Functional Analysis, 1(2):147–187, 1991. doi:
10.1007/BF01896376. doi:10.1007/BF01896376. - [3]Jean Bourgain and Larry Guth. Bounds on oscillatory integral operators based on multilinear estimates. Geometric and Functional Analysis, 21(6):1239–1295, 2011. Preprint version: arXiv:1012.3760v3. doi:10.1007/s00039-011-0140-9, arXiv:1012.3760v3.
- [4]Stefan Buschenhenke. Factorization in Fourier restriction theory and near extremizers. Mathematische Nachrichten, 297(1):195–208, 2024. doi:
10.1002/mana.202200173. doi:10.1002/mana.202200173. - [5]Chuanwei Gao, Diankun Liu, and Yakun Xi. Curved Kakeya sets and Nikodym problems on manifolds. 2025. Preprint version: arXiv:2503.11574v1. arXiv:2503.11574v1, https://arxiv.org/abs/2503.11574v1.
- [6]Shaoming Guo, Changkeun Oh, Hong Wang, Shukun Wu, and Ruixiang Zhang. The Bochner–Riesz problem: an old approach revisited. Peking Mathematical Journal, 8:201–270, 2025. Preprint version: arXiv:2104.11188v1. doi:10.1007/s42543-023-00082-4, arXiv:2104.11188v1.
- [7]Larry Guth. A restriction estimate using polynomial partitioning. Journal of the American Mathematical Society, 29(2):371–413, 2016. Preprint version: arXiv:1407.1916v3. arXiv:1407.1916v3, https://arxiv.org/abs/1407.1916v3.
- [8]Jongchon Kim. Some remarks on Fourier restriction estimates. 2017. Preprint version: arXiv:1702.01231v2. arXiv:1702.01231v2, https://arxiv.org/abs/1702.01231v2.
- [9]John M. Lee. Introduction to Smooth Manifolds. Graduate Texts in Mathematics 218, Springer, Second edition, 2013. doi:
10.1007/978-1-4419-9982-5. doi:10.1007/978-1-4419-9982-5. - [10]Sanghyuk Lee, Keith M. Rogers, and Andreas Seeger. On space–time estimates for the Schrödinger operator. Journal de Mathématiques Pures et Appliquées, 99(1):62–85, 2013. doi:
10.1016/j.matpur.2012.06.003; author manuscript: PDF. doi:10.1016/j.matpur.2012.06.003. - [11]OpenAI. Elliptic capacity propagation and Fourier restriction to the sphere. OpenAI Math Release preprint PDF, 2026. Reading view on this site: Elliptic capacity propagation and Fourier restriction to the sphere.
- [12]OpenAI. The Kakeya maximal conjecture in three dimensions. OpenAI Math Release preprint PDF, 2026. Reading view on this site: The Kakeya maximal conjecture in three dimensions.
- [13]Keith M. Rogers. A local smoothing estimate for the Schrödinger equation. Advances in Mathematics, 219(6):2105–2122, 2008. doi:
10.1016/j.aim.2008.08.008; author manuscript: full text. doi:10.1016/j.aim.2008.08.008. - [14]Bassam Shayya. Weighted restriction estimates using polynomial partitioning. Proceedings of the London Mathematical Society, 115(3):545–598, 2017. Preprint version: arXiv:1512.03238v2. doi:10.1112/plms.12046, arXiv:1512.03238v2.
- [15]Elias M. Stein. Some problems in harmonic analysis. In Harmonic Analysis in Euclidean Spaces, Part 1, pages 3–20, American Mathematical Society, 1979. Publisher information. https://www.ams.org/books/pspum/035.1/.
- [16]Terence Tao. The Bochner–Riesz conjecture implies the restriction conjecture. Duke Mathematical Journal, 96(2), 1999. doi:
10.1215/S0012-7094-99-09610-2. doi:10.1215/S0012-7094-99-09610-2. - [17]Terence Tao. A sharp bilinear restriction estimate for paraboloids. Geometric and Functional Analysis, 13:1359–1384, 2003. Preprint version: arXiv:math/0210084v2. doi:10.1007/s00039-003-0449-0, arXiv:math/0210084v2.
- [18]Terence Tao, Ana Vargas, and Luis Vega. A bilinear approach to the restriction and Kakeya conjectures. Journal of the American Mathematical Society, 11(4):967–1000, 1998. Preprint version: arXiv:math/9807163v1. arXiv:math/9807163v1, https://arxiv.org/abs/math/9807163v1.
- [19]Peter A. Tomas. A restriction theorem for the Fourier transform. Bulletin of the American Mathematical Society, 81(2):477–478, 1975. doi:
10.1090/S0002-9904-1975-13790-6. doi:10.1090/S0002-9904-1975-13790-6. - [20]Hong Wang. A restriction estimate in \mathbb{R}^3 using brooms. Duke Mathematical Journal, 171(8):1749–1822, 2022. Preprint version: arXiv:1802.04312v2. arXiv:1802.04312v2, https://arxiv.org/abs/1802.04312v2.
- [21]Hong Wang and Shukun Wu. Restriction estimates using decoupling theorems and two-ends Furstenberg inequalities. 2024. Preprint version: arXiv:2411.08871v3. arXiv:2411.08871v3, https://arxiv.org/abs/2411.08871v3.
- [22]Thomas Wolff. A sharp bilinear cone restriction estimate. Annals of Mathematics, 153(3):661–698, 2001. Preprint version: arXiv:math/0105266v1. arXiv:math/0105266v1, https://arxiv.org/abs/math/0105266v1.