TheoremBase

Proof of Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts

lemmalem:nc-polynomials-algebra-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
· 16,945 chars · 28 deps · depth 11 Reason: Proof of the algebra structure of noncommutative polynomials (Goal 4, T1).

The algebra identities are verified coefficientwise, using common finite index sets for linear extension, a reindexing bijection between dependent pair sets for associativity, and word reversal on factorisations for the adjoint of a product.

Proof

We use the definitions The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables (clauses The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §polynomials, The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §linear, The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §monomials, The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §product, The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §adjoint, The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §self-adjoint), Words over a Finite Alphabet: the Empty Word, Concatenation and Reversal, Field, The Complex Numbers, Complex Conjugate, Real and Imaginary Parts of a Complex Number, Vector Space over a Field, Linear Map, Finite Set, Sum over a Finite Index Set, Finite Sum Notation in a Field and Finite Sum Notation in a Vector Space; the sibling drafts Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus and Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability; and the lemmas Properties of a Sum over a Finite Index Set, Properties of Finite Sums, Properties of Finite Sums of Vectors, Elementary Identities in a Vector Space, Zero Products and Elementary Identities in a Field, Additive Cancellation and Elementary Additive Identities in a Field, Properties of Complex Conjugation and Modulus, Canonical Form and Arithmetic of Complex Numbers, Properties of the Canonical Map from the Natural Numbers to an Ordered Field, Basic Properties of Finite Sets, Peeling an Element off a Finite Set, and Unions of Finite Sets, Basic Properties of Initial Segments of the Natural Numbers, Inverse of a Bijection and Characteristic Property of the Ordered Pair.

Preliminaries. Write P=Pn\mathcal{P}=\mathcal{P}_{n}. Arithmetic in C\mathbb{C} uses the field axioms of Field without further mention.

(P1) Sums over a singleton. For an object yy and a map g:{y}→Cg:\{y\}\to\mathbb{C}, ∑x∈{y}g(x)=g(y)\sum_{x\in\{y\}}g(x)=g(y): the set {y}\{y\} has 11 element (claim 2 of Basic Properties of Finite Sets), 1↦y1\mapsto y is a bijection [1]→{y}[1]\to\{y\} as [1]={1}[1]=\{1\} (claim 2 of Basic Properties of Initial Segments of the Natural Numbers), and ∑k=11ak=a1\sum_{k=1}^{1}a_{k}=a_{1} by claim 1 of Properties of Finite Sums; now apply Sum over a Finite Index Set.

(P2) Constants. By claim 1 of Canonical Form and Arithmetic of Complex Numbers, 00, 11 and −1-1 of C\mathbb{C} are real numbers. The natural number 2=1+12=1+1 satisfies ιR(2)=1+1\iota_{\mathbb{R}}(2)=1+1 and ιR(2)≠0\iota_{\mathbb{R}}(2)\neq0 by claims 1 and 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field; so 2=1+12=1+1 is a nonzero real number (its sum in C\mathbb{C} is the real one by condition 1 of The Complex Numbers), and its inverse 12\tfrac12 in C\mathbb{C} is real by claim 1 of Canonical Form and Arithmetic of Complex Numbers. We read −i2-\tfrac{i}{2} as −(i⋅12)-(i\cdot\tfrac12), a2a^{2} as aaaa, and p−qp-q as p+(−1)qp+(-1)q (The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §linear). Also i≠0i\neq0, since i∉Ri\notin\mathbb{R} (claim 2 of Canonical Form and Arithmetic of Complex Numbers) while 0∈R0\in\mathbb{R}.

(P3) Conjugates. By claim 1 of Properties of Complex Conjugation and Modulus, conjugation is additive and multiplicative, involutive, and fixes every real number, in particular 00, 11, −1-1, 12\tfrac12 by (P2); hence z−w‾=z‾−w‾\overline{z-w}=\overline{z}-\overline{w}. Since i=0+1⋅ii=0+1\cdot i with 0,10,1 real, Real and Imaginary Parts of a Complex Number gives Re⁡i=0\operatorname{Re}i=0, Im⁡i=1\operatorname{Im}i=1, so i‾=0−1⋅i=−i\overline{i}=0-1\cdot i=-i by Complex Conjugate.

