Definition 2.28.7. (A finite Laurent tree in the fixed site). A finite Laurent tree in this site means a finite rooted binary tree with root , such that each node is an object of and each nonterminal node is covered by an elementary Laurent pair for some and radius in . Its two child algebras and their intersection algebra must be the corresponding actual elementary quotients, up to the canonical bounded isomorphisms. Empty nodes may be terminal. This definition imposes the presentation requirement; it does not assert its existence.
NAG-001526
Citation
Non-Archimedean Geometry Foundations, Tag NAG-001526, 2.28.7.