Blog Archive

Wednesday, September 9, 2026

Group-like Elements as Points: Monoidal Adjunctions from Coalgebras to Hopf Algebras

 

Group-like Elements as Points: From Coalgebras to Groups

There is a small construction in coalgebra theory that becomes much more interesting once it is viewed categorically.

Let k be a field and let Coalgk denote the category of counital coassociative k-coalgebras. For a coalgebra C, recall that an element gC is called group-like if

Δ(g)=gg,ε(g)=1.

Write

G(C)={gCΔ(g)=gg, ε(g)=1}.

At first sight, G(C) is simply a distinguished subset of the underlying vector space of C. But the defining equations suggest something more structural. They say precisely that g behaves like the unique basis element of the one-dimensional coalgebra k.

This turns group-like elements into points, the group-like functor into a representable functor, and eventually leads to an adjunction between groups and Hopf algebras.


Group-like elements as coalgebraic points

Regard k itself as a coalgebra by

Δk(1)=11,εk(1)=1.

A linear map

f:kC

is completely determined by the vector

g=f(1).

For f to be a coalgebra morphism, we must have

ΔCf=(ff)Δk

and

εCf=εk.

Evaluating at 1 gives

ΔC(g)=gg,εC(g)=1.

Thus

gG(C)

if and only if the corresponding map

kC

is a coalgebra morphism.

Therefore there is a natural bijection

G(C)Coalgk(k,C),

and hence

GCoalgk(k,).

So G is representable.

This gives a useful reinterpretation of the usual definition. A group-like element is not merely a vector satisfying two equations. It is a coalgebraic point

kC.

The equations are simply what the statement “this map is a coalgebra morphism” looks like after choosing the element 1k.


From sets to coalgebras

There is a natural construction in the opposite direction.

Given a set X, let

k[X]=xXkx

be the free vector space on X. Declare each basis vector to be group-like:

Δ(x)=xx,ε(x)=1.

Extending linearly gives a coalgebra structure on k[X].

Indeed,

(Δ1)Δ(x)=xxx=(1Δ)Δ(x),

and the counit identities are immediate.

A function

u:XY

extends linearly to

k[u]:k[X]k[Y].

Since basis elements are sent to basis elements, and hence to group-like elements, this is automatically a coalgebra morphism.

Thus we obtain a functor

k[]:SetCoalgk.

It is the ordinary free vector space functor, but equipped with the coalgebra structure for which the distinguished basis consists entirely of group-like elements.


The basic adjunction

Suppose that

F:k[X]C

is a coalgebra morphism.

Since every xX is group-like in k[X], its image F(x) must be group-like in C. Hence restriction to the basis gives a function

XG(C).

Conversely, given any function

f:XG(C),

the universal property of the free vector space produces a unique linear extension

f~:k[X]C.

Since every f(x) is group-like,

Δ(f~(x))=f(x)f(x)=(f~f~)Δ(x),

and

ε(f~(x))=1.

Thus f~ is a coalgebra morphism.

We obtain a natural bijection

Coalgk(k[X],C)Set(X,G(C)).

Therefore

k[]G.

This already gives a satisfying interpretation of the two functors:

Xthe coalgebra freely spanned by group-like points,

while

Cthe set of coalgebraic points of C.

Recovering the original set

The unit of this adjunction is particularly simple.

Every element xX is group-like in k[X], so there is a canonical map

XG(k[X]).

In fact this is a bijection.

Let

g=xaxx

be group-like. Then

Δ(g)=xaxxx,

whereas

gg=x,yaxayxy.

Comparing coefficients gives

axay=0(xy)

and

ax=ax2.

Since k is a field, at most one coefficient is nonzero, and every nonzero coefficient satisfying ax2=ax must be 1. The condition

ε(g)=1

then shows that exactly one coefficient is 1.

Hence every group-like element is one of the original basis vectors:

G(k[X])X.

Thus the unit

XG(k[X])

is an isomorphism, and consequently

k[]:SetCoalgk

is fully faithful.

So Set sits inside Coalgk as the full subcategory of coalgebras of the form k[X].


The group-like part of a coalgebra

