A Variation Norm Carleson Theorem Along the Primes
Source: github.com/anastasiosfragkosmath/Variation-Norm-Carleson-Al…
A Lean 4 formalization of the two main theorems of Fragkos, Krause, Miheisi and Sun, A Variation Norm Carleson Theorem Along the Primes. For finitely supported f on the integers, consider the modulated sums S_λ f(x) = Σ_{n ≠ 0} f(x − n) Λ(|n|) e(λn)/n, with Λ the von Mangoldt function and e(t) = exp(2πit). Theorem 1.3: for every r > 2 the r-variation of S_λ f(x) over λ in [0, 1) is bounded on ℓ^p(ℤ) for c(r) < p < C(r), where r' < c(r) < 2 < C(r), c(r) → 1 and C(r) → ∞ as r → ∞. Theorem 1.4: the supremum of |S_λ f(x)| over λ in [0, 1) is bounded on ℓ^p(ℤ) for every 1 < p < ∞. The results of…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-17-000007
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-17-000007/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-17-000007/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'