Proposition 2.18.4. (Finite diagrams of elementary constraints). Fix a finite labelled list of data , where , and . For each sublist , give radius if and radius if , and put where and all finite-module norms are chosen as in the preceding theorem. These presentations have the following properties. For , the variable inclusions give contractive maps and , compatible with composition and with the augmentation from . Successive imposition of the listed constraints gives the same quotient algebra and the same quotient norm as simultaneous imposition. For any , is isometric, with the evident maps, where a constraint appearing in both lists is imposed only once on the right. Permuting constraints or repeating an identical constraint gives canonical isometric identifications. All these maps commute. For , the corresponding finite-module identification is isometrically. The assertions remain valid when one of the quotient algebras is zero. The algebra is a simultaneous constraint algebra here; no assertion that it represents an analytic-domain intersection is included.
Proof
Proof. Each variable has powers bounded by its displayed radius to the corresponding power. The coefficient inclusions therefore extend contractively by Proposition 1.9.3, kill the indicated relations, and pass to quotient norms. The same coefficient inclusions for are contractive and descend through Theorem 2.17.2. Equality on coefficients and variables proves compatibility with composition; polynomial density extends this equality to the algebras and coefficient modules.
Lemma 2.18.1 identifies the algebra obtained by adjoining the variables in over and imposing their relations with , including equality of the quotient norms. Applying the lemma repeatedly proves the assertion about any order of successive imposition. A permutation of variables preserves the weights term by term and gives the stated isometry.
To remove an identical repeated constraint, first retain separate variables with the same radius. The map sending both to is contractive; the map in the other direction keeps the first variable. In the repeated quotient the two variables are equal. For a positive constraint, both equal . For a negative constraint, , so . Thus the maps are inverse on every coefficient and variable, and hence everywhere by continuity. They are inverse contractions, so are isometries. Theorem 2.18.2, followed by these repetitions and permutations, now identifies the completed tensor product with .
For the module statement, ordinary tensor reparenthesization is supplied by [StacksAlg] (Tag 00D2, Lemma 10.12.7), with -bimodule ; we verify the required norm identification here. Choose a fixed finite presentation . By Theorem 2.17.2, has the quotient presentation , with its displayed quotient norm. Apply that theorem again to the presentation of over supplied by Lemma 2.18.1. Both resulting modules have the quotient presentation and the same norm from . This gives the asserted isometries, with corresponding to . All identities of maps are checked on these generating tensors. If , its further relation quotients and all unital modules are zero, so these assertions hold directly. ◻