Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedSession-authored (Fable 5 assisted)judge pass (gpt-5.6-terra)audited 2026-08-28
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.

Euler's theorem by generating functions

Statement

For every integer n0,

pdist(n)=podd(n).

Facts & Assumptions

Given: the two formal power series for distinct-part and odd-part partitions.

[L1]

Distinct-part partitions have generating function n0pdist(n)xn=m1(1+xm) (Distinct-part product generating function).

[L2]

Odd-part partitions have generating function n0podd(n)xn=m1(1x2m1)1 (Odd-part product generating function).

Proof

technique · coefficient comparison
1.1

Fix N1. Using 1+xm=(1x2m)(1xm)1 for 1mN and canceling only the even factors that already appear in the denominator gives m=1N(1+xm)=(m=N/2+1N(1x2m))/(1jNj odd(1xj)). Every uncancelled numerator factor has degree >N, so the left-hand side and 1/1jN, j odd(1xj) have the same coefficients through degree N.

algebra
2.1

Fix n0 and choose N>n. By step 1.1, the coefficient of xn in m=1N(1+xm) equals the coefficient of xn in 1/1jN, j odd(1xj). Factors with index >N have degree >n in both products, so this is also the common coefficient of xn in the two infinite products m1(1+xm) and m1(1x2m1)1.

step 1.1
3.1

Substitute the two product expansions from [L1] and [L2] into step 2.1. The resulting formal series are equal, so [L3] gives equality of every coefficient. Hence pdist(n)=podd(n) for all n0.

step 2.1L1L2L3

Depends on

Used by

Dependency tree · two levels

8 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