Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Diagonal Hochschild homology of a polynomial ring

Statement

Assume AC. Let k be a field and R=k[x1,…,xn] for n≥0, regarded as its regular bimodule. Give HHj(R,R) the R-module structure induced by multiplication on the coefficient factor in Hochschild chains. For 0≤j≤n there is an isomorphism of R-modules HHj(R,R)≅R⊗kΛkj(kn), and HHj(R,R)=0 for j>n. For the graded assertion, place k in internal degree 0 and grade R by deg⁡intxi=2; give each standard exterior generator internal degree 2. Then the isomorphism is one of graded R-modules and, for 0≤j≤n, HHj(R,R)≅R(nj){2j}. In particular, for n=0 one has HH0(k,k)=k and HHj(k,k)=0 for j>0.

Facts & Assumptions

Given: AC, a field k, R=k[x1,…,xn], and the regular R-bimodule. For the graded assertion, place k in internal degree 0 and give each xi internal degree 2.

[F1]

Under AC, the polynomial Hochschild theorem identifies HHj(R,M) with the homology of the coefficient diagonal Koszul complex, naturally in M; in its graded clause each θi has internal degree 2 (Polynomial Hochschild homology from the diagonal Koszul complex).

[F2]

For every p, the increasing wedges indexed by p-subsets form a basis of the pth exterior power of a finite free module, and that exterior power vanishes for p>n (Exterior Algebra Basis Monomials).

[F3]

AC means every family of nonempty sets has a choice function (The Axiom of Choice).

[F4]

Hochschild chains have terms Cn(A,M)=M⊗kA⊗kn, and their boundary is the alternating sum of the first action, internal multiplication, and last action faces (Hochschild chains and Hochschild homology with coefficients).

[F5]

The graded shift is defined by (N{r})d=Nd−r (Associative graded algebras, bimodules, and internal shifts).

Proof

technique · direct
1.1F1F3given

Apply the polynomial Hochschild theorem with the regular coefficient bimodule. [F1, F3, given] Since R is k-central, the theorem applies to M=R. Under AC it gives HHj(R,R)≅Hj(K∙(R)), where the coefficient differential deletes θi with coefficient xim−mxi. Its naturality in M will also identify the coefficient R-module structure below.

2.1F1F4step 1.1algebra

The Hochschild-chain boundary is R-linear on the regular coefficient chains. [F4, step 1.1, algebra] For r∈R, let r act on Cq(R,R)=R⊗kR⊗kq by multiplication on the first factor. This action commutes with every face: the first face uses (rm)a1=r(ma1), internal faces leave the coefficient unchanged, and the last face uses aq(rm)=r(aqm) because R is commutative. Thus each boundary is R-linear and the homology inherits this R-action. For every r∈R, coefficient multiplication μr(m)=rm is an R-bimodule endomorphism of R. Naturality in [F1] shows the comparison with Hj(K∙(R)) commutes with μr, so it is R-linear.

2.2F1step 1.1algebra

Every differential in the coefficient Koszul complex for M=R is zero. [F1, step 1.1, algebra] For every m∈R and generator xi, commutativity gives xim−mxi=0. Hence each coefficient of every Koszul deletion map is zero, so dq=0 for all q.

3.1F1F2step 2.1step 2.2algebra

Read homology from the exterior basis. [F1, F2, step 2.2, algebra] Since all differentials vanish, Hj(K∙(R))=Kj(R). For 0≤j≤n, the increasing wedges θI with ∣I∣=j form a basis, so Kj(R)=⨁∣I∣=jRθI≅R⊗kΛkj(kn) with rank (nj). For j>n the exterior power and Koszul term are zero by [F2], giving HHj(R,R)=0. The isomorphism is R-linear by step 2.1.

4.1F1F5step 3.1algebra

Determine the internal grading and shift. [F1, F5, step 3.1, algebra] In the graded clause of [F1], each θi has degree 2, so every θI with ∣I∣=j has degree 2j. Thus each summand RθI is the internal shift R{2j} under [F5], and the isomorphism in step 3.1 preserves internal degree.

5.1

Check the empty, one-variable, top, and degree-zero cases. [F1, F2, step 3.1, step 4.1, given] If n=0, there is only the empty wedge in degree zero and the complex is k with zero differential, so HH0(k,k)=k and higher homology vanishes. If n=1, the two terms are R and Rθ1; the differential is zero, so HH0=R, HH1=R{2}, and higher groups vanish. In general, degree zero uses Λ0(kn)=k and has no outgoing differential; top degree j=n has one basis wedge of degree 2n (the empty wedge when n=0); above top degree all terms vanish. The stated AC is used only through [F1]; the zero-differential calculation and exterior basis read-off make no further choices. There is no zero coefficient case because the coefficient is fixed to the nonzero regular module R over a field. This claim is not an equivalence. [F1, F2, F3, step 1.1, step 2.2, step 3.1, step 4.1, algebra] □

Source comparison

Weibel, An Introduction to Homological Algebra, Exercise 9.1.3, printed p.304/PDF p.4, asks for the polynomial Hochschild calculation with the Koszul resolution; it is an exercise prompt, not a proof. Weibel's Exercise 9.1.1, printed p.300/PDF p.1, asks for the commutative-algebra action on Hochschild chains. Khovanov, “Hochschild homology,” PDF p.1, lines 33–62, states the polynomial diagonal Koszul complex and its coefficient contractions. These passages corroborate the conventions; the zero differential, R-linearity, exterior-basis calculation, and boundary cases are proved above.

Depends on

Used by

Dependency tree · two levels

26 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