Some remarks on descent data with applications to Galois descent
Cristian D. Gonzalez-Aviles

TL;DR
This paper clarifies the equivalence of two definitions of descent data on schemes and explores their implications for Galois descent of schemes and morphisms.
Contribution
It provides a proof of the equivalence between two definitions of descent data and applies this to Galois descent, enhancing theoretical understanding.
Findings
Proves the equivalence of two descent data definitions.
Discusses Galois descent of schemes and morphisms.
Clarifies conceptual foundations of descent theory.
Abstract
In this expository paper we present a proof of the equivalence of the standard definition of descent data on schemes with another one mentioned in the literature that involves certain cartesian diagrams. Using this equivalence, we discuss the Galois descent of both schemes and morphisms of schemes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Alkaloids: synthesis and pharmacology
Some remarks on descent data with applications to Galois descent
Cristian D. González-Avilés
Departamento de Matemáticas, Universidad de La Serena, Cisternas 1200, La Serena 1700000, Chile
Abstract.
We present a proof of the equivalence of the standard definition of descent data on schemes with another one mentioned in the literature that involves certain cartesian diagrams. Using this equivalence, we discuss the Galois descent of both schemes and morphisms of schemes.
Key words and phrases:
Descent data, Galois descent, cartesian square.
2010 Mathematics Subject Classification:
Primary 14-02, Secondary 14-01
Partially supported by Fondecyt grant 1160004.
0. Introduction
In this expository paper we present a detailed proof of the equivalence of the standard definition of descent data on schemes with another one mentioned in the literature that involves certain cartesian diagrams. See Section 2. To our knowledge, no detailed proof of this equivalence has appeared in print. As an application, we provide in Section 3 the missing details of the discussion of Galois descent contained in [BLR, §6.2, Example B, pp. 139-140]. The subject of Galois descent is discussed amply in the literature, but mostly over a field. Even when a more general base scheme is allowed, some important details are omitted (for another example of such omissions, see [GW, comments after (14.20.1), p. 457]). In Section 4, as an application of the detailed discussion of Section 3, we generalize the standard result on Galois descent for morphisms of schemes over a field [J, Proposition 2.8] to an arbitrary base scheme. More precisely, we show that, if is a finite Galois covering of schemes with Galois group and is an -morphism of -schemes that descend to , then descends to if, and only if, is invariant under the action of on morphisms defined by (4.1).
Acknowledgement
I thank Mikhail Borovoi for his constructive criticism of the first version of this paper.
1. Preliminaries
The identity morphism of an object of a category will be denoted by .
If is a scheme, will denote the category of -schemes. If is an -scheme, will denote the group of -automorphisms of .
Given morphisms of schemes , we will write for the fiber product of and . When and are not relevant, we will write for . If is an -morphism of schemes, will denote the -morphism of schemes .
Recall that a commutative diagram in a category
[TABLE]
is cartesian if for every commutative diagram of solid arrows in
[TABLE]
there exists a unique arrow in such that the full diagram (1.2) commutes. It is easy to check that (1.1) is cartesian if both horizontal arrows and are isomorphisms. Further, if (1.1) is cartesian and is an isomorphism in , then
[TABLE]
is cartesian as well. We will also need the following fact.
Lemma 1.1**.**
If
[TABLE]
is a cartesian square in the category of schemes for every in some index set, then the diagram
[TABLE]
is cartesian as well.
Proof.
(Sketch) This may be verified by starting with a commutative diagram
[TABLE]
and considering, for every , the commutative diagram
[TABLE]
∎
For more information on fiber products and coproducts of schemes and cartesian diagrams, see [, Chapter 0, §1.2, and Chapter I, §3.1].
2. Descent data on schemes
In this Section we reformulate the standard definitions of covering data and descent data on schemes (these standard definitions can be found, for example, in [BLR, Chapter 6]). We focus on schemes, but similar considerations apply to quasi-coherent modules.
Let be a morphism of schemes, set and let () be the canonical projection onto the -th factor. Then the following diagram is cartesian
[TABLE]
Further, set and let be given (set-theoretically) by , where or . Note that
[TABLE]
where the first (respectively, second, third) common composition is the projection onto the first (respectively, second, third) factor.
If is an -scheme and or 2, we will write and regard it as an -scheme via . Further, we will write . The -schemes (with structural morphisms ) and morphisms are defined similarly. The equalities (2.2)-(2.4) induce various identifications among these objects. For example, by (2.4),
[TABLE]
Recall that a covering datum on relative to is an isomorphism of -schemes .
Set and let be a covering datum on . In particular, . Define
[TABLE]
Then the following diagram, which is an instance of diagram (1.3), is cartesian for and :
[TABLE]
Conversely, assume that there exist cartesian diagrams of the form (2.8) such that (2.6) holds. Then there exist unique morphisms and such that the following diagrams commute:
[TABLE]
and
[TABLE]
Since the diagrams
[TABLE]
and
[TABLE]
commute, (respectively, ) is the identity morphism of (respectively, ). Thus we obtain an -isomorphism (i.e., a covering datum on relative to ) such that (2.7) holds.
We conclude that to give a covering datum on relative to is equivalent to giving a pair of cartesian diagrams (2.8) such that (2.6) holds.
Now let again be a covering datum on relative to and define and by (2.6) and (2.7), respectively. Further, write (2.2) and note that (2.3). Then we may discuss the -isomorphism in analogy to the foregoing discussion of the -isomorphism . Thus we define
[TABLE]
Since , the following diagram is cartesian for and as an instance of diagram (1.3):
[TABLE]
Now, by the commutativity of
[TABLE]
and the equalities (2.6), (2.7), (2.9), (2.10) and (2.11), we have
[TABLE]
Assume now that is, in fact, a descent datum on relative to , i.e., the following diagram of isomorphisms of -schemes, where the equalities are induced by (2.2), (2.3) and (2.4), commutes:
[TABLE]
Then
[TABLE]
Indeed, by (2.5), (2.7), (2.10), (2.11), (2.12) and (2.15), we have
[TABLE]
Thus we obtain six commutative diagrams
[TABLE]
where or , or , the squares are cartesian, equations (2.6), (2.7), (2.9), (2.10) and (2.11) hold (where is the covering datum on determined by the right-hand square in (2.17) for ) and the various top horizontal compositions satisfy the relations (2.13), (2.14) and (2.16).
Conversely, assume that there exist commutative diagrams of the form (2.17) with cartesian squares such that (2.6), (2.7) (where is the covering datum on determined by the right-hand square in (2.17) for ), (2.9), (2.10), (2.14) and (2.16) hold. Then (2.13) also holds since it follows from (2.2), (2.6), (2.9) and (2.10). We will show that (2.11) holds as well and that diagram (2.15) commutes, i.e., is a descent datum on relative to .
By (2.7), (2.9) and the commutativity of (2.12), the following diagram commutes
[TABLE]
Further, is the unique morphism such that . Similarly, there exists an -isomorphism such that the following diagram commutes
[TABLE]
where we have used (2.6). Moreover, is the unique morphism that satisfies the identity . Now (2.3), (2.14) and the preceding uniqueness statements imply that , whence , i.e., (2.11) holds. Finally, the diagram with cartesian square (where the equalities come from (2.4) and (2.16))
[TABLE]
commutes for and . Indeed, since (2.12) commutes and (2.7), (2.10) and (2.11) hold, we have
[TABLE]
and
[TABLE]
Thus , i.e., the cocycle condition (2.15) is satisfied.
We conclude that to give a descent datum on relative to is equivalent to giving six commutative diagrams of the form (2.17) consisting of cartesian squares such that (2.6), (2.7) (where is the covering datum on determined by the right-hand square in (2.17) for ), (2.9), (2.10), (2.14) and (2.16) hold.
To conclude this Section, we observe that, if is an -scheme, then the -scheme is endowed with a canonical descent datum , namely the composite -isomorphism
[TABLE]
where the second equality holds by the commutativity of (2.1). Set-theoretically, can be described by the formula
[TABLE]
where and .
3. Galois descent of schemes
In this Section we use the developments of the previous Section to discuss Galois descent of schemes. Compare with [BLR, §6.2, Example B, pp. 139-140].
Recall that a morphism of schemes is said to be finite and locally free if is affine and is a finite and locally free -module. Equivalently, is finite, flat and locally of finite presentation.
Let be a finite, surjective and locally free morphism (in particular, is faithfully flat and quasi-compact) and let be a subgroup of . If is an -scheme, an action of on over (via automorphisms) is a group homomorphism .
For every scheme , set . Then induces an action of the -group scheme on over , i.e., an -morphism subject to well-known conditions. We will henceforth identify and so that the preceding morphism will be written as . Now set
[TABLE]
We will regard as an -scheme via (whence is an -morphism). The canonical action of on over , i.e., the -morphism will be written as
[TABLE]
We now assume that is a Galois covering with Galois group , i.e., the morphism of -schemes
[TABLE]
is an isomorphism.
For example, if is a finite Galois extension of fields with Galois group , then the canonical morphism is a Galois covering. In effect, in this case (3.2) is the isomorphism of -schemes induced by the isomorphism of -algebras .
Clearly, the following diagrams commute
[TABLE]
and
[TABLE]
Further, since (3.2) is an isomorphism, the morphism of -schemes
[TABLE]
is an isomorphism as well.
We now define -morphisms by the formulas
[TABLE]
Then the following diagram commutes for and :
[TABLE]
Let be an -scheme and recall the schemes and . We will make the identifications
[TABLE]
Via the above identifications, and induce isomorphisms
[TABLE]
and
[TABLE]
where we have used the commutativity of (3.3) and (3.9) to obtain the indicated set-theoretic formulas.
Now let be an action of on over which is compatible with the canonical action of on over , i.e., if is the -morphism induced by , then the following diagram of -morphisms commutes
[TABLE]
where is given by (3.1). We will show that defines a descent datum on relative to by constructing a diagram of the form (2.17) with cartesian squares such that (2.6), (2.7) (where is the covering datum on determined by the right-hand square in (2.17) for ), (2.9), (2.10), (2.14) and (2.16) hold (see the previous Section).
We begin by noting that (3.12) may be written as
[TABLE]
Now since
[TABLE]
is cartesian for every , Lemma (1.1) shows that the equivalent diagrams (3.12) and (3.13) are cartesian as well. We now observe that, if
[TABLE]
then the cartesian square (3.12) decomposes as
[TABLE]
where the lower part of the diagram commutes by the commutativity of (3.4). We conclude that the right-hand square in (3.16) is cartesian. Thus, setting (whence (2.6) holds), there exist cartesian diagrams for and
[TABLE]
that define a covering datum on relative to such that (2.7) holds.
Now let be given by the formulas
[TABLE]
Then (2.6), (3.10), (3.17) and (3.19) yield
[TABLE]
Further, since for all , we have
[TABLE]
Define
[TABLE]
Then (2.14) and (2.16) follow at once from (3.15). (3.20) and (3.21). Further, since for and , the commutativity of (3.9) shows that for such , i.e., (2.9) and (2.10) hold. Next, the diagram
[TABLE]
is cartesian for and . This is clear if or . If , then (3.22) is cartesian because (3.12) is cartesian. Now (3.22) decomposes as
[TABLE]
where the bottom part of the diagram commutes by the commutativity of (3.9). Consequently, the central square above is cartesian. Thus we obtain the desired commutative diagrams with cartesian squares
[TABLE]
such that (2.6), (2.7), (2.9), (2.10), (2.14) and (2.16) hold.
The descent datum on relative to thus associated to may be described (set-theoretically) as follows. By (2.7) and (3.15), we have
[TABLE]
It then follows that is given by the formula
[TABLE]
where is the unique element of such that .
Example 3.1*.*
Let be an -scheme. Then is canonically endowed with an action of over that is compatible with , namely . The associated descent datum on (relative to ) is the isomorphism of -schemes (2.18).
4. Galois descent of morphisms
We keep the notation and hypotheses of the previous Section. In this Section we generalize the standard result [J, Proposition 2.8] on the Galois descent of morphisms of -schemes, where is a field, to an arbitrary base scheme .
For or 2, let be an -scheme equipped with an action that is compatible with the canonical action of on over . If is an -morphism, i.e., , then the commutativity of (3.14) (for both and ) shows that is a morphism of -schemes for every . Thus we may define a left action of on the set by
[TABLE]
Now, for and , let be the descent datum on associated to in the previous Section. Note that for and 2.
Proposition 4.1**.**
Let . Then is invariant under the action of if, and only if, the diagram
[TABLE]
commutes.
Proof.
By the definition (4.1), we need to show that (4.2) commutes if, and only if,
[TABLE]
commutes. By (3.24) applied to both and , the preceding diagram decomposes as
[TABLE]
where the left-hand and right-hand squares commute. Thus, if (4.2) commutes, then (4.3) commutes as well. Conversely, assume that (4.3), i.e., the outer diagram in (4.4), commutes. To show that (4.2) commutes, it suffices to check that the diagram with cartesian square
[TABLE]
commutes for and . The above diagram clearly commutes if . Now, since is an isomorphim and the outer diagram and left-hand square in (4.4) commute, we have , i.e., the top triangle of diagram (4.5) commutes when . The commutativity of the lower triangle in (4.5) when can be checked using the identities and ( and 2). ∎
Recall now that the descent datum is said to be effective if there exist -schemes and -isomorphisms such that the diagram
[TABLE]
commutes. If this is the case, then we say that * descends to * (or to ). By [SGA1, VIII, Corollary 7.6], descends to if is quasi-projective.
Corollary 4.2**.**
Assume that, for and , descends to and let be the corresponding isomorphism of -schemes. Let be an -morphism and define by the commutativity of the diagram
[TABLE]
Then for some -morphism , if, and only if, is invariant under (4.1), i.e., for every , the diagram
[TABLE]
commutes.
Proof.
By [SGA1, Theorem 5.2 and comment after the statement], for some -morphism , if, and only if, the diagram (which is an instance of (4.2))
[TABLE]
commutes (see the next remark). By the proposition, the latter is the case if, and only if, is invariant under the action of . ∎
Remark 4.3*.*
In [SGA1, Theorem 5.2 and comment after the statement], the schemes and have been identified via . Thus the condition in [loc.cit.] that and be equal is indeed equivalent to the commutativity of diagram (4.6).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BLR] Bosch, S., Lütkebohmert, W. and Raynaud, M.: Néron models. Erg. der Math. Grenz. 21 , Springer-Verlag, Berlin, 1990.
- 2[GW] Görtz, U. and Wedhorn, T.: Algebraic geometry I. Schemes with examples and exercises. Advanced Lectures in Mathematics, Vieweg + Teubner, Wiesbaden, 2010.
- 3[SGA 1] Grothendieck, A.: Revêtements étales et groupe fondamental (SGA 1). Séminaire de géométrie algébrique du Bois Marie 1960–61. Lecture Notes in Math. 224 ,Springer-Verlag 1971.
- 4[ EGA I new subscript EGA I new \text{EGA I}_{\kern 0.20999 pt\text{new}} ] Grothendieck, A. and Dieudonné, J.: Éléments de géométrie algébrique I. Le langage des schémas. Grundlehren Math. Wiss. 166 , Springer-Verlag, Berlin, 1971.
- 5[J] Jahnel, J.: The Brauer-Severi variety associated with a central simple algebra (unpublished). Available at https://www.math.uni-bielefeld.de/lag/man/052.pdf
