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 Maurer–Cartan series converges in a complete filtered L∞-algebra
Statement
Let be the shifted graded space of a complete filtered L∞-algebra over a characteristic-zero field, and let . Then the series
converges uniquely in the filtration topology to an element of .
Facts & Assumptions
Given: A complete filtered L∞-algebra over a characteristic-zero field and an element .
Complete filtered L∞-algebra: the filtration is complete and .
Field, The characteristic of a ring: the least with when one exists, and otherwise, and Every field is a commutative ring with ; it is an integral domain, and it is a commutative division ring: in characteristic zero, each is nonzero in the field and therefore invertible.
Proof
For every , [F1] with each gives . Since has degree and has degree zero, each term lies in . By [F2], division by is defined and does not change the filtration level.
Fix . If , then , so every term of index vanishes in . Therefore the partial sums stabilize modulo once the upper index is at least .
These stabilized residues are compatible under the quotient maps , because they come from the same nested partial sums. All residues have degree one, so degreewise completeness in [F1] gives a unique element of having all these residues. The partial sums converge to it in the filtration topology.
Depends on
Used by
Dependency tree · two levels
22 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
- Jean-Louis Loday and Bruno Vallette, Algebraic Operads, §13.2 (standard reference, not scraped)