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.
Two-variable diagonal Koszul signs
Example
Assume AC. Let be a field, , and let be a -central -bimodule. Order the exterior generators as and . The coefficient Koszul complex is
where and . Under the polynomial Hochschild theorem, its homology is .
Facts & Assumptions
Given: AC, a field , , a -central -bimodule , and the ordered exterior generators .
Under AC, the polynomial theorem identifies with the homology of the coefficient Koszul complex. Its differential deletes an increasing wedge factor with sign and coefficient (Polynomial Hochschild homology from the diagonal Koszul complex).
A -central -bimodule has commuting left and right actions and equal induced scalar actions (Enveloping algebra and the bimodule–module dictionary).
The diagonal Koszul term has the increasing wedge basis and alternating deletion differential; if , each wedge generator has internal degree (The polynomial diagonal Koszul bimodule complex).
For the regular bimodule with in internal degree , , and each exterior generator in internal degree , one has for , and for (Diagonal Hochschild homology of a polynomial ring).
AC asserts that every family of nonempty sets has a choice function (The Axiom of Choice).
Verification
Specialize the diagonal deletion formula to the ordered two-variable wedge. [F1, F3, given] For , deleting the first factor contributes with positive sign; deleting the second contributes . For degree one, deleting either singleton gives . This gives exactly the two displayed maps with the stated wedge orientation.
Verify that the displayed maps compose to zero. [F1, F2, step 1.1, algebra] Set and . The bimodule laws in [F2] give and . Because and the left and right actions commute, these expressions are equal. Hence , which checks the mixed-product cancellation.
Compute the regular-coefficient subcase. [F1, F4, step 1.1, step 2.1, algebra] If with its regular bimodule structure, commutativity gives for every . Thus both maps vanish. The terms are in degree zero, in degree one, and in degree two; there are no higher terms. If , their internal shifts are respectively , , and . By [F4], this gives , , , and for .
Check endpoints, zero input, grading, and AC use. [F1, F2, F3, step 2.1, step 3.1, given] Degree zero is the empty wedge term , and degree two is the single top wedge ; the degree-two differential has zero composite with by step 2.1, and there is no degree-three term. If , every term and map is zero. For the graded regular-coefficient subcase in step 3.1, use the standard grading with and give each wedge generator internal degree ; the displayed maps preserve total internal degree. The general coefficient statement does not require a grading on . AC is used only to apply the polynomial Hochschild theorem and its regular-coefficient corollary; the sign and commutator calculations use no choice. This example asserts no biconditional. [F1, F2, F3, F4, F5, step 1.1, step 2.1, step 3.1, given]
Source comparison
Weibel, An Introduction to Homological Algebra, Exercise 9.1.3, printed p.304/PDF p.4, asks for the general polynomial Koszul computation but does not spell out the two-variable signs. Khovanov, “Hochschild homology,” PDF p.1, lines 41–60, states the polynomial resolution and coefficient differential with exterior deletion signs. The explicit orientation, commutator cancellation, and regular-coefficient groups are calculated above.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
24 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, Exercise 9.1.3 (standard reference, not scraped)
- Mikhail Khovanov, Triply-graded link homology and Hochschild homology of Soergel bimodules, Hochschild homology section (standard reference, not scraped)