TheoremBase

Word Polynomials under a Unitary Law: Linearity, Traciality, Positivity, the Cauchy-Schwarz Inequality and the l1 Bound

Evaluation of word polynomials by a unitary law is linear, tracial and compatible with adjoints; it is positive on X*X, satisfies the Cauchy-Schwarz inequality, and is bounded by the l1 norm, which is submultiplicative.

Statement

In the setting of The Real Numbers: Standing Notation and Background, let N\mathbb{N} be the natural numbers, d∈Nd\in\mathbb{N}, W2dW_{2d} and the adjoint words w↦w∗w\mapsto w^{*} as in Words in Unitary Letters: Generators, Signs, Inverse Letters, Lengths and Adjoint Words, and Ld\mathcal{L}_{d} the set of unitary laws of dd-tuples. Word polynomials, the word polynomials ewe_{w}, their products, adjoints, evaluations λ(X)\lambda(X) and ℓ1\ell^{1} norms ∥X∥1\lVert X\rVert_{1} are those of Word Polynomials in Unitary Letters: the Normed *-Algebra of Finitely Supported Word Functions. Let C\mathbb{C} be the complex numbers with conjugation z↦z‾z\mapsto\overline{z} and modulus ∣z∣|z|. Let λ∈Ld\lambda\in\mathcal{L}_{d}, let X,Y,ZX,Y,Z be word polynomials and z∈Cz\in\mathbb{C}.

Then the following hold.

1. (Algebra) (X+Y)Z=XZ+YZ(X+Y)Z=XZ+YZ, Z(X+Y)=ZX+ZYZ(X+Y)=ZX+ZY, (zX)Y=z(XY)=X(zY)(zX)Y=z(XY)=X(zY), (X+Y)∗=X∗+Y∗(X+Y)^{*}=X^{*}+Y^{*}, (zX)∗=z‾ X∗(zX)^{*}=\overline{z}\,X^{*}, (XY)∗=Y∗X∗(XY)^{*}=Y^{*}X^{*}, (X∗)∗=X(X^{*})^{*}=X, (XY)Z=X(YZ)(XY)Z=X(YZ), e∅X=Xe∅=Xe_{\varnothing}X=Xe_{\varnothing}=X, and euev=euve_{u}e_{v}=e_{uv}, (eu)∗=eu∗(e_{u})^{*}=e_{u^{*}} for all u,v∈W2du,v\in W_{2d}.

2. (Linearity) λ(X+Y)=λ(X)+λ(Y)\lambda(X+Y)=\lambda(X)+\lambda(Y) and λ(zX)=z λ(X)\lambda(zX)=z\,\lambda(X).

3. (Traciality) λ(XY)=λ(YX)\lambda(XY)=\lambda(YX).

4. (Adjoints) λ(X∗)=λ(X)‾\lambda(X^{*})=\overline{\lambda(X)}.

5. (Positivity) λ(X∗X)\lambda(X^{*}X) is a nonnegative real number. If XX and YY are self-adjoint, then λ(XY)\lambda(XY) is a real number and λ(XX)≥0\lambda(XX)\ge0.

6. (Cauchy–Schwarz) ∣λ(X∗Y)∣2≤λ(X∗X) λ(Y∗Y)|\lambda(X^{*}Y)|^{2}\le\lambda(X^{*}X)\,\lambda(Y^{*}Y).

7. (ℓ1\ell^{1} bounds) ∣λ(X)∣≤∥X∥1|\lambda(X)|\le\lVert X\rVert_{1}, ∥X+Y∥1≤∥X∥1+∥Y∥1\lVert X+Y\rVert_{1}\le\lVert X\rVert_{1}+\lVert Y\rVert_{1}, ∥zX∥1=∣z∣ ∥X∥1\lVert zX\rVert_{1}=|z|\,\lVert X\rVert_{1}, ∥X∗∥1=∥X∥1\lVert X^{*}\rVert_{1}=\lVert X\rVert_{1} and ∥XY∥1≤∥X∥1∥Y∥1\lVert XY\rVert_{1}\le\lVert X\rVert_{1}\lVert Y\rVert_{1}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…