Let A, B, C, and X be sets.

  1. 1. Functoriality. The assignment (A,B,C,f,g)A×f,C,gB defines a functor
    1×31:Fun(P,Sets)Sets,

    where P is the category that looks like this:

    In particular, the action on morphisms of 1×31 is given by sending a morphism

    in Fun(P,Sets) to the map ξ:A×CB!A×CB given by

    ξ(a,b)=def(ϕ(a),ψ(b))

    for each (a,b)A×CB, which is the unique map making the diagram

    commute.

  2. 2. Adjointness. We have adjunctions
    witnessed by bijections
    Sets/X(A×XB,C)Sets/X(A,Sets/X(B,C)),Sets/X(A×XB,C)Sets/X(B,Sets/X(A,C)),

    natural in (A,ϕA),(B,ϕB),(C,ϕC)Obj(Sets/X), where Sets/X(A,B) is the object of Sets/X consisting of (see , ):

    • The Set. The set Sets/X(A,B) defined by

      Sets/X(A,B)=defxXSets(ϕA1(x),ϕY1(x))

    • The Map to X. The map

      ϕSets/X(A,B):Sets/X(A,B)X

      defined by

      ϕSets/X(A,B)(x,f)=defx

      for each (x,f)Sets/X(A,B).

  3. 3. Associativity. Given a diagram

    in Sets, we have isomorphisms of sets

    (A×XB)×YC(A×XB)×B(B×YC)A×X(B×YC),

    where these pullbacks are built as in the diagrams

  4. 4. Interaction With Composition. Given a diagram

    in Sets, we have isomorphisms of sets

    X×Kfϕ,gψY(X×Aϕ,q1(A×Kf,gB))×A×Kf,gBp2,p1((A×Kf,gB)×Bq2,ψY)X×Aϕ,p((A×Kf,gB)×Bq2,ψY)(X×Aϕ,q1(A×Kf,gB))×Bq,ψY

    where

    q1=pr1A×Kf,gB,p1=pr1(A×Kf,gB)×Yq2,ψ,p=q1pr1(A×Kf,gB)×Bq2,ψY,q2=pr2A×Kf,gB,p2=pr2X×A×Kf,gBϕ,q1(A×Kf,gB),q=q2pr2X×Aϕ,q1(A×Kf,gB),

    and where these pullbacks are built as in the following diagrams:

  5. 5. Unitality. We have isomorphisms of sets
    natural in (A,f)Obj(Sets/X).
  6. 6. Commutativity. We have an isomorphism of sets
    natural in (A,f),(B,g)Obj(Sets/X).
  7. 7. Distributivity Over Coproducts. Let A, B, and C be sets and let ϕA:AX, ϕB:BX, and ϕC:CX be morphisms of sets. We have isomorphisms of sets
    δSets/X:A×X(BC)(A×XB)(A×XC),δrSets/X:(AB)×XC(A×XC)(B×XC),

    as in the diagrams

    natural in A,B,CObj(Sets/X).

  8. 8. Annihilation With the Empty Set. We have isomorphisms of sets
    natural in (A,f)Obj(Sets/X).
  9. 9. Interaction With Products. We have an isomorphism of sets
  10. 10. Symmetric Monoidality. The 8-tuple (λSets/XSets/X, ×X, X, Sets/X, αSets/X, λSets/X, ρSets/X, σSets/X) is a symmetric closed monoidal category.

Item 1: Functoriality
This is a special case of functoriality of co/limits, , of , with the explicit expression for ξ following from the commutativity of the cube pullback diagram.
Item 2: Adjointness
This is a repetition of , of , and is proved there.
Item 3: Associativity
We have
(A×XB)×YC{((a,b),c)(A×XB)×C | h(b)=k(c)}{((a,b),c)(A×B)×C | f(a)=g(b) and h(b)=k(c)}{(a,(b,c))A×(B×C) | f(a)=g(b) and h(b)=k(c)}{(a,(b,c))A×(B×YC) | f(a)=g(b)}A×X(B×YC)

and

