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.

Projectives Standard Filtrations and Bgg Reciprocity

1 · Prerequisites

2 · Summary

This page develops the projective objects of a block of category O and their standard filtrations. Truncating a block at a finite downward-closed ideal of one linkage class makes every weight vector of a maximal label singular, so a maximal-label Verma module is projective in its truncation and projective covers are indecomposable and unique. Tensoring with finite-dimensional modules and projecting to a block preserve projectives and produce enough of them; every projective then carries a finite Verma flag, and restricted duality turns the resulting reciprocity into costandard flags for injectives.

The second half sets up translation functors across a single wall. Dominant norm comparison and the weight bound for finite-dimensional simples give a tensor-weight exclusion lemma, which computes the standard factors surviving translation: translation to the wall sends a standard module to a standard module, and translation from the wall is a two-factor extension. The arguments use the Axiom of Choice wherever the block, finite-length and duality suppliers do; each statement records its own hypotheses.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Truncation at a finite downward-closed ideal of a linkage class

Definition

Assume the Axiom of Choice (The Axiom of Choice). Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=h⊕n+ with the conventions of The classical BGG category O: positive roots Φ+, simple roots αi, Q+=∑iZ≥0αi, the root order μ≤λ meaning λ−μ∈Q+, Weyl vector ρ, the dot action w⋅λ=w(λ+ρ)−ρ, and category O.

For a weight λ let C=Wλ⋅λ be its integral-reflection linkage class in the sense of The integral Weyl group of a weight; it is contained in the full dot orbit W⋅λ, hence finite because W is finite (The Weyl group is finite and faithful, with the identification of the abstract reflections with the sα of The roots form a reduced crystallographic Euclidean root system). A finite downward-closed ideal of C is a finite subset Γ⊆C such that ν∈Γ and μ∈C and μ≤ν ⟹ μ∈Γ, where ≤ is the root order of The classical BGG category O and not the strong linkage order ↑ of The strong linkage order on weights. It is a lower set in the restriction of the partial order ≤ to C. The empty ideal is allowed; every nonempty such ideal has minimal elements.

For such a Γ, the truncation OΓ is the full subcategory of O whose objects are those X all of whose simple composition factors are L(μ) with μ∈Γ; composition factors are those of Composition series and composition factors of an object and the simple objects of O are the L(μ) of The simple objects of O. Because every object of O has finite length (Every object of O has finite length) and composition factors of a composition series are independent of the chosen series (Jordan-Holder theorem in an abelian category), membership in OΓ depends only on the isomorphism class of the object and not on a chosen composition series. Consequently OΓ contains the zero object and is closed in O under finite direct sums, subobjects, quotients and extensions (Category O is abelian and extension closed among weight modules); it is the truncation of the finite label poset of one linkage class.

The Verma-placement claim below also has a direct justification. The highest weight line of M(μ) is one-dimensional and generates the whole module; hence it cannot be distributed among two nonzero direct summands. The linkage-block decomposition of Central-character summands refine into linkage blocks therefore places this Verma in the block of its unique simple quotient L(μ) (A Verma module has a unique simple quotient), so all its composition labels lie in C. A label η of a composition factor is a weight of M(μ): in a short exact sequence of h-semisimple modules, a weight vector in the quotient lifts in that same weight by extracting that component of any finite weight decomposition of a lift. Iterating through a composition series and using Weights of a Verma module lie below lambda gives η≤μ. Thus μ∈Γ and lower closure within C force every such η∈Γ, proving M(μ)∈OΓ without a bound by one greatest label.

Two boundaries are part of the definition. First, OΓ is a condition on the highest-weight labels of simple composition factors, not a bound on all weights of a Verma module: a Verma module M(μ) with μ∈Γ lies in OΓ although its weights run over the whole cone μ−Q+. Second, Γ is a finite ideal inside a single linkage class C, not the infinite lower ideal generated by λ in the whole weight lattice; in particular a discrete series truncation is a different construction.

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

Weight-lambda vectors are singular at a maximal label

Statement

Assume the Axiom of Choice (The Axiom of Choice). In the setting of Truncation at a finite downward-closed ideal of a linkage class, let Γ be a finite downward-closed ideal of a linkage class C and let λ∈Γ be maximal in Γ.

  1. If ν is a weight of an object X of OΓ with ν≥λ in the root order of Root order on weights, then ν=λ; equivalently, no object of OΓ has a weight λ+β with β∈Q+∖{0}.
  2. Consequently every vector of weight λ in every X∈OΓ is annihilated by n+: for x∈n+ of weight α>0 and v∈Xλ, the vector xv has weight λ+α and hence vanishes by (1). Thus Xλn+=Xλ for every X∈OΓ.
  3. The weight functor X↦Xλ is exact on all h-semisimple g-modules, hence on OΓ.

Maximality of λ is used only in (1). Incomparable maximal labels do not invalidate (1): its antecedent requires ν≥λ, and any composition label above such a ν is then comparable to λ and forced equal to it. What can fail is the stronger assertion that every weight of every object lies below one specified maximal label; a simple with an incomparable highest weight refutes that stronger assertion.

Facts & Assumptions

Given: The Axiom of Choice, a finite downward-closed ideal Γ of a linkage class C, a maximal element λ∈Γ, and an object X∈OΓ.

[F1]

OΓ is the full subcategory of objects of O all of whose simple composition factors are L(μ) with μ∈Γ; membership depends only on the isomorphism class, and Γ is a finite lower set for the root order (Truncation at a finite downward-closed ideal of a linkage class). Maximality of λ means that μ∈Γ and λ≤μ imply μ=λ.

[F2]

The simple objects of O are exactly the L(μ); L(μ) is the unique simple quotient of the Verma module M(μ), and the weights of M(μ) are exactly μ−Q+ with finite weight spaces (The simple objects of O, A Verma module has a unique simple quotient, Weights of a Verma module lie below lambda).

[F3]

For a short exact sequence 0→A→X→B→0 of h-semisimple modules, a functional is a weight of X exactly when it is a weight of A or of B: the corresponding sequence of weight spaces is exact at each weight (Category O is abelian and extension closed among weight modules). Iterating along a composition series, every weight of X is a weight of some composition factor (Composition series and composition factors of an object).

[F4]

The root order is transitive and antisymmetric (Root order on weights), and a root vector of weight α maps Xν into Xν+α (Weight and weight space, The classical BGG category O).

Proof

technique · direct: reduce a top weight to a composition factor, force equality by maximality, and read off singularity and exactness
1.1F1F2F3F4given

Let ν be a weight of X∈OΓ with ν≥λ. By [F3] the weight ν occurs in some composition factor L(μ) of X, and μ∈Γ because X∈OΓ. By [F2], ν is then a weight of M(μ), so ν≤μ. From λ≤ν≤μ and transitivity in [F4] we get λ≤μ with μ∈Γ, so maximality of λ gives μ=λ; then λ≤ν≤λ and antisymmetry give ν=λ. Hence no object of OΓ has a weight λ+β with β∈Q+∖{0}.

1.2F4givenalgebra

The weight functor X↦Xλ is exact on h-semisimple g-modules: given a short exact sequence 0→X′→iX→pX′′→0, injectivity of iλ is immediate, and if x′′∈Xλ′′ lifts to x∈X, then writing x=∑νxν as a finite sum of weight vectors gives x′′=p(x)=∑νp(xν) with p(xν) of weight ν; by the directness of the weight decomposition of X′′ all terms with ν≠λ vanish and x′′=p(xλ), so pλ is surjective.

2.1F4step 1.1step 1.2∎

By step 1.1 no object of OΓ has a weight strictly above λ in the sense of λ+β with β∈Q+∖{0}: if v∈Xλ is nonzero and x∈n+ has weight α>0, then xv∈Xλ+α by [F4], and λ+α>λ; if xv≠0 it would be a weight vector of weight λ+α, contradicting step 1.1. Hence xv=0 for every x∈n+ and Xλn+=Xλ. Together with the exactness of the weight functor in step 1.2 this proves all three assertions.

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

A maximal-label Verma is projective in its truncation

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let Γ be a finite downward-closed ideal of a linkage class C (Truncation at a finite downward-closed ideal of a linkage class) and let λ∈Γ be maximal in Γ. Then Δ(λ)=M(λ) is a projective object of the truncation OΓ (Projective object).

More precisely, for every X∈OΓ evaluation at the highest-weight generator vλ is a natural isomorphism Hom⁡OΓ(M(λ),X)→Xλn+=Xλ, and X↦Xλ is exact, so Hom⁡OΓ(M(λ),−) is exact.

Under the fixed positive-Borel convention the essential hypothesis is maximality of λ in the finite ideal Γ: maximality, not any antidominance or sufficient-positivity condition, is what makes every λ-weight vector singular. For a weight λ that is not maximal in Γ, Δ(λ) need not be projective in OΓ.

Facts & Assumptions

Given: The Axiom of Choice, a finite downward-closed ideal Γ of a linkage class, a maximal element λ∈Γ, and an object X∈OΓ.

[F1]

For every X∈OΓ, every vector of weight λ is annihilated by n+, so Xλn+=Xλ, and the weight functor X↦Xλ is exact on OΓ (Weight-lambda vectors are singular at a maximal label).

[F2]

Sending a homomorphism M(λ)→V to the image of vλ is a natural bijection onto the n+-fixed vectors of weight λ in any g-module V (The universal property of Verma modules, Verma modules).

[F3]

An object P of an abelian category is projective exactly when the functor Hom⁡(P,−) is exact (Projective object, Projective object characterisations).

Proof

technique · direct: identify the Hom functor with an exact weight functor through the universal property
1.1F1F2given

For X∈OΓ the universal property [F2] identifies Hom⁡OΓ(M(λ),X) with the space of n+-fixed vectors of weight λ in X, naturally in X; by [F1] this space is Xλn+=Xλ.

1.2F1given

The functor X↦Xλ is exact on OΓ by [F1].

2.1F3step 1.1step 1.2∎

Combining steps 1.1 and 1.2, Hom⁡OΓ(M(λ),−) is naturally isomorphic to the exact functor X↦Xλ, hence is exact; by the characterisation [F3] the Verma module M(λ) is a projective object of OΓ.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Dominant integral weights are maxima of their Weyl orbits

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let ζ∈h∗ be a dominant integral weight, that is, ⟨ζ,αi∨⟩∈Z≥0 for every simple root αi (equivalently, when ζ lies in the real span of the roots, ⟨ζ,α∨⟩∈Z≥0 for every positive root α). Then ζ−wζ∈Q+for every w∈W, where W is the Weyl group of Root reflections and the Weyl group action and Q+ is the cone of Root order on weights. In particular ζ is the maximum of its Weyl orbit for the order μ≤ν defined by ν−μ∈Q+, and if wζ≥ζ then wζ=ζ.

Consequently, if λ is a weight with λ+ρ dominant integral (ρ the Weyl vector of The Weyl vector rho for a chosen positive system), then λ−w⋅λ∈Q+ for every w∈W, and λ is the maximum of its linkage class Wλ⋅λ of The integral Weyl group of a weight; here Wλ=W because every simple reflection pairs integrally with λ+ρ.

Integrality is used with its full strength: for a dominant ζ that is not integral the conclusion ζ−wζ∈Q+ fails for reflections pairing non-integrally with ζ, and only the reflections integral at ζ can be used.

Facts & Assumptions

Given: The Axiom of Choice and a dominant integral weight ζ in h∗, and the Weyl group W generated by the root reflections sα of Root reflections and the Weyl group action.

[F1]

The reflection is sα(λ)=λ−⟨λ,α∨⟩α, and under the identification of The roots form a reduced crystallographic Euclidean root system (parts (iii) and (iv)) these reflections are the reflections of the reduced crystallographic root system Φ with W-invariant positive definite form on the real span E of the roots (The root set is a reduced crystallographic root system, Finite Weyl positive roots and simple reflections, Finite Weyl closed chambers and stabilizers).

[F2]

Simple reflections generate W; word length satisfies ℓ(wsi)=ℓ(w)−1 exactly when wαi<0, and in a reduced word w=si1⋯sik every prefix is reduced (Finite Weyl strong exchange and deletion, Finite Weyl positive roots and simple reflections).

[F3]

The relation μ≤λ defined by λ−μ∈Q+ is a partial order on h∗ (Root order on weights).

Proof

technique · direct, through a reduced-word telescoping identity whose terms are nonnegative integer multiples of positive roots
1.1F1F2givenalgebra

By [F2] the simple reflections generate W, so choose a reduced expression w=si1⋯sik with k=ℓ(w) and put wj=si1⋯sij. Since wj=wj−1sij, the telescoping sum gives ζ−wζ=∑j=1k(wj−1ζ−wjζ)=∑j=1kwj−1(ζ−sijζ)=∑j=1k⟨ζ,αij∨⟩ wj−1αij, using [F1] for the last equality.

2.1F1F2step 1.1algebra

Each coefficient is ⟨ζ,αij∨⟩∈Z≥0 because αij is simple and ζ is dominant integral, and each vector wj−1αij is a positive root: otherwise ℓ(wj−1sij)=ℓ(wj−1)−1 by [F2], contradicting that the prefix wj of the reduced word w is reduced and that w=wjsij+1⋯sik has length k. Hence every term of the sum of step 1.1 lies in Z≥0Φ+⊆Q+, and ζ−wζ∈Q+ for every w∈W.

3.1F3step 2.1

Since ζ−wζ∈Q+ means wζ≤ζ, every Weyl conjugate of ζ lies below ζ in the root order, so ζ is the maximum of its Weyl orbit; and if in addition ζ≤wζ, then ζ=wζ by antisymmetry of the partial order [F3].

3.2F1F2step 2.1algebra

For the dot-action statement let λ be a weight with λ+ρ dominant integral, and apply step 2.1 to ζ=λ+ρ: then (λ+ρ)−w(λ+ρ)∈Q+, that is, λ−w⋅λ∈Q+ for every w∈W; moreover ⟨λ+ρ,αi∨⟩∈Z for every simple root αi, so every simple reflection lies in Wλ and Wλ=W by [F2]; hence every element of the linkage class Wλ⋅λ is a Weyl conjugate of λ and lies below λ.

4.1step 3.1step 3.2∎

