Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Zeta explicit formula zero free error balance

Statement

For x2 and finite T3, the classical region and truncated explicit formula give ψ(x)x=O(xec0logx/log(T+2)log2T+xlog2(xT)T+logx). Constants may be enlarged and the positive region constant decreased. The zero sum used in the proof is finite.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

The truncated von Mangoldt explicit formula: For x,T2, ψ0(x)x=ρ<Txρρζ(0)ζ(0)12log(1x2)+O ⁣(xlog2(xT)T+(logx)min{1,xTx}), where x is the distance to the nearest prime power other than possibly x. The zero sum is finite and counts multiplicities.

[F2]

Riemann zeta classical zero free region: There is an absolute c0>0 such that ζ has no zeros in σ1c0/log(t+2). The pole at s=1 is not a zero.

[F3]

Zeta reciprocal zero sum bound: For T2, the sum of 1/ρ over nontrivial zeros with 0<ImρT is O(log2T), with multiplicity. Adjoining any real nontrivial zeros preserves the estimate.

[F4]

The half-weighted Chebyshev function: For x>0, define ψ0(x)=n<xΛ(n)+{Λ(x)/2,xZ>0,0,xZ>0. This differs at prime powers from the right-continuous ψ(x)=nxΛ(n) of def-chebyshev-psi-function.

Proof

1.1

For each zero in the finite sum Imρ<T, the region implies xρxexp(c0logx/log(T+2)). Summing absolute values and using the reciprocal estimate, including any real zeros, bounds the entire zero sum by the first displayed error.

F2F3
2.1

The supplied truncation error is at most O(xlog2(xT)/T+logx) because its minimum is at most one. The fixed constant ζ(0)/ζ(0) and log(1x2) are bounded for x2. Finally ψ(x)ψ0(x)(logx)/2, so replacing the half-weighted value gives the asserted error, including prime-power endpoints. The supplied formula holds for all x,T at these bounds; if a contour construction avoids ordinates, a non-ordinate in [T,T+1] has comparable bounds.

F1F4step 1.1

Depends on

Used by

Dependency tree · two levels

17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources