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.

Kostant's weight multiplicity formula

Statement

Assume the Axiom of Choice (The Axiom of Choice). For every dominant integral weight λ∈Λ+ and every μ∈h∗, the multiplicity of μ as a weight of the finite-dimensional simple module L(λ) is mλ(μ)=∑w∈W(−1)ℓ(w)P(w(λ+ρ)−(μ+ρ)), where P is the Kostant partition function of The Kostant partition function and P(ν)=0 for ν∉Q+.

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, an element μ∈h∗, the multiplicities mλ(μ) of L(λ), the Kostant partition function P and the completed character ring R.

[A1]

The Axiom of Choice is assumed; it enters through the Weyl character formula of [F1] (The Axiom of Choice).

[F1]

ch⁡L(λ)=A(λ+ρ)⋅A(ρ)−1 with A(λ+ρ)=∑w∈W(−1)ℓ(w)ew(λ+ρ) and A(ρ)−1=e−ρ∏α∈Φ+(1−e−α)−1 (The Weyl character formula, The Weyl denominator identity, The Weyl alternation operator, Geometric series are invertible in the completed character ring).

[F2]

∏α∈Φ+(1−e−α)−1=∑β∈Q+P(β)e−β in R, with P(β)∈Z≥0 finite and P(ν)=0 for ν∉Q+ (The Kostant partition function).

[F3]

ch⁡L(λ)=∑μmλ(μ)eμ, so mλ(μ) is the coefficient of eμ in ch⁡L(λ) (The formal character of a finite-dimensional weight module).

[F4]

In R the coefficient of eη in a product is the finite sum ∑γ+δ=ηcγdδ of the coefficients of the factors, and coefficient extraction is additive over finite sums (The completed formal character ring).

Proof

technique · direct
1.1F1F2F3algebraA1

Substituting [F2] into A(ρ)−1=e−ρ∏α∈Φ+(1−e−α)−1 of [F1] and multiplying out gives ch⁡L(λ)=∑w∈W(−1)ℓ(w)ew(λ+ρ)−ρ∑β∈Q+P(β)e−β, an identity in the ring R; by [F3] the multiplicity mλ(μ) is the coefficient of eμ on both sides.

2.1F2F4step 1.1algebra∎

By [F4] the coefficient of eμ in the product of step 1.1 is ∑w∈W(−1)ℓ(w)∑β∈Q+w(λ+ρ)−ρ−β=μP(β), a finite sum because the w-sum is finite and for each w at most one β=w(λ+ρ)−ρ−μ occurs; writing w(λ+ρ)−ρ−μ=w(λ+ρ)−(μ+ρ) and using P(ν)=0 for ν∉Q+ from [F2] turns this into ∑w∈W(−1)ℓ(w)P(w(λ+ρ)−(μ+ρ)), which equals mλ(μ) by step 1.1.

Depends on

Used by

Dependency tree · two levels

39 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