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

Unsuspended A∞ identities are tensor codifferentials with explicit suspension signs

Statement

Let A be a graded vector space over a field and let mn:A⊗n→A have degree 2−n, n≥1. Use the Koszul tensor-map convention of Koszul sign rule for graded tensor products and permutations. Write X=A[1], Xj=Aj+1, and let sA:A→X have degree −1 with inverse uA of degree +1. Put cn=n(n−1)/2 and define

bn=(−1)cnsAmnuA⊗n:X⊗n⟶X.

Equivalently bnsA⊗n=sAmn and mn=uAbnsA⊗n. Each bn has degree one. On homogeneous elements this formula reads

bn(sAa1,…,sAan)=(−1)∑j=1n(n−j)∣aj∣sAmn(a1,…,an).

Define the reduced tensor coalgebra Tc(X)=⨁n≥1X⊗n with reduced deconcatenation, and its coaugmented version T+c(X)=k⋅1⊕Tc(X) with

Δ(x1⋯xN)=∑i=0N(x1⋯xi)⊗(xi+1⋯xN).

Empty words mean 1. The bn extend uniquely to a degree-one coderivation B:T+c(X)→T+c(X) with B(1)=0, zero counit and corestrictions bn. Explicitly

B∣X⊗N=∑r+s+t=Nr,t≥0, s≥11⊗r⊗bs⊗1⊗t.

Then B2=0 if and only if the mn satisfy precisely the unsuspended A∞ identities of Uncurved cohomological A∞-algebra in the unsuspended convention, with sign (−1)r+st in every arity. This gives a bijection between those uncurved structures and such square-zero coderivations. The same correspondence holds after removing the coaugmentation summand. No arity-zero operation or tensor completion is included.

Moreover, for structures on A,D and homogeneous maps fn:A⊗n→D of degree 1−n, define degree-zero maps

Fn=(−1)cnsDfnuA⊗n.

They extend uniquely to a coaugmentation- and counit-preserving coalgebra map F:T+c(A[1])→T+c(D[1]), and FBA=BDF if and only if f satisfies exactly A∞-morphism and quasi-isomorphism, including its right-hand sign

η(i1,…,iq)=∑j=1q−1(q−j)(ij−1).

Composition of these coalgebra maps corresponds to the unsuspended Taylor composition hN=∑q, i1+⋯+iq=N(−1)ηgq(fi1⊗⋯⊗fiq). In particular the correspondence respects identities.

The fixed signs give b1=sAm1uA and b2=−sAm2(uA⊗uA). The latter is an equality of graded maps: evaluated on sAa⊗sAb it is (−1)∣a∣sAm2(a,b). Replacing every bn simultaneously by −bn preserves both the square-zero condition and the morphism equation when done on both algebras; changing just one arity is not part of this correspondence.

Facts & Assumptions

Given: The graded spaces, positive-arity operation and morphism families, suspension maps and tensor convention in the statement.

[F1]

Uncurved cohomological A∞-algebra in the unsuspended convention fixes ∣mn∣=2−n and the identities ∑r+s+t=N(−1)r+stmr+1+t(1⊗r⊗ms⊗1⊗t)=0.

[F2]

A∞-morphism and quasi-isomorphism fixes ∣fn∣=1−n and the morphism identities with signs r+st on the left and η on the right.

[F3]

Koszul sign rule for graded tensor products and permutations gives (p⊗q)(x⊗y)=(−1)∣q∣∣x∣p(x)⊗q(y) and its iterated form.

Proof

1.1F3algebra

Applying [F3] to the composite tensor maps gives uA⊗nsA⊗n=(−1)cnid⁡ and sA⊗nuA⊗n=(−1)cnid⁡. Thus the displayed formulas for mn and bn are mutually inverse. The degree of bn is −1+(2−n)+n=1. On inputs sAaj the tensor map uA⊗n contributes exponent ∑j(n−j)(∣aj∣−1); adding cn=∑j(n−j) gives the stated evaluation formula. For Fn exactly the same computation gives degree zero, inverse fn=uDFnsA⊗n, and evaluation Fn(sAa1,…,sAan)=(−1)∑j(n−j)∣aj∣sDfn(a1,…,an).