(A×XB)×B(B×YC){((a,b),(b,c))(A×XB)×(B×YC) | b=b}{((a,b),(b,c))(A×B)×(B×C) | f(a)=g(b)b=b,and h(b)=k(c)}{(a,(b,(b,c)))A×(B×(B×C)) | f(a)=g(b)b=b,and h(b)=k(c)}{(a,((b,b),c))A×((B×B)×C) | f(a)=g(b)b=b,and h(b)=k(c)}{(a,((b,b),c))A×((B×BB)×C) | f(a)=g(b) andh(b)=k(c)}{(a,(b,c))A×(B×C) | f(a)=g(b) and h(b)=k(c)}A×X(B×YC),

where we have used Item 5 for the isomorphism B×BBB.
Item 4: Interaction With Composition
By Item 3, it suffices to construct only the isomorphism
X×Kfϕ,gψY(X×Aϕ,q1(A×Kf,gB))×A×Kf,gBp2,p1((A×Kf,gB)×Bq2,ψY).

We have

(X×Aϕ,q1(A×Kf,gB))=def{(x,(a,b))X×(A×Kf,gB) | ϕ(x)=q1(a,b)}=def{(x,(a,b))X×(A×Kf,gB) | ϕ(x)=a}{(x,(a,b))X×(A×B) | ϕ(x)=a and f(a)=g(b)},((A×Kf,gB)×Bq2,ψY)=def{((a,b),y)(A×Kf,gB)×Y | q2(a,b)=ψ(y)}=def{((a,b),y)(A×Kf,gB)×Y | b=ψ(y)}{((a,b),y)(A×B)×Y | b=ψ(y) and f(a)=g(b)},

so writing

S=(X×Aϕ,q1(A×Kf,gB))S=((A×Kf,gB)×Bq2,ψY),

we have

S×A×Kf,gBp2,p1S=def{((x,(a,b)),((a,b),y))S×S | p1(x,(a,b))=p2((a,b),y)}=def{((x,(a,b)),((a,b),y))S×S | (a,b)=(a,b)}{((x,a,b,y))X×A×B×Y | ϕ(x)=aψ(y)=b, and f(a)=g(b)}{((x,a,b,y))X×A×B×Y | f(ϕ(x))=g(ψ(y))}=defX×KY.

This finishes the proof.
Item 5: Unitality
We have
X×XA{(x,a)X×A | f(a)=x},A×XX{(a,x)X×A | f(a)=x},

which are isomorphic to A via the maps (x,a)a and (a,x)a. The proof of the naturality of λSets/X and ρSets/X is omitted.

Item 6: Commutativity
We have
A×CB=def{(a,b)A×B | f(a)=g(b)}={(a,b)A×B | g(b)=f(a)}{(b,a)B×A | g(b)=f(a)}=defB×CA.

The proof of the naturality of σSets/X is omitted.

Item 7: Distributivity Over Coproducts
We have
A×X(BC)=def{(a,z)A×(BC) | ϕA(a)=ϕBC(z)}={(a,z)A×(BC) | z=(0,b) and ϕA(a)=ϕBC(z)}={(a,z)A×(BC) | z=(1,c) and ϕA(a)=ϕBC(z)}={(a,z)A×(BC) | z=(0,b) and ϕA(a)=ϕB(b)}={(a,z)A×(BC) | z=(1,c) and ϕA(a)=ϕC(c)}{(a,b)A×B | ϕA(a)=ϕB(b)}={(a,c)A×C | ϕA(a)=ϕC(c)}=def(A×XB)(A×XC)(A×XB)(A×XC),

with the construction of the isomorphism

δrSets/X:(AB)×XC(A×XC)(B×XC)

being similar. The proof of the naturality of δSets/X and δrSets/X is omitted.

Item 8: Annihilation With the Empty Set
We have
A×XØ=def{(a,b)Aר | f(a)=g(b)}={kØ | f(a)=g(b)}=Ø,

and similarly for Ø×XA, where we have used Item 7 of Proposition 2.1.3.1.3. The proof of the naturality of ζSets/X and ζrSets/X is omitted.

Item 9: Interaction With Products
We have
A×ptB=def{(a,b)A×B | !A(a)=!B(b)}=def{(a,b)A×B | =}={(a,b)A×B}=A×B.

Item 10: Symmetric Monoidality
Omitted.


Noticed something off, or have any comments? Feel free to reach out!


You can also use the contact form below: