Alphabeta Math
LemmaStatement: 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.

The Kac Moody denominator is Weyl skew

Statement

For each simple reflection si, the shifted denominator satisfies si(D)=−D as a transformed formal sum/product, and therefore w(D)=det⁡(w)D. No action on all downward-cone series is asserted.

Facts & Assumptions

Given: A finite symmetrizable GCM and the shifted denominator.

[F1]

The product and its finite coefficient meaning, including the simple-axis factor of multiplicity one, are Kac Moody denominator product with root multiplicities.

[F2]

Weyl transformations preserve roots and multiplicities by The weyl group preserves roots and root multiplicities.

Proof

1.1F1F2algebra

A positive root other than αi has a positive simple coordinate at an index different from i: the only roots on the ith axis are ±αi by F1's root conventions. Reflection changes only coordinate i, and its image is a root by F2, so the one-sign property makes it positive. Applying the involution twice proves that si permutes Δ+∖{αi}, preserving every multiplicity. Also siρ=ρ−αi since ρ(hi)=1.

2.1F1step 1.1algebra∎

Transform all exponents of the defining product. Step 1.1 gives siD=eρ−αi(1−eαi)∏α>0, α≠αi(1−e−α)mα=−D. The positive-root product after reindexing is coefficientwise finite by F1; the single exceptional factor is a polynomial with two terms. Thus this manipulation really equals the transformed coefficient array, rather than assuming an action on the entire completion. A finite word of reflections now transforms this particular array repeatedly, producing one minus sign per reflection. Each simple reflection fixes a hyperplane and negates its complementary root line, so has determinant −1; the accumulated sign is det⁡(w) independent of the word. The identity word has sign one. Every transformation used only finite coefficient computations, with no AC.

Depends on

Used by

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