Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full by a delegated reviewing agent on the owner's instruction; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Classical Zero Free Region and the Prime Number Theorem — Examples

1 · Prerequisites

2 · Summary

The computations separate the algebraic parameter in the 3–4–1 inequality from the contour-height balance, whose quantitative analytic suppliers assume countable choice. They also track prime powers, partial summation, the Newman integral, and a fixed progression.

The first-digit counterexample distinguishes weighted Dirichlet density from an ordinary counting asymptotic, both for integers and for a subset of primes. The final scope discussion explains why the classical zeta region, under its countable-choice hypothesis, alone supplies no estimate uniform over Dirichlet conductors.

3 · Logical flowchart

4 · Definitions, theorems and proofs

RemarkRemark: AI-adaptedProof: Not applicableverified 2026-09-24 (gpt-6-sol)Open item page →

The classical zeta region is not a uniform dirichlet l region

Discussion

Under countable choice, the classical region Riemann zeta classical zero free region is a statement about zeta with an absolute constant. The progression theorem Prime number theorem arithmetic progressions fixes q before its character transforms and contour neighborhoods are chosen. Its argument supplies neither a rate uniform as q grows nor a uniform Dirichlet L-function zero-free region. No existence of exceptional real zeros is claimed here; this is a scope distinction, not a counterexample to an asserted uniform theorem.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The three four one trigonometric inequality

Example

The weight in the three-four-one inequality is nonnegative term by term: 3+4cos⁡u+cos⁡(2u)=2(1+cos⁡u)2. It vanishes exactly when u is an odd multiple of pi.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

Zeta three four one logarithmic derivative inequality: For σ>1 and t∈R, −3ζ′(σ)ζ(σ)−4Re⁡ζ′(σ+it)ζ(σ+it)−Re⁡ζ′(σ+2it)ζ(σ+2it)≥0.

Verification

1.1algebra

Using cos⁡(2u)=2cos⁡2u−1, the left side is 2+4cos⁡u+2cos⁡2u=2(1+cos⁡u)2. The square vanishes precisely for cos⁡u=−1.

2.1F1step 1.1∎

In the logarithmic-derivative expansion the nth contribution is 2Λ(n)n−σ(1+cos⁡(tlog⁡n))2. It is zero for non-prime-powers and nonnegative otherwise. At t=0 its weight is eight, and at t log n equal to an odd multiple of pi its weight is zero, exactly as required by the inequality.

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Zero free region parameter balance

Example

Let ρ=β+iγ be a zero of ζ with β<1 and ∣γ∣≥3. In the high-height zero-free-region proof, suppose 41+δ−β≤3δ+Clog⁡(∣γ∣+2), holds at δ=1/(2Clog⁡(∣γ∣+2)), where C is a fixed sufficiently large positive comparison constant. Then 1−β≥1/(14Clog⁡(∣γ∣+2)).

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

Riemann zeta classical zero free region: Assuming countable choice, there is an absolute c0>0 such that ζ has no zeros in σ≥1−c0/log⁡(∣t∣+2). The pole at s=1 is not a zero.

Verification

1.1givenalgebra

Write L=log⁡(∣γ∣+2). Here L>0 and C>0, so the chosen δ is positive. Apply the displayed assumed inequality at this value of δ. Substitution makes 3/δ+CL=7CL, so 1+δ−β≥4/(7CL); the denominator is positive because β<1.

2.1F1step 1.1algebra∎

Subtract δ=1/(2CL) to obtain (4/7−1/2)/(CL)=1/(14CL). A smaller constant proves exclusion on a closed boundary. This calculation applies only to ∣γ∣≥3; under countable choice, [F1] states the all-height zero-free region, whose small-height conclusion is not supplied by this conditional calculation.

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Optimizing the prime number theorem contour height

Example

Assume countable choice.

At T=exp⁡(Alog⁡x) for fixed A>0, the exponential rates of the finite-zero and truncation terms in the explicit-formula error balance are respectively c0/A and A. They therefore have the same square-root-logarithm scale, optimized when A=c0.

Facts & Assumptions

Given: Countable choice and the data and hypotheses of the statement.

[F1]

Chebyshev psi prime number theorem error: There is an absolute c>0 such that for x≥2, ψ(x)=x+O(xe−clog⁡x).

[F2]

Zeta explicit formula zero free error balance: For x≥2 and finite T≥3, the classical region and truncated explicit formula give ψ(x)−x=O(xe−c0log⁡x/log⁡(T+2)log⁡2T+xlog⁡2(xT)T+log⁡x). Constants may be enlarged and the positive region constant decreased. The zero sum used in the proof is finite.

Verification

1.1F2algebra

Under countable choice, put u=log⁡x. The error-balance lemma gives respectively O(xu2e−(c0/A)u+o(1)), O(xu4e−Au), and O(u2). Thus any c<min⁡(c0/A,A) absorbs all polynomial factors. Equality of the two exponential rates occurs at A=c0; a fixed positive A already suffices.

2.1F2F1step 1.1algebra∎

Thus the choice A=c0 balances the two exponential rates at c0. More generally any fixed A>0 gives a positive decay rate min⁡(c0/A,A); bounded x can use T=3 and an enlarged constant. This is the square-root-logarithm decay scale recorded in the theorem-level estimate [F1].

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

From psi to the logarithmic integral

Example

Assume countable choice.

The transfer from a classical psi error to pi retains π(x)−Li⁡(x)=2log⁡2+E(x)log⁡x+∫2xE(t)tlog⁡2t dt,E(t)=θ(t)−t. Both the prime-power error and this error integral are absorbed into a decreased classical exponential rate.

Facts & Assumptions

Given: Countable choice and the data and hypotheses of the statement.

[F1]

Chebyshev psi prime number theorem error: There is an absolute c>0 such that for x≥2, ψ(x)=x+O(xe−clog⁡x).

[F2]

Psi and theta differ by at most a square-root term: There are positive constants K1,K2 such that for every real x≥2, 0≤ψ(x)−θ(x)≤K1xlog⁡x, and, for all sufficiently large x, ψ(x)−θ(x)≤K2x.

[F3]

Abel summation recovers the prime-counting function from theta: For every real x≥2, π(x)=θ(x)/log⁡x+∫2xθ(t)/(tlog⁡2t) dt.

[F4]

Logarithmic integral: For real x≥2, Li⁡(x)=∫2xdt/log⁡t, with Li⁡(2)=0.

Verification

1.1F1F2

Under countable choice, the supplied bounds ψ(t)−t=O(te−clog⁡t) and 0≤ψ(t)−θ(t)=O(tlog⁡t) give E(t)=O(te−c′log⁡t) after decreasing the positive constant. The ratio of the prime-power error to te−c′log⁡t is (log⁡t)e−log⁡t/2+c′log⁡t, which is bounded.

2.1F3F4step 1.1algebra∎

Substitute θ(t)=t+E(t) into the partial-summation identity. The main term x/log⁡x+∫2xdt/log⁡2t equals Li⁡(x)+2/log⁡2 by integration by parts. In the E-integral, [2,square root x] contributes O(square root x), and [square root x,x] contributes O(xe−(c′/2)log⁡x). The endpoint term satisfies the same bound. At x=2 the empty integral leaves 2/log⁡2+(log⁡2−2)/log⁡2=1=π(2).

ExampleConstruction: AI-generatedVerification: AI-adaptedverified 2026-09-24 (gpt-6-sol)Open item page →

Newman tauberian prime number theorem

Example

For f(t)=e−tψ(et)−1, its transform is −ζ′(s+1)(s+1)ζ(s+1)−1s. Newman's theorem and monotone desmoothing recover ψ(x)∼x without a quantitative zero-free region.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

Dirichlet character chebyshev laplace transform: Fix a Dirichlet character χ modulo q≥1. Put Ψχ(x)=∑n≤xχ(n)Λ(n) and δχ=1 for the principal character, zero otherwise. The bounded, locally integrable function fχ(t)=e−tΨχ(et)−δχ has Laplace transform gχ(s)=−L′(s+1,χ)(s+1)L(s+1,χ)−δχs(Re⁡s>0). After the removable value at zero is filled in, this extends holomorphically to an open neighborhood of the closed right half-plane.