The counit of the adjunction at C is

k[G(C)]C.

If [g] denotes the formal basis vector corresponding to gG(C), the map is simply

[g]g.

Distinct group-like elements of a coalgebra are linearly independent. Hence this map is injective.

We may therefore regard

k[G(C)]

as a canonical subcoalgebra of C: the subcoalgebra spanned by all group-like elements.

Since k[] is fully faithful and right adjoint to G on its essential image, the coalgebras of the form k[X] form a coreflective full subcategory of Coalgk.

The coreflection of C is precisely

k[G(C)]C.

Thus G does not merely extract a set of distinguished vectors. Together with k[], it extracts a canonical coalgebraic part of C.


The monoidal structure

There is another feature of this adjunction that turns out to be crucial.

The category of sets is cartesian monoidal:

(Set,×,),

while Coalgk is symmetric monoidal under the usual tensor product of coalgebras:

(Coalgk,,k).

For sets X and Y there is a natural isomorphism

k[X×Y]k[X]k[Y],

given on basis elements by

(x,y)xy.

Likewise,

k[]k.

These maps respect the coalgebra structures, so

k[]:(Set,×,)(Coalgk,,k)

is strong symmetric monoidal.

The group-like functor has the corresponding property.

Given coalgebras C and D, their tensor product has comultiplication

ΔCD=(1τ1)(ΔCΔD),

so

Δ(cd)=(c(1)d(1))(c(2)d(2)).

If c and d are group-like, then

Δ(cd)=(cd)(cd),

and

ε(cd)=1.

Thus there is a natural map

G(C)×G(D)G(CD),(c,d)cd.

It is in fact a bijection.

Indeed, if zG(CD), define

c=(1εD)(z),d=(εC1)(z).

Both c and d are group-like, and applying the counit identities to

Δ(z)=zz

gives

z=cd.

Hence

G(CD)G(C)×G(D),

and clearly

G(k).

Therefore

G:(Coalgk,,k)(Set,×,)

is also strong symmetric monoidal.

So the adjunction

k[]G

is not merely an adjunction of ordinary categories. It is compatible with the monoidal structures on both sides.


From monoids to bialgebras

Once the monoidal structure is visible, bialgebras appear almost automatically.

A monoid object in

(Set,×)

is simply an ordinary monoid.

A monoid object in

(Coalgk,)

is a coalgebra B equipped with coalgebra morphisms

m:BBB,η:kB,

satisfying associativity and unitality.

But saying that m and η are coalgebra morphisms is exactly the usual compatibility condition between the algebra and coalgebra structures of a bialgebra.

Thus

Mon(Coalgk)Bialgk.

The strong monoidal functors above therefore send monoids to monoids.

For a monoid M, the coalgebra k[M] inherits the ordinary monoid algebra multiplication and becomes a bialgebra.

Conversely, if B is a bialgebra, then G(B) inherits a monoid structure. Categorically, multiplication is obtained as

G(B)×G(B)G(BB)G(m)G(B).

On elements this is simply

(g,h)gh.

The usual fact that the product of two group-like elements is group-like is therefore not an isolated computation. It is a consequence of the strong monoidality of G.


Hopf algebras in a cartesian world

The Hopf case reveals an even more striking principle.

A Hopf algebra can be described by a PROP whose generators include multiplication, unit, comultiplication, counit and antipode, together with the usual algebra, coalgebra, compatibility and antipode relations.

Now interpret this PROP not in Vectk, but in an arbitrary cartesian monoidal category

(C,×,1).

Every object X of a cartesian monoidal category carries a canonical comonoid structure:

ΔX=1X,1X:XX×X

and

εX:X1.

Moreover, this comonoid structure is forced by the cartesian product: there is no additional choice.

The comultiplication part of the Hopf structure therefore collapses to the diagonal.

What remains is a multiplication

m:X×XX,

a unit

e:1X,

and an antipode

S:XX.

The antipode identities become

m(S×1)ΔX=eεX

and

m(1×S)ΔX=eεX.

Since ΔX is the diagonal, these say internally that

S(x)x=e,xS(x)=e.

They are precisely the inverse axioms.

