Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generated
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.

Filtered L∞-morphisms preserve Maurer–Cartan elements and compose on solutions

Statement

Let f:W→Z be a filtered L∞-morphism between complete filtered algebras over a characteristic-zero field. For every w∈F1W0, the Taylor series f∗(w)=∑n≥1fn(wn)/n! converges in F1Z0, and its curvature satisfies

cr(f∗(w))=∑n≥01n!fn+1(wn,cq(w)),cq(w)=∑n≥1qn(wn)n!.

Consequently f∗ defines an actual continuous map MC⁡(W)→MC⁡(Z), with Maurer–Cartan elements as in Maurer–Cartan element of a complete filtered L∞-algebra. If g:Z→T is another filtered L∞-morphism, the composite h=g∘f has Taylor coefficients

hn(x1,…,xn)=∑s=1n1s!∑(B1,…,Bs)ϵ(B1,…,Bs;x) gs(f∣B1∣(xB1),…,f∣Bs∣(xBs)),

where blocks and signs are as in Filtered L∞-morphism. The composite is filtered, and

(g∘f)∗(w)=g∗(f∗(w)).

Identity morphisms act as identities. These are equalities of convergent elements, not merely formal Taylor expressions; no quasi-isomorphism hypothesis is needed.

Facts & Assumptions

Given: Complete filtered shifted L∞-algebras over one characteristic-zero field and the stated filtered morphisms.

[F1]

Filtered Taylor maps extend to the completed coaugmented symmetric coalgebra supplies the completed coaugmented coalgebras, exponentials, curvature and marked-input identities, and continuous Taylor extensions.

[F2]

Maurer–Cartan element of a complete filtered L∞-algebra defines MC⁡(W) by w∈F1W0 and cq(w)=0.

Proof

1.1F1algebra

The series defining u=f∗(w) converges in F1Z0 by [F1]. Since FQ=RF, its exponential satisfies cr(u)eu=R(eu)=RF(ew)=FQ(ew)=F(cq(w)ew). The marked-input identity of [F1] rewrites the last expression as (∑n≥0fn+1(wn,cq(w))/n!)eu. Multiply by e−u to obtain the curvature formula. This series converges since its nth term has filtration at least n+1.

1.2F1algebra

The continuous coalgebra map GF intertwines coderivations because GFQ=GRF=SGF, where S is the coderivation on T. Its length-one projection on SnW applies gs to the length-s part of the partition formula for F, giving exactly the stated formula for hn. Every term has degree zero and additive filtration, because first the f blocks and then gs add the input filtration indices. Thus h is a filtered morphism.

2.1F1F2step 1.1algebra

If cq(w)=0, every term on the right vanishes, so cr(f∗(w))=0 and [F2] gives the asserted map on Maurer–Cartan elements. For w−v∈FpW with w,v∈F1W0, the multilinear telescoping expansion of fn(wn)−fn(vn) has in every term one input in FpW and all other inputs in F1W, so it lies in Fp+n−1Z. Hence f∗(w)−f∗(v)∈FpZ. This proves continuity in the filtration topology.

2.2F1step 1.2algebra

For repeated degree-zero w, the coefficient formula becomes hn(wn)=∑s=1n(1/s!)∑i1+⋯+is=n, ij≥1(n!/(i1!⋯is!))gs(fi1(wi1),…,fis(wis)). After dividing by n! and summing over n, the result is ∑s≥1(1/s!)gs((∑i≥1fi(wi)/i!)s)=g∗(f∗(w)). The regrouping is finite modulo FN, since each input has filtration at least one and all terms with input count at least N vanish there. Equivalently GF(ew)=G(ef∗(w))=eg∗(f∗(w)), and projection to T gives the same result.

3.1step 1.1step 2.1step 1.2step 2.2algebra∎

The identity Taylor family has only its linear term nonzero, so its Taylor pushforward is w itself. Composition is associative because composition of the continuous coalgebra maps is associative; it can also be read from refinement of the finite set partitions modulo each filtration quotient. Together with the preceding calculations this proves all the claims on actual solution sets.

Depends on

Used by

Dependency tree · two levels

6 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