Paperlane

no. 7 · Tuesday 3 November 2026

On the Distribution of Prime Squares and Its Applications

Hamed Mousavi

math.NT · code · ∎ lean builds · 87 pp

Abstract

We prove that, for every \(A>0\), all but \(O_A(X(\log X)^{-A})\) integers \(n<X\) satisfying \(n\equiv11\pmod{24}\) admit a representation \[ n=a^2+b^2+p^2, \] where \(p\) and \(a^2+b^2+1\) are prime and \((a,b)=1\). For ergodic averages along prime squares, we prove a universal divergence result for integrable functions, while establishing almost-everywhere convergence for near-integrable functions. We also quantify how the bounds used to establish convergence behave as one approaches integrability. Moreover, we prove endpoint improving and sparse bounds for the corresponding discrete averages, with an explicit Orlicz loss.

code
github.com/HamedMousaviMath/lean4-paper-On-Distribution-of-Prime-Squares-formalization/tree/main ∎ Lean project (lakefile.toml, lean-toolchain) builds, no sorry at b67166d, checked 2026-11-10 build details
comments
87 pages. A formalization, conditional on thirteen explicitly documented families of external analytic and arithmetic inputs, is here: https://github.com/HamedMousaviMath/lean4-paper-On-Distribution-of-Prime-Squares-formalization/tree/main
fields
Number Theory, Combinatorics, Dynamical Systems
pdf ↗ page arXiv:2611.00485 ↗