Published November 20, 2026 | Version 1.2

An Explicit Prime-Power Cone Criterion for the Riemann Hypothesis

Authors/Creators

Description

This preprint continues Robert Polak’s August 2026 study of a residual associated with the Riemann zeta function. It shows that the Riemann hypothesis (RH) holds if and only if an explicit determinant is positive immediately after every sufficiently large prime power. Under RH, the determinant is at least 0.006 t2 for either one-sided derivative when t = log x ≥ 11. Outward-rounded interval arithmetic verifies positivity after all 6,148 prime powers up to 60,000.

Version 1.2 studies the first prime pm at or above each fourth power m4. At each sample, divide the determinant by the square root of that prime. For every fixed threshold 0 < c ≤ 2B(0) and every prescribed run length, the paper gives an unconditional upper bound on how far one must go to find consecutive samples all at least c. Here B(0) = 2 + γ − log(4π), where γ is Euler’s constant. For every positive threshold there are also arbitrarily long runs below it. A fixed bound on the number of consecutive nonpositive samples is equivalent to RH.

The paper also traces a centred von Mangoldt sum through Levent Alpöge’s announced work with Claude. It identifies which sampling points the theta-lift window estimate covers, the loss in the exponent when that estimate is transferred to the determinant, and the joint error estimate still needed for four shifts. The proofs of the prime-power criterion and the results on gaps are independent of the announced proof.

Robert Polak used GPT ASTRA 6.2 (OpenAI) for the mathematical derivations and the formulation of the manuscript.

Interval verifier, exact arithmetic checker and reference output

Files

Prime_Power_Cone_Criterion_v1.2.pdf

Files (560.9 kB)

Name Size
md5:988e19fe4bfb7fa2908481d448ee4c60
502.7 kB Preview Download
md5:45c3c471a62d4f1310c7b7623265fa07
58.2 kB Download

Additional details

Related works

Cites
Preprint: 10.5281/zenodo.21808589 (DOI)