Closed

Descent along a finite Laurent tree

Proposition 2.28.11. (Descent along a finite Laurent tree). Let F\mathcal F be an OXrat\mathcal O_X^{\mathrm{rat}}-module sheaf, and suppose there is a finite Laurent tree in RX\mathcal R_X on whose leaves F\mathcal F has finite module models. Then M=F(X)M=\mathcal F(X) is a finite AA-module and the canonical morphism M~rat→F\widetilde M^{\mathrm{rat}}\to\mathcal F 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 MM.

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 VV whose two children V+,V−V_+,V_- already have finite models P+,P−P_+,P_-. Their common restriction to V0=V+∩V−V_0=V_+\cap V_- gives an isomorphism AV0⊗AV+P+ ≃ AV0⊗AV−P−.A_{V_0}\otimes_{A_{V_+}}P_+ \ \simeq\ A_{V_0}\otimes_{A_{V_-}}P_-. This is an isomorphism of finite modules: evaluate the two sheaf models on V0V_0 and use Lemma 2.28.10. The tree’s presentation condition therefore makes them a finite Laurent gluing datum over AVA_V. Theorem 2.28.6 produces a finite AVA_V-module PP whose two base changes recover the children. The sheaf equalizer identifies PP with F(V)\mathcal F(V).

For every W⊆VW\subseteq V in the slice, multiplication of restricted sections defines AW⊗AVP→F(W)A_W\otimes_{A_V}P\to\mathcal F(W). This gives a morphism of sheaves. On each child it is the base-change isomorphism just proved. For arbitrary WW, pull back the binary covering to W∩V+,W∩V−W\cap V_+,W\cap V_-. The morphism is an isomorphism on both members and their intersection, so the two sheaf equalizer diagrams show it is an isomorphism on WW. This proves the required model on all of RX/V\mathcal R_X/V, 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 XX, proving both conclusions. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-001530, 2.28.11.

Proof in chapter · Fixed-edition record