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.

Dimension of the kernel modulo n-minus equals the next term (BGG 10.7)

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ∈Λ+, let k≥0, and assume that C∙(λ) is exact in degrees 0,…,k−1, that is, im⁡dj+1=ker⁡dj for 0≤j≤k−1 (vacuous for k=0). Let dk ⁣:Ck(λ)→Ck−1(λ) be the BGG differential of The BGG differential from signed Verma maps. Then ker⁡dk/n−ker⁡dk is finite-dimensional and

dim⁡Cker⁡dk/n−ker⁡dk=dim⁡CCk+1(λ)/n−Ck+1(λ)=∣Wk+1∣.

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, an integer k≥0, the BGG complex C∙(λ) and the hypothesis that it is exact in degrees 0,…,k−1.

[F1]

ker⁡dk is an object of O of finite length, and every object M of O has a finite-dimensional b-stable h-semisimple generating subspace E with a b-flag whose quotients are one dimensional and annihilated by n+; hence M=U(n−)E and M/n−M is spanned by the classes of finitely many weight vectors, so it is finite-dimensional (Category O is abelian and extension closed among weight modules, Finite Borel-stable generators and weight flags, Every object of O has finite length, The classical BGG category O).

[F2]

Ck+1(λ)=⨁ℓ(w)=k+1M(w∘λ), each M(ψ)≅U(n−)vψ is free over U(n−) on its highest weight vector, and M(ψ)/n−M(ψ)=Cvˉψ is one-dimensional of weight ψ; the weights w∘λ are pairwise distinct, so dim⁡CCk+1(λ)/n−Ck+1(λ)=∣Wk+1∣ (The PBW model of a Verma module, The Bruhat graph and the BGG Verma sum in degree k, Positive coroot pairings of a dominant integral weight).

[F3]

Tor⁡k+1U(n−)(C,Πλ)≅C∣Wk+1∣, where Πλ=L(λ) (Tor with the trivial module is computed by the weak BGG resolution).

[F4]

Tor can be computed from a free (hence projective) resolution ⋯→F2→F1→F0→Πλ→0 of the left module Πλ: Tor⁡nU(n−)(C,Πλ)=Hn(F∙/n−F∙), and the functor C⊗U(n−)(−) is right exact; free modules and their finite direct sums are projective, so resolutions exist under the Axiom of Choice (Tor from a projective resolution of the left module, The balanced Tor bifunctor, Degree-zero Tor is the tensor product in either construction, The long exact Tor sequence in the left-module variable, Under the Axiom of Choice, every module admits a projective resolution).

[F5]

BGG 10.5, free presentation form (Surjectivity modulo n-minus for free weight-generated modules (BGG 10.5)): if N∈O, M is a U(n−)-module free on weight-vector generators v1,…,vn, and φ ⁣:M→N is U(n−)-linear with every φ(vi) a weight vector, then φ is surjective if and only if φˉ ⁣:M/n−M→N/n−N is surjective.

[F6]

BGG 10.6 (The BGG differential induces an injection into kernel coinvariants (BGG 10.6)): for j≥0, if C∙(λ) is exact in degrees 0,…,j−1, then dˉj+1 ⁣:Cj+1(λ)/n−Cj+1(λ)→ker⁡dj/n−ker⁡dj is injective.

[F7]

ker⁡d0=ker⁡π is the maximal submodule of M(λ)=C0(λ), which does not contain the highest weight vector, and C0(λ)/n−C0(λ)=Cvˉλ has weight λ (A Verma module has a unique simple quotient, A proper Verma submodule misses the highest-weight line, The PBW model of a Verma module).

Proof

1.1F1F2

By [F1] the space ker⁡dk/n−ker⁡dk is finite-dimensional and is spanned by classes of weight vectors; choose weight vectors v1,…,vn∈ker⁡dk whose classes vˉ1,…,vˉn form a basis of ker⁡dk/n−ker⁡dk. By [F2] the space Ck+1(λ)/n−Ck+1(λ) has dimension ∣Wk+1∣.

2.1F1F5step 1.1

Let D:=U(n−)g1⊕⋯⊕U(n−)gn be free on generators gi, and let δ ⁣:D→ker⁡dk be the U(n−)-linear map with δ(gi)=vi. Its reduction δˉ ⁣:D/n−D→ker⁡dk/n−ker⁡dk sends the basis gˉi to the basis vˉi, so it is an isomorphism, in particular surjective; the images δ(gi)=vi are weight vectors, so [F5] applied to M=D, N=ker⁡dk gives that δ is surjective. Hence im⁡δ=ker⁡dk, and the augmented sequence D→Ck(λ)→Ck−1(λ)→⋯→C0(λ)→Πλ→0 is exact: at D→Ck by surjectivity onto ker⁡dk, at Cj for 0≤j≤k−1 by the exactness hypothesis, at Ck because im⁡δ=ker⁡dk, and at Πλ because the augmentation is surjective.

3.1F2F4step 2.1

Every Cj(λ) is free over U(n−) by [F2], and D is free; choose a free U(n−)-module D2 with a surjection D2↠ker⁡δ and continue inductively to obtain a free resolution ⋯→D2→D→Ck(λ)→⋯→C0(λ)→Πλ→0 of Πλ.

4.1F6F7step 2.1step 3.1

We compute the two maps that enter Tor⁡k+1. First, applying the right exact functor C⊗U(n−)(−) to the exact sequence D2→D→δker⁡dk→0 from step 3.1 gives an exact sequence D2/n−D2→D/n−D→ker⁡dk/n−ker⁡dk→0 whose second map is the isomorphism δˉ; hence the first map is zero. Second, if k≥1, applying the functor to the exact sequence D→δCk(λ)→dkker⁡dk−1→0 (exact by step 2.1 and the hypothesis at k−1) gives an exact sequence D/n−D→Ck(λ)/n−Ck(λ)→dˉkker⁡dk−1/n−ker⁡dk−1→0; the composite is zero because dkδ=0, and dˉk is injective by [F6] with j=k−1 (using exactness in degrees 0,…,k−2, which the hypothesis provides), so the first map is zero. If k=0, the map D/n−D→C0(λ)/n−C0(λ) is zero because δ(D)⊆ker⁡d0, every weight of ker⁡d0 is different from λ by [F7], and C0(λ)/n−C0(λ) is one-dimensional of weight λ.

5.1F4step 4.1

By the resolution of step 3.1 and [F4], Tor⁡k+1U(n−)(C,Πλ) is the homology at degree k+1 of the complex ⋯→D2/n−D2→D/n−D→Ck(λ)/n−Ck(λ)→⋯, namely ker⁡(D/n−D→Ck(λ)/n−Ck(λ))/im⁡(D2/n−D2→D/n−D). Both maps vanish by step 4.1, so this homology equals D/n−D, which is isomorphic to ker⁡dk/n−ker⁡dk via δˉ.

6.1F1F2F3step 1.1step 5.1∎

Combining steps 1.1, 5.1 and [F3]: dim⁡Cker⁡dk/n−ker⁡dk=dim⁡CTor⁡k+1U(n−)(C,Πλ)=∣Wk+1∣, which equals dim⁡CCk+1(λ)/n−Ck+1(λ) by step 1.1. This proves both equalities.

Depends on

Used by

Dependency tree · two levels

67 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