Blog Archive

Tuesday, July 22, 2025

Syntax and Semantics in Representable Functors

Syntax is something that prescribes how we are allowed to speak - it establishes the rules and constraints of our discourse.

Semantics is what our speech means - it gives content and interpretation to our syntactic expressions.

Let F:C→Set be a representable functor, with F≅HomC(T,−).

We should view T as a kind of syntax and x∈F(X) as a kind of semantics or model of T in X.

Consider the following examples:

For Haus, consider the convergent sequence functor Haus(N∪{∞},−), we should view idN∪{∞} as the universal convergent sequence.

A model of (N∪{∞},idN∪{∞}) in a space X is a convergent sequence in X.

For Top, consider U(X)={f∈HomTop(R,X):f(x+T)=f(x)}. Then we have U≅Top(R/Z,−). We could view idR/Z as the universal periodic function with T=1.

For CRing, CRing(Z[X,Y]/(X2+Y2−1),−) is the solution set functor of X2+Y2−1, and we should view idZ[X,Y]/(X2+Y2−1),X⟼X,Y⟼Y as the universal solution of X2+Y2−1.

For an well powered Topos E, let Ω be the subobject classifier, we have Sub(−)≅HomE(−,Ω).

We should view ⊤:1→Ω, or its characteristic function idΩ as the universal subobject. Since every subobject is given by pullback of ⊤:1→Ω.

To formalize this idea, consider the category of elements ∫CF, where F≅HomC(T,−).

The object (T,idT) is the syntax, a model or a semantics of this syntax on X is a morphism

x:(T,idT)→(X,x)

The identity is the universal model/semantics.

For example, in ∫HausHaus(N∪{∞},−), the identity is (n)n=0∞. A convergent sequence on X is a continuous function

x:N∪{∞}→X

It will correspond to

(X,x)

which is a semantics/model of (N∪{∞},idN∪{∞}) in X.

Now let us consider the projection functor

π:∫CF⟶C,(X,x)⟼X

Then the fiber functor is representable

π−1(X)≅HomC(T,X)

Remark. It looks like the fiber functor in Grothendieck Galois theory, huh.

The fiber π−1(X) is the collection of all the semantics/models of X.

Now let us consider CAT, which is the category of categories.

Fix a (small) category D, and consider Func(D,−):CAT→CAT. Sometimes we consider some structure preserving functor, and we consider the subcategory of CAT.

We should view D as the syntax, and Func(D,C) as a kind of semantics/model on C.

Again, we should consider the category of elements with respect to Func(D,−).

The object is

(C,c), where c is a functor from D to C.

Here (D,idD) is the syntax, and (C,c) is a model in C, and Func(D,C) is the category of models in C.

Example.

Consider the category B(G), where G is a group, and B(G) is a one-point category. Then

(B(G),idB(G)) is the syntax of the group action, and (Set,F) is a model in Set, i.e., a G-set

Consider the category

Dop=E⇉tsV

Then the syntax of quiver (edge, vertex, source and target) is given by

(Dop,idDop), and (Set,F) is a model in Set

The semantics in Set form a topos.

Let R be a ring and B(R) be the one-point category. Let A+ be the category of additive categories (morphism is additive functor).

Then consider Add(B(R),−):A+→A+

Then

(B(R),idB(R)) is the syntax of the ring action, and (Ab,F) is a model in Ab, i.e., an R-module

Let TG be the Lawvere theory of groups, and consider the category of cartesian monoidal categories (the morphism is product-preserving functor), then

(TG,idTG), is the syntax of group theory, and (Set,F) is a model in Set

No comments:

Post a Comment

Popular Posts