TheoremBase

Every identity is checked on the classes of monomials, which are orthonormal, and then extended to the whole Fock space by linearity and density: bounded operators that agree on these classes are equal, and an operator paired correctly against them is the adjoint. Clauses 6 to 8 follow algebraically from the commutation relations, by induction on word length.

Proof

Each result cited is universally quantified over the data in its own statement.

Throughout, ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle and ∥⋅∥\lVert\cdot\rVert are the inner product and norm of the complex Hilbert space Fn\mathcal{F}_{n} of The Free Fock Space: Creation, Annihilation and Semicircular Operators §space, and Ω=ΩF\Omega=\Omega_{\mathcal{F}}. The map p↦[p]p\mapsto[p] is the canonical map of the completion of (Pn,hn)(\mathcal{P}_{n},h_{n}), so by The Complex Hilbert Completion is a Complex Hilbert Space Containing a Dense Isometric Image, and Bounded Complex-Linear Maps Extend to It §isometry it is complex-linear (in particular [0]=0[0]=0) and ⟨[p],[q]⟩=hn(p,q)\langle[p],[q]\rangle=h_{n}(p,q) for all p,q∈Pnp,q\in\mathcal{P}_{n}. By The Free Fock Space: Creation, Annihilation and Semicircular Operators §operators, for j∈[n]j\in[n] and w∈Wnw\in W_{n} we have lj[xw]=[x(j)w]l_{j}[x_{w}]=[x_{(j)w}] and rj[xw]=[xw(j)]r_{j}[x_{w}]=[x_{w(j)}]; lˉj[xv]\bar{l}_{j}[x_{v}] is [xw][x_{w}] if v=(j)wv=(j)w for a word ww, and is [0]=0[0]=0 if vv is empty or its first letter is not jj; and rˉj[xv]\bar{r}_{j}[x_{v}] is [xw][x_{w}] if v=w(j)v=w(j), and 00 if vv is empty or its last letter is not jj. A nonempty word vv of length mm with first letter v1=jv_{1}=j is of the form (j)w(j)w (with w=∅w=\varnothing if m=1m=1, and otherwise ww the word of length m−1m-1 with wi=vi+1w_{i}=v_{i+1}), by the definition of concatenation; likewise, by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §last-letter, a nonempty word vv with last letter jj is of the form w(j)w(j). Sums, scalar multiples and composites of elements of L(Fn)\mathcal{L}(\mathcal{F}_{n}) lie in L(Fn)\mathcal{L}(\mathcal{F}_{n}), which is a complex vector space in which composition distributes over sums, by Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §operations; every A∈L(Fn)A\in\mathcal{L}(\mathcal{F}_{n}) has an adjoint A∗∈L(Fn)A^{*}\in\mathcal{L}(\mathcal{F}_{n}) by Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §adjoint, and by Adjoint of a Linear Map between Complex Inner Product Spaces §adjoint and conjugate symmetry

⟨A∗η,ξ⟩=⟨η,Aξ⟩and⟨Aξ,η⟩=⟨ξ,A∗η⟩(ξ,η∈Fn).\langle A^{*}\eta,\xi\rangle=\langle\eta,A\xi\rangle\quad\text{and}\quad\langle A\xi,\eta\rangle=\langle\xi,A^{*}\eta\rangle\qquad(\xi,\eta\in\mathcal{F}_{n}).

Three preliminary facts. (F1) If φ:Pn→C\varphi:\mathcal{P}_{n}\to\mathbb{C} is linear and φ(xw)=0\varphi(x_{w})=0 for every w∈Wnw\in W_{n}, then φ=0\varphi=0: the zero map is linear and has the same values on monomials, so this is the uniqueness in Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §linear-extension (a).

