CatDat

Results on constant morphisms

Lemma 1.

A constant morphism in Set\Set is the same as a constant map in the usual sense.

Proof. Let X,YX,Y be two sets and let f:XYf : X \to Y be a map. If ff is a constant morphism, then, in particular, for all morphisms x1,x2:1Xx_1,x_2 : 1 \to X, we have fx1=fx2f \circ x_1 = f \circ x_2. Therefore, f(x1)=f(x2)f(x_1) = f(x_2) for all x1,x2Xx_1,x_2 \in X, so ff is a constant map. Conversely, if ff is a constant map and x1,x2:TXx_1,x_2 : T \rightrightarrows X are two maps, then fx1=fx2f \circ x_1 = f \circ x_2, since for all tTt \in T we have f(x1(t))=f(x2(t))f(x_1(t)) = f(x_2(t)). \square

Lemma 2.

Let C\C be a locally small category. Any representable functor U:CSetU : \C \to \Set maps constant morphisms to constant maps.

Proof. We may assume that U=Hom(G,)U = \Hom(G,-) for some GCG \in \C. If f:XYf : X \to Y is a constant morphism in C\C, then the induced map f:Hom(G,X)Hom(G,Y)f_* : \Hom(G,X) \to \Hom(G,Y) is constant by the definition of a constant morphism. \square

Lemma 3.

Any right adjoint functor preserves constant morphisms.

Proof. Let G:CDG : \C \to \D be a functor that is right adjoint to F:DCF : \D \to \C. Let f:XYf : X \to Y be a constant morphism in C\C. To show that G(f):G(X)G(Y)G(f) : G(X) \to G(Y) is constant, let y1,y2:TG(X)y_1,y_2 : T \rightrightarrows G(X) be two morphisms. Under the adjunction, these correspond to morphisms x1,x2:F(T)Xx_1,x_2 : F(T) \rightrightarrows X. Since ff is constant, we have fx1=fx2f \circ x_1 = f \circ x_2 as morphisms F(T)YF(T) \rightrightarrows Y. Hence, G(f)y1=G(f)y2G(f) \circ y_1 = G(f) \circ y_2 as morphisms TG(Y)T \rightrightarrows G(Y). \square

Lemma 4.

If XX is a subterminal object, then any morphism XYX \to Y is constant. If YY is a terminal object, then any morphism XYX \to Y is constant.

Proof. This is immediate from the definitions. \square

Lemma 5.

If f:XYf : X \to Y is a monomorphism that is constant, then XX is subterminal.

Proof. If x1,x2:TXx_1,x_2 : T \rightrightarrows X are morphisms, then fx1=fx2f \circ x_1 = f \circ x_2 since ff is constant. Since ff is also a monomorphism, we infer that x1=x2x_1 = x_2. \square

Of course, all results on constant morphisms dualize to results on coconstant morphisms (except for Lemma 2). For example, Lemma 5 implies that if an epimorphism f:XYf : X \to Y is coconstant, then YY is "co-subterminal", i.e. every two morphisms YTY \rightrightarrows T are equal.

Context

This page is referenced by the following morphisms.