(P4) C\mathbb{C} as a vector space. As in the statement, C\mathbb{C} is a complex vector space with its field operations (conditions 1-8 of Vector Space over a Field are instances of the field axioms), and its finite sums of vectors (Finite Sum Notation in a Vector Space) are the finite sums of Finite Sum Notation in a Field, both definitions prescribing the same recursion. Linear operations on P\mathcal{P} are pointwise, so for each w∈Wnw\in W_{n} the evaluation evw(p)=p(w)\mathrm{ev}_{w}(p)=p(w) is a linear map P→C\mathcal{P}\to\mathbb{C} (The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §linear, Linear Map), once Claim 1 is shown.

Claim 1 (vector space). By The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §linear, p+qp+q and cpcp are polynomials, and the zero polynomial is a polynomial as its support is empty, hence finite (Finite Set). The conditions of Vector Space over a Field hold pointwise: 1, 2 by axioms 1, 4 of Field; 3 with 0V0_{V} the zero polynomial, by axiom 2; 4 with w=(−1)pw=(-1)p, because (−1)p(v)=−p(v)(-1)p(v)=-p(v) by claim 2 of Zero Products and Elementary Identities in a Field (and 1⋅p(v)=p(v)1\cdot p(v)=p(v)), and p(v)+(−p(v))=0p(v)+(-p(v))=0 by axiom 3; 5 by axiom 5; 6 by axioms 6 and 8; 7 by axiom 9; 8 by axioms 8 and 9. The zero vector is unique by claim 1 of Elementary Identities in a Vector Space, so it is the zero polynomial.

Claim 2 (linear extension). (a) Define ℓ\ell as in the statement. Note p≠0p\neq0 means supp⁡p≠∅\operatorname{supp}p\neq\emptyset, and supp⁡p\operatorname{supp}p is finite (The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §polynomials).

Step 1 (common index sets). If S⊆WnS\subseteq W_{n} is nonempty and finite and supp⁡p⊆S\operatorname{supp}p\subseteq S, then ℓ(p)=∑w∈Sp(w)c(w)\ell(p)=\sum_{w\in S}p(w)c(w). If p=0p=0, every term is 0⋅c(w)=00\cdot c(w)=0 (claim 1 of Zero Products and Elementary Identities in a Field), so the sum is 0=ℓ(0)0=\ell(0) by the first sentence of Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing. If p≠0p\neq0, the terms with w∈S∖supp⁡pw\in S\setminus\operatorname{supp}p are 0⋅c(w)=00\cdot c(w)=0, so the second sentence of Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing, with G=supp⁡pG=\operatorname{supp}p, gives the claim.

Step 2 (linearity). Let p,q∈Pp,q\in\mathcal{P}, λ∈C\lambda\in\mathbb{C}, and S=supp⁡p∪supp⁡q∪{∅}S=\operatorname{supp}p\cup\operatorname{supp}q\cup\{\varnothing\}, nonempty and finite by claims 3 and 1 of Peeling an Element off a Finite Set, and Unions of Finite Sets. It contains supp⁡p\operatorname{supp}p, supp⁡q\operatorname{supp}q, supp⁡(p+q)\operatorname{supp}(p+q) and supp⁡(λp)\operatorname{supp}(\lambda p) (The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §linear). By Step 1, distributivity, and claims 3 and 4 of Properties of a Sum over a Finite Index Set,

ℓ(p+q)=∑w∈S(p(w)c(w)+q(w)c(w))=ℓ(p)+ℓ(q),ℓ(λp)=∑w∈Sλ p(w)c(w)=λ ℓ(p).\ell(p+q)=\sum_{w\in S}\bigl(p(w)c(w)+q(w)c(w)\bigr)=\ell(p)+\ell(q),\qquad \ell(\lambda p)=\sum_{w\in S}\lambda\,p(w)c(w)=\lambda\,\ell(p).

So ℓ\ell is linear (Linear Map, with (P4)).

Step 3. supp⁡xw={w}\operatorname{supp}x_{w}=\{w\} (The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §monomials), so by (P1), ℓ(xw)=xw(w)c(w)=c(w)\ell(x_{w})=x_{w}(w)c(w)=c(w).

Step 4 (expansion in monomials). Let p≠0p\neq0, let NN be the number of elements of supp⁡p\operatorname{supp}p and φ:[N]→supp⁡p\varphi:[N]\to\operatorname{supp}p a bijection (Finite Set), and vk=p(φ(k)) xφ(k)∈Pv_{k}=p(\varphi(k))\,x_{\varphi(k)}\in\mathcal{P}. We claim p=∑k=1Nvkp=\sum_{k=1}^{N}v_{k} (finite sum in the vector space P\mathcal{P}). Fix w∈Wnw\in W_{n}. By claim 4 of Properties of Finite Sums of Vectors applied to evw\mathrm{ev}_{w} (see (P4)), (∑k=1Nvk)(w)=∑k=1Np(φ(k)) xφ(k)(w)\bigl(\sum_{k=1}^{N}v_{k}\bigr)(w)=\sum_{k=1}^{N}p(\varphi(k))\,x_{\varphi(k)}(w). If w∈supp⁡pw\in\operatorname{supp}p, then w=φ(i)w=\varphi(i) for exactly one i∈[N]i\in[N]; the iith term is p(w)p(w) and the others are p(φ(k))⋅0=0p(\varphi(k))\cdot0=0, so the sum is p(w)p(w) by claim 7 of Properties of Finite Sums. If w∉supp⁡pw\notin\operatorname{supp}p, all terms are 00, so the sum is 0=p(w)0=p(w) by the same claim (with i=1i=1).

Step 5 (uniqueness). Let ℓ′\ell' be linear with ℓ′(xw)=c(w)\ell'(x_{w})=c(w) for all ww. Then ℓ′(0)=ℓ′(0⋅0)=0⋅ℓ′(0)=0\ell'(0)=\ell'(0\cdot0)=0\cdot\ell'(0)=0 by claim 3 of Elementary Identities in a Vector Space and annihilation. For p≠0p\neq0, Step 4 and claim 4 of Properties of Finite Sums of Vectors give

ℓ′(p)=∑k=1Np(φ(k)) ℓ′(xφ(k))=∑k=1Np(φ(k)) c(φ(k))=∑w∈supp⁡pp(w)c(w)=ℓ(p),\ell'(p)=\sum_{k=1}^{N}p(\varphi(k))\,\ell'(x_{\varphi(k)})=\sum_{k=1}^{N}p(\varphi(k))\,c(\varphi(k))=\sum_{w\in\operatorname{supp}p}p(w)c(w)=\ell(p),

the third equality by Sum over a Finite Index Set with the bijection φ\varphi. Hence ℓ′=ℓ\ell'=\ell.

(b) Step 1 (T(p)∈PmT(p)\in\mathcal{P}_{m}). Let p≠0p\neq0. If T(p)(v)≠0T(p)(v)\neq0, then by the first sentence of Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing some term p(w)c(w)(v)p(w)c(w)(v) with w∈supp⁡pw\in\operatorname{supp}p is nonzero, so c(w)(v)≠0c(w)(v)\neq0 by annihilation (claim 1 of Zero Products and Elementary Identities in a Field), i.e. v∈supp⁡c(w)v\in\operatorname{supp}c(w). Thus supp⁡T(p)⊆⋃w∈supp⁡psupp⁡c(w)\operatorname{supp}T(p)\subseteq\bigcup_{w\in\operatorname{supp}p}\operatorname{supp}c(w), which is finite by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §finite-union; so T(p)T(p) is a polynomial by claim 3 of Basic Properties of Finite Sets. T(0)=0T(0)=0 is one by Claim 1.

Step 2. For v∈Wmv\in W_{m} let cv(w)=c(w)(v)c_{v}(w)=c(w)(v) and let ℓv\ell_{v} be the linear map of (a) for cvc_{v}. Then T(p)(v)=ℓv(p)T(p)(v)=\ell_{v}(p) for all pp (both are 00 at p=0p=0). Hence T(p+q)(v)=ℓv(p)+ℓv(q)=(T(p)+T(q))(v)T(p+q)(v)=\ell_{v}(p)+\ell_{v}(q)=(T(p)+T(q))(v) and T(λp)(v)=λ T(p)(v)=(λT(p))(v)T(\lambda p)(v)=\lambda\,T(p)(v)=(\lambda T(p))(v), so TT is linear; and T(xw)(v)=ℓv(xw)=c(w)(v)T(x_{w})(v)=\ell_{v}(x_{w})=c(w)(v), so T(xw)=c(w)T(x_{w})=c(w).

Step 3 (uniqueness). If T′T' is linear with T′(xw)=c(w)T'(x_{w})=c(w), then for each vv the composite p↦T′(p)(v)=evv(T′(p))p\mapsto T'(p)(v)=\mathrm{ev}_{v}(T'(p)) is linear (both conditions of Linear Map pass through composition) and sends xwx_{w} to cv(w)c_{v}(w), so it equals ℓv\ell_{v} by (a). Thus T′(p)(v)=T(p)(v)T'(p)(v)=T(p)(v) for all p,vp,v, and T′=TT'=T.

Claim 3 (monomials). By The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §product, (xuxv)(w)=∑(s,t)∈F(w)xu(s)xv(t)(x_{u}x_{v})(w)=\sum_{(s,t)\in F(w)}x_{u}(s)x_{v}(t), and the term is 11 if s=us=u and t=vt=v, and 00 otherwise (annihilation, claim 1 of Zero Products and Elementary Identities in a Field). If w=uvw=uv, then (u,v)∈F(w)(u,v)\in F(w), every (s,t)∈F(w)(s,t)\in F(w) other than (u,v)(u,v) has s≠us\neq u or t≠vt\neq v (Characteristic Property of the Ordered Pair), so by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing with G={(u,v)}G=\{(u,v)\} and (P1) the sum is 11. If w≠uvw\neq uv, no (s,t)∈F(w)(s,t)\in F(w) equals (u,v)(u,v) (else w=st=uvw=st=uv), so the sum is 00 by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing. Hence xuxv=xuvx_{u}x_{v}=x_{uv}.

For 1p1p: (1p)(w)=∑(s,t)∈F(w)x∅(s)p(t)(1p)(w)=\sum_{(s,t)\in F(w)}x_{\varnothing}(s)p(t), and (∅,w)∈F(w)(\varnothing,w)\in F(w) by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §monoid. If (s,t)∈F(w)(s,t)\in F(w) and s=∅s=\varnothing, then t=∅t=wt=\varnothing t=w by the same clause; so every other pair has s≠∅s\neq\varnothing and term 00 (claim 1 of Zero Products and Elementary Identities in a Field). By Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing and (P1), (1p)(w)=x∅(∅)p(w)=p(w)(1p)(w)=x_{\varnothing}(\varnothing)p(w)=p(w). Symmetrically, with the pair (w,∅)(w,\varnothing), (p1)(w)=p(w)(p1)(w)=p(w).

Claim 4 (algebra). Step 1 (distributivity and scalars). For w∈Wnw\in W_{n}, sums over F(w)F(w) and claims 3 and 4 of Properties of a Sum over a Finite Index Set give

(p(q+r))(w)=∑(u,v)∈F(w)(p(u)q(v)+p(u)r(v))=(pq)(w)+(pr)(w),(p(q+r))(w)=\sum_{(u,v)\in F(w)}\bigl(p(u)q(v)+p(u)r(v)\bigr)=(pq)(w)+(pr)(w),

and likewise ((p+q)r)(w)=(pr)(w)+(qr)(w)((p+q)r)(w)=(pr)(w)+(qr)(w), and ((cp)q)(w)=∑c p(u)q(v)=c (pq)(w)=(p(cq))(w)((cp)q)(w)=\sum c\,p(u)q(v)=c\,(pq)(w)=(p(cq))(w).

Step 2 (associativity). Fix ww. By The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §product and claim 4 of Properties of a Sum over a Finite Index Set (with λ=r(z)\lambda=r(z)),

((pq)r)(w)=∑(s,z)∈F(w)(∑(u,v)∈F(s)p(u)q(v)r(z))=∑τ∈T1f(τ),((pq)r)(w)=\sum_{(s,z)\in F(w)}\Bigl(\sum_{(u,v)\in F(s)}p(u)q(v)r(z)\Bigr)=\sum_{\tau\in T_{1}}f(\tau),

