Alphabeta Math
LemmaStatement: 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 BGG Euler identity gives the Weyl numerator

Statement

Assume the Axiom of Choice (The Axiom of Choice). For every dominant integral weight λ∈Λ+, ch⁡L(λ)⋅A(ρ)=A(λ+ρ) in the completed character ring R of The completed formal character ring; equivalently, ∑w∈W(−1)ℓ(w)ew(λ+ρ)=ch⁡L(λ)⋅eρ∏α∈Φ+(1−e−α). Both sides are finite expressions, so the identity holds in Z[P].

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, the module L(λ) with its formal character, the Weyl vector ρ, the positive system Φ+, and the alternants A(ν).

[A1]

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

[F1]

The BGG Euler identity in character form reads ch⁡L(λ)=∑w∈W(−1)ℓ(w)ew∘λ∏α∈Φ+(1−e−α)−1 in R, where w∘λ=w(λ+ρ)−ρ (The Euler-character identity for a finite-dimensional simple module, The Grothendieck group and character of O).

[F2]

The denominator identity gives A(ρ)=eρ∏α∈Φ+(1−e−α) and A(ρ)−1=e−ρ∏α∈Φ+(1−e−α)−1 (The Weyl denominator identity), and the product ∏α∈Φ+(1−e−α) is invertible (Geometric series are invertible in the completed character ring).

[F3]

A(λ+ρ)=∑w∈W(−1)ℓ(w)ew(λ+ρ) is a finite sum, ch⁡L(λ) is a finite-support element, and w∘λ+ρ=w(λ+ρ) (The Weyl alternation operator, The formal character of a finite-dimensional weight module).

[F4]

For λ∈Λ+ one has ρ∈P and λ+ρ∈P, and W preserves P, so all exponents of the two sides lie in the weight lattice and the identity is an identity of finite sums in Z[P] (Integral, dominant, and strictly dominant weights, Finite Weyl positive roots and simple reflections, The Weyl vector rho for a chosen positive system).

Proof

technique · direct
1.1F1F2F3algebraA1

Multiplying the identity [F1] by A(ρ) and substituting the product form of [F2] gives ch⁡L(λ)⋅A(ρ)=∑w∈W(−1)ℓ(w)ew∘λ∏α∈Φ+(1−e−α)−1⋅eρ∏α∈Φ+(1−e−α); the inverse and the product cancel by [F2], and w∘λ+ρ=w(λ+ρ) by [F3], so ch⁡L(λ)⋅A(ρ)=∑w∈W(−1)ℓ(w)ew(λ+ρ)=A(λ+ρ).

2.1F2F3F4step 1.1∎

Both sides of step 1.1 are finite expressions: the left side is a product of a finite-support element with a finite-support element, and the right side is the finite alternant; all exponents occurring lie in P by [F4], so the identity holds in the group ring Z[P], and reading the product form of [F2] on the left side gives the displayed equivalent form.

Depends on

Used by

Dependency tree · two levels

40 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