(F2) If A,B∈L(Fn)A,B\in\mathcal{L}(\mathcal{F}_{n}) and A[xw]=B[xw]A[x_{w}]=B[x_{w}] for every w∈Wnw\in W_{n}, then A=BA=B. Indeed, let C=A−B∈L(Fn)C=A-B\in\mathcal{L}(\mathcal{F}_{n}). For fixed η∈Fn\eta\in\mathcal{F}_{n} the map p↦⟨η,C[p]⟩p\mapsto\langle\eta,C[p]\rangle is linear, since [⋅][\cdot] and CC are linear and the inner product is linear in its second argument, and it vanishes on monomials; so it is 00 by (F1). Taking η=C[p]\eta=C[p] gives ∥C[p]∥2=0\lVert C[p]\rVert^{2}=0, so C[p]=0C[p]=0 for every p∈Pnp\in\mathcal{P}_{n}. Now let ζ∈Fn\zeta\in\mathcal{F}_{n} and let ε>0\varepsilon>0 be real. By The Complex Hilbert Completion is a Complex Hilbert Space Containing a Dense Isometric Image, and Bounded Complex-Linear Maps Extend to It §dense there is p∈Pnp\in\mathcal{P}_{n} with ∥ζ−[p]∥<ε\lVert\zeta-[p]\rVert<\varepsilon, and since ∥C∥op\lVert C\rVert_{\mathrm{op}} is a bound for CC by Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §least-bound,

∥Cζ∥=∥C(ζ−[p])∥≤∥C∥op ε.\lVert C\zeta\rVert=\lVert C(\zeta-[p])\rVert\le\lVert C\rVert_{\mathrm{op}}\,\varepsilon .

As ε>0\varepsilon>0 is arbitrary, Cζ=0C\zeta=0. Hence A=BA=B.

(F3) If A,B∈L(Fn)A,B\in\mathcal{L}(\mathcal{F}_{n}) and ⟨A[xu],[xv]⟩=⟨[xu],B[xv]⟩\langle A[x_{u}],[x_{v}]\rangle=\langle[x_{u}],B[x_{v}]\rangle for all u,v∈Wnu,v\in W_{n}, then A∗=BA^{*}=B. Indeed, for fixed uu the map q↦⟨A[xu],[q]⟩−⟨[xu],B[q]⟩q\mapsto\langle A[x_{u}],[q]\rangle-\langle[x_{u}],B[q]\rangle is linear and vanishes on monomials, hence is 00 by (F1). Then for fixed qq the map p↦⟨[q],A[p]⟩−⟨B[q],[p]⟩p\mapsto\langle[q],A[p]\rangle-\langle B[q],[p]\rangle is linear, and it is the complex conjugate of p↦⟨A[p],[q]⟩−⟨[p],B[q]⟩p\mapsto\langle A[p],[q]\rangle-\langle[p],B[q]\rangle, which vanishes on monomials by what was just shown; so it is 00 by (F1). Thus

⟨A[p],[q]⟩=⟨[p],B[q]⟩(p,q∈Pn).(∗)\langle A[p],[q]\rangle=\langle[p],B[q]\rangle\qquad(p,q\in\mathcal{P}_{n}).\tag{$*$}

Fix qq and let ζ=A∗[q]−B[q]\zeta=A^{*}[q]-B[q]. For every pp, ⟨ζ,[p]⟩=⟨[q],A[p]⟩−⟨B[q],[p]⟩=0\langle\zeta,[p]\rangle=\langle[q],A[p]\rangle-\langle B[q],[p]\rangle=0, by the displayed property of A∗A^{*} and the complex conjugate of (∗)(*). Let ε>0\varepsilon>0 be real, and by The Complex Hilbert Completion is a Complex Hilbert Space Containing a Dense Isometric Image, and Bounded Complex-Linear Maps Extend to It §dense choose pp with ∥ζ−[p]∥<ε\lVert\zeta-[p]\rVert<\varepsilon. Then, by Cauchy-Schwarz Inequality in a Complex Inner Product Space,

∥ζ∥2=⟨ζ,ζ−[p]⟩≤∥ζ∥ ε,\lVert\zeta\rVert^{2}=\langle\zeta,\zeta-[p]\rangle\le\lVert\zeta\rVert\,\varepsilon ,

so ∥ζ∥≤ε\lVert\zeta\rVert\le\varepsilon (trivially if ζ=0\zeta=0). Hence ζ=0\zeta=0, that is A∗[q]=B[q]A^{*}[q]=B[q] for every qq, and A∗=BA^{*}=B by (F2).

Clause 1 (Orthonormal monomials). Let u,v∈Wnu,v\in W_{n}. By the definition of monomials, xux_{u} has support {u}\{u\} and xu(u)=1x_{u}(u)=1, so by the isometry property recalled above and the definition of hnh_{n} in The Free Fock Space: Creation, Annihilation and Semicircular Operators,

