Definition in the English reader · PDF page 238
Standing definition · exact TeX
\bi{Write $X=\mathcal M(A)$, and use exactly the site $\mathcal R_X$ of Definition~\ref{fnd:fixedrationalpretopology}: its objects are rational subsets presented over the original $A$, and its coverings are finite set-theoretic coverings by such objects. In particular, the algebra of an object $V$ is denoted by $A_V$.}
{记 $X=\mathcal M(A)$,并严格采用 Definition~\ref{fnd:fixedrationalpretopology} 中的 site $\mathcal R_X$:其对象是在原始 $A$ 上表示的 rational 子集,其覆盖是这些对象组成的有限集合覆盖。特别地,将对象 $V$ 的代数记为 $A_V$。}
\begin{definition}[\bi{A finite Laurent tree in the fixed site}{固定 site 内的有限 Laurent 树}]\label{fnd:fixedrationaltree}
\bi{A finite Laurent tree in this site means a finite rooted binary tree with root $X$, such that each node $V$ is an object of $\mathcal R_X$ and each nonterminal node is covered by an elementary Laurent pair for some $h\in A_V$ and radius in $|K^\times|$. 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.}
{本 site 内的有限 Laurent 树,是指以 $X$ 为根的有限二叉树,其中每个节点 $V$ 均属于 $\mathcal R_X$,且每个非终端节点由某个 $h\in A_V$ 及半径 $r\in|K^\times|$ 定义的 elementary Laurent 对覆盖。两个子节点代数及其交叠代数,须在典范有界同构意义下等于相应的实际 elementary 商。空节点可以作为终端节点。这个定义提出了表示要求,并未断言这种表示存在。}
\end{definition}