Beurling Nyman Geometry and Gram Matrix Structure, Ladder Density and Polynomial Decay via Mellin Smoothing
Abstract
We study the Beurling Nyman (BN) family fθ(x) = \θ/x\ - θ\1/x\ in L2((0,1]) through a multiscale ladder parameterisation θj,k = 2-j3-k and the associated Gram matrix structure indexed by ladder distance. Using Mellin analysis and a controlled smoothing operator, we establish a rigorous polynomial decay envelope for off-diagonal Gram entries. Specifically, for a Gaussian-type Mellin multiplier we prove that | gθj,k, gθj',k' | m (1 + c d((j,k),(j',k')))-m for any m in N, where c = \ 2, 3\ and d denotes the ladder distance. As a consequence we obtain block-compressibility of Gram rows for m > 2. These results provide a rigorous foundation for sparsity phenomena in the BN system and support constructive spectral approaches. The analysis is unconditional and independent of any hypothesis concerning the zeros of the zeta function.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.