English

Fej\'er-Kernel Prime Indicators

Number Theory 2025-10-16 v3

Abstract

A C1C^1 prime indicator P ⁣:RR\mathcal{P}\colon\mathbb{R}\to\mathbb{R} is constructed by applying the Fej\'er identity to the sine-quotient encoder of trial division. For integers n2n\ge 2, P(n)=0\mathcal P(n)=0 holds exactly for odd primes; P(2)>0\mathcal P(2)>0. For all non-integers x>1x>1 one has P(x)>0\mathcal P(x)>0. The function is piecewise CC^\infty and its second derivative has jumps precisely at the squares m2m^2, with explicit sizes. Replacing the sharp cut-off by a smooth transition yields CC^\infty analogues Pτ\mathcal{P}_\tau and Pσ\mathcal{P}_\sigma with integer limits Pτ(n;κ)τ(n)2\mathcal{P}_\tau(n;\kappa)\to \tau(n)-2 and Pσ(n;κ)σ(n)n1\mathcal{P}_\sigma(n;\kappa)\to \sigma(n)-n-1 as κ\kappa\to\infty, obtained from locally uniform convergence of derivative series. For large κ\kappa, numerical evidence indicates companion zeros near odd primes for Pτ\mathcal{P}_\tau and an asymmetric pair for Pσ\mathcal{P}_\sigma. No assertion is made beyond integer input, and no statements are claimed about the prime number theorem or zero distributions of LL-functions. The appendix includes two illustrative prime-counting sums.

Keywords

Cite

@article{arxiv.2506.18933,
  title  = {Fej\'er-Kernel Prime Indicators},
  author = {Sebastian Fuchs},
  journal= {arXiv preprint arXiv:2506.18933},
  year   = {2025}
}

Comments

34 pages, 9 figures, v3: explicit jump formula and brief complexity notes added; rpf-form added; conjectures/scope clarified; companion reference added; prime-counting example moved to appendix. Core theorems unchanged. Title adjusted for precision

R2 v1 2026-07-01T03:30:00.711Z