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.
Reduced graded symmetric coalgebra with its shuffle coproduct
Definition
Let be a characteristic-zero field (Field), meaning under The characteristic of a ring: the least with when one exists, and otherwise. By Every field is a commutative ring with ; it is an integral domain, and it is a commutative division ring, is a commutative ring. Let be a graded -vector space. For , define the graded symmetric power
where is spanned by the differences obtained by replacing any adjacent homogeneous factors by inside a pure tensor. Write for the image of a tensor and set
The reduced shuffle coproduct is the degree-zero linear map given on a homogeneous pure symmetric tensor by
where , and is the Koszul sign of Koszul sign rule for graded tensor products and permutations. For the sum is empty and . This is a reduced, hence noncounital coalgebra convention; no arity-zero summand is included. The next lemmas verify its coproduct laws, conilpotence, and cofree universal property.
Depends on
Used by
- Shifted coalgebra definition of an L∞-algebra Definition
- Coderivations of the reduced graded symmetric coalgebra are determined by corestrictions Lemma
- The graded shuffle coproduct is coassociative, cocommutative, and conilpotent Lemma
- The reduced graded symmetric coalgebra is cofree conilpotent cocommutative Lemma
Dependency tree · two levels
23 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
- Tom Lada and Jim Stasheff, Introduction to sh Lie algebras for physicists, §§2–3 (standard reference, not scraped)
- Jean-Louis Loday and Bruno Vallette, Algebraic Operads, Proposition 10.1.20 (standard reference, not scraped)