Descent (mathematics)

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP






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.




Contents





  • 1 Descent of vector bundles


  • 2 History


  • 3 Fully faithful descent


  • 4 See also


  • 5 References


  • 6 Further reading


  • 7 External links




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:Yrightarrow X.p:Yrightarrow 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


Xij,displaystyle X_ij,X_ij,

intersection of Xi and Xj, we'll require mappings


fij:Vi→Vjdisplaystyle f_ij:V_irightarrow V_jf_ij:V_irightarrow 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


fjk∘fij=fikdisplaystyle f_jkcirc f_ij=f_ikf_jk circ f_ij = f_ik

for transitivity (and choosing apt notation). The fii should be identity maps and hence symmetry becomes fij=fji−1displaystyle f_ij=f_ji^-1f_ij=f^-1_ji (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


Xijdisplaystyle X_ijX_ij

now as


Y×XY,displaystyle Ytimes _XY,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′→Xdisplaystyle p:X'to Xp:X'to X. Each sheaf F on X gives rise to a descent data:


(F′=p∗F,α:p0∗F′≃p1∗F′),pi:X″=X′×XX′→X′displaystyle (F'=p^*F,alpha :p_0^*F'simeq p_1^*F'),,p_i:X''=X'times _XX'to X'(F' = p^* F, alpha: p_0^* F' simeq p_1^* F'), , p_i: X'' = X' times_X X' to X'

where αdisplaystyle alpha alpha satisfies the cocycle condition:



p02∗α=p12∗α∘p01∗α,pij: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''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: F↦(F′,α)displaystyle Fmapsto (F',alpha )Fmapsto (F',alpha ) is fully faithful. The descent theory tells conditions for which there is a fully faithful descent.



See also


  • Grothendieck connection

  • Stack (mathematics)

  • Galois descent

  • Grothendieck topology

  • Fibered category

  • Beck's monadicity theorem

  • Cohomological descent


References





  • 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. 21. Springer-Verlag. ISBN 3540505873..mw-parser-output cite.citationfont-style:inherit.mw-parser-output .citation qquotes:"""""""'""'".mw-parser-output .citation .cs1-lock-free abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .citation .cs1-lock-limited a,.mw-parser-output .citation .cs1-lock-registration abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .citation .cs1-lock-subscription abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registrationcolor:#555.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration spanborder-bottom:1px dotted;cursor:help.mw-parser-output .cs1-ws-icon abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/4/4c/Wikisource-logo.svg/12px-Wikisource-logo.svg.png")no-repeat;background-position:right .1em center.mw-parser-output code.cs1-codecolor:inherit;background:inherit;border:inherit;padding:inherit.mw-parser-output .cs1-hidden-errordisplay:none;font-size:100%.mw-parser-output .cs1-visible-errorfont-size:100%.mw-parser-output .cs1-maintdisplay:none;color:#33aa33;margin-left:0.3em.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-formatfont-size:95%.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-leftpadding-left:0.2em.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-rightpadding-right:0.2em 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. 97. Cambridge: Cambridge University Press. ISBN 0-521-83414-7. Zbl 1034.18001.


Further reading


Other possible sources include:


  • Angelo Vistoli, Notes on Grothendieck topologies, fibered categories and descent theory

  • Mattieu Romagny, A straight way to algebraic stacks


External links


  • http://mathoverflow.net/questions/22032/what-is-descent-theory

Popular posts from this blog

用户:Ww71338ww/绘画

自由群

卑爾根