Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 W be the shifted graded space of a complete filtered L∞-algebra over a characteristic-zero field, and let w∈F1W0. Then the series

∑n≥11n!qn(w,…,w)

converges uniquely in the filtration topology to an element of W1.

Facts & Assumptions

Given: A complete filtered L∞-algebra over a characteristic-zero field and an element w∈F1W0.

[F1]

Complete filtered L∞-algebra: the filtration is complete and qn(Fr1,…,Frn)⊆Fr1+⋯+rn.

Proof

1.1givenF1F2

For every n≥1, [F1] with each ri=1 gives qn(w,…,w)∈FnW. Since qn has degree +1 and w has degree zero, each term lies in FnW1. By [F2], division by n! is defined and does not change the filtration level.

2.1F1step 1.1algebra

Fix r≥1. If n≥r, then FnW⊆FrW, so every term of index n≥r vanishes in W/FrW. Therefore the partial sums stabilize modulo FrW once the upper index is at least r−1.

3.1F1step 2.1construct∎

These stabilized residues are compatible under the quotient maps W/Fr+1W→W/FrW, because they come from the same nested partial sums. All residues have degree one, so degreewise completeness in [F1] gives a unique element of W1 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