Alphabeta Math
Pipeline-generated
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.

✓ 21 results · all verified · 20 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Weyl Character and Multiplicity Formulas

1 · Prerequisites

2 · Summary

This page proves the denominator and character formulas rather than citing them. The completed formal character ring R supplies the ambient algebra in which Verma characters and finite products of geometric series are legitimate formal objects; the BGG resolution of the predecessor page produces the Euler-character identity, whose value at the trivial weight is the Weyl denominator identity after multiplying by the Verma denominator. Dividing by the invertible alternant A(ρ), or equivalently multiplying the Euler identity by the denominator, yields the Weyl character formula A(λ+ρ)A(ρ)−1, presented as a formal quotient in R with no ordinary-function quotient intended before cancellation.

Extracting coefficients from that formal quotient introduces the Kostant partition function and gives Kostant's multiplicity formula; the finite-sum evaluation eν↦exp⁡(2t(ν,ρ)) with t→0+ regularizes the quotient at the trivial element and gives the Weyl dimension formula. In parallel, tracing the Casimir element on a weight space and summing over α-strings yields Freudenthal's recursion, whose coefficients are positive at actual non-top weights by the shifted-norm inequality and whose computation terminates by induction on simple-root height for each requested weight; the two algorithms are cross-checked on the sl3 adjoint module on the companion page.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-6.1-sol)Open item page →

The completed formal character ring

Definition

Fix the finite Weyl root-system data of Finite Weyl root system, lattice and chamber conventions: the real span E of the roots with its positive definite form, a positive system Φ+ with base α1,…,αr, the root group Q=∑α∈ΦZα⊆P, the weight lattice P⊆E, and the positive cone Q+=∑i=1rZ≥0αi (the set written Q+ in The Grothendieck group and character of O). A downward cone is a set λ−Q+={λ−β:β∈Q+} with λ∈h∗.

The completed formal character ring R is the set of formal sums f=∑μ∈h∗cμeμ,cμ∈Z, whose support supp⁡f={μ:cμ≠0} is contained in a finite union of downward cones. Addition is coefficientwise, the product is the convolution (fg)η=∑μ+ν=ηcμdν, and the unit is e0, so that eμeν=eμ+ν. The product is well defined: if supp⁡f lies in ⋃i=1m(λi−Q+) and supp⁡g in ⋃j=1n(μj−Q+), then a pair of exponents contributing to η lies in some λi−Q+ and some μj−Q+, and the solutions β,γ∈Q+ of β+γ=λi+μj−η are the elements of the box 0≤βk≤(λi+μj−η)k in the simple-root coordinates, a finite set (empty unless λi+μj−η∈Q+). The coefficients are integers, and a finite union of downward cones is again such a union, so addition and multiplication make R a commutative Z-algebra. In the notation of The Grothendieck group and character of O this is the ring denoted R there, where the character homomorphism of category O takes its values; the elements of finite support form the group ring Z[h∗] of the additive group h∗ and contain the subring Z[P] generated by the eμ with μ∈P.

By The formal character of a Verma module, ch⁡M(λ)=eλ∏α∈Φ+(1−e−α)−1 is an element of R: the geometric series ∑k≥0e−kα is supported in the downward cone −Q+, and a finite product of elements of R lies in R by the convolution formula, while eλ is a single monomial. No convergence of any formal sum is asserted: all sums are formal, coefficients are compared coefficientwise, and every finite sum, product or finite product of geometric series below is interpreted in R by the rules just recorded.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Casimir comparison on a weight space

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let g be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra h and root system Φ with a chosen positive system Φ+, and let C∈U(g) be the quadratic Casimir element of The quadratic Casimir element. Let h1,…,hr and h1,…,hr be bases of h dual with respect to the Killing form B of The Killing form of a semisimple Lie algebra, so that B(hj,hk)=δjk, and for every α∈Φ+ choose eα∈gα and fα∈g−α with B(eα,fα)=1; then [eα,fα]=Hα is the Killing-dual vector of α (Opposite root spaces bracket to the Killing-dual line). Then C=∑j=1rhjhj+∑α∈Φ+(eαfα+fαeα) in U(g), and for every dominant integral λ∈Λ+ and every μ∈h∗, writing mλ(μ)=dim⁡L(λ)μ for the multiplicity of μ as a weight of the finite-dimensional simple module L(λ) (Highest-weight classification), tr⁡L(λ)μ(C)=mλ(μ)(μ,μ)+∑α∈Φ+tr⁡L(λ)μ(eαfα+fαeα). Since C acts on L(λ) by the scalar (λ,λ+2ρ) (The quadratic Casimir eigenvalue on a highest-weight module is (λ,λ+2ρ)), where ρ is the Weyl vector (The Weyl vector rho for a chosen positive system) and the pairing on h∗ is the one induced by B, also tr⁡L(λ)μ(C)=mλ(μ)(λ,λ+2ρ), hence ((λ,λ+2ρ)−(μ,μ))mλ(μ)=∑α∈Φ+tr⁡L(λ)μ(eαfα+fαeα).

Facts & Assumptions

Given: The Axiom of Choice, such g and h with chosen positive system Φ+, the Casimir element C, the two dual bases hj,hj of h, and vectors eα,fα with B(eα,fα)=1 for each α∈Φ+; also λ∈Λ+ and μ∈h∗.

[A1]

The Axiom of Choice is assumed; it enters through the root-space theory supplying [F1] and [F3] and through the classification of [F6] (The Axiom of Choice).

[F1]

Under Choice, the supplied Cartan subalgebra is maximal toral by Cartan subalgebras are exactly maximal toral subalgebras. Hence g has the finite root-space decomposition g=h⊕⨁α∈Φgα, every root space is one-dimensional, B restricts nondegenerately to h, pairs opposite root spaces perfectly, and pairs no other two weight spaces, and the Killing-dual vector Hα satisfies B(Hα,h)=α(h) for h∈h (Finite semisimple Cartan, root and string structure).

[F2]

For any B-dual bases x1,…,xn and x1,…,xn of g one has C=∑ixixi, independent of the choice of dual bases (The quadratic Casimir element).

[F3]

If x∈gα and y∈g−α, then [x,y]=B(x,y)Hα, and B(x,y)=0 whenever x∈gα, y∈gβ with α+β≠0 (Opposite root spaces bracket to the Killing-dual line, Under Choice, the Killing form pairs only opposite root spaces).

[F4]

Vμ={v∈V:H⋅v=μ(H)v for all H∈h} for every representation V of g (Weight and weight space); if x∈gα then x⋅v∈Vμ+α for v∈Vμ (Root vectors shift weights); and the action of g extends to a unital action of U(g) under which a product xy acts by composition of the operators (Lie representations are U(g)-modules).

[F5]

The Killing form induces a pairing ( , ) on h∗ and μ(Hα)=(μ,α) for every μ∈h∗ and every root α (The Killing form of a semisimple Lie algebra, The quadratic Casimir eigenvalue on a highest-weight module is (λ,λ+2ρ)).

[F6]

For λ∈Λ+ the module L(λ) is a cyclic highest-weight module of highest weight λ, and C acts on it by the scalar (λ,λ+2ρ); it is finite-dimensional, so each L(λ)μ is finite-dimensional (Highest-weight classification, The quadratic Casimir eigenvalue on a highest-weight module is (λ,λ+2ρ), The quadratic Casimir element is central).

Proof

technique · direct
1.1F1F2F3algebraA1

The union {h1,…,hr}∪{eα}α∈Φ+∪{fα}α∈Φ+ is a basis of g, because [F1] decomposes g into h and the one-dimensional root spaces, and its B-dual basis is {h1,…,hr}∪{fα}∪{eα}, because B(hj,hk)=δjk by hypothesis, B(eα,fβ)=δαβ by [F3] and B(eα,fα)=1, and every other pairing of these vectors vanishes by [F3]; with [F2] this gives the displayed expansion of C.

2.1F1F4F5step 1.1algebra

The element hjhj acts on L(λ)μ by the scalar μ(hj)μ(hj) by [F4], so the trace of the Cartan part is dim⁡L(λ)μ∑jμ(hj)μ(hj); to identify the sum, let Hμ∈h be the vector with B(Hμ,h)=μ(h), which exists and is unique because B is nondegenerate on h, and note that B(Hμ,hj)=μ(hj), so the vector ∑jB(Hμ,hj)hj pairs with each hk as B(Hμ,hk) and therefore equals Hμ; applying B(Hμ,⋅) gives ∑jμ(hj)μ(hj)=B(Hμ,Hμ)=(μ,μ) by symmetry of B and the definition of the induced pairing, while μ(Hα)=B(Hμ,Hα)=(μ,α) by the same definition.

2.2step 1.1algebra

Since the trace is linear and C is the sum of the Cartan part and the root part by step 1.1, tr⁡L(λ)μ(C)=tr⁡L(λ)μ(∑jhjhj)+∑α∈Φ+tr⁡L(λ)μ(eαfα+fαeα).

3.1step 2.1step 2.2F6∎

Combining steps 2.1 and 2.2, tr⁡L(λ)μ(C)=mλ(μ)(μ,μ)+∑α∈Φ+tr⁡L(λ)μ(eαfα+fαeα), and by [F6] the same trace equals mλ(μ)(λ,λ+2ρ); subtracting the Cartan term from both expressions for the trace gives the stated comparison identity.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The difference of the Weyl vector from its reflections is a sum of positive roots

Statement

Let Φ be the root system with positive system Φ+, simple roots α1,…,αr, Weyl group W and Weyl vector ρ=12∑α∈Φ+α (Finite Weyl root system, lattice and chamber conventions, The Weyl vector rho for a chosen positive system, Root reflections and the Weyl group action). For every w∈W, ρ−wρ=∑α∈Φ+w−1α∈Φ−α, the sum running over the positive roots whose image under w−1 is a negative root. In particular ρ−wρ∈Q+: it is a nonnegative integral combination of the simple roots.

Facts & Assumptions

Given: The finite root-system, positivity, length and lattice conventions of Finite Weyl root system, lattice and chamber conventions, a positive system Φ+ with simple roots αi, the Weyl group W, the Weyl vector ρ, and an element w∈W.

[F3]

The reflection sα acts by sα(λ)=λ−⟨λ,α∨⟩α and the Weyl vector is ρ=12∑α∈Φ+α (Root reflections and the Weyl group action, The Weyl vector rho for a chosen positive system).

[F4]

Every positive root is a nonnegative integral combination of the simple roots, so Φ+⊆Q+ (Simple roots form a signed integral basis, Finite Weyl root system, lattice and chamber conventions).

Proof

technique · direct
1.1F3givenalgebra

Put S={α∈Φ+:w−1α∈Φ−}. Since w permutes the roots, wΦ+ contains α for each α∈Φ+∖S and −α for each α∈S, each exactly once: these assertions are respectively equivalent to w−1α>0 and w−1(−α)>0. Therefore 2wρ=∑α∈Φ+∖Sα−∑α∈Sα.

2.1F3F4step 1.1algebra∎

Subtracting the expression in step 1.1 from 2ρ=∑α∈Φ+α gives ρ−wρ=∑α∈Sα. Every summand belongs to Q+ by [F4], proving the claimed cone inclusion. For w=1 or the empty root system the sum is empty and the same calculation gives zero.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The sign of the Weyl length is multiplicative

Statement

Let W be the Weyl group of the root system Φ with its real span E=span⁡RΦ and length function ℓ (Finite Weyl root system, lattice and chamber conventions, Root reflections and the Weyl group action). Then (−1)ℓ(uv)=(−1)ℓ(u)(−1)ℓ(v)(u,v∈W), so that w↦(−1)ℓ(w) is a group homomorphism W→{±1}, and this homomorphism is the determinant of the action of W on E: (−1)ℓ(w)=det⁡(w) for every w∈W. In particular (−1)ℓ(w−1)=(−1)ℓ(w).

Facts & Assumptions

Given: The finite root system Φ spanning the real vector space E of dimension n with its positive definite form, the Weyl group W generated by the root reflections sα, its simple reflections si and the length function ℓ, and elements u,v,w∈W.

[F1]

For each root α the reflection sα(λ)=λ−⟨λ,α∨⟩α fixes α⊥ pointwise and sends α to −α; in particular E=Rα⊕α⊥ and α∧e2∧⋯∧en is a nonzero element of ΛnE for a basis e2,…,en of α⊥ (Root reflections and the Weyl group action, Finite Weyl root system, lattice and chamber conventions).

[F2]

If T:V→V is an endomorphism of an n-dimensional vector space, then ΛnT=det⁡(T)⋅id⁡ΛnV on the one-dimensional space ΛnV; and det⁡(S∘T)=det⁡(S)det⁡(T) for endomorphisms S,T (On ΛnV, the induced map ΛnT is multiplication by det⁡T, Determinant multiplicativity follows from the top exterior power).

[F3]

The simple reflections generate W and ℓ(w) is the least number of simple reflections in an expression for w; every simple reflection si is a root reflection and ℓ(si)=1; all of this includes the case Φ=∅, where E=0 and W={1} (Finite Weyl positive roots and simple reflections, Finite Weyl root system, lattice and chamber conventions, Weyl length equals inversion number).

Proof

technique · direct
1.1F1F2algebra

If E=0, then W={1} and both the length sign and the determinant of its identity are 1, so all assertions hold. Assume dim⁡E≥1. For every root α one has det⁡(sα)=−1: choosing the basis (α,e2,…,en) of E with e2,…,en a basis of α⊥, [F1] gives sα(α)=−α and sα(ei)=ei, so Λnsα(α∧e2∧⋯∧en)=(−α)∧e2∧⋯∧en=−(α∧e2∧⋯∧en), and since this wedge is a basis of the one-dimensional space ΛnE, [F2] forces det⁡(sα)=−1.

2.1F2F3step 1.1algebra

Every w∈W is a product of simple reflections by [F3]; if w=si1⋯sik is any such expression, then repeated use of [F2] together with step 1.1 gives det⁡(w)=∏j=1kdet⁡(sij)=(−1)k, so det⁡(w) agrees with (−1)k for every expression of w; choosing an expression of minimal length k=ℓ(w), which exists by [F3], gives det⁡(w)=(−1)ℓ(w).

3.1F2step 2.1algebra∎

For u,v∈W the multiplicativity in [F2] and step 2.1 give (−1)ℓ(uv)=det⁡(uv)=det⁡(u)det⁡(v)=(−1)ℓ(u)(−1)ℓ(v), so w↦(−1)ℓ(w) is a homomorphism W→{±1} agreeing with the determinant; applying it to w−1 and using det⁡(w)−1=det⁡(w)∈{±1} gives (−1)ℓ(w−1)=det⁡(w−1)=det⁡(w)=(−1)ℓ(w).

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-6.1-sol)Open item page →

The formal character of a finite-dimensional weight module

Definition

Assume the Axiom of Choice (The Axiom of Choice). Let V be a finite-dimensional g-module, where g is a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra h, and let V=⨁μ∈h∗Vμ be its weight-space decomposition, with Vμ the weight space of Weight and weight space (Finite-dimensional modules decompose into weight spaces). The formal character of V is ch⁡V:=∑μ∈h∗(dim⁡Vμ)eμ∈R, the finite sum with integer coefficients taken in the completed formal character ring R of The completed formal character ring; equivalently, ch⁡V is the coefficient family μ↦dim⁡Vμ on h∗, which has finite support by the cited decomposition.

