##  [Descent](/descent-0) 

 Definition

A method and set of conditions for reconstructing or 'descending' mathematical objects defined over an extension (cover, field, or scheme) to objects over a base by equipping the extended object with compatible descent data (e.g., Galois actions or cocycles) and checking effectiveness.

 

 

 

 

 

 





## Principle

Principle

If an object over an extension carries an action or isomorphisms on overlaps satisfying cocycle compatibilities, and if the descent datum is effective, then there exists a unique (up to isomorphism) object over the base whose pullback recovers the given object; faithfully flat or Galois descent give common frameworks.

 

 

 

 

 





## Demonstration

Demonstration

For vector spaces: a finite-dimensional vector space V over a Galois extension K with a semilinear action of Gal(K/k) satisfying the cocycle conditions descends to a k-vector space W such that V ≅ W ⊗_k K, with invariants V^{Gal(K/k)} giving W. In schemes, descent data on an étale cover glue to a scheme over the base when effective.

 

 

 

 

## Misapplication

Misapplication

Assuming that any object invariant under a group action descends without verifying cocycle/effectivity conditions, or trying to descend structures that require additional rigidity (e.g., descent of line bundles may require checking gluing of transition functions).

 

 

 

 

 





## Consequence

Consequence

Descent translates classification problems over complicated bases into questions about objects with symmetry on covers and connects to cohomological obstructions: failure of descent is measured by nontrivial cohomology classes and descent constructs forms and inner twists.

 

 

 

 

## Reversal

Reversal

The reverse process is base change or extension of scalars: starting with a base object and producing its extension is straightforward, while descent is the inverse and can fail; viewing descent as the inverse highlights necessary compatibility and effectivity conditions.

 

 

 

 

 





## Boundary

Boundary

Effective descent requires specific hypotheses: Galois descent needs a compatible semilinear action, faithfully flat descent requires covering maps with descent of quasi-coherent sheaves, and not every extension or cover yields effective descent for all categories of objects.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Closely related to restriction of scalars, twisting, and forms; restriction of scalars produces an object over the base by accumulating data, while descent recovers an intrinsic base object from compatible extended data — the two can be conflated but serve different roles.

 

 

 

 

 





## Synthesis

Synthesis

Descent is the precise mechanism that turns symmetric or compatible data over extensions/covers into well-defined objects over the base: by encoding and checking cocycle conditions and effectivity, descent either reconstructs the base object or exposes a cohomological obstruction preventing such reconstruction.