Starting a separate thread to collect thoughts on Petar's question about coexponential objects in Set.
Alberto Meneghello said:
Samuel Gélineau ha scritto:
I have a guess for the coexponential in Set exercise, but I don't like it one bit.
coexp(B, A) = if A is non-empty, then Void, otherwise B
We need to define a morphism v : B -> coexp(B, A) + A.
Case 1: A is non-empty. Then v : B -> Void + A, so we need to map every element in B to an element in A. Since A is non-empty, it has at least one element a ∈ A, to which we map everything. We pick this a arbitrarily.
Case 2: A is empty. Then v : B -> B + A, so we can simply map the elements of B to themselves.
We also need to produce a unique u : coexp(B, A) -> X for any e : B -> X + A. We proceed by cases.
Case 1: A is non-empty. Then u : Void -> X, so we must choose u : Void -> X to be absurd_Void, the unique morphism out of Void.
Case 2: A is empty. Then u : B -> X, and e : B -> X + Void must map every element of B to an X, so we choose that map for our u.
I don't like it because it is far from being as elegant as the exponential, because it doesn't seem very useful, and because of the arbitrary choice in the definition of v....
My result was quite similar, except for leaving undefined (= defined as Void) coexp(B,A) when both A and B are non-empty.
Given two sets X and Y, we must find a set XY:=coexp(Y,X) and a function η:X⟶XY⊔Y such that for every function e:X⟶Z⊔Y there exists a unique function k:XY⟶Z for which e=(k⊔idY)∘η.
The situation is depicted in the following figure: coexp.jpg
-
When X=∅ (initial), for every set Y we are forced to consider for η the only empty function η:∅⟶∅Y⊔Y.
For every set Z, the empty function e:∅⟶Z⊔Y trivially equals (k⊔idY)∘η , as ∅=k∘∅ for any function k.
In order for such a k:∅Y⟶Z to exist even in the case Z=∅, we must define ∅Y:=∅ (hence unicity is given by ∅ initial).
-
When X=∅:
Lemma 1.1 η(X)⊆ιX(X):={0}×X
Suppose η(x)=(1,y) for some x∈X,y∈Y; then we can consider e:=ιX:X⟶X⊔Y:x⟼(0,x), for which there is no k:XY⟶Z making the diagram to commute. In fact, (k⊔idY)∘η(x)=(k⊔idY)∘(1,y)=(1,y) = (0,x)=e(x).
Corollary 1.2 η must be injective.
As we can take e=ιX (which is injective); then also the composite X⟶ηZ⊔Y⟶k⊔idYX⊔Y and hence η must be injective.
Corollary 1.3 η must be surjective on XY.
Suppose there is some (0,w)∈XY⊔Y∖η(X); then the function k:XY⟶Z making the diagram to commute cannot be unique (provided ∣Z∣≥2), as every function k′ obtained from k by changing the image of (0,w) will fit.
Lemma 1.4 Y=∅
Otherwise we could define a function e:X⟶XY⊔Y:x⟼(1,y) for which there would be no way to make the diagram commutative. In fact, for every k it is: (k⊔idY)∘η(x)=(k⊔idY)∘(0,x′)=(0,k(x′)) = (1,y)=e(x).
Summing up, the quantifications in the universal property compel the function η to be bijective (L1.2, L1.3) and to depend solely on X (L1.1); the latter can be accomplished in two cases: when either X=∅ (L0) or Y=∅ (L1.4). Hence:
Theorem 2 Given two sets X, Y, their co-exponential is defined (up to isomorphism) as:
(XY,η) := {(X,ιx)undefined if X=∅ or Y=∅else
I agree with this answer. Indeed, since there is no object with the right universal property, it's right to say that the coexponential of A and B doesn't exist when both A and B are nonempty.
So what's happening here? We can get some intuition by working in a slightly different category. For a fixed set S, consider the category P(S) of subsets of S, where the morphisms are given by subset inclusions.
Exercise: the coexponential AB in P(S) is just the set-theoretic difference A−B.
So in some sense, the coexponential wants to be a difference of sets. But the difference of sets isn't well-defined in the category Set! For example, suppose A and B are one-element sets. What is A−B? It depends on whether A and B are equal, but equality is not a categorical property—only equivalence is!
So we're left with a boring coexponential, which only exists when one of A and B is the empty set. But in other settings (e.g. posets like the above) it can be a sensible thing to think about.
Let me sneak in a little high-brow proof of the non-existence of coexponentials, just to illustrate a powerful general technique. (I don't know if Petar meant coexponentials to be left adjoints to −+X or still right adjoints, so I'll proof both don't exist).
Arguably the most important property of left adjoints is that they preserve [[colimits]], such as [[coproducts]]. So if you had a coexponential right adjoint to −+X, it would mean that −+X is left adjoint and thus preserving colimits, so you'd have (A+B)+X≅(A+X)+(B+X), which is not true in general.
In the same way we see −+X can't be a right adjoint (= it can't have a left adjoint) since in that case it would preserve [[limits]], such as [[cartesian products]], but (A×B)+X≅(A+X)×(B+X) is not true in general.
Andrew Dudzik
Thank you Andrew, very interesting your observation!
Effectively every Boolean algebra such as P(S) can be seen as a thin category where:
the exponential (= right adjoint to ⋅∧B) is implication AB:=B→A≡¬B∨A,
hence taking the opposite (= dual)
the coexponential (= left adjoint to ⋅∨B) amounts to AB:=¬(¬B→¬A)≡¬B∧A=:A∖B.
Therefore, there seems to be some "contravariance" here: the fewer the morphisms in the category, the fewer the constraints for the universal property to hold, the more likely for the co/limit to exist. Of course it is not always the case (for instance in a discrete category) as certain maps have to exist for co/limits; is there some general criterion or is it specific for every situation?
I'm not sure what we can say in general about non-existence of limits. But there is a fact I found on nLab: every category with all exponential and coexponential objects is thin. So in this case, you can have any two of exponentials, coexponentials, and lots of morphisms, but not all three!
@Matteo Capucci (he/him)
Let's not forget the third possible definition of coexponential! We don't have (A×B)×X=(A×X)×(B×X) in general, so −×X isn't a right adjoint. Hadn't occurred to me that this was related to picking the correct distributive law.
Andrew Dudzik said:
But there is a fact I found on nLab: every category with all exponential and coexponential objects is thin.
Very cool!