We write mλ(μ):=dim⁡L(λ)μ for the multiplicity of μ as a weight of the finite-dimensional simple module L(λ) of highest weight λ∈Λ+ (Highest-weight classification), so that ch⁡L(λ)=∑μmλ(μ)eμ; the coefficients mλ(μ) are nonnegative integers and mλ(μ)=0 for all but finitely many μ.

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Weyl alternation operator

Definition

Let W be the Weyl group of the root system of g, acting on h∗ by the root reflections of Root reflections and the Weyl group action; by The Weyl group is finite and faithful and Finite Weyl root system, lattice and chamber conventions, W is a finite group and it permutes the roots, hence preserves the root lattice Q and the weight lattice P (Finite Weyl positive roots and simple reflections).

Action on finite support. Every w∈W maps the finite subsets of h∗ to finite subsets, so the assignment w⋅eμ:=ewμ extends uniquely to a Z-algebra automorphism f↦w⋅f of the group ring of finite-support elements of the completed character ring R (The completed formal character ring), with inverse w−1⋅(−); it restricts to a Z-algebra automorphism of Z[P], because W preserves the weight lattice P. Caveat. If Φ≠∅, this formula does not define an action on all of R. For a simple root αi, the series ∑k≥0e−kαi lies in R, whereas its image under si has support {kαi:k≥0}, outside every finite union of downward cones: in each cone the ith simple-root coordinate is bounded above. If Φ=∅, then Q+={0}, every cone is a point, R has only finite-support elements and W={1} acts trivially. Only finite-support elements are acted on below.

The alternation operator. For ν∈h∗ define the Weyl alternation operator by A(ν):=∑w∈W(−1)ℓ(w)ewν, the sum being finite because W is finite; here ℓ is the length function of Finite Weyl root system, lattice and chamber conventions turned into the sign homomorphism of The sign of the Weyl length is multiplicative. By The sign of the Weyl length is multiplicative the coefficients (−1)ℓ(w) define the determinant sign of w acting on the real span E=span⁡RΦ of the roots. Since the sum is finite, A(ν) is a finite-support element of R for every ν, and when ν∈P it lies in Z[P]⊆R.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Positive root strings sum the Freudenthal correction

Statement

Assume the Axiom of Choice. Keep the notation of The Casimir comparison on a weight space: g is a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra h and positive system Φ+, the vectors eα∈gα and fα∈g−α satisfy B(eα,fα)=1, so that [eα,fα]=Hα is the Killing-dual vector of α, and mλ(μ)=dim⁡L(λ)μ for λ∈Λ+. Then for every λ∈Λ+, μ∈h∗ and α∈Φ+, tr⁡L(λ)μ(eαfα+fαeα)=mλ(μ)(μ,α)+2∑j≥1mλ(μ+jα)(μ+jα,α), the sum being finite because L(λ) has only finitely many weights.

Facts & Assumptions

Given: The Axiom of Choice, such g,h,Φ+, vectors eα,fα with B(eα,fα)=1 for a fixed α∈Φ+, a dominant integral weight λ, and an element μ∈h∗.

[A1]

The Axiom of Choice is assumed; it enters only through the published classification and Casimir suppliers used in [F4] (The Axiom of Choice).

[F1]

On the weight space L(λ)ν the Cartan element Hα acts by the scalar (ν,α), and [eα,fα]=Hα (The Casimir comparison on a weight space, Opposite root spaces bracket to the Killing-dual line).

[F2]

eα maps L(λ)ν into L(λ)ν+α and fα maps it into L(λ)ν−α (Root vectors shift weights, Weight and weight space).

[F3]

The weight set of L(λ) is finite, since its distinct nonzero weight spaces are independent in a finite-dimensional vector space (Weight and weight space, Highest-weight classification).

[F4]

L(λ) is a finite-dimensional irreducible highest weight module of highest weight λ, so all its weight spaces are finite-dimensional and the traces below are finite sums of matrix traces (Highest-weight classification, The Casimir comparison on a weight space).

Proof

technique · direct
1.1F2F3F4A1

Fix α∈Φ+ and set Vi=L(λ)μ+iα for every i∈Z, allowing Vi=0. Let Ai:Vi→Vi+1 and Bi+1:Vi+1→Vi be the actions of eα,fα, and put Ti=tr⁡Vi(Bi+1Ai). By [F3] there is an integer N≥0 such that Vi=0 for all i>N, even if the whole line contains no weights; in particular TN=0.

2.1F1F4step 1.1algebra

For maps A:U→Z and B:Z→U between finite-dimensional spaces, tr⁡U(BA)=tr⁡Z(AB): in bases both traces equal ∑p,qBpqAqp, including zero-dimensional spaces. Applying this to Ai,Bi+1 and using [eα,fα]=Hα on Vi+1 gives Ti=Ti+1+mλ(μ+(i+1)α)(μ+(i+1)α,α). Telescoping from i=0 to N therefore gives T0=∑j≥1mλ(μ+jα)(μ+jα,α), with only finitely many nonzero terms.

3.1F1step 1.1step 2.1algebra∎

On V0, the commutator identity gives tr⁡(eαfα)=tr⁡(fαeα)+mλ(μ)(μ,α)=T0+mλ(μ)(μ,α). Adding the trace of fαeα and substituting step 2.1 proves the asserted formula, including absent weights and an empty line.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The shifted norm of a weight is maximal only at the top weight

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ∈Λ+ be a dominant integral weight and let μ be a weight of the finite-dimensional simple module L(λ) (Highest-weight classification, Weight and weight space). With ρ the Weyl vector (The Weyl vector rho for a chosen positive system), (μ+ρ,μ+ρ)≤(λ+ρ,λ+ρ), with equality if and only if μ=λ. Consequently (λ+ρ,λ+ρ)−(μ+ρ,μ+ρ) is strictly positive for every weight μ≠λ of L(λ).

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, a weight μ of L(λ), the form ( , ) on E=span⁡RΦ, the Weyl group W and the Weyl vector ρ.

[A1]

The Axiom of Choice is assumed; it enters through the published weight-multiplicity and highest-weight suppliers, which carry it (The Axiom of Choice).

[F1]

Every W-orbit in E has exactly one point in the closed chamber C‾, so every weight has a unique dominant representative (Finite Weyl closed chambers and stabilizers, Finite Weyl root system, lattice and chamber conventions), and the weight multiplicities of L(λ) are W-invariant, so the weight set of L(λ) is stable under W (Simple reflections preserve weight multiplicities).

[F2]

Every weight ν of L(λ) satisfies ν≤λ, that is, λ−ν∈Q+ (Highest weight modules lie below the top weight, Simple roots form a signed integral basis).

[F3]

For every w∈W one has ρ−wρ=∑α∈Φ+,w−1α<0α∈Q+ (The difference of the Weyl vector from its reflections is a sum of positive roots).

[F4]

The action of W on E is by isometries of ( , ): (wν,wη)=(ν,η) (Finite Weyl root system, lattice and chamber conventions, Root reflections and the Weyl group action).

[F5]

Pairings against Q+: for δ∈Q+∖{0} one has (δ,ρ)>0; for δ∈Q+ and a dominant ν one has (δ,ν)≥0, because writing δ=∑iniαi with ni≥0 gives (αi,ν)=(αi,αi)2⟨ν,αi∨⟩ and ⟨ρ,αi∨⟩>0, so in particular μ++ρ is strictly dominant (Positive coroot pairings of a dominant integral weight, Integral, dominant, and strictly dominant weights).

[F6]

For a dominant integral λ and v∈W with reduced expression v=si1⋯sik one has λ−vλ=∑l=1k⟨λ,αil∨⟩ βl with every βl=si1⋯sil−1αil a positive root and every coefficient ⟨λ,αil∨⟩≥0; this is the reduced-word telescoping with prefix positivity from Finite Weyl strong exchange and deletion and Finite Weyl positive roots and simple reflections.

Proof

technique · direct
1.1F1F2F3F4algebraA1

Let μ+ be the unique dominant representative of the W-orbit of μ, which exists by [F1], and note that μ+ is also a weight of L(λ) by the W-invariance in [F1]; choose w∈W with μ+=wμ and put δ:=λ−μ+, so that δ∈Q+ by [F2], and put γ:=ρ−wρ, so that γ∈Q+ by [F3]; since w is an isometry by [F4], (μ+ρ,μ+ρ)=(w(μ+ρ),w(μ+ρ))=(μ++wρ,μ++wρ) and μ++wρ=μ++ρ−γ.

2.1F4step 1.1algebra

With D:=(λ+ρ,λ+ρ)−(μ+ρ,μ+ρ) steps 1.1 gives D=(μ++ρ+δ,μ++ρ+δ)−(μ++ρ−γ,μ++ρ−γ)=(δ+γ,2(μ++ρ)+δ−γ), and expanding this bilinear expression yields D=2(δ,μ++ρ)+(δ,δ)+2(γ,μ+)+(2(γ,ρ)−(γ,γ)); the last bracket is (γ,2ρ−γ)=(ρ−wρ,ρ+wρ)=(ρ,ρ)−(wρ,wρ)=0 by symmetry and the isometry property [F4].

3.1F5step 2.1algebra

Hence D=2(δ,μ++ρ)+(δ,δ)+2(γ,μ+) with δ,γ∈Q+ by step 1.1; the first term is nonnegative and the third is nonnegative because μ+ is dominant and μ++ρ is strictly dominant, while (δ,δ)≥0 by positive definiteness of the form, so D≥0; if δ≠0 then D≥2(δ,ρ)>0 by [F5], so equality forces δ=0, that is, μ+=λ.

4.1F5F6step 1.1step 2.1step 3.1algebra∎

Suppose δ=0, so μ+=λ and μ=w−1λ; then steps 1.1 and 2.1 give D=2(γ,λ)=2((ρ,λ)−(wρ,λ))=2(ρ,λ−w−1λ)=2(ρ,λ−μ), and [F6] applied to v=w−1 writes λ−μ=∑l⟨λ,αil∨⟩βl with βl∈Φ+ and coefficients ≥0, so D=2∑l⟨λ,αil∨⟩(ρ,βl)≥0; by [F5] each (ρ,βl)>0, and the sum vanishes exactly when λ−μ=0, that is, when μ=λ, while for w=1 and μ=λ clearly D=0; combining with step 3.1, D≥0 with equality exactly for μ=λ, and D>0 for every weight μ≠λ.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Geometric series are invertible in the completed character ring

Statement

Let u∈R be supported in −Q+∖{0}, so the coefficient of e0 in u is 0 and every exponent in the support of u has strictly negative height, where heights are taken in the simple-root coordinates of Height and highest root and Simple roots form a signed integral basis. Then 1+u is invertible in R, with inverse (1+u)−1=∑k≥0(−u)k, the sum being coefficientwise finite because uk is supported in weights of height at most −k. In particular:

(i) eμ is invertible with inverse e−μ for every μ∈h∗;

(ii) the finite product ∏α∈Φ+(1−e−α) equals 1+u0 for an element u0 supported in −Q+∖{0}, and is therefore invertible, with ∏α∈Φ+(1−e−α)−1=∏α∈Φ+∑k≥0e−kα;

(iii) the product eρ∏α∈Φ+(1−e−α) is invertible, with inverse e−ρ∏α∈Φ+(1−e−α)−1;

(iv) for the Weyl vector ρ the alternant A(ρ) of The Weyl alternation operator factors as A(ρ)=eρ(1+u′) with u′ supported in −Q+∖{0}, and so is invertible with inverse e−ρ(1+u′)−1.

The identification of the inverse in (iv) with the inverse in (iii) is the content of the Weyl denominator identity proved later and is not asserted here.

Facts & Assumptions

Given: The completed character ring R of The completed formal character ring, the positive cone Q+ with its simple-root coordinates, the Weyl vector ρ and an element u∈R supported in −Q+∖{0}.

[F1]

R is a commutative ring with unit e0 under coefficientwise addition and the convolution product, and its elements are exactly the integer coefficient families supported in finite unions of downward cones; a family with finite integer coefficients supported in such a union defines an element of R (The completed formal character ring, The Grothendieck group and character of O).

[F2]

Every element β=∑iniαi of Q has well-defined simple-root coordinates ni∈Z, because the simple roots form a basis, and its height ht⁡(β)=∑ini is additive: ht⁡(β+γ)=ht⁡(β)+ht⁡(γ); every nonzero element of Q+ has some coordinate ni>0 and hence height at least 1 (Simple roots form a signed integral basis, Height and highest root).

[F3]

eμ∈R and eμeν=eμ+ν, so eμe−μ=e0; also finite products of elements of R are computed by the convolution rule (The completed formal character ring).

[F4]

For every w∈W, ρ−wρ=∑α∈Φ+,w−1α<0α (The difference of the Weyl vector from its reflections is a sum of positive roots). The inversion set of w−1 has cardinality ℓ(w−1) by Finite Weyl strong exchange and deletion, where ℓ is the minimum simple-reflection word length of Finite Weyl root system, lattice and chamber conventions. If w≠1, this length is positive, since the empty word represents only the identity. The sum is then nonempty and has positive height by [F2], so ρ−wρ∈Q+∖{0}.

Proof

technique · direct
1.1F1F2F3algebra

For k≥1 every exponent of uk lies in −Q+∖{0} and has height at most −k: each exponent is the negative of a sum of k nonzero elements of Q+, a nonzero element of Q+ has height at least 1 by [F2], and heights add; hence for a fixed η the coefficient of eη in ∑k≥0(−u)k vanishes for k>−ht⁡(η) and for η∉Q or η∉−Q+, whereas for each single k the coefficient is a finite integer by [F1], so the sum defines an element v∈R; multiplying out with [F1] and [F3] gives (1+u)v=∑k≥0(−u)k+∑k≥0(−1)kuk+1=∑k≥0(−u)k−∑j≥1(−u)j=1, so v is the inverse of 1+u.

2.1F1F2F3step 1.1algebra

Claim (ii): expanding the finite product gives ∏α∈Φ+(1−e−α)=1+w with w=∑∅≠S⊆Φ+(−1)∣S∣e−∑α∈Sα, and each exponent −∑α∈Sα with S nonempty lies in −Q+∖{0} because every α∈Φ+ is a nonzero element of Q+ by [F2], so w is supported in −Q+∖{0} and step 1.1 makes the product invertible; likewise each geometric series ∑k≥0e−kα is the inverse of 1−e−α, since e−α is supported in −Q+∖{0} and step 1.1 applies, so the coefficientwise product G=∏α∈Φ+∑k≥0e−kα is the inverse of the product (a finite product of inverses is the inverse of the product in a commutative ring), and G lies in R because at a fixed exponent only finitely many tuples (kα) can sum to it by [F2]. Claim (i) is immediate from [F3].

3.1F1F3F4step 1.1step 2.1algebra∎

