Alphabeta Math
PropositionStatement: 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.

Chevalley–Eilenberg cohomology computes Ext of the trivial module

Statement

Assume the Axiom of Choice (The Axiom of Choice); it supplies the Axiom of Dependent Choice through AC implies DC implies countable choice. Let a be a Lie algebra over a field k and V an a-module, regarded as a left U(a)-module by Lie representations are U(g)-modules, and regard k as the trivial module. Then for every n≥0 there is a natural isomorphism Hn(a,V)≅Ext⁡U(a)n(k,V), where the left-hand side is the Chevalley–Eilenberg cohomology of Lie algebra cohomology and the right-hand side is the balanced Ext bifunctor of The balanced Ext bifunctor computed using supplied projective and injective resolution data on the objects being compared. Indeed with Pq=U(a)⊗kΛqa, with the module structure induced by the (U(a),k)-bimodule structure of U(a) and with the Koszul differential displayed in step 1.2, the augmented complex P∙→k is a resolution of k by free U(a)-modules, evaluation identifies Hom⁡U(a)(Pq,V) with Cq(a,V) of Chevalley–Eilenberg cochains, and the induced differential is exactly the zero-based differential of Chevalley–Eilenberg differential; hence the comparison corollary Ext can be computed from any projective resolution of the first variable computes Ext⁡n from this resolution with no new sign convention.

Facts & Assumptions

Given: The Axiom of Choice and its consequence Dependent Choice; a Lie algebra a over a field k; an a-module V and its associated left U(a)-module; the trivial module k.

[F1]

The Chevalley–Eilenberg cochains are Cq(a,V)=Hom⁡k(Λqa,V), the differential has the zero-based two-sum formula with the bracket inserted as the first argument, and dq+1dq=0 for every q (Chevalley–Eilenberg cochains, Chevalley–Eilenberg differential, The Chevalley–Eilenberg differential squares to zero).

[F2]

Chevalley–Eilenberg cohomology is Hq(a,V)=ker⁡dq/im⁡dq−1, with cochain spaces zero in negative degrees (Lie algebra cohomology).

[F3]

The Axiom of Choice implies Dependent Choice (AC implies DC implies countable choice).

[F4]

Under the Axiom of Choice every vector space has a basis and every set admits a well-ordering (Every vector space has a basis, The well-ordering theorem).

[F5]

Let B be a basis of a Lie algebra g carrying a total order. Then the ordered monomials form a basis of U(g) and the symbol map σ:S(g)→gr⁡U(g) is an isomorphism of graded algebras (Poincaré–Birkhoff–Witt theorem, Universal enveloping algebra).

[F6]

A Lie algebra action on V and a unital left U(g)-module structure on V are equivalent data (Lie representations are U(g)-modules); if SMR is an (S,R)-bimodule and N a left R-module, then M⊗RN carries the unique left S-module structure with s(m⊗n)=(sm)⊗n (A commuting outer scalar action descends to a tensor product); the free left R-module on a set X is R(X) with standard basis (ex)x∈X (The free module on a set and its standard basis); and under the Axiom of Choice every free module is projective (Free modules are projective, with the exact choice boundary).

[F7]

For a commutative unital ring R, a finite ordered sequence x=(x1,…,xn) in R and an R-module M, the Koszul complex K(x;M)=(ΛRn⊗RM,d) has d(ei1∧⋯∧eip⊗m)=∑j=1p(−1)j−1ei1∧⋯eij^⋯∧eip⊗xijm (Koszul Complex Of A Sequence With Coefficients); an M-regular sequence is M-Koszul-regular, that is Hi(K(x;M))=0 for i>0 (Regular Sequence On A Module, Regular Sequences Give Acyclic Koszul Complexes), and if M is finite free and x is M-regular then K(x;M) is a finite free resolution of M/(x)M (Koszul Complex Resolves A Regular Quotient).

[F8]

Filtered colimits of abelian groups are exact, hence commute with kernels and images; a filtered colimit of complexes computes the colimit of the homology groups degreewise (Filtered colimits of abelian groups are exact, Filtered categories and filtered colimits).

[F9]

For a supplied projective resolution datum Q on a class of objects of an abelian category, Ext⁡Qn(M,N)=HnHom⁡(Q∙(M),N) (Ext via a projective resolution of the first variable, Supplied projective resolution data); under Dependent Choice any two supplied projective resolution data on the same class give naturally isomorphic Ext groups (The balanced Ext bifunctor, Ext can be computed from any projective resolution of the first variable). The module category has enough injectives under AC by Every module admits an injective resolution.

