Blog Archive

Sunday, September 13, 2026

From Coalgebras to Algebras via Lax Monoidal Duality

 

Duality Is Lax Monoidal: Why Coalgebras Dualize to Algebras

There is a familiar asymmetry in linear algebra.

If C is a coalgebra over a field k, then its full linear dual

C∗=Homk(C,k)

is naturally an algebra. But if A is an algebra, its full dual A∗ is not, in general, naturally a coalgebra.

In finite dimensions the asymmetry disappears: finite-dimensional algebras and coalgebras dualize into one another.

At first sight this looks like a technical issue caused by infinite-dimensional vector spaces. There is, however, a clean categorical explanation:

(−)∗:Vectkop⟶Vectk

is naturally a lax monoidal functor, and it becomes strong monoidal after restricting to finite-dimensional vector spaces.

Since lax monoidal functors preserve monoid objects, the dual of a coalgebra is automatically an algebra. The failure in the opposite direction is precisely the failure of the lax monoidal structure map to be invertible.

This is what we will prove.

The canonical map V∗⊗W∗→(V⊗W)∗

Let V and W be vector spaces over k.

There is a canonical linear map

μV,W:V∗⊗W∗⟶(V⊗W)∗

defined on pure tensors by

μV,W(f⊗g)(v⊗w)=f(v)g(w).

Equivalently, a finite sum

∑i=1nfi⊗gi

is sent to the bilinear form

(v,w)⟼∑i=1nfi(v)gi(w).

There is also a canonical unit map

μ0:k⟶k∗

sending λ∈k to the linear functional

x⟼λx.

Under the usual identification k∗≅k, this is simply the identity.

These maps are natural in V and W.

Now regard linear duality as the covariant functor

D=(−)∗:Vectkop⟶Vectk.

The maps above have exactly the form required for a lax monoidal structure:

D(V)⊗D(W)⟶D(V⊗W),

together with

k⟶D(k).

So it remains only to check coherence.

Coherence

Take

f∈U∗,g∈V∗,h∈W∗.

There are two ways to use the maps μ to send

f⊗g⊗h

to an element of

(U⊗V⊗W)∗.

Evaluated on

u⊗v⊗w,

both give

f(u)g(v)h(w).

Thus the associativity coherence diagram commutes.

Similarly, the unit maps give

1⋅f(v)=f(v)=f(v)⋅1,

so the left and right unit coherence diagrams commute as well.

Hence

(−)∗:Vectkop→Vectk is lax monoidal.

In fact, it is lax symmetric monoidal: the canonical map is compatible with the symmetry

V⊗W≅W⊗V.

Lax monoidal functors preserve monoid objects

The relevance of this observation comes from a general fact.

Let

F:(C,⊗,1C)⟶(D,⊗,1D)

be a lax monoidal functor, with structure maps

ϕX,Y:F(X)⊗F(Y)⟶F(X⊗Y)

and

ϕ0:1D⟶F(1C).

Suppose M is a monoid object in C, with multiplication

m:M⊗M⟶M

and unit

u:1C⟶M.

Then F(M) becomes a monoid object in D by defining

F(M)⊗F(M)→ϕM,MF(M⊗M)→F(m)F(M)

as its multiplication, and

1D→ϕ0F(1C)→F(u)F(M)

as its unit.

The monoid axioms follow exactly from the coherence axioms for the lax monoidal structure together with the monoid axioms for M.

Thus

lax monoidal functors preserve monoid objects.

Notice that no inverse to ϕX,Y is needed.

This directionality is the important point.

A coalgebra is a monoid in the opposite category

Let

C=(C,Δ,ε)

be a coalgebra in Vectk.

Thus we have

Δ:C⟶C⊗C

and

ε:C⟶k.

Passing to the opposite category reverses the arrows. Hence in Vectkop they become

C⊗C⟶C

and

k⟶C.

The coassociativity and counit axioms become precisely the associativity and unit axioms.

Therefore

a coalgebra in Vectk is a monoid object in Vectkop.

We may now apply the lax monoidal functor

(−)∗:Vectkop⟶Vectk.

Since lax monoidal functors preserve monoids, C∗ automatically becomes a monoid object in Vectk, hence an algebra.

Its multiplication is the composite

C∗⊗C∗→μC,C(C⊗C)∗→Δ∗C∗.

Thus, for f,g∈C∗,

(fg)(c)=(f⊗g)(Δ(c)).

