Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passverified 2026-09-24 (gpt-6-sol)
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.

The truncated von Mangoldt explicit formula

Statement

Assume countable choice.

For x,T≥2, ψ0(x)−x=−∑∣ℑρ∣<Txρρ−ζ′(0)ζ(0)−12log⁡(1−x−2)+O ⁣(xlog⁡2(xT)T+(log⁡x)min⁡{1,xT⟨x⟩}), where ⟨x⟩ is the distance to the nearest prime power other than possibly x. The zero sum is finite and counts multiplicities.

Proof

Given: Countable choice and x,T≥2. All constants below are absolute.

1.1givenalgebra

Put c=1+1/log⁡(2x), so 1<c<2 and xc=O(x). On ℜs=c, The logarithmic derivative of the zeta Dirichlet series is the Dirichlet series of the von Mangoldt function on Re s greater than 1 gives −ζ′(s)/ζ(s)=∑n≥1Λ(n)n−s absolutely. Apply A truncated Perron formula at height H≥2 to this series. Its starred sum is ψ0(x) by The half-weighted Chebyshev function, and its error is at most ∑n≠xΛ(n)(x/n)cmin⁡{1,(H∣log⁡(x/n)∣)−1}+O(Λ(x)/H). Here Λ(x)=0 if x is not an integer prime power.

1.2givenconstructalgebra

The unit-interval zero count A unit-interval bound for zeta zeros bounds the number of zero ordinates in [T−1,T+2] by Clog⁡(T+2). Removing intervals of radius 1/(8Clog⁡(T+2)) about those ordinates leaves a point H∈[T,T+1] at that distance or more from every zero ordinate; ordinates outside [T−1,T+2] are farther away. Use this H and its reflection −H as the horizontal contour heights. By A local formula for the logarithmic derivative of zeta, for −1≤σ≤c one has ζ′/ζ(σ±iH)=O(log⁡2(H+2)): at most O(log⁡H) zeros enter the local sum and each denominator has modulus ≫1/log⁡H. The pole term is harmless since H≥2.

2.1step 1.1algebra

For n∉(3x/4,5x/4), ∣log⁡(x/n)∣ is bounded below by an absolute constant. Since Λ(n)≤log⁡n and c−1=1/log⁡(2x), comparison with ∫1∞(log⁡u)u−c du=(c−1)−2 gives ∑nΛ(n)n−c=O(log⁡2(2x)). Thus these far terms contribute O(xlog⁡2(2x)/H).

2.2step 1.2algebra

For odd positive integers U, shift the Perron segment from c±iH to −U±iH. The horizontal parts with −1≤σ≤c contribute O ⁣(log⁡2(H+2)H∫−1cxσ dσ)=O ⁣(xlog⁡2(H+2)Hlog⁡x). For σ≤−1, the line is at distance at least H from every negative even integer, so A left-half-plane bound for the logarithmic derivative of zeta bounds the logarithmic derivative by O(log⁡(∣σ∣+H+2)). These horizontal tails are O((1+log⁡(H+2))/(Hxlog⁡x)) after integrating xσ over (−∞,−1]. Along ℜs=−U, the same lemma with distance at least 1 from the negative even integers gives ζ′/ζ=O(log⁡(U+H+2)); the vertical integral is O(Hlog⁡(U+H+2)/(UxU)) and tends to zero as U→∞. All three bounds are absorbed by O(xlog⁡2(xH)/H).

3.1step 1.1step 2.1algebra

In the middle interval, (x/n)c=O(1) and ∣log⁡(x/n)∣≫∣n−x∣/x. On each side of x, single out the nearest prime power q≠x, if one lies in that middle interval. Its contribution is O((log⁡x)min⁡{1,x/(H∣x−q∣)}), at most the term involving ⟨x⟩ in the statement. For all other integers on that side, put m=∣n−q∣≥1; because q is the nearest contributing prime power, ∣n−x∣≥m, so their total is at most O ⁣(xlog⁡(2x)H∑1≤m≤2x1m)=O ⁣(xlog⁡2(2x)H). The endpoint n=x in step 1.1 is O(log⁡(2x)/H). Consequently the Perron integral PH(x) satisfies PH(x)=ψ0(x)+O ⁣(xlog⁡2(2x)H+(log⁡x)min⁡{1,xH⟨x⟩}).

4.1step 3.1step 2.2algebra

The residue ledger Residues in the von Mangoldt contour shift now gives, after U→∞, PH(x)=x−∑∣ℑρ∣<Hxρρ−ζ′(0)ζ(0)−12log⁡(1−x−2)+O ⁣(xlog⁡2(xH)H). Its negative-even residue series converges absolutely since x>1. Combining this with step 3.1 proves the formula at height H.

5.1step 4.1algebra∎

The only zeros gained between the strict cutoffs T and H have T≤∣ℑρ∣<H≤T+1. There are O(log⁡(T+2)) of them, with multiplicity, and 0<ℜρ<1 by The only zeros of zeta on the nonpositive real axis are the negative even integers, and every other zero lies in the open critical strip, so each contributes at most x/T. Their total O(xlog⁡(T+2)/T) is absorbed by O(xlog⁡2(xT)/T). Since T≤H≤T+1, the two errors in step 3.1 at height H are bounded by the displayed errors at height T up to absolute constants. This proves the statement, including when T itself is a zero ordinate.

Depends on

Used by

Dependency tree · two levels

32 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