Closed

Finite binary splitting trees

Theorem 2.21.3. (Finite binary splitting trees). Let NN be a Banach coefficient diagram as above. Take a finite rooted binary tree whose nodes are elements U∈RU\in\mathscr R, with root XX and children U+,U−≤UU_+,U_-\leq U. Assume that for every internal node UU and every V∈RV\in\mathscr R the sequence 0⟶N(U∩V)⟶N(U+∩V)⊕N(U−∩V)→(a,b)↦b∣−a∣N(U+∩U−∩V)⟶00\longrightarrow N(U\cap V) \longrightarrow N(U_+\cap V)\oplus N(U_-\cap V) \xrightarrow{(a,b)\mapsto b|-a|} N(U_+\cap U_-\cap V)\longrightarrow0 is strictly exact. Then the augmented ordered Čech complex of the leaves, restricted to any V∈RV\in\mathscr R, is strictly acyclic in every degree. Its bounds depend only on finitely many restriction bounds and the assumed binary inverse and lifting bounds. The assertion is also valid for the complex using all tuples. It concerns the specified coefficient diagram: verifying the displayed hypothesis on all node intersections is part of applying the theorem.

Proof

Proof. We prove the ordered assertion simultaneously for all VV, by induction on the number of internal nodes. With no internal node the leaf is XX, and the complex is the identity N(V)→N(V)N(V)\to N(V). For the induction step, let P=(Pi)\mathcal P=(P_i) and Q=(Qj)\mathcal Q=(Q_j) be the leaves of the two subtrees rooted at U+U_+ and U−U_-. Order all PiP_i before all QjQ_j. The induction hypothesis applies to either subtree after restriction by any finite intersection in R\mathscr R.

Write W=V∩U+∩U−W=V\cap U_+\cap U_-. The mixed terms are organized by the finite double complex Dp,q=∏i0<⋯<ip∏j0<⋯<jqN(V∩Pi0∩⋯∩Pip∩Qj0∩⋯∩Qjq).D^{p,q}= \prod_{i_0<\cdots<i_p}\prod_{j_0<\cdots<j_q} N(V\cap P_{i_0}\cap\cdots\cap P_{i_p} \cap Q_{j_0}\cap\cdots\cap Q_{j_q}). For a fixed jj-tuple, its horizontal augmentation is the Čech complex of the left subtree restricted to V∩Qj0∩⋯∩QjqV\cap Q_{j_0}\cap\cdots\cap Q_{j_q}. By induction this row is strictly exact, with augmentation term N(U+∩V∩Qj0∩⋯∩Qjq)N(U_+\cap V\cap Q_{j_0}\cap\cdots\cap Q_{j_q}). These augmentation terms form L∙=C∙(Q,N;W)L^\bullet=C^\bullet(\mathcal Q,N;W), which is strictly acyclic after augmentation by N(W)N(W), again by induction. Lemma 2.21.2 therefore proves that N(W)→Tot⁡(D)N(W)\to\operatorname{Tot}(D) is strictly acyclic. The constants are finite because there are finitely many rows and terms.

To see exactly how this total complex occurs, let C∙C^\bullet be the ordered complex of all leaves, without its augmentation, and let K∙K^\bullet be the kernel of restriction to the two pure subcomplexes. A mixed tuple has p+1p+1 left indices followed by q+1q+1 right indices and lies in degree p+q+1p+q+1. The identification Tot⁡(D)[−1] → ∼  K∙,ap,q⟼(−1)pap,q\operatorname{Tot}(D)[-1]\ \xrightarrow{\ \sim\ }\ K^\bullet, \qquad a^{p,q}\longmapsto(-1)^p a^{p,q} is isometric and respects the differential. Indeed, deleting a left index gives dhd_h, while deleting a right index contributes (−1)p+1dv(-1)^{p+1}d_v in the leaf complex. Conjugation by (−1)p(-1)^p gives −dh−(−1)pdv-d_h-(-1)^pd_v, which is the differential of the shift [−1][-1]. This also fixes the sign of the degree-one obstruction.

Let z∈Ckz\in C^k be a cocycle with k≥1k\geq 1. Its two pure restrictions have bounded primitives by induction. Extend these primitives by zero on mixed tuples and subtract their differential. The remaining cocycle z′z' belongs to KkK^k, and its norm is bounded by a fixed multiple of ∥z∥\|z\|. If k≥2k\geq 2, strict acyclicity of Tot⁡(D)\operatorname{Tot}(D) supplies a bounded primitive in Kk−1K^{k-1}. If k=1k=1, exactness at degree zero of the augmented total complex gives a unique w∈N(W)w\in N(W) whose restrictions are the mixed components of z′z', with a bound for ∥w∥\|w\|. The assumed binary surjection at the root gives a∈N(U+∩V)a\in N(U_+\cap V) and b∈N(U−∩V)b\in N(U_-\cap V) with b∣−a∣=wb|-a|=w and a bounded maximum norm. Restrict a,ba,b to the leaves of their respective subtrees. Their differential is zero on pure tuples and equals z′z' on mixed pairs. This supplies the required primitive also in degree one.

In degree zero, a compatible family on the leaves gives unique elements a∈N(U+∩V)a\in N(U_+\cap V) and b∈N(U−∩V)b\in N(U_-\cap V) by induction. Their difference in N(W)N(W) restricts to zero on every mixed pair. The augmentation N(W)→Tot⁡0(D)N(W)\to\operatorname{Tot}^0(D) is injective, so b∣−a∣=0b|-a|=0. Binary exactness gives a unique element of N(V)N(V) inducing the family, with its norm bounded by the binary inverse bound and the two subtree bounds. If an element of N(V)N(V) restricts to zero on all leaves, the same injectivity argument makes it zero. This proves strict acyclicity of the ordered complex.

Finally, [StacksAlg] (Tag 01FM, Lemma 20.23.6) identifies the ordered (equivalently alternating) complex and the complex using all tuples by homotopy equivalences. The finite-poset presheaf above verifies its scope. The sorting and repeated-index homotopies in equations (20.23.6.1)–(20.23.6.2) use only finite sums with coefficients ±1\pm 1 and the identity identifications of repeated intersections. Hence they are bounded in each degree, with norm at most one for the maximum norms here. The projection to increasing tuples and alternating extension are also contractive. If f,gf,g are the resulting comparison maps and gf−1=dh+hdgf-1=dh+hd, a positive-degree cocycle zz with fz=dyfz=dy has primitive gy−hzgy-hz. This proves the required norm bounds for the full complex. The maps preserve the augmentation and the degree-zero cycles, so exactness and the inverse bound at the augmentation are preserved as well. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-001461, 2.21.3.

Proof in chapter · Fixed-edition record