Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicable
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∞-morphism

Definition

Let W=V[1] and Z=U[1] be the shifted spaces of two complete filtered L∞-algebras over the same characteristic-zero field, in the convention of Complete filtered L∞-algebra. Write Q,R for their degree-one square-zero coderivations and qn,rn for their corestrictions. A filtered L∞-morphism from W to Z consists of degree-zero graded symmetric maps fn:SnW→Z, n≥1, with

fn(Fi1W,…,FinW)⊆Fi1+⋯+inZ(ij≥1),

whose associated coaugmented coalgebra map F:k⊕Sc(W)→k⊕Sc(Z) satisfies FQ=RF, after extending Q,R by Q(1)=R(1)=0. There is no constant Taylor coefficient: F(1)=1. Explicitly, for homogeneous inputs,

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

The inner sum runs over ordered partitions of {1,…,n} into nonempty blocks. Inside each block retain the original input order; ϵ is the Koszul sign of the permutation which lists those blocks in the indicated order. The factor 1/s! removes ordering of the graded symmetric output blocks. The length-one projection of F on SnW is fn.

The composite of f:W→Z and g:Z→T has associated map GF; its Taylor coefficients are the length-one projections of GF. The identity has f1=id⁡ and fn=0 for n>1. These definitions do not require F1W=W. The complete positive-filtration subalgebra P=F1W is the space on which completed exponentials and Maurer–Cartan sums will be used; it need not be an ideal in W.

Depends on

Used by

Dependency tree · two levels

2 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