⟨[xu],[xv]⟩=hn(xu,xv)=xu(u)‾ xv(u)=xv(u),\langle[x_{u}],[x_{v}]\rangle=h_{n}(x_{u},x_{v})=\overline{x_{u}(u)}\,x_{v}(u)=x_{v}(u),

which is 11 if u=vu=v and 00 otherwise. Since Ω=[1]=[x∅]\Omega=[1]=[x_{\varnothing}] by The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §monomials, ∥Ω∥2=⟨[x∅],[x∅]⟩=1\lVert\Omega\rVert^{2}=\langle[x_{\varnothing}],[x_{\varnothing}]\rangle=1, so ∥Ω∥=1\lVert\Omega\rVert=1. The map PP is linear because the inner product is linear in its second argument, and by Cauchy-Schwarz Inequality in a Complex Inner Product Space, ∥Pζ∥=∣⟨Ω,ζ⟩∣ ∥Ω∥≤∥ζ∥\lVert P\zeta\rVert=|\langle\Omega,\zeta\rangle|\,\lVert\Omega\rVert\le\lVert\zeta\rVert for every ζ\zeta; so 11 is a bound for PP and P∈L(Fn)P\in\mathcal{L}(\mathcal{F}_{n}). For later use, PP is its own adjoint: for ζ,η∈Fn\zeta,\eta\in\mathcal{F}_{n}, by conjugate-linearity in the first argument and conjugate symmetry,

⟨Pζ,η⟩=⟨Ω,ζ⟩‾ ⟨Ω,η⟩=⟨ζ,Ω⟩⟨Ω,η⟩=⟨ζ,Pη⟩,\langle P\zeta,\eta\rangle=\overline{\langle\Omega,\zeta\rangle}\,\langle\Omega,\eta\rangle=\langle\zeta,\Omega\rangle\langle\Omega,\eta\rangle=\langle\zeta,P\eta\rangle ,

so PP is an adjoint of PP and P∗=PP^{*}=P by Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §adjoint-unique.

Clause 2 (Adjoints). Let j∈[n]j\in[n] and u,v∈Wnu,v\in W_{n}. By Clause 1, ⟨lj[xu],[xv]⟩=⟨[x(j)u],[xv]⟩\langle l_{j}[x_{u}],[x_{v}]\rangle=\langle[x_{(j)u}],[x_{v}]\rangle is 11 if v=(j)uv=(j)u and 00 otherwise. If v=(j)wv=(j)w for a word ww, then ⟨[xu],lˉj[xv]⟩=⟨[xu],[xw]⟩\langle[x_{u}],\bar{l}_{j}[x_{v}]\rangle=\langle[x_{u}],[x_{w}]\rangle is 11 if u=wu=w and 00 otherwise, and u=wu=w holds if and only if v=(j)uv=(j)u, because the word ww is determined by (j)w(j)w (The Free Fock Space: Creation, Annihilation and Semicircular Operators §operators). Otherwise vv is empty or has first letter different from jj, so lˉj[xv]=0\bar{l}_{j}[x_{v}]=0, while v≠(j)uv\neq(j)u because (j)u(j)u has first letter jj; both sides are then 00. Hence ⟨lj[xu],[xv]⟩=⟨[xu],lˉj[xv]⟩\langle l_{j}[x_{u}],[x_{v}]\rangle=\langle[x_{u}],\bar{l}_{j}[x_{v}]\rangle for all u,vu,v, and lj∗=lˉjl_{j}^{*}=\bar{l}_{j} by (F3). The same argument with rj[xu]=[xu(j)]r_{j}[x_{u}]=[x_{u(j)}], rˉj\bar{r}_{j}, u(j)u(j) and "last letter" in place of lj[xu]=[x(j)u]l_{j}[x_{u}]=[x_{(j)u}], lˉj\bar{l}_{j}, (j)u(j)u and "first letter" gives rj∗=rˉjr_{j}^{*}=\bar{r}_{j}.