where the second equality is Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §pairs with A=F(w)A=F(w) and B((s,z))=F(s)B((s,z))=F(s), nonempty and finite by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §factorisations (well defined by Characteristic Property of the Ordered Pair), T1T_{1} is the set of pairs ((s,z),(u,v))((s,z),(u,v)) with (s,z)∈F(w)(s,z)\in F(w) and (u,v)∈F(s)(u,v)\in F(s), and f(((s,z),(u,v)))=p(u)q(v)r(z)f(((s,z),(u,v)))=p(u)q(v)r(z). In the same way, with λ=p(u)\lambda=p(u),

(p(qr))(w)=∑(u,t)∈F(w)(∑(v,z)∈F(t)p(u)q(v)r(z))=∑τ∈T2g(τ),(p(qr))(w)=\sum_{(u,t)\in F(w)}\Bigl(\sum_{(v,z)\in F(t)}p(u)q(v)r(z)\Bigr)=\sum_{\tau\in T_{2}}g(\tau),

with T2T_{2} the set of pairs ((u,t),(v,z))((u,t),(v,z)) with (u,t)∈F(w)(u,t)\in F(w), (v,z)∈F(t)(v,z)\in F(t), and g(((u,t),(v,z)))=p(u)q(v)r(z)g(((u,t),(v,z)))=p(u)q(v)r(z). Define θ:T1→T2\theta:T_{1}\to T_{2} by θ(((s,z),(u,v)))=((u,vz),(v,z))\theta(((s,z),(u,v)))=((u,vz),(v,z)) and η:T2→T1\eta:T_{2}\to T_{1} by η(((u,t),(v,z)))=((uv,z),(u,v))\eta(((u,t),(v,z)))=((uv,z),(u,v)). These land in the stated sets: if uv=suv=s and sz=wsz=w, then u(vz)=(uv)z=wu(vz)=(uv)z=w; if vz=tvz=t and ut=wut=w, then (uv)z=u(vz)=w(uv)z=u(vz)=w (Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §monoid). Moreover η(θ(((s,z),(u,v))))=((uv,z),(u,v))=((s,z),(u,v))\eta(\theta(((s,z),(u,v))))=((uv,z),(u,v))=((s,z),(u,v)) and θ(η(((u,t),(v,z))))=((u,vz),(v,z))=((u,t),(v,z))\theta(\eta(((u,t),(v,z))))=((u,vz),(v,z))=((u,t),(v,z)), so θ\theta is a bijection by claim 3 of Inverse of a Bijection, and g∘θ=fg\circ\theta=f. By claim 2 of Properties of a Sum over a Finite Index Set, ∑T1f=∑T2g\sum_{T_{1}}f=\sum_{T_{2}}g, so (pq)r=p(qr)(pq)r=p(qr).

Claim 5 (adjoint). Let w∈Wnw\in W_{n}; by The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §adjoint and (P3): (p+q)∗(w)=p(wrev)‾+q(wrev)‾=p∗(w)+q∗(w)(p+q)^{*}(w)=\overline{p(w^{\mathrm{rev}})}+\overline{q(w^{\mathrm{rev}})}=p^{*}(w)+q^{*}(w); (cp)∗(w)=c‾ p(wrev)‾=(c‾ p∗)(w)(cp)^{*}(w)=\overline{c}\,\overline{p(w^{\mathrm{rev}})}=(\overline{c}\,p^{*})(w); and (p∗)∗(w)=p((wrev)rev)‾‾=p(w)(p^{*})^{*}(w)=\overline{\overline{p((w^{\mathrm{rev}})^{\mathrm{rev}})}}=p(w) by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §reversal.

Monomials: (xw)∗(v)=xw(vrev)‾(x_{w})^{*}(v)=\overline{x_{w}(v^{\mathrm{rev}})}. If v=wrevv=w^{\mathrm{rev}} then vrev=wv^{\mathrm{rev}}=w and the value is 1‾=1\overline{1}=1; if v≠wrevv\neq w^{\mathrm{rev}} then vrev≠wv^{\mathrm{rev}}\neq w (else v=(vrev)rev=wrevv=(v^{\mathrm{rev}})^{\mathrm{rev}}=w^{\mathrm{rev}}) and the value is 0‾=0\overline{0}=0. So (xw)∗=xwrev(x_{w})^{*}=x_{w^{\mathrm{rev}}}. Since ∅rev=∅\varnothing^{\mathrm{rev}}=\varnothing (Words over a Finite Alphabet: the Empty Word, Concatenation and Reversal §reversal) and (j)rev=(j)(j)^{\mathrm{rev}}=(j) (Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §reversal), 1∗=11^{*}=1 and xj∗=xjx_{j}^{*}=x_{j}.

