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.

Hochschild cohomology of algebraic groups and the classification of Hochschild extensions

Definition

Let k be a field, let G be an algebraic group over k (Group schemes of finite type over a field) and let M be a G-module: a commutative group functor on k-algebras equipped with a left action of G by group homomorphisms. A typical example is a rational representation of an affine G viewed as a group functor (Rational representations and comodules of an affine group scheme).

For n≥0 put Cn(G,M)=Nat⁡(Gn,M)={natural transformations of set-valued functors Gn→M}, the group of n-cochains, with pointwise addition. Here each cochain is a family of maps on algebra-valued points compatible with every base change, rather than an arbitrary function on one point set; for represented functors these are morphisms of schemes by Yoneda. With the convention G0=Spec⁡k so that C0(G,M)=M(k). The coboundary ∂n:Cn(G,M)→Cn+1(G,M) is (∂nf)(g1,…,gn+1)=g1⋅f(g2,…,gn+1)+∑i=1n(−1)if(g1,…,gigi+1,…,gn+1)+(−1)n+1f(g1,…,gn), evaluated functorially on k-algebras; one checks ∂n+1∂n=0 by the usual alternating-sum cancellation, using functoriality of the G-action on M. The Hochschild cohomology of G with coefficients in M is Hn(G,M)=ker⁡∂n/im⁡∂n−1,im⁡∂−1:=0, so in particular H0(G,M)=M(k)G is the group of G-invariant k-points, and C∙(G,M) is a complex of abelian groups.

An exact sequence of G-modules 0→M′→M→M′′→0 gives a long exact sequence when its induced cochain maps Cn(G,M)→Cn(G,M′′) are surjective in every degree (for example when M→M′′ has a section as a map of set-valued functors). Then the induced complexes form a short exact sequence, and the usual connecting-map construction gives ⋯→Hn(G,M′)→Hn(G,M)→Hn(G,M′′)→δHn+1(G,M′)→…

For rational modules V, this surjectivity always holds for an exact sequence of representations: any k-linear splitting of the coefficient vector spaces is a natural map of their additive functors, and applying it to a cochain gives a lift (equivariance of that splitting is not required). If G is affine with coordinate ring A, Yoneda gives Cn(G,Va)=V⊗kA⊗n, so degreewise exactness also follows directly from tensoring vector spaces over a field. These rational cochains commute with filtered unions of coefficient submodules, because each tensor is a finite sum. The rational-module statements on this page use this case.

For the second cohomology group the following classification holds (Crossed homomorphisms, principal crossed homomorphisms and Hochschild extensions for the terminology). Let E(G,M) be the set of equivalence classes of Hochschild extensions 0→M→E→G→1 inducing the given action of G on M, two extensions being equivalent when they are isomorphic over G by a map restricting to the identity on M. Then there is a canonical bijection E(G,M) ⟶ H2(G,M) sending the class of an extension with a section s:G→E to the class of the 2-cocycle f(g1,g2)=s(g1)s(g2)s(g1g2)−1∈M, i.e. the unique element with s(g1)s(g2)=f(g1,g2)s(g1g2); the class of f is independent of the choice of section, and a 2-cocycle conversely determines an extension with the given action. This is Milne's Proposition 15.10; the definitions and the functoriality statements used here are the formal parts of Sections 15(b)-(c) of the cited source.

Depends on

Used by

Dependency tree · two levels

23 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