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.
Chebyshev psi prime number theorem error
Statement
There is an absolute such that for ,
Facts & Assumptions
Given: The data and hypotheses of the statement.
Zeta explicit formula zero free error balance: For and finite , the classical region and truncated explicit formula give Constants may be enlarged and the positive region constant decreased. The zero sum used in the proof is finite.
Zeta bounds in classical zero free region: There are and such that for and , In the narrower region, . For and , with removable interpretations at one.
Proof
Put and choose a fixed . For sufficiently large x take . Then , so the finite-zero term is , the truncation term is , and the remaining error is .
Choose . For any fixed k and positive epsilon, is bounded; thus each error above is . Enlarging the constant over the initial compact x-range proves the assertion for all .
The contour interpretation is consistent with the same bound: take with a sufficiently small region constant and . Throughout the left edge stays in the proved region. At high heights the derivative is ; integrating gives a vertical contribution , and horizontal edges give . At bounded height the pole-subtracted estimate bounds the derivative by ; on the left edge its integral is . Only the pole at one is crossed. These edge bounds explain the scale used in the finite-zero proof.
Depends on
Used by
Dependency tree · two levels
9 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
- Theorem 6.9, pp.179–181; independently Kedlaya Theorem 7.7 (standard reference, not scraped)