Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-31
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 summatory divisor-sum function is pi squared over 12 times x squared plus O(x log x)

Statement

For every real x1,

nxσ(n)=π212x2+O(xlogx).

Facts & Assumptions

Given: A real x1, an integer M:=x, and ym:=x/m for 1mM.

Proof

technique · direct
1.1

By The divisor functions arise by Dirichlet convolution, σ(n)=dnd. Summing over nx and writing each such n as dm gives nxσ(n)=m=1Md=1ymd.

givenalgebra
2.1

For each m, d=1ymd=ym(ym+1)2=ym22+O(ym). Therefore nxσ(n)=12m=1Mym2+O ⁣(m=1Mym).

step 1.1givenalgebra
3.1

Since ym=x/m+O(1) uniformly in m, one has ym2=x2/m2+O(x/m)+O(1). Summing and using The Basel sum is pi squared over six by a residue computation together with The harmonic sum is log x plus gamma plus O(1/x) gives m=1Mym2=π26x2+O(xlogx),m=1Mym=O(xlogx).

step 2.1givenalgebra
4.1

Substituting step 3.1 into step 2.1 yields nxσ(n)=π212x2+O(xlogx).

step 2.1step 3.1givenalgebra

Depends on

Used by

Dependency tree · two levels

18 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