nLab
Chu construction

The Chu construction is a method for constructing a star-autonomous category from a closed symmetric monoidal category. It is named after Po-Hsiang Chu, a student of Michael Barr, who gave the construction in his master’s thesis at McGill University.

In outline, given a closed symmetric monoidal category C with pullbacks and an object d of C, there is a star-autonomous category Chu(C,d) and a strong symmetric monoidal functor

i:CChu(C,d)i: C \to Chu(C, d)

which realizes C as a coreflective subcategory of Chu(C,d). Being star-autonomous, Chu(C,d) is self-dual, hence C op also embeds as a full subcategory of Chu(C,d), this time reflectively.

Many concrete dualities in mathematics can be seen as embedded in a larger ambient self-duality on a Chu construction. This applies in particular to the category of Chu spaces, Chu(Set,2) (see below).

Definition

The objects of Chu(C,d) are triples (a,b;r:abd) (called d-valued pairings between a and b), where a and b are objects of C and r is a morphism of C. The special triple (d,I;ρ:dId), where rho is an instance of the canonical isomorphism (the right unitor) for the monoidal unit I, will play the role of dualizing object in Chu(C,d).

The morphisms of Chu(C,d),

(a,b;r:abd)(x,y;s:xyd),(a, b; r: a \otimes b \to d) \to (x, y; s: x \otimes y \to d),

are pairs of morphisms f:ax, g:yb which are adjoint with respect to the pairings, that is, making the diagram

ay 1 ag ab f1 x r xy s d\array{ & a \otimes y & \overset{1_a \otimes g}{\to} & a \otimes b\\ f \otimes 1_x & \downarrow & & \downarrow r\\ & x \otimes y & \overset{s}{\to} & d }

commute. There is an evident self-duality

Chu(C,d) opChu(C,d)Chu(C, d)^{op} \to Chu(C, d)

which takes an object (a,b;r:abd) to

(b,a;r =[basabrd])(b, a; r^\dagger = [b \otimes a \overset{s}{\cong} a \otimes b \overset{r}{\to} d])

where σ is an instance of the symmetry isomorphism, so that r is the evident transpose. On morphisms, it takes a pair (f,g) to (g,f); note well that the directions of the arrows make the functor contravariant on Chu(C,d).

Armed with just this much knowledge, and knowledge of how star-autonomous categories behave (as categorified versions of Boolean algebras, or perhaps better Boolean rigs), the star-autonomous structure on Chu(C,D) can pretty much be deduced (or strongly guessed) by the diligent reader, and this is actually a very good exercise. One could sketch this as follows:

  • The monoidal unit of Chu(C,d) should be the dual of the dualizer, and so is (I,d;λ:Idd) where λ, the transpose of ρ, is a canonical isomorphism for the unit I.

  • The internal hom AX in Chu(C,d) should internalize the external hom, i.e., the set of maps from the monoidal unit to AX should be in natural bijection with the set of maps AX in Chu(C,d).

This suggests the first component (AX) 0 of the triple

AX=((AX) 0,(AX) 1;pairing)A \multimap X = ((A \multimap X)_0, (A \multimap X)_1; pairing)

should be the object of adjoint pairs of maps: given

A=(a,b;r:abd),X=(x,y;s:xyd)A = (a, b; r: a \otimes b \to d), \qquad X = (x, y; s: x \otimes y \to d)

define the first component as pullback:

(AX) 0 x a s˜ b y r˜ d ay\array{(A \multimap X)_0 & \to & x^a \\ \downarrow & & \downarrow \tilde{s} \\ b^y & \overset{\tilde{r}}{\to} & d^{a \otimes y} }

where exponentials are used to denote internal homs in C, r˜ is the result of currying r to bd a and exponentiating, and similarly for s˜.

The pullback is paired with ay, i.e., there is a map

(AX) 0(ay)d(A \multimap X)_0 \otimes (a \otimes y) \to d

obtained by decurrying either leg of the pullback, so one defines (with fingers crossed) (AX) 1 to be ay, and the pairing to be this map into d.

  • To form the tensor product AX, use the formula AX(AX *) * which holds true in any star-autonomous category (as a categorified analogue of the Boolean algebra equation ax=¬(a¬x)).

With notation as above, this works out to

(ax,y a× d axb x)(a \otimes x, y^a \times_{d^{a \otimes x}} b^x)

where the second component is a pullback, and the pairing omitted but obvious. The main thing to check is the presence of a canonical isomorphism

Chu(C,d)(AX,Y)Chu(C,d)(X,A)Chu(C, d)(A \otimes X, Y) \cong Chu(C, d)(X, A \multimap)

but this is left as an exercise.

Also one should check that if D is the dualizing object, that A *AD, but this is straightforward.

  • There is a strong symmetric monoidal functor

    i:CChu(C,d)i: C \to Chu(C, d)

    taking c to (c,d c;eval:cd cd). (This does not take d to the dualizing object in Chu(C,d), unless of course the canonical map Id d is an isomorphism.) This embedding admits a right adjoint

    p:Chu(C,d)Cp: Chu(C, d) \to C

    given by the obvious projection, that is also strong symmetric monoidal. The unit of the adjunction is an isomorphism, hence C is a coreflective (full) subcategory of Chu(C,d).

  • If C is complete and cocomplete, then so is Chu(C,d). The formula for colimits is the obvious expected one:

    colim i(a i,b i;r i:a ib id)=(colim ia i,lim ib i;r)colim_i (a_i, b_i; r_i: a_i \otimes b_i \to d) = (colim_i a_i, lim_i b_i; r)

    where r is the decurrying of

    lim i(b id a i)lim ib id colim ia ilim_i (b_i \to d^{a_i}) \cong lim_i b_i \to d^{colim_i a_i}

    and the formula for limits is obtained by dualizing the formula for colimits in Chu(C,d).

Chu spaces

While the Chu construction is worthy of exploration for many types of symmetric monoidal categories C, a great deal of attention has been focused just on the particular case Chu(Set,2) (or Chu(Set,TV), where TV is the set of truth values, to be constructive), called the category of Chu spaces, and on relatives like Chu(E,Ω) where E is a topos and Ω its subobject classifier. The reason is that a great many concrete categories of interest are fully embedded in Chu spaces. Moreover, the 2-element set TV carries a panoply of ambimorphic (formerly, schizophrenic) object structures which induce concrete dualities between these categories, and all of these dualities are embedded in (i.e., are restrictions of) the one overarching duality that obtains on Chu spaces.

The way this works is invariably the same: if U:CSet is a concrete category and 2 is an object of C over the 2-element set TV, then there is a functor

i:CChu(Set,2):c(Uc,hom(c,2);Uc×hom(c,2)U2=2)i: C \to Chu(Set, 2): c \mapsto (U c, hom(c, \mathbf{2}); U c \times hom(c, \mathbf{2}) \to U\mathbf{2} = 2)

which is faithful by the notion of concrete category.

What is striking is that this functor i is also full in many cases of interest. This is because the adjointness condition for a pair (f,g):icid to be a Chu space morphism, together with faithfulness of U, forces

g:hom(d,2)monichom(Ud,2)f *hom(Uc,2)g: hom(d, \mathbf{2}) \overset{monic}{\to} hom(U d, 2) \overset{f^*}{\to} hom(U c, 2)

to be a restriction of the preimage function f * – and then the mere additional fact that f *(ϕ)=ϕfhom(c,2) whenever ϕhom(d,2) is often enough to force f to be (the underlying function of) a morphism of C. All that is required is that there be sufficiently many morphisms d2 to detect C-structure on d. Some examples follow:

  • As explained above, Set fully embeds in Chu(Set,2) by X(X,2 X;eval:X×2 X2).

  • For C=Top, taking 2 to be Sierpinski space, we have for each topological space c an identification Open(c)=hom(c,2). Then the adjointness condition on a morphism (f,g):icid between the corresponding Chu spaces expresses precisely the continuity condition that the preimage f * takes opens of d to opens of c. Hence the functor TopChu(Set,2) is full.

  • For C=Pos, the category of posets, take 2 to be the partially ordered set of truth values. Here we have that for a partial order c, hom(c,2) is the set of upper sets (upward-closed subsets) of c. Given a function f:UcUd between posets, the condition that the preimage f *(v) of an upper set of d is an upper set of c is enough to force f to be a poset map (consider v={qd:fpq}). It follows that the functor PosChu(Set,2) is full.

  • For C=Sup, the category of sup-lattices (whose morphisms are those functors between the underlying posets that are left adjoints), take 2 to be the partially ordered set of truth values, but this time as the opposite of the poset TV. For a sup-lattice c, hom(c,2) may be identified with the set of representable functors c(,x):c opTV. The Chu condition then is that d(,y)f=d(f,y) is representable for every representable d(,y). But this condition is equivalent f’s being a left adjoint. Therefore the functor SupChu(Set,2) is full.

For other examples of concrete categories, the presence of enough elements in hom C(c,2) to detect the C-structure of c often requires some form of choice principle, such as the axiom of choice or ultrafilter theorem:

  • For C=Vect 𝔽 2, the category of vector spaces over the 2-element field, any object d has a basis, let us say S. For each sS, the characteristic or indicator χ s:S2 extends uniquely to a linear function ϕ s:d2. If f:UcUd is a function such that ϕ sf:c2 is linear for every basis element sS, then

    f(ax+by)= sSϕ s(f(ax+by))s= s(aϕ s(f(x))+bϕ s(f(y)))s=af(x)+bf(y)f(a x + b y) = \sum_{s \in S} \phi_s(f(a x + b y))s = \sum_s (a\phi_s(f(x)) + b\phi_s(f(y)))s = a f(x) + b f(y)

    It follows that the functor Vect 𝔽 2Chu(Set,2) is full.

Similar considerations apply to Boolean algebras, Stone Boolean algebras, algebraic lattices, and so on.

In all of these cases, the fullness of these embeddings entitles one to identify a topological space, a Boolean algebra, a vector space over 𝔽 2, etc. with its corresponding Chu space, and the same consideration applies to the duals (opposites) of these categories.

Now many of these formal categorical duals are themselves concrete categories, as in the famous example of classical Stone duality? between Boolean algebras and Stone spaces, i.e., compact Hausdorff totally disconnected topological spaces. In many such Stone duality situations, and certainly wherever Stone duality applies to the categories listed above, a contravariant equivalence between a concrete category C and an algebraic category D (i.e., where U:DC is monadic),

C op D hom(,2) U Set, \array{ & C^{op} & \overset{\sim}{\to} & D & \\ hom(-, \mathbf{2}) & \searrow & & \swarrow & U\\ & & Set, & & }

is effected by lifting the object 2 of C to a D-algebra structure in C (making 2 an ambimorphic object, carrying C- and D-structures compatible with one another); equivalently, seeing hom(,2):C opSet as an algebra over the monad UF for which U:DSet is monadic. For example, classical Stone duality is the case where C is the category of Stone spaces, D is the category of Boolean algebras, and the Boolean operations on 2 are continuous with respect to its Stone space structure, making 2 a Boolean algebra object in the category of Stone spaces. (For much more on this, see Johnstone’s classic treatise Stone Spaces, especially the chapter on general concrete dualities.)

The point is that in each of these situations, a Stone duality is a restriction of the more global duality on Chu spaces, in that the diagram

C op hom(,2) D i op i Chu(Set,2) op () * Chu(Set,2)\array{ C^{op} & \overset{hom(-, \mathbf{2})}{\to} & D \\ i^{op} \downarrow & & \downarrow i \\ Chu(Set, 2)^{op} & \overset{(-)^*}{\to} & Chu(Set, 2) }

(where the vertical arrows are full embeddings as described above) commutes up to canonical isomorphism.

The same principle extends to other situations. For example, Pontryagin duality? is fully embedded in the larger duality which obtains on Chu(Top,S 1), where Top is a nice category of spaces.

Hi Toby; could I get you to explain the aside about Boolean rigs above? I’m thinking Boolean algebras is appropriate, as we have Ix *x, xx *D where denotes Girard’s “par” and D denotes the dualizer, together with appropriate triangular equations, categorifying the inequalities 1(¬x)v and x(¬x)0 in a Boolean algebra. —Todd

Now that I go to write Boolean rig, I'm not so sure. I just know that Chu(PX,) at measurable space is not (even classically) a Boolean algebra. I'll get back to you in a day or less. —Toby

Right, I agree. The Chu construction applied to a complete Heyting algebra is merely a *-autonomous quantale, not a *-autonomous frame (which would be a complete Boolean algebra), as you noted at measurable space. —Todd

References

category: category