Symmetric tensor norms and Rademacher truncation
Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Self-checked by the writing AI. New original text: public domain (CC0).
A bounded bilinear form initially controls a sum of tensors by a sum of products of norms. For C*-algebras, sums of squares contain more information. Random signs and functional-calculus truncation connect these two controls. The first step gives a surjection between completed tensor products; injectivity, proved in the next lesson, will turn it into a norm comparison.
We use the basic C*-algebra functional calculus, states and their Cauchy–Schwarz inequality, and the Banach-space projective tensor product. No factor, trace, countability or separability assumption enters.
1. The symmetric square norm
Write for the complex algebraic tensor product. Put
The infimum uses finite decompositions. The projective norm is
We also use the real projective norm on , denoted . This real space identifies with the self-adjoint part of .
Proposition 1.1. Formula (1) defines an involution-invariant norm, with
For self-adjoint , the infimum in (1) can be restricted to self-adjoint factors. For self-adjoint ,
Proof. In a nonzero decomposition, replace all first factors by and second factors by , with . The two square-sum norms can thereby be made equal, without changing their product. Concatenating two balanced decompositions gives a cost at most the sum of their costs. Taking infima proves the triangle inequality. Scalar homogeneity follows by rescaling one factor, and involution preserves every cost.
For a state , Cauchy–Schwarz applied to both and gives . Consequently
Product states therefore define -continuous functionals. States separate elements of each C*-algebra: in a faithful representation, vector states and polarization detect every nonzero operator. On any finite-dimensional subspace their restrictions span its dual. Applying this to the finite spans of the factors of a tensor shows that product states separate algebraic tensors. Thus (1) is nondegenerate. If an algebra is zero, its algebraic tensor product is zero and there is nothing to check.
Since , the elementary-tensor cost is at most . The triangle inequality yields the first inequality in (3). If and , , with all four parts self-adjoint, then
This is a self-adjoint-factor decomposition with exactly the original square sums, proving the restricted infimum assertion. Choose states norming the self-adjoint elements . Equation (5) bounds any decomposition of below by ; the one-term decomposition gives the reverse bound. This proves (4).
For the product estimate, write , . The two unsymmetrized sums and are bounded above by ; similarly for . Hence
For example, the first sum is . Average (7), do the same in , and take square roots. The product decomposition of two tensors then has cost at most four times the product of their costs. Taking infima proves (3).
The completion is thus an involutive algebra with continuous multiplication. Multiplying its norm by makes multiplication submultiplicative. This auxiliary Banach algebra norm is not a C*-norm.
2. A fourth moment with noncommuting coefficients
Let be independent signs, each uniformly distributed on . Expectations below are finite averages over choices. For self-adjoint , put
Lemma 2.1. One has the operator inequalities
Proof. Orthogonality of the signs gives the first equality. Also
Distinct unordered pairs have zero averaged product, so
For any , , because the difference is . Apply this to . The second term in (10) is at most
Finally . All these are operator-order statements; the coefficients were never commuted.
3. Truncating the random sum
For , let , and . These continuous functions vanish at zero, so their functional calculus lies in the original algebra, including when it has no unit.
Lemma 3.1. With (8),
Proof. The first assertion follows from and (9). For ,
because . For the residual is zero. Thus ; functional calculus and (9) give the second assertion.
For a finite random tensor with self-adjoint factors, absorbing the square roots of its probability weights into its factors gives
This estimate does not require uniform operator-norm bounds on the untruncated random sums.
4. A bounded part and a smaller residual
Lemma 4.1. For every self-adjoint algebraic tensor and every , there are self-adjoint algebraic tensors with
Proof. For nonzero , choose a balanced self-adjoint decomposition
Use the same signs in and . Then . Set
The pointwise identity follows by adding and subtracting . In particular, the first residual in (14) uses the full . Using a truncated factor in both residual terms would omit .
The bounded part has projective norm at most . Equations (11)–(12), together with , give
Choose . Then the two bounds are and . Taking sufficiently small gives (13). For , take .
5. Surjectivity at the completion level
Theorem 5.1. The identity on algebraic tensors extends to a surjection
For every in the target and , it has a preimage with
This statement does not yet assert uniqueness of the preimage.
Proof. First suppose is algebraic. Choose and repeatedly apply (13), starting with , to obtain . Put , . Then
The series converges projectively, maps to , and has norm at most . Letting be small gives (17), since .
For a completed self-adjoint , choose self-adjoint algebraic approximants so that their successive differences satisfy in -norm and . This is achieved by making the first approximation error small and later errors decrease geometrically. Lift each by the preceding construction, allowing a summable additional projective error. The sum of these lifts converges projectively and maps to . Taking and the additional errors small proves (17).
Finally, the self-adjoint algebraic tensors are dense in the target: replace any approximant to a self-adjoint by . This justifies the approximation used above.
6. Exercises with complete solutions
Exercise 1. Explain why balancing a decomposition does not change its tensor or its cost.
Solution. Replacing by preserves each tensor. The square sums are multiplied by . Their product of square-root norms is unchanged. If their original norms are , choose the scaling parameter to make them equal.
Exercise 2. Verify (6), including its square-sum identity.
Solution. Expanding and averaging it with its adjoint leaves . Also . Thus , even if do not commute. Summing proves the identities.
Exercise 3. Why do product states separate an algebraic tensor?
Solution. Put all its first and second factors in finite-dimensional spaces . Since states separate elements of each algebra, their restrictions have zero common annihilator on and . In finite dimension their linear spans are the entire dual spaces. Products therefore span , which separates . A tensor annihilated by every product state is zero.
Exercise 4. Derive (10) for two noncommuting self-adjoint elements.
Solution. For , one has . Squaring and averaging kills the two terms linear in , and leaves . No reordering of occurs.
Exercise 5. Prove the residual scalar estimate in Lemma 3.1.
Solution. Inside the residual is zero. Outside it has absolute value . The inequality gives . Squaring gives , and functional calculus preserves this nonnegative scalar inequality.
Exercise 6. Refute the decomposition obtained by truncating both second factors in (14).
Solution. In the scalar case take , . The proposed bounded term is and the two proposed residual terms total , so their sum is , rather than . The missing term is the product of the two residuals, . The asymmetric formula (14) includes it through .
Exercise 7. Show that the same omission can occur at the threshold chosen in Lemma 4.1.
Solution. Take four scalar coefficients . Then , , and . The two events have total probability ; the other values have absolute value at most . The omitted expected residual product is therefore . Thus the omission is relevant even at the proof's specified threshold.
Exercise 8. Check the constants in (15).
Solution. Each residual term costs at most , by (11) and the second moment bound. There are two terms, giving . At , this is , while .
Exercise 9. Compute the geometric-series constant without discarding .
Solution. Equation (18) gives total cost at most times . This is larger than when , and tends to as . Before injectivity is known, this proves approximate bounds for preimages; it does not justify an equality at a positive .
Exercise 10. Construct the summable algebraic differences used in Theorem 5.1.
Solution. Choose algebraic and self-adjoint with . Set , for . The telescoping series converges to . Its total norm is at most . Lift the differences with additional errors summing to any prescribed positive tolerance.
References
Gilles Pisier, Grothendieck's Theorem, past and present, expanded UNCUT author version, 21 August 2013, Section 9, Lemma 9.2 and the full proof of Theorem 9.1, printed pp.29–31 (PDF pp.31–33). The fourth-moment statements, continuous clipping and geometric iteration were actually read. Section 9 of arXiv:1101.4195v3, printed pp.29–30 (PDF pp.31–32), gives the earlier selected truncation proof. These are separately identified source versions.
Sections 1–5 here supply the full symmetric tensor norm, noncommuting operator-order estimates, asymmetric residual and completed real lifting argument. Their bounds are 27/16, 2/3 and 81/16 in the normalization stated here. Pisier's Khintchine constants concern a different formulation; the complex reduction he describes as parallel is not used as a missing proof. This lesson establishes surjectivity and approximate lifts; the next lesson proves uniqueness. Exact transitive C*-algebra and Banach-space foundation closure remains pending.