Documentation

TauCeti.CategoryTheory.Limits.Shapes.Pullback.DescentDatum

Descent data on objects over a base, relative to a morphism #

Let p : S' ⟶ S be a morphism in a category with pullbacks. A descent datum on an object π : X ⟶ S' over S' relative to p identifies the fibres of X over any two points of S' with the same image in S, compatibly with composition. This file records it in action form: a morphism

act : S' ×_S X ⟶ X, written (s, x) ↦ s · x,

lying over the first projection (π (s · x) = s), with π x · x = x and the cocycle condition s₁ · (s₂ · x) = s₁ · x. In other words, act is an action of the groupoid S' ×_S S' ⇉ S' on X.

Mathematically this is the classical notion of a descent datum, an isomorphism φ : pr₁^* X ≅ pr₂^* X over S' ×_S S' satisfying φ₁₃ = φ₂₃ ∘ φ₁₂: on points, φ sends x in the fibre over s₁ to s₂ · x in the fibre over s₂, and the normalisation and the cocycle condition make s₁ · inverse to s₂ · on these fibres. The action form involves only the pullbacks S' ×_S X and S' ×_S (S' ×_S X), so the cocycle condition is a single equation between two morphisms S' ×_S (S' ×_S X) ⟶ X, with no reassociation of iterated pullbacks. It is the geometric counterpart of the coaction form TauCeti.Algebra.DescentDatum of a descent datum on an algebra: for affine schemes, act is Spec of the coaction (TauCeti.Algebra.DescentDatum.specEquiv).

Mathlib's CategoryTheory.Pseudofunctor.DescentData describes descent data for a pseudofunctor to Cat, relative to a family of morphisms. The structure here is the concrete special case of the pullback pseudofunctor X ↦ Over X and a single morphism p, which Mathlib does not construct.

Main definitions #

A descent datum D is effective when there are an object X over S and a morphism baseChange p X ⟶ D of descent data which is an isomorphism over S'. Effectivity is invariant under isomorphisms of arrows (TauCeti.DescentDatum.exists_baseChange_hom_isIso_of_transportArrow), so an effectivity theorem proved for a normal form of p, such as Spec of a ring map, applies to every arrow isomorphic to it.

References #

A descent datum on X : Over S' relative to p : S' ⟶ S, in action form: a morphism act : S' ×_S X ⟶ X, (s, x) ↦ s · x, with π (s · x) = s, π x · x = x and s₁ · (s₂ · x) = s₁ · x, where π = X.hom.

Instances For
    theorem TauCeti.DescentDatum.ext {C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {inst✝¹ : CategoryTheory.Limits.HasPullbacks C} {S S' : C} {p : S' ⟶ S} {X : CategoryTheory.Over S'} {x y : DescentDatum p X} (act : x.act = y.act) :
    x = y
    theorem TauCeti.DescentDatum.ext_iff {C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {inst✝¹ : CategoryTheory.Limits.HasPullbacks C} {S S' : C} {p : S' ⟶ S} {X : CategoryTheory.Over S'} {x y : DescentDatum p X} :
    x = y ↔ x.act = y.act

    A morphism of descent data: a morphism over S' which intertwines the actions, f (s · x) = s · f x.

    Instances For
      theorem TauCeti.DescentDatum.Hom.ext_iff {C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {inst✝¹ : CategoryTheory.Limits.HasPullbacks C} {S S' : C} {p : S' ⟶ S} {X Y : CategoryTheory.Over S'} {D : DescentDatum p X} {E : DescentDatum p Y} {x y : D.Hom E} :
      x = y ↔ x.hom = y.hom
      theorem TauCeti.DescentDatum.Hom.ext {C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {inst✝¹ : CategoryTheory.Limits.HasPullbacks C} {S S' : C} {p : S' ⟶ S} {X Y : CategoryTheory.Over S'} {D : DescentDatum p X} {E : DescentDatum p Y} {x y : D.Hom E} (hom : x.hom = y.hom) :
      x = y

      The identity morphism of a descent datum.

      Instances For
        def TauCeti.DescentDatum.Hom.comp {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {S S' : C} {p : S' ⟶ S} {X Y Z : CategoryTheory.Over S'} {D : DescentDatum p X} {E : DescentDatum p Y} {F : DescentDatum p Z} (g : E.Hom F) (f : D.Hom E) :
        D.Hom F

        The composite of two morphisms of descent data.

        Instances For
          @[simp]
          theorem TauCeti.DescentDatum.Hom.id_comp {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {S S' : C} {p : S' ⟶ S} {X Y : CategoryTheory.Over S'} {D : DescentDatum p X} {E : DescentDatum p Y} (f : D.Hom E) :
          (id E).comp f = f
          @[simp]
          theorem TauCeti.DescentDatum.Hom.comp_id {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {S S' : C} {p : S' ⟶ S} {X Y : CategoryTheory.Over S'} {D : DescentDatum p X} {E : DescentDatum p Y} (f : D.Hom E) :
          f.comp (id D) = f
          @[simp]
          theorem TauCeti.DescentDatum.Hom.comp_assoc {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {S S' : C} {p : S' ⟶ S} {X Y Z : CategoryTheory.Over S'} {D : DescentDatum p X} {E : DescentDatum p Y} {F : DescentDatum p Z} {W : CategoryTheory.Over S'} {G : DescentDatum p W} (h : F.Hom G) (g : E.Hom F) (f : D.Hom E) :
          (h.comp g).comp f = h.comp (g.comp f)
          noncomputable def TauCeti.DescentDatum.Hom.inv {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {S S' : C} {p : S' ⟶ S} {X Y : CategoryTheory.Over S'} {D : DescentDatum p X} {E : DescentDatum p Y} (f : D.Hom E) [CategoryTheory.IsIso f.hom] :
          E.Hom D

          The inverse of a morphism of descent data whose underlying morphism over S' is an isomorphism.

          Instances For
            noncomputable def TauCeti.DescentDatum.transport {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {S S' : C} {p : S' ⟶ S} {X Y : CategoryTheory.Over S'} (e : X ≅ Y) (E : DescentDatum p Y) :

            The descent datum on X transported from a descent datum on Y along an isomorphism e : X ≅ Y over S': a point s of S' acts by s · x = e⁻¹ (s · e x).

            Instances For
              noncomputable def TauCeti.DescentDatum.transportHom {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {S S' : C} {p : S' ⟶ S} {X Y : CategoryTheory.Over S'} (e : X ≅ Y) (E : DescentDatum p Y) :
              (transport e E).Hom E

              The isomorphism e : X ≅ Y over S' is a morphism from the transported descent datum transport e E to E.

              Instances For
                @[reducible, inline]

                The object over T ×_S S' obtained by pulling an object over S' back along the second projection T ×_S S' ⟶ S'. This is the carrier on which a base-changed descent datum acts.

                Instances For

                  The comparison from the action space of the base-changed datum to the action space of the original datum. On points it sends ((t, s₁), (x, (t, s₂))) to (s₁, x).

                  Instances For

                    Base change of a descent datum along an arbitrary morphism q : T ⟶ S. If D acts on X ⟶ S' relative to p : S' ⟶ S, then D.pullbackAlong q acts on X ×_{S'} (T ×_S S') ⟶ T ×_S S' relative to the base change of p to T.

                    Instances For
                      @[simp]

                      The underlying map of the base-changed action, followed by the projection to X, is the original action applied after forgetting the base-change coordinates.

                      @[simp]

                      The underlying map of the base-changed action, followed by the projection to X, is the original action applied after forgetting the base-change coordinates.

                      The carrier X ×_{S'} (T ×_S S') of the base-changed datum is the base change of X along q : T ⟶ S, through its projection to X.

                      Base change of a morphism of descent data.

                      Instances For
                        @[simp]

                        The underlying morphism of the base-changed morphism is obtained by pullback in Over.

                        Base change preserves morphisms of descent data whose underlying morphism is an isomorphism.

                        @[simp]

                        Base change preserves identity morphisms of descent data.

                        @[simp]
                        theorem TauCeti.DescentDatum.Hom.pullbackAlong_comp {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {S S' : C} {p : S' ⟶ S} {T : C} {X Y Z : CategoryTheory.Over S'} {D : DescentDatum p X} {E : DescentDatum p Y} {F : DescentDatum p Z} (g : E.Hom F) (f : D.Hom E) (q : T ⟶ S) :

                        Base change preserves composition of morphisms of descent data.

                        The canonical descent datum on the base change X ×_S S' of an object X over S: a point s of S' acts by s · (x, s₀) = (x, s).

                        Instances For

                          The morphism of canonical descent data induced by a morphism f : X ⟶ Y over S: its underlying morphism over S' is the base change (x, s) ↦ (f x, s).

                          Instances For

                            The base change X ×_S S' ⟶ Y ×_S S' of a morphism f : X ⟶ Y over S is the pullback of f along the projection Y ×_S S' ⟶ Y.

                            The comparison from the action space of a datum transported along e : Arrow.mk p ≅ Arrow.mk q to the original action space. On points it sends (t, x) to (e⁻¹ t, x).

                            Instances For

                              The action-space comparison for transport is an isomorphism, being the map of pullbacks induced by isomorphisms.

                              The transport of a descent datum along an isomorphism of arrows e : Arrow.mk p ≅ Arrow.mk q. If D acts on X ⟶ S' relative to p : S' ⟶ S, then D.transportArrow e acts on X ⟶ S' ≅ T' relative to q : T' ⟶ T, by t · x = e⁻¹ t · x.

                              Instances For

                                The transported action is the original action after moving the point of T' to S' along e⁻¹: t · x = e⁻¹ t · x.

                                The transport of a morphism of descent data along an isomorphism of arrows.

                                Instances For
                                  @[simp]

                                  Transport along an isomorphism of arrows preserves identity morphisms of descent data.

                                  @[simp]

                                  Transport along an isomorphism of arrows preserves composition of morphisms of descent data.

                                  Transport along an isomorphism of arrows preserves isomorphisms of descent data.

                                  Transporting a descent datum along e and back along e.symm gives back the original datum: the identity of X is an isomorphism of descent data.

                                  Instances For

                                    Transport along an isomorphism of arrows e : Arrow.mk p ≅ Arrow.mk q takes canonical descent data to canonical descent data: for Y₀ over S, the base change of Y₀ ⟶ S ≅ T along q is isomorphic, as a descent datum, to the transport of the base change of Y₀ along p.

                                    Instances For

                                      Effectivity is invariant under isomorphisms of arrows. If the transport of D along e : Arrow.mk p ≅ Arrow.mk q is isomorphic to the canonical descent datum on the base change of Y₀ along q, then D is isomorphic to the canonical descent datum on the base change of Y₀ ⟶ T ≅ S along p.

                                      @[simp]

                                      A morphism of descent data to a canonical descent datum lies over S'.

                                      The comparison from the action space of D.overBaseChange f to the action space of D. On points it sends ((x₀, s), z), with x₀ the image of z in X₀, to (s, z).

                                      Instances For

                                        A descent datum D relative to p : S' ⟶ S, together with a morphism f of descent data to the canonical descent datum on a base change X₀ ×_S S', is a descent datum on Z over X₀ ×_S S' relative to the base change X₀ ×_S S' ⟶ X₀ of p. A point (x₀, s) acts on a point z over (x₀, s₀) by (x₀, s) · z = s · z.

                                        Instances For

                                          The action of D.overBaseChange f is the action of D after forgetting the X₀-coordinate: (x₀, s) · z = s · z.

                                          A morphism of descent data from a canonical descent datum to D.overBaseChange f, relative to X₀ ×_S S' ⟶ X₀, gives a morphism of descent data from a canonical descent datum to D, relative to p: if W lies over X₀, then W ×_{X₀} (X₀ ×_S S') = W ×_S S'.

                                          Instances For

                                            The morphism Hom.ofOverBaseChange h lies over X₀ ×_S S': followed by f, it is the base change of the structure morphism W ⟶ X₀.