Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-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.

Fixed-unit associative deformations are normalized coderivation Maurer–Cartan classes

Statement

Let (A,μ,e) be any unital associative k-algebra concentrated in degree zero, with no finite-dimensionality hypothesis. Let B,I satisfy Coefficient-complete fixed-carrier codifferential deformation, put M=lim←⁡nA⊗kB/In, and take C=Tc(A[1]). Let s:A→A[1] have degree −1. The binary Taylor map

bμ(sa,sb)=sμ(a,b)

extends to a degree-one square-zero coderivation D of CB. Let n⊆l be the coderivations whose Taylor maps vanish whenever one unsuspended argument is e. Then (F1n,[D,−],[−,−]) is a complete filtered differential graded Lie algebra.

Its Maurer–Cartan elements are exactly the continuous B-bilinear associative products μ+α on M, reducing to μ modulo I, with the same specified unit e. Its gauge classes are exactly their classes under all continuous B-linear changes of variables g≡id⁡(modI) satisfying g(e)=e, acting by

m′(a,b)=g(m(g−1a,g−1b)).

For a characteristic-zero field k, taking B=k[ ⁣[h] ⁣] and I=(h) includes the formal products a⋆b=ab+∑j≥1hjBj(a,b) with k-bilinear Bj satisfying Bj(e,a)=Bj(a,e)=0. The direct correspondence between these products and associative products, modulo strict unit-preserving changes of variables, also holds over any field; its identification with differential graded Lie Maurer–Cartan and gauge classes here requires characteristic zero. When k=R and (A,μ) is commutative, these are precisely the deformations of Coefficientwise formal associative deformations with the same fixed unit. No commutativity is required of the deformed products in the general theorem.

The exact extension to a graded product of degree zero, with the same cohomological suspension, is bμ(sa,sb)=(−1)∣a∣sμ(a,b). The statement about strict product classes above concerns ordinary degree-zero A; for graded A higher Taylor components can have degree zero and strict changes of variables require the unary subgroup.

Facts & Assumptions

Given: The unital associative algebra, coefficient-complete carrier, and specified unit in the statement.

[F1]

Coefficient-complete fixed-carrier codifferential deformation specifies the coefficient-completed tensor carrier, completed tensor powers, continuous coderivations, and allowed equivalences.

[F2]

Complete coderivations form a filtered differential graded Lie algebra proves commutator closure, the differential identities for square-zero D, and completeness of closed filtered coderivation subspaces.

[F3]

Exponential and logarithm in a noncommutative complete filtered algebra proves the inverse convergent noncommutative exponential/logarithm series and conjugation formula.

[F4]

Coalgebra automorphisms congruent to the identity are exactly coderivation exponentials proves that exponentiating a positive-order degree-zero coderivation gives a coalgebra automorphism and that all allowed automorphisms have coderivation logarithms.

[F5]

Maurer–Cartan classes classify fixed-carrier codifferential deformations proves the complete variable-parameter gauge-flow/conjugation correspondence in both directions.

[F6]

Coefficientwise formal associative deformations specifies formal associative products only for a commutative unital real algebra, using real-bilinear coefficient maps and coefficientwise fixed-unit normalization.

Proof

1.1F1givenconstructalgebra

Put VB=lim←⁡n(A[1]⊗kB/In) and VB⊗^r=lim←⁡n((A[1])⊗r⊗kB/In). A continuous homogeneous positive-arity Taylor map f:VB⊗^r→VB of degree u extends by inserting f in every consecutive block of a word, with sign (−1)u(∣v1∣+⋯+∣vi−1∣) for a block starting at i. Each word has only finitely many such blocks. Splitting the output word shows the coderivation equation: the replaced block lies entirely on one side of a coproduct split, and its insertion sign agrees with that side's graded tensor action. Thus these formulas define the coderivation and extend continuously through coefficient completion. Conversely, applying the iterated reduced coproduct and projecting every factor to length one expresses the length-j component of a coderivation as the sum with its length-one projection on one of the j input factors. Its other components are the untouched factors. This follows by iterating the coderivation equation. It determines every length component uniquely, and proves there is no output of length greater than the input length because all j factors must be nonempty. The argument holds at each coefficient quotient and then in the limit. Thus these Taylor maps give every coaugmented counital coderivation uniquely.

2.1F2step 1.1algebra

