Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge 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.

A tensor product Hopf algebra from a group and a primitive element

Example

Let G be a group, let kG have its group-algebra Hopf structure, and let k[x] have primitive generator x. The tensor product T=kG⊗k[x] is a Hopf algebra. For g,h∈G and i,j,n≥0, (g⊗xi)(h⊗xj)=gh⊗xi+j,Δ(g⊗xn)=∑r=0n(nr)(g⊗xr)⊗(g⊗xn−r),S(g⊗xn)=g−1⊗(−x)n. Its counit is ε(g⊗xn)=1 for n=0 and 0 for n>0. In particular g⊗1 is group-like, 1⊗x is primitive, and the two tensor factors commute inside T.

Verification

Given: A group G, a field k, the group-algebra Hopf structure on kG, the primitive polynomial Hopf structure on k[x], and the tensor-product Hopf construction proved on the A page.

[F1] Hopf quotients, kernels of Hopf maps, and tensor products: for Hopf algebras H,K, the coproduct on H⊗K is (id⊗τ⊗id)(ΔH⊗ΔK), the antipode is SH⊗SK, and both antipode identities hold.

[F2] Group algebras, finite-group function algebras, and polynomial Hopf algebras: group algebras have group-like basis elements and antipode inversion, while k[x] has primitive generator x and antipode S(x)=−x.

1.1givenF1F2algebra

Applying [F1] to these two Hopf algebras gives the tensor-product Hopf structure. The tensor algebra multiplication yields (g⊗xi)(h⊗xj)=gh⊗xi+j, and it also shows that g⊗1 commutes with 1⊗x.

2.1step 1.1F1F2algebra

Since Δ(x)=1⊗x+x⊗1 and the two summands commute in k[x]⊗k[x], the binomial theorem gives Δ(xn)=∑r=0n(nr)xr⊗xn−r. Combining this with Δ(g)=g⊗g and the flipped middle factors in [F1] gives the displayed formula for Δ(g⊗xn).

3.1step 1.1step 2.1F1algebra

The tensor antipode in [F1] gives S(g⊗xn)=g−1⊗(−x)n. Directly, for the left antipode product on a basis tensor, ∑r=0n(nr)(g−1⊗(−x)r)(g⊗xn−r)=(1⊗xn)∑r=0n(nr)(−1)r, which is 1⊗1 for n=0 and 0 for n>0. The right product is (1⊗xn)∑r=0n(nr)(−1)n−r, with the same values. Thus the explicit formulas agree with both antipode equations from [F1].

4.1step 1.1F1F2algebra∎

By [F1], the tensor-product counit is εkG⊗εk[x]. The group-algebra counit has εkG(g)=1, while the polynomial counit is a unital algebra map with εk[x](x)=0 by [F2], so it takes 1=x0 to 1 and xn to 0 for n>0. Therefore ε(g⊗xn)=1 for n=0 and 0 for n>0, as claimed.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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