Discrete opfibration 2026-10-14
A functor with a unique lift, from each specified object , of every arrow . The lifted arrow's target is part of the uniqueness requirement. This is dual to a discrete fibration. Lifting a cocone of a finite connected category gives a cocone upstairs: lifts of its legs have a common target because uniqueness identifies targets along every diagram arrow. Thus a discrete opfibration over a weakly filtered category has weakly filtered domain, including the possibility of an empty domain.
Final-discrete-fibration factorization 2026-09-28
Every functor factors as a final functor followed by a discrete fibration. For , the intermediate category has objects , where and is a connected component of . An arrow is an arrow whose precomposition functor sends to .
Orthogonality of final functors and discrete fibrations Created 2026-09-28 Updated 2026-10-14
Given a commutative square whose left functor is final and whose right functor is a discrete fibration, there is a unique diagonal functor filling the square. To construct its value on an object, choose an object of the relevant connected comma category and lift the resulting arrow; uniqueness of lifts makes the answer constant over that connected category.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 23 3 ii Solution Created 2026-10-03 Updated 2026-10-14
Use the connected-component presheaf of a functor. For , define to have objects , where is a categorical connected component of . An arrow is an arrow such that , where precomposition induces . Identity and composition follow from precomposition, so this is a category.
Define byFor , the objects and lie in the same component of , proving this is well-defined. Clearly .
For , the objects and arrows of are exactly the objects and arrows of the component of . Indeed, an arrow is with , and its commuting triangles are precisely those in the original comma category. This category is nonempty and connected. Hence is a final functor, proving the final-discrete-fibration factorization
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 23 3 i Solution Created 2026-10-03 Updated 2026-10-14
We prove the orthogonality of final functors and discrete fibrations. For , finality supplies an object of . Lift through the discrete fibration , obtainingIf in the comma category, then , and is a lift of with codomain . Uniqueness of that lift makes its domain equal to . Thus ; since the comma category is a connected category, equality propagates along every zigzag. Define to be this common object.
For , choose . Lift into , obtaining . Then lifts into , so its domain is by the preceding construction. Define . The unique lifting property of a discrete fibration proves and , and gives .
At , use ; its lift is , so . Both and are lifts of with the same codomain, hence agree. Therefore .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 25 3 iii Solution Created 2026-10-03 Updated 2026-10-14
Suppose are two such factorizations, with final and discrete fibrations. Apply the unique diagonal construction to the square with left side , top , bottom and right side . It gives a unique functor such that and . Reversing the two factorizations gives with and .
Both and fill the square with left side , top , bottom and right side . Uniqueness from part (i) gives . Similarly . ThusIn particular the conclusion is a canonical isomorphism of intermediate categories, not just an unspecified equivalence.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 25 3 ii Solution Created 2026-10-03 Updated 2026-10-14
For each , let , the collection of connected components, where connectedness means connection by a zigzag of arrows. Precomposition with gives a function . Identity and composition are inherited from precomposition.
Construct a category whose objects are pairs with . An arrow is an arrow satisfying . Composition is that of , and the component equation is preserved by composition. The projection is a discrete fibration: an arrow has precisely one lift into , namely the arrow from represented by .
For an object of , an object of is exactly a pair representing the component . Its morphisms are exactly the arrows in between such objects. Thus this comma category is the component itself, which is nonempty and connected. This proves that is a final functor, and henceThis is the final-discrete-fibration factorization. For small categories the collections are sets and this construction is the category of elements of the presheaf . For categories of a larger size, the construction is interpreted in the same chosen ambient size framework.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 25 3 i Solution Created 2026-10-03 Updated 2026-10-14
Write the square as , with final and a discrete fibration. For , choose an object of the nonempty comma category . Lift uniquely to an arrowover , and tentatively put .
A morphism in this comma category is an arrow with . The composite is a lift of with codomain . Uniqueness of lifts gives , including equality of their source objects. Since the comma category is connected by zigzags, is independent of the choice. Thus is well defined and .
For , take . Lift into , obtaining . Composing with gives a lift of into , whose source must be . Hence . Set . Uniqueness of this lift makes the definition independent of the chosen comma object and proves and .
At , choose . Its lift is , so . For , is the unique lift of into , so . We have constructed the required functor with and .
If is another filler, must equal by unique lifting. Thus for every object. Its arrows are then forced by unique lifting into those objects. ThereforeThis proves the orthogonality of final functors and discrete fibrations.
Past exam of the mathematics course of the University of Cambridge 2010 iii Paper 21 5 Solution Created 2026-10-03 Updated 2026-10-14
Let be a final functor, and let be a cocone under a diagram . For , choose an object of the nonempty comma category and defineIf is a morphism in that comma category, then , so the cocone equation gives . Equality also holds along a reversed arrow, and hence along any zigzag. Connectedness makes the definition independent of the chosen object. For , use and to obtain . Thus is a cocone under . Taking shows that it extends .
Every extension must satisfy by its cocone equation, proving uniqueness. The construction commutes with postcomposition by a morphism . Hence restriction gives a natural bijection between the sets of cocones of and with any fixed vertex. A universal cocone for therefore extends to a universal cocone for . In particular,whenever the latter exists, and existence of all colimits of shape implies existence of all colimits of shape .
For the factorization of an arbitrary functor , letthe set of connected components of a category, where components are defined by finite zigzags. Precomposition by gives a functor and therefore a map . Identity and composition laws make a categorical presheaf. This is a set-valued construction when the relevant comma categories are small or have only a set of components, as in the usual small-category convention for this factorization.
Take to be the category of elements of this presheaf. Its objects are pairs with ; a morphism is an arrow satisfying . Define by forgetting . Given and an object , the unique lift into that object has source and underlying arrow . This proves that is a discrete fibration.
Define . For , take . The arrow in joins to , so the required component equation holds. It follows that is a functor and .
Finally, an object of is a pair whose component in is . Its morphisms are exactly the morphisms of that comma category between objects in . Consequently is precisely the full connected component , and is nonempty and connected. Thus is final, and every such functor factors as a final functor followed by a discrete fibration.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 119 2 ii Solution Created 2026-10-03 Updated 2026-10-05
Use the square's notation . For , choose in the nonempty connected category . Lift through the discrete fibration , obtaining the uniquely determined arrowDefine . If satisfies , then is a lift of with codomain . Uniqueness makes it exactly , including equality of its domain. Connectedness of the comma category therefore makes independent of the chosen object, with strict equality rather than merely an isomorphism.
For , choose and lift with codomain . Write this lift as . Its composite with is the lift of to , so its domain is . Set . The lift of an identity is an identity, and the composite of two lifts is the lift of the composite with the specified codomain. Thus is a functor, and .
At , choose ; its lift is , giving . For , the unique lift of with codomain is , giving on arrows as well. Finally, any other filler must send to the same lift of with codomain , so ; it must also send to the unique lift of with codomain . This proves orthogonality of final functors and discrete fibrations:
Past exam of the mathematics course of the University of Cambridge 2022 iii Paper 119 3 i Solution 2026-09-28
Consider the commutative squarewhere is a final functor and is a discrete fibration. For , choose an object of the nonempty comma category . Commutativity gives an arrowLift it uniquely through with codomain , and define to be the domain of this lift.
This definition does not depend on the choice of . A morphism in the comma category satisfies . The composite of the lift of with is then a lift of with codomain , so uniqueness of discrete-fibration lifts says that it is the chosen lift and has the same domain. Since is connected, all choices give the same object .
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 119 1 b Solution Created 2026-09-24 Updated 2026-09-25
Let be a discrete fibration and let be monic in . If satisfy , lift uniquely to with codomain . The composites are lifts of the same arrow with codomain , so uniqueness gives equality. Since is monic, , hence . Thus is monic.
Use the convention that has objects . Its forgetful functor sends to . Given , the unique arrow above with codomain has domain . Hence the forgetful functor is a discrete fibration.
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 119 1 c iii Solution Created 2026-09-24 Updated 2026-09-25
Suppose a preorder admits a discrete fibration that is surjective on objects. Given in , choose above . The discrete-fibration property lifts to . Every arrow in a preorder is monic, and a discrete fibration preserves monomorphisms by part (b), so is monic. This proves the remaining implication and hence the equivalence.
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 119 1 c ii Solution Created 2026-09-24 Updated 2026-09-25
Assume every category of elements of a representable presheaf is a preorder. LetA disjoint union of preorders is a preorder. The category-of-elements projection is a discrete fibration. It is surjective on objects because is the image of the object in the summand indexed by .
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 119 3 Solution Created 2026-09-24 Updated 2026-09-25
The comma category has objects and morphisms satisfying . An initial object is precisely a universal arrow from to . Such choices for every define a functor and natural bijections , hence a left adjoint functor. The unit of an existing adjunction supplies the initial objects in the reverse direction.
Suppose is final and is a cocone. For , choose in and defineConnectedness of the comma category makes this independent of the choice, and applying the same argument to arrows proves naturality. Any extension must have this value, so it is unique. Cocones under and are therefore naturally the same; a colimit of the latter is a colimit of the former. Thus existence of all -shaped colimits in the target implies existence of the required -shaped colimits.
For arbitrary , define to have objects , where is a connected component of . An arrow is an arrow whose precomposition functor sends into . Let , and let where contains . Then . Given , precomposition selects one and only one component , yielding the unique lift ; hence is a discrete fibration. Moreover identifies with the connected component , so it is nonempty and connected. Thus is a final functor.