Fiber functors are (faithfully) full #
Any (fiber) functor F : C ⥤ FintypeCat
factors via the forgetful functor
from finite Aut F
-sets to finite sets. The induced functor
H : C ⥤ Action FintypeCat (Aut F)
is faithfully full. The faithfulness
follows easily from the faithfulness of F
. In this file we show that H
is also full.
Main results #
PreGaloisCategory.exists_lift_of_mono
: IfY
is a sub-Aut F
-set ofF.obj X
, there exists a sub-objectZ
ofX
such thatF.obj Z ≅ Y
asAut F
-sets.PreGaloisCategory.functorToAction_full
: The induced functorH
from above is full.
The main input for this is that the induced functor H : C ⥤ Action FintypeCat (Aut F)
preserves connectedness, which translates to the fact that Aut F
acts transitively on
the fibers of connected objects.
Let X
be an object of a Galois category with fiber functor F
and Y
a sub-Aut F
-set
of F.obj X
, on which Aut F
acts transitively (i.e. which is connected in the Galois category
of finite Aut F
-sets). Then there exists a connected sub-object Z
of X
and an isomorphism
Y ≅ F.obj X
as Aut F
-sets such that the obvious triangle commutes.
For a version without the connectedness assumption, see exists_lift_of_mono
.
Let X
be an object of a Galois category with fiber functor F
and Y
a sub-Aut F
-set
of F.obj X
. Then there exists a sub-object Z
of X
and an isomorphism
Y ≅ F.obj X
as Aut F
-sets such that the obvious triangle commutes.
The by a fiber functor F : C ⥤ FintypeCat
induced functor functorToAction F
to
finite Aut F
-sets is full.