Theorem 2.21.4. (All-sign elementary Laurent Čech exactness). Let be complete for its fixed real-valued non-Archimedean absolute value, allowing the trivial valuation. Let be a nonzero strict norm-admissible -affinoid algebra with its normalized submultiplicative norm, and let be a finite -module with the quotient norm from a chosen surjection . Fix , , and . For a set of signed constraints , use the simultaneous presentation with the exact quotient norms, including the zero-algebra convention. For put . Then 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 such that the augmentation has inverse bound and every positive-degree cocycle has a primitive of norm at most . The same conclusions hold after imposing any fixed finite collection of elementary constraints first, and replacing by its finite module over that quotient. Uniformly equivalent canonical norms preserve strict exactness.
Proof
Proof. Take to be the signed-constraint subsets, ordered by reverse inclusion, with meet given by union, and put . Proposition 2.18.4 supplies its compatible contractive restrictions, all repeated-constraint identifications, and the exact norm identifications for successive constructions. Lemma 2.17.1 and Theorem 2.17.2 show that each nonzero is strict and that is a finite canonical Banach module. A zero algebra has the zero module.
Split successively according to , creating both signs at every node. Consider any such binary splitting after any additional constraint set has already been imposed. If , its entire binary sequence is zero. Otherwise apply Theorem 2.18.3 over the strict algebra , to the finite module and the image of the relevant , with radius . The simultaneous and iterated presentations, and every arrow of the resulting sequence, agree isometrically by Proposition 2.18.4. If that constraint already occurs in , repetition is removed by the same proposition. Changing the sign of the last arrow gives the difference convention of Theorem 2.21.3. Thus the latter theorem applies to every required intersection. Its leaves are exactly the sets , 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.
A useful bound can be read from the proof. Split off first and write for bounds for the remaining functions over . In the mixed double complex the two index sets are the same old all-sign set. Fixing a nonempty second tuple , choose . The first cover restricted to that intersection has its th member equal to the whole intersection. The insertion homotopy of [StacksAlg] (Tag 0G6T, Lemma 20.23.7, second proof), with its sign chosen so that , has norm at most one. In alternating notation it sends a cochain to its component with prepended; repeated indices give zero. The coefficient meet is unchanged because already belongs to . The horizontal augmentation is isometric since one of its coordinates is the identity. Thus Lemma 2.21.2 gives the bound for the mixed total complex.
Let be the inverse bound for the binary augmentation . Its final map is a quotient isometry by Theorem 2.18.3, so every element of has a lift of norm at most twice its norm (zero is lifted by zero). The induction proof then permits 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. ◻