Let also k∈[n]k\in[n] and w∈Wnw\in W_{n}. Then lj∗lk[xw]=lˉj[x(k)w]l_{j}^{*}l_{k}[x_{w}]=\bar{l}_{j}[x_{(k)w}], which is [xw][x_{w}] if k=jk=j and 00 if k≠jk\neq j (the first letter of (k)w(k)w being kk); so lj∗lk[xw]=(δjkI)[xw]l_{j}^{*}l_{k}[x_{w}]=(\delta_{jk}I)[x_{w}], and lj∗lk=δjkIl_{j}^{*}l_{k}=\delta_{jk}I by (F2). Likewise rj∗rk[xw]=rˉj[xw(k)]=δjk[xw]r_{j}^{*}r_{k}[x_{w}]=\bar{r}_{j}[x_{w(k)}]=\delta_{jk}[x_{w}], so rj∗rk=δjkIr_{j}^{*}r_{k}=\delta_{jk}I by (F2). Finally lj∗Ω=lˉj[x∅]=0l_{j}^{*}\Omega=\bar{l}_{j}[x_{\varnothing}]=0 and rj∗Ω=rˉj[x∅]=0r_{j}^{*}\Omega=\bar{r}_{j}[x_{\varnothing}]=0, the word ∅\varnothing being empty.

Clause 3 (Commuting creation operators). Let j,k∈[n]j,k\in[n] and w∈Wnw\in W_{n}. Then ljrk[xw]=[x(j)(w(k))]l_{j}r_{k}[x_{w}]=[x_{(j)(w(k))}] and rklj[xw]=[x((j)w)(k)]r_{k}l_{j}[x_{w}]=[x_{((j)w)(k)}], and these are equal since (j)(w(k))=((j)w)(k)(j)(w(k))=((j)w)(k) by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §monoid. By (F2), ljrk=rkljl_{j}r_{k}=r_{k}l_{j}. By Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §adjoint-calculus the adjoint of ljrkl_{j}r_{k} is rk∗lj∗r_{k}^{*}l_{j}^{*} and the adjoint of rkljr_{k}l_{j} is lj∗rk∗l_{j}^{*}r_{k}^{*}; since these are adjoints of the same operator, lj∗rk∗=rk∗lj∗l_{j}^{*}r_{k}^{*}=r_{k}^{*}l_{j}^{*} by Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §adjoint-unique.

Clause 4 (Vacuum commutators). Let j,k∈[n]j,k\in[n]; both rj∗lk−lkrj∗r_{j}^{*}l_{k}-l_{k}r_{j}^{*} and δjkP\delta_{jk}P lie in L(Fn)\mathcal{L}(\mathcal{F}_{n}) (Clause 1), so by (F2) it suffices to compare them on [xw][x_{w}], w∈Wnw\in W_{n}, using Clause 2 (rj∗=rˉjr_{j}^{*}=\bar{r}_{j}).

If w=∅w=\varnothing: since (k)=∅(k)(k)=\varnothing(k), rj∗lk[x∅]=rˉj[x(k)]r_{j}^{*}l_{k}[x_{\varnothing}]=\bar{r}_{j}[x_{(k)}] is [x∅]=Ω[x_{\varnothing}]=\Omega if j=kj=k and 00 otherwise, that is δjkΩ\delta_{jk}\Omega; lkrj∗[x∅]=lk0=0l_{k}r_{j}^{*}[x_{\varnothing}]=l_{k}0=0 by Clause 2; and δjkP[x∅]=δjk⟨Ω,Ω⟩Ω=δjkΩ\delta_{jk}P[x_{\varnothing}]=\delta_{jk}\langle\Omega,\Omega\rangle\Omega=\delta_{jk}\Omega by Clause 1.

If ww has length m∈Nm\in\mathbb{N}: then δjkP[xw]=δjk⟨[x∅],[xw]⟩Ω=0\delta_{jk}P[x_{w}]=\delta_{jk}\langle[x_{\varnothing}],[x_{w}]\rangle\Omega=0 by Clause 1, as w≠∅w\neq\varnothing. Write w=v(i)w=v(i) with v∈Wnv\in W_{n} and i=wmi=w_{m} its last letter, as recalled above; then (k)w=((k)v)(i)(k)w=((k)v)(i) by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §monoid. If i=ji=j, then

rj∗lk[xw]=rˉj[x((k)v)(j)]=[x(k)v]=lk[xv]=lkrˉj[xv(j)]=lkrj∗[xw].r_{j}^{*}l_{k}[x_{w}]=\bar{r}_{j}[x_{((k)v)(j)}]=[x_{(k)v}]=l_{k}[x_{v}]=l_{k}\bar{r}_{j}[x_{v(j)}]=l_{k}r_{j}^{*}[x_{w}].

