There is a newer version of the record available.

Published November 16, 2025 | Version v3
Preprint Restricted

HBP | Base | 0.1 • Blur as a Universal Principle: Number Theory, Probability, Dynamics

Authors/Creators

Description

We advocate a simple organizing principle: blur sharp or oscillatory objects by positive, normalized approximate identities (Poisson/Fejér/Gaussian/Abel), prove the smoothed statement by positivity and dominated (or mean-ergodic) convergence, and then unsmooth by a standard deconvolution/Tauberian step. This two-move template explains a surprising range of classical results. On the circle, Poisson blurring turns Weyl equidistribution of $\{n \alpha\}$ into a one-line argument via the decay of fixed Fourier modes and $\sum r^{|k|}<\infty$, with equidistribution recovered as $r \uparrow 1$. In probability, convolving characteristic functions with the Poisson kernel is equivalent to testing against $x \mapsto e^{-y|x|}$; Lindeberg replacement at fixed blur and an equi-Lipschitz bound yield the Gaussian limit by Lévy's theorem. In ergodic theory, Abel averages are positive $L^1$ contractions; Dunford-Schwartz gives convergence in norm, and Abel $\rightarrow$ Cesàro plus the Hopf maximal inequality recovers Birkhoff's pointwise ergodic theorem. We also prove a blur/ $\varepsilon-\delta$ equivalence: classical limits are equivalent to convergence of Gaussian blurs together with vanishing local oscillation. Finally, defining a blur-integral $\int_0^1\left(f * \phi_y\right)$ and letting $y \downarrow 0$ reproduces the Lebesgue integral for every bounded measurable $f$ and therefore extends the Riemann integral; Dirichlet's function becomes integrable by blur.

Beyond these worked examples we argue that blur is not just a technical trick but an epistemic necessity: whenever a theory learns from a world it does not fully control, there is an inescapable "band of ignorance" that must be handled honestly. We outline three structural places where this band appears-between addition and multiplication, between finite and infinite, and in the process of theorem discovery itself-and explain how these all reduce to a single small blur budget.

Files

Restricted

The record is publicly accessible, but files are restricted. Log in to check if you have access.

Additional details

References

  • A. Perišić, Blur as a Universal Principle: Number Theory, Probability, Dynamics, Zenodo, 2025.
  • A. Perišić, Soft-Addition and Soft-Multiplication and the Channel–Switch Error, Zenodo, 2025.
  • A. Perišić, Blur at the Finite–Infinite Interface, Zenodo, 2025.
  • A. Perišić, Epistemological Blur, Zenodo, 2025.
  • A. Perišić, Randomness, Blur, and the Operator, Zenodo, 2025.
  • A. Perišić, The Axiom of Blurred Choice, Zenodo, 2025.
  • A. Perišić, Multiplicative Choice, Zenodo, 2025.
  • A. Perišić, Randomness, Blur, and the Blank Operator, Zenodo, 2025
  • A. Perišić, A Lyapunov Certificate for the Accelerated Collatz Map, Zenodo, 2025.