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.

Nonzero highest-weight images survive modulo n-minus (BGG 10.6b)

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ∈Λ+, let w0∈W, and let M∈O be an object all of whose composition factors are of the form L(u∘λ) with ℓ(u)≥ℓ(w0). If φ ⁣:M(w0∘λ)→M is a g-homomorphism with φ(v)≠0, where v is a highest weight vector of M(w0∘λ), then φ(v)∉n−M; equivalently the class of φ(v) in M/n−M is nonzero.

Facts & Assumptions

Given: The Axiom of Choice, λ∈Λ+, an element w0∈W (fixed throughout and not necessarily the longest element), a nonzero M∈O whose composition factors are L(u∘λ) with ℓ(u)≥ℓ(w0), and a homomorphism φ ⁣:M(w0∘λ)→M with φ(v)≠0 for a highest weight vector v of M(w0∘λ).

[F1]

O has finite length, composition factors are additive in exact sequences, and the simple objects are the L(μ) with L(μ)≅L(μ′) only for μ=μ′ (Every object of O has finite length, Composition series and composition factors of an object, The simple objects of O).

[F2]

The weight set of an object of O lies in a finite union of cones; every nonzero object has a weight vector killed by n+ (a highest weight vector for a maximal weight), which generates a highest weight module with head L(μ) (The support description of category O with finite generation, A Verma module has a unique simple quotient, A proper Verma submodule misses the highest-weight line).

[F3]

If L(μ) occurs in a composition series of M(w′∘λ) then μ=u∘λ for some u≥w′ in Bruhat order, so ℓ(u)≥ℓ(w′); in particular the factors of M(μ) are dominated by μ, and distinct dot translates of λ have distinct weights (Jordan-Holder factors of Verma modules dominate the head (BGG 8.12), Positive coroot pairings of a dominant integral weight).

[F4]

For M∈O the coinvariants are computed weight by weight as (n−M)μ=∑α∈Φ+fαMμ+α (The support description of category O with finite generation, The classical BGG category O).

Proof

1.1F2F1algebra

Choose a weight μ of M which is maximal in the weight poset, and a nonzero u∈Mμ. Then n+u=0: otherwise some uα:=eαu≠0 of weight μ+α would be a weight of M above μ, contradicting maximality. Hence N:=U(g)u⊆M is a highest weight module with head L(μ) by [F2], so L(μ)∈JH⁡(N)⊆JH⁡(M) and in particular the hypothesis of the statement forces μ=v∘λ with ℓ(v)≥ℓ(w0).

2.1F1F2F3step 1.1base

Case 1: φ(v)∈N. Then U(g)φ(v)⊆N is a highest weight module with highest weight w0∘λ, so its head is L(w0∘λ) and L(w0∘λ)∈JH⁡(N)⊆JH⁡(M(μ)) because N is a quotient of M(μ). By [F3] the factors of M(v∘λ)=M(μ) are L(u′∘λ) with u′≥v. Hence w0≥v in Bruhat order. Since this gives ℓ(v)≤ℓ(w0) and ℓ(v)≥ℓ(w0), we get ℓ(v)=ℓ(w0) and therefore v=w0; so μ=w0∘λ.

2.2F1step 1.1ih

Case 2: φ(v)∉N. Let π ⁣:M→M/N. Then πφ(v)≠0, and M/N again has all composition factors of the form L(u∘λ) with ℓ(u)≥ℓ(w0), because JH⁡(M/N)⊆JH⁡(M) by additivity [F1]; moreover JH⁡(M)=JH⁡(N)⊔JH⁡(M/N) with JH⁡(N)≠∅ since N≠0 has finite length, so M/N has strictly fewer composition factors. By induction on the number of composition factors (the base case being Case 1, which needs no induction hypothesis) we may assume πφ(v)∉n−(M/N). Since π(n−M)=n−(M/N), this implies φ(v)∉n−M.

3.1F4step 2.1

In Case 1, φ(v) lies in the μ-weight space Mμ with μ=w0∘λ maximal among the weights of M; hence Mμ+α=0 for every α∈Φ+, and by [F4] the weight-μ part of n−M is ∑αfαMμ+α=0. As φ(v) has weight μ by h-equivariance, φ(v)∉n−M.

4.1F1step 3.1step 2.2discharge-induction: induction on the number of composition factors∎

Every M of finite length falls into Case 1 or Case 2, and in Case 2 the reduction terminates; hence in all cases φ(v)∉n−M, as claimed.

Depends on

Used by

Dependency tree · two levels

42 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