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.
A differential graded algebra as its regular left module
Example
Let be any cohomological DGA over a commutative ring . Let as a graded -module, let act on by left multiplication, and let .
Facts & Assumptions
Given: A cohomological DGA over with its multiplication and differential. Verify that its regular left module is a differential graded module.
Cohomological differential graded algebra: The multiplication on is -bilinear, associative and unital, has degree zero, and has central -action.
Cohomological differential graded algebra: For homogeneous and , the differential satisfies .
Cohomological left and right differential graded modules: A cohomological left differential graded -module is a graded unital left -module whose action has degree zero, together with a degree-one square-zero differential satisfying for homogeneous .
Cohomological differential graded algebra: The differential consists of -linear maps with .
Verification
Associativity and the unit of make left multiplication a unital left -action on , and degree preservation gives ; zero acts by zero and the unit acts as the identity.
The differential has degree and squares to zero by [F4]. For homogeneous , the required identity is the DGA Leibniz identity [F2].
The action and differential therefore satisfy every condition in [F3], so is a left DG module over itself.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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.