Combining steps 3.1 and 3.2: for every w∈W one has ζ−wζ∈Q+ and λ−w⋅λ∈Q+ in the dot setting, so ζ and λ are the maxima of their orbits and linkage classes respectively, and wζ≥ζ forces wζ=ζ.

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

Finite-dimensional tensoring preserves projectives in category O

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let P be a projective object of O (Projective object) and let E be a finite-dimensional h-semisimple g-module (Weight and weight space). Then E⊗P belongs to O and is projective in O.

The same tensor adjunction shows that if I is injective in O, then E⊗I is injective.

Facts & Assumptions

Given: The Axiom of Choice, a projective P∈O, an injective I∈O, and a finite-dimensional h-semisimple g-module E.

[F1]

For finite-dimensional h-semisimple E, the functor M↦E⊗M with diagonal action is exact and maps O into itself; its linear dual E∗ is again finite-dimensional h-semisimple, and evaluation and coevaluation give the tensor-Hom adjunction, natural in the g-modules M and X (Finite-dimensional tensoring preserves O, Weight and weight space).

[F2]

An object P is projective exactly when Hom⁡O(P,−) is exact, equivalently when Hom⁡(P,E)→Hom⁡(P,M) is surjective for every epimorphism E↠M (Projective object, Projective object characterisations).

[F3]

Injectivity means that Hom⁡(−,I) sends monomorphisms to surjections, equivalently is exact; this follows from the extension property and left exactness of contravariant Hom (Injective object).

Proof

technique · direct, through the tensor-Hom adjunction and exactness of tensoring with a finite-dimensional module
1.1F1given

For every X∈O the tensor-Hom adjunction of [F1] gives a natural isomorphism Hom⁡O(E⊗P,X)≅Hom⁡O(P,E∗⊗X), and E∗ is finite-dimensional h-semisimple with E∗⊗− an exact endofunctor of O.

1.2F1F3algebra

If I is injective, evaluation and coevaluation for the ordinary contragredient dual E∗ give Hom⁡O(X,E⊗I)≅Hom⁡O(E∗⊗X,I), naturally in X. Since E∗⊗− is exact by [F1] and Hom⁡(−,I) is exact by [F3], their composite is exact. Thus E⊗I is injective.

2.1F1F2step 1.1

Since E⊗P∈O by [F1], the functor Hom⁡O(E⊗P,−) is naturally isomorphic to the composite of the exact functor X↦E∗⊗X and the exact functor Hom⁡O(P,−) of [F2]; composites of exact functors are exact, so Hom⁡O(E⊗P,−) is exact and [F2] makes E⊗P projective in O.

3.1step 2.1step 1.2∎

Steps 2.1 and 1.2 prove that finite-dimensional tensoring preserves both projectives and injectives in O.

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

Exact projections onto linkage blocks preserve projectives

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let C be a linkage class and let pr⁡C:O→OC be the exact projection of the block decomposition of Central-character summands refine into linkage blocks, i.e. the functor that keeps the direct summand supported on C.

If P∈O is projective (Projective object), then pr⁡C(P) is projective in O. Conversely, if Q∈OC is projective in the full subcategory OC, then Q is projective in O. The proof is the two adjunction identities Hom⁡O(pr⁡CP,X)=Hom⁡O(P,X) for X∈OC and Hom⁡O(Q,X)=Hom⁡OC(Q,pr⁡CX) for general X∈O, together with exactness of pr⁡C; these reduce exactness of Hom⁡ to the corresponding exactness in OC or in O.

Facts & Assumptions

Given: The Axiom of Choice, a linkage class C, and the block decomposition of O into the subcategories OC.

[F1]

Partition the simple labels into the linkage classes. Every extension of two simples from distinct classes splits, in either order (Simple extensions cannot cross linkage classes); consequently every object X of O has a unique decomposition X=⨁CXC into subobjects whose composition factors lie in C, with finitely many nonzero terms, functorial in X, and every morphism between objects supported on disjoint collections of classes is zero (Splitting finite-length modules across separated simple classes, Central-character summands refine into linkage blocks). Write XC=pr⁡C(X) and let iC be the embedding of the full subcategory OC (Generalized central-character decomposition of O). In particular P≅pr⁡C(P)⊕⨁D≠Cpr⁡D(P).

[F2]

An object P of an abelian category is projective precisely when Hom⁡(P,−) preserves epimorphisms, equivalently is exact; and every epimorphism onto a projective splits (Projective object, Projective object characterisations).

[F3]

In an abelian category, finite direct sums are biproducts: for morphisms fD:XD→YD the kernel and image of the block-diagonal morphism ⨁DfD are ⨁Dker⁡fD and ⨁Dim⁡fD, so a chain complex of decomposed objects with block-diagonal differentials is exact exactly when each D-component is exact.

Proof

technique · direct, through the functorial block decomposition and the $\operatorname{Hom}$ characterisation of projectivity
1.1givenF1

By [F1] every object X is ⨁CXC with finitely many nonzero terms, the decomposition is functorial, and morphisms between objects supported on disjoint collections of classes vanish. Hence a morphism f:X→Y between decomposed objects is block diagonal, f=⨁CfC with fC:XC→YC.

1.2givenF2

By [F2] the projectivity of P in O says exactly that Hom⁡O(P,−) is exact on O, and the hypothesis on Q says that Hom⁡OC(Q,−) is exact on OC.

2.1F3step 1.1algebra

Apply [F3] to the block-diagonal differentials of step 1.1: a short exact sequence 0→A→E→B→0 in O decomposes into the short exact sequences 0→AC→EC→BC→0 of its components, and conversely exactness of all components gives exactness of the sequence. Therefore pr⁡C is an exact functor O→OC, and iC is exact as the inclusion of a full subcategory closed under subobjects and quotients.

2.2givenF1step 1.1

For A∈OC and any X∈O, decomposing X and using the vanishing of morphisms from A into components supported on other classes gives a natural isomorphism Hom⁡O(A,X)≅Hom⁡OC(A,pr⁡CX); here Hom⁡O(iCA,X) is written Hom⁡O(A,X). Similarly, for Y∈OC, decomposing P gives Hom⁡O(P,pr⁡CY)≅Hom⁡O(pr⁡CP,pr⁡CY), because all components of P other than pr⁡CP map to zero into the object pr⁡CY of OC.

3.1F2step 1.2step 2.1step 2.2

Let P∈O be projective. Composing the isomorphisms of step 2.2, for every X∈O there is a natural isomorphism Hom⁡O(pr⁡CP,X)≅Hom⁡OC(pr⁡CP,pr⁡CX)≅Hom⁡O(P,pr⁡CX). Now X↦pr⁡CX is exact by step 2.1 and Hom⁡O(P,−) is exact by step 1.2, so the composite functor X↦Hom⁡O(pr⁡CP,X) is exact. By [F2] applied in O, pr⁡CP is projective in O.

4.1F2step 1.2step 2.1step 2.2∎

Conversely let Q∈OC be projective in OC. By step 2.2, for every X∈O there is a natural isomorphism Hom⁡O(Q,X)≅Hom⁡OC(Q,pr⁡CX). The first functor is the composite of the exact functor pr⁡C of step 2.1 with the exact functor Hom⁡OC(Q,−) of step 1.2, hence is exact; by [F2], Q is projective in O.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Finite-dimensional tensoring reaches every simple of a linkage class

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let C be a linkage class and let μ∈C be any weight, including a nonintegral or nonreal weight. Choose a sufficiently large nonnegative integer N as follows. In the simple-root basis write cw=(μ+ρ)−w(μ+ρ) and dw=ρ−wρ. For every w≠1, choose an index j(w) with (dw)j(w)>0 and require Re⁡(cw)j(w)+N(dw)j(w)>0; such an N exists because W is finite and dw∈Q+∖{0}. Put λ=μ+Nρ, E=L(Nρ). Then:

  1. E is finite-dimensional and h-semisimple, E∗≅E, and λ is maximal for the root order in its integral-reflection linkage class Cλ=Wλ⋅λ;
  2. M(λ) is projective in OCλ and in O, so E⊗M(λ) is projective in O;
  3. Hom⁡O(E⊗M(λ),L(μ))≠0. Thus pr⁡C(E⊗M(λ)) is a projective object of OC mapping onto L(μ).

The construction does not assert that λ is integral or that Wλ=W; it preserves arbitrary starting weights.

Facts & Assumptions

Given: The Axiom of Choice, a linkage class C with μ∈C, and the construction λ=μ+Nρ, E=L(Nρ).

[F1]

The simple roots are a basis, W is finite, and each simple reflection permutes the positive roots other than its own simple root. Thus siρ=ρ−αi and ⟨ρ,αi∨⟩=1, while for a positive coroot β∨=∑imiαi∨ its pairing with ρ is the positive integer ∑imi. The regular closed-chamber stabilizer is trivial. For the dominant integral weight ρ, one has ρ−wρ∈Q+, and it is nonzero for w≠1. (Finite Weyl positive roots and simple reflections, Finite Weyl closed chambers and stabilizers, Dominant integral weights are maxima of their Weyl orbits, The Weyl vector rho for a chosen positive system, Every complete ordered field is Archimedean)

[F2]

The finite-dimensional simple modules are the L(η) for dominant integral η, and the dual of L(η) is L(−w0η); since w0ρ=−ρ one has L(Nρ)∗=L(Nρ), and L(Nρ) is finite-dimensional with weight-space decomposition (Finite-dimensional simple modules are classified by dominant highest weights, Highest weight of the dual representation, Finite semisimple PBW and highest-weight construction).

[F3]

The root order is defined by nonnegative integer simple-root coordinates of the difference. An integral-reflection linkage class Cλ=Wλ⋅λ is contained in the finite full dot orbit W⋅λ and is a finite lower ideal of itself. (Root order on weights, The integral Weyl group of a weight, Truncation at a finite downward-closed ideal of a linkage class)

[F4]

If λ is maximal in the finite ideal Cλ, then M(λ) is projective in OCλ; an object of OC that is projective in the full subcategory OC is projective in O (A maximal-label Verma is projective in its truncation, Exact projections onto linkage blocks preserve projectives, Central-character summands refine into linkage blocks, A Verma module has a unique simple quotient).

[F5]

Tensoring a projective of O with the finite-dimensional h-semisimple module E gives a projective of O (Finite-dimensional tensoring preserves projectives in category O).

[F6]

The tensor-Hom adjunction and the universal property identify Hom⁡O(E⊗M(λ),L(μ)) with the n+-fixed vectors of weight λ in E∗⊗L(μ) (The universal property of Verma modules, Verma modules).

[F7]

For L(μ)∈OC and P∈O one has Hom⁡O(pr⁡CP,L(μ))≅Hom⁡O(P,L(μ)); a nonzero morphism into a simple object is an epimorphism (Central-character summands refine into linkage blocks, The simple objects of O).

Proof

technique · constructive: shift $\mu$ to a maximal weight of a linkage class, tensor the projective Verma with the self-dual module $L(N\rho)$, and project to the block of $\mu$
1.1F1F3givenalgebra

Choose the finite bound. Since a simple reflection reverses only αi among the positive roots, their half-sum satisfies ρ−siρ=αi, giving the simple coroot pairings one. Thus ρ is regular dominant integral. By [F1], dw=ρ−wρ∈Q+∖{0} for w≠1; take the first positive coordinate in the fixed finite simple-root enumeration. The finitely many real numbers −Re⁡(cw)j(w)/(dw)j(w) have an upper bound, so choose an integer N≥0 strictly larger than all of them. For rank zero W={1} and there are no restrictions; use N=0. With λ=μ+Nρ, the identity λ−w⋅λ=cw+Ndw has positive real part at the selected coordinate for each w≠1. Therefore w⋅λ−λ cannot have all nonnegative integer simple-root coordinates; if that coordinate is nonreal it is not even in the real root lattice, and if real it is negative. No distinct dot conjugate lies above λ. By [F3] this makes λ maximal in Cλ, without claiming it is a greatest weight.

2.1F1F2step 1.1algebra

The auxiliary tensor. The simple pairings ⟨Nρ,αi∨⟩=N make Nρ dominant integral, so E=L(Nρ) is finite-dimensional and h-semisimple by [F2]. Since w0 reverses the positive roots, w0ρ=−ρ, and the dual-highest-weight formula gives E∗≅L(−w0Nρ)=E. This argument concerns Nρ only and imposes no integrality on μ or λ.

3.1F2F3F4F5step 1.1step 2.1

Projectivity in the actual block. The Verma M(λ) is indecomposable: in a direct-sum decomposition, its one-dimensional highest weight space lies in exactly one summand, and its highest vector generates the whole Verma, so all other summands vanish. The block decomposition in [F4] consequently places M(λ) entirely in the block containing its simple quotient L(λ), namely Cλ. This class is a finite ideal of itself by [F3], and step 1.1 makes λ maximal there. Apply [F4] to obtain projectivity in OCλ; the exact block-projection adjunction of [F4] makes it projective in O. Step 2.1 and [F5] then make E⊗M(λ) projective in O.

3.2F2F6step 1.1step 2.1

The product of a highest-weight vector e∈E∗=E of weight Nρ and a highest-weight vector v∈L(μ) of weight μ is nonzero of weight Nρ+μ=λ and is annihilated by n+; by [F6] it is the image of a nonzero element of Hom⁡O(E⊗M(λ),L(μ)), so that Hom-space is nonzero.

4.1F4F7step 3.1step 3.2∎

By [F7] there is a natural isomorphism Hom⁡O(pr⁡C(E⊗M(λ)),L(μ))≅Hom⁡O(E⊗M(λ),L(μ))≠0, since L(μ)∈OC. The object pr⁡C(E⊗M(λ)) lies in OC and is projective in O by step 3.1 and the first part of [F4]; a nonzero morphism from it to the simple object L(μ) is an epimorphism, so OC contains a projective object mapping onto L(μ), as claimed.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Fitting decomposition in a finite-length abelian category

Statement

