Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Used by

Dependency tree · two levels

23 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources