Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 filtrations by highest-weight quotients

Statement

Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=hn+. Write Q+=iZ0αi, μλ when λμQ+, and wλ=w(λ+ρ)ρ.

Every MO is a quotient of a module with a finite Verma flag. Consequently it has a finite filtration whose nonzero factors are quotients of Verma modules, and is finitely generated over U(n). The empty filtration is allowed for zero. No truncation hypothesis is needed, and a Verma flag of M itself is not asserted.

Facts & Assumptions

Given: The setting above and the hypotheses in the statement.

[F1]

Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=hn+. Write Q+=iZ0αi, μλ when λμQ+, and wλ=w(λ+ρ)ρ. Every MO has a finite-dimensional, b-stable, h-semisimple generating subspace E. There is a flag 0=E0E1Er=E of b-submodules whose quotients are one dimensional and annihilated by n+. For M=0 take E=0 and the empty flag. (Finite Borel-stable generators and weight flags)

[F2]

Let x1,,xr be an ordered basis of a finite-dimensional complex Lie algebra g. Then the monomials x1a1x2a2xrar(aiN0) form a basis of U(g). In particular, multiplication identifies grU(g) with the symmetric algebra S(g) on the symbols of the xi. (PBW gives an ordered monomial basis for the enveloping algebra)

[F3]

For a g-module V, sending a homomorphism T:M(λ)V to T(vλ) is a bijection onto the vectors vV of weight λ annihilated by n+. Here M(λ) is def-verma-module. The nonzero vectors in this target are precisely the highest-weight vectors of weight λ from def-highest-weight-vector-and-cyclic-highest-weight-module; the zero vector corresponds to the zero homomorphism. (The universal property of Verma modules)

[F4]

Fix a finite-dimensional complex semisimple Lie algebra g, a Cartan subalgebra h, and a positive Borel b=hn+. Write Q+=iZ0αi, μλ when λμQ+, and wλ=w(λ+ρ)ρ. The category O is closed under submodules, quotients and finite direct sums and is an abelian category. If 0AEB0 is exact, A,BO, and E is h-semisimple, then EO. The middle-term weight hypothesis is essential. (Category O is abelian and extension closed among weight modules)

Proof

1.1

Choose the finite b-stable generating subspace E and its one-dimensional weight flag. PBW, with negative roots ordered first, makes U(g) free as a right U(b)-module. Tensoring with this right free module preserves injections and surjections, since it is a direct sum of copies of the input vector spaces.

F1F2
2.1

Inducing the flag therefore gives a filtration of P=U(g)U(b)E with factors M(λi). The map ueue is well defined and surjective onto M. Images of the flag give a filtration of M whose factors are quotients of the corresponding Vermas; delete repeated images to retain only nonzero factors. These are subquotients in the abelian category.

F3F4constructstep 1.1
3.1

PBW also identifies P with U(n)E as a left U(n)-module. A basis of E is a finite generating set for this free module, and its image generates M over U(n). For M=0, choose E=P=0 and no factors.

F2algebrastep 2.1

Depends on

Used by

Dependency tree · two levels

13 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