[F2]

Newman zagier tauberian theorem: Let f:[0,∞)→C be bounded and locally Lebesgue integrable. If g(z)=∫0∞f(t)e−zt dt, initially defined for Re⁡z>0, extends holomorphically to an open set containing {Re⁡z≥0}, then lim⁡T→∞∫0Tf(t) dt=g(0).

[F3]

Monotone chebyshev tauberian desmoothing: Let A:[1,∞)→[0,∞) be nondecreasing and locally integrable, with A(x)=O(x), and let a≥0. If ∫1∞(A(x)−ax)x−2 dx converges, then A(x)/x→a.

Verification

1.1F1

The character-transform lemma at q=1 proves boundedness, local integrability, the displayed transform and its continuation through the closed boundary, including the cancellation at s=0.

2.1F2F3step 1.1∎

Newman gives convergence of ∫0∞f(t) dt=∫1∞(ψ(x)−x)x−2 dx. Since psi is nonnegative, nondecreasing and O(x), desmoothing with a=1 yields ψ(x)/x→1. This is the qualitative assertion; no estimate of a uniform continuation width was needed.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Prime number theorem in a small progression

Example

Modulo four, χ0(1)=χ0(3)=1, χ4(1)=1, χ4(3)=−1, and both vanish on even integers. Hence ψ(x;4,1)=12(Ψχ0(x)+Ψχ4(x)),ψ(x;4,3)=12(Ψχ0(x)−Ψχ4(x)). Both corresponding prime counts are asymptotic to Li⁡(x)/2.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

Prime number theorem arithmetic progressions: For every fixed integer q≥1 and integer a with gcd⁡(a,q)=1, define ψ(x;q,a), θ(x;q,a) and π(x;q,a) by restricting their defining sums to integers, respectively primes, congruent to a modulo q. Then ψ(x;q,a)∼xφ(q),θ(x;q,a)∼xφ(q),π(x;q,a)∼Li⁡(x)φ(q). No uniformity in a growing modulus is asserted.

[F2]

Orthogonality relations for Dirichlet characters modulo q: Let G=(Z/qZ)×, and let the sum range over all Dirichlet characters modulo q. 1. For unit classes a,b∈G, ∑χ mod qχ(a)χ(b)‾={φ(q),a=b,0,a≠b. 2. For Dirichlet characters χ,ψ modulo q, ∑a∈Gχ(a)ψ(a)‾={φ(q),χ=ψ,0,χ≠ψ.

Verification

1.1F2given

The displayed character values give the two residue indicators as (χ0+χ4)/2 and (χ0−χ4)/2, including the zero values on even numbers. Multiply by Lambda and sum to obtain both psi identities.

2.1F1step 1.1∎

The principal sum is Ψχ0(x)=ψ(x)−∑2k≤x, k≥1log⁡2=ψ(x)−⌊log⁡x/log⁡2⌋log⁡2 for x at least one. Its correction is O(log x). Since φ(4)=2, the fixed-progression theorem gives each asserted prime-count asymptotic, including exclusion of the single prime two.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Dirichlet density alone does not give a counting asymptotic

Statement refuted

False inference: existence of a Dirichlet density forces an ordinary counting asymptotic with that density. Let S=⋃k≥0([10k,2⋅10k)∩N),SP=S∩P. Both S among the positive integers and SP among the primes have Dirichlet density d=log⁡2/log⁡10, but their relative counting ratios along 10m and 2⋅10m tend respectively to 1/9 and 5/9.

Facts & Assumptions

Given: The data and hypotheses of the statement.

[F1]

For Re⁡s>0, zeta admits the fractional-part integral formula with a simple residue-one pole at 1: For every complex number s with Re⁡s>0 and s≠1, ζ(s)=ss−1−s∫1∞{x}x−s−1 dx, where {x}=x−⌊x⌋ is the fractional part. The integral defines a holomorphic function on Re⁡s>0, so the right-hand side is meromorphic there with a single simple pole at s=1 of residue 1.

[F2]

The Riemann zeta function has its Euler product on the half-plane Re⁡s>1: For every s∈C with Re⁡s>1, ζ(s)=∏p11−p−s, where the product ranges over the primes and converges absolutely and locally uniformly on Re⁡s>1.

[F3]

Prime number theorem: As x→∞, π(x)∼x/log⁡x,θ(x)∼x,ψ(x)∼x. These three asymptotic assertions are equivalent.

[F4]

Logarithmic integral: For x≥2, Li⁡(x)=∫2xdt/log⁡t.

Counterexample

1.1F1algebra

Write s=1+ϵ>1. For a decreasing function t−s, the discrepancy between its sum and integral on the kth block is at most 10−ks. Summing these discrepancies is O(1) uniformly as ϵ↓0. The integrals form a geometric series, giving ∑n∈Sn−s=(1−2−ϵ)/[ϵ(1−10−ϵ)]+O(1). Since ϵζ(1+ϵ)→1, the relative density is log⁡2/log⁡10.

1.2F1F2

For primes, the Euler logarithm gives ∑pp−s=log⁡(1/ϵ)+O(1): all terms of exponent at least two sum to at most ∑n≥2∑j≥2n−j<∞, and the zeta pole determines its logarithm. Finite sets have zero relative density, and finite additivity for disjoint sets follows by taking limits of their finite sum identities.

1.3F3F4algebra

The qualitative prime number theorem and Li⁡(x)∼x/log⁡x give E(x):=π(x)−Li⁡(x)=o(x/log⁡x); the Li asymptotic follows by integration by parts and splitting its integral at x. Put ak=10k, bk=2ak, and ηk=sup⁡x≥ak∣E(x)∣log⁡x/x, so ηk→0. For s=1+ϵ and k≥1, Stieltjes integration by parts on [ak,bk) gives ∑ak≤p<bkp−s−∫akbkx−slog⁡x dx=O ⁣(ηke−ϵklog⁡10k). Indeed each endpoint term is at most ηkx−ϵ/log⁡x, and the interior term is bounded by sηk∫akbkx−1−ϵ/log⁡x dx, of the same order for 1<s≤2. Summing over k and absorbing the initial block yields ∑p∈Sp−s=∫2∞w(log⁡x)x−slog⁡x dx+o ⁣(log⁡1ϵ), because ∑k≥1ηke−ϵklog⁡10/k=o(log⁡(1/ϵ)): split at a fixed large K and use ηk→0 on the tail. Here w is the periodic indicator of [0,log⁡2) modulo log⁡10.

2.1step 1.1algebra

Up to an endpoint error at most one, the counts at 10m and 2⋅10m are respectively (10m−1)/9 and (10m+1−1)/9. Dividing by the two endpoints yields 1/9 and 5/9. Thus an integer counting asymptotic already fails despite the density limit.

2.2step 1.2step 1.3

Set y=log⁡x. The primitive of w(y)−d is bounded because its integral over a period is zero. Integration by parts against e−ϵy/y therefore bounds its contribution by O(1), uniformly as epsilon tends to zero. The mean contribution is d∫log⁡2∞e−ϵydy/y=dlog⁡(1/ϵ)+O(1): split at 1/ϵ and substitute ϵy on the tail. The o(log⁡(1/ϵ)) error in step 1.3 vanishes after division by the prime denominator from step 1.2, proving the claimed relative Dirichlet density.

3.1F3step 2.2∎

For the prime counting limits, fix J. At X=10m, the last J completed blocks, indexed k=m−j with 1≤j≤J, have counts π(2⋅10k)−π(10k)∼10k/log⁡(10k). Relative to π(X)∼X/log⁡X, their limits sum to ∑j=1J10−j. Earlier blocks contribute at most π(10m−J)/π(10m)→10−J. Let J tend to infinity to get 1/9. At X=2⋅10m, the current block contributes relative limit 1/2, and the preceding blocks contribute (1/2)∑j≥110−j=1/18, totaling 5/9. Endpoints are composite for m positive, so they add no ambiguity. These unequal limits refute the inference for primes too.

Sources