If i≠ji\neq j, then ww and (k)w(k)w both have last letter i≠ji\neq j, so rj∗lk[xw]=rˉj[x(k)w]=0r_{j}^{*}l_{k}[x_{w}]=\bar{r}_{j}[x_{(k)w}]=0 and lkrj∗[xw]=lk0=0l_{k}r_{j}^{*}[x_{w}]=l_{k}0=0. In both cases (rj∗lk−lkrj∗)[xw]=0=δjkP[xw](r_{j}^{*}l_{k}-l_{k}r_{j}^{*})[x_{w}]=0=\delta_{jk}P[x_{w}]. This proves rj∗lk−lkrj∗=δjkPr_{j}^{*}l_{k}-l_{k}r_{j}^{*}=\delta_{jk}P for all j,kj,k.

For the second relation, apply the first with jj and kk interchanged: rk∗lj−ljrk∗=δkjPr_{k}^{*}l_{j}-l_{j}r_{k}^{*}=\delta_{kj}P. By Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §adjoint-calculus (each operator is the adjoint of its adjoint, and adjoints of composites, sums and real multiples are formed as stated there), the left side has adjoint lj∗rk−rklj∗l_{j}^{*}r_{k}-r_{k}l_{j}^{*}, and the right side has adjoint δjkP∗=δjkP\delta_{jk}P^{*}=\delta_{jk}P by Clause 1. Equal operators have equal adjoints (Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §adjoint-unique), so lj∗rk−rklj∗=δjkPl_{j}^{*}r_{k}-r_{k}l_{j}^{*}=\delta_{jk}P.

Clause 5 (Semicircular operators). Let j∈[n]j\in[n]. By Clause 2, Sj=lj+lj∗S_{j}=l_{j}+l_{j}^{*}. By Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §adjoint-calculus, ljl_{j} is the adjoint of lj∗l_{j}^{*}, so SjS_{j} has the adjoint lj∗+lj=Sjl_{j}^{*}+l_{j}=S_{j}; thus SjS_{j} is an adjoint of itself, hence self-adjoint by the same clause. The same argument with Dj=rj+rj∗D_{j}=r_{j}+r_{j}^{*} shows that DjD_{j} is self-adjoint. By The Free Fock Space: Creation, Annihilation and Semicircular Operators §operators, each of lj,lˉj,rj,rˉjl_{j},\bar{l}_{j},r_{j},\bar{r}_{j} is the unique operator in L(Fn)\mathcal{L}(\mathcal{F}_{n}) with the stated values on classes, and the operator provided by The Complex Hilbert Completion is a Complex Hilbert Space Containing a Dense Isometric Image, and Bounded Complex-Linear Maps Extend to It §extension-linear with C=1C=1 is such an operator and has bound 11; so 11 is a bound for each of them, and their operator norms are at most 11 by Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §least-bound. By the triangle inequality in Bounded Linear Maps between Complex Inner Product Spaces: the Least Bound, Operations, the Underlying Real Structure, Adjoints, Completeness and the Quadratic-Form Bound §operations, ∥Sj∥op≤∥lj∥op+∥lˉj∥op≤2\lVert S_{j}\rVert_{\mathrm{op}}\le\lVert l_{j}\rVert_{\mathrm{op}}+\lVert\bar{l}_{j}\rVert_{\mathrm{op}}\le2 and ∥Dj∥op≤2\lVert D_{j}\rVert_{\mathrm{op}}\le2.

Clause 6 (Left and right commute). Let j,k∈[n]j,k\in[n]. Using Sj=lj+lj∗S_{j}=l_{j}+l_{j}^{*}, Dk=rk+rk∗D_{k}=r_{k}+r_{k}^{*} (Clause 2) and distributivity of composition over sums,

SjDk−DkSj=(ljrk−rklj)−(rk∗lj−ljrk∗)+(lj∗rk−rklj∗)+(lj∗rk∗−rk∗lj∗).S_{j}D_{k}-D_{k}S_{j}=(l_{j}r_{k}-r_{k}l_{j})-(r_{k}^{*}l_{j}-l_{j}r_{k}^{*})+(l_{j}^{*}r_{k}-r_{k}l_{j}^{*})+(l_{j}^{*}r_{k}^{*}-r_{k}^{*}l_{j}^{*}).

The first and last brackets vanish by Clause 3; by Clause 4 (the first relation with j,kj,k interchanged, and the second relation) the middle terms are −δkjP+δjkP=0-\delta_{kj}P+\delta_{jk}P=0. Hence SjDk=DkSjS_{j}D_{k}=D_{k}S_{j}.

