no. 16 · Tuesday 17 November 2026
The Bilinear Hilbert Transform Along the Primes
Abstract
We prove that the discrete Bilinear Hilbert Transform along the primes, \begin{align} \mathcal{H}_{\mathbb{P}}(f,g)(x) := \sum_{n \neq 0} \frac{Λ(|n|)}{n} f(x-n) g(x+n), \qquad Λ(n) := \begin{cases} \log p & \text{ if } n = p^k, \ k \geq 1 \\ 0 & \text{ otherwise} \end{cases} \end{align} extends to a bounded operator from $\ell^p \times \ell^q \to \ell^r$ whenever $p,q \in (1,\infty)$ and $\frac{1}{r}=\frac{1}{p}+\frac{1}{q}$ in the Banach range, $r \geq 1$, and a particular portion of the quasi-Banach range $r \in \left(\frac{2}{3},1\right)$; in the diagonal case, this extends up to the endpoint $(\frac{5}{3},\frac{5}{3},\frac{5}{6})$. After $U^3$-based reductions, the philosophy of the proof becomes similar to that of Krause-Mirek-Tao (on different bilinear operators in discrete harmonic analysis), namely a ``splitting" of the problem into an arithmetic component, handled by analysis within cyclic subgroups, and an analytic component, handled by analysis along arithmetic progressions. For the arithmetic component, we draw upon previous work of most of the authors on Carleson operators along the primes; the main analytic input are estimates for UMD space-valued bilinear singular integrals with modulation invariance, due to Di Plinio-Li-Martikainen-Vuorinen.
- code
- github.com/anastasiosfragkosmath/Prime_BHT_Palomar_Submission ∎ Lean project (lakefile.toml, lean-toolchain) builds with 1 sorry warning at 37e79d9, checked 2026-11-17 build details
- comments
- Lean formalization at https://github.com/anastasiosfragkosmath/Prime_BHT_Palomar_Submission
- fields
- Classical Analysis and ODEs