Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

The BGG differential from signed Verma maps

Definition

Assume the Axiom of Choice (The Axiom of Choice). Fix λ∈Λ+ and a compatible sign function ε, i.e. a function from the arrows x→y of the Bruhat graph to {±1} whose product over the four edges of every square is −1 (Compatible signs exist on the Bruhat graph). Write ε(w,w′) for the value of ε on the arrow w→w′ whenever w⊳w′ are elements of W, and let ιw→w′ ⁣:M(w∘λ)↪M(w′∘λ) be the canonical cover embedding of Bruhat covers give canonical Verma embeddings, and composites are inclusions.

For k≥1 define a g-homomorphism

dk ⁣:Ck(λ)→Ck−1(λ)

out of the degree-k Verma sum Ck(λ)=⨁ℓ(w)=kM(w∘λ) of The Bruhat graph and the BGG Verma sum in degree k by requiring that its component

(dk)w,w′ ⁣:M(w∘λ)→M(w′∘λ)

from the summand indexed by w (with ℓ(w)=k) into the summand indexed by w′ (with ℓ(w′)=k−1) is

(dk)w,w′={ε(w,w′) ιw→w′,w⊳w′,0,w⋫w′,

and that all components between pairs of summands with ℓ(w)≠k or ℓ(w′)≠k−1 are zero. Since a finite direct sum in an abelian category is a biproduct, a family of morphisms between finitely many summands and vanishing outside the (w,w′) pairs just described determines a unique g-homomorphism Ck(λ)→Ck−1(λ); each Ck(λ) lies in O and Ck(λ)=0 for k>∣Φ+∣, so dk=0 for k>∣Φ+∣+1 as a map out of the zero object. The map dk is a morphism of degree −1 for the grading by k of the graded object C∙(λ) (Chain complex in an abelian category).

Set d0=π ⁣:C0(λ)=M(λ)↠L(λ), the canonical surjection of A Verma module has a unique simple quotient, and set dk=0 for k<0. The maps dk are the differentials of the BGG complex. For another compatible signing ε′, Compatible signs exist on the Bruhat graph supplies vertex signs c(w) with c(e)=1 and ε′(w,w′)/ε(w,w′)=c(w)/c(w′). The automorphism Tk that multiplies the summand indexed by w by c(w) satisfies Tk−1dk=dk′Tk: the two component coefficients agree because c(w)2=c(w′)2=1. Also T0 is the identity, so this intertwines the augmentations. Hence the resulting complexes are isomorphic. Whether dk−1∘dk=0 depends only on the square condition on ε and is proved in The BGG differential squares to zero.

Depends on

Used by

Dependency tree · two levels

26 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