1.2F3constructalgebra

More generally any degree-d maps vn:X⊗n→X extend by the consecutive insertion formula V(1)=0, V(x1⋯xN)=∑r+s+t=N(−1)d∑j≤r∣xj∣x1⋯xrvs(xr+1,…,xr+s)xr+s+1⋯xN. It is finite on every word, has zero counit, and satisfies ΔV=(V⊗1+1⊗V)Δ. Indeed a cut of the output word is either before or after the single replaced block. These choices correspond respectively to acting on the suffix or prefix at the corresponding cut of the input word; the Koszul sign on 1⊗V accounts for moving V across the prefix. Coaugmentation terms satisfy the same equation because V(1)=0.

2.1step 1.2algebra

These extensions are unique. For a coderivation with zero counit and zero corestrictions, assume inductively it vanishes on shorter nonempty words. Its coderivation identity on a word of length N then says that its value has zero reduced coproduct, so is primitive. In a tensor coalgebra with zero scalar part, a primitive lies in X: for each component of length j>1, the reduced coproduct component X⊗X⊗(j−1) is the canonical injective splitting of that component, hence cannot vanish unless it does. The primitive value has zero length-one projection by the corestriction hypothesis, hence is zero. This proves the induction, starting at length one. In particular the insertion extension defines the asserted unique B without any cofree assertion left unproved.

2.2F3step 1.1algebra

Fix r+s+t=N, put k=r+1+t, and compare one projected term with sAmk(1⊗r⊗ms⊗1⊗t)uA⊗N. Evaluating on sAa1,…,sAaN by [F3] cancels all input-dependent sign differences: the inner insertion on suspended inputs contributes ∑j≤r(∣aj∣−1), the inner tensor of uA contributes ∑j=1s(s−j)(∣ar+j∣−1), and the outer tensor of uA uses the middle unsuspended output degree ∑j=1s∣ar+j∣+2−s with coefficient t. On the comparison map the corresponding input insertion sign is (2−s)∑j≤r∣aj∣ after applying uA⊗N. Subtracting these exponents leaves the input-independent difference D=−r−cs−ck+t(2−s)+cN, in addition to the prefactor cs+ck from the two b maps. Hence the total difference is cN−r+t(2−s), congruent to cN+r+st modulo two. We have proved in every arity the exact map identity bk(1⊗r⊗bs⊗1⊗t)=(−1)cN+r+stsAmk(1⊗r⊗ms⊗1⊗t)uA⊗N.

2.3F3step 1.1algebra

On the right write pj=i1+⋯+ij−1, and evaluate a fixed block term on sAa1,…,sAaN. The suspended coefficient has exponent E=∑j∑ℓ=1ij(ij−ℓ)∣apj+ℓ∣+∑j(q−j)(∑ℓ=1ij∣apj+ℓ∣+1−ij), by step 1.1 applied first to the F blocks and then to bqD. The comparison map sDmqD(fi1⊗⋯⊗fiq)uA⊗N has exponent E′=∑h=1N(N−h)∣ah∣−cN+∑j(1−ij)∑h≤pj∣ah∣. For the input in position pj+ℓ, both exponents have coefficient ij−ℓ+q−j; this follows in E′ by replacing the remaining tail length with ∑v>jiv. Their difference is thus E−E′=cN+∑j(q−j)(1−ij), congruent to cN+η(i1,…,iq). This proves bqD(Fi1⊗⋯⊗Fiq)=(−1)cN+ηsDmqD(fi1⊗⋯⊗fiq)uA⊗N.

3.1F3step 1.2step 2.1algebra

The square of a degree-one coderivation is again a coderivation: expand (B⊗1+1⊗B)2 and use [F3]; the mixed terms are B⊗B and −B⊗B and cancel over any field. It has zero counit and vanishes on 1. Its length-one projection on X⊗N is therefore ∑r+s+t=Nbr+1+t(1⊗r⊗bs⊗1⊗t). By uniqueness from step 2.1, B2=0 is equivalent to the vanishing of all these projections.

