Subcategories of comma categories defined by morphism properties #
Given functors L : A ⥤ T
and R : B ⥤ T
and morphism properties P
, Q
and W
on T
, Aand
Brespectively, we define the subcategory
P.Comma L R Q Wof
`Comma L R` where
- objects are objects of
Comma L R
with the structural morphism satisfyingP
, and - morphisms are morphisms of
Comma L R
where the left morphism satisfiesQ
and the right morphism satisfiesW
.
For an object X : T
, this specializes to P.Over Q X
which is the subcategory of Over X
where the structural morphism satisfies P
and where the horizontal morphisms satisfy Q
.
Common examples of the latter are e.g. the category of schemes étale (finite, affine, etc.)
over a base X
. Here Q = ⊤
.
Implementation details #
P.Comma L R Q W
is the subcategory of Comma L R
consisting of
objects X : Comma L R
where X.hom
satisfies P
. The morphisms are given by
morphisms in Comma L R
where the left one satisfies Q
and the right one satisfies W
.
Instances For
A morphism in P.Comma L R Q W
is a morphism in Comma L R
where the left
hom satisfies Q
and the right one satisfies W
.
Instances For
The underlying morphism of objects in Comma L R
.
Equations
Instances For
See Note [custom simps projection]
Equations
Instances For
The identity morphism of an object in P.Comma L R Q W
.
Equations
Instances For
Composition of morphisms in P.Comma L R Q W
.
Equations
Instances For
Equations
If i
is an isomorphism in Comma L R
, it is also a morphism in P.Comma L R Q W
.
Equations
Instances For
Any isomorphism between objects of P.Comma L R Q W
in Comma L R
is also an isomorphism
in P.Comma L R Q W
.
Equations
Instances For
Constructor for isomorphisms in P.Comma L R Q W
from isomorphisms of the left and right
components and naturality in the forward direction.
Equations
Instances For
The forgetful functor.
Equations
Instances For
The forgetful functor from the full subcategory of Comma L R
defined by P
is
fully faithful.
Equations
Instances For
Weaken the conditions on all components.
Equations
Instances For
Weakening the condition on the structure morphisms is fully faithful.
Equations
Instances For
Lift a functor F : C ⥤ Comma L R
to the subcategory P.Comma L R Q W
under
suitable assumptions on F
.
Equations
Instances For
A natural transformation L₁ ⟶ L₂
induces a functor P.Comma L₂ R Q W ⥤ P.Comma L₁ R Q W
.
Equations
Instances For
A natural transformation R₁ ⟶ R₂
induces a functor P.Comma L R₁ Q W ⥤ P.Comma L R₂ Q W
.
Equations
Instances For
Given a morphism property P
on a category C
and an object X : C
, this is the
subcategory of Over X
defined by P
where morphisms satisfy Q
.
Equations
Instances For
The forgetful functor from the full subcategory of Over X
defined by P
to Over X
.
Equations
Instances For
Construct a morphism in P.Over Q X
from a morphism in Over.X
.
Equations
Instances For
Make an object of P.Over Q X
from a morphism f : A ⟶ X
and a proof of P f
.
Equations
Instances For
Make a morphism in P.Over Q X
from a morphism in T
with compatibilities.
Equations
Instances For
Make an isomorphism in P.Over Q X
from an isomorphism in T
with compatibilities.
Equations
Instances For
Given a morphism property P
on a category C
and an object X : C
, this is the
subcategory of Under X
defined by P
where morphisms satisfy Q
.
Equations
Instances For
The forgetful functor from the full subcategory of Under X
defined by P
to Under X
.
Equations
Instances For
Construct a morphism in P.Under Q X
from a morphism in Under.X
.
Equations
Instances For
Make an object of P.Under Q X
from a morphism f : A ⟶ X
and a proof of P f
.
Equations
Instances For
Make a morphism in P.Under Q X
from a morphism in T
with compatibilities.
Equations
Instances For
Make an isomorphism in P.Under Q X
from an isomorphism in T
with compatibilities.