Each result cited is universally quantified over the data in its own statement.
Throughout, ⟨⋅,⋅⟩ and ∥⋅∥ are the inner product and norm of the complex Hilbert space Fn of The Free Fock Space: Creation, Annihilation and Semicircular Operators §space, and Ω=ΩF. The map p↦[p] is the canonical map of the completion of (Pn,hn), 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) and ⟨[p],[q]⟩=hn(p,q) for all p,q∈Pn. By The Free Fock Space: Creation, Annihilation and Semicircular Operators §operators, for j∈[n] and w∈Wn we have lj[xw]=[x(j)w] and rj[xw]=[xw(j)]; lˉj[xv] is [xw] if v=(j)w for a word w, and is [0]=0 if v is empty or its first letter is not j; and rˉj[xv] is [xw] if v=w(j), and 0 if v is empty or its last letter is not j. A nonempty word v of length m with first letter v1=j is of the form (j)w (with w=∅ if m=1, and otherwise w the word of length m−1 with wi=vi+1), by the definition of concatenation; likewise, by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §last-letter, a nonempty word v with last letter j is of the form w(j). Sums, scalar multiples and composites of elements of L(Fn) lie in L(Fn), 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) has an adjoint A∗∈L(Fn) 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).
Three preliminary facts. (F1) If φ:Pn→C is linear and φ(xw)=0 for every w∈Wn, then φ=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) and A[xw]=B[xw] for every w∈Wn, then A=B. Indeed, let C=A−B∈L(Fn). For fixed η∈Fn the map p↦⟨η,C[p]⟩ is linear, since [⋅] and C are linear and the inner product is linear in its second argument, and it vanishes on monomials; so it is 0 by (F1). Taking η=C[p] gives ∥C[p]∥2=0, so C[p]=0 for every p∈Pn. Now let ζ∈Fn and let ε>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∈Pn with ∥ζ−[p]∥<ε, and since ∥C∥op is a bound for C 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ε.
As ε>0 is arbitrary, Cζ=0. Hence A=B.
(F3) If A,B∈L(Fn) and ⟨A[xu],[xv]⟩=⟨[xu],B[xv]⟩ for all u,v∈Wn, then A∗=B. Indeed, for fixed u the map q↦⟨A[xu],[q]⟩−⟨[xu],B[q]⟩ is linear and vanishes on monomials, hence is 0 by (F1). Then for fixed q the map p↦⟨[q],A[p]⟩−⟨B[q],[p]⟩ is linear, and it is the complex conjugate of p↦⟨A[p],[q]⟩−⟨[p],B[q]⟩, which vanishes on monomials by what was just shown; so it is 0 by (F1). Thus
⟨A[p],[q]⟩=⟨[p],B[q]⟩(p,q∈Pn).(∗)
Fix q and let ζ=A∗[q]−B[q]. For every p, ⟨ζ,[p]⟩=⟨[q],A[p]⟩−⟨B[q],[p]⟩=0, by the displayed property of A∗ and the complex conjugate of (∗). Let ε>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 p with ∥ζ−[p]∥<ε. Then, by Cauchy-Schwarz Inequality in a Complex Inner Product Space,
∥ζ∥2=⟨ζ,ζ−[p]⟩≤∥ζ∥ε,
so ∥ζ∥≤ε (trivially if ζ=0). Hence ζ=0, that is A∗[q]=B[q] for every q, and A∗=B by (F2).
Clause 1 (Orthonormal monomials). Let u,v∈Wn. By the definition of monomials, xu has support {u} and xu(u)=1, so by the isometry property recalled above and the definition of hn in The Free Fock Space: Creation, Annihilation and Semicircular Operators,
⟨[xu],[xv]⟩=hn(xu,xv)=xu(u)xv(u)=xv(u),
which is 1 if u=v and 0 otherwise. Since Ω=[1]=[x∅] by The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §monomials, ∥Ω∥2=⟨[x∅],[x∅]⟩=1, so ∥Ω∥=1. The map P is linear because the inner product is linear in its second argument, and by Cauchy-Schwarz Inequality in a Complex Inner Product Space, ∥Pζ∥=∣⟨Ω,ζ⟩∣∥Ω∥≤∥ζ∥ for every ζ; so 1 is a bound for P and P∈L(Fn). For later use, P is its own adjoint: for ζ,η∈Fn, by conjugate-linearity in the first argument and conjugate symmetry,
⟨Pζ,η⟩=⟨Ω,ζ⟩⟨Ω,η⟩=⟨ζ,Ω⟩⟨Ω,η⟩=⟨ζ,Pη⟩,
so P is an adjoint of P and P∗=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] and u,v∈Wn. By Clause 1, ⟨lj[xu],[xv]⟩=⟨[x(j)u],[xv]⟩ is 1 if v=(j)u and 0 otherwise. If v=(j)w for a word w, then ⟨[xu],lˉj[xv]⟩=⟨[xu],[xw]⟩ is 1 if u=w and 0 otherwise, and u=w holds if and only if v=(j)u, because the word w is determined by (j)w (The Free Fock Space: Creation, Annihilation and Semicircular Operators §operators). Otherwise v is empty or has first letter different from j, so lˉj[xv]=0, while v=(j)u because (j)u has first letter j; both sides are then 0. Hence ⟨lj[xu],[xv]⟩=⟨[xu],lˉj[xv]⟩ for all u,v, and lj∗=lˉj by (F3). The same argument with rj[xu]=[xu(j)], rˉj, u(j) and "last letter" in place of lj[xu]=[x(j)u], lˉj, (j)u and "first letter" gives rj∗=rˉj.
Let also k∈[n] and w∈Wn. Then lj∗lk[xw]=lˉj[x(k)w], which is [xw] if k=j and 0 if k=j (the first letter of (k)w being k); so lj∗lk[xw]=(δjkI)[xw], and lj∗lk=δjkI by (F2). Likewise rj∗rk[xw]=rˉj[xw(k)]=δjk[xw], so rj∗rk=δjkI by (F2). Finally lj∗Ω=lˉj[x∅]=0 and rj∗Ω=rˉj[x∅]=0, the word ∅ being empty.
Clause 3 (Commuting creation operators). Let j,k∈[n] and w∈Wn. Then ljrk[xw]=[x(j)(w(k))] and rklj[xw]=[x((j)w)(k)], and these are equal since (j)(w(k))=((j)w)(k) by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §monoid. By (F2), ljrk=rklj. 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 ljrk is rk∗lj∗ and the adjoint of rklj is lj∗rk∗; since these are adjoints of the same operator, lj∗rk∗=rk∗lj∗ 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]; both rj∗lk−lkrj∗ and δjkP lie in L(Fn) (Clause 1), so by (F2) it suffices to compare them on [xw], w∈Wn, using Clause 2 (rj∗=rˉj).
If w=∅: since (k)=∅(k), rj∗lk[x∅]=rˉj[x(k)] is [x∅]=Ω if j=k and 0 otherwise, that is δjkΩ; lkrj∗[x∅]=lk0=0 by Clause 2; and δjkP[x∅]=δjk⟨Ω,Ω⟩Ω=δjkΩ by Clause 1.
If w has length m∈N: then δjkP[xw]=δjk⟨[x∅],[xw]⟩Ω=0 by Clause 1, as w=∅. Write w=v(i) with v∈Wn and i=wm its last letter, as recalled above; then (k)w=((k)v)(i) by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §monoid. If i=j, then
rj∗lk[xw]=rˉj[x((k)v)(j)]=[x(k)v]=lk[xv]=lkrˉj[xv(j)]=lkrj∗[xw].
If i=j, then w and (k)w both have last letter i=j, so rj∗lk[xw]=rˉj[x(k)w]=0 and lkrj∗[xw]=lk0=0. In both cases (rj∗lk−lkrj∗)[xw]=0=δjkP[xw]. This proves rj∗lk−lkrj∗=δjkP for all j,k.
For the second relation, apply the first with j and k interchanged: rk∗lj−ljrk∗=δkjP. 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∗, and the right side has adjoint δjkP∗=δjkP 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∗=δjkP.
Clause 5 (Semicircular operators). Let j∈[n]. By Clause 2, Sj=lj+lj∗. 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, lj is the adjoint of lj∗, so Sj has the adjoint lj∗+lj=Sj; thus Sj is an adjoint of itself, hence self-adjoint by the same clause. The same argument with Dj=rj+rj∗ shows that Dj is self-adjoint. By The Free Fock Space: Creation, Annihilation and Semicircular Operators §operators, each of lj,lˉj,rj,rˉj is the unique operator in L(Fn) 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=1 is such an operator and has bound 1; so 1 is a bound for each of them, and their operator norms are at most 1 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 and ∥Dj∥op≤2.
Clause 6 (Left and right commute). Let j,k∈[n]. Using Sj=lj+lj∗, Dk=rk+rk∗ (Clause 2) and distributivity of composition over sums,
SjDk−DkSj=(ljrk−rklj)−(rk∗lj−ljrk∗)+(lj∗rk−rklj∗)+(lj∗rk∗−rk∗lj∗).
The first and last brackets vanish by Clause 3; by Clause 4 (the first relation with j,k interchanged, and the second relation) the middle terms are −δkjP+δjkP=0. Hence SjDk=DkSj.
Clause 7 (Reversal). First, an auxiliary fact (C): SuDk=DkSu for every u∈Wn and k∈[n]. For u=∅, S∅=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∈N, the statement for m being that SuDk=DkSu for every k and every u of length m. For m=1, u=(i) is a letter by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §last-letter, Su=Si by Evaluation of Noncommutative Polynomials at a Tuple of Bounded Operators §word-products, and Clause 6 applies. If the statement holds for m and u has length m+1, then u=v(i) with v of length m by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §last-letter, and Su=SvSi 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=DkSu by Clause 6 and the induction hypothesis.
Now we prove SwΩ=DwrevΩ. For w=∅ both sides are IΩ=Ω, as ∅rev=∅ (Words over a Finite Alphabet: the Empty Word, Concatenation and Reversal §reversal). For words of positive length we induct on the length m∈N, the statement for m being that SwΩ=DwrevΩ for every w of length m. For m=1, w=(j) is a letter and wrev=(j) by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §reversal; since Ω=[x∅] and (j)∅=∅(j)=(j), Clause 2 gives
SjΩ=lj[x∅]+lj∗Ω=[xj]=rj[x∅]+rj∗Ω=DjΩ.
If the statement holds for m and w has length m+1, write w=v(j) with v of length m (Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §last-letter); then wrev=(j)vrev 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=1, (C) and the induction hypothesis,
SwΩ=SvSjΩ=SvDjΩ=DjSvΩ=DjDvrevΩ=D(j)vrevΩ=DwrevΩ.
Clause 8 (Right annihilation of the vacuum orbit). Fix j∈[n]. For a∈[n], expanding Sa=la+la∗ and using Clause 4 (first relation, with k=a) and Clause 3 (with a,j in place of j,k),
rj∗Sa−Sarj∗=(rj∗la−larj∗)+(rj∗la∗−la∗rj∗)=δjaP.(†)
We induct on the length k∈N of w, the statement for k being the displayed formula of Clause 8 for every word w of length k.
For k=1, w=(a) is a letter, SwΩ=SaΩ=[xa] (Clause 7, case m=1), and since (a)=∅(a), rj∗[x(a)]=rˉj[x∅(a)]=δjaΩ. On the right side, Lj(w) is {1} if a=j and empty otherwise; for s=1, w<1=w>1=∅, so the term is ⟨Ω,Ω⟩Ω=Ω. Both sides equal δjaΩ.
Suppose the statement holds for k and let w have length k+1. Let a=w1 and let v be the word of length k with vt=wt+1 for t∈[k]; then w=(a)v by Words over a Finite Alphabet: the Empty Word, Concatenation and Reversal §concatenation, and Sw=SaSv by Evaluation of Noncommutative Polynomials at Bounded Operators: a Unital Homomorphism Compatible with Adjoints, Substitution, Representations and the GNS Multiplication Operators §values. By (†), the induction hypothesis for v and linearity of Sa,
rj∗SwΩ=Sarj∗SvΩ+δjaPSvΩ=t∈Lj(v)∑⟨Ω,Sv>tΩ⟩SaSv<tΩ+δja⟨Ω,SvΩ⟩Ω.
For t∈[k] put s=t+1∈[k+1]. Then ws=vt, so s∈Lj(w) if and only if t∈Lj(v); moreover w<s=(w1,…,wt)=(a)v<t and w>s=(wt+2,…,wk+1)=v>t, so SaSv<t=Sw<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=1 lies in Lj(w) if and only if a=j, and w<1=∅, w>1=v, so its term is ⟨Ω,SvΩ⟩S∅Ω=⟨Ω,SvΩ⟩Ω. Since Lj(w) is the disjoint union of {t+1: t∈Lj(v)} and of {1} or the empty set according as a=j or not, reindexing the finite sum by the bijection t↦t+1 gives
rj∗SwΩ=s∈Lj(w)∑⟨Ω,Sw>sΩ⟩Sw<sΩ,
which is the statement for k+1. This completes the induction and the proof.