Misplaced Pages

Descent (mathematics)

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from Descent (category theory)) Mathematical concept that extends the intuitive idea of gluing in topology
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (May 2014) (Learn how and when to remove this message)

In mathematics, the idea of descent extends the intuitive idea of 'gluing' in topology. Since the topologists' glue is the use of equivalence relations on topological spaces, the theory starts with some ideas on identification.

Descent of vector bundles

The case of the construction of vector bundles from data on a disjoint union of topological spaces is a straightforward place to start.

Suppose X is a topological space covered by open sets Xi. Let Y be the disjoint union of the Xi, so that there is a natural mapping

p : Y → X . {\displaystyle p:Y\rightarrow X.}

We think of Y as 'above' X, with the Xi projection 'down' onto X. With this language, descent implies a vector bundle on Y (so, a bundle given on each Xi), and our concern is to 'glue' those bundles Vi, to make a single bundle V on X. What we mean is that V should, when restricted to Xi, give back Vi, up to a bundle isomorphism.

The data needed is then this: on each overlap

X i j , {\displaystyle X_{ij},}

intersection of Xi and Xj, we'll require mappings

f i j : V i → V j {\displaystyle f_{ij}:V_{i}\rightarrow V_{j}}

to use to identify Vi and Vj there, fiber by fiber. Further the fij must satisfy conditions based on the reflexive, symmetric and transitive properties of an equivalence relation (gluing conditions). For example, the composition

f j k ∘ f i j = f i k {\displaystyle f_{jk}\circ f_{ij}=f_{ik}}

for transitivity (and choosing apt notation). The fii should be identity maps and hence symmetry becomes f i j = f j i − 1 {\displaystyle f_{ij}=f_{ji}^{-1}} (so that it is fiberwise an isomorphism).

These are indeed standard conditions in fiber bundle theory (see transition map). One important application to note is change of fiber: if the fij are all you need to make a bundle, then there are many ways to make an associated bundle. That is, we can take essentially same fij, acting on various fibers.

Another major point is the relation with the chain rule: the discussion of the way there of constructing tensor fields can be summed up as 'once you learn to descend the tangent bundle, for which transitivity is the Jacobian chain rule, the rest is just 'naturality of tensor constructions'.

To move closer towards the abstract theory we need to interpret the disjoint union of the

X i j {\displaystyle X_{ij}}

now as

Y × X Y , {\displaystyle Y\times _{X}Y,}

the fiber product (here an equalizer) of two copies of the projection p. The bundles on the Xij that we must control are V′ and V", the pullbacks to the fiber of V via the two different projection maps to X.

Therefore, by going to a more abstract level one can eliminate the combinatorial side (that is, leave out the indices) and get something that makes sense for p not of the special form of covering with which we began. This then allows a category theory approach: what remains to do is to re-express the gluing conditions.

History

The ideas were developed in the period 1955–1965 (which was roughly the time at which the requirements of algebraic topology were met but those of algebraic geometry were not). From the point of view of abstract category theory the work of comonads of Beck was a summation of those ideas; see Beck's monadicity theorem.

The difficulties of algebraic geometry with passage to the quotient are acute. The urgency (to put it that way) of the problem for the geometers accounts for the title of the 1959 Grothendieck seminar TDTE on theorems of descent and techniques of existence (see FGA) connecting the descent question with the representable functor question in algebraic geometry in general, and the moduli problem in particular.

Fully faithful descent

Let p : X ′ → X {\displaystyle p:X'\to X} . Each sheaf F on X gives rise to a descent datum

( F ′ = p ∗ F , α : p 0 ∗ F ′ ≃ p 1 ∗ F ′ ) , p i : X ″ = X ′ × X X ′ → X ′ {\displaystyle (F'=p^{*}F,\alpha :p_{0}^{*}F'\simeq p_{1}^{*}F'),\,p_{i}:X''=X'\times _{X}X'\to X'} ,

where α {\displaystyle \alpha } satisfies the cocycle condition

p 02 ∗ α = p 12 ∗ α ∘ p 01 ∗ α , p i j : X ′ × X X ′ × X X ′ → X ′ × X X ′ {\displaystyle p_{02}^{*}\alpha =p_{12}^{*}\alpha \circ p_{01}^{*}\alpha ,\,p_{ij}:X'\times _{X}X'\times _{X}X'\to X'\times _{X}X'} .

The fully faithful descent says: The functor F ↦ ( F ′ , α ) {\displaystyle F\mapsto (F',\alpha )} is fully faithful. Descent theory tells conditions for which there is a fully faithful descent, and when this functor is an equivalence of categories.

See also

References

  1. Descent data for quasi-coherent sheaves, Stacks Project
  • SGA 1, Ch VIII – this is the main reference
  • Siegfried Bosch; Werner Lütkebohmert; Michel Raynaud (1990). Néron Models. Ergebnisse der Mathematik und Ihrer Grenzgebiete. 3. Folge. Vol. 21. Springer-Verlag. ISBN 3540505873. A chapter on the descent theory is more accessible than SGA.
  • Pedicchio, Maria Cristina; Tholen, Walter, eds. (2004). Categorical foundations. Special topics in order, topology, algebra, and sheaf theory. Encyclopedia of Mathematics and Its Applications. Vol. 97. Cambridge: Cambridge University Press. ISBN 0-521-83414-7. Zbl 1034.18001.

Further reading

Other possible sources include:

External links

Categories: