Proposition 2.28.11. (Descent along a finite Laurent tree). Let be an -module sheaf, and suppose there is a finite Laurent tree in on whose leaves has finite module models. Then is a finite -module and the canonical morphism is an isomorphism. With any canonical norms on the finite leaf models, the norm of a global matching section obtained by taking the maximum of its leaf restrictions is uniformly equivalent to the canonical norm on .
Proof
Proof. Proceed from leaves towards the root. A zero node has only the zero sheaf and zero module, by the empty covering. Consider a parent whose two children already have finite models . Their common restriction to gives an isomorphism This is an isomorphism of finite modules: evaluate the two sheaf models on and use Lemma 2.28.10. The tree’s presentation condition therefore makes them a finite Laurent gluing datum over . Theorem 2.28.6 produces a finite -module whose two base changes recover the children. The sheaf equalizer identifies with .
For every in the slice, multiplication of restricted sections defines . This gives a morphism of sheaves. On each child it is the base-change isomorphism just proved. For arbitrary , pull back the binary covering to . The morphism is an isomorphism on both members and their intersection, so the two sheaf equalizer diagrams show it is an isomorphism on . This proves the required model on all of , rather than only at the parent object.
The norm comparison at each parent is the explicit equalizer comparison in Theorem 2.28.6. Composing these finitely many two-sided inequalities gives the maximum-of-leaves norm comparison at the root. All constants are finite and may depend on the chosen tree, models and canonical norms. No assertion of a uniform constant over all coverings is made. The finite induction ends at , proving both conclusions. ◻