Claim (iv): grouping the finite defining sum of A(ρ) by w=1 and w≠1 gives A(ρ)=eρ+∑w≠1(−1)ℓ(w)ewρ=eρ(1+u′) with u′=∑w≠1(−1)ℓ(w)ewρ−ρ; for w≠1 the exponent wρ−ρ=−(ρ−wρ) lies in −Q+∖{0} by [F4], so u′ is supported in −Q+∖{0} and step 1.1 shows that 1+u′ is invertible; hence A(ρ)=eρ(1+u′) is a product of the invertible elements eρ and 1+u′, with inverse e−ρ(1+u′)−1 by [F3] and multiplicativity of inversion. Claim (iii) is the same multiplicativity applied to eρ and the invertible product of claim (ii).

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Weyl alternants are skew-invariant

Statement

Let W act on the finite-support elements of the completed character ring R by w⋅eμ=ewμ as in The Weyl alternation operator, and let A(ν) be the alternant of The Weyl alternation operator. Then for all w∈W and ν∈h∗, w⋅A(ν)=(−1)ℓ(w)A(ν), and if a simple reflection si fixes ν, that is siν=ν, then A(ν)=0.

Facts & Assumptions

Given: The root system with Weyl group W and length function ℓ, the completed character ring R with its action of W on finite-support elements, the alternants A(ν), and elements w∈W, ν∈h∗.

[F1]

For finite-support g=∑μcμeμ one has w⋅g=∑μcμewμ, and A(ν)=∑x∈W(−1)ℓ(x)exν is a finite-support element of R (The Weyl alternation operator, The completed formal character ring).

[F2]

The sign (−1)ℓ is a homomorphism: for all u,v∈W, (−1)ℓ(uv)=(−1)ℓ(u)(−1)ℓ(v), and (−1)ℓ(w−1)=(−1)ℓ(w) (The sign of the Weyl length is multiplicative).

[F3]

The action of W on h∗ is a group action by the root reflections sα(λ)=λ−⟨λ,α∨⟩α; the simple reflection si satisfies siαi=−αi≠αi, so si is not the identity, and ℓ is the least number of simple reflections in an expression for an element, so ℓ(si)=1 (Root reflections and the Weyl group action, The Weyl group is finite and faithful, Finite Weyl root system, lattice and chamber conventions).

Proof

technique · direct
1.1F1F2algebra

Since A(ν) is a finite sum, [F1] gives w⋅A(ν)=∑x∈W(−1)ℓ(x)ewxν; reindexing by y=wx and using [F2] yields w⋅A(ν)=∑y∈W(−1)ℓ(w−1y)eyν=(−1)ℓ(w)∑y∈W(−1)ℓ(y)eyν=(−1)ℓ(w)A(ν).

2.1F1F2F3algebra∎

If siν=ν, then A(ν)=A(siν)=∑x∈W(−1)ℓ(x)exsiν; reindexing by y=xsi gives A(siν)=∑y∈W(−1)ℓ(ysi)eyν=(−1)ℓ(si)A(ν)=−A(ν) by [F2] and [F3], since ℓ(si)=1, so 2A(ν)=0 and A(ν)=0 because its coefficients are integers.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Characters of finite-dimensional modules are Weyl-invariant

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let V be a finite-dimensional g-module and let W act on the finite-support elements of the completed character ring R by w⋅eμ=ewμ as in The Weyl alternation operator. Then w⋅ch⁡V=ch⁡V(w∈W), and equivalently the weight multiplicities of V satisfy dim⁡Vwμ=dim⁡Vμ for all w∈W and μ∈h∗, so that ch⁡V=∑μ(dim⁡Vwμ)eμ. In particular the formal character of every finite-dimensional simple module is W-invariant.

Facts & Assumptions

Given: The Axiom of Choice, a finite-dimensional g-module V with finite weight-space decomposition, its formal character, the Weyl group W acting on finite-support elements of R, and elements w∈W, μ∈h∗.

[A1]

The Axiom of Choice is assumed; it enters through the published weight-multiplicity supplier of [F3] (The Axiom of Choice).

[F1]

ch⁡V=∑μ(dim⁡Vμ)eμ is a finite-support element of R, the sum running over the finitely many weights of V (The formal character of a finite-dimensional weight module).

[F2]

On finite-support elements the action of w is w⋅∑μcμeμ=∑μcμewμ (The Weyl alternation operator).

[F3]

Every weight multiplicity of V is invariant under every simple reflection: dim⁡Vsiμ=dim⁡Vμ for all μ (Simple reflections preserve weight multiplicities), and every w∈W is a product of simple reflections (Weyl length equals inversion number).

Proof

technique · direct
1.1F1F2algebraA1

By [F1] the character is the finite sum ch⁡V=∑μ(dim⁡Vμ)eμ, so [F2] gives w⋅ch⁡V=∑μ(dim⁡Vμ)ewμ for every w∈W.

2.1F3step 1.1algebra

Reindexing the finite sum of step 1.1 by ν=wμ, so that μ=w−1ν, gives w⋅ch⁡V=∑ν(dim⁡Vw−1ν)eν; since w−1 is a product of simple reflections by [F3] and each simple reflection preserves the multiplicities by [F3], applying the invariance one reflection at a time yields dim⁡Vw−1ν=dim⁡Vν for every ν∈h∗.

3.1step 1.1step 2.1∎

Substituting into step 2.1 gives w⋅ch⁡V=∑ν(dim⁡Vν)eν=ch⁡V, which is the first assertion; comparing the coefficient of eν in the two displayed expressions for w⋅ch⁡V in steps 1.1 and 2.1 gives dim⁡Vν=dim⁡Vw−1ν, that is, dim⁡Vwμ=dim⁡Vμ after replacing w by w−1, and then ch⁡V=∑μ(dim⁡Vwμ)eμ; applying the result to a finite-dimensional simple module V=L(λ) gives the final assertion.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Formal characters are additive and multiplicative

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let V,W be finite-dimensional g-modules.

(i) If 0→V′→V→V′′→0 is a short exact sequence of finite-dimensional g-modules, then ch⁡V=ch⁡V′+ch⁡V′′; in particular ch⁡(V⊕W)=ch⁡V+ch⁡W and the zero module has character 0.

(ii) For the tensor product V⊗CW with the diagonal action x⋅(v⊗w)=xv⊗w+v⊗xw of Direct-sum, dual, Hom, and tensor representations, ch⁡(V⊗W)=ch⁡V⋅ch⁡W, the product taken in the completed character ring R of The completed formal character ring.

Facts & Assumptions

Given: The Axiom of Choice, finite-dimensional g-modules V,W, a short exact sequence 0→V′→V→V′′→0 of such modules, and the completing ring R.

[A1]

The Axiom of Choice is assumed; it enters through the published decomposition and category suppliers cited below (The Axiom of Choice).

[F1]

ch⁡U=∑μ(dim⁡Uμ)eμ is a finite-support element of R for every finite-dimensional g-module U (The formal character of a finite-dimensional weight module).

[F2]

Taking weight spaces is exact on h-semisimple modules: a g-linear map preserves weight spaces, so for every μ the sequence 0→Vμ′→Vμ→Vμ′′→0 is exact, and every g-module in sight has a weight-space decomposition; V, V′, V′′ and V⊕W are objects of the category O, and finite-dimensional h-semisimple modules belong to O (The Grothendieck group and character of O, Verma and finite-dimensional weight modules belong to O, Finite-dimensional tensoring preserves O).

[F3]

For the diagonal action on V⊗W of Direct-sum, dual, Hom, and tensor representations and H∈h one has H⋅(v⊗w)=(Hv)⊗w+v⊗(Hw), so Vμ⊗Wν⊆(V⊗W)μ+ν and, choosing bases of weight vectors in V and in W, the weight spaces of V⊗W are (V⊗W)η=⨁μ+ν=ηVμ⊗Wν (Weight and weight space, Direct-sum, dual, Hom, and tensor representations).

