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.
The augmented two-sided bar complex
Definition
Let be a field and a unital associative -algebra. Set and, for every , set
Write a pure tensor as . For define
where multiplies slots and and leaves the other slots in order. The augmentation is
In degree one,
The empty middle tensor convention makes ; there is no unaugmented differential out of degree zero.
Using Enveloping algebra and the bimodule–module dictionary, each term has the following left and right -module structures, considered separately:
Every adjacent-multiplication face is linear for each of these module structures: at the first and last faces this is associativity, and at internal faces the outer factors are unchanged. The augmentation is linear on both sides, since and . This item specifies the bar terms, maps, and outer actions; the asserted zero-composite identities are addressed by the following bar-boundary lemma.
Depends on
Used by
- Double bar comparison for cyclic bimodule tensor products Lemma
- Hochschild chains are bar tensor chains Lemma
- The bar boundary squares to zero and is augmented Lemma
- Derived cyclicity of Hochschild hyperhomology Theorem
- Hochschild homology is Tor over the enveloping algebra Theorem
- Hochschild hyperhomology is independent of a projective resolution Theorem
- Polynomial Hochschild homology from the diagonal Koszul complex Theorem
- The two-sided bar complex is a projective Aᵉ-resolution Theorem
Dependency tree · two levels
14 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
- Charles A. Weibel, An Introduction to Homological Algebra, Chapter 9: Hochschild and Cyclic Homology, §9.1.3–9.1.5 (standard reference, not scraped)
- Mikhail Khovanov, Triply-graded link homology and Hochschild homology of Soergel bimodules, Hochschild homology section (standard reference, not scraped)