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.

Tor with the trivial module is computed by the weak BGG resolution

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ∈Λ+ and let B∙(λ) be the weak BGG resolution of Weak BGG resolution, with Πλ=L(λ). Then for every k≥1 the induced differential Bk(λ)/n−Bk(λ)→Bk−1(λ)/n−Bk−1(λ) is zero, Wt⁡(Bk(λ)/n−Bk(λ))={w∘λ:ℓ(w)=k} with each weight occurring once, and consequently

Tor⁡kU(n−)(C,Πλ)≅Bk(λ)/n−Bk(λ)≅C∣Wk∣,

where Wk={w∈W:ℓ(w)=k}. This is the dimension statement used by BGG in the form needed here.

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, the weak BGG resolution B∙(λ) of Πλ=L(λ) with its differentials, and the right U(n−)-module C with trivial action.

[F1]

0→B∣Φ+∣(λ)→⋯→B1(λ)→B0(λ)→Πλ→0 is exact, each Bk(λ) is an object of O, and Typ⁡Bk(λ)={w∘λ:ℓ(w)=k} with each weight occurring once (Weak BGG resolution, Type of a module with a Verma filtration, The classical BGG category O).

[F2]

Verma modules satisfy M(ψ)≅U(n−) as U(n−)-modules, generated by the highest weight vector vψ, and M(ψ)/n−M(ψ)≅Cvψ is one-dimensional of weight ψ; the weights w∘λ for w∈W are pairwise distinct (The PBW model of a Verma module, Verma modules, Positive coroot pairings of a dominant integral weight).

[F3]

The functor F=C⊗U(n−)(−) is right exact, and F(M)≅M/n−M. Objects of O that are Verma-filtered are F-acyclic: Tor⁡jU(n−)(C,N)=0 for all j>0 and every Verma-filtered N∈O (Verma-filtered objects are acyclic for n-minus coinvariants, Degree-zero Tor is the tensor product in either construction, Tor from a projective resolution of the left module).

[F4]

The acyclic-resolution theorem: if P is a supplied projective resolution datum on a class D, F is additive and right exact, and ⋯→Q1→Q0→A→0 is an exact complex with every Qq∈D F-acyclic and all syzygies Zq in D, then LnPF(A)≅Hn(F(Q∙)) for all n≥0; projective resolutions exist and, under the Axiom of Choice, a resolution datum may be supplied. Moreover Tor⁡nU(n−)(C,−) is the left derived functor of F computed with such a datum (The acyclic-resolution theorem for left derived functors, An F-acyclic resolution, The balanced Tor bifunctor, Under the Axiom of Choice, every module admits a projective resolution, The long exact Tor sequence in the left-module variable).

[F5]

O-objects are h-semisimple with finite-dimensional weight spaces, and the quotient of an h-stable submodule is h-semisimple; nonzero eigenvectors of pairwise distinct weights in a vector space are linearly independent (The classical BGG category O). The number of elements of W of length k is denoted ∣Wk∣; for k>∣Φ+∣ both sides below are zero (Finite Weyl strong exchange and deletion, The Bruhat graph and the BGG Verma sum in degree k).

Proof

1.1F2F3F5

We compute the weight multiset of Bk(λ)/n−Bk(λ) from the Verma filtration of [F1]. Fix a filtration 0=N0⊆N1⊆⋯⊆Nn=Bk(λ) with Nj/Nj−1≅M(wj∘λ), where w1,…,wn list Wk. For each j, the vanishing Tor⁡1(C,M(wj∘λ))=0 from [F3] and its long exact sequence give a short exact sequence 0→Nj−1/n−Nj−1→Nj/n−Nj→(Nj/Nj−1)/n−(Nj/Nj−1)→0; the last term is Cvwj by [F2], Choose a weight-vector lift in Nj of the highest weight vector in Nj/Nj−1; such a lift exists by h-semisimplicity. Its coinvariant class vˉwj has weight wj∘λ and maps to the generator of the last term. Together with the embedded earlier classes it spans Nj/n−Nj; induction on j gives a spanning set for Bk(λ)/n−Bk(λ).

1.2F1F5

The induced map dˉk ⁣:Bk(λ)/n−Bk(λ)→Bk−1(λ)/n−Bk−1(λ) is h-equivariant: the differential dk is a g-homomorphism, n−Bk(λ) and n−Bk−1(λ) are h-stable, and the induced map on quotients commutes with the action of h.

1.3F1F3F4

The homology of (B∙(λ)/n−B∙(λ),dˉ∙) computes Tor: by [F1] and [F3] the complex B∙(λ) is an F-acyclic resolution of Πλ with all terms and all syzygies in O, so the acyclic-resolution theorem of [F4] gives Tor⁡nU(n−)(C,Πλ)≅Hn(B∙(λ)/n−B∙(λ)) for every n.

2.1F2F5step 1.1

These classes have weights wj∘λ, which are pairwise distinct by [F2], and Bk(λ)/n−Bk(λ) is h-semisimple by [F5]; each newly lifted class has nonzero image in the corresponding one-dimensional quotient of the short exact sequence in step 1.1, and the earlier classes embed injectively. Induction therefore proves these classes nonzero, linearly independent and a basis. Therefore Wt⁡(Bk(λ)/n−Bk(λ))={w∘λ:ℓ(w)=k} with each weight occurring once, and dim⁡CBk(λ)/n−Bk(λ)=∣Wk∣.

3.1F2step 2.1step 1.2

For every k≥1 the map dˉk is zero. Indeed, its source has weights {w∘λ:ℓ(w)=k} and its target has weights {w′∘λ:ℓ(w′)=k−1} by step 2.1, and these two sets are disjoint by the pairwise distinctness in [F2]; an h-equivariant map sends a weight vector of weight μ into the weight-μ space of the target, so every basis vector of the source maps to 0.

4.1F5step 2.1step 1.3step 3.1∎

Consequently, for k≥1, the degree-k homology of B∙(λ)/n−B∙(λ) equals Bk(λ)/n−Bk(λ) (all incoming and outgoing induced differentials at degree k vanish by step 3.1), so Tor⁡kU(n−)(C,Πλ)≅Bk(λ)/n−Bk(λ)≅C∣Wk∣ by steps 1.3 and 2.1. The claims about the vanishing induced differential and the weight multiset are steps 3.1 and 2.1, and for k>∣Φ+∣ the module is zero by [F5].

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