NAG-001462 · Accepted whole
Result 2.21.4
2 Analytic spaces, morphisms and fibres
Open in the English reader · PDF page 190
Statement · exact TeX
\begin{theorem}[\bi{All-sign elementary Laurent \v Cech exactness}{全部符号的 elementary Laurent \v Cech 正合性}]\label{fnd:allsignelementarycech}
\bi{Let $K$ be complete for its fixed real-valued non-Archimedean absolute value, allowing the trivial valuation. Let $A$ be a nonzero strict norm-admissible $K$-affinoid algebra with its normalized submultiplicative norm, and let $M$ be a finite $A$-module with the quotient norm from a chosen surjection $A^m\to M$. Fix $n\geq0$, $f_1,\ldots,f_n\in A$, and $r_1,\ldots,r_n\in|K^\times|$. For a set $S$ of signed constraints $(i,+),(i,-)$, use the simultaneous presentation}
{设 $K$ 关于固定实值非阿基米德绝对值完备,允许赋值平凡。设 $A$ 为非零 strict norm-admissible $K$-affinoid 代数,配备归一化次乘范数;$M$ 为有限 $A$-模,配备所选满射 $A^m\to M$ 的商范数。固定 $n\geq0$、$f_1,\ldots,f_n\in A$ 及 $r_1,\ldots,r_n\in|K^\times|$。对符号约束 $(i,+),(i,-)$ 的集合 $S$,使用同时表示}
\[
A(S)=
\frac{A\{(r_i^{-1}T_i)_{(i,+)\in S},(r_iU_i)_{(i,-)\in S}\}}
{(T_i-f_i:(i,+)\in S,\;1-f_iU_i:(i,-)\in S)},
\qquad M(S)=A(S)\otimes_A M,
\]
\bi{with the exact quotient norms, including the zero-algebra convention. For $\sigma\in\{+,-\}^n$ put $S_\sigma=\{(i,\sigma_i):1\leq i\leq n\}$. Then}
{配备精确的商范数,并采用零代数约定。对 $\sigma\in\{+,-\}^n$,记 $S_\sigma=\{(i,\sigma_i):1\leq i\leq n\}$。则}
\[
0\longrightarrow M\longrightarrow
\prod_{\sigma_0}M(S_{\sigma_0})\longrightarrow
\prod_{\sigma_0<\sigma_1}M(S_{\sigma_0}\cup S_{\sigma_1})
\longrightarrow\cdots\longrightarrow0
\]
\bi{is strictly exact in every degree, with the usual alternating restriction differential and maximum norms. The same is true when all tuples, including repetitions, are used. For each fixed datum there is $Q\geq1$ such that the augmentation has inverse bound $Q$ and every positive-degree cocycle $z$ has a primitive of norm at most $Q\|z\|$. The same conclusions hold after imposing any fixed finite collection of elementary constraints first, and replacing $M$ by its finite module over that quotient. Uniformly equivalent canonical norms preserve strict exactness.}
{在每个次数严格正合,其中微分为通常的交错限制,范数为最大范数。使用包括重复在内的全部多重指标时也成立。对每组固定数据,存在 $Q\geq1$,使增广的逆映射界为 $Q$,且每个正次数上闭链 $z$ 都有范数至多为 $Q\|z\|$ 的原像。若先施加任意固定有限组 elementary 约束,再将 $M$ 替换成该商上的有限模,相同结论仍成立。一致等价的 canonical 范数保持严格正合性。}
\end{theorem}
Full selected proof · exact TeX
\begin{proof}
\bi{Take $\mathscr R$ to be the signed-constraint subsets, ordered by reverse inclusion, with meet given by union, and put $N(S)=M(S)$. Proposition~\ref{fnd:elementaryintersectiondiagram} supplies its compatible contractive restrictions, all repeated-constraint identifications, and the exact norm identifications for successive constructions. Lemma~\ref{fnd:strictweightedquotient} and Theorem~\ref{fnd:strictquotientmodule} show that each nonzero $A(S)$ is strict and that $M(S)$ is a finite canonical Banach module. A zero algebra has the zero module.}
{取 $\mathscr R$ 为全部符号约束子集,以反包含排序,并以并集为交,令 $N(S)=M(S)$。Proposition~\ref{fnd:elementaryintersectiondiagram} 给出其相容的 contractive 限制、全部重复约束识别,以及逐次构造的精确范数识别。由 Lemma~\ref{fnd:strictweightedquotient} 与 Theorem~\ref{fnd:strictquotientmodule},每个非零 $A(S)$ 均为 strict,且 $M(S)$ 是有限 canonical Banach 模。零代数对应零模。}
\bi{Split successively according to $f_1,\ldots,f_n$, creating both signs at every node. Consider any such binary splitting after any additional constraint set $S$ has already been imposed. If $A(S)=0$, its entire binary sequence is zero. Otherwise apply Theorem~\ref{fnd:laurentlocalizationmodules} over the strict algebra $A(S)$, to the finite module $M(S)$ and the image of the relevant $f_i$, with radius $r_i$. The simultaneous and iterated presentations, and every arrow of the resulting sequence, agree isometrically by Proposition~\ref{fnd:elementaryintersectiondiagram}. If that constraint already occurs in $S$, repetition is removed by the same proposition. Changing the sign of the last arrow gives the difference convention of Theorem~\ref{fnd:finitebinarytreecech}. Thus the latter theorem applies to every required intersection. Its leaves are exactly the $2^n$ sets $S_\sigma$, and it proves the displayed strict exactness. This argument reapplies the proved binary theorem over each quotient; it does not tensor an exact sequence through an unverified completed functor.}
{依次按照 $f_1,\ldots,f_n$ 分裂,在每个结点都保留两个符号。考察在已经附加任意约束集 $S$ 后的一次二元分裂。若 $A(S)=0$,整个二元序列均为零。否则,以 strict 代数 $A(S)$、有限模 $M(S)$、相应 $f_i$ 的像及半径 $r_i$ 应用 Theorem~\ref{fnd:laurentlocalizationmodules}。由 Proposition~\ref{fnd:elementaryintersectiondiagram},所得序列的同时表示、迭代表示及每个箭头都等距相同。若 $S$ 中已经出现该约束,同一命题消去重复约束。将最后一个箭头变号,即得到 Theorem~\ref{fnd:finitebinarytreecech} 的差映射约定。因此该定理适用于每个所需交叠。其叶结点恰为 $2^n$ 个集合 $S_\sigma$,从而得到所列严格正合性。这一论证是在每个商上重新应用已证明的二元定理,并没有将某个正合序列通过未经验证的完备函子作张量积。}
\bi{A useful bound can be read from the proof. Split off $f_n$ first and write $Q_+,Q_-,Q_0\geq1$ for bounds for the remaining $n-1$ functions over $A_+,A_-,A_0$. In the mixed double complex the two index sets are the same old all-sign set. Fixing a nonempty second tuple $J$, choose $j\in J$. The first cover restricted to that intersection has its $j$th member equal to the whole intersection. The insertion homotopy of \cite[Tag 0G6T, Lemma 20.23.7, second proof]{StacksAlg}, with its sign chosen so that $dh+hd=1$, has norm at most one. In alternating notation it sends a cochain to its component with $j$ prepended; repeated indices give zero. The coefficient meet is unchanged because $j$ already belongs to $J$. The horizontal augmentation is isometric since one of its coordinates is the identity. Thus Lemma~\ref{fnd:strictfinitecechcomparison} gives the bound $Q_0$ for the mixed total complex.}
{从证明中还可读出一个实用的界。先按 $f_n$ 分裂,记其余 $n-1$ 个函数在 $A_+,A_-,A_0$ 上的界为 $Q_+,Q_-,Q_0\geq1$。混合双复形的两组指标都是原来的全部符号集。固定非空的第二组多重指标 $J$,选择 $j\in J$。第一组覆盖限制到该交叠后,其第 $j$ 个成员就是整个交叠。\cite[Tag 0G6T, Lemma 20.23.7, second proof]{StacksAlg} 中的插入同伦,取使 $dh+hd=1$ 的符号后,范数至多为一。用交错记号写,就是取在前面插入 $j$ 的分量;若出现重复指标则取零。由于 $j$ 已属于 $J$,系数的交不变。水平增广因含有一个恒等坐标而等距。因此 Lemma~\ref{fnd:strictfinitecechcomparison} 给出混合总复形的界 $Q_0$。}
\bi{Let $E\geq1$ be the inverse bound for the binary augmentation $M\to M_+\oplus M_-$. Its final map is a quotient isometry by Theorem~\ref{fnd:laurentlocalizationmodules}, so every element of $M_0$ has a lift of norm at most twice its norm (zero is lifted by zero). The induction proof then permits}
{设二元增广 $M\to M_+\oplus M_-$ 的逆映射界为 $E\geq1$。由 Theorem~\ref{fnd:laurentlocalizationmodules},最后的映射为 quotient isometry,故 $M_0$ 的每个元素都有范数至多为其两倍的提升(零提升为零)。于是上述归纳证明允许取}
\[
Q_n=\max\{E,\,2Q_0\}\max\{Q_+,Q_-\},\qquad Q_{\text{empty list}}=1.
\]
\bi{This is a bound for a fixed list and module, not a bound uniform over all data. The insertion homotopies and the ordered-to-all-tuples homotopies do not increase it. Finally, starting with a further fixed constraint quotient is precisely the same argument with that quotient as base. Uniform norm comparisons pass to the finitely presented modules and finite products, proving the assertion for other canonical norms.}
{此界针对固定的函数列与模,并未声称对所有数据一致。插入同伦以及从有序复形到全部指标复形的同伦均不增大这个界。最后,先取额外固定约束的商,只是以该商为基代数重复同一论证。一致范数比较可传到有限表示模与有限直积,故也得到其他 canonical 范数下的结论。}
\end{proof}
Typeset reader excerpt

Typed proof inputs
- BASE-LINEAR · standing context or base
- BASE-LINEAR · standing context or base (requires)
- BASE-REAL · standing context or base
- BASE-REAL · standing context or base (requires)
- BASE-SETS · standing context or base
- BASE-SETS · standing context or base (requires)
- BASE-TOPOLOGY · standing context or base
- BASE-TOPOLOGY · standing context or base (requires)
- CLAUSE:NAG-001461:conditional_binary_tree_all_node_restrictions · typed target unresolved in this export
- CLAUSE:NAG-001461:conditional_binary_tree_all_node_restrictions · typed target unresolved in this export (requires)
- CLAUSE:NAG-001462:all_node_restriction_hypotheses · typed target unresolved in this export
- CLAUSE:NAG-001462:all_node_restriction_hypotheses · typed target unresolved in this export (requires)
- CLAUSE:NAG-001462:fixed_list_recurrence · typed target unresolved in this export
- CLAUSE:NAG-001462:fixed_list_recurrence · typed target unresolved in this export (requires)
Reader cross-references
Proof map
Verified map inputs · NAG-001462
No addressable selected proof input is recorded in this projection.