[F4]

The product in R is the convolution (fg)η=∑μ+ν=ηcμdν with f=∑μcμeμ, g=∑νdνeν (The completed formal character ring).

Proof

technique · direct
1.1F2F3algebraA1

By [F2] each g-linear map of h-semisimple modules restricts to the weight spaces, and the short exact sequence of the statement restricts to the short exact sequence 0→Vμ′→Vμ→Vμ′′→0 for every μ, so the dimensions satisfy dim⁡Vμ=dim⁡Vμ′+dim⁡Vμ′′; moreover [F3] describes the weight spaces of a tensor product as the direct sum over μ+ν=η of the tensor products of the weight spaces.

2.1F1step 1.1algebra

For part (i), step 1.1 gives dim⁡Vμ=dim⁡Vμ′+dim⁡Vμ′′ for every μ, and all three characters are finite sums by [F1], so summing the dimension identity against eμ gives ch⁡V=ch⁡V′+ch⁡V′′ in R; the direct sum is the special case of the split sequence 0→V→V⊕W→W→0, and the zero module has all weight spaces zero, hence character 0.

3.1F1F4step 1.1step 2.1algebra∎

For part (ii), step 1.1 gives (V⊗W)η=⨁μ+ν=ηVμ⊗Wν, so dim⁡(V⊗W)η=∑μ+ν=η(dim⁡Vμ)(dim⁡Wν); the argument of step 2.1, now applied to these coefficients, gives ch⁡(V⊗W)=∑η(∑μ+ν=η(dim⁡Vμ)(dim⁡Wν))eη=(ch⁡V)(ch⁡W) by the convolution rule of [F4].

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Freudenthal's weight multiplicity recursion

Statement

Assume the Axiom of Choice (The Axiom of Choice). For every dominant integral weight λ∈Λ+ and every μ∈h∗, ((λ+ρ,λ+ρ)−(μ+ρ,μ+ρ))mλ(μ)=2∑α∈Φ+∑j≥1(μ+jα,α) mλ(μ+jα), with mλ(ν)=0 for every ν that is not a weight of L(λ) and with ρ the Weyl vector (The Weyl vector rho for a chosen positive system); the inner sum is finite by Positive root strings sum the Freudenthal correction.

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, an element μ∈h∗, the positive system Φ+, the Weyl vector ρ, and the multiplicities mλ(ν)=dim⁡L(λ)ν of the finite-dimensional simple module of highest weight λ.

[A1]

The Axiom of Choice is assumed; it is inherited from the published Casimir and classification suppliers used in [F1] and [F2] (The Axiom of Choice).

[F1]

The Casimir comparison on the weight space L(λ)μ reads ((λ,λ+2ρ)−(μ,μ))mλ(μ)=∑α∈Φ+tr⁡L(λ)μ(eαfα+fαeα) (The Casimir comparison on a weight space).

[F2]

Each positive root contributes its string trace tr⁡L(λ)μ(eαfα+fαeα)=mλ(μ)(μ,α)+2∑j≥1mλ(μ+jα)(μ+jα,α), the sum being finite and the coefficients vanishing off the weights of L(λ) (Positive root strings sum the Freudenthal correction).

[F3]

ρ=12∑α∈Φ+α, so the bilinear form gives ∑α∈Φ+(μ,α)=(μ,2ρ)=2(μ,ρ), and mλ(ν)=dim⁡L(λ)ν=0 for every ν that is not a weight (The Weyl vector rho for a chosen positive system, The formal character of a finite-dimensional weight module).

[F4]

Expanding the shifted squares with bilinearity and symmetry of ( , ) gives (λ+ρ,λ+ρ)−(μ+ρ,μ+ρ)=(λ,λ+2ρ)−(μ,μ)−2(μ,ρ).

Proof

technique · direct
1.1F3F4algebraA1

By [F3] the sum of the pairings over the positive roots is ∑α∈Φ+(μ,α)=2(μ,ρ), and by [F4] the Casimir coefficient and the shifted-norm difference are related by (λ+ρ,λ+ρ)−(μ+ρ,μ+ρ)=(λ,λ+2ρ)−(μ,μ)−2(μ,ρ).

2.1F1F2step 1.1algebra

Substituting [F2] into the right side of [F1] gives ((λ,λ+2ρ)−(μ,μ))mλ(μ)=mλ(μ)∑α∈Φ+(μ,α)+2∑α∈Φ+∑j≥1mλ(μ+jα)(μ+jα,α), and step 1.1 turns the first term into 2(μ,ρ)mλ(μ).

3.1F2F3step 1.1step 2.1algebra∎

Subtracting 2(μ,ρ)mλ(μ) from both sides of step 2.1 and using the coefficient identity of step 1.1 gives ((λ+ρ,λ+ρ)−(μ+ρ,μ+ρ))mλ(μ)=2∑α∈Φ+∑j≥1(μ+jα,α)mλ(μ+jα), which is the asserted recursion; the inner sums are finite and the coefficients vanish off the weights of L(λ) by [F2] and [F3].

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Freudenthal recursion terminates from the highest weight

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ∈Λ+.

(i) mλ(λ)=1, and mλ(ν)=0 whenever ν≰λ, that is, whenever λ−ν is not a nonnegative integral combination of the simple roots (The highest-weight space is one-dimensional, Highest weight modules lie below the top weight).

(ii) If μ is a weight of L(λ) with μ≠λ, then (μ+ρ,μ+ρ)<(λ+ρ,λ+ρ) (The shifted norm of a weight is maximal only at the top weight), so Freudenthal's weight multiplicity recursion solves for mλ(μ) from the multiplicities mλ(μ+jα), j≥1, of strictly higher weights; since ht⁡(λ−(μ+jα))<ht⁡(λ−μ) and L(λ) is finite-dimensional, iterating the recursion from the top weight and increasing ht⁡(λ−μ) determines mλ(μ) for every weight μ≠λ from the value mλ(λ)=1 of (i). More explicitly, for candidates ν∈λ−Q+ put D(ν)=(λ+ρ,λ+ρ)−(ν+ρ,ν+ρ). For ν≠λ with D(ν)≤0 set mλ(ν)=0, as (ii)'s strict inequality excludes such a weight. For D(ν)>0 use the recursion, including candidates that turn out to have multiplicity zero. A requested candidate at height h requires only the finitely many candidates of height at most h.

(iii) At μ=λ the recursion reads 0=0 and determines nothing, so (i) is used as its base case; if ν≰λ then ν+jα≰λ for every α∈Φ+ and j≥1, and both sides of the recursion vanish by (i).

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, the finite-dimensional simple module L(λ), its multiplicities mλ(ν), the positive system Φ+ with heights, and the Weyl vector ρ.

[A1]

The Axiom of Choice is assumed; it is inherited from the published highest-weight and multiplicity suppliers of [F1] and [F2] (The Axiom of Choice).

[F1]

L(λ) is a finite-dimensional irreducible highest weight module of highest weight λ, its λ-weight space is one-dimensional, and every weight ν of L(λ) satisfies ν≤λ, that is, λ−ν∈Q+; consequently mλ(ν)=0 for ν≰λ (Highest-weight classification, The highest-weight space is one-dimensional, Highest weight modules lie below the top weight).

[F2]

For every weight μ≠λ of L(λ) the recursion coefficient (λ+ρ,λ+ρ)−(μ+ρ,μ+ρ) is strictly positive (The shifted norm of a weight is maximal only at the top weight), and the recursion of Freudenthal's weight multiplicity recursion reads ((λ+ρ,λ+ρ)−(μ+ρ,μ+ρ))mλ(μ)=2∑α∈Φ+∑j≥1(μ+jα,α)mλ(μ+jα).

