Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 Weyl denominator identity

Statement

Assume the Axiom of Choice (The Axiom of Choice). In the completed character ring R of The completed formal character ring, A(ρ)=eρ∏α∈Φ+(1−e−α); equivalently ∑w∈W(−1)ℓ(w)ewρ=eρ∏α∈Φ+(1−e−α)and∑w∈W(−1)ℓ(w)ewρ=∏α∈Φ+(eα/2−e−α/2), where ρ=12∑α∈Φ+α is the Weyl vector (The Weyl vector rho for a chosen positive system) and A(ρ) is the alternant of The Weyl alternation operator. Both sides are finite expressions: the left side is a finite sum and the right side is a finite product, and the identity holds in the group ring Z[P]. Consequently A(ρ) is invertible, with A(ρ)−1=e−ρ∏α∈Φ+(1−e−α)−1.

Facts & Assumptions

Given: The Axiom of Choice, the finite root system with positive system Φ+, Weyl group W, length ℓ and Weyl vector ρ, the completed character ring R, and the alternants A(ν).

[A1]

The Axiom of Choice is assumed; it enters through the BGG Euler identity of [F1] and the classification of [F2] (The Axiom of Choice).

[F1]

For every λ∈Λ+ the BGG Euler identity gives ch⁡L(λ)=∑w∈W(−1)ℓ(w)ew∘λ∏α∈Φ+(1−e−α)−1 in R, where the dot action is w∘λ=w(λ+ρ)−ρ; in particular w∘0=wρ−ρ (The Euler-character identity for a finite-dimensional simple module, The Grothendieck group and character of O).

[F2]

L(0) is the trivial one-dimensional module: the module C with zero action is finite-dimensional, irreducible and of highest weight 0, so by the classification it is L(0), and ch⁡C=e0=1 (Highest-weight classification, The highest-weight space is one-dimensional, Representations of Lie algebras, The formal character of a finite-dimensional weight module).

[F3]

The product eρ∏α∈Φ+(1−e−α) is invertible in R, with inverse e−ρ∏α∈Φ+(1−e−α)−1 (Geometric series are invertible in the completed character ring).

[F4]

ρ∈P: the pairings ⟨ρ,β∨⟩ are positive integers for every positive root β (Positive coroot pairings of a dominant integral weight, Integral, dominant, and strictly dominant weights), and W preserves the weight lattice P, so every wρ and every exponent ρ−∑α∈Sα occurring in the expansion of the finite product lies in P (Finite Weyl positive roots and simple reflections, Finite Weyl root system, lattice and chamber conventions).

[F5]

A(ρ)=∑w∈W(−1)ℓ(w)ewρ is the finite alternant of The Weyl alternation operator, and monomials satisfy eμeν=eμ+ν, so eα/2−e−α/2=e−α/2(eα−1) and ∏α∈Φ+e±α/2=e±ρ in R (The completed formal character ring).

Proof

technique · direct
1.1F1F2algebraA1

The Euler identity [F1] at the dominant integral weight λ=0 reads ch⁡L(0)=∑w∈W(−1)ℓ(w)ewρ−ρ∏α∈Φ+(1−e−α)−1, and [F2] gives ch⁡L(0)=1=e0.

2.1F3F5step 1.1algebra

Multiplying both sides of step 1.1 by the invertible element eρ∏α∈Φ+(1−e−α) of [F3] and cancelling the inverse against the product yields eρ∏α∈Φ+(1−e−α)=∑w∈W(−1)ℓ(w)ewρ−ρ+ρ=A(ρ), which is the first form of the identity.

3.1F5step 2.1algebra

For the half-root form, expand each factor using [F5]: ∏α∈Φ+(eα/2−e−α/2)=∏α∈Φ+e−α/2∏α∈Φ+(eα−1)=e−ρ(−1)∣Φ+∣∏α∈Φ+(1−eα)=e−ρ(−1)∣Φ+∣(−1)∣Φ+∣e2ρ∏α∈Φ+(1−e−α)=eρ∏α∈Φ+(1−e−α), using 1−eα=−eα(1−e−α) and ∑α∈Φ+α=2ρ; with step 2.1 this equals A(ρ).

4.1F3F4step 2.1step 3.1algebra∎

All exponents in A(ρ) are the wρ, and all exponents in the expanded right side are ρ minus sums of positive roots; both lie in P by [F4], so the identity of steps 2.1 and 3.1 is an identity in Z[P], and since A(ρ) equals the invertible element of [F3], it is invertible with the stated inverse.

Depends on

Used by

Dependency tree · two levels

56 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