Closed

Rearranging weighted vanishing families

Lemma 1.17.1. (Rearranging weighted vanishing families). Let I,JI,J be countable sets, let ui,vj>0u_i,v_j>0, and let EE be a Banach KK-space. There is a natural isometric isomorphism Cu(I,Cv(J,E))→ ∼ Cu⊠v(I×J,E),(u⊠v)ij=uivj,\mathcal C_u\bigl(I,\mathcal C_v(J,E)\bigr) \xrightarrow{\ \sim\ } \mathcal C_{u\boxtimes v}(I\times J,E), \qquad (u\boxtimes v)_{ij}=u_iv_j, 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 N\mathbf N and Z\mathbf Z, 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 eije_{ij} and put bi=sup⁡jvj∥eij∥b_i=\sup_j v_j\|e_{ij}\|. Suppose first that the joint weighted family tends to zero outside finite subsets. Each fixed row belongs to Cv(J,E)\mathcal C_v(J,E), since ui>0u_i>0. If uibi≥ϵ>0u_ib_i\geq\epsilon>0, some entry in that row satisfies uivj∥eij∥>ϵ/2u_iv_j\|e_{ij}\|>\epsilon/2. There are only finitely many such entries, and hence only finitely many such rows. Thus (rowi)i(\text{row}_i)_i satisfies the outer finite-tail condition.

Conversely, suppose that every row has a vanishing weighted tail and that (uibi)i(u_ib_i)_i tends to zero outside finite subsets. An entry of joint weight at least ϵ\epsilon lies in a row with uibi≥ϵu_ib_i\geq\epsilon. There are finitely many such rows. In each of them only finitely many entries have joint weight at least ϵ\epsilon, so the union of these finite sets is finite. This proves the converse. Moreover, sup⁡iuisup⁡jvj∥eij∥=sup⁡(i,j)∈I×Juivj∥eij∥.\sup_i u_i\sup_j v_j\|e_{ij}\| =\sup_{(i,j)\in I\times J}u_iv_j\|e_{ij}\|. 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 eije_{ij} 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. ◻

Citation

Non-Archimedean Geometry Foundations, Tag NAG-001552, 1.17.1.

Proof in chapter · Fixed-edition record