Proof technique: construct the standard free resolution, identify its Hom complex with the Chevalley–Eilenberg complex, and compare supplied resolution data.

Proof

1.1F4algebra

By [F4] fix a k-basis B of a, well ordered by a total order ≤. For q≥0 let Tq be the set of strictly increasing q-tuples i1<⋯<iq in B, and for i∈B write ei for the corresponding basis vector. The wedges eI=ei1∧⋯∧eiq, I∈Tq, form a k-basis of Λqa: they span because Λqa is spanned by decomposables x1∧⋯∧xq and expanding each xj in B multilinearly writes every such wedge as a finite sum of wedges of basis vectors, each of which is ± a wedge eI or zero; and they are independent because for each fixed J∈Tq the alternating q-linear form φJ(x1,…,xq)=det⁡(λjr(xs))r,s, built from the coordinate functionals λj(ei)=δij, factors through Λqa and satisfies φJ(eI)=δIJ, so a linear relation ∑IcIeI=0 gives cJ=φJ(∑IcIeI)=0 for every J.

1.2F4F6construct

Put Pq=U(a)⊗kΛqa. Since U(a) is a (U(a),k)-bimodule, [F6] makes Pq a left U(a)-module with s(u⊗ω)=(su)⊗ω, and since the wedges eI form a k-basis of Λqa, the map U(a)(Tq)→Pq sending the standard basis vector at I to 1⊗eI is an isomorphism of left U(a)-modules: it is U(a)-linear and surjective, and the balanced map (u,ω)↦(cIu)I∈Tq∈U(a)(Tq), where ω=∑IcIeI, induces an inverse by the universal property of the tensor product. Hence every Pq is a free U(a)-module. Define ∂q:Pq→Pq−1 for q≥1 on decomposable arguments by ∂q(u⊗x1∧⋯∧xq)=∑r=1q(−1)r−1uxr⊗x1∧⋯xr^⋯∧xq+∑1≤r<s≤q(−1)r+su⊗[xr,xs]∧x1∧⋯xr^⋯xs^⋯∧xq, and set ∂0=ε:U(a)→k for the algebra augmentation supplied by the universal property of U(a) from the zero map on a ([F6], Universal enveloping algebra); the formula is k-multilinear and alternating in x1,…,xq and balanced in u, so it defines a U(a)-linear map Pq→Pq−1 on the tensor product of the free module with the exterior power.

2.1F1F6step 1.2algebra

For a left U(a)-module W, evaluation on 1⊗ω is a natural bijection Hom⁡U(a)(Pq,W)→Cq(a,W), φ↦(x1∧⋯∧xq↦φ(1⊗x1∧⋯∧xq)), with inverse f↦(u⊗ω↦u⋅f(ω)); it is the Hom-tensor adjunction for the free module on the basis {eI}. Under this identification the precomposition φ↦φ∘∂q+1 corresponds to the Chevalley–Eilenberg differential: for f∈Cq(a,W) and x0,…,xq∈a, φ(∂q+1(1⊗x0∧⋯∧xq)) equals ∑i=0q(−1)ixi⋅f(x0,…,xi^,…,xq)+∑0≤i<j≤q(−1)i+jf([xi,xj],x0,…,xi^,…,xj^,…,xq), which is exactly (df)(x0,…,xq) for the zero-based formula of [F1]. Hence Hom⁡U(a)(P∙,W) is the Chevalley–Eilenberg complex C∙(a,W).

2.2F5F7step 1.2algebra

Use the fixed ordered basis B of the arbitrary Lie algebra a, and identify S(a) with the polynomial ring k[xi:i∈B] by [F5]. Put FNPq=FN−qU(a)⊗kΛqa, with FpU=0 for p<0. This filtration is increasing, exhaustive and bounded below in each degree. The action term of ∂ raises PBW degree by one and lowers exterior degree by one, preserving total degree N; the bracket term lowers total degree by one. Therefore the associated graded differential is the Koszul differential on S(a)⊗kΛ∙a: on each basis wedge it is the finite sum δ(f⊗ei1∧⋯∧eiq)=∑r=1q(−1)r−1fxir⊗ei1∧⋯eir^⋯∧eiq. Its augmentation evaluates all variables at zero, giving k.

3.1F1F6step 2.1algebra