Clause 7 (Reversal). First, an auxiliary fact (C): SuDk=DkSuS_{u}D_{k}=D_{k}S_{u} for every u∈Wnu\in W_{n} and k∈[n]k\in[n]. For u=∅u=\varnothing, S∅=IS_{\varnothing}=I by Evaluation of Noncommutative Polynomials at a Tuple of Bounded Operators §word-products. For words of positive length we induct on the length m∈Nm\in\mathbb{N}, the statement for mm being that SuDk=DkSuS_{u}D_{k}=D_{k}S_{u} for every kk and every uu of length mm. For m=1m=1, u=(i)u=(i) is a letter by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §last-letter, Su=SiS_{u}=S_{i} by Evaluation of Noncommutative Polynomials at a Tuple of Bounded Operators §word-products, and Clause 6 applies. If the statement holds for mm and uu has length m+1m+1, then u=v(i)u=v(i) with vv of length mm by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §last-letter, and Su=SvSiS_{u}=S_{v}S_{i} by Evaluation of Noncommutative Polynomials at Bounded Operators: a Unital Homomorphism Compatible with Adjoints, Substitution, Representations and the GNS Multiplication Operators §values; so SuDk=SvDkSi=DkSvSi=DkSuS_{u}D_{k}=S_{v}D_{k}S_{i}=D_{k}S_{v}S_{i}=D_{k}S_{u} by Clause 6 and the induction hypothesis.

Now we prove SwΩ=DwrevΩS_{w}\Omega=D_{w^{\mathrm{rev}}}\Omega. For w=∅w=\varnothing both sides are IΩ=ΩI\Omega=\Omega, as ∅rev=∅\varnothing^{\mathrm{rev}}=\varnothing (Words over a Finite Alphabet: the Empty Word, Concatenation and Reversal §reversal). For words of positive length we induct on the length m∈Nm\in\mathbb{N}, the statement for mm being that SwΩ=DwrevΩS_{w}\Omega=D_{w^{\mathrm{rev}}}\Omega for every ww of length mm. For m=1m=1, w=(j)w=(j) is a letter and wrev=(j)w^{\mathrm{rev}}=(j) by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §reversal; since Ω=[x∅]\Omega=[x_{\varnothing}] and (j)∅=∅(j)=(j)(j)\varnothing=\varnothing(j)=(j), Clause 2 gives

SjΩ=lj[x∅]+lj∗Ω=[xj]=rj[x∅]+rj∗Ω=DjΩ.S_{j}\Omega=l_{j}[x_{\varnothing}]+l_{j}^{*}\Omega=[x_{j}]=r_{j}[x_{\varnothing}]+r_{j}^{*}\Omega=D_{j}\Omega .

If the statement holds for mm and ww has length m+1m+1, write w=v(j)w=v(j) with vv of length mm (Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §last-letter); then wrev=(j)vrevw^{\mathrm{rev}}=(j)v^{\mathrm{rev}} by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §reversal, and by Evaluation of Noncommutative Polynomials at Bounded Operators: a Unital Homomorphism Compatible with Adjoints, Substitution, Representations and the GNS Multiplication Operators §values, the case m=1m=1, (C) and the induction hypothesis,

SwΩ=SvSjΩ=SvDjΩ=DjSvΩ=DjDvrevΩ=D(j)vrevΩ=DwrevΩ.S_{w}\Omega=S_{v}S_{j}\Omega=S_{v}D_{j}\Omega=D_{j}S_{v}\Omega=D_{j}D_{v^{\mathrm{rev}}}\Omega=D_{(j)v^{\mathrm{rev}}}\Omega=D_{w^{\mathrm{rev}}}\Omega .

Clause 8 (Right annihilation of the vacuum orbit). Fix j∈[n]j\in[n]. For a∈[n]a\in[n], expanding Sa=la+la∗S_{a}=l_{a}+l_{a}^{*} and using Clause 4 (first relation, with k=ak=a) and Clause 3 (with a,ja,j in place of j,kj,k),

rj∗Sa−Sarj∗=(rj∗la−larj∗)+(rj∗la∗−la∗rj∗)=δjaP.(†)r_{j}^{*}S_{a}-S_{a}r_{j}^{*}=(r_{j}^{*}l_{a}-l_{a}r_{j}^{*})+(r_{j}^{*}l_{a}^{*}-l_{a}^{*}r_{j}^{*})=\delta_{ja}P .\tag{$\dagger$}

