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 field as an associative algebra and an A∞-algebra
Example
Let be a field, concentrated in degree zero. Set and for . Define , let be field multiplication, and set for . These maps make an uncurved cohomological A∞-algebra.
Facts & Assumptions
Given: A field and the A∞ identities from Uncurved cohomological A∞-algebra in the unsuspended convention.
Uncurved cohomological A∞-algebra in the unsuspended convention: has degree and the Stasheff sum vanishes in every arity .
Field: field multiplication is associative and has an identity.
Verification
The zero map is homogeneous of degree , field multiplication has degree zero on , and every zero map for is homogeneous of degree . Thus the degrees match [F1].
For , the only possibly nonzero terms are . They agree by associativity in [F2], so their difference is zero.
For every Stasheff summand contains , so the sum is zero. For , the only potentially nonzero outer operation is , but ; all summands containing an inner also vanish.
For , a nonzero summand would require both inner and outer operations to have arity two, which forces . Therefore all terms vanish in these arities as well.
The defining identity holds in every arity by steps 2.1, 1.2 and 2.2, so the stated operations form an A∞-algebra.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
3 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
- Bernhard Keller, Introduction to A-infinity algebras and modules, §3.1 (standard reference, not scraped)
- Jean-Louis Loday and Bruno Vallette, Algebraic Operads, §9.2.5 (standard reference, not scraped)