[F3]

Extend root height to Q by ht⁡(∑iniαi)=∑ini. It is additive and positive on Q+∖{0}, so ht⁡(λ−(μ+jα))=ht⁡(λ−μ)−jht⁡(α)<ht⁡(λ−μ) for j≥1 and α∈Φ+, while adding jα to ν can only increase it in the root order: if ν+jα≤λ then λ−ν=(λ−ν−jα)+jα∈Q+ (Height and highest root, Finite Weyl root system, lattice and chamber conventions, Simple roots form a signed integral basis).

Proof

technique · direct
1.1F1algebraA1

By [F1] the λ-weight space of L(λ) is one-dimensional and every weight of L(λ) lies below λ, so mλ(λ)=1 and mλ(ν)=0 for every ν≰λ, which is (i).

2.1F1F2F3step 1.1algebra

For every candidate ν∈λ−Q+ put h=ht⁡(λ−ν). We determine its actual multiplicity by induction on h. At height zero the only candidate is λ, whose multiplicity is 1. At positive height, if D(ν)≤0, [F2] excludes ν from the weight set, so its multiplicity is zero. If D(ν)>0, the recursion, valid for every ν, determines its multiplicity by division by D(ν). Each term mλ(ν+jα) either vanishes because ν+jα≰λ by [F1], or is a candidate of smaller nonnegative height by [F3] and hence already determined. In the latter case jht⁡(α)≤h, so only finitely many terms are required. There are finitely many tuples of nonnegative simple-root coefficients of sum at most h; thus computing any requested candidate uses finitely many induction stages and candidates. Every actual weight is among these candidates, proving (ii).

3.1F1F2F3step 1.1step 2.1algebra∎

For (iii), at μ=λ the coefficient in [F2] vanishes because μ=λ, while λ+jα≰λ for j≥1 and α∈Φ+ since −jα∉Q+, so every multiplicity on the right vanishes by (i) and the recursion reads 0=0; for ν≰λ and j≥1 one has ν+jα≰λ by [F3], so both sides of the recursion vanish by (i).

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Kostant partition function

Definition

Let Φ+ be a positive system for the finite root system of Finite Weyl root system, lattice and chamber conventions with simple roots α1,…,αr and positive cone Q+. For β∈h∗ define P(β) to be the number of families (nα)α∈Φ+∈Z≥0Φ+ with ∑α∈Φ+nαα=β. This number is finite: writing an element of Q in the simple-root basis as β=∑i=1rmiαi by Simple roots form a signed integral basis, the weight β can be represented only if every mi≥0, and then each nα is bounded by the height ht⁡(β)=∑imi extending the root height of Height and highest root to Q by the same coordinate sum, because every positive root has height at least 1; so only finitely many families occur, and P(β)=0 for β∉Q+ while P(0)=1 (the all-zero family, empty when Φ+=∅).

Equivalently, P(β) is the coefficient of e−β in the finite product of geometric series ∏α∈Φ+∑k≥0e−kα=∏α∈Φ+(1−e−α)−1 of Geometric series are invertible in the completed character ring: a family (nα) with ∑αnαα=β contributes one monomial e−β, and a family representing β has nα≤ht⁡(β) and hence finite support, so ∏α∈Φ+(1−e−α)−1=∑β∈Q+P(β)e−β in the completed character ring R of The completed formal character ring.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Weyl character formula

Statement

Assume the Axiom of Choice (The Axiom of Choice). For every dominant integral weight λ∈Λ+, the character of the finite-dimensional simple module L(λ) is ch⁡L(λ)=A(λ+ρ)⋅A(ρ)−1=(∑w∈W(−1)ℓ(w)ew(λ+ρ))/(eρ∏α∈Φ+(1−e−α)), the quotient being taken in the completed character ring R of The completed formal character ring, where A(ρ) is invertible with inverse e−ρ∏α∈Φ+(1−e−α)−1 (The Weyl denominator identity, Geometric series are invertible in the completed character ring). No quotient of ordinary functions is intended before this formal cancellation is justified.

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, the character ch⁡L(λ), the Weyl vector ρ, the alternants A(ν) and the ring R.

[A1]

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

[F1]

ch⁡L(λ)⋅A(ρ)=A(λ+ρ) in R (The BGG Euler identity gives the Weyl numerator).

[F2]

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

[F3]

R is a commutative ring, so multiplication by the invertible element A(ρ)−1 is well defined, and A(λ+ρ)=∑w∈W(−1)ℓ(w)ew(λ+ρ) (The completed formal character ring, The Weyl alternation operator).

[F4]

ch⁡L(λ) is an element of R, namely the finite sum ∑μmλ(μ)eμ (The formal character of a finite-dimensional weight module).

Proof

technique · direct
1.1F1F2F3F4algebraA1

By [F1] and [F2] the element A(ρ) is invertible in R and ch⁡L(λ)A(ρ)=A(λ+ρ); multiplying this identity on the right by A(ρ)−1 and using associativity and commutativity of the product in the ring R of [F3] gives first A(ρ)A(ρ)−1=e0 and then ch⁡L(λ)=ch⁡L(λ)A(ρ)A(ρ)−1=A(λ+ρ)A(ρ)−1.

2.1F2F3step 1.1∎

Substituting into step 1.1 the explicit finite sum of [F3] for the numerator and the product form and inverse of [F2] for the denominator gives the displayed quotient in R; the quotient is by definition the product of the finite alternant A(λ+ρ) with the element A(ρ)−1=e−ρ∏(1−e−α)−1 of R, so it is a formal quotient in the completed ring and no quotient of ordinary functions is involved.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Regularized evaluation of the Weyl character quotient at one

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ∈Λ+ and let ρ be the Weyl vector (The Weyl vector rho for a chosen positive system), with mλ(μ)=dim⁡L(λ)μ the multiplicities of the finite-dimensional simple module L(λ).

Exponential values in (i) are complex exponentials (The complex exponential by its power series, exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential); for real arguments these agree with the real exponential used in (ii)--(iii). The pairing on h∗ is the complex-bilinear extension of the real form on E.

(i) For every ν∈h∗ and every t>0, ∑w∈W(−1)ℓ(w)e2t(wν,ρ)=∏α∈Φ+(et(ν,α)−e−t(ν,α)).

(ii) Consequently, for every t>0, ∑μmλ(μ)e2t(μ,ρ)=∏α∈Φ+(et(λ+ρ,α)−e−t(λ+ρ,α))∏α∈Φ+(et(ρ,α)−e−t(ρ,α)).

(iii) The left side of (ii) is a finite sum of exponentials, hence continuous at t=0 with value ∑μmλ(μ)=dim⁡L(λ), while each factor ratio (eta−e−ta)/(etb−e−tb) tends to a/b as t→0+ for a,b≠0; hence the right side of (ii) has the finite limit ∏α∈Φ+(λ+ρ,α)/(ρ,α) as t→0+.

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, the module L(λ) with its multiplicities, the Weyl vector ρ, the positive system Φ+, the alternants A(ν) and the completed ring R with its group ring Z[P].

[A1]

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

[F1]

Z[P]⊆R is the group ring with eμeν=eμ+ν, and A(ν)=∑w∈W(−1)ℓ(w)ewν is a finite alternant in Z[P] for ν∈P (The completed formal character ring, The Weyl alternation operator).

[F2]

