The Germain–Myerson spectral projection conjecture for tori

At least 1 year old · documented by

Let Tn\mathbb{T}^{n} be the rational torus, let Pλ,δP_{\lambda,\delta} denote its spectral projection operator for spectral parameter λ\lambda and window width δ\delta, and let ∥Pλ,δ∥2→p\|P_{\lambda,\delta}\|_{2\rightarrow p} be its operator norm. Define

pc=2(n+1)n−1,p∗=2nn−2,p_c=\frac{2(n+1)}{n-1},\qquad p^*=\frac{2n}{n-2},

and

e(p)=n+1n−1(1p−1pc1p−n−32(n−1)),e(p)=\frac{n+1}{n-1}\left(\frac{\frac{1}{p}-\frac{1}{p_c}}{\frac{1}{p}-\frac{n-3}{2(n-1)}}\right),

with

μ1(p)=n−12(12−1p),μ2(p)=n−12−np.\mu_1(p)=\frac{n-1}{2}\left(\frac{1}{2}-\frac{1}{p}\right),\qquad \mu_2(p)=\frac{n-1}{2}-\frac{n}{p}.

The Germain–Myerson conjecture. If δ>λ−1+κ\delta>\lambda^{-1+\kappa} for some fixed κ∈(0,1]\kappa\in(0,1], then there is a constant C=C(n,p,κ,L∗)C=C(n,p,\kappa,L^*) such that

∥Pλ,δ∥2→p≤{C(n,p,κ,L∗)(λδ)n−12(12−1p)=C(λδ)μ1(p),p≤pc,C(n,p,κ,L∗)(λδ)n−12(12−1p)=C(λδ)μ1(p),pc≤p≤p∗ and δ≤λe(p),C(n,p,κ,L∗)λn−12−npδ1/2=Cλμ2(p)δ1/2,p∗≤p and δ≥λe(p).\|P_{\lambda,\delta}\|_{2\rightarrow p}\leq\begin{cases} C(n,p,\kappa,L^*)(\lambda\delta)^{\frac{n-1}{2}(\frac12-\frac1p)}=C(\lambda\delta)^{\mu_1(p)},&p\leq p_c,\\ C(n,p,\kappa,L^*)(\lambda\delta)^{\frac{n-1}{2}(\frac12-\frac1p)}=C(\lambda\delta)^{\mu_1(p)},&p_c\leq p\leq p^*\text{ and }\delta\leq\lambda^{e(p)},\\ C(n,p,\kappa,L^*)\lambda^{\frac{n-1}{2}-\frac{n}{p}}\delta^{1/2}=C\lambda^{\mu_2(p)}\delta^{1/2},&p^*\leq p\text{ and }\delta\geq\lambda^{e(p)}. \end{cases}

These bounds refine the universal spectral projection estimates for shrinking spectral windows on the torus, down to widths just above the smallest reasonable scale for rational tori. The conjecture was originally stated by Germain and Myerson and was partially proved in the cited work; the full range of estimates remains unresolved.

References

Primary source

Daniel Pezzi, “Sharp Spectral Projection Estimates for the Torus at p_c=2(n+1)n-1”, arXiv:2405.02746 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.