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

Coalgebra automorphisms congruent to the identity are exactly coderivation exponentials

Statement

For the coefficient-complete tensor or symmetric carrier in Coefficient-complete fixed-carrier codifferential deformation, exponential and logarithm restrict to mutually inverse bijections

F1l0 ⟷ {G: G is an allowed identity-modulo-I coalgebra automorphism}.

In particular the logarithm of every such automorphism is a continuous counital coaugmentation-preserving coderivation; no finite-dimensionality or algebraic nilpotence of I is required.

Facts & Assumptions

Given: The carrier and allowed automorphisms in the stated definition.

[F1]

Complete coderivations form a filtered differential graded Lie algebra proves completeness and multiplicativity of the endomorphism filtration and closedness of the coderivation equations.

[F2]

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

[F3]

Coefficient-complete fixed-carrier codifferential deformation specifies the carrier, explicitly completed tensor target, zero-nullary coderivation equation, and the full allowed automorphism group.

Proof

1.1F1F2F3givenconstruct

The complete degree-zero endomorphism algebra E0 and its closed degree-zero coderivation subspace are supplied by Complete coderivations form a filtered differential graded Lie algebra. Thus Exponential and logarithm in a noncommutative complete filtered algebra defines inverse exponential and logarithm series on positive-order degree-zero endomorphisms. All subsequent identities can be checked in Cn=C⊗kB/In and its tensor target and then passed to limits.

1.2F3givenconstructalgebra

Conversely, let G be allowed and N=G−id⁡. On Cn, Nn=0. Define the endomorphism-valued polynomial Pn(t)=∑j=0n−1(tj)Nj. For every nonnegative integer m, the finite binomial theorem gives Pn(m)=Gm. Since Gm is a counital coaugmented coalgebra map, ΔPn(m)=(Pn(m)⊗Pn(m))Δ, Pn(m)(1C)=1C, and ϵPn(m)=ϵ.

2.1F3step 1.1algebra

For X∈F1l0, induction on j using its coderivation equation gives ΔXj=(X⊗1+1⊗X)jΔ. The operators X⊗1 and 1⊗X commute because X has degree zero. Each is of positive coefficient order, so the exponential and binomial calculations are finite in each quotient. Consequently Δexp⁡X=(exp⁡X⊗exp⁡X)Δ. Also exp⁡X(1C)=1C and ϵexp⁡X=ϵ, because every positive power of X kills 1C and is killed by ϵ. Its inverse exp⁡(−X) has the same properties. Hence exponential gives an allowed automorphism.

2.2step 1.2algebra

Each difference in these three identities is a polynomial in t with coefficients in a k-vector space of maps. A polynomial of degree at most a with such coefficients vanishing at a+1 distinct nonnegative integers has zero coefficients: apply the inverse of their scalar Vandermonde matrix over the characteristic-zero field k. This does not require finite-dimensional map spaces or any domain property of B/In. Therefore the identities of step 1.2 hold as polynomial identities for the indeterminate t.

3.1step 2.2algebra

Differentiate those polynomial identities at t=0. Since Pn(0)=id⁡, the result is ΔPn′(0)=(Pn′(0)⊗1+1⊗Pn′(0))Δ, Pn′(0)(1C)=0, and ϵPn′(0)=0. For j≥1, differentiation of t(t−1)⋯(t−j+1)/j! at zero gives (−1)j−1/j. Thus Pn′(0)=∑j=1n−1(−1)j−1Nj/j, exactly the reduction of log⁡G.

4.1step 1.1step 2.1step 3.1∎

These reductions are compatible for all n, and the coderivation, counit, and coaugmentation identities are closed in the completed targets. Therefore log⁡G∈F1l0. Step 1.1 gives inverse identities for the underlying endomorphisms, and step 2.1 shows that every positive-order degree-zero coderivation exponentiates into the allowed group. The restrictions are therefore mutually inverse bijections onto the entire stated group.

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