Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Termwise Hochschild homology and iterated homology

Definition

Let k be a field, let A be a unital associative k-algebra, and let F=(Fi,dFi)i∈Z be a bounded cochain complex of k-central A-bimodules with differentials of internal degree zero (Bounded graded bimodule complexes and signed tensor totalization). Fix j≥0. Each differential dFi:Fi→Fi+1 is a map of A-bimodules, so it commutes with every Hochschild face of the chains Cj(A,−)=(−)⊗kA⊗kj and therefore induces a chain map C∙(A,dFi):(C∙(A,Fi),b)⟶(C∙(A,Fi+1),b) (Hochschild chains and Hochschild homology with coefficients). Writing HHj(A,Fi)=Hj(C∙(A,Fi)), the induced map on homology is the k-linear map HHj(A,dFi):HHj(A,Fi)⟶HHj(A,Fi+1) provided by A chain map induces a well-defined map on homology. Because dFi+1dFi=0, the composite chain map C∙(A,dFi+1)C∙(A,dFi) is induced by the zero bimodule map and is therefore the zero chain map, so the composite HHj(A,dFi+1)HHj(A,dFi) vanishes; the functoriality in the same cited theorem also gives HHj(A,dFi)=id when dFi is an identity and HHj(C2)HHj(C1)=HHj(C2C1) for composable bimodule maps. Hence (HHj(A,F∙), HHj(A,dF∙)) is a cochain complex of k-modules, the termwise Hochschild complex of F in Hochschild degree j, and its cohomology is defined (Cohomology object of a cochain complex): Hi(HHj(A,F∙))=ker⁡(HHj(A,dFi))im⁡(HHj(A,dFi−1)). The differentials HHj(A,dFi) are induced by maps of bimodules, so they are k-linear and preserve whatever outer structure the construction carries; in particular, if F is a complex of graded bimodules and every dFi has internal degree zero, then each internal-degree piece of HHj(A,Fi) is mapped to the same internal degree of HHj(A,Fi+1).

In the internally graded case the three indices are kept separately: the Hochschild degree j≥0, the cochain index i of F, and the internal degree, together with the cohomological degree i of Hi(HHj(A,F∙)). No identification between these indices is asserted by this definition. In particular this construction is not defined to coincide with the Hochschild hyperhomology HHhyper,i−j(A,F) of Hochschild hyperhomology of a bounded bimodule complex: the latter is the cohomology of the total complex in which the Hochschild boundary b and the cochain differential dF are combined into one differential, whereas here b is used first, separately for each i, and only the induced maps HHj(A,dFi) are totalized. The two constructions agree in general only through the spectral sequence of Termwise Hochschild spectral sequence of a bounded bimodule complex, whose second page is exactly the iterated group Hi(HHj(A,F∙)) and which may carry higher differentials.

Two degenerate readings fix the conventions. If F is concentrated in a single cochain degree r, then the termwise complex has one term in degree r and Hr(HHj(A,F∙))=HHj(A,Fr), with all other iterated groups zero. If F=0 then the termwise complex is zero, so every iterated group vanishes. If the differential of F vanishes then all maps HHj(A,dFi) vanish, so Hi(HHj(A,F∙))=HHj(A,Fi) in the sense that the termwise complex is the direct sum of its terms with zero differential; this is the situation of the matrix and two-term examples on the companion page.

Depends on

Used by

Dependency tree · two levels

17 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