Products: by The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §product, Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §conjugate and (P3),

(pq)∗(w)=∑(u,v)∈F(wrev)p(u)q(v)‾=∑(u,v)∈F(wrev)p(u)‾ q(v)‾,(q∗p∗)(w)=∑(s,t)∈F(w)h((s,t)),(pq)^{*}(w)=\overline{\sum_{(u,v)\in F(w^{\mathrm{rev}})}p(u)q(v)}=\sum_{(u,v)\in F(w^{\mathrm{rev}})}\overline{p(u)}\,\overline{q(v)},\qquad (q^{*}p^{*})(w)=\sum_{(s,t)\in F(w)}h((s,t)),

where h((s,t))=q(srev)‾ p(trev)‾h((s,t))=\overline{q(s^{\mathrm{rev}})}\,\overline{p(t^{\mathrm{rev}})}. Let β(u,v)=(vrev,urev)\beta(u,v)=(v^{\mathrm{rev}},u^{\mathrm{rev}}) and β′(s,t)=(trev,srev)\beta'(s,t)=(t^{\mathrm{rev}},s^{\mathrm{rev}}). By Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §reversal, if uv=wrevuv=w^{\mathrm{rev}} then vrevurev=(uv)rev=wv^{\mathrm{rev}}u^{\mathrm{rev}}=(uv)^{\mathrm{rev}}=w, and if st=wst=w then trevsrev=wrevt^{\mathrm{rev}}s^{\mathrm{rev}}=w^{\mathrm{rev}}; so β:F(wrev)→F(w)\beta:F(w^{\mathrm{rev}})\to F(w) and β′:F(w)→F(wrev)\beta':F(w)\to F(w^{\mathrm{rev}}), and they are mutually inverse because reversal is involutive. So β\beta is a bijection (claim 3 of Inverse of a Bijection), and h(β(u,v))=q(v)‾ p(u)‾=p(u)‾ q(v)‾h(\beta(u,v))=\overline{q(v)}\,\overline{p(u)}=\overline{p(u)}\,\overline{q(v)}. By claim 2 of Properties of a Sum over a Finite Index Set, (pq)∗(w)=(q∗p∗)(w)(pq)^{*}(w)=(q^{*}p^{*})(w).

Claim 6 (self-adjoint part). By Claim 5, 0∗=00^{*}=0 (as 0‾=0\overline{0}=0), 1∗=11^{*}=1 and xj∗=xjx_{j}^{*}=x_{j}. For a,b∈Pn,saa,b\in\mathcal{P}_{n,\mathrm{sa}} and λ∈R\lambda\in\mathbb{R}: (a+b)∗=a+b(a+b)^{*}=a+b and (λa)∗=λ‾a=λa(\lambda a)^{*}=\overline{\lambda}a=\lambda a by (P3). With these operations, conditions 1, 2, 7 of Vector Space over a Field are inherited from Claim 1; 5 and 8 too, because sums and products of real numbers formed in C\mathbb{C} are the real ones (condition 1 of The Complex Numbers); 6 because the unit of R\mathbb{R} is that of C\mathbb{C} (P2); 3 with 0∈Pn,sa0\in\mathcal{P}_{n,\mathrm{sa}}; and 4 with (−1)a∈Pn,sa(-1)a\in\mathcal{P}_{n,\mathrm{sa}}, as −1-1 is real (P2). So Pn,sa\mathcal{P}_{n,\mathrm{sa}} is a real vector space.

By Claim 5, (ab+ba)∗=b∗a∗+a∗b∗=ba+ab=ab+ba(ab+ba)^{*}=b^{*}a^{*}+a^{*}b^{*}=ba+ab=ab+ba; (p+p∗)∗=p∗+p=p+p∗(p+p^{*})^{*}=p^{*}+p=p+p^{*}; (p∗p)∗=p∗(p∗)∗=p∗p(p^{*}p)^{*}=p^{*}(p^{*})^{*}=p^{*}p. For the remaining one, by Claim 5 and (P3), (i(ab−ba))∗=(−i)(ba+(−1)ab)(i(ab-ba))^{*}=(-i)\bigl(ba+(-1)ab\bigr), whose value at ww is (−i)((ba)(w)−(ab)(w))=i((ab)(w)−(ba)(w))(-i)\bigl((ba)(w)-(ab)(w)\bigr)=i\bigl((ab)(w)-(ba)(w)\bigr); so (i(ab−ba))∗=i(ab−ba)(i(ab-ba))^{*}=i(ab-ba).