3.2F3step 1.1step 2.1constructalgebra

For degree-zero corestrictions Fn define F(1)=1 and F(x1⋯xN)=∑q=1N∑i1+⋯+iq=N, ij≥1Fi1(x1,…,xi1)⊗⋯⊗Fiq(xN−iq+1,…,xN). There is no factorial because blocks are consecutive and ordered. A deconcatenation cut of this output is between two output blocks, and corresponds to a cut of the input together with consecutive partitions of its two pieces. Therefore ΔF=(F⊗F)Δ; no additional map-interchange sign occurs because the Fn have degree zero. This defines a counit- and coaugmentation-preserving coalgebra map. Uniqueness follows by induction on input length: two maps agreeing on shorter words and on their corestrictions have primitive difference on the next word, and step 2.1 makes that difference zero.

3.3F3step 1.1step 2.2algebra

On the left, the sign calculation of step 2.2 is unchanged when the outer mk is replaced by fk: that calculation uses the degree 2−s of the inner operation, and its outer input degrees, not the degree of the outer operation. It gives Fk(1⊗r⊗bsA⊗1⊗t)=(−1)cN+r+stsDfk(1⊗r⊗msA⊗1⊗t)uA⊗N.

4.1F1step 1.1step 2.1step 3.1step 2.2algebra

Summing the identity of step 2.2 factors out the invertible outer maps sA,uA⊗N and the common sign (−1)cN. The resulting equation is exactly [F1]. Steps 1.1 and 3.1 thus prove both implications and the structure bijection, with no characteristic restriction or division. All the insertion and uniqueness arguments restrict to the reduced coalgebra, and extending a reduced coderivation by zero on 1 recovers its unique counital coaugmented version. This proves the structure assertion, including the absence of nullary terms.

4.2F3step 1.2step 2.1step 3.2algebra

The map DF=FBA−BDF vanishes on 1, has zero counit, and obeys ΔDF=(DF⊗F+F⊗DF)Δ. This follows by expanding the coderivation and coalgebra-map identities, using degree zero for F. If all length-one corestrictions of DF vanish, induction on input length makes all its values primitive and then zero, exactly as in step 2.1. Consequently FBA=BDF is equivalent to equality of their length-one projections in every arity. The left projection is ∑r+s+t=NFk(1⊗r⊗bsA⊗1⊗t) and the right is ∑q, i1+⋯+iq=NbqD(Fi1⊗⋯⊗Fiq).

5.1F2step 1.1step 3.2step 4.2step 3.3step 2.3algebra

Equating the two projections from step 4.2 and substituting the two sign comparisons cancels their common invertible maps and sign (−1)cN. What remains is precisely [F2], including its actual right-hand exponent η. Conversely those identities give zero projections, hence the full coalgebra equation by step 4.2. The coefficient transformations in step 1.1 are invertible, and step 3.2 gives unique coalgebra extensions, so this is a bijection on the native morphisms as asserted.

6.1F3step 1.1step 3.2step 2.3algebra∎

For a second family g the length-one projection of GF is the sum of Gq(Fi1⊗⋯⊗Fiq). The sign calculation of step 2.3 only uses the degrees 1−ij of the inner f maps and the input evaluation formula for the outer suspended map. Replacing the outer mqD by gq therefore gives the same sign cN+η. Desuspending by the inverse transformation from step 1.1 yields the stated composition coefficients. The identity coalgebra map has only F1=id⁡, which desuspends to f1=id⁡ and fn=0 for n>1. Finally the explicit arity-one and arity-two formulas follow from c1=0,c2=1; the degree of sAa makes the binary evaluation sign (−1)∣a∣. Simultaneously negating all coderivation coefficients negates B, so leaves B2=0 and FBA=BDF unchanged when done on both sides. This establishes all sign and compatibility claims.

Depends on

Used by

Dependency tree · two levels

7 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