Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Dominant integral dot translates embed canonically in the Verma module

Statement

Let λ∈Λ+ and w,w′∈W. Then w∘λ↑λ in the strong linkage order, so M(w∘λ) embeds in M(λ); the image is the submodule generated by the (unique up to scalar) singular vector of weight w∘λ in M(λ). If w≥w′ in Bruhat order, then M(w∘λ)⊆M(w′∘λ)⊆M(λ), and the inclusion is the unique-up-to-scalar nonzero element of Hom⁡g(M(w∘λ),M(w′∘λ))≅C.

Facts & Assumptions

Given: A dominant integral weight λ∈Λ+ and elements w,w′∈W; the dot action w∘λ=w(λ+ρ)−ρ.

[F1]

If α∈Φ+ and ⟨η+ρ,α∨⟩∈Z>0, then there is an embedding M(sα∘η)↪M(η) (Verma embedding for an arbitrary positive root).

[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; the empty chain gives η↑η. This is the definition in The strong linkage order on weights.

[F3]

Every nonzero homomorphism between Verma modules is injective, and dim⁡Hom⁡g(M(μ),M(η))≤1 for all weights μ,η (A nonzero homomorphism between Verma modules is injective, Homomorphism spaces between Verma modules have dimension at most one).

[F4]

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

[F5]

For a positive root β∈Φ+ and its reflection sβ: ℓ(sβu)<ℓ(u) if and only if u−1β<0 (Finite Weyl strong exchange and deletion).

[F6]

A Bruhat relation w≥w′ is witnessed by a saturated reflection chain w=v0,…,vr=w′ with αj∈Φ+, vj=sαjvj−1 and ℓ(vj)=ℓ(vj−1)−1, choosing each αj∈Φ+ since s−αj=sαj (Bruhat order on a finite Weyl group).

[F7]

A homomorphism M(η)→V is determined by the image of the highest weight vector, which must be a vector of weight η killed by n+; such nonzero vectors are exactly the singular vectors of weight η (The universal property of Verma modules).

Proof

1.1F2F4F5induction

We prove by induction on ℓ(w) that w∘λ↑λ and that M(w∘λ) embeds in M(λ) with image generated by a singular vector of weight w∘λ. For w=1 the chain is empty and the identity embeds M(λ) in itself. If w≠1, choose a reduced word w=siu with ℓ(w)=ℓ(u)+1; then w∘λ=si∘(u∘λ) and u∘λ↑λ by induction. Since ℓ(siu)=ℓ(u)+1, step [F5] gives u−1αi>0; hence ⟨u∘λ+ρ,αi∨⟩=⟨u(λ+ρ),αi∨⟩=⟨λ+ρ,u−1αi∨⟩∈Z>0 by [F4]. So [F2] provides the one-step chain u∘λ≻si∘(u∘λ)=w∘λ, which concatenated with the inductive chain gives w∘λ↑λ, and [F1] gives an embedding M(w∘λ)↪M(u∘λ) that we compose with M(u∘λ)↪M(λ).

1.2F1F3F5F6algebra

Now let w≥w′. By [F6] fix a saturated chain w=v0,…,vr=w′ with vj=sαjvj−1 and ℓ(vj)=ℓ(vj−1)−1. At each step the pairing ⟨vj∘λ+ρ,αj∨⟩=⟨λ+ρ,vj−1αj∨⟩ is a positive integer: vj−1αj=(sαjvj−1)−1αj=vj−1−1sαjαj=−vj−1−1αj, and ℓ(sαjvj−1)=ℓ(vj−1)−1 gives vj−1−1αj<0 by [F5], so vj−1αj>0. Hence [F1] gives embeddings M(vj−1∘λ)↪M(vj∘λ) for all j, whose composite embeds M(w∘λ) in M(w′∘λ); the pair (w,w′) is nonzero in Hom⁡, which is one dimensional by [F3].

2.1F3F7step 1.1

By the embeddings constructed in step 1.1, Hom⁡g(M(w∘λ),M(λ))≠0, of dimension exactly 1 by [F3]; its image is the submodule generated by the image of the highest weight vector, which by [F7] is the unique-up-to-scalar singular vector of weight w∘λ in M(λ). This proves the first two assertions.

3.1F3step 1.1step 2.1step 1.2algebra∎

Both the composite M(w∘λ)↪M(w′∘λ)↪M(λ) and the embedding of step 2.1 are nonzero elements of the one-dimensional space Hom⁡g(M(w∘λ),M(λ)); rescaling the chosen embedding M(w∘λ)↪M(w′∘λ) by the reciprocal scalar makes the composite equal to the canonical embedding, so after this normalisation the image of M(w∘λ) lies inside the image of M(w′∘λ) inside M(λ), i.e. M(w∘λ)⊆M(w′∘λ)⊆M(λ) for the canonical singular-vector submodules. The stated uniqueness is exactly the one-dimensionality of [F3].

Depends on

Used by

Dependency tree · two levels

30 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