The distribution of prime numbers is closely connected to the behavior of the Riemann zeta function.
4 events · 1 assessment · 2 decisions
Structured and assessed
First pass. Decomposed the claim into five supporting theorems: three newly minted after the Matcher found them novel (Euler product, PNT equivalent to non-vanishing on Re s = 1, Riemann's explicit formula), each scored at importance 0.12 so they stay deferred stubs, and two existing claims linked (RH equivalent to square-root error term; error exponent equals supremum of zero real parts). Added a see-also to the evaluative claim that proving RH would illuminate the primes. No parent exists or is needed: the claim is itself the background proposition, not a meta-claim. Read both Clay sources; corrected the original instance's verbatim text to the stored rendering (whitespace-only quote-check failure) and recorded Bombieri's official description as a second affirming instance. Provenance map written and marked immaterial. Importance set to 0.15 (settled bedrock, contestation 0.05), superseding the Extractor's 0.25. Assessed verified at confidence 0.96, credence 0.99, marginal yield 0.03. Canonical form kept: it is already a neutral fifteen-word statement of the proposition as the discourse poses it. No dependents to notify. No formal statement attempted: the claim is a summary of several theorems rather than one proposition, so a Lean rendering would have to pick one and would not be faithful to the canonical text.
Assessed Verified
verdict confidence 0.96 · credence 0.99
The connection between the primes and the Riemann zeta function is settled mathematics, established by a chain of theorems running from Euler to the late nineteenth century. Its root is Euler's product formula, which writes the zeta function as a product over the primes and so encodes unique factorization in an analytic function. Riemann's 1859 memoir turned this into an exact statement about counting primes: the explicit formula expresses the prime-counting function as a sum over the non-trivial zeros of zeta, so the primes are determined, term by term, by where the zeros lie. The connection is quantitative and runs in both directions. The prime number theorem is equivalent to zeta having no zeros on the line with real part 1, and more sharply the error term in the prime number theorem is governed exactly by the largest real part of any zero. The best-known instance of the correspondence is that the Riemann hypothesis is equivalent to the prime number theorem holding with a square-root-size error. Each of these results is a proven theorem found in every standard treatment of analytic number theory, and no mathematician disputes the connection they establish.
Updated claim instance
Instance 4138423f-a3a7-49e0-9cf4-488f48519832 (https://www.claymath.org/millennium/riemann-hypothesis/): was stance=affirms, confidence=0.82; set verbatimText="the German mathematician G.F.B. Riemann (1826 – 1866) observed that the frequency of prime numbers is very closely related to the behavior of an elaborate function ζ(s) = 1 + 1/2 s + 1/3 s + 1/4 s + … called the Riemann Zeta function", speaker="Clay Mathematics Institute", publication="Clay Mathematics Institute". The stored text of the Clay page renders the exponents with spaces ("1/2 s"), so the recorded passage failed the mechanical quote check on whitespace only; the passage is corrected to the stored rendering and extended to the sentence start so the attribution to Riemann's observation is visible. The stance and confidence are unchanged: the page asserts the connection in its own voice.
Claim entered the graph