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.

Jordan-Holder factors of Verma modules dominate the head (BGG 8.12)

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ∈Λ+ and w∈W. If a simple module L(μ) occurs in a composition series of M(w∘λ), then μ=u∘λ for some u≥w in Bruhat order; moreover L(w∘λ) occurs exactly once. Consequently every composition factor of M(w∘λ) has length at least ℓ(w).

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, an element w∈W, and the Verma module M(w∘λ).

[F1]

If [M(η):L(μ)]≠0, then μ↑η in the strong linkage order (The strong linkage principle for Verma modules, The strong linkage order on weights) and the central characters agree, χμ=χη (A Verma composition factor has the same central character); central characters of highest weight modules agree exactly on dot-Weyl orbits, χμ=χη if and only if μ=u∘η for some u∈W (Central characters are dot-Weyl orbits).

[F2]

μ↑η means that there are weights η=η0≻η1≻⋯≻ηr=μ and positive roots αj with ηj=sαj∘ηj−1 and ⟨ηj−1+ρ,αj∨⟩∈Z>0; equivalently, by The BGG criterion for homomorphisms between Verma modules, each consecutive pair is joined by a nonzero (hence injective) homomorphism M(ηj)→M(ηj−1) (The strong linkage order on weights).

[F3]

Strong exchange deletes one letter from a reduced expression for v to represent tv when t is a root reflection and ℓ(tv)<ℓ(v); deletion of pairs of letters reduces any nonreduced expression to a reduced one (Finite Weyl strong exchange and deletion). The reduced-subword criterion then gives tv<v (Bruhat order on a finite Weyl group). Thus every increasing reflection chain, even with length jumps greater than one, witnesses Bruhat comparison.

[F4]

For a dominant integral weight η and a positive root β one has ⟨η+ρ,β∨⟩∈Z>0, and η+ρ is regular (Positive coroot pairings of a dominant integral weight).

[F5]

L(w∘λ) is the unique simple quotient (head) of M(w∘λ) (A Verma module has a unique simple quotient); the simple objects of O are exactly the L(μ), and L(μ)≅L(μ′) forces μ=μ′ (The simple objects of O); objects of O have finite length (Every object of O has finite length).

[F6]

The weight space M(η)η is one dimensional, spanned by the highest weight vector vη, and vη generates M(η); the sum of all proper submodules of M(η) is the unique maximal submodule and does not contain vη (A Verma module has a unique simple quotient).

Proof

1.1F1algebra

Let L(μ) be a composition factor of M(w∘λ). By [F1] μ↑(w∘λ) and χμ=χw∘λ; by the orbit description of central characters, μ=u∘(w∘λ) for some u∈W. Since u∘(w∘λ)=u(w(λ+ρ))−ρ=(uw)∘λ, we may write μ=u′∘λ with u′=uw∈W.

1.2F5F6algebra

For the multiplicity of the head, write J for the sum of all proper submodules of M(w∘λ), the unique maximal submodule, so M/J≅L(w∘λ) is simple by [F5]. The highest weight vector v of M(w∘λ) spans the one-dimensional weight space M(w∘λ)w∘λ and generates the module, so v∉J and hence Jw∘λ=0. Refine the filtration 0⊂J⊂M(w∘λ) to a composition series; its top factor is M/J≅L(w∘λ), and any further factor isomorphic to L(w∘λ) would be a subquotient X/Y of J with (X/Y)w∘λ≠0, hence would force Xw∘λ≠0 and so Jw∘λ≠0, a contradiction. Therefore [M(w∘λ):L(w∘λ)]=1.

2.1F2F3F4step 1.1algebra

Use the witnessing linkage chain of [F2]: w∘λ=η0≻η1≻⋯≻ηr=μ with ηj=sαj∘ηj−1 and positive integral pairings. By step 1.1 and induction each ηj lies in W∘λ; write ηj=vj∘λ. Then vj∘λ=sαj∘(vj−1∘λ)=(sαjvj−1)∘λ, so vj=sαjvj−1, with v0=w and vr=u′. Moreover ηj−1+ρ=vj−1(λ+ρ), so the pairing condition reads ⟨λ+ρ,vj−1−1αj∨⟩=⟨vj−1(λ+ρ),αj∨⟩∈Z>0. If vj−1−1αj were a negative root −β with β>0, then ⟨λ+ρ,(−β)∨⟩=−⟨λ+ρ,β∨⟩<0 by [F4], contradiction; hence vj−1−1αj>0 and the length criterion of Finite Weyl strong exchange and deletion gives ℓ(sαjvj−1)>ℓ(vj−1).

3.1F3step 2.1

Thus w=v0,…,vr=u′ is an increasing reflection chain, so w≤u′ in Bruhat order by [F3] and ℓ(u′)≥ℓ(w). This proves the domination and length assertions.

4.1step 3.1step 1.2∎

Combining steps: every composition factor of M(w∘λ) is L(u∘λ) with u≥w in Bruhat order, ℓ(u)≥ℓ(w), and the factor L(w∘λ) occurs exactly once.

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