Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Prime number theorem logarithmic integral

Statement

Assume countable choice.

For some absolute c>0 and every x≥2, π(x)=Li⁡(x)+O(xe−clog⁡x).

Facts & Assumptions

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

[F1]

Chebyshev theta prime number theorem error: For some absolute c>0 and all x≥2, θ(x)=x+O(xe−clog⁡x).

[F2]

Logarithmic integral: For real x≥2, define Li⁡(x)=∫2xdtlog⁡t. In particular Li⁡(2)=0. The integral never crosses the singularity at one.

[F3]

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

Proof

1.1F2F3

Set E(t)=θ(t)−t. The exact partial-summation identity gives π(x)=x/log⁡x+∫2xdt/log⁡2t+E(x)/log⁡x+∫2xE(t)/(tlog⁡2t) dt. Integration by parts in the definition of Li makes its main term Li⁡(x)+2/log⁡2.

2.1F1step 1.1∎

Under countable choice, use the supplied theta error and, for x≥4, split the error integral at x. The initial part is O(x) because E(t)=O(t). The second is O(xe−(c0/2)log⁡x) using the theta error and log⁡t≥log⁡2. The endpoint error has the same form. Decrease the positive exponent constant and absorb 2/log⁡2 and the compact range 2≤x≤4.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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