Blog Archive

Tuesday, April 28, 2026

Structure–Semantics Adjunction for Tractable Functors

 

Structure–Semantics Adjunction for Tractable Functors

Consider the full subcategory of Cat/Set consisting of tractable functors, i.e. those U:CSet such that for all m,nN, Nat(Um,Un) is a set.
Denote this category by

Tract(Cat/Set)

Let T be an algebraic theory. We have the forgetful functor UT:Mod(T)Set defined by UT(A)=A(1).
Hence we obtain a functor

Alg(,Set):TheoryopTract(Cat/Set),T(Mod(T),UT).

This functor admits a left adjoint, called Struct. Concretely, given a tractable functor U:CSet we construct a Lawvere theory TU:

  • objects are the natural numbers nN (representing Un);

  • morphisms mn are the natural transformations Nat(Um,Un).

Let U:CSet and V:DSet be two tractable functors. A morphism (C,U)(D,V) in Tract is a functor F:CD making the triangle commute: commutative diagram

Now we define Struct on morphisms. Given F:(C,U)(D,V), we define a theory morphism

Struct(F):TVTU.
  • On objects: Struct(F)(n)=n.

  • On morphisms: take αTV(m,n)=Nat(Vm,Vn). For each XC, F(X)D, we have a component αF(X):Vm(F(X))Vn(F(X)).
    Because V(F(X))=U(X), this is a function U(X)mU(X)n. Naturality in X follows from the naturality of α and functoriality of F; therefore we obtain a natural transformation Struct(F)(α)Nat(Um,Un) with components

    (Struct(F)(α))X=αF(X).

Natural bijection of the adjunction

We need to establish a natural isomorphism

ΘU,T:Tract((C,U),Alg(T))Theoryop(TU,T),

or equivalently

Θ:Tract((C,U),(Mod(T),UT))Theory(T,TU).
  • The left‑hand side consists of functors G:CMod(T) making the diagram

    CGMod(T)UUTSet

    commute.

  • The right‑hand side consists of product‑preserving functors Φ:TTU that are the identity on objects.

From G to Φ

Given G with UTG=U. For a morphism α:mn in T we must produce a natural transformation Φ(α)Nat(Um,Un). For any XC, G(X) is a model G(X):TSet, and

G(X)(m)G(X)(1)m=(UT(G(X)))m=U(X)m.

Hence we define

(Φ(α))X:=G(X)(α):U(X)mU(X)n.

For a morphism f:XY in C, G(f) is a model homomorphism, which implies

G(X)(α)G(f)(1)m=G(f)(1)nG(Y)(α),

and G(f)(1)=U(f). This is exactly the naturality condition required, so Φ(α) is indeed natural.
Because each G(X) preserves products, the product structure transports pointwise to the pairings, making Φ a morphism of theories.

From Φ to G

Given a theory morphism Φ:TTU. For each XC we construct a model G(X):TSet:

  • On objects: G(X)(n):=U(X)n (formally G(X)(n)=(Φ(n))(X), but Φ(n)=n).

  • On morphisms: for α:mn in T, set G(X)(α):=Φ(α)X:U(X)mU(X)n.

Since Φ preserves products, G(X) preserves products.
For a morphism f:XY in C, define a natural transformation G(f):G(X)G(Y) with components

G(f)n:=U(f)n:U(X)nU(Y)n.

Naturality of Φ(α) guarantees the model homomorphism condition, and clearly UT(G(X))=G(X)(1)=U(X), so UTG=U.

Mutual inverses and naturality

The two constructions are mutually inverse: starting from G, going to Φ and back to G gives G(X)(α)=Φ(α)X=G(X)(α), exactly the same functor; the reverse direction works analogously. Naturality in C and T follows directly from the ingredients, hence the bijection is natural.

Indeed, this adjunction tells us that given a model of an algebraic theory, we can reconstruct the theory via its forgetful functor.
If T is a Lawvere theory and U:Mod(T)Set its forgetful functor, then

TTU.

The counit and its isomorphism property – with concrete examples

We now give a detailed, concrete account of the counit of the structure–semantics adjunction, showing why it is an isomorphism. We work entirely within the framework of Lawvere theories and tractable functors, but illustrate each step with familiar algebraic theories such as groups.

Extracting the counit

Take (C,U)=Alg(T)=(Mod(T),UT).
On the left side of Θ we have the identity morphism

idAlg(T)Tract(Alg(T),Alg(T)).

The inverse of Θ sends this identity to an arrow in Theoryop

εT:TUTT(in Theoryop),

which, after reversing the direction, corresponds to an ordinary theory morphism

ε^T:TTUT.

What ε^T does concretely

  • On objects: ε^T(n)=n (identity on natural numbers).

  • On morphisms: For α:mn in T, the image ε^T(α) is a natural transformation UTmUTn whose component at a model MMod(T) is simply

    (ε^T(α))M=M(α):M(m)M(n).

    (Recall that M preserves products, so M(m)M(1)m=UT(M)m.)

Thus ε^T is the evaluation map that “interprets” each abstract operation as a concrete family of set‑functions, uniformly across all models.

A concrete example: the theory of groups

Let T=TGrp be the Lawvere theory of groups. Its category of models is Grp, and UT:GrpSet sends a group to its underlying set.

The theory extracted from (Grp,UT).
The theory TUT has objects N and morphisms TUT(m,n)=Nat(UTm,UTn).
A natural transformation UTmUTn gives, for every group G, a function GmGn that is natural with respect to group homomorphisms. For example:

  • m=1,n=1: natural maps GG are precisely the group‑theoretic terms in one variable (x, x1, e, x2, …) – exactly TGrp(1,1).

  • m=2,n=1: natural maps G×GG correspond to binary group terms (xy, yx, x1y, projections, constants, …) – exactly TGrp(2,1).

Thus TUT is literally the same as the original theory of groups.

The evaluation map in the group case.
The theory morphism ε^TGrp:TGrpTUT sends

  • the abstract multiplication μ:21 to the natural transformation with components μG:G×GG, (x,y)xy;

  • the abstract inverse i:11 to the natural transformation with components iG:GG, xx1;

  • the abstract unit e:01 to the natural transformation picking the identity element in each group.

  • Injectivity: if two abstract terms behave identically on all groups, they must be the same term (test on free groups).

  • Surjectivity: any natural family GmGn compatible with all homomorphisms is given by a term – a classical result of universal algebra.

Hence ε^TGrp is an isomorphism in Theory.

Why this shows the counit is an isomorphism

By definition of the adjunction, the counit εT in Theoryop corresponds to ε^T1. Because ε^T is an isomorphism of theories, εT is an isomorphism in Theoryop.
Thus:

εT is an isomorphism for every Lawvere theory T

Consequences: full faithfulness and reflective subcategory

Since the counit is an isomorphism, the right adjoint Alg is fully faithful.
Its essential image consists exactly of those tractable functors that are (up to isomorphism) of the form (Mod(T),UT).

A fully faithful right adjoint has its image as a reflective subcategory; therefore the image of Alg is reflective, with reflector Struct. The unit

η(C,U):(C,U)(Mod(TU),UTU)

embeds any concrete category (C,U) into the models of the theory it generates. For the special case where (C,U) is already a model category with its forgetful functor, the unit is an inverse to the counit, hence an equivalence.

Summary

The evaluation map ε^T sends each abstract operation to the concrete natural family it defines on models.
Functorial semantics tells us this map is always bijective, so

TTUT

via the counit. Consequently, the theory is completely encoded in its category of models together with the forgetful functor, and the structure–semantics adjunction gives a precise duality between syntax (the theory) and semantics (the concrete category of models).

No comments:

Post a Comment

Popular Posts