Claim 7 (real and imaginary parts). Step 1 (existence). Let a=12(p+p∗)a=\tfrac12(p+p^{*}) and b=−i2(p−p∗)b=-\tfrac{i}{2}(p-p^{*}). By Claim 5 and (P3), a∗=12(p∗+p)=aa^{*}=\tfrac12(p^{*}+p)=a, and pointwise b∗(w)=−i2‾(p∗(w)−p(w))=i2(p∗(w)−p(w))=b(w)b^{*}(w)=\overline{-\tfrac{i}{2}}\bigl(p^{*}(w)-p(w)\bigr)=\tfrac{i}{2}\bigl(p^{*}(w)-p(w)\bigr)=b(w), using (p∗)∗=p(p^{*})^{*}=p. Pointwise, since i⋅i=−1i\cdot i=-1 (condition 2 of The Complex Numbers), i⋅(−i2)=12i\cdot(-\tfrac{i}{2})=\tfrac12, so (a+ib)(w)=12(p(w)+p∗(w))+12(p(w)−p∗(w))=12(1+1)p(w)=p(w)(a+ib)(w)=\tfrac12\bigl(p(w)+p^{*}(w)\bigr)+\tfrac12\bigl(p(w)-p^{*}(w)\bigr)=\tfrac12(1+1)p(w)=p(w).

Step 2 (uniqueness). Let p=a+ib=a′+ib′p=a+ib=a'+ib' with a,b,a′,b′a,b,a',b' self-adjoint, and put d=a−a′d=a-a', e=b′−be=b'-b, self-adjoint by Claim 6. Pointwise d(w)=i e(w)d(w)=i\,e(w). By (P3), d(w)=d∗(w)=i e(wrev)‾=−i e∗(w)=−i e(w)=−d(w)d(w)=d^{*}(w)=\overline{i\,e(w^{\mathrm{rev}})}=-i\,e^{*}(w)=-i\,e(w)=-d(w), so (1+1)d(w)=0(1+1)d(w)=0 and d(w)=0d(w)=0 by claim 3 of Zero Products and Elementary Identities in a Field and (P2). Then i e(w)=0i\,e(w)=0, so e(w)=0e(w)=0 as i≠0i\neq0 (P2). Hence a=a′a=a' and b=b′b=b'.

Step 3 (p∗=a−ibp^{*}=a-ib). Pointwise p∗(w)=a(wrev)+i b(wrev)‾=a∗(w)−i b∗(w)=a(w)−i b(w)p^{*}(w)=\overline{a(w^{\mathrm{rev}})+i\,b(w^{\mathrm{rev}})}=a^{*}(w)-i\,b^{*}(w)=a(w)-i\,b(w) by (P3).

Step 4. Write a−ib=a+(−i)ba-ib=a+(-i)b (condition 5 of Vector Space over a Field and claim 2 of Zero Products and Elementary Identities in a Field). By Claim 4 (distributivity and scalars), conditions 1, 2, 5, 6, 7 of Vector Space over a Field, and (−i)i=−(i⋅i)=1(-i)i=-(i\cdot i)=1 (claim 2 of Zero Products and Elementary Identities in a Field, claim 5 of Additive Cancellation and Elementary Additive Identities in a Field),

p∗p=(a+(−i)b)(a+ib)=aa+i(ab)+(−i)(ba)+((−i)i)(bb)=a2+b2+i(ab−ba),p^{*}p=(a+(-i)b)(a+ib)=aa+i(ab)+(-i)(ba)+((-i)i)(bb)=a^{2}+b^{2}+i(ab-ba),

using (−i)(ba)=i((−1)(ba))(-i)(ba)=i\bigl((-1)(ba)\bigr) in the last step. ■\blacksquare

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…