The chain identity is ∂q∂q+1=0 for q≥1. In step 2.1 take W=Pq−1: the composite of the precomposition maps from Hom⁡(Pq−1,W) to Hom⁡(Pq+1,W) is the square of the Chevalley–Eilenberg differential, hence zero by [F1]. Applying it to id⁡Pq−1 gives ∂q∂q+1=0. Also ε∂1=0 because ε(ux)=0 for x∈a. Thus the augmented P∙ is a chain complex of free modules.

3.2F7F8step 2.2algebra

For every finite S⊆B, let RS=k[xi:i∈S] and use the induced order on S. The ordered variables form an RS-regular sequence: multiplication by each variable is injective on the polynomial ring in the variables not yet removed, as it shifts the corresponding monomial exponent by one; the successive quotients remove that variable. By [F7], the augmented Koszul complex RS⊗kΛ∙(span⁡k{ei:i∈S})→k is exact. Inclusions S⊆T give inclusions of these complexes compatible with their augmentations. Every polynomial and exterior tensor has finite support in B, so their filtered colimit is exactly the augmented graded complex of step 2.2. Exactness of filtered colimits [F8] proves this graded complex exact, including its degree-zero augmentation. This argument uses finite polynomial-variable subcomplexes, not finite-dimensional Lie subalgebras. The differential preserves total polynomial-plus-exterior degree, so each homogeneous total-degree component is also exact.

4.1F8step 3.1step 3.2algebra

The augmented complex P∙→k is exact, including at P0. The zero element is already a boundary. Let z≠0 in Pq be a cycle with q≥1, or let z∈ker⁡ε⊆P0; let N be minimal with z∈FNPq and let zˉ∈gr⁡NPq be its symbol. Since ∂z=0 and the induced graded differential sends the symbol of an element to the symbol of its image, δzˉ=0; by exactness of the augmented associated graded complex from step 3.2, zˉ=δwˉ for some wˉ∈gr⁡NPq+1 in the cycle case, or for q=0, N≥1 and zˉ∈ker⁡(gr⁡NP0→k)=im⁡δ (and if q=0 and N=0 then z∈F0P0=k⋅1 with ε(z)=0, so z=0). Choose a lift w∈FNPq+1 of wˉ; then z−∂w∈FN−1Pq is again a cycle and ε(z−∂w)=0 in degree zero. Iterating this reduction finitely many times (each iteration lowers N by at least one, and only finitely many choices of lifts are made) arrives at an element of Fq−1Pq, which is zero for q≥1, or at an element of F0P0∩ker⁡ε=0 for q=0. Hence z∈im⁡∂q+1, and since im⁡∂q+1⊆ker⁡∂q by step 3.1, this proves exactness at every degree.

5.1step 2.2step 3.2step 4.1algebra

Steps 2.2 and 3.2 apply to arbitrary a without a finite-dimensionality hypothesis. The filtration reduction of step 4.1 terminates because each individual tensor has finite PBW degree. Consequently the augmented P∙→k is exact for every Lie algebra: ker⁡∂q=im⁡∂q+1 for q≥1, ker⁡ε=im⁡∂1, and ε is surjective since ε(1)=1.

6.1F2F3F6F9step 1.2step 2.1step 5.1∎

By steps 1.2, 2.1 and 5.1, P∙→k is a resolution of k by free U(a)-modules, hence by [F6] and the Axiom of Choice a projective resolution. Taking W=V in step 2.1, the complex Hom⁡U(a)(P∙,V) is the Chevalley–Eilenberg complex C∙(a,V), so HnHom⁡U(a)(P∙,V)≅Hn(a,V) for every n≥0. Iterating the free module on the underlying set of each kernel gives a projective resolution of every module, since these free modules are projective by [F6]. Injective resolutions exist by Every module admits an injective resolution under the assumed Axiom of Choice. Thus the module category has enough projectives and injectives, as required by the balanced Ext convention [F9]. Fix supplied resolution data on the objects being compared, with Q∙(k)=P∙; by [F9] and Dependent Choice, available by [F3], every supplied projective resolution datum on the same class computes Ext groups naturally isomorphic to those of Q, so Ext⁡n(k,V)≅HnHom⁡(P∙,V)≅Hn(a,V) for every n. The isomorphisms are natural in V because the identification of step 2.1 is natural in the coefficient module and the comparison maps of [F9] are natural. This proves the statement; no finite-dimensionality, field characteristic or coefficient hypothesis was used beyond the displayed ones.

Depends on

Used by

Dependency tree · two levels

105 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