Alphabeta Math
ExampleConstruction: AI-adaptedVerification: Not suppliedSession-authored (Fable 5 assisted)audited 2026-07-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.

Möbius inversion of dnφ(d)=n\sum_{d\mid n}\varphi(d)=n gives φ(n)=dnμ(d)(n/d)\varphi(n)=\sum_{d\mid n}\mu(d)(n/d)

Example

The divisor-sum theorem from the CRT development states

n=dnφ(d)n=\sum_{d\mid n}\varphi(d)

for every positive integer nn (For every positive integer nn, dn, d>0φ(d)=n\sum_{d\mid n,\ d>0}\varphi(d)=n). Apply Classical Möbius inversion over positive divisors with g(n)=ng(n)=n and f(n)=φ(n)f(n)=\varphi(n). The form indexed by the complementary divisor gives

φ(n)=dnμ(d)g(n/d)=dnμ(d)nd.\varphi(n)=\sum_{d\mid n}\mu(d)g(n/d)=\sum_{d\mid n}\mu(d)\frac nd.

At n=12n=12, the values from The number-theoretic Möbius function μ(n)\mu(n) from prime factorisation give

φ(12)=1264+0+2+0=4,\varphi(12)=12-6-4+0+2+0=4,

where the terms correspond to d=1,2,3,4,6,12d=1,2,3,4,6,12. Thus Möbius inversion recovers φ(12)=4\varphi(12)=4 directly from the CRT divisor-sum theorem.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 100 results over 23 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources