Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

Graded coalgebras, bialgebras and Hopf algebras over a commutative ring

Definition

Let k be a commutative ring and let H=⨁n≥0Hn be a nonnegatively graded k-module (Nonnegatively graded rings and modules, homogeneous elements, and twists). A graded k-algebra structure on H consists of a k-bilinear associative multiplication m:H⊗kH→H and a unit k-algebra map u:k→H such that m(Hi⊗Hj)⊆Hi+j and u(k)⊆H0 (Algebras over a commutative ring, central structure maps, and algebra homomorphisms).

A graded coalgebra structure on H consists of k-linear maps Δ:H→H⊗kH and ε:H→k, where k is concentrated in degree 0, such that Δ has degree 0, ε(Hn)=0 for n>0, and

(id⁡⊗Δ)Δ=(Δ⊗id⁡)Δ,(ε⊗id⁡)Δ=id⁡=(id⁡⊗ε)Δ,

using the canonical identifications k⊗kH≅H≅H⊗kk (The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums). Here degree 0 means Δ(Hn)⊆⨁a+b=nHa⊗kHb.

If H is both a graded algebra and a graded coalgebra and Δ and ε are k-algebra homomorphisms, then H is a graded bialgebra. Equivalently, the multiplication and unit maps m and u are morphisms of graded coalgebras: on H⊗kH use the tensor-product algebra structure (a⊗b)(c⊗d)=ac⊗bd and the tensor-product coalgebra structure with comultiplication (id⁡⊗τ⊗id⁡)(Δ⊗Δ) and counit ε⊗ε, where τ(b⊗c)=c⊗b (The tensor product of R-algebras has multiplication (a⊗b)(a′⊗b′)=aa′⊗bb′, Symmetry and associativity isomorphisms for tensor products over a commutative ring). Indeed, the coalgebra-map identities for m are exactly Δ(ab)=Δ(a)Δ(b) and ε(ab)=ε(a)ε(b), while the identities for u are exactly Δ(1H)=1H⊗1H and ε(1H)=1; these are the multiplicativity and unit equations for Δ and ε. The bialgebra is connected when the unit map restricts to an isomorphism u:k→∼H0; this is the precise meaning of H0=k⋅1H used for connected graded bialgebras.

For f,g∈Hom⁡k(H,H), their convolution product is f∗g:=m(f⊗g)Δ. It is associative: its two iterated products are obtained from (Δ⊗id⁡)Δ and (id⁡⊗Δ)Δ followed by m(m⊗id⁡) and m(id⁡⊗m), respectively, which agree by coassociativity and associativity. Its unit is uε, since the two counit identities give (uε)∗f=f=f∗(uε). Thus convolution makes Hom⁡k(H,H) a unital associative k-algebra.

An antipode is a k-linear map S:H→H satisfying

m(S⊗id⁡)Δ=uε=m(id⁡⊗S)Δ;

equivalently, S is a two-sided convolution inverse of id⁡H. A graded bialgebra equipped with an antipode is a graded Hopf algebra. If k is a field and H is commutative, forgetting the grading gives the usual commutative Hopf-algebra data: the same multiplication, unit, comultiplication, counit and antipode satisfy the same equations, and the antipode is multiplicative. For the latter claim, S(1)=1 follows by evaluating the antipode identity at 1. Give Hom⁡k(H⊗kH,H) its convolution product from the tensor-product coalgebra structure and multiplication of H. Since m is a coalgebra map, S∘m is a two-sided convolution inverse of m. The map G=m(S⊗S)τ is another: for a,b∈H, its convolution product with m in either order is ε(a)ε(b)1, since the Sweedler components reorder by commutativity and the two antipode identities give ∑S(a(1))a(2)=ε(a)1=∑a(1)S(a(2)) and the corresponding identities for b. Uniqueness of a two-sided inverse gives S(ab)=S(b)S(a)=S(a)S(b). No commutativity of H, field hypothesis, or choice principle is required for the definitions above.

Depends on

Used by

Dependency tree · two levels

18 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