We induct on the length k∈Nk\in\mathbb{N} of ww, the statement for kk being the displayed formula of Clause 8 for every word ww of length kk.

For k=1k=1, w=(a)w=(a) is a letter, SwΩ=SaΩ=[xa]S_{w}\Omega=S_{a}\Omega=[x_{a}] (Clause 7, case m=1m=1), and since (a)=∅(a)(a)=\varnothing(a), rj∗[x(a)]=rˉj[x∅(a)]=δjaΩr_{j}^{*}[x_{(a)}]=\bar{r}_{j}[x_{\varnothing(a)}]=\delta_{ja}\Omega. On the right side, Lj(w)L_{j}(w) is {1}\{1\} if a=ja=j and empty otherwise; for s=1s=1, w<1=w>1=∅w_{<1}=w_{>1}=\varnothing, so the term is ⟨Ω,Ω⟩Ω=Ω\langle\Omega,\Omega\rangle\Omega=\Omega. Both sides equal δjaΩ\delta_{ja}\Omega.

Suppose the statement holds for kk and let ww have length k+1k+1. Let a=w1a=w_{1} and let vv be the word of length kk with vt=wt+1v_{t}=w_{t+1} for t∈[k]t\in[k]; then w=(a)vw=(a)v by Words over a Finite Alphabet: the Empty Word, Concatenation and Reversal §concatenation, and Sw=SaSvS_{w}=S_{a}S_{v} by Evaluation of Noncommutative Polynomials at Bounded Operators: a Unital Homomorphism Compatible with Adjoints, Substitution, Representations and the GNS Multiplication Operators §values. By (†)(\dagger), the induction hypothesis for vv and linearity of SaS_{a},

rj∗SwΩ=Sarj∗SvΩ+δjaPSvΩ=∑t∈Lj(v)⟨Ω,Sv>tΩ⟩ SaSv<tΩ+δja⟨Ω,SvΩ⟩Ω.r_{j}^{*}S_{w}\Omega=S_{a}r_{j}^{*}S_{v}\Omega+\delta_{ja}P S_{v}\Omega=\sum_{t\in L_{j}(v)}\langle\Omega,S_{v_{>t}}\Omega\rangle\,S_{a}S_{v_{<t}}\Omega+\delta_{ja}\langle\Omega,S_{v}\Omega\rangle\Omega .

For t∈[k]t\in[k] put s=t+1∈[k+1]s=t+1\in[k+1]. Then ws=vtw_{s}=v_{t}, so s∈Lj(w)s\in L_{j}(w) if and only if t∈Lj(v)t\in L_{j}(v); moreover w<s=(w1,…,wt)=(a)v<tw_{<s}=(w_{1},\dots,w_{t})=(a)v_{<t} and w>s=(wt+2,…,wk+1)=v>tw_{>s}=(w_{t+2},\dots,w_{k+1})=v_{>t}, so SaSv<t=Sw<sS_{a}S_{v_{<t}}=S_{w_{<s}} by Evaluation of Noncommutative Polynomials at Bounded Operators: a Unital Homomorphism Compatible with Adjoints, Substitution, Representations and the GNS Multiplication Operators §values. The index s=1s=1 lies in Lj(w)L_{j}(w) if and only if a=ja=j, and w<1=∅w_{<1}=\varnothing, w>1=vw_{>1}=v, so its term is ⟨Ω,SvΩ⟩S∅Ω=⟨Ω,SvΩ⟩Ω\langle\Omega,S_{v}\Omega\rangle S_{\varnothing}\Omega=\langle\Omega,S_{v}\Omega\rangle\Omega. Since Lj(w)L_{j}(w) is the disjoint union of {t+1: t∈Lj(v)}\{t+1:\ t\in L_{j}(v)\} and of {1}\{1\} or the empty set according as a=ja=j or not, reindexing the finite sum by the bijection t↦t+1t\mapsto t+1 gives

rj∗SwΩ=∑s∈Lj(w)⟨Ω,Sw>sΩ⟩ Sw<sΩ,r_{j}^{*}S_{w}\Omega=\sum_{s\in L_{j}(w)}\langle\Omega,S_{w_{>s}}\Omega\rangle\,S_{w_{<s}}\Omega ,

which is the statement for k+1k+1. This completes the induction and the proof.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…