Let A be an abelian category in which every object has finite length, and define an object to be indecomposable when it is nonzero and every decomposition X≅Y⊕Z has Y=0 or Z=0. Then:

  1. every object of A is a finite direct sum of indecomposable objects;
  2. the endomorphism ring of an indecomposable object is local, and for an endomorphism f of an indecomposable object either f is an isomorphism or f is nilpotent;
  3. the decomposition is unique up to isomorphism and permutation of the summands;
  4. an indecomposable projective object P of A has a unique maximal proper subobject J(P), its quotient P/J(P) is simple, and P is a projective cover of P/J(P) (Projective object, An essential epimorphism is a surjection with superfluous kernel, and a projective cover is a projective source with such a map; projectivity here is relative to A. In a full subcategory closed under submodules, essentiality is the superfluous-kernel condition of the cited module definition; projectivity in the ambient module category is not asserted).

Facts & Assumptions

Given: An abelian category A in which every object has a finite composition series, and the notion of an indecomposable object as in the Statement.

[F1]

Every object X has a composition series, and by Jordan-Hölder the number of factors ℓ(X) is independent of the series; ℓ is additive on short exact sequences and strictly increases under proper inclusions, because a nonzero quotient has a composition factor. Hence every chain of subobjects of X stabilizes and every nonzero object has a maximal proper subobject (Composition series and composition factors of an object, Jordan-Holder theorem in an abelian category).

[F2]

If A,B⊆X are subobjects with A∩B=0 and A+B=X, the canonical morphism A⊕B→X is an isomorphism; and X=0 exactly when id⁡X=0.

[F3]

An object P is projective exactly when Hom⁡(P,−) is exact, equivalently when every epimorphism onto P splits, equivalently when every epimorphism E↠M induces a surjection Hom⁡(P,E)→Hom⁡(P,M) (Projective object, Projective object characterisations). An epimorphism π:P→M is essential when N+ker⁡π=P with N⊆P forces N=P, and a projective cover of M is an essential epimorphism from a projective object (An essential epimorphism is a surjection with superfluous kernel, and a projective cover is a projective source with such a map).

Proof

technique · direct: Fitting decomposition for the stable powers of an endomorphism, local endomorphism rings, exchange and cancellation for the Krull-Schmidt uniqueness, and the unique maximal subobject of an indecomposable projective
1.1F1given

A proper inclusion A⊊B of subobjects of a finite-length object has ℓ(A)<ℓ(B), because B/A≠0 contributes at least one composition factor; consequently any ascending chain of subobjects stabilizes, and a nonzero object has a proper subobject of maximal length, hence a maximal proper subobject.

1.2F1F2given

Every object X is a finite direct sum of indecomposable objects, by induction on ℓ(X): for X=0 take the empty sum; if X≠0 is indecomposable there is nothing to prove; otherwise X≅Y⊕Z with Y,Z≠0, and ℓ(Y),ℓ(Z)<ℓ(X), so the induction hypothesis applies to Y and Z.

2.1F1F2step 1.1algebra

For an endomorphism f:X→X, the image and kernel chains stabilize by [F1]. Choose N with im⁡fN=im⁡f2N and ker⁡fN=ker⁡f2N, and put I=im⁡fN, K=ker⁡fN. The restriction fN∣I:I→I is epic by image stabilization, hence is an isomorphism: length additivity makes its kernel zero. If p:X↠I is the image factorization of fN, then (fN∣I)−1p:X→I retracts the inclusion I↪X and has kernel K. The split exact sequence therefore gives X≅I⊕K.

3.1F1step 2.1algebra

If X is indecomposable, step 2.1 forces I=0 or K=0. The first case gives fN=0. In the second case fN is monic; length additivity makes its cokernel zero, so fN is an isomorphism. Since f commutes with fN and its inverse, fN−1(fN)−1 is an inverse of f. Thus every endomorphism of X is either invertible or nilpotent.

4.1F2step 3.1algebra

Let X be indecomposable and f,g∈End⁡(X) with f+g=u an isomorphism. If neither f nor g is an isomorphism, both are nilpotent by step 3.1; then a:=u−1f and b:=u−1g satisfy a+b=id⁡X and are non-units, hence nilpotent, and a=id⁡X−b gives ab=b−b2=ba, so the commuting nilpotents a,b have nilpotent sum: id⁡X=a+b is nilpotent, forcing id⁡X=0 and X=0 by [F2], contrary to indecomposability. Hence f or g is an isomorphism.

5.1step 4.1algebra

More generally, if f1+⋯+fk=id⁡X with X indecomposable, then some fi is an isomorphism: induct on k, the cases k=1 and k=2 being trivial and step 4.1; for k≥3 put g=f2+⋯+fk, so that f1+g=id⁡X, and if f1 is not an isomorphism then g is an isomorphism by step 4.1, and g−1f2+⋯+g−1fk=id⁡X has k−1 terms, so some g−1fi is an isomorphism by induction and then fi=g(g−1fi) is an isomorphism. Consequently End⁡(X) is local: in a ring R, locality is equivalent to the criterion that for every a∈R either a or 1−a is a unit, and here a+(1−a)=id⁡X is the identity, so the two-term case applies. Also, a nonzero idempotent in a local ring is the identity.

6.1F2step 5.1algebra

Let X=X1⊕A=Y1⊕⋯⊕Ym with X1,Yj indecomposable, and let aj:Yj→X1, bj:X1→Yj be the composites of the inclusions and projections. Then ∑jajbj=id⁡X1; by step 5.1 some aj0bj0 is an isomorphism, and after relabelling j0=1 and setting β:=a1b1 we obtain ε:=b1β−1a1∈End⁡(Y1) with ε2=b1β−1(a1b1)β−1a1=ε, so ε is an idempotent; it is nonzero because β−1a1 is a left inverse of b1 and X1≠0, and its image is b1(X1). By the last sentence of step 5.1, ε=id⁡Y1; hence β−1a1 and b1 are mutually inverse isomorphisms X1≅Y1.

6.2F1F3step 1.1step 5.1

Let P be an indecomposable projective object and let Q,Q′⊆P be proper subobjects with Q+Q′=P. The addition morphism Q⊕Q′→P is an epimorphism, so by [F3] the identity of P lifts to h:P→Q⊕Q′; writing h=(h1,h2) and φ:=iQh1, ψ:=iQ′h2 in End⁡(P), one has φ+ψ=id⁡P, so φ or ψ is an isomorphism by the two-term case of step 5.1. If φ is an isomorphism then iQ is a split monomorphism and an epimorphism, hence an isomorphism Q≅P, contradicting the strictness ℓ(Q)<ℓ(P) for the proper inclusion Q⊊P from step 1.1; the same argument applies to ψ. Hence proper subobjects of P have proper sum. Now choose a proper subobject M⊆P of maximal length, which exists by step 1.1. For any proper Q the sum M+Q is proper, so ℓ(M+Q)≤ℓ(M), while M⊆M+Q gives ℓ(M)≤ℓ(M+Q); hence M=M+Q and Q⊆M. Therefore M is the unique maximal proper subobject J(P), and P/J(P) is simple, since a proper subobject of the quotient pulls back to a proper subobject of P contained in J(P).

7.1F2step 6.1algebra

Keep the notation of step 6.1, put B=⨁j≥2Yj, and use the isomorphism b1:X1→Y1 to define Θ=iX1b1−1pY1+iBpB∈End⁡(X). Relative to X=Y1⊕B, its matrix is (10w1), where w=pBiX1b1−1:Y1→B, because pY1iX1=b1. Thus Θ is invertible with inverse (10−w1), sends Y1 onto X1, and fixes B. Therefore X=X1⊕B. Taking the quotient by X1 in this decomposition and in X=X1⊕A gives A≅X/X1≅B, establishing cancellation.

8.1step 6.1step 7.1step 1.2

Let X=X1⊕⋯⊕Xn=Y1⊕⋯⊕Ym with all Xi,Yj indecomposable, and induct on n. For n=0 we have X=0, so m=0 because the Yj are nonzero. For n≥1, steps 6.1 and 7.1 applied with A=⨁i≥2Xi provide j0 with X1≅Yj0 and ⨁i≥2Xi≅⨁j≠j0Yj; the left-hand side is a sum of n−1 indecomposables and the right-hand side of m−1, so the induction hypothesis gives n−1=m−1 and a bijection matching the remaining factors up to isomorphism, and X1≅Yj0 completes the correspondence.

9.1F3step 1.2step 3.1step 5.1step 6.2step 8.1∎

Collecting the results: step 1.2 gives the finite decomposition into indecomposables, step 5.1 the local endomorphism ring together with the finite-sum criterion, step 3.1 the dichotomy isomorphism-or-nilpotent, step 8.1 the uniqueness up to isomorphism and permutation, and step 6.2 the unique maximal proper subobject J(P) of an indecomposable projective P with simple quotient. Moreover the canonical epimorphism π:P→P/J(P) is essential: if N⊆P satisfies N+J(P)=P and N were proper, then N⊆J(P) by step 6.2 and P=N+J(P)=J(P), a contradiction; hence N=P. With P projective, (P,π) is a projective cover of the simple object P/J(P) in the sense of [F3].

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

Projective covers in O are indecomposable and unique

Statement

Assume the Axiom of Choice (The Axiom of Choice). If a projective object P of O admits an epimorphism P↠L onto a simple object L, then some indecomposable direct summand of P maps onto L, and that summand is a projective cover of L (an essential epimorphism with projective source, An essential epimorphism is a surjection with superfluous kernel, and a projective cover is a projective source with such a map). Any two projective covers of L are isomorphic, although not canonically so, and the endomorphism ring of a projective cover is local. In particular, for every simple L there is at most one isomorphism class of indecomposable projectives with head L; when such a cover exists it is written P(L).

Facts & Assumptions

Given: The Axiom of Choice, a projective P∈O with an epimorphism π:P↠L onto a simple object L, and the finite-length structure of O.

[F1]

Every object of O has finite length and is a finite direct sum of indecomposable objects; the endomorphism ring of every indecomposable object is local; and proper subobjects of an indecomposable projective object have proper sum (equivalently, an indecomposable projective has a unique maximal proper subobject) (Every object of O has finite length, Fitting decomposition in a finite-length abelian category).

[F2]

An object P is projective exactly when for every epimorphism q:E↠M and every morphism f:P→M there is a lift f~:P→E with qf~=f (Projective object).

[F3]

A projective cover of M is an epimorphism π:P↠M with P projective whose kernel is superfluous: N+ker⁡π=P with N⊆P implies N=P (An essential epimorphism is a surjection with superfluous kernel, and a projective cover is a projective source with such a map).

Proof

technique · direct: split $P$ into indecomposables, make the nonzero component an essential epimorphism, and compare two covers by lifting
1.1F1given

By [F1] write P=P1⊕⋯⊕Pn with each Pi indecomposable. If every composite πi:Pi↪P→πL were zero, then π=∑iπi=0, contradicting that π is an epimorphism onto the nonzero object L; so some πj≠0, and πj is an epimorphism because L is simple and 0≠im⁡πj⊆L.

1.2F2algebra

A direct summand of a projective is projective: if P=Pj⊕Q, q:E↠M is an epimorphism and f:Pj→M is a morphism, extend f by zero on Q to F:P→M; by [F2] there is a lift F~:P→E with qF~=F, and its restriction to Pj is a lift of f. Hence Pj is projective.

1.3F2F3algebra

Any two projective covers (P,π) and (P′,π′) of the same object L are isomorphic: by [F2] applied to π′ there is f:P→P′ with π′f=π, and applied to π there is g:P′→P with πg=π′. Then π′(fg−id⁡P′)=π′fg−π′=π′−π′=0, so im⁡(fg−id⁡P′)⊆ker⁡π′; from id⁡P′=fg−(fg−id⁡P′) it follows that P′=im⁡(fg)+ker⁡π′, and since ker⁡π′ is superfluous by [F3] we get im⁡(fg)=P′, so fg is an epimorphism; symmetrically gf is an epimorphism, and finite length makes each of these epimorphic endomorphisms injective: ℓ(P)=ℓ(ker⁡(gf))+ℓ(P) forces ℓ(ker⁡(gf))=0, and similarly for fg. Thus ker⁡f⊆ker⁡(gf)=0 makes f a monomorphism and an epimorphism, hence an isomorphism.

2.1F1F3step 1.1step 1.2

The epimorphism πj:Pj↠L of step 1.1 is essential in the sense of [F3]: if Q⊆Pj is a proper subobject with Q+ker⁡πj=Pj, then Q and ker⁡πj are proper subobjects of the indecomposable projective Pj whose sum is all of Pj, contradicting the proper-sum property of [F1] (note ker⁡πj≠Pj because L≠0). Hence (Pj,πj) is a projective cover of L.

3.1F1step 1.3step 2.1∎

A projective cover is indecomposable: if P=P1⊕P2 with Pi≠0 and π:P↠L essential, then not both components π∣Pi vanish, so some component is nonzero; a nonzero map to the simple object L is an epimorphism, so π(Pi)=L, whence P=Pi+ker⁡π, and essentiality forces Pi=P, contradicting P2≠0. Hence the endomorphism ring of a projective cover is local by [F1]. Moreover, if an indecomposable projective P has head L, meaning its unique simple quotient is L, then the canonical epimorphism onto P/J(P) is essential because the unique maximal proper subobject J(P) of [F1] contains every proper subobject; so such a P is a projective cover of L, and step 1.3 makes any two of them isomorphic. Thus for each simple L there is at most one isomorphism class of indecomposable projectives with head L, written P(L) when it exists.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Category O has enough projectives

Statement

Assume the Axiom of Choice (The Axiom of Choice). Every simple object L(μ) of O admits a projective cover P(μ)↠L(μ) (An essential epimorphism is a surjection with superfluous kernel, and a projective cover is a projective source with such a map), which may be chosen inside the linkage class of μ; the cover is unique up to isomorphism and indecomposable. Consequently O has enough projectives: every object of O is a quotient of a finite direct sum of such projective covers, because objects of O have finite length and each composition factor is a quotient of its projective cover.

Facts & Assumptions

Given: The Axiom of Choice, a simple object L(μ) of O in the linkage class C, and an arbitrary object X∈O with a composition series.

[F1]

There is a projective object Q∈OC with an epimorphism Q↠L(μ) (Finite-dimensional tensoring reaches every simple of a linkage class).

[F2]

If a projective object admits an epimorphism onto a simple object L, then some indecomposable direct summand is a projective cover of L; projective covers of L are indecomposable, unique up to isomorphism, and have local endomorphism rings (Projective covers in O are indecomposable and unique).

