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.

The augmentation kernel is the sum of the simple-reflection Verma submodules

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ∈Λ+ and let d1 ⁣:⨁iM(si∘λ)→M(λ) be the first BGG differential of The BGG differential from signed Verma maps, indexed by the simple reflections si. Then im⁡d1=∑iM(si∘λ)=ker⁡π, where π ⁣:M(λ)↠L(λ) is the canonical surjection and M(si∘λ)⊆M(λ) is the canonical submodule generated by the singular vector fi⟨λ,αi∨⟩+1vλ of The simple-root singular vector in a Verma module. Consequently the augmented complex is exact at C0 and L(λ)=coker⁡(d1).

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, the Verma module M(λ) with highest weight vector vλ, its canonical simple quotient π ⁣:M(λ)↠L(λ), and the first BGG differential d1=⨁i(d1)si,e.

[F1]

The elements of W of length 1 are exactly the simple reflections si, and the arrows into the identity are the covers si⊳e with label αi; for every i the component (d1)si,e=ε(si,e) ιsi→e with ε(si,e)=±1 is a nonzero scalar multiple of the canonical injective embedding ιsi→e ⁣:M(si∘λ)↪M(λ), and all other components vanish (The BGG differential from signed Verma maps, Bruhat covers give canonical Verma embeddings, and composites are inclusions, Finite Weyl positive roots and simple reflections, The Bruhat graph and the BGG Verma sum in degree k).

[F2]

M(si∘λ) is the g-submodule of M(λ) generated by the singular vector fimi+1vλ, where mi=⟨λ,αi∨⟩≥0; this vector has weight si∘λ≠λ, and every weight of M(si∘λ) is ≤si∘λ in the root order, so λ is not a weight of M(si∘λ) (Dominant integral dot translates embed canonically in the Verma module, The simple-root singular vector in a Verma module, Highest weight modules lie below the top weight).

[F3]

M(λ)=U(g)/K as a left U(g)-module, where K is the left ideal generated by n+ and by {H−λ(H):H∈h}, with vλ=1+K; equivalently M(λ)=U(g)⊗U(b)Cλ with the induced universal property (Verma modules, The universal property of Verma modules, The PBW model of a Verma module).

[F4]

The cyclic module Mint(λ)=U(g)/Iλ of Dominant cyclic highest-weight presentation is generated by vλ=1+Iλ with n+vλ=0, Hvλ=λ(H)vλ, fimi+1vλ=0, and it is finite-dimensional (Simple-root integrability bounds the dominant cyclic module).

[F5]

The sum J(λ) of all proper submodules of M(λ) is the unique maximal submodule and ker⁡π=J(λ); L(λ)=M(λ)/J(λ) is simple, and L(λ) is the unique simple quotient of M(λ) (A Verma module has a unique simple quotient, The sum of all proper Verma submodules is proper, A proper Verma submodule misses the highest-weight line).

[F6]

Finite-dimensional g-modules are completely reducible, and the finite-dimensional simple g-modules are exactly the L(μ) for μ∈Λ+, with L(μ)≅L(μ′) only for μ=μ′; every weight of L(μ) is ≤μ (Every finite-dimensional module is a direct sum of highest-weight modules, Finite-dimensional simple modules are classified by dominant highest weights, Highest weight modules lie below the top weight).

[F7]

For every simple root αi, ⟨λ+ρ,αi∨⟩=⟨λ,αi∨⟩+1≥1, and si∘λ=λ−⟨λ+ρ,αi∨⟩αi≠λ (Positive coroot pairings of a dominant integral weight, The Weyl vector rho for a chosen positive system).

Proof

1.1F1

The image of d1 is the sum of the images of its components. By [F1] the only nonzero components are the (si,e)-components, each of which is a nonzero scalar multiple of the injective embedding ιsi→e; hence the image of the i-th summand is exactly M(si∘λ)⊆M(λ), and im⁡d1=∑iM(si∘λ).

1.2F2F5F7

Each M(si∘λ) is a proper submodule: si∘λ≠λ by [F7], and a submodule of M(λ) containing vλ would be all of M(λ) and would contain the weight λ, which by [F2] is not a weight of M(si∘λ). Hence ∑iM(si∘λ)⊆J(λ)=ker⁡π.

1.3F2F3F4

The quotient Q:=M(λ)/∑iM(si∘λ) is isomorphic to Mint(λ). Indeed, by [F3] the preimage in U(g) of ∑iM(si∘λ) is the left ideal generated by K together with the elements fimi+1, because the submodule generated by the vectors fimi+1vλ has preimage K+∑iU(g)fimi+1 and M(si∘λ) is exactly that submodule by [F2]; this preimage is precisely the left ideal Iλ of [F4].

2.1step 1.3F2F4

Q is finite-dimensional by [F4] and step 1.3, and its generator vˉ=vλ+∑iM(si∘λ) is nonzero of weight λ: it is nonzero because the sum is proper by step 1.2, and Q=U(g)vˉ with Qλ=Cvˉ because every weight of Q is ≤λ and the weight-λ space of the quotient is the image of M(λ)λ=Cvλ.

3.1F4F5F6step 2.1

We identify Q with L(λ). As a finite-dimensional g-module, Q is completely reducible, Q≅⨁jL(μj), and the multiplicity of L(λ) in Q equals dim⁡Qλ=1: a summand L(μ) has a weight-λ vector only if λ≤μ, and all weights μj of Q satisfy μj≤λ because Q is a quotient of M(λ); hence μ=λ, and L(λ) occurs with multiplicity dim⁡Qλ=1. Since Q is generated by vˉ∈Qλ, which lies in the unique L(λ)-summand, Q equals that summand: Q≅L(λ).

4.1F5step 1.1step 1.2step 3.1∎

Since Q=M(λ)/∑iM(si∘λ) is simple by step 3.1, the submodule ∑iM(si∘λ) is maximal in M(λ). It is contained in J(λ) by step 1.2, and J(λ) is the unique maximal submodule by [F5], so ∑iM(si∘λ)=J(λ)=ker⁡π. Combining with step 1.1 gives im⁡d1=ker⁡π=ker⁡d0: the augmented complex is exact at C0, and coker⁡(d1)=M(λ)/im⁡d1≅L(λ).

Depends on

Used by

Dependency tree · two levels

74 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