Documentation

Mathlib.CategoryTheory.Galois.Prorepresentability

Pro-Representability of fiber functors #

We show that any fiber functor is pro-representable, i.e. there exists a pro-object X : I ⥤ C such that F is naturally isomorphic to the colimit of X ⋙ coyoneda.

From this we deduce the canonical isomorphism of Aut F with the limit over the automorphism groups of all Galois objects.

Main definitions #

Main results #

Implementation details #

The pro-representability statement and the isomorphism of Aut F with the limit over the automorphism groups of all Galois objects naturally forces F to take values in FintypeCat.{u₂} where u₂ is the Hom-universe of C. Since this is used to show that Aut F acts transitively on F.obj X for connected X, we a priori only obtain this result for the mentioned specialized universe setup. To obtain the result for F taking values in an arbitrary FintypeCat.{w}, we postcompose with an equivalence FintypeCat.{w} ≌ FintypeCat.{u₂} and apply the specialized result.

In the following the section Specialized is reserved for the setup where F takes values in FintypeCat.{u₂} and the section General contains results holding for F taking values in an arbitrary FintypeCat.{w}.

References #

A pointed Galois object is a Galois object with a fixed point of its fiber.

Instances For

    The type of homomorphisms between two pointed Galois objects. This is a homomorphism of the underlying objects of C that maps the distinguished points to each other.

    • val : A.obj B.obj

      The underlying homomorphism of C.

    • comp : F.map self.val A.pt = B.pt

      The distinguished point of A is mapped to the distinguished point of B.

    Instances For
      theorem CategoryTheory.PreGaloisCategory.PointedGaloisObject.Hom.ext {C : Type u₁} {inst✝ : Category.{u₂, u₁} C} {inst✝¹ : GaloisCategory C} {F : Functor C FintypeCat} {A B : PointedGaloisObject F} {x y : A.Hom B} (val : x.val = y.val) :
      x = y

      The canonical functor from pointed Galois objects to C.

      Equations
        Instances For

          F ⋙ FintypeCat.incl as a cocone over (can F).op ⋙ coyoneda. This is a colimit cocone (see PreGaloisCategory.isColimìt)

          Equations
            Instances For

              cocone F is a colimit cocone, i.e. F is pro-represented by incl F.

              Equations
                Instances For

                  The diagram sending each pointed Galois object to its automorphism group as an object of C.

                  Equations
                    Instances For
                      noncomputable def CategoryTheory.PreGaloisCategory.AutGalois {C : Type u₁} [Category.{u₂, u₁} C] [GaloisCategory C] (F : Functor C FintypeCat) :
                      Type (max u₁ u₂)

                      The limit of autGaloisSystem.

                      Equations
                        Instances For

                          The canonical projection from AutGalois F to the C-automorphism group of each pointed Galois object.

                          Equations
                            Instances For
                              theorem CategoryTheory.PreGaloisCategory.AutGalois.ext {C : Type u₁} [Category.{u₂, u₁} C] [GaloisCategory C] (F : Functor C FintypeCat) {f g : AutGalois F} (h : ∀ (A : PointedGaloisObject F), (π F A) f = (π F A) g) :
                              f = g

                              Equality of elements of AutGalois F can be checked on the projections on each pointed Galois object.

                              autGalois.π is surjective for every pointed Galois object.

                              Isomorphism between Aut F and AutGalois F #

                              In this section we establish the isomorphism between the automorphism group of F and the limit over the automorphism groups of all Galois objects.

                              We first establish the isomorphism between End F and AutGalois F, from which we deduce that End F is a group, hence End F = Aut F. The isomorphism is built in multiple steps:

                              The endomorphisms of F are isomorphic to the limit over the fibers of F on all Galois objects.

                              Equations
                                Instances For

                                  Functorial isomorphism Aut A ≅ F.obj A for Galois objects A.

                                  Equations
                                    Instances For

                                      The equivalence between endomorphisms of F and the limit over the automorphism groups of all Galois objects.

                                      Equations
                                        Instances For

                                          The monoid isomorphism between endomorphisms of F and the (multiplicative opposite of the) limit of automorphism groups of all Galois objects.

                                          Equations
                                            Instances For

                                              Any endomorphism of a fiber functor is a unit.

                                              Any endomorphism of a fiber functor is an isomorphism.

                                              The automorphism group of F is multiplicatively isomorphic to (the multiplicative opposite of) the limit over the automorphism groups of the Galois objects.

                                              Equations
                                                Instances For
                                                  theorem CategoryTheory.PreGaloisCategory.autMulEquivAutGalois_π {C : Type u₁} [Category.{u₂, u₁} C] [GaloisCategory C] (F : Functor C FintypeCat) [FiberFunctor F] (f : Aut F) (A : C) [IsGalois A] (a : (F.obj A).carrier) :
                                                  F.map ((AutGalois.π F { obj := A, pt := a, isGalois := }) (MulOpposite.unop ((autMulEquivAutGalois F) f))).hom a = f.hom.app A a
                                                  @[simp]
                                                  theorem CategoryTheory.PreGaloisCategory.autMulEquivAutGalois_symm_app {C : Type u₁} [Category.{u₂, u₁} C] [GaloisCategory C] (F : Functor C FintypeCat) [FiberFunctor F] (x : AutGalois F) (A : C) [IsGalois A] (a : (F.obj A).carrier) :
                                                  ((autMulEquivAutGalois F).symm { unop' := x }).hom.app A a = F.map ((AutGalois.π F { obj := A, pt := a, isGalois := }) x).hom a

                                                  The Aut F action on the fiber of a Galois object is transitive. See pretransitive_of_isConnected for the same result for connected objects.

                                                  The Aut F action on the fiber of a connected object is transitive.