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.

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.

Depends on

Used by

Dependency tree · two levels

15 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