Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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.

A small lattice decomposition for Dirichlet's hyperbola method

Example

Take x=12, U=3, and V=4, so UV=12. For τ=1∗1, Dirichlet's hyperbola identity becomes

∑n≤12τ(n)=∑a≤3⌊12a⌋+∑b≤4⌊12b⌋−3⋅4.

Numerically this is

35=(12+6+4)+(12+6+4+3)−12.

Facts & Assumptions

Given: The value x=12 and the split U=3, V=4.

Verification

technique · direct
1.1given

By The divisor functions arise by Dirichlet convolution, τ=1∗1. Therefore Dirichlet's hyperbola method for summatory convolutions applies with F(y)=G(y)=⌊y⌋.

2.1step 1.1givenalgebra

The two arm sums are ∑a≤3⌊12a⌋=12+6+4=22,∑b≤4⌊12b⌋=12+6+4+3=25, and the overlap is F(3)G(4)=3⋅4=12.

3.1step 2.1givenalgebra∎

Hence the hyperbola identity gives ∑n≤12τ(n)=22+25−12=35. This matches the direct total 1+2+2+3+2+4+2+4+3+4+2+6=35.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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