Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Descent of vector bundles  





2 History  





3 Fully faithful descent  





4 See also  





5 References  





6 Further reading  





7 External links  














Descent (mathematics)







 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 

(Redirected from Descent (category theory))

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

Descent of vector bundles[edit]

The case of the construction of vector bundles from data on a disjoint unionoftopological 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

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

intersection of Xi and Xj, we'll require mappings

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

for transitivity (and choosing apt notation). The fii should be identity maps and hence symmetry becomes (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

now as

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[edit]

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 TDTEontheorems 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[edit]

Let . Each sheaf FonX gives rise to a descent data:

where satisfies the cocycle condition:[1]

.

The fully faithful descent says: is fully faithful. The descent theory tells conditions for which there is a fully faithful descent.

See also[edit]

References[edit]

  1. ^ Descent data for quasi-coherent sheaves, Stacks Project

Further reading[edit]

Other possible sources include:

External links[edit]


Retrieved from "https://en.wikipedia.org/w/index.php?title=Descent_(mathematics)&oldid=1226224438"

Categories: 
Topology
Category theory
Algebraic geometry
Hidden categories: 
Articles with short description
Short description is different from Wikidata
Articles lacking in-text citations from May 2014
All articles lacking in-text citations
 



This page was last edited on 29 May 2024, at 09:02 (UTC).

Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Mobile view



Wikimedia Foundation
Powered by MediaWiki