Thus a model of the Hopf PROP in a cartesian monoidal category is nothing other than a group object.

In particular,

PHopf-Mod(Set)Grp.

So the familiar fact that group-like elements of a Hopf algebra form a group is already encoded at the level of the PROP.

When the Hopf theory is transported from the tensor world of coalgebras to the cartesian world of sets, it becomes ordinary group theory.


From groups to Hopf algebras

The left adjoint now has an immediate interpretation on groups.

Given a group Γ, the coalgebra k[Γ] already has

Δ(g)=gg,ε(g)=1.

The group multiplication extends linearly to the usual multiplication on the group algebra, and inversion extends linearly to

S(g)=g1.

Thus k[Γ] becomes a Hopf algebra.

So the functor k[] restricts to

k[]:GrpHopfAlgk.

In the other direction, if H is a Hopf algebra, then G(H) is a group.

Its multiplication is inherited from H, its identity is 1H, and the inverse of a group-like element g is

S(g).

Indeed,

S(g)g=gS(g)=1.

Hence there is a functor

G:HopfAlgkGrp.

This is not merely a pair of related constructions. The original adjunction survives at the Hopf level.


The group algebra adjunction

Let Γ be a group and H a Hopf algebra.

Suppose first that

F:k[Γ]H

is a Hopf algebra morphism.

Every gΓ is group-like in k[Γ], so F(g) is group-like in H. Since F preserves multiplication,

F(gh)=F(g)F(h).

Thus restriction gives a group homomorphism

ΓG(H).

Conversely, suppose

f:ΓG(H)

is a group homomorphism.

It extends uniquely by linearity to

f~:k[Γ]H.

Since f is multiplicative,

f~(gh)=f(gh)=f(g)f(h),

so f~ is an algebra morphism.

Since every f(g) is group-like,

Δ(f(g))=f(g)f(g),

and

ε(f(g))=1,

so f~ is also a coalgebra morphism.

Finally,

S(f(g))=f(g)1=f(g1),

so the antipodes are compatible.

Thus f~ is a Hopf algebra morphism.

These two constructions are inverse and natural, giving

HopfAlgk(k[Γ],H)Grp(Γ,G(H)).

Therefore

k[]:GrpHopfAlgk:G

is an adjunction.


Groups sit inside Hopf algebras

As before,

G(k[Γ])Γ.

Hence the unit

ΓG(k[Γ])

is an isomorphism.

It follows that the group algebra functor

k[]:GrpHopfAlgk

is fully faithful.

Thus groups form a full subcategory of Hopf algebras through the group algebra construction.

For any Hopf algebra H, the counit of the adjunction is

k[G(H)]H.

Since distinct group-like elements are linearly independent, this map is injective. Its image is the Hopf subalgebra spanned by the group-like elements of H.

So every Hopf algebra contains a canonical group algebra:

k[G(H)]H.

This is the largest part of H that is built purely from group-like points.


The conceptual picture

The construction begins with a very elementary-looking definition:

Δ(g)=gg,ε(g)=1.

But these equations can be reorganized into a sequence of categorical observations.

First,

G(C)Coalgk(k,C),

so group-like elements are represented points.

Then

k[]G

relates sets to coalgebras.

Both functors are strong symmetric monoidal:

k[X×Y]k[X]k[Y],

and

G(CD)G(C)×G(D).

Consequently, algebraic structure can be transported across the adjunction.

Monoids become bialgebras, while the Hopf PROP, when interpreted in a cartesian monoidal category, becomes the theory of group objects.

This produces the second adjunction

k[]:GrpHopfAlgk:G.

The familiar statement

the group-like elements of a Hopf algebra form a group

is therefore only the visible shadow of a more structural fact.

The group-like functor sends the Hopf theory from the tensor world of coalgebras into the cartesian world of sets. In the cartesian world, comultiplication becomes the diagonal, the counit becomes the terminal map, and the antipode becomes inversion.

What remains is precisely a group.

So the word group-like is not merely suggestive terminology. Categorically, these points become genuine group elements once the Hopf structure is viewed through the appropriate monoidal functor.

Popular Posts