Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Descent (mathematics)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Mathematical concept that extends the intuitive idea of gluing in topology}} {{no footnotes|date=May 2014}} In [[mathematics]], the idea of '''descent''' extends the intuitive idea of 'gluing' in [[topology]]. Since the [[quotient space (topology)|topologists' glue]] is the use of [[equivalence relation]]s on [[topological space]]s, the theory starts with some ideas on identification. <!--A sophisticated theory resulted. It was a tribute to the efforts to use [[category theory]] to get around the alleged 'brutality'{{clarify|date=April 2013}} of imposing equivalence relations within geometric categories. One outcome was the eventual definition adopted in [[topos theory]] of [[geometric morphism]], to get the correct notion of [[surjection|surjectivity]].--> ==Descent of vector bundles== The case of the construction of [[vector bundle]]s from data on a [[disjoint union]] of [[topological space]]s is a straightforward place to start. Suppose {{math|''X''}} is a topological space covered by open sets {{math|''X<sub>i</sub>''}}. Let {{math|''Y''}} be the [[disjoint union]] of the {{math|''X<sub>i</sub>''}}, so that there is a natural mapping :<math>p: Y \rightarrow X.</math> We think of {{math|''Y''}} as 'above' {{math|''X''}}, with the {{math|''X<sub>i</sub>''}} projection 'down' onto {{math|''X''}}. With this language, ''descent'' implies a vector bundle on {{math|''Y ''}}(so, a bundle given on each {{math|''X<sub>i</sub>''}}), and our concern is to 'glue' those bundles {{math|''V<sub>i</sub>''}}, to make a single bundle {{math|''V''}} on {{math|''X''}}. What we mean is that {{math|''V''}} should, when restricted to {{math|''X<sub>i</sub>''}}, give back {{math|''V<sub>i</sub>''}}, [[up to]] a bundle isomorphism. The data needed is then this: on each overlap :<math>X_{ij},</math> intersection of {{math|''X''<sub>''i''</sub>}} and {{math|''X''<sub>''j''</sub>}}, we'll require mappings :<math>f_{ij}: V_i \rightarrow V_j</math> to use to identify {{math|''V<sub>i</sub>''}} and {{math|''V<sub>j</sub>''}} there, fiber by fiber. Further the {{math|''f<sub>ij</sub>''}} must satisfy conditions based on the reflexive, symmetric and transitive properties of an equivalence relation (gluing conditions). For example, the composition :<math>f_{jk} \circ f_{ij} = f_{ik}</math> for transitivity (and choosing apt notation). The {{math|''f''<sub>''ii''</sub>}} should be identity maps and hence symmetry becomes <math>f_{ij}=f^{-1}_{ji}</math> (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 {{math|''f''<sub>''ij''</sub>}} 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 {{math|''f''<sub>''ij''</sub>}}, acting on various fibers. Another major point is the relation with the [[chain rule]]: the discussion of the way there of constructing [[tensor field]]s can be summed up as "once you learn to descend the [[tangent bundle]], for which transitivity is the [[Jacobian matrix and determinant|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 :<math>X_{ij}</math> now as :<math>Y \times_X Y,</math> the [[fiber product]] (here an [[Equaliser (mathematics)|equalizer]]) of two copies of the projection {{math|''p''}}. The bundles on the {{math|''X''<sub>''ij''</sub>}} that we must control are {{math|''V''<sub>''i''</sub>}} and {{math|''V''<sub>''j''</sub>}}, the pullbacks to the fiber of {{math|''V''}} via the two different projection maps to {{math|''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 {{math|''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 [[comonad]]s 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 [[Alexander Grothendieck|Grothendieck]] seminar ''TDTE'' on ''theorems of descent and techniques of existence'' (see [[Fondements de la Géometrie Algébrique|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 <math>p:X' \to X</math>. Each sheaf ''F'' on ''X'' gives rise to a descent datum :<math>(F' = p^* F, \alpha: p_0^* F' \simeq p_1^* F'), \, p_i: X'' = X' \times_X X' \to X'</math>, where <math>\alpha</math> satisfies the cocycle condition<ref>{{Citation | title= Descent data for quasi-coherent sheaves, Stacks Project | url=https://stacks.math.columbia.edu/tag/023A}}</ref> :<math>p_{02}^* \alpha = p_{12}^* \alpha \circ p_{01}^* \alpha, \, p_{ij}: X' \times_{X} X' \times_{X} X' \to X' \times_{X} X'</math>. The fully faithful descent says: The functor <math>F \mapsto (F', \alpha)</math> 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 == * [[Grothendieck connection]] * [[Stack (mathematics)]] * [[Galois descent]] * [[Grothendieck topology]] * [[Fibered category]] * [[Beck's monadicity theorem]] * [[Cohomological descent]] * [[Faithfully flat descent]] ==References== {{reflist}} * [[Séminaire de Géométrie Algébrique du Bois Marie#SGA 1|SGA 1]], Ch VIII – this is the main reference * {{cite book | title=Néron Models | series=Ergebnisse der Mathematik und Ihrer Grenzgebiete. 3. Folge | volume=21 |author1=Siegfried Bosch |author2=Werner Lütkebohmert |author3=Michel Raynaud | publisher=[[Springer-Verlag]] | year=1990 | isbn=3540505873 }} A chapter on the descent theory is more accessible than SGA. * {{cite book | editor1-last=Pedicchio | editor1-first=Maria Cristina | editor2-last=Tholen | editor2-first=Walter | title=Categorical foundations. Special topics in order, topology, algebra, and sheaf theory | series=Encyclopedia of Mathematics and Its Applications | volume=97 | location=Cambridge | publisher=[[Cambridge University Press]] | year=2004 | 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 {{arXiv|math.AG/0412512}} * Mattieu Romagny, [http://perso.univ-rennes1.fr/matthieu.romagny/notes/stacks.pdf A straight way to algebraic stacks] == External links == *[https://mathoverflow.net/q/22032 What is descent theory?] {{DEFAULTSORT:Descent (Category Theory)}} [[Category:Topology]] [[Category:Category theory]] [[Category:Algebraic geometry]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)
Pages transcluded onto the current version of this page
(
help
)
:
Template:ArXiv
(
edit
)
Template:Citation
(
edit
)
Template:Cite book
(
edit
)
Template:Math
(
edit
)
Template:No footnotes
(
edit
)
Template:Reflist
(
edit
)
Template:Short description
(
edit
)