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 be a finite-dimensional -semisimple -module with weight multiplicities (Weight and weight space). For every weight , the object has a finite Verma flag (Finite Verma flags and their multiplicities) whose factors are , the factor occurring times; the factors can be ordered so that a real-linear height with is nonincreasing.
Consequently, if has a finite Verma flag with multiplicities , then has a finite Verma flag and
Facts & Assumptions
Given: The Axiom of Choice, a finite-dimensional -semisimple -module with weight spaces , and weights .
and ; a finite Verma flag has finite length, factors , and the multiplicities count the factors appearing, additively along a top step (Verma modules, Finite Verma flags and their multiplicities).
PBW gives a right -module isomorphism , so is free as a right -module and induction is exact (Finite semisimple PBW and highest-weight construction).
The weight set of is finite, preserves each , and a positive-root vector sends into (Weight and weight space). Fix a real-linear functional on the underlying real vector space of with for all simple roots. It exists by their linear independence and is strictly positive on .
The functor with diagonal action is exact and maps into itself (Finite-dimensional tensoring preserves O).
Proof
For any -module , define by , using the diagonal action. For , the identity proves balancing, and the definition is -linear. Under [F2]'s PBW identifications both sides are filtered by the degree in . 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 . 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.
Enumerate the weights of in nonincreasing -order and choose a basis in each weight space. The initial spans in are -submodules: Cartan acts by scalars on each weight, and positive-root operators raise , landing in already included spaces. Their successive quotients are , once for each basis vector of . Exact induction in [F2], followed by the tensor identity of step 1.1, gives a Verma flag of with factors of multiplicity , in nonincreasing -order.
For a Verma-filtered induce on the flag length. For both sides vanish. For the top step of a flag, exactness of by [F4] gives an exact sequence ; by step 2.1 and the induction hypothesis has a finite Verma flag with multiplicities , and adjoining the flag of with multiplicities gives a finite Verma flag of . Since multiplicity is additive along the resulting top step and by [F1], the formula follows.
Steps 2.1 and 3.1 prove the single-Verma statement and the consequence for a general Verma-filtered , 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
- Lin Chen, lecture notes (Spring 2024), Lecture 9, Lemma 3.5 and Construction 3.1 (standard reference, not scraped)
- Dennis Gaitsgory, Geometric Representation Theory (Fall 2005), Lemma 4.24 and its proof (standard reference, not scraped)
- Pavel Etingof, Representations of Lie Groups (18.757, Fall 2023), Cor. 20.5(i) and Sec. 20.2 (standard reference, not scraped)