Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Real and imaginary factors in the affine sl2 denominator

Example

For untwisted affine sl2, write q=e−δ and z=e−α. The normalized positive-root denominator is P=∏n≥1(1−qn)∏n≥0(1−zqn)∏n≥1(1−z−1qn). Its imaginary factors are the first product; its real factors are the other two.

Facts & Assumptions

Given: Finite rank one with positive root α.

[F1]

Affine denominator separates real and imaginary root factors supplies the three root families and their multiplicities.

Verification

1.1F1algebra

Here ℓ=1 and Φ0+={α}. The roots nδ give qn for n≥1; α+nδ give zqn for n≥0; −α+nδ give z−1qn for n≥1. F1 says all these factors have exponent one in this rank. Substitution gives the stated product.

2.1F1step 1.1algebra∎

In particular its degree-zero factor is 1−z. To first degree in q, the remaining factors are (1−q)(1−zq)(1−z−1q); factors with index at least two contribute only at degree at least two. Thus P=(1−z)(1−(1+z+z−1)q+O(q2)). This calculation checks both index endpoints: omitting n=0 from the positive family loses 1−z, while including it in the negative family adds the nonexistent root −α. The grouping is coefficientwise formal as in F1, with no analytic Jacobi identity asserted.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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