For a diagram shape , a functor preserves categorical limits of shape if every limiting cone over every diagram is carried to a limiting cone over . It reflects categorical limits of that shape if a cone in is limiting whenever its image cone is limiting. These properties concern cones which are given; reflection is not an assertion that every cone in the target lifts.
Suppose is a full and faithful functor and the image of is limiting. A cone in becomes a cone in , so there is a unique with . Fullness writes for some . Faithfulness gives , and also ensures uniqueness: two such would have the same image, by uniqueness of . Hence the original cone is limiting. This proves every full and faithful functor reflects categorical limits, the limits reflected by full and faithful functors criterion, with no essential-surjectivity requirement.
Take any limiting cone in of the given shape. Since preserves such categorical limits, the cone is limiting in . It is the image under of the cone in . Reflection by therefore says that is limiting in . Since this works for every diagram and every limiting cone of the specified shape, preserves categorical limits of that shape.
Write an object of the slice category as . Its morphisms are arrows in commuting with these structure maps, and the forgetful functor removes the structure map.
Suppose a square in the slice becomes a pullback square in , with vertex . Given a compatible pair of slice arrows and , the underlying pullback gives a unique with the required projection equations. If is one projection, thenwhere is the structure map. Thus is automatically a slice morphism, and underlying uniqueness gives uniqueness in the slice. Hence reflects pullbacks.
Now let be an equaliser of slice arrows . Consider any underlying arrow with . Give the structure map . Then is a slice arrow into , and the slice equaliser gives a unique with . Conversely any underlying with that equation automatically obeys , so there are no additional factorization possibilities outside the slice. Therefore has the ordinary equaliser universal property in . This proves preserves equalisers.
Let be the unique arrow to the terminal object of . DefineThis is a functor into the slice category , because , and . The terminal object of this slice is , exactly , so preserves the terminal object.
The composite preserves pullbacks by hypothesis, and reflects pullbacks by part (b). Part (a), restricted to the pullback shape, therefore shows that preserves pullbacks. The allowed finite-limit criterion now gives that preserves all finite categorical limits, and hence equalisers. Since preserves equalisers, their composite does too. ThusThis is equalizer preservation by pullback-preserving functors. The factorization supplies terminal-object preservation only in the slice; none is asserted for the original .
Articles by others on the same topic
There are currently no matching articles.