Id: palomar/PALOMAR-2026-11-17-000007 Url: https://github.com/anastasiosfragkosmath/Variation-Norm-Carleson-Along-the-Primes-Palomar-Submission/tree/6753794fbfa2895b77eba3039b4ea8783a84be4c Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-17-000007-v1.json Repo: https://github.com/anastasiosfragkosmath/Variation-Norm-Carleson-Along-the-Primes-Palomar-Submission Tags: math.CA, math.NT, msc:42B20, msc:42B25, msc:11L20 Score: 0 Title: A Variation Norm Carleson Theorem Along the Primes Trust: high Domain: math.CA Source: palomar Authors: Anastasios Fragkos Reviews: 0 Subject: math.CA Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-17 Formalized: true Formalizes: title=A Variation Norm Carleson Theorem Along the Primes identifier= relationship=formalizes Formalizes: title=A variation norm Carleson theorem identifier=https://arxiv.org/abs/0910.1555v2 relationship=formalizes Formalizes: title=Discrete analogues in harmonic analysis: spherical averages identifier=https://arxiv.org/abs/math/0409365v1 relationship=adapts Formalizes: title=The Wiener Wintner Theorem Along the Primes identifier=https://arxiv.org/abs/2601.10459v3 relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-17-000007 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…