Induced functor to finite Aut F
-sets #
Any (fiber) functor F : C ⥤ FintypeCat
factors via the forgetful functor
from finite Aut F
-sets to finite sets. In this file we collect basic properties
of the induced functor H : C ⥤ Action FintypeCat (Aut F)
.
See Mathlib.CategoryTheory.Galois.Full
for the proof that H
is (faithfully) full.
def
CategoryTheory.PreGaloisCategory.functorToAction
{C : Type u}
[Category.{v, u} C]
(F : Functor C FintypeCat)
:
Functor C (Action FintypeCat (Aut F))
Any (fiber) functor F : C ⥤ FintypeCat
naturally factors via
the forgetful functor from Action FintypeCat (Aut F)
to FintypeCat
.
Equations
- One or more equations did not get rendered due to their size.
Instances For
theorem
CategoryTheory.PreGaloisCategory.functorToAction_comp_forget₂_eq
{C : Type u}
[Category.{v, u} C]
(F : Functor C FintypeCat)
:
@[simp]
theorem
CategoryTheory.PreGaloisCategory.functorToAction_map
{C : Type u}
[Category.{v, u} C]
(F : Functor C FintypeCat)
{X Y : C}
(f : X ⟶ Y)
:
instance
CategoryTheory.PreGaloisCategory.instMulActionAutCarrierVFintypeCatFunctorObjActionFunctorToAction
{C : Type u}
[Category.{v, u} C]
(F : Functor C FintypeCat)
(X : C)
:
instance
CategoryTheory.PreGaloisCategory.instIsPretransitiveAutCarrierVFintypeCatFunctorObjActionFunctorToActionOfIsGalois
{C : Type u}
[Category.{v, u} C]
(F : Functor C FintypeCat)
[GaloisCategory C]
[FiberFunctor F]
(X : C)
[IsGalois X]
:
MulAction.IsPretransitive (Aut X) ((functorToAction F).obj X).V.carrier
instance
CategoryTheory.PreGaloisCategory.instFaithfulActionFintypeCatAutFunctorFunctorToAction
{C : Type u}
[Category.{v, u} C]
(F : Functor C FintypeCat)
[GaloisCategory C]
[FiberFunctor F]
:
instance
CategoryTheory.PreGaloisCategory.instPreservesColimitsOfShapeActionFintypeCatAutFunctorSingleObjFunctorToActionOfFinite
{C : Type u}
[Category.{v, u} C]
(F : Functor C FintypeCat)
[GaloisCategory C]
[FiberFunctor F]
(G : Type u_1)
[Group G]
[Finite G]
: