Alphabeta Math
PropositionStatement: Literature-sourcedProof: 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.

Affine denominator separates real and imaginary root factors

Statement

For the untwisted affine algebra of a finite simple Lie algebra with positive roots Φ0+ and rank , put q=eδ. Its normalized denominator is P=n1(1qn)αΦ0+(n0(1eαqn)n1(1eαqn)). The first product is imaginary, of multiplicity per root; both real families have multiplicity one. The shifted denominator is eρP.

Facts & Assumptions

Given: The normalized untwisted loop realization and its standard positive simple roots.

[F1]

The denominator identity uses actual root multiplicities by Kac Moody denominator identity.

[F2]

The null root convention is Null root, central coroot, and affine level.

[F3]

Roots of an untwisted affine Lie algebra gives the root list, multiplicities and root spaces.

[F4]

Loop and affine GCM presentations are isomorphic identifies these with the GCM roots.

[F5]

The highest root satisfies θβQ+ for every finite root β, and δ=α0+θ, by The affine simple root alpha zero is delta minus the highest root.

[F6]

Every finite root has simple coordinates of one sign by Finite Weyl positive roots and simple reflections.

Proof

1.1

F3 and F4 give real roots α+nδ for every finite root α and integer n, with multiplicity one. Their positive members are those with n>0, together with n=0 and αΦ0+. For n>0 and αΦ0+, F5 gives α+nδ=nα0+(nθ+α)Q+. For α=β with βΦ0+, it gives β+nδ=nα0+(n1)θ+(θβ)Q+. These exhaust the two finite-root signs by F6. Negation handles n<0, while n=0 has the finite-root sign. Imaginary positive roots are exactly nδ, n1, because δ=α0+θQ+; F3 gives their multiplicity . The value n=0 gives Cartan weight zero and is not a root.

F2F3F4F5F6algebra
2.1

Split the finite roots in step 1.1 into αΦ0+ and their negatives. Their exponentials are respectively eαqn for n0 and eαqn for n1. Imaginary roots contribute qn for n1. Inserting these disjoint exhaustive families, with their multiplicities, in F1's product gives the displayed expression. No root is lost or repeated, and regrouping is permitted because each coefficient has only finitely many contributing root factors, as in F1. Rank one gives exponent one on the imaginary product, whereas larger rank retains . This is a formal reindexing with no analytic convergence or AC assumption.

F1step 1.1algebra

Depends on

Used by

Dependency tree · two levels

22 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