(Co)limits in subcategories of comma categories defined by morphism properties #
If P is closed under limits of shape J in Comma L R, then when D has
a limit in Comma L R, the forgetful functor creates this limit.
Equations
Instances For
If Comma L R has limits of shape J and Comma L R is closed under limits of shape
J, then forget L R P ⊤ ⊤ creates limits of shape J.
Equations
Instances For
Let P be stable under composition and base change. If P satisfies cancellation on the right,
the subcategory of Over X defined by P is closed under pullbacks.
Without the cancellation property, this does not in general. Consider for example
P = Function.Surjective on Type.
Equations
Equations
X ⟶ X is the terminal object of P.Over ⊤ X.
Equations
Instances For
If P is stable under composition, base change and satisfies post-cancellation,
Over.forget P ⊤ X creates pullbacks.
Equations
If P is stable under composition, base change and satisfies post-cancellation,
P.Over ⊤ X has pullbacks