NAG-001504 · Accepted whole

Finite trees with functions on intermediate rational domains

2 Analytic spaces, morphisms and fibres

Open in the English reader · PDF page 217

Statement · exact TeX
\begin{corollary}[\bi{Finite trees with functions on intermediate rational domains}{允许中间域函数的有限 rational 树}]\label{fnd:finiterationaltowercomparison}
\bi{Take a finite rooted tree of strict rational presentations, with root $A$ and with every child a rational presentation over its parent, using value-group radii. Then every vertex represents a rational subset of $\mathcal M(A)$. All finite intersections of these subsets admit rational presentations over $A$. Their coefficient algebras, restriction maps and associated finite-$A$-module quotients are independent of the chosen flattenings up to unique compatible bounded isomorphisms. A presentation of an intersection obtained by a further finite rational tower has the same comparison.}
{取一棵有限有根的 strict rational 表示树,根为 $A$,每个子结点都是其父结点上的 rational 表示,半径均属于值群。则每个结点都表示 $\mathcal M(A)$ 中的 rational 子集,这些子集的全部有限交叠也都具有 $A$ 上的 rational 表示。其系数代数、限制映射及相应有限 $A$-模商,与展开表示的选择无关,准确地说,不同选择由唯一且相容的有界同构比较。如果某个交叠通过另一有限 rational 塔得到表示,也有相同的比较。}

\bi{Suppose in addition that the children of each nonterminal vertex cover its spectrum. Then the leaves form a finite rational cover of $\mathcal M(A)$. For every finite canonical $A$-module, its augmented ordered and all-tuples leaf \v Cech complexes, with these intersection identifications, are norm-strict exact in every degree. Repeated indices and actual zero quotients are retained with the conventions already stated.}
{进一步假设每个非终端结点的子结点覆盖其谱,则叶结点构成 $\mathcal M(A)$ 的有限 rational 覆盖。对每个有限 canonical $A$-模,使用上述交叠识别得到的叶结点增广 ordered 及 all-tuples \v Cech 复形,在每个次数都 norm-strict 正合。重复指标及实际零商按已有约定保留。}
\end{corollary}
Full selected proof · exact TeX
\begin{proof}
\bi{Apply Theorem~\ref{fnd:strictrationaltransitivity} inductively along the path from the root to each vertex. This terminates because the tree is finite. The point comparison identifies every parent-child map with the corresponding inclusion in $\mathcal M(A)$. Proposition~\ref{fnd:strictrationalintersectionpresentation} now gives each finite intersection over $A$, with its actual relation quotient. Theorem~\ref{fnd:strictrationaldomainup} gives uniqueness and compatibility of its restriction maps. The finite-module identifications follow from Theorem~\ref{fnd:strictrationaltransitivity} on the paths and Theorem~\ref{fnd:strictquotientmodule} on the intersections. An additional finite rational tower is flattened by the same induction, and its presentation of the same subset is then compared by the same uniqueness theorem.}
{沿根到各结点的路径,归纳应用 Theorem~\ref{fnd:strictrationaltransitivity};由于树有限,这个过程终止。谱点比较将每个父子映射识别为 $\mathcal M(A)$ 中的相应包含关系。此时 Proposition~\ref{fnd:strictrationalintersectionpresentation} 给出 $A$ 上每个有限交叠的实际关系商,而 Theorem~\ref{fnd:strictrationaldomainup} 给出限制映射的唯一性及相容性。有限模识别在路径上来自 Theorem~\ref{fnd:strictrationaltransitivity},在交叠上来自 Theorem~\ref{fnd:strictquotientmodule}。另一个有限 rational 塔也由相同归纳展开,再由同一个唯一性定理比较其对相同子集的表示。}

\bi{If the children cover each nonterminal vertex, induction from the leaves towards the root shows that the union of the leaves is the root spectrum. Apply Theorem~\ref{fnd:strictfiniterationalcech} to this finite rational cover of $\mathcal M(A)$. The preceding compatible algebra and module maps identify its terms and differentials with the stated leaf complex. In every fixed degree only finitely many terms occur, so the product of the comparison maps and its inverse are bounded. Such a bounded isomorphism of complexes preserves exactness, closed images and the quotient-to-induced norm comparison on each image. The theorem therefore gives the claimed norm-strict exactness, including its all-tuples convention.}
{若子结点覆盖每个非终端结点,则从叶结点向根归纳可知,所有叶结点的并等于根的谱。对这个 $\mathcal M(A)$ 的有限 rational 覆盖应用 Theorem~\ref{fnd:strictfiniterationalcech}。前面相容的代数及模映射,将其各项及微分与所述叶结点复形识别。在每个固定次数中只有有限多个项,因此比较映射的乘积及其逆均有界。这样的有界复形同构保持正合性、像的闭性,以及每个像上的商范数与诱导范数的比较。因此该定理给出所需 norm-strict 正合性,并包括 all-tuples 约定。}
\end{proof}
Typeset reader excerpt
Typeset mathematical passage from PDF page 217
PDF page 217 · excerpt continues in the reader

Typed proof inputs

Reader cross-references

Proof map

Verified map inputs · NAG-001504

AND · joint registered proof inputs