[F3]

Every object of O has a finite composition series. The category is abelian and closed under submodules, quotients and finite direct sums; extension closure in the ambient module category requires the middle term to be h-semisimple (Every object of O has finite length, Category O is abelian and extension closed among weight modules, Composition series and composition factors of an object).

Proof

technique · constructive: produce one projective onto each simple, split off an indecomposable cover, then devissage along a composition series
1.1F1F2given

By [F1] there is a projective Q∈OC mapping onto L(μ); applying [F2] to that epimorphism, some indecomposable direct summand P(μ) of Q is a projective cover of L(μ), unique up to isomorphism and indecomposable, and it lies in OC, hence in the linkage class of μ.

2.1F1F2F3step 1.1

Every object X of O is a quotient of a finite direct sum of such projective covers. Induct on the length of a composition series 0=X0⊆X1⊆⋯⊆Xn=X. For n=0 the zero object is a quotient of the empty sum. For n≥1, assume p:Q′↠Xn−1 with Q′ a finite direct sum of projective covers, and let L(μn)=Xn/Xn−1 with its projective cover πn:P(μn)↠L(μn) from step 1.1. Since P(μn) is projective and Xn↠L(μn) is an epimorphism, πn lifts to π~:P(μn)→Xn, and the sum morphism Q′⊕P(μn)→Xn is an epimorphism: an element x∈Xn differs from an element of the image of π~ by an element of Xn−1, which lies in the image of p. Hence Xn is a quotient of the finite direct sum Q′⊕P(μn) of projective covers.

3.1step 1.1step 2.1given∎

By step 1.1 each simple L(μ) has an indecomposable projective cover lying in its linkage class, unique up to isomorphism, and by step 2.1 every object of O is a quotient of a finite direct sum of these projective covers; this is exactly the assertion that O has enough projectives.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Hom from a projective counts simple composition factors

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ be a weight and let P(λ) be the projective cover of L(λ) produced by Category O has enough projectives. For every finite-length object X of O, dim⁡CHom⁡O(P(λ),X)=[X:L(λ)], the multiplicity of L(λ) in a composition series of X (Composition series and composition factors of an object).

Facts & Assumptions

Given: The Axiom of Choice, a weight λ, the projective cover P(λ)↠L(λ) of the previous theorem, and a finite-length object X∈O.

[F1]

P(λ) is projective, is indecomposable with local endomorphism ring, has a unique maximal proper subobject J(P(λ)) with P(λ)/J(P(λ)) simple, and the canonical epimorphism onto the head is essential with head L(λ). The functor Hom⁡(P(λ),−) is exact (Category O has enough projectives, Projective covers in O are indecomposable and unique, Projective object characterisations).

[F2]

For a simple object L(μ) of O one has Hom⁡O(P(λ),L(μ))≅C if μ=λ and 0 if μ≠λ: a nonzero morphism P(λ)→L(μ) is an epimorphism, so L(μ) is the head of P(λ) and μ=λ by [F1]; and for μ=λ every nonzero morphism has kernel a maximal proper subobject, hence equal to J(P(λ)) by uniqueness, so all morphisms factor through the fixed quotient L(λ). Each endomorphism of this highest-weight simple acts by a scalar on its one-dimensional highest line, which generates the module, so End⁡(L(λ))=C. Simple labels are distinct by The simple objects of O. [F1]

[F3]

Every object of O has a finite composition series, and Jordan–Hölder makes its simple multiplicities independent of the series (Composition series and composition factors of an object, Every object of O has finite length, Jordan-Holder theorem in an abelian category). For 0→A→X→B→0, concatenate a composition series of A with the inverse images of a composition series of B: the resulting series of X has precisely their combined factors, proving additivity. The empty series of zero has all multiplicities zero.

Proof

technique · induction on the length of a composition series, using exactness of $\operatorname{Hom}(P(\lambda),-)$ and additivity of multiplicities
1.1F1F3given

Since P(λ) is projective, the functor Hom⁡O(P(λ),−) is exact; in particular, for a short exact sequence 0→A→X→B→0 with all terms of finite length if the two outer Hom spaces are finite-dimensional, so is the middle one and dim⁡Hom⁡(P(λ),X)=dim⁡Hom⁡(P(λ),A)+dim⁡Hom⁡(P(λ),B) and [X:L(λ)]=[A:L(λ)]+[B:L(λ)] by [F3].

1.2F2F3base

If X=0 both sides are zero, and if X is simple then X≅L(μ) for some μ and dim⁡Hom⁡(P(λ),X)=[X:L(λ)] by [F2]; this is the base of the induction on the composition length.

2.1F1F2F3step 1.1step 1.2ihalgebra

Now let X have finite length and induct on the length of a composition series 0=X0⊆X1⊆⋯⊆Xn=X. Assume as induction hypothesis that the identity holds for finite-length objects of smaller length. For n=0 both sides are zero. For n≥1 the exact sequence 0→Xn−1→Xn→Xn/Xn−1→0 has simple quotient Xn/Xn−1, and steps 1.1 and 1.2 with the induction hypothesis give dim⁡Hom⁡(P(λ),Xn)=dim⁡Hom⁡(P(λ),Xn−1)+dim⁡Hom⁡(P(λ),Xn/Xn−1)=[Xn−1:L(λ)]+[Xn/Xn−1:L(λ)]=[Xn:L(λ)].

3.1step 1.2step 2.1discharge-induction: step 2.1∎

By induction on the length of a composition series, step 2.1 proves dim⁡Hom⁡O(P(λ),X)=[X:L(λ)] for every finite-length X.

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

Finite Verma flags and their multiplicities

Definition

Assume the Axiom of Choice (The Axiom of Choice). Work in category O with the conventions of The classical BGG category O, and write Δ(μ)=M(μ) for the standard objects of Standard and costandard objects, i.e. the Verma modules of Verma modules.

A finite Verma flag of an object X of O — also called a standard flag or a Δ-flag — is a finite increasing sequence of subobjects 0=X0⊆X1⊆⋯⊆Xn=X such that each quotient Xi/Xi−1 is isomorphic to a Verma module Δ(μi)=M(μi), for i=1,…,n. An object admitting such a flag is called Verma-filtered. Since the flag is exhausted by its factors, its class in the Grothendieck group K0(O) of The Grothendieck group and character of O is [X]=∑i=1n[Δ(μi)].

For a Verma-filtered object X and a weight μ, the multiplicity (X:Δ(μ)) is the number of indices i with μi=μ in a Verma flag of X. This number is independent of the chosen flag by Verma-flag multiplicities are independent of the flag ↗, so the notation (X:Δ(μ)) is well-defined for Verma-filtered X.

The zero object has the empty flag, and every multiplicity of the zero object is zero; a nonzero Verma-filtered object has at least one factor. A one-step flag of X is exactly an isomorphism X≅Δ(μ) for a single weight μ, so the objects with a one-step flag are the Verma modules themselves. The flag is a chain of subobjects of X in the module category; it is not required to split, and later examples show that it need not.

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

Verma-flag multiplicities are independent of the flag

Statement

Assume the Axiom of Choice (The Axiom of Choice). If X∈O admits two finite Verma flags with corresponding multiplicities mμ and mμ′ (Finite Verma flags and their multiplicities), then mμ=mμ′ for every weight μ. Hence the multiplicity (X:Δ(μ)) of Finite Verma flags and their multiplicities is well defined.

Facts & Assumptions

Given: The Axiom of Choice, an object X with two finite Verma flags and their multiplicity functions m,m′.

[F1]

If 0=X0⊆X1⊆⋯⊆Xn=X is a Verma flag with factors Xi/Xi−1≅Δ(μi), then [X]=∑i=1n[Δ(μi)] in the Grothendieck group, where [Δ(μ)]=[M(μ)], and mμ=#{i:μi=μ} is the multiplicity; all but finitely many mμ vanish (Finite Verma flags and their multiplicities, The Grothendieck group and character of O).

[F2]

The classes [M(λ)], equivalently the classes [Δ(λ)], form a Z-basis of K0(O) (Simple and standard bases of K0(O)).

Proof

technique · direct comparison of two basis expansions in the Grothendieck group
1.1F1given

The two flags give two finite expansions of the same class, [X]=∑μmμ[Δ(μ)] and [X]=∑μmμ′[Δ(μ)], in K0(O).

2.1F2step 1.1∎

Since the standard classes [Δ(μ)]=[M(μ)] form a Z-basis of K0(O), the coefficient of each basis element in a class is uniquely determined. Comparing the two expansions of [X] from step 1.1 therefore gives mμ=mμ′ for every weight μ, so the multiplicity (X:Δ(μ)) is independent of the chosen flag.

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

Finite-dimensional tensoring preserves Verma flags

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let E be a finite-dimensional h-semisimple g-module with weight multiplicities dim⁡Eη (Weight and weight space). For every weight μ, the object E⊗Δ(μ) has a finite Verma flag (Finite Verma flags and their multiplicities) whose factors are Δ(μ+η), the factor Δ(μ+η) occurring dim⁡Eη times; the factors can be ordered so that a real-linear height ℓ with ℓ(αi)=1 is nonincreasing.

Consequently, if X∈O has a finite Verma flag with multiplicities (X:Δ(ν)), then E⊗X has a finite Verma flag and (E⊗X:Δ(μ))=∑ηdim⁡Eη (X:Δ(μ−η)).

Facts & Assumptions

Given: The Axiom of Choice, a finite-dimensional h-semisimple g-module E with weight spaces Eη, and weights μ,ν.

[F1]

M(λ)=U(g)⊗U(b)Cλ and Δ(λ)=M(λ); a finite Verma flag has finite length, factors Δ(μi), and the multiplicities count the factors appearing, additively along a top step 0→K→X→Δ(μ)→0 (Verma modules, Finite Verma flags and their multiplicities).

[F2]

PBW gives a right U(b)-module isomorphism U(g)≅U(n−)⊗U(b), so U(g) is free as a right U(b)-module and induction is exact (Finite semisimple PBW and highest-weight construction).

[F3]

The weight set of E is finite, h preserves each Eη, and a positive-root vector sends Eη into Eη+α (Weight and weight space). Fix a real-linear functional ℓ on the underlying real vector space of h∗ with ℓ(αi)=1 for all simple roots. It exists by their linear independence and is strictly positive on Q+∖{0}.

[F4]

The functor M↦E⊗M with diagonal action is exact and maps O into itself (Finite-dimensional tensoring preserves O).

Proof

technique · direct: filter the finite-dimensional $\mathfrak b$-module $E\otimes\mathbb C_\mu$ by one-dimensional quotients and induce, then extend to general $X$ by exactness
1.1F2algebraconstruct

For any b-module V, define Ψ:U(g)⊗U(b)(E⊗V)→E⊗(U(g)⊗U(b)V) by Ψ(u⊗(e⊗v))=u⋅(e⊗(1⊗v)), using the diagonal action. For x∈b, the identity x⋅(e⊗(1⊗v))=xe⊗(1⊗v)+e⊗(1⊗xv) proves balancing, and the definition is g-linear. Under [F2]'s PBW identifications both sides are filtered by the degree in U(n−). Expanding the diagonal action of a negative-root monomial, its leading term acts entirely on the induced factor, so the associated graded map is the flip u⊗e⊗v↦e⊗u⊗v. It is bijective. Induction on finite degree then proves that Ψ itself is bijective: lift a leading term and subtract to prove surjectivity; a nonzero highest-degree term cannot map to zero, proving injectivity.

2.1F1F2F3step 1.1algebra

Enumerate the weights of E in nonincreasing ℓ-order and choose a basis in each weight space. The initial spans in E⊗Cμ are b-submodules: Cartan acts by scalars on each weight, and positive-root operators raise ℓ, landing in already included spaces. Their successive quotients are Cμ+η, once for each basis vector of Eη. Exact induction in [F2], followed by the tensor identity of step 1.1, gives a Verma flag of E⊗Δ(μ) with factors Δ(μ+η) of multiplicity dim⁡Eη, in nonincreasing ℓ-order.

3.1F1F4step 2.1algebra

For a Verma-filtered X induce on the flag length. For X=0 both sides vanish. For the top step 0→K→X→Δ(ν)→0 of a flag, exactness of E⊗− by [F4] gives an exact sequence 0→E⊗K→E⊗X→E⊗Δ(ν)→0; by step 2.1 and the induction hypothesis E⊗K has a finite Verma flag with multiplicities (E⊗K:Δ(μ))=∑ηdim⁡Eη(K:Δ(μ−η)), and adjoining the flag of E⊗Δ(ν) with multiplicities dim⁡Eηδν,μ−η gives a finite Verma flag of E⊗X. Since multiplicity is additive along the resulting top step and (X:Δ(μ−η))=(K:Δ(μ−η))+δν,μ−η by [F1], the formula (E⊗X:Δ(μ))=∑ηdim⁡Eη(X:Δ(μ−η)) follows.

4.1step 2.1step 3.1∎

Steps 2.1 and 3.1 prove the single-Verma statement and the consequence for a general Verma-filtered X, completing the proof.

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

Peeling a maximal-weight Verma from a standard filtration

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X∈O be Verma-filtered (Finite Verma flags and their multiplicities) with a fixed finite flag of length m, and let v≠0 be a vector of weight ν in X such that ν is maximal among the weights of X, that is, there is no weight γ of X with γ−ν∈Q+∖{0}. Then v is a highest-weight vector, the induced homomorphism Δ(ν)→X, vν↦v, is injective, and the cokernel X/Δ(ν) admits a finite Verma flag of length m−1: the given flag of X induces a flag of the cokernel after removing exactly one factor Δ(ν).

The hypothesis that ν is maximal in the support of X is essential; it is used below to force the first flag factor met by the image to be Δ(ν), and it cannot be dropped.

Facts & Assumptions

Given: The Axiom of Choice, a Verma-filtered object X with a fixed flag 0=F0⊆F1⊆⋯⊆Fm=X whose factors Fi/Fi−1≅Δ(μi) are Verma modules, and a nonzero vector v∈X of weight ν maximal among the weights of X.

[F1]

Flags are chains of subobjects with Verma quotients, and quotients and subobjects of objects of O lie in O (Finite Verma flags and their multiplicities).

[F2]

