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.

Bruhat covers give canonical Verma embeddings, and composites are inclusions

Statement

Let λ∈Λ+. For every arrow x→y of the Bruhat graph (a cover x⊳y) the inclusion ιx→y ⁣:M(x∘λ)↪M(y∘λ) of Dominant integral dot translates embed canonically in the Verma module is the unique-up-to-scalar nonzero g-homomorphism between these two Verma modules, and it is injective with image a proper submodule. If x⊳m⊳y and x⊳m′⊳y are two saturated paths, then the composites ιm→y∘ιx→m and ιm′→y∘ιx→m′ are equal as maps M(x∘λ)→M(y∘λ): both are the inclusion of the canonical submodule M(x∘λ)⊆M(y∘λ)⊆M(λ). In particular the system of inclusions is path-independent, and ιy→z∘ιx→y=ιx→z whenever x⊳y⊳z and x>z (length gap two).

Facts & Assumptions

Given: A dominant integral weight λ∈Λ+ and arrows x→y of the Bruhat graph, i.e. covers x⊳y with ℓ(x)=ℓ(y)+1.

[F1]

For u≥v in Bruhat order the unique singular-vector submodules Su≅M(u∘λ) and Sv≅M(v∘λ) of M(λ) satisfy Su⊆Sv. A nonzero homomorphism between these Verma modules exists and is unique up to scalar (Dominant integral dot translates embed canonically in the Verma module).

[F2]

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).

[F3]

The arrows of the Bruhat graph are the covers, and for λ∈Λ+ the weights w∘λ are pairwise distinct (The Bruhat graph and the BGG Verma sum in degree k).

Proof

1.1F1F2F3construct

For every w∈W, fix an embedding jw ⁣:M(w∘λ)↪M(λ) with image Sw, taking je to be the identity. There are only finitely many choices. For every comparable pair u≥v, define ιu→v=jv−1∘ju, where jv−1 is the inverse from Sv to M(v∘λ); [F1] gives Su⊆Sv, so this is well-defined and jvιu→v=ju. These are precisely the literal submodule inclusions transported to the abstract Verma copies. For a cover x⊳y, the map is nonzero and injective and spans the one-dimensional Hom space by [F2]. Its image is proper: otherwise the two Verma modules would have the same highest weight, contradicting x∘λ≠y∘λ by [F3].

2.1step 1.1algebra

For x⊳m⊳y, the defining equations give jyιm→yιx→m=jmιx→m=jx=jyιx→y. Since jy is injective, ιm→yιx→m=ιx→y. The same argument for m′ shows that the two diamond composites are equal as maps, rather than merely proportional.

3.1step 1.1step 2.1algebra∎

More generally, for x≥y≥z one has jzιy→zιx→y=jyιx→y=jx=jzιx→z, so injectivity of jz proves ιy→zιx→y=ιx→z. Iterating this equality gives path independence, including the claimed length-gap-two case. The normalization depends on the chosen jw on abstract copies; the submodules Sw and their literal inclusions are canonical. Arbitrarily rescaled cover maps need not have equal diamond composites.

Depends on

Used by

Dependency tree · two levels

25 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