Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adapted
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 Taylor maps extend to the completed coaugmented symmetric coalgebra

Statement

Let f:W→Z be a filtered L∞-morphism as in Filtered L∞-morphism, and put P=F1W, P′=F1Z. On C(P)=⨁n≥0SnP, including S0P=k⋅1, use the symmetric multiplication and the counital coproduct

Δ(x1⋯xn)=∑I⊔J={1,…,n}ϵ(I,J;x)xI⊗xJ.

Empty subsets are allowed. Define FNC(P) as the span of products x1⋯xn with xj∈FijW, all ij≥1, and ∑jij≥N; scalars have weight zero. Define the completed coaugmented symmetric coalgebra

C^(P)=lim←⁡NC(P)/FNC(P).

All completions and limits are degreewise. Complete tensor products for coproducts with the sum of the two weight filtrations. Then multiplication, coproduct, counit and coaugmentation extend continuously, as do Q and the Taylor map F. Their continuous extensions satisfy Q2=0, ΔF=(F⊗^F)Δ, and FQ=RF. The length-one projection extends continuously to pP:C^(P)→P.

For w∈P0 and homogeneous v∈FpW, p≥1, define the convergent expressions

ew=∑n≥0wnn!,cq(w)=∑n≥1qn(wn)n!,u=f∗(w)=∑n≥1fn(wn)n!.

They satisfy

Δew=ew⊗ew,ewe−w=1,Q(ew)=cq(w)ew,F(ew)=eu,

and the marked-input identity

F(vew)=(∑n≥0fn+1(wn,v)n!)eu.

This is a total filtration weight completion on the positive-filtration subalgebra, not an unspecified product by symmetric arity on all of W.

Facts & Assumptions

Given: Complete filtered shifted L∞-algebras over a characteristic-zero field and a filtered Taylor morphism between them.

[F1]

Filtered L∞-morphism supplies the filtration bounds, the finite Taylor partition formula, FQ=RF, and the complete filtered algebra convention.

[F2]

The graded shuffle coproduct is coassociative, cocommutative, and conilpotent proves that primitives of the algebraic graded symmetric coalgebra are exactly its length-one part.

Proof

1.1F1constructalgebra

The subalgebra P=F1W is complete and separated in each fixed degree for its induced filtration: a compatible homogeneous family of one fixed degree in P/FNW defines a compatible family in W/FNW, whose unique lift lies in the kernel of W→W/F1W, namely P. The same argument applies degreewise and to P′. Products and coproducts preserve total weight: for a product weights add, and a split of a monomial preserves the sum of the two output weights. They therefore extend to the inverse limits and their completed tensor targets, retaining the algebra and coalgebra identities since these hold on the dense uncompleted subspaces. Scalars, the counit and the coaugmentation extend as well. The length-one projection takes FNC(P) into FNW, so it extends to P.

2.1F1step 1.1algebra

On C(P) the coderivation formula is Q(1)=0 and Q(x1⋯xm)=∑∅≠I⊆{1,…,m}ϵ(I,Ic;x)q∣I∣(xI)xIc. Each term has at least the input's total weight by the bound on q∣I∣. Thus Q is continuous and extends. The coderivation identity can be checked by selecting the nonempty distinguished block acted on by q and distributing all remaining factors to the two coproduct outputs; both sides make precisely these selections. The Koszul signs agree, including the sign from moving the degree-one Q across the left output when it acts on the right output. The given Q2=0 continues to hold by density and continuity.

3.1F1F2step 1.1step 2.1algebra

The partition formula for F is finite on each monomial and preserves its total weight. In ΔF, split the output blocks between the two tensor factors. In (F⊗F)Δ, first split the inputs into the unions of those two groups and then partition each union. These choices are in bijection; the binomial number of ways of splitting ordered output blocks changes 1/s! to the product of the two output factorial coefficients. Both signs implement the same permutation of input factors. This proves the coalgebra identity directly and shows that the length-one corestrictions are exactly fn. The finite coalgebra map is determined uniquely by these corestrictions: induct on input length, subtract two such maps and use the reduced coproduct; their difference on the next input has zero reduced coproduct and hence is primitive, so lies in the length-one summand, where its projection is zero. The primitive assertion is exactly [F2], whose proof composes the singleton coproduct component with multiplication to give s times the identity on length s>1; characteristic zero makes that coefficient invertible. The weight bound extends F continuously, and FQ=RF extends from the dense subspace. Uniqueness of each continuous extension follows from separatedness of the target.

4.1F1step 1.1step 3.1algebra

The term wn/n! has total weight at least n, and each of qn(wn)/n! and fn(wn)/n! lies in filtration n. All three series therefore stabilize modulo every filtration quotient and converge uniquely. The series with marked input v has its nth coefficient in filtration p+n. In characteristic zero the factorials are invertible. Every reordering of these sums is finite modulo total weight N, so it is legitimate in the inverse limit. The binomial coproduct expansion gives Δew=ew⊗ew, and the binomial multiplication expansion gives ewe−w=1.

5.1step 2.1step 3.1step 4.1algebra

In Q(wm) the choice of a distinguished block of size i has multiplicity m!/(i!(m−i)!). As w has degree zero all such signs are positive. Divide by m! and sum to obtain Q(ew)=(∑i≥1qi(wi)/i!)ew=cq(w)ew. For F(wm), an ordered partition of block sizes i1,…,is occurs m!/(i1!⋯is!) times. Summing its partition formula after division by m! gives F(ew)=∑s≥0(1/s!)(∑i≥1fi(wi)/i!)s=eu.

6.1step 3.1step 4.1step 5.1algebra∎

To evaluate F(vew) distinguish the unique output block containing v. Choose its n unmarked inputs and apply fn+1(wn,v); the sum over partitions of all remaining inputs is eu by step 5.1. The factorials reduce to 1/n! on the marked block and the usual output factorial on the other blocks. Moving v or the marked output past copies of the degree-zero w or u produces no signs. This gives the stated marked-input identity, with convergence from step 4.1, and completes all assertions.

Depends on

Used by

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