The weights of Δ(λ)=M(λ) are exactly λ−Q+ and M(λ)λ=Cvλ; a g-homomorphism M(λ)→V into a g-module V is determined by, and exists for, any n+-fixed vector of weight λ in V (Weights of a Verma module lie below lambda, The universal property of Verma modules, Verma homomorphisms and singular vectors).

[F3]

Every nonzero homomorphism between Verma modules is injective, and every nonzero submodule of a Verma module contains a nonzero n+-fixed vector (A nonzero homomorphism between Verma modules is injective, Every nonzero Verma submodule contains a singular vector).

Proof

technique · direct: let the image of the induced Verma map meet the flag and compare weights at the first factor it reaches
1.1F2given

Since ν is maximal among the weights of X, the vector v is n+-fixed: for x∈n+ of weight α∈Q+∖{0} the vector xv, if nonzero, would have weight ν+α, contradicting maximality. By [F2] there is a homomorphism f:Δ(ν)→X with f(vν)=v≠0; let i be the smallest index with f(Δ(ν))⊆Fi, which exists because Fm=X. By minimality f(Δ(ν)) is not contained in Fi−1, so the composite fˉ:Δ(ν)→fFi↠Fi/Fi−1=Δ(μi) is nonzero.

2.1F2F3step 1.1

Since fˉ≠0, the weight ν of vν maps to a nonzero vector in Δ(μi), so ν is a weight of Δ(μi) and therefore ν≤μi by [F2]. On the other hand μi is a weight of the subquotient Fi/Fi−1 of X, hence a weight of X, and the relation ν≤μi and maximality of ν force μi=ν, so fˉ is a nonzero endomorphism of the Verma module Δ(ν). Since Δ(ν) is generated by vν and fˉ(vν)∈Δ(ν)ν=Cvν is nonzero by [F2], the image of fˉ contains vν, so fˉ is surjective, and it is injective by [F3]; hence fˉ is an isomorphism. Now f itself is injective: if ker⁡f≠0, then by [F3] it contains a nonzero n+-fixed vector of some weight η, which by [F2] provides a nonzero homomorphism g:Δ(η)→Δ(ν) with image in ker⁡f; then fˉg=0, while fˉ is injective and g≠0, so fˉg≠0, a contradiction. Hence f:Δ(ν)↪X is injective.

3.1F1step 2.1algebra

Identify Δ(ν) with its image f(Δ(ν))⊆Fi. Since fˉ is an isomorphism onto Fi/Fi−1, one has Fi=f(Δ(ν))+Fi−1 and f(Δ(ν))∩Fi−1=0, so Fi/f(Δ(ν))≅Fi−1. In the quotient X/f(Δ(ν)) the images of the flag pieces form the chain 0⊆F1⊆⋯⊆Fi−1=Fi/f(Δ(ν))⊆Fi+1/f(Δ(ν))⊆⋯⊆X/f(Δ(ν)), whose successive quotients are Δ(μj) for j≠i and zero at the repeated step, and Fj/f(Δ(ν))/Fj−1/f(Δ(ν))≅Fj/Fj−1=Δ(μj) for j>i; hence X/f(Δ(ν)) has a Verma flag whose factors are exactly the Δ(μj) with j≠i, of length m−1, and the removed factor is Δ(μi)=Δ(ν).

4.1step 2.1step 3.1∎

Steps 2.1 and 3.1 prove that v is a highest-weight vector, that Δ(ν)→X is injective, and that the cokernel has a Verma flag induced from the given flag by deleting exactly one factor, of length m−1.

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

Direct summands of Verma-filtered objects are Verma-filtered

Statement

Assume the Axiom of Choice (The Axiom of Choice). If X=X1⊕X2 is a direct sum decomposition in O and X is Verma-filtered (Finite Verma flags and their multiplicities), then both X1 and X2 are Verma-filtered.

Facts & Assumptions

Given: The Axiom of Choice, a Verma-filtered object X=X1⊕X2 with a fixed Verma flag of length m, and an enumeration of the two summands.

[F1]

If X=X1⊕X2 and Δ(ν)↪X1 is a subobject, then X/Δ(ν)≅(X1/Δ(ν))⊕X2. The weights of X are the union of the weights of the factors of any Verma flag, and a maximal weight of X is the label of some factor (Finite Verma flags and their multiplicities).

[F2]

If ν is maximal among the weights of a Verma-filtered object X with a flag of length m and v≠0 is a vector of weight ν, then v is a highest-weight vector, the induced homomorphism Δ(ν)→X is injective, and the cokernel has a Verma flag of length m−1 (Peeling a maximal-weight Verma from a standard filtration).

[F3]

If 0→A→E→B→0 is exact and A and B are Verma-filtered, then E is Verma-filtered: concatenating a flag of A with the preimages of a flag of B gives a flag of E. [F1]

Proof

technique · induction on the flag length, peeling a maximal-weight Verma that lies in one of the two summands
1.1F1base

If m=0 then X=0, so X1=X2=0 and both summands are Verma-filtered with the empty flag.

1.2F1givenih

Let m≥1. The finite set of labels of the fixed flag has a maximal element ν; every weight of X lies below one of those labels, so a weight strictly above ν would force a flag label strictly above it. Thus ν is a maximal element of the set of weights of X, with no greatest-label assumption. By [F1] the weight ν is the label of some factor of the fixed flag: it lies in μi−Q+ for a factor Δ(μi), so ν≤μi, while μi is a weight of X and ν is maximal, so comparability ν≤μi forces μi=ν. Choose a nonzero vector v of weight ν; writing v=v1+v2 with vi∈Xi, some vi≠0 is again a maximal-weight vector, and after exchanging the names of the summands we may assume v∈X1. Assume as induction hypothesis that every Verma-filtered direct sum with a flag of length m−1 has Verma-filtered summands.

2.1F1F2F3step 1.1step 1.2

By [F2] the induced homomorphism Δ(ν)→X is injective with image in X1 (its image is the submodule generated by v) and cokernel Verma-filtered with a flag of length m−1. Since Δ(ν)⊆X1, [F1] gives X/Δ(ν)≅(X1/Δ(ν))⊕X2; the induction hypothesis applies to this Verma-filtered direct sum of flag length m−1, so X2 and X1/Δ(ν) are Verma-filtered. From the exact sequence 0→Δ(ν)→X1→X1/Δ(ν)→0, both ends Verma-filtered, [F3] makes X1 Verma-filtered.

3.1step 1.1step 2.1discharge-induction: step 2.1∎

By induction on m, steps 1.1 and 2.1 show that whenever X=X1⊕X2 is Verma-filtered, both summands are Verma-filtered.

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

Projectives in category O have finite Verma flags

Statement

Assume the Axiom of Choice (The Axiom of Choice). Every projective object of O has a finite Verma flag (Finite Verma flags and their multiplicities).

More precisely, each projective cover P(μ) produced by Category O has enough projectives is a direct summand of the projective object pr⁡C(E⊗M(λ)) of Finite-dimensional tensoring reaches every simple of a linkage class, which is a direct summand of E⊗M(λ); a general projective object has finite length, hence is a finite direct sum of indecomposable projectives, each of which is a projective cover of its simple head.

Facts & Assumptions

Given: The Axiom of Choice, the projective covers P(μ)↠L(μ) produced by the enough-projectives theorem, and an arbitrary projective object P∈O.

[F1]

The cover P(μ) is (isomorphic to) a direct summand of the projective object pr⁡C(E⊗M(λ)) of Finite-dimensional tensoring reaches every simple of a linkage class, and pr⁡C(E⊗M(λ)) is a direct summand of E⊗M(λ) in the block decomposition (Finite-dimensional tensoring reaches every simple of a linkage class, Category O has enough projectives, Projective covers in O are indecomposable and unique).

[F2]

E⊗M(λ) is Verma-filtered, and every direct summand of a Verma-filtered object of O is Verma-filtered (Finite-dimensional tensoring preserves Verma flags, Direct summands of Verma-filtered objects are Verma-filtered).

[F3]

Every object of O has finite length and is a finite direct sum of indecomposable objects; an indecomposable projective is a projective cover of its simple head (Every object of O has finite length, Fitting decomposition in a finite-length abelian category, Projective covers in O are indecomposable and unique).

Proof

technique · direct: each projective cover is a direct summand of a tensored Verma, and a general projective splits into finitely many such covers
1.1F1given

By [F1] each P(μ) is a direct summand of pr⁡C(E⊗M(λ)), which is in turn a direct summand of E⊗M(λ).

2.1F2step 1.1

By [F2] the object E⊗M(λ) is Verma-filtered; both pr⁡C(E⊗M(λ)) and its direct summand P(μ) are direct summands of a Verma-filtered object and hence Verma-filtered by [F2]. So every projective cover P(μ) has a finite Verma flag.

3.1F3step 2.1∎

Let P∈O be projective. By [F3] it has finite length and decomposes as a finite direct sum P=P1⊕⋯⊕Pn of indecomposables; each Pi is projective and indecomposable, hence a projective cover of its simple head L(μi) by [F3], hence isomorphic to P(μi) by uniqueness of projective covers, so each Pi is Verma-filtered by step 2.1. A finite direct sum of Verma-filtered objects is Verma-filtered, by concatenating the flags along the summands; hence P has a finite Verma flag.

Remarks

The statement of this theorem is only the existence of a finite flag; the sharper restriction on the labels occurring in a flag of P(λ) is proved in The triangular restriction on projective Verma flags, after BGG reciprocity, so that the proof here does not assume reciprocity.

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

Standard-costandard Hom and Ext-one orthogonality

Statement

Assume the Axiom of Choice (The Axiom of Choice). For all weights μ and ν one has dim⁡CHom⁡O(Δ(μ),∇(ν))=1 if μ=ν,dim⁡CHom⁡O(Δ(μ),∇(ν))=0 if μ≠ν, and Ext⁡O1(Δ(μ),∇(ν))=0. Here Δ(ν)=M(ν) and ∇(ν)=D(M(ν)) are the standard and costandard objects of Standard and costandard objects, and Ext⁡1 is the derived Ext over the abelian category O, identified with classes of extensions by the Yoneda theorem.

Facts & Assumptions

Given: The Axiom of Choice, weights μ,ν, and the standard and costandard objects Δ(μ)=M(μ), ∇(ν)=D(M(ν)) of O.

[F1]

The negative-root ordered monomials on vλ form a basis of M(λ), its weights are exactly λ−Q+, its weight spaces are finite-dimensional and M(λ)λ=Cvλ; consequently M(λ)=n−M(λ)⊕Cvλ, and a b-linear map Cλ→V into a g-module V sending 1 to an n+-fixed vector of weight λ extends uniquely to a g-linear map M(λ)→V (Finite semisimple PBW and highest-weight construction, Weights of a Verma module lie below lambda, The universal property of Verma modules, Verma modules).

[F2]

Restricted duality D is an exact contravariant involution of O with D(M(λ))=∇(λ) and D(∇(λ))=M(λ), preserving weight-space dimensions and satisfying D(M)μ=Mμ∗ with action (xφ)(m)=φ(τ(x)m) for the Chevalley anti-involution τ (Restricted Chevalley dual, Restricted duality is exact and involutive on O, Chevalley-contravariant forms); τ(n+)=n− because τ exchanges the root spaces gα and g−α (Restricted self-duality of simple highest-weight modules).

[F3]

Category O has enough projectives (Category O has enough projectives). Applying [F2] to a projective epimorphism onto D(X) gives a monomorphism X↪D(P) with injective target, so it also has enough injectives. Finitely generated U(g)-modules have a set of representatives (quotients of the modules U(g)n). Work on a set-sized skeleton of O. Under AC, choose projective and injective resolutions on all its objects by successively covering kernels and embedding cokernels. Canonical comparison makes the resulting Ext independent of the chosen representatives. Thus the supplied resolution hypotheses of The balanced Ext bifunctor hold, and extensions form a set up to equivalence. AC also implies Dependent Choice by choosing successors of a serial relation. The Yoneda comparison therefore identifies Ext⁡1(Δ(μ),∇(ν)) with extensions 0→∇(ν)→N→Δ(μ)→0 (An extension of an object by an object in an abelian category, Yoneda Ext one is naturally isomorphic to derived Ext one).

[F4]

For weights, μ≤ν means ν−μ∈Q+; this is a partial order, the strict part ν−μ∈Q+∖{0} is transitive, and a sum of the form μ<γ≤ν therefore implies μ<ν.

Proof

technique · direct: count the $\mathfrak n^+$-fixed weight vectors of a costandard object, then split every extension by a weight argument, dualizing in the remaining case
1.1F1F2given

By [F1] a homomorphism Δ(μ)→∇(ν) corresponds to an n+-fixed vector of weight μ in ∇(ν), and by [F2] the space ∇(ν)μ is (M(ν)μ)∗, a functional being extended by zero off weight μ, with (xψ)(m)=ψ(τ(x)m); the fixed condition therefore says exactly that ψ annihilates τ(n+)M(ν)=n−M(ν). By [F1] one has M(ν)=n−M(ν)⊕Cvν, so a functional supported in weight μ and vanishing on n−M(ν) is zero when μ≠ν (its weight space lies in n−M(ν)) and is determined by an arbitrary value on Cvν when μ=ν; hence the Hom space has dimension 1 for μ=ν and 0 otherwise.

1.2F1F3F4algebra

Let 0→∇(ν)→N→Δ(μ)→0 be an extension and assume ν−μ∉Q+∖{0}; pull the sequence back along the b-linear map Cμ→Δ(μ), 1↦vμ, to obtain the b-exact sequence 0→∇(ν)→N′→Cμ→0 with N′=N×Δ(μ)Cμ. A g-splitting of the original sequence restricts to a b-splitting of the pulled-back sequence, and conversely a b-splitting Cμ→N′, composed with N′→N, is a b-map Cμ→N whose image is an n+-fixed vector of weight μ, so it extends to a g-map Δ(μ)→N by [F1], and the composite Δ(μ)→N→Δ(μ) is a g-endomorphism of Δ(μ) sending vμ to vμ, hence the identity; so the original sequence splits exactly when the pulled-back one does. The weights of N′ are those of ∇(ν), namely ν−Q+, together with μ; if a weight γ of ∇(ν) were strictly above μ, then μ<γ≤ν, so μ<ν by [F4], contrary to the case assumption, and no weight of N′ is strictly above μ. The quotient map N′→Cμ is surjective in weight μ, so choose a lift v of its basis vector that is a μ-weight vector. For x∈n+ nonzero of weight α∈Q+∖{0} the vector xv, if nonzero, would be a weight vector of weight μ+α>μ in N′, which is impossible; hence v is n+-fixed and the pulled-back sequence splits, so the original extension splits.

2.1F2step 1.2algebra

It remains to treat the case ν−μ∈Q+∖{0}, i.e. μ<ν. Applying the exact contravariant involution D of [F2] to the extension 0→∇(ν)→N→Δ(μ)→0 gives the extension 0→D(Δ(μ))=∇(μ)→D(N)→D(∇(ν))=Δ(ν)→0, in which the pair of weights is (ν,μ); since the strict order is transitive and μ<ν, antisymmetry gives μ−ν∉Q+∖{0} for the reversed pair, so step 1.2 shows that the dual extension splits. Applying the involution D again, and using D2≅id⁡ and exactness, the original extension splits.

3.1F3step 1.1step 1.2step 2.1∎

Every pair of weights satisfies ν−μ∉Q+∖{0} or μ<ν, so steps 1.2 and 2.1 show that every extension of Δ(μ) by ∇(ν) splits; by the Yoneda identification of [F3] this is exactly Ext⁡O1(Δ(μ),∇(ν))=0. Together with the Hom computation of step 1.1 this proves both assertions of the statement.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Hom to costandards counts Verma-flag factors

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X∈O be Verma-filtered (Finite Verma flags and their multiplicities). Then for every weight ν dim⁡CHom⁡O(X,∇(ν))=(X:Δ(ν)),Ext⁡O1(X,∇(ν))=0. The result is stated for all weights, including equal and incomparable labels.

Facts & Assumptions

Given: The Axiom of Choice, a Verma-filtered object X, and a weight ν.

[F1]

A Verma flag of length n has a top step 0→K→X→Δ(μ)→0 in which K is Verma-filtered of length n−1, and the multiplicities are additive along the step: (X:Δ(ν))=(K:Δ(ν))+δμν; the zero object has the empty flag and all multiplicities zero (Finite Verma flags and their multiplicities).

[F2]

For all weights μ,ν one has dim⁡Hom⁡O(Δ(μ),∇(ν))=δμν and Ext⁡O1(Δ(μ),∇(ν))=0; and Hom⁡O(0,−)=0=Ext⁡O1(0,−) (Standard-costandard Hom and Ext-one orthogonality).

[F3]

Category O is abelian and has enough projectives (Category O is abelian and extension closed among weight modules, Category O has enough projectives). The exact contravariant equivalence D exchanges projectives and injectives: Hom⁡(−,D(P))≅Hom⁡(P,D(−)) is exact for projective P. Dualizing a projective epimorphism P↠D(Y) therefore embeds Y into the injective D(P), proving enough injectives (Restricted duality is exact and involutive on O). Finitely generated U(g)-modules have a set of representatives, since they are quotients of U(g)n for finite n. Work on a set-sized skeleton of O; under AC choose a projective epimorphism onto and an injective embedding of each object, then recursively cover kernels and embed cokernels to supply resolutions. AC implies DC by selecting successors in any serial relation. Fix these resolution systems and use the canonical comparison identifications of The balanced Ext bifunctor. For a short exact sequence 0→M′→M→M′′→0 in O and every N there is a natural exact sequence 0→Hom⁡(M′′,N)→Hom⁡(M,N)→Hom⁡(M′,N)→Ext⁡1(M′′,N)→Ext⁡1(M,N)→Ext⁡1(M′,N) (The long exact Ext sequence in the first variable).

Proof

technique · induction on the length of a Verma flag, using the long exact sequence and the $\Delta$-$\nabla$ orthogonality
1.1F1F2base

If X=0 has the empty flag, then Hom⁡(X,∇(ν))=0 and Ext⁡1(X,∇(ν))=0 while all multiplicities (X:Δ(ν)) vanish, so both formulas hold.

1.2F1givenih

Let X have a Verma flag of length n≥1 with top step 0→K→X→Δ(μ)→0; then K has a Verma flag of length n−1 and (X:Δ(ν))=(K:Δ(ν))+δμν. Assume as induction hypothesis that the two formulas hold for K.

2.1F2F3step 1.2algebra

The long exact sequence of [F3] for the top step begins 0→Hom⁡(Δ(μ),∇(ν))→Hom⁡(X,∇(ν))→Hom⁡(K,∇(ν))→Ext⁡1(Δ(μ),∇(ν))→Ext⁡1(X,∇(ν))→Ext⁡1(K,∇(ν)). By [F2] and the induction hypothesis of step 1.2 the fourth and sixth terms vanish, so the sequence gives the short exact sequence 0→Hom⁡(Δ(μ),∇(ν))→Hom⁡(X,∇(ν))→Hom⁡(K,∇(ν))→0 and the vanishing of Ext⁡1(X,∇(ν)). Taking dimensions and using [F2] and step 1.2, dim⁡Hom⁡(X,∇(ν))=δμν+(K:Δ(ν))=(X:Δ(ν)).

3.1step 1.1step 2.1discharge-induction: step 2.1∎

By induction on the flag length, steps 1.1 and 2.1 prove dim⁡Hom⁡O(X,∇(ν))=(X:Δ(ν)) and Ext⁡O1(X,∇(ν))=0 for every Verma-filtered X and every weight ν.

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

BGG reciprocity

Statement

Assume the Axiom of Choice (The Axiom of Choice). For all weights λ and μ, (P(λ):Δ(μ))=[Δ(μ):L(λ)]=[M(μ):L(λ)], where P(λ) is the projective cover of L(λ), the left-hand multiplicity is the Verma-flag multiplicity of Projectives in category O have finite Verma flags, and the right-hand multiplicity is the simple composition multiplicity of the Verma module M(μ) (Standard and costandard objects).

Facts & Assumptions

Given: The Axiom of Choice, weights λ,μ, the projective cover P(λ) of L(λ), and the costandard object ∇(μ)=D(M(μ)).

[F1]

P(λ) is Verma-filtered, so dim⁡CHom⁡O(P(λ),∇(μ))=(P(λ):Δ(μ)) and Ext⁡O1(P(λ),∇(μ))=0 (Projectives in category O have finite Verma flags, Hom to costandards counts Verma-flag factors).

[F2]

For every finite-length object X one has dim⁡CHom⁡O(P(λ),X)=[X:L(λ)] (Hom from a projective counts simple composition factors).

[F3]

Restricted duality D is an exact contravariant involution preserving composition multiplicities and D(L(λ))≅L(λ); hence [∇(μ):L(λ)]=[D(M(μ)):L(λ)]=[M(μ):L(λ)] (Restricted duality is exact and involutive on O, Restricted self-duality of simple highest-weight modules).

Proof

technique · direct: convert the flag multiplicity into a Hom dimension, then count with the projective-cover Hom formula and duality
1.1F1given

By [F1], (P(λ):Δ(μ))=dim⁡CHom⁡O(P(λ),∇(μ)).

1.2F2F3given

Since ∇(μ)=D(M(μ)) is an object of O of finite length, [F2] gives dim⁡CHom⁡O(P(λ),∇(μ))=[∇(μ):L(λ)], and by [F3] this equals [M(μ):L(λ)].

2.1step 1.1step 1.2∎

Combining steps 1.1 and 1.2 gives (P(λ):Δ(μ))=[M(μ):L(λ)]; since Δ(μ)=M(μ), the middle and right multiplicities agree, so all three quantities are equal.

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

The triangular restriction on projective Verma flags

Statement

Assume the Axiom of Choice (The Axiom of Choice). If (P(λ):Δ(μ)) is nonzero then μ≥λ, that is, μ−λ∈Q+. Moreover (P(λ):Δ(λ))=1, so exactly one factor of every Verma flag of P(λ) has label λ.

Facts & Assumptions

Given: The Axiom of Choice, weights λ,μ, and the Verma-filtered projective cover P(λ) of L(λ).

[F1]

(P(λ):Δ(μ))=[Δ(μ):L(λ)]=[M(μ):L(λ)], where the right-hand side is the composition multiplicity of the simple module L(λ) in the Verma module M(μ)=Δ(μ) (BGG reciprocity, Projectives in category O have finite Verma flags).

[F2]

The weights of M(μ) are exactly μ−Q+ and M(μ)μ=Cvμ; L(μ) is the unique simple quotient of M(μ), with highest weight μ (Weights of a Verma module lie below lambda, A Verma module has a unique simple quotient).

[F3]

μ≥λ means μ−λ∈Q+, and the order is a partial order (Root order on weights).

Proof

technique · direct: identify the flag multiplicity with a Verma composition multiplicity and compare weights
1.1F1F2F3given

If (P(λ):Δ(μ))≠0, then by [F1] the simple module L(λ) is a composition factor of M(μ), hence its highest weight λ is a weight of M(μ); by [F2] every weight of M(μ) lies in μ−Q+, so λ≤μ, that is, μ−λ∈Q+.

1.2F1F2

(P(λ):Δ(λ))=[M(λ):L(λ)]=1: the kernel J(λ) of the quotient map is the sum of all proper submodules, so J(λ) contains no highest-weight vector of weight λ and J(λ)λ=0; since M(λ)=n−M(λ)⊕Cvλ by [F2], this gives J(λ)⊆n−M(λ). The highest weight of any composition factor of J(λ) is a weight of J(λ) and is therefore different from λ, so no factor is isomorphic to L(λ); from 0→J(λ)→M(λ)→L(λ)→0 the multiplicity [M(λ):L(λ)] is exactly one.

2.1F3step 1.1step 1.2∎

Thus a nonzero multiplicity (P(λ):Δ(μ)) forces μ≥λ, and the label λ occurs exactly once in every Verma flag of P(λ).

CorollaryStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Injectives have costandard filtrations

Statement

Assume the Axiom of Choice (The Axiom of Choice). For every weight λ the restricted dual I(λ)=D(P(λ)) of the projective cover is an injective object of O (Injective object) and has a finite costandard (∇-)flag, with multiplicities (I(λ):∇(μ))=(P(λ):Δ(μ))=[Δ(μ):L(λ)] in the sense of Finite Verma flags and their multiplicities and BGG reciprocity; the functor D exchanges Verma flags of projectives with costandard flags of injectives. Every injective object of O has a finite costandard flag: it is a finite direct sum of indecomposable injectives, and D induces a bijection between the indecomposable projectives and the indecomposable injectives of O (Restricted duality is exact and involutive on O); each indecomposable injective is the dual of an indecomposable projective and hence of the form I(λ).

Facts & Assumptions

Given: The Axiom of Choice, weights λ,μ, the Verma-filtered projective cover P(λ), and the exact contravariant involution D of restricted duality with D(Δ(μ))=∇(μ) and D(∇(μ))=Δ(μ).

[F1]

D is an exact contravariant involution of O, hence carries projectives to injectives and injectives to projectives, preserves finite direct sums, finite length and multiplicities, and maps a flag of Y to a flag of D(Y) with the dual factors: the exact sequences 0→Xi−1→Xi→Xi/Xi−1→0 become 0→D(Xi/Xi−1)→D(Xi)→D(Xi−1)→0 (Restricted duality is exact and involutive on O, Standard and costandard objects).

[F2]

P(λ) has a finite Verma flag with multiplicities (P(λ):Δ(μ))=[Δ(μ):L(λ)], and every indecomposable projective is a projective cover of its simple head (Projectives in category O have finite Verma flags, BGG reciprocity, Projective covers in O are indecomposable and unique).

[F3]

The category O is abelian, and every object has finite length (Category O is abelian and extension closed among weight modules, Every object of O has finite length). These hypotheses allow Fitting decomposition in a finite-length abelian category to be applied: every object is a finite direct sum of indecomposable objects, including the empty sum for zero.

Proof

technique · direct: dualize a Verma flag of a projective and decompose a general injective into duals of indecomposable projectives
1.1F1F2given

D(P(λ)) is injective by [F1]. If 0=X0⊆X1⊆⋯⊆Xn=P(λ) is a Verma flag with factors Δ(μi)=Xi/Xi−1, then applying the exact contravariant functor D to the defining sequences 0→Xi−1→Xi→Δ(μi)→0 gives exact sequences 0→∇(μi)→D(Xi)→D(Xi−1)→0; by induction on i, a finite costandard flag of D(Xi−1) concatenated with the subobject ∇(μi) gives a finite costandard flag of D(Xi), because extensions of objects with finite costandard flags again have finite costandard flags. For i=n this gives a finite costandard flag of I(λ)=D(P(λ)) with the factors ∇(μi), hence (I(λ):∇(μ))=(P(λ):Δ(μ))=[Δ(μ):L(λ)] by [F2].

1.2F1F2F3

Let I∈O be injective. By [F3] it has finite length and I=I1⊕⋯⊕In with each Ij indecomposable. Applying the exact contravariant involution D gives D(I)=⨁jD(Ij) with each D(Ij) an indecomposable projective: D is an equivalence, so it preserves indecomposability and exchanges projectives with injectives. Each D(Ij) is therefore a projective cover of its simple head L(μj) by [F2], hence D(Ij)≅P(μj) by uniqueness of projective covers and Ij≅D(D(Ij))≅D(P(μj))=I(μj).

2.1step 1.1step 1.2∎

By step 1.1 each I(μj) has a finite costandard flag, and a finite direct sum of objects with finite costandard flags again has one, by concatenating flags along the summands; hence every injective object I≅⨁jI(μj) has a finite costandard flag, and the bijection between indecomposable projectives and indecomposable injectives is induced by D.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Dot-Weyl facets and single-wall translation data

Definition

Assume the Axiom of Choice (The Axiom of Choice). Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=h⊕n+, with the chosen positive system Φ+ and Weyl vector ρ of The Weyl vector rho for a chosen positive system and Weyl group W acting by the root reflections sα(λ)=λ−λ(α∨)α of Root reflections and the Weyl group action. Write the dot action as w⋅λ=w(λ+ρ)−ρ and write ⟨ζ,α∨⟩ for the pairing with the coroot (The root set is a reduced crystallographic root system).

