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.

Induced modules from finite-dimensional B-modules have type their weights

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let N be a finite-dimensional b-module which is h-semisimple, with weight multiset Wt⁡N. Then the induced module U(g)⊗U(b)N is Verma-filtered with Typ⁡(U(g)⊗U(b)N)=Wt⁡N.

Facts & Assumptions

Given: The Axiom of Choice, a finite-dimensional h-semisimple b-module N with weight multiset Wt⁡N.

[F1]

Lie's theorem: a finite-dimensional representation of the solvable Lie algebra b has a b-stable flag 0=N0⊂N1⊂⋯⊂Nn=N with one-dimensional quotients; because h acts semisimply these can be chosen compatibly with the weight decomposition, and since [b,b]=n+ acts by zero on a one-dimensional module, each quotient is the Borel module Cμj of The one-dimensional Borel module of weight lambda for a weight μj of N (Finite Lie triangularization and rank-one complete reducibility, The one-dimensional Borel module of weight lambda).

[F2]

U(g) is free as a right U(b)-module: the PBW monomials with negative-root factors before the Borel factors form a U(b)-basis (PBW gives an ordered monomial basis for the enveloping algebra). Hence U(g)⊗U(b)(−) is an exact functor.

[F3]

U(g)⊗U(b)Cμ≅M(μ) is the Verma module, and the isomorphisms are compatible with the universal property of Verma modules (The universal property of Verma modules, Type of a module with a Verma filtration).

Proof

1.1F1F2algebra

Apply the exact functor U(g)⊗U(b)(−) of [F2] to the flag of [F1]. The images U(g)⊗U(b)Nj form an increasing filtration of U(g)⊗U(b)N, and exactness identifies the successive quotients: U(g)⊗U(b)Nj/U(g)⊗U(b)Nj−1≅U(g)⊗U(b)(Nj/Nj−1).

2.1F1F3step 1.1∎

By [F1] and [F3] each quotient is U(g)⊗U(b)Cμj≅M(μj), and as j runs from 1 to n the weights μj run through Wt⁡N with multiplicity. Therefore the displayed filtration is a Verma filtration of U(g)⊗U(b)N with type Wt⁡N.

Depends on

Used by

Dependency tree · two levels

21 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