Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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.

Dirichlet's theorem on primes in arithmetic progressions

Statement

If q1 and (a,q)=1, then there are infinitely many primes pa(modq).

Facts & Assumptions

Given: A modulus q1 and a reduced residue class a modulo q.

[L1]

The reciprocal-prime sum in this progression satisfies px, pa(q)1/p=φ(q)1loglogx+Oq(1) (Mertens sum for primes in an arithmetic progression).

Proof

technique · direct
1.1

By [L1], the partial sums px, pa(q)1/p are unbounded, because loglogx.

L1givenalgebra
2.1

A finite set of primes would contribute a bounded reciprocal sum. Therefore the set of primes congruent to a modulo q cannot be finite.

step 1.1algebra

Depends on

Used by

Dependency tree · two levels

13 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