Put R=span⁡RΦ⊆h∗. For a weight λ∈R, the dot-Weyl facet of λ is the set of weights Fλ={ζ∈R: sgn⁡⟨ζ+ρ,α∨⟩=sgn⁡⟨λ+ρ,α∨⟩ for every root α∈Φ}, where sgn⁡ takes the values positive, zero and negative. Its upper closure is Fλ+={ζ∈R: ⟨ζ+ρ,α∨⟩ is positive, zero or nonpositive according as ⟨λ+ρ,α∨⟩ is positive, zero or negative, for every α∈Φ+}. The upper-closure test uses only positive roots: imposing it also on their negatives would incorrectly exclude wall points from the upper closure of the antidominant chamber. Thus Fλ⊆Fλ+, the facets refine the closures of the open Weyl chambers, and Fλ depends only on the wall-sign pattern of λ+ρ.

Two special positions are used throughout. A weight λ is dot-regular when ⟨λ+ρ,α∨⟩≠0 for every root α, so that Fλ is an open chamber; it is dot-antidominant when ⟨λ+ρ,α∨⟩≤0 for every positive root α. Integrality of weights is the notion of Integral, dominant, and strictly dominant weights.

A single-wall translation datum is a triple (λ,μ,α) consisting of integral dot-antidominant weights λ,μ and a positive root α such that:

  1. λ is dot-regular, so Fλ is an open chamber;
  2. μ+ρ lies in the closure of the chamber of λ+ρ: one has ⟨μ+ρ,α∨⟩=0, and ⟨μ+ρ,β∨⟩ has the same sign as ⟨λ+ρ,β∨⟩ for every root β different from α and from its multiples;
  3. the dot stabilizer Sμ:={w∈W:w⋅μ=μ} is exactly {1,sα}.

Equivalently, Fμ is a codimension-one facet in the closure of the open antidominant chamber Fλ, with Sμ={1,sα}. This dot stabilizer and the integral-reflection group Wμ of The integral Weyl group of a weight are defined by different conditions: since μ is integral, all simple reflections belong to Wμ, so Wμ=W, whereas Sμ={1,sα}. The groups coincide in rank one and differ when the rank is greater than one. In this datum the translating weight ν is the unique dominant weight of the linear Weyl orbit W(μ−λ); it exists and is unique by Finite Weyl closed chambers and stabilizers, and it is integral because μ−λ is integral and W preserves the weight lattice. The wall reflection is s:=sα.

The basic example is sl2 with the datum (λ,μ)=(−2,−1): here ρ=1, μ=−ρ, λ+ρ=−1 spans the open negative chamber, μ+ρ=0 is the single wall, and the dot-stabilizer of μ is {1,s}. The pair (0,−1) uses the dominant regular representative rather than the antidominant representative required here. It defines the same translation functors: 0 and −2 have the same central character, and both weight differences have dominant representative 1 with translating module L(1), which is self-dual. These functors are defined in the next definition on this page.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Translation functors by tensoring and projection

Definition

Assume the Axiom of Choice (The Axiom of Choice). Work in category O with the conventions of the preceding definitions. For a weight λ write χλ for the generalized central character obtained from λ, so that χλ=χμ if and only if μ∈W⋅λ (Central characters are dot-Weyl orbits), and let O=⨁χOχ be the central-character decomposition of Generalized central-character decomposition of O with inclusions incl⁡χ and exact projections pr⁡χ, so that pr⁡χ∘incl⁡χ=id⁡.

For a finite-dimensional h-semisimple g-module E (Weight and weight space) and two generalized central characters χ,χ′, set Tχ,E,χ′:=pr⁡χ′∘(E⊗−)∘incl⁡χ ⁣:Oχ⟶Oχ′. This is well defined because E⊗− is an exact endofunctor of O (Finite-dimensional tensoring preserves O) and the projections and inclusions are exact.

For weights λ,μ with μ−λ integral (Dot-Weyl facets and single-wall translation data), let ν be the unique dominant weight in the linear Weyl orbit W(μ−λ), which exists and is unique by Finite Weyl closed chambers and stabilizers and is integral; let L(ν) be the finite-dimensional simple module of highest weight ν (Finite-dimensional simple modules are classified by dominant highest weights). Define Tλμ:=Tχλ,L(ν),χμ ⁣:Oχλ⟶Oχμ,Tμλ:=Tχμ,L(ν)∗,χλ ⁣:Oχμ⟶Oχλ, where L(ν)∗ is the ordinary linear dual, a finite-dimensional h-semisimple simple module isomorphic to L(−w0ν) by Highest weight of the dual representation.

The labels λ and μ denote actual weights and not ρ-shifted parameters. The central-character subcategories used here are those of the published decomposition; a central-character summand can contain several linkage blocks of Central-character summands refine into linkage blocks, while for an indecomposable central-character summand the present functors are translation between that summand and its target.

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

Translation functors are exact and biadjoint

Statement

Assume the Axiom of Choice (The Axiom of Choice). For every finite-dimensional h-semisimple g-module E the translation functor Tχ,E,χ′ (Translation functors by tensoring and projection) is exact, and Tχ′,E∗,χ is both a left and a right adjoint of Tχ,E,χ′; in particular both functors send projectives to projectives and injectives to injectives. Consequently, in the setting of Translation functors by tensoring and projection, Tμλ is both a left and a right adjoint of Tλμ, and the two functors are exact.

Facts & Assumptions

Given: The Axiom of Choice, finite-dimensional h-semisimple g-modules E,E∗, generalized central characters χ,χ′, and the translation functors Tχ,E,χ′=pr⁡χ′∘(E⊗−)∘incl⁡χ.

[F1]

The functors incl⁡χ, pr⁡χ′ are exact and pr⁡χ∘incl⁡χ=id⁡; E⊗− and E∗⊗− are exact endofunctors of O; hence Tχ,E,χ′ and Tχ′,E∗,χ are exact (Generalized central-character decomposition of O, Finite-dimensional tensoring preserves O, Translation functors by tensoring and projection).

[F2]

For a g-module M and X∈O the tensor-Hom adjunction gives natural isomorphisms Hom⁡O(E⊗M,X)≅Hom⁡O(M,E∗⊗X) and Hom⁡O(X,E⊗M)≅Hom⁡O(E∗⊗X,M), where E∗ is the linear dual with its standard contragredient action (Finite-dimensional tensoring preserves O, Weight and weight space).

[F3]

For A∈Oχ and X∈O the block decomposition gives natural isomorphisms Hom⁡O(incl⁡χA,X)≅Hom⁡Oχ(A,pr⁡χX) and Hom⁡O(X,incl⁡χA)≅Hom⁡Oχ(pr⁡χX,A) (Generalized central-character decomposition of O).

[F4]

An object P is projective exactly when Hom⁡(P,−) is exact, and I is injective exactly when Hom⁡(−,I) is exact; a left adjoint of an exact functor carries projectives to projectives, and a right adjoint of an exact functor carries injectives to injectives (Projective object, Injective object).

Proof

technique · direct: exactness is composition of exact functors, and the two adjunctions are the tensor-Hom pairing transported through the block inclusion and projection
1.1F1given

Each of Tχ,E,χ′ and Tχ′,E∗,χ is a composite of exact functors by [F1], hence exact.

1.2F1F2F3given

For M∈Oχ and N∈Oχ′ the natural isomorphisms of [F3] and [F2] compose to Hom⁡Oχ′(Tχ,E,χ′M,N)≅Hom⁡O(E⊗incl⁡χM,incl⁡χ′N)≅Hom⁡O(incl⁡χM,E∗⊗incl⁡χ′N)≅Hom⁡Oχ(M,Tχ′,E∗,χN), natural in M and N, so Tχ,E,χ′ is left adjoint to Tχ′,E∗,χ.

1.3F2F3given

Composing the other pair of isomorphisms gives Hom⁡Oχ′(N,Tχ,E,χ′M)≅Hom⁡O(incl⁡χ′N,E⊗incl⁡χM)≅Hom⁡O(E∗⊗incl⁡χ′N,incl⁡χM)≅Hom⁡Oχ(Tχ′,E∗,χN,M), natural in M and N, so Tχ,E,χ′ is also right adjoint to Tχ′,E∗,χ; equivalently Tχ′,E∗,χ is both a left and a right adjoint of Tχ,E,χ′.

2.1F4step 1.1step 1.2step 1.3

By [F4] a left adjoint of the exact functor Tχ′,E∗,χ carries projectives to projectives, so Tχ,E,χ′ preserves projectives; symmetrically Tχ′,E∗,χ preserves projectives as a left adjoint of the exact Tχ,E,χ′. A right adjoint of an exact functor preserves injectives, so each of the two functors preserves injectives.

3.1step 1.1step 1.2step 1.3step 2.1∎

Specializing E=L(ν) and E∗=L(ν)∗ gives that Tμλ is both a left and a right adjoint of Tλμ and that both are exact, which is the stated consequence.

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

Weights of a finite-dimensional simple module lie in the norm ball

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let ν be a dominant integral weight (Integral, dominant, and strictly dominant weights) and let γ be a weight of the finite-dimensional simple module L(ν) (Finite-dimensional simple modules are classified by dominant highest weights). Then, in the W-invariant positive definite form on the real span E of the roots (The roots form a reduced crystallographic Euclidean root system), ∣γ∣≤∣ν∣, with equality if and only if γ lies in the Weyl orbit Wν; moreover every weight in Wν occurs in L(ν) with multiplicity one.

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight ν, and a weight γ of the finite-dimensional simple module L(ν).

[F1]

The module L(ν) is finite-dimensional with highest weight ν, its weights lie in ν−Q+, every weight γ satisfies ν−w−1γ∈Q+ for every w∈W, and the weight wν occurs with multiplicity one for every w (Extremal Weyl-orbit weights, Finite-dimensional simple modules are classified by dominant highest weights, Root order on weights).

[F2]

The form (⋅,⋅) on E is positive definite and W-invariant; a dominant weight ξ satisfies (ξ,αi)=⟨ξ,αi∨⟩(αi,αi)/2≥0 for every simple root αi, sums of dominant weights are dominant, and every W-orbit in E has exactly one dominant point (The roots form a reduced crystallographic Euclidean root system, Finite Weyl closed chambers and stabilizers, Integral, dominant, and strictly dominant weights).

Proof

technique · direct: pass to the dominant conjugate of the weight and compare squared lengths by a dominance computation
1.1F1F2given

The weight γ lies in E because it lies in ν−Q+, and the orbit Wγ has a unique dominant point, so there is u∈W with γ+:=uγ dominant. Applying the extremal-weight bound of [F1] to γ with the element w=u−1 gives ν−uγ=ν−γ+∈Q+.

2.1F1F2step 1.1algebra

Put β=ν−γ+=∑iniαi∈Q+. Dominance gives (γ+,β)≥0, so ∣ν∣2−∣γ+∣2=2(γ+,β)+∣β∣2≥∣β∣2≥0. Since ∣γ∣=∣γ+∣, this proves the norm bound. Equality forces ∣β∣2=0, hence β=0 by positive definiteness and γ+=ν, so γ∈Wν. Conversely W-invariance gives equality for every γ∈Wν.

3.1F1step 2.1∎

The multiplicity-one statement is the last assertion of [F1], and by step 2.1 the equality case is exactly γ∈Wν; this completes the proof of all three claims.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

A dominant vector minimises its distance to a dominant weight

Statement

Assume the Axiom of Choice (The Axiom of Choice). Work in the real span E of the roots with its W-invariant positive definite form, and let ξ and η be weights in E that are dominant, so ⟨ξ,αi∨⟩≥0 and ⟨η,αi∨⟩≥0 for every simple root αi (Integral, dominant, and strictly dominant weights). Then ∣ξ−wη∣≥∣ξ−η∣for every w∈W, and equality holds if and only if wη lies in the set Wξη={vη:v∈Wξ}, where Wξ={v∈W:vξ=ξ} is the stabilizer of ξ. In particular, if ξ is regular, so that Wξ={1}, then equality forces wη=η; if ξ=0 then equality holds for every w.

Facts & Assumptions

Given: The Axiom of Choice, the real span E of the roots with its positive definite W-invariant form, and dominant weights ξ,η∈E.

[F1]

The reflection sα acts on h∗ by sα(λ)=λ−⟨λ,α∨⟩α with ⟨λ,α∨⟩=2(λ,α)/(α,α), it is orthogonal for the form on E, and the simple roots form a basis of E; dominance means nonnegativity on the simple coroots (Root reflections and the Weyl group action, The roots form a reduced crystallographic Euclidean root system, Integral, dominant, and strictly dominant weights).

[F2]

Each simple reflection si permutes Φ+∖{αi} and sends αi to −αi; the simple reflections generate W (Finite Weyl positive roots and simple reflections).

[F3]

Every W-orbit in E contains exactly one point of the closed chamber C‾={x∈E:(x,αi)≥0 for all i} (Finite Weyl closed chambers and stabilizers).

Proof

technique · direct, by chamber descent along simple reflections that decrease the number of negative pairings
1.1F1F2F3given

Since η is dominant, the closed chamber is C‾={x∈E:(x,αi)≥0 for all i}, and for x∈W and a simple root αi with ⟨xη,αi∨⟩<0 we set c=−⟨xη,αi∨⟩>0, so that sixη=xη+cαi. Let d(x)=#{β∈Φ+:⟨xη,β∨⟩<0} be the number of positive roots pairing negatively with xη.

2.1step 1.1F1algebra

For such x and αi one has ∣ξ−sixη∣2−∣ξ−xη∣2=−2c (ξ,αi)≤0, because sixη=xη+cαi and expansion gives −2c(ξ−xη,αi)+c2(αi,αi)=−2c(ξ,αi)−c2(αi,αi)+c2(αi,αi), while (ξ,αi)=⟨ξ,αi∨⟩(αi,αi)/2≥0 by dominance of ξ. Thus a descent step never increases the distance from ξ.

2.2F2step 1.1algebra

If ⟨xη,αi∨⟩<0 then d(six)=d(x)−1. Indeed, for β∈Φ+∖{αi} the orthogonality of si gives ⟨sixη,β∨⟩=⟨xη,siβ∨⟩, and by [F2] the map β↦siβ is a bijection of Φ+∖{αi}; the root αi itself pairs negatively with xη but, by siαi=−αi and ⟨xη,−αi∨⟩>0, not with sixη. Hence the negative positive roots at sixη are in bijection with the negative positive roots at xη other than αi, of which there are d(x)−1.

3.1F1F3step 2.1step 2.2given

Starting from x0=w, iterate: if xjη is not in the closed chamber, choose a simple root αi with ⟨xjη,αi∨⟩<0 and set xj+1=sixj. By step 2.1 the distances ∣ξ−xjη∣ are nonincreasing, and by step 2.2 the integer d(xj) drops by one at each step, so the iteration terminates after at most d(w) steps at an element xm with xmη∈C‾. By [F3] the dominant point of the orbit Wη is unique, so xmη=η. Therefore ∣ξ−η∣=∣ξ−xmη∣≤∣ξ−wη∣ for every w∈W.

4.1F1step 2.1step 3.1algebra

Suppose ∣ξ−wη∣=∣ξ−η∣ and run any descent from w as in step 3.1. The values ∣ξ−xjη∣ are nonincreasing and their first and last terms are equal, so every step is an equality, and step 2.1 with c>0 gives (ξ,αij)=0, equivalently sijξ=ξ, for every reflecting root used. Writing xm=sim⋯si1w and xmη=η, the element v:=si1⋯sim fixes ξ, and wη=(si1⋯sim)η=vη; hence wη∈Wξη.

5.1F1step 3.1step 4.1∎

Conversely, if wη=vη with vξ=ξ, then the W-invariance of the form and the orthogonality of v give ∣ξ−wη∣=∣ξ−vη∣=∣v−1(ξ−vη)∣=∣v−1ξ−η∣=∣ξ−η∣. Together with steps 3.1 and 4.1 this proves the inequality for every w∈W with equality exactly when wη∈Wξη; if ξ is regular then no root reflection fixes ξ, so Wξ={1} and equality forces wη=η.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

The single-wall tensor-weight exclusion lemma

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let (λ,μ,α) be a single-wall translation datum as in Dot-Weyl facets and single-wall translation data, with translating weight ν, wall reflection s=sα, and E=L(ν). Then for all w,w′∈W and every weight γ of E: if w′⋅μ=w⋅λ+γ, then w′⋅μ=w⋅μ and γ=w(μ−λ).

Equivalently, for every w the tensor E⊗Δ(w⋅λ) has exactly one standard factor whose central character is that of μ, namely Δ(w⋅μ), and its multiplicity in the Verma flag computed by Finite-dimensional tensoring preserves Verma flags is one: the multiplicity (E⊗Δ(w⋅λ):Δ(η))=dim⁡Eη−w⋅λ is nonzero, among labels η in the dot orbit of μ, only for η=w⋅μ, where it equals one.

Facts & Assumptions

Given: The Axiom of Choice and a single-wall translation datum (λ,μ,α) with translating weight ν, wall reflection s=sα, and E=L(ν); write λ∙=λ+ρ and μ∙=μ+ρ.

[F1]

The datum gives integral dot-antidominant λ,μ with λ dot-regular, so λ∙ is regular for the linear action and μ∙ is fixed exactly by {1,s}; hence −λ∙ is dominant regular and −μ∙ is dominant, and Stab⁡W(−μ∙)={1,s}. The translating weight ν is the unique dominant weight of the linear orbit W(μ−λ)=W(μ∙−λ∙), and ∣ν∣=∣μ∙−λ∙∣ (Dot-Weyl facets and single-wall translation data, Integral, dominant, and strictly dominant weights, Finite Weyl closed chambers and stabilizers).

[F2]

Every weight γ of L(ν) satisfies ∣γ∣≤∣ν∣, with equality exactly when γ∈Wν, and every weight of Wν occurs in L(ν) with multiplicity one (Weights of a finite-dimensional simple module lie in the norm ball, Finite-dimensional simple modules are classified by dominant highest weights).

[F3]

For dominant ξ,η in the real span of the roots one has ∣ξ−wη∣≥∣ξ−η∣ for every w, with equality exactly when wη∈Stab⁡W(ξ)η (A dominant vector minimises its distance to a dominant weight).

[F4]

Modulo the identification of Δ with M and of weight spaces, the tensor E⊗Δ(λ′) has a finite Verma flag with multiplicities dim⁡Eη−λ′, and dim⁡Eζ=1 for ζ∈Wν (Finite-dimensional tensoring preserves Verma flags, Finite semisimple PBW and highest-weight construction).

[F5]

Two weights have the same central character exactly when they lie in one dot-Weyl orbit (Central characters are dot-Weyl orbits).

Proof

technique · direct: transport the tensor-weight identity into a norm comparison, squeeze it to equality, and read off the surviving factor
1.1F1givenalgebra

Let w,w′∈W and let γ be a weight of E with w′⋅μ=w⋅λ+γ. Since w′⋅μ−[w⋅λ]=w′(μ∙)−w(λ∙), setting x=(w′)−1w gives xλ∙=μ∙−(w′)−1γ, that is, (w′)−1γ=μ∙−xλ∙.

2.1F1F2F3step 1.1

By [F2] one has ∣γ∣≤∣ν∣=∣μ∙−λ∙∣, and W-invariance of the form gives ∣(w′)−1γ∣=∣γ∣, so the identity of step 1.1 yields ∣μ∙−xλ∙∣≤∣μ∙−λ∙∣. On the other hand [F3] applied to the dominant vectors ξ=−μ∙ and η=−λ∙ (dominant and regular by [F1]) gives ∣μ∙−λ∙∣=∣ξ−η∣≤∣ξ−xη∣=∣μ∙−xλ∙∣.

3.1F1F2F3step 1.1step 2.1algebra

The two inequalities of step 2.1 are equalities, so the equality case of [F3] applies: xη∈Stab⁡W(ξ)η with Stab⁡W(ξ)={1,s} by [F1], that is, x(−λ∙)∈{−λ∙,−sλ∙}, so xλ∙∈{λ∙,sλ∙}. Regularity of λ∙ then forces x∈{1,s}: from xλ∙=sλ∙ we get s−1x∈Stab⁡W(λ∙)={1}, and from xλ∙=λ∙ directly x=1. Both 1 and s fix μ∙, hence x⋅μ=μ and w′⋅μ=w⋅(x⋅μ)=w⋅μ. Moreover γ=w′⋅μ−w⋅λ=w⋅μ−w⋅λ=w(μ−λ). Finally ∣γ∣=∣μ∙−λ∙∣=∣ν∣ and γ=w(μ−λ)∈W(μ−λ)=Wν, so by [F2] the weight γ occurs in E with multiplicity one.

4.1F4F5step 3.1algebra

For the reformulation, fix w and let η be a weight in the dot orbit of μ, so η=w′⋅μ for some w′ and η has the central character of μ by [F5]. If dim⁡Eη−w⋅λ≠0, then γ:=η−w⋅λ is a weight of E with w′⋅μ=w⋅λ+γ, so step 3.1 gives η=w′⋅μ=w⋅μ and γ=w(μ−λ); conversely dim⁡Ew(μ−λ)=1. Hence among labels in the dot orbit of μ only Δ(w⋅μ) occurs, with multiplicity one, in the Verma flag of E⊗Δ(w⋅λ) supplied by [F4].

5.1step 3.1step 4.1∎

Steps 3.1 and 4.1 prove both formulations: the tensor-weight identity forces w′⋅μ=w⋅μ and γ=w(μ−λ) with multiplicity one, and the only standard factor of E⊗Δ(w⋅λ) with central character χμ is Δ(w⋅μ), once.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Translation to and from a single wall on standard modules

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let (λ,μ,α) be a single-wall translation datum with translating weight ν, wall reflection s=sα, and E=L(ν), and let Tλμ and Tμλ be the translation functors of Translation functors by tensoring and projection. Then:

  1. TλμΔ(w⋅λ)≅Δ(w⋅μ) for every w∈W;
  2. TμλΔ(w⋅μ) has a finite Verma flag with exactly two factors, Δ(w⋅λ) and Δ(w⋅(s⋅λ))=Δ(ws⋅λ), each occurring with multiplicity one; in particular its class in the Grothendieck group is [Δ(w⋅λ)]+[Δ(ws⋅λ)].

Facts & Assumptions

Given: The Axiom of Choice and a single-wall translation datum (λ,μ,α) with translating weight ν, wall reflection s, and E=L(ν); write λ∙=λ+ρ and μ∙=μ+ρ.

[F1]

The datum gives integral dot-antidominant λ,μ with λ∙ regular and Stab⁡W(μ∙)={1,s}; the functors are Tλμ=pr⁡χμ∘(E⊗−)∘incl⁡χλ and Tμλ=pr⁡χλ∘(E∗⊗−)∘incl⁡χμ with E∗=L(ν)∗=L(−w0ν) finite-dimensional and h-semisimple; central characters satisfy χη=χη′ exactly when η′∈W⋅η (Dot-Weyl facets and single-wall translation data, Translation functors by tensoring and projection, Highest weight of the dual representation, Central characters are dot-Weyl orbits).

[F2]

For every weight λ′ the tensor E⊗Δ(λ′) and E∗⊗Δ(λ′) have finite Verma flags with (E⊗Δ(λ′):Δ(η))=dim⁡Eη−λ′ and (E∗⊗Δ(λ′):Δ(η))=dim⁡Eη−λ′∗=dim⁡Eλ′−η; weights of E=L(ν) satisfy ∣γ∣≤∣ν∣ with equality exactly for γ∈Wν, and every weight of Wν has multiplicity one (Finite-dimensional tensoring preserves Verma flags, Weights of a finite-dimensional simple module lie in the norm ball).

[F3]

For dominant ξ,η in the real span of the roots, ∣ξ−wη∣≥∣ξ−η∣ with equality exactly when wη∈Stab⁡W(ξ)η (A dominant vector minimises its distance to a dominant weight, Integral, dominant, and strictly dominant weights).

[F4]

The central-character projections are exact (Generalized central-character decomposition of O). The center preserves a Verma module’s one-dimensional highest line and commutes with its cyclic generator action, so it acts by the highest weight central character on the whole Verma module. Thus applying pr⁡χ to a Verma flag keeps exactly its factors with character χ and sends the other factors to zero. Deleting repetitions gives a Verma flag of the projection. A one-factor flag identifies its object with that Verma module (Finite Verma flags and their multiplicities).

[F5]

If (λ,μ,α) is a single-wall datum with translating weight ν and E=L(ν), then w′⋅μ=w⋅λ+γ for a weight γ of E implies w′⋅μ=w⋅μ and γ=w(μ−λ), so among labels of central character χμ only Δ(w⋅μ) occurs in the flag of E⊗Δ(w⋅λ), once (The single-wall tensor-weight exclusion lemma).

[F6]

The functors Tλμ, Tμλ are exact (Translation functors are exact and biadjoint).

Proof

technique · direct: compute the Verma flags of the two tensors, keep the factors with the target central character, and read off the surviving factors
1.1F1F2F5algebra

Claim (1). Let η=w′⋅μ be a label in the dot orbit of μ with dim⁡Eη−w⋅λ≠0, and put γ:=η−w⋅λ; then w′⋅μ=w⋅λ+γ and γ is a weight of E, so [F5] gives η=w′⋅μ=w⋅μ and γ=w(μ−λ), which occurs in E with multiplicity one. Hence in the flag of E⊗Δ(w⋅λ) supplied by [F2], the only label of central character χμ (equivalently, the only label in the dot orbit of μ, by [F1]) is η=w⋅μ, with multiplicity one.

1.2F1F2F3algebra

Claim (2). Let η=w′⋅λ be a label in the dot orbit of λ with dim⁡Eη−w⋅μ∗≠0, and set γ:=w⋅μ−η; by [F2] the weight γ is a weight of E and ∣γ∣≤∣ν∣. Since w′⋅λ=w′(λ∙)−ρ and w⋅μ=w(μ∙)−ρ, setting x=(w′)−1w gives (w′)−1(−γ)=λ∙−xμ∙, so ∣λ∙−xμ∙∣=∣γ∣. By [F2] ∣ν∣=∣μ∙−λ∙∣, while [F3] applied to the dominant weights ξ=−λ∙ and η′=−μ∙ gives ∣μ∙−λ∙∣≤∣λ∙−xμ∙∣. Hence equality holds throughout, and the equality case of [F3] gives xη′∈Stab⁡W(ξ)η′, and regularity of λ∙ makes Stab⁡W(ξ)={1}. Consequently xμ∙=μ∙, and the datum Stab⁡W(μ∙)={1,s} forces x∈{1,s}. Therefore η=w′⋅λ=wx−1⋅λ equals w⋅λ or ws⋅λ, and in both cases (w′)−1(−γ)=λ∙−μ∙ (using sμ∙=μ∙ when x=s), so −γ=w′(λ∙−μ∙) and γ=w′(μ−λ) lies in W(μ−λ)=Wν; by [F2] it occurs in E with multiplicity one. Conversely, taking w′=w or w′=ws gives γ=w′(μ−λ)∈Wν, so both proposed factors occur once; their labels are distinct because λ∙ is regular.

2.1F4step 1.1

For claim (1), the object TλμΔ(w⋅λ)=pr⁡χμ(E⊗Δ(w⋅λ)) is Verma-filtered by [F4], and by step 1.1 its only nonzero multiplicity is (TλμΔ(w⋅λ):Δ(w⋅μ))=1; by [F4] it is therefore isomorphic to Δ(w⋅μ).

2.2F4step 1.2

For claim (2), the object TμλΔ(w⋅μ)=pr⁡χλ(E∗⊗Δ(w⋅μ)) is Verma-filtered by [F4]; by step 1.2 its nonzero multiplicities among labels of central character χλ are exactly one at Δ(w⋅λ) and one at Δ(ws⋅λ), and all other multiplicity vanish because their labels have different central character. Hence it has a finite Verma flag with exactly these two factors, each once, and its class in the Grothendieck group is [Δ(w⋅λ)]+[Δ(ws⋅λ)].

3.1F6step 2.1step 2.2∎

Steps 2.1 and 2.2 prove the two claims of the statement; with [F6] recording that the two translation functors are exact, the theorem follows.

5 · Examples, counterexamples and false statements

None yet.

Sources