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.

Higher Hochschild cohomology vanishes for linearly reductive groups

Statement

Let k be a field and let G be a linearly reductive affine algebraic group over k (Affine schemes and their coordinate rings): every finite-dimensional rational representation of G is a direct sum of simple representations, equivalently H1(G,V)=0 for every finite-dimensional representation V (Linear reductivity is equivalent to vanishing of first Hochschild cohomology). Then Hn(G,V)=0for all n≥1 and for every rational representation V of G, where H∙ is Hochschild cohomology (Hochschild cohomology of algebraic groups and the classification of Hochschild extensions).

Facts & Assumptions

Given: A field k, a linearly reductive affine algebraic group G over k, a rational representation V of G, and an integer n≥1.

[F1]

Cohomology is computed from the Hochschild complex C∙(G,M); a short exact sequence of rational G-modules induces a long exact sequence in cohomology through degreewise tensor exactness. (Hochschild cohomology of algebraic groups and the classification of Hochschild extensions)

[F2]

Every rational representation is the filtered union of its finite-dimensional subrepresentations, and Hochschild cohomology commutes with filtered colimits of coefficient modules: Hn(G,lim→⁡iVi)=lim→⁡iHn(G,Vi) for directed systems of subrepresentations. (Milne, Algebraic Groups, Section 15(e); the colimit statement is the standard exactness of filtered colimits applied degreewise to the rational cochain complex Cn(G,V)=V⊗kO(G)⊗n: tensor products commute with filtered colimits, which are exact over a field.)

[F3]

Milne's Lemma 15.14: every class x∈Hn(G,V) for finite-dimensional V and n≥1 dies in Hn(G,W) for some finite-dimensional representation W containing V. (Milne, Algebraic Groups, Lemma 15.14; the vanishing input is Shapiro's lemma for the trivial subgroup and acyclicity of free comodules.)

[F4]

H1(G,V)=0 for every finite-dimensional representation V of a linearly reductive G. (Linear reductivity is equivalent to vanishing of first Hochschild cohomology)

Proof

Given: A field k, a linearly reductive affine algebraic group G over k, a rational representation V, and n≥1.

1.1F2

By [F2] the representation V is the filtered union of its finite-dimensional subrepresentations Vi, and Hn(G,V)=lim→⁡iHn(G,Vi). It therefore suffices to prove Hn(G,W)=0 for every finite-dimensional representation W and every n≥1; fix such a W.

2.1F1F3F4step 1.1∎

I prove Hn(G,W)=0 by induction on n≥1. For n=1 this is [F4]. For n≥2, let x∈Hn(G,W); by [F3] there is a finite-dimensional representation U containing W such that x maps to zero in Hn(G,U). The short exact sequence 0→W→U→U/W→0 of finite-dimensional representations gives, by [F1], the exact sequence Hn−1(G,U/W)→δHn(G,W)→Hn(G,U), so x=δ(y) for some y∈Hn−1(G,U/W). By the induction hypothesis and [step 1.1] applied to the finite-dimensional representation U/W, the group Hn−1(G,U/W) vanishes; hence y=0 and x=0. Therefore Hn(G,W)=0 for all finite-dimensional W and all n≥1, and by [step 1.1] the same holds for every rational representation.

Depends on

Used by

Dependency tree · two levels

12 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