In the setting of The Real Numbers: Standing Notation and Background , let N \mathbb{N} N be the natural numbers , d ∈ N d\in\mathbb{N} d ∈ N , W 2 d W_{2d} W 2 d and the adjoint words w ↦ w ∗ w\mapsto w^{*} w ↦ w ∗ as in Words in Unitary Letters: Generators, Signs, Inverse Letters, Lengths and Adjoint Words , and L d \mathcal{L}_{d} L d the set of unitary laws of d d d -tuples . Word polynomials , the word polynomials e w e_{w} e w , their products , adjoints , evaluations λ ( X ) \lambda(X) λ ( X ) and ℓ 1 \ell^{1} ℓ 1 norms ∥ X ∥ 1 \lVert X\rVert_{1} ∥ X ∥ 1 are those of Word Polynomials in Unitary Letters: the Normed *-Algebra of Finitely Supported Word Functions . Let C \mathbb{C} C be the complex numbers with conjugation z ↦ z ‾ z\mapsto\overline{z} z ↦ z and modulus ∣ z ∣ |z| ∣ z ∣ . Let λ ∈ L d \lambda\in\mathcal{L}_{d} λ ∈ L d , let X , Y , Z X,Y,Z X , Y , Z be word polynomials and z ∈ C z\in\mathbb{C} z ∈ C .
Then the following hold.
1. (Algebra) ¶ ( X + Y ) Z = X Z + Y Z (X+Y)Z=XZ+YZ ( X + Y ) Z = XZ + Y Z , Z ( X + Y ) = Z X + Z Y Z(X+Y)=ZX+ZY Z ( X + Y ) = ZX + Z Y , ( z X ) Y = z ( X Y ) = X ( z Y ) (zX)Y=z(XY)=X(zY) ( z X ) Y = z ( X Y ) = X ( z Y ) , ( X + Y ) ∗ = X ∗ + Y ∗ (X+Y)^{*}=X^{*}+Y^{*} ( X + Y ) ∗ = X ∗ + Y ∗ , ( z X ) ∗ = z ‾ X ∗ (zX)^{*}=\overline{z}\,X^{*} ( z X ) ∗ = z X ∗ , ( X Y ) ∗ = Y ∗ X ∗ (XY)^{*}=Y^{*}X^{*} ( X Y ) ∗ = Y ∗ X ∗ , ( X ∗ ) ∗ = X (X^{*})^{*}=X ( X ∗ ) ∗ = X , ( X Y ) Z = X ( Y Z ) (XY)Z=X(YZ) ( X Y ) Z = X ( Y Z ) , e ∅ X = X e ∅ = X e_{\varnothing}X=Xe_{\varnothing}=X e ∅ X = X e ∅ = X , and e u e v = e u v e_{u}e_{v}=e_{uv} e u e v = e uv , ( e u ) ∗ = e u ∗ (e_{u})^{*}=e_{u^{*}} ( e u ) ∗ = e u ∗ for all u , v ∈ W 2 d u,v\in W_{2d} u , v ∈ W 2 d .
2. (Linearity) ¶ λ ( X + Y ) = λ ( X ) + λ ( Y ) \lambda(X+Y)=\lambda(X)+\lambda(Y) λ ( X + Y ) = λ ( X ) + λ ( Y ) and λ ( z X ) = z λ ( X ) \lambda(zX)=z\,\lambda(X) λ ( z X ) = z λ ( X ) .
3. (Traciality) ¶ λ ( X Y ) = λ ( Y X ) \lambda(XY)=\lambda(YX) λ ( X Y ) = λ ( Y X ) .
4. (Adjoints) ¶ λ ( X ∗ ) = λ ( X ) ‾ \lambda(X^{*})=\overline{\lambda(X)} λ ( X ∗ ) = λ ( X ) .
5. (Positivity) ¶ λ ( X ∗ X ) \lambda(X^{*}X) λ ( X ∗ X ) is a nonnegative real number. If X X X and Y Y Y are self-adjoint, then λ ( X Y ) \lambda(XY) λ ( X Y ) is a real number and λ ( X X ) ≥ 0 \lambda(XX)\ge0 λ ( XX ) ≥ 0 .
6. (Cauchy–Schwarz) ¶ ∣ λ ( X ∗ Y ) ∣ 2 ≤ λ ( X ∗ X ) λ ( Y ∗ Y ) |\lambda(X^{*}Y)|^{2}\le\lambda(X^{*}X)\,\lambda(Y^{*}Y) ∣ λ ( X ∗ Y ) ∣ 2 ≤ λ ( X ∗ X ) λ ( Y ∗ Y ) .
7. (ℓ 1 \ell^{1} ℓ 1 bounds) ¶ ∣ λ ( X ) ∣ ≤ ∥ X ∥ 1 |\lambda(X)|\le\lVert X\rVert_{1} ∣ λ ( X ) ∣ ≤ ∥ X ∥ 1 , ∥ X + Y ∥ 1 ≤ ∥ X ∥ 1 + ∥ Y ∥ 1 \lVert X+Y\rVert_{1}\le\lVert X\rVert_{1}+\lVert Y\rVert_{1} ∥ X + Y ∥ 1 ≤ ∥ X ∥ 1 + ∥ Y ∥ 1 , ∥ z X ∥ 1 = ∣ z ∣ ∥ X ∥ 1 \lVert zX\rVert_{1}=|z|\,\lVert X\rVert_{1} ∥ z X ∥ 1 = ∣ z ∣ ∥ X ∥ 1 , ∥ X ∗ ∥ 1 = ∥ X ∥ 1 \lVert X^{*}\rVert_{1}=\lVert X\rVert_{1} ∥ X ∗ ∥ 1 = ∥ X ∥ 1 and ∥ X Y ∥ 1 ≤ ∥ X ∥ 1 ∥ Y ∥ 1 \lVert XY\rVert_{1}\le\lVert X\rVert_{1}\lVert Y\rVert_{1} ∥ X Y ∥ 1 ≤ ∥ X ∥ 1 ∥ Y ∥ 1 .