ch⁡L(λ)⋅A(ρ)=A(λ+ρ) in Z[P] (The BGG Euler identity gives the Weyl numerator), and the denominator identity gives A(ρ)=eρ∏α∈Φ+(1−e−α)=∏α∈Φ+(eα/2−e−α/2) as an identity of finite sums whose exponents lie in P (The Weyl denominator identity).

[F3]

ch⁡L(λ)=∑μmλ(μ)eμ with finitely many nonzero integer coefficients, and ∑μmλ(μ)=dim⁡L(λ) because L(λ) is the direct sum of its weight spaces (The formal character of a finite-dimensional weight module, Finite-dimensional modules decompose into weight spaces).

[F4]

For t>0 and x∈h∗, evaluation eη↦exp⁡(2t(η,x)) is a homomorphism from the finite-support group ring to C: complex exponential is defined everywhere, satisfies exp⁡(z+w)=exp⁡(z)exp⁡(w), and has exp⁡(0)=1. It agrees with real exponential when the pairings are real (The complex exponential by its power series, exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential, Finite Weyl root system, lattice and chamber conventions).

[F5]

For w∈W and μ∈h∗ one has (wμ,ρ)=(μ,w−1ρ), and (−1)ℓ(w−1)=(−1)ℓ(w), so reindexing w↦w−1 preserves the signs (Finite Weyl root system, lattice and chamber conventions, The sign of the Weyl length is multiplicative).

[F6]

For every positive root α one has (ρ,α)>0 and (λ+ρ,α)>0 (Positive coroot pairings of a dominant integral weight).

[F7]

The real exponential is differentiable with derivative itself, hence continuous, and exp⁡(u)>0 for all u; finite sums and products of continuous real functions are continuous, finite products of convergent function limits may be computed factor by factor, and by the 0/0 form of l'Hôpital's rule the quotient (eta−e−ta)/(etb−e−tb) tends to a/b as t→0+ whenever b≠0 (The exponential function is smooth and (exp⁡)′=exp⁡, The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x), The real exponential function and the number e by a power series, Sums, products, absolute values, finite maxima and minima, and quotients of continuous real-valued maps on a topological space are continuous where defined, Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero, L'Hôpital's rule for the 0/0 form at finite or infinite, one-sided endpoints, The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c), Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0).

Proof

technique · direct
1.1F1F2F4F5algebraA1

Apply the multiplicative evaluation of [F4] with x=ν to the half-root form of the denominator identity in [F2]: the left side becomes ∑w∈W(−1)ℓ(w)exp⁡(2t(wρ,ν)) and the right side becomes ∏α∈Φ+(exp⁡(t(α,ν))−exp⁡(−t(α,ν))); using (wρ,ν)=(ρ,w−1ν) and reindexing w↦w−1, which preserves both W and the signs (−1)ℓ(w) by [F5], the left side equals ∑w∈W(−1)ℓ(w)exp⁡(2t(wν,ρ)), so the evaluated identity is exactly (i).

2.1F2F3F4F6F7step 1.1algebra

Apply the same evaluation with x=ρ to the numerator identity of [F2]; the left side becomes ∑μmλ(μ)exp⁡(2t(μ,ρ)) times A(ρ)'s value, the right side becomes the numerator product of (ii), and by step 1.1 with ν=ρ the value of A(ρ) is ∏α∈Φ+(exp⁡(t(ρ,α))−exp⁡(−t(ρ,α))), a product of positive factors for t>0: for u>0, the real exponential series gives exp⁡(2u)≥1+2u>1, and exp⁡(u)−exp⁡(−u)=exp⁡(−u)(exp⁡(2u)−1)>0 by [F4] and [F7]. Apply this with u=t(ρ,α)>0 from [F6]; division gives (ii).

3.1F3F7step 2.1algebra

The left side of (ii) is the finite sum ∑μmλ(μ)exp⁡(2t(μ,ρ)) of continuous functions of t by [F3] and [F7], so it is continuous at t=0 and its value there is ∑μmλ(μ)=dim⁡L(λ) by [F3].

4.1F6F7step 2.1step 3.1algebra∎

For each positive root α the numerator and denominator in the factor ratio (et(λ+ρ,α)−e−t(λ+ρ,α))/(et(ρ,α)−e−t(ρ,α)) of the right side of (ii) vanish at t=0, their derivatives at t>0 are (λ+ρ,α)(et(λ+ρ,α)+e−t(λ+ρ,α)) and (ρ,α)(et(ρ,α)+e−t(ρ,α)), and the denominator derivative is strictly positive by [F6] and [F7]. By continuity the derivative quotient tends to 2(λ+ρ,α)/(2(ρ,α)); hence l'Hôpital's rule gives the factor limit (λ+ρ,α)/(ρ,α) as t→0+, and the finite product of these factor limits, namely ∏α∈Φ+(λ+ρ,α)/(ρ,α), is the limit of the right side of (ii); since (ii) holds for every t>0 and both sides have finite limits at 0+ by step 3.1 and by this factor computation, the two limits agree and the right side has the stated finite limit.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The Weyl dimension formula

Statement

Assume the Axiom of Choice (The Axiom of Choice). For every dominant integral weight λ∈Λ+, dim⁡L(λ)=∏α∈Φ+(λ+ρ,α)(ρ,α)=∏α∈Φ+⟨λ+ρ,α∨⟩⟨ρ,α∨⟩; the denominators are nonzero because ⟨ρ,α∨⟩>0 for every positive root (Positive coroot pairings of a dominant integral weight).

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, the finite-dimensional simple module L(λ) with its multiplicities, the Weyl vector ρ, the positive system Φ+ and the form ( , ) on E=span⁡RΦ.

[A1]

The Axiom of Choice is assumed; it enters through the regularized evaluation of [F1] and its suppliers (The Axiom of Choice).

[F1]

For every t>0 one has ∑μmλ(μ)e2t(μ,ρ)=∏α∈Φ+(et(λ+ρ,α)−e−t(λ+ρ,α))/∏α∈Φ+(et(ρ,α)−e−t(ρ,α)); the left side is a finite sum of exponentials, continuous at t=0 with value ∑μmλ(μ)=dim⁡L(λ), and the right side has the finite limit ∏α∈Φ+(λ+ρ,α)/(ρ,α) as t→0+ (Regularized evaluation of the Weyl character quotient at one).

[F2]

A function defined for t>0 has at most one limit as t→0+ (The ε-δ limit lim⁡x→cf(x)=L of f:A→R at a limit point c of A).

[F3]

For every ν∈E and every root α one has (ν,α)=(α,α)2⟨ν,α∨⟩, because α∨=2α/(α,α) after identifying E with its dual by the form; moreover ⟨ρ,α∨⟩>0 and ⟨λ+ρ,α∨⟩>0 for every positive root α (Finite Weyl root system, lattice and chamber conventions, Positive coroot pairings of a dominant integral weight, The Weyl vector rho for a chosen positive system).

Proof

technique · direct
1.1F1F2algebraA1

By [F1] the identity of the two functions of t>0 holds for every t>0, the left side extends continuously to t=0 with value dim⁡L(λ), and the right side has the finite limit ∏α∈Φ+(λ+ρ,α)/(ρ,α) as t→0+; since limits are unique by [F2] and a continuous extension is the limit of its values, dim⁡L(λ)=∏α∈Φ+(λ+ρ,α)/(ρ,α).

2.1F3step 1.1algebra∎

By [F3] each factor of the product satisfies (λ+ρ,α)/(ρ,α)=⟨λ+ρ,α∨⟩/⟨ρ,α∨⟩, the denominators being nonzero, so the product equals ∏α∈Φ+⟨λ+ρ,α∨⟩/⟨ρ,α∨⟩, which is the second form of the formula.

5 · Examples, counterexamples and false statements

None yet.

Sources