For clarity first allow graded A and a degree-zero product. With ∣sa∣=∣a∣−1, the binary map bμ(sa,sb)=(−1)∣a∣sμ(a,b) has degree one and equals −sμ(s−1⊗s−1), since the tensor-map sign on (sa,sb) is (−1)∣a∣−1. Its insertion extension from step 1.1 is therefore precisely fixed, including signs. Its square is a coderivation because bμ2=[bμ,bμ]/2 and coderivations are closed under graded commutators by Complete coderivations form a filtered differential graded Lie algebra. Its only possibly nonzero Taylor projection has arity three and is (−1)∣b∣s(μ(μ(a,b),c)−μ(a,μ(b,c))). Indeed the first association has sign (−1)∣a∣+∣a∣+∣b∣, and the second has sign (−1)∣a∣−1+∣b∣+∣a∣. Thus its square is zero exactly when the product is associative.

3.1F1step 1.1step 2.1algebra

Return to degree-zero A, so A[1] has degree −1 and the displayed binary sign is +1. A Taylor map of degree u from arity r to length one can be nonzero only when −r+u=−1, namely u=r−1. Thus every degree-one coderivation is binary and every degree-zero coderivation is unary. Step 2.1 proves that D=bμ is square-zero, and the same computation proves that a degree-one R=bα satisfies (D+R)2=0 exactly when μ+α is associative. A continuous bilinear map is understood on M⊗^BM=lim←⁡n(A⊗2⊗kB/In); the condition R∈F1 says its coefficient image lies in F1M. No naive algebraic tensor of a Hom space with I is used.

4.1step 1.1step 3.1algebra

For an ordinary r-cochain f, denote the Taylor coderivation with projection qf(sa1⊗⋯⊗sar)=sf(a1,…,ar) by qf; it has degree r−1. Call f normalized when any argument e makes it zero. A Taylor insertion contributing to qfqg has the form f(a1,…,g(ai,…,ai+t−1),…,ar+t−1), up to its specified sign. If a unit argument lies inside the inserted block, g vanishes; if outside, a remaining argument of f is the unit and f vanishes. Thus every insertion of normalized cochains is normalized separately, and so are their commutators. Evaluation with any input fixed to e is a closed continuous condition. Hence n is a closed graded Lie subalgebra with the inherited additive filtration bound.

4.2step 1.1step 3.1algebra

A degree-zero coalgebra map G on this carrier is determined by its length-one projection, and that projection can be nonzero only on arity one, since all inputs of arity r have degree −r and B has degree zero. To justify the determination explicitly, apply the iterated coproduct of G and project its j outputs to length one; the resulting length-j component is the j-fold tensor of the length-one projection applied to the iterated coproduct of the input. Coaugmentation and counit fix the length-zero part. Hence G=Tc(g) for the unary map g:M→M; it is an allowed automorphism exactly when g is continuous, invertible, and congruent to the identity modulo I. Conversely that tensor extension is a coalgebra automorphism by deconcatenation, with inverse Tc(g−1).

5.1step 1.1step 4.1algebra

Although bμ is not normalized, its commutator preserves normalization. Write the usual Hochschild differential as (δμf)(a1,…,ar+1)=a1f(a2,…,ar+1)+∑i=1r(−1)if(a1,…,aiai+1,…,ar+1)+(−1)r+1f(a1,…,ar)ar+1. The insertion convention gives exactly π1[bμ,qf](sa1,…,sar+1)=(−1)r−1s(δμf)(a1,…,ar+1). Indeed the left outer product has coefficient (−1)r−1, from moving qf past sa1; the right outer product has coefficient +1; and the i-th adjacent multiplication term in −(−1)r−1qfbμ has coefficient (−1)r+i−1. These are exactly the asserted common sign times the Hochschild coefficients.

5.2F3F4step 4.2algebra

A degree-zero X∈F1n is qξ for a continuous unary ξ with ξ(e)=0. Since ξj(e)=0 for all j≥1, g=exp⁡ξ fixes e. Conversely if g≡id⁡(modI) fixes e, then (g−id⁡)(e)=0 and every positive power does too, so log⁡(g)(e)=0. Both series converge by Exponential and logarithm in a noncommutative complete filtered algebra, applied to the unary complete endomorphism algebra or to length one in CB. Also exp⁡(qξ)=Tc(exp⁡ξ): the left side is a coalgebra map by Coalgebra automorphisms congruent to the identity are exactly coderivation exponentials, has unary projection exp⁡ξ, and is determined by that projection by step 4.2. Applying the inverse logarithm proves log⁡(Tc(g))=qlog⁡(g). Consequently exponentials of F1n0 give exactly all the required unit-preserving changes of variables, including the reverse implication that exp⁡ξ(e)=e forces ξ(e)=0.

6.1F2step 4.1step 5.1algebra

If the unit occurs at an interior position 2≤j≤r, the adjacent multiplication terms i=j−1 and i=j in δμf have identical remaining arguments and opposite signs; every other term retains the unit inside f and vanishes. If j=1, the first outer product term cancels the i=1 multiplication term, using ef=f. If j=r+1, the i=r multiplication term cancels the last outer product term, using fe=f. In both endpoint cases all remaining terms vanish by normalization. These arguments also include r=1, where only the endpoint cases occur. Thus δμ preserves normalization and [D,n]⊆n. Closedness in step 4.1 and Complete coderivations form a filtered differential graded Lie algebra now give a degreewise complete filtered differential graded Lie algebra F1n.

7.1step 2.1step 3.1step 5.1step 6.1algebra

By the direct identity (D+R)2=[D,R]+[R,R]/2 and the preceding binary degree and associativity computations, its Maurer–Cartan elements are exactly associative products μ+α with the specified reduction and with α normalized. Since μ(e,a)=a=μ(a,e), normalization is equivalent to (μ+α)(e,a)=a=(μ+α)(a,e). Conversely any continuous fixed-unit product with this reduction has such a normalized difference α. Hence the claimed object correspondence holds in both directions. In particular at arity two the differential sign is π1[D,bα]=−sδμα, while π1[bα,bα]/2=s(α(α(a,b),c)−α(a,α(b,c))), so its suspended Maurer–Cartan equation is exactly the expanded associator, with no implicit sign convention.

8.1step 7.1step 4.2step 5.2algebra

On binary Taylor projections, conjugation by G=Tc(g) gives bm′ with m′(a,b)=g(m(g−1a,g−1b)). If m has unit e and g(e)=e, then m′(e,a)=a=m′(a,e); reduction modulo I remains μ. Thus the full subgroup just identified acts on exactly the fixed-unit products in step 7.1, by the stated ordinary transport formula.

9.1F5step 6.1step 5.2step 8.1algebra

The gauge and conjugation proof in Maurer–Cartan classes classify fixed-carrier codifferential deformations restricts to this normalized subalgebra. In detail its variable unary parameter ξ(t) satisfies ξ(t)e=0, and its solution g′=ξ(t)g, g(0)=id⁡ has (g(e)−e)′=ξ(t)(g(e)−e) with zero initial value. The same coefficient-order integral induction proves g(e)=e. Hence every normalized gauge path has an actual unit-preserving endpoint automorphism. Conversely any allowed unit-preserving g has normalized log⁡(g) by step 5.2, and exp⁡(tlog⁡(g)) fixes e and gives a normalized gauge path. Therefore normalized gauge equivalence is precisely the entire fixed-unit change-of-variables equivalence, rather than merely the unrestricted codifferential equivalence.

10.1F1F6step 2.1step 3.1step 4.2step 7.1step 8.1step 9.1constructalgebra∎

Finally for B=k[ ⁣[h] ⁣], a continuous coefficient-complete bilinear map is uniquely its sequence of coefficient maps Bj:A⊗A→A: apply it to constant inputs and expand each output in A[ ⁣[h] ⁣], then use k[ ⁣[h] ⁣]-linearity and continuity. Every sequence conversely defines such a map because only finitely many coefficients contribute modulo hn. Reduction fixes the zero coefficient to μ, and normalization is coefficientwise Bj(e,a)=Bj(a,e)=0. In characteristic zero, step 7.1's object bijection and step 9.1's full equivalence correspondence therefore apply to these formal products. When k=R and A is commutative, the coefficients are exactly the real-bilinear maps in [F6], the coefficientwise Cauchy sums are finite at every ℏ-order, and the fixed-unit normalization agrees. This is the stated supplier specialization; no additional condition on the general theorem is imported. The any-field assertion about formal products and strict coordinate changes also has a direct argument independent of the characteristic-zero exponential and logarithm: expanding the consecutive-insertion square of the binary suspended product bm cancels the disjoint insertions in pairs, leaving exactly the signed associator. Thus bm2=0 is equivalent to associativity over every field, including characteristic two, without dividing by 2. The degree argument in step 3.1 and deconcatenation in step 4.2 identify strict degree-zero coalgebra changes with Tc(g), and step 8.1 computes their transport action without integer denominators. These product and strict-coordinate-change assertions therefore extend to any field. Their identification with differential graded Lie Maurer–Cartan and exponential gauge classes retains the characteristic-zero hypothesis of [F1], under which the required halves, factorials and logarithmic denominators are defined.

Depends on

Used by

Dependency tree · two levels

17 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