Writing

Δ(c)=∑c(1)⊗c(2)

in Sweedler notation gives

(fg)(c)=∑f(c(1))g(c(2)).

This is exactly the usual convolution multiplication on C∗.

The unit is obtained from the counit

ε:C→k.

Dualizing gives

ε∗:k∗⟶C∗,

and using k≅k∗ we obtain

1⟼ε.

So the unit of the dual algebra is precisely the counit of the original coalgebra.

The usual algebra structure on C∗ is therefore not an additional construction that happens to work.

It is forced by monoidality:

convolution on C∗ is the monoid structure transported by the lax monoidal dual functor.

Why does the same argument not dualize an algebra?

Now let

A=(A,m,u)

be an algebra.

Its multiplication is

m:A⊗A⟶A.

Dualizing gives

m∗:A∗⟶(A⊗A)∗.

But to make A∗ into a coalgebra, we would need a comultiplication

A∗⟶A∗⊗A∗.

So we would like to continue with a map

(A⊗A)∗⟶A∗⊗A∗.

The lax monoidal structure gives exactly the opposite direction:

A∗⊗A∗⟶(A⊗A)∗.

Thus lax monoidality alone cannot produce a coalgebra structure on A∗.

Categorically, there is a simple reason.

An algebra in Vectk becomes a comonoid in Vectkop, but lax monoidal functors preserve monoids, not comonoids.

To transport a comonoid structure, one would need structure maps in the reverse direction,

F(X⊗Y)⟶F(X)⊗F(Y).

In other words, one needs an oplax monoidal structure, or, most conveniently, a strong monoidal structure whose structural maps can be inverted.

This is precisely what fails for unrestricted linear duality.

What fails in infinite dimensions?

The canonical map

μV,W:V∗⊗W∗⟶(V⊗W)∗

is always injective, but it need not be surjective.

The image consists of bilinear forms that can be written as finite sums

B(v,w)=∑i=1nfi(v)gi(w).

Equivalently, if we regard a bilinear form as a linear map

B~:V⟶W∗,

then every element in the image of V∗⊗W∗ gives a map of finite rank.

Indeed,

B~(v)=∑i=1nfi(v)gi

has image contained in

span{g1,…,gn}.

Infinite-dimensional spaces admit bilinear forms of infinite rank, so not every element of (V⊗W)∗ comes from V∗⊗W∗.

For example, let V be an infinite-dimensional vector space with basis

{ei}i∈I.

Define a bilinear form by

B(ei,ej)=δij.

The associated map

V⟶V∗

sends ei to the corresponding coordinate functional ei∗, so it has infinite-dimensional image.

Hence B cannot lie in the image of

V∗⊗V∗⟶(V⊗V)∗.

Thus in general

V∗⊗W∗⊊(V⊗W)∗.

This is the concrete linear-algebraic obstruction behind the categorical asymmetry.

Finite dimensions: lax becomes strong

Now restrict to finite-dimensional vector spaces.

If V and W are finite-dimensional, then the canonical map

V∗⊗W∗⟶(V⊗W)∗

is an isomorphism.

For example, if

{vi}

and

{wj}

are bases of V and W, with dual bases

{vi∗}and{wj∗},

then

{vi∗⊗wj∗}

maps to the dual basis of

{vi⊗wj}.

Hence

(−)∗:Vectk,fdop⟶Vectk,fd is strong monoidal.

In fact it is strong symmetric monoidal.

Now the structure map can be inverted:

(V⊗W)∗→∼V∗⊗W∗.

Therefore strong monoidal duality can transport both monoid and comonoid structures.

For a finite-dimensional algebra A, dualizing its multiplication gives

m∗:A∗⟶(A⊗A)∗,

and then using the inverse monoidal structure gives

A∗→m∗(A⊗A)∗→μA,A−1A∗⊗A∗.

This is the comultiplication on A∗.

Likewise the unit

u:k⟶A

dualizes to

u∗:A∗⟶k∗≅k,

which becomes the counit.

Thus every finite-dimensional algebra has a dual coalgebra.

Conversely, every coalgebra, finite-dimensional or not, has a dual algebra.

So the familiar asymmetry can be summarized as

coalgebra C⇓alwaysalgebra C∗

whereas

algebra A⇓automatically only in finite dimensionscoalgebra A∗.

The distinction is exactly the distinction between lax and strong monoidality.

 

Popular Posts