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.
Complete filtered L∞-algebra
Definition
Let be an L∞-algebra in the shifted convention of Shifted coalgebra definition of an L∞-algebra, with and corestrictions . A complete filtered L∞-algebra is this data together with a descending filtration by graded subspaces
such that both of the following conditions hold:
- For every fixed degree , the natural map from to the compatible homogeneous cosets is a bijection. Thus the filtration is separated and complete in each degree: . All graded inverse limits here and in the filtered Maurer–Cartan constructions are taken degreewise. The underlying graded space remains ; completeness does not assert convergence of sums of terms in unboundedly varying degrees.
- For every and positive integers ,
This definition imposes an algebraic filtration topology only; it makes no analytic convergence assertion. The next theorem proves that the Maurer–Cartan series converges for each .
Depends on
Used by
- The Maurer–Cartan equation alone does not specify gauge classes Counterexample
- Filtered L∞-morphism Definition
- Maurer–Cartan element of a complete filtered L∞-algebra Definition
- A finite complete filtered L∞ Maurer–Cartan equation Example
- The precise shifted L-infinity structure of a complete filtered differential graded Lie algebra Lemma
- The Maurer–Cartan series converges in a complete filtered L∞-algebra Theorem
Dependency tree · two levels
8 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)
- Tom Lada and Jim Stasheff, Introduction to sh Lie algebras for physicists, §§2–3 (standard reference, not scraped)