Lemma 1.17.1. (Rearranging weighted vanishing families). Let be countable sets, let , and let be a Banach -space. There is a natural isometric isomorphism which sends a family of rows to its joint coefficient family. Consequently any finite number of such coefficient constructions can be regrouped or permuted, preserving norms and the finite-tail condition. These identifications commute with bounded coefficient maps. For coefficient algebras or modules indexed by products of copies of and , with multiplicative monomial weights, they also preserve the convolution products and module actions. Empty index sets and empty products are allowed.
Proof
Proof. Write the joint coefficients as and put . Suppose first that the joint weighted family tends to zero outside finite subsets. Each fixed row belongs to , since . If , some entry in that row satisfies . There are only finitely many such entries, and hence only finitely many such rows. Thus satisfies the outer finite-tail condition.
Conversely, suppose that every row has a vanishing weighted tail and that tends to zero outside finite subsets. An entry of joint weight at least lies in a row with . There are finitely many such rows. In each of them only finitely many entries have joint weight at least , so the union of these finite sets is finite. This proves the converse. Moreover, The isomorphism and norm equality follow. Completeness is supplied by Lemma 2.13.1. Repeated application proves the finite regrouping assertion; permutations preserve the joint weights and the same finite subsets. A coefficient map acts on the same in either description and retains its given bound. Finally, finite coefficient convolution is unchanged by these bijections of multiindices. Finite-support families are dense, and Lemma 2.14.3 bounds products and actions. Passing to limits proves the algebra and module assertions. The zero spaces arising from empty index sets and the one-element index set for an empty product satisfy the same formulas. ◻