Each result cited is universally quantified over the data in its own statement.
Notation. Write N=m+n. Let ι2:Pn→PN be the substitution of the tuple (xm+1,…,xN), as in Freeness of Two Groups of Variables under a Noncommutative Law §free, and for j∈[n] put yj=xm+j∈PN. For a law λ of k variables and r∈[k], ∂rλ is the free difference quotient of λ in xr, and δij, w<l, w>l are as in the preamble of The Free Difference Quotient and the Conjugate Variables of a Noncommutative Law. Recall that 1=x∅ by The Algebra of Noncommutative Polynomials in Finitely Many Self-Adjoint Variables §monomials. For a word v=(v1,…,vh)∈Wn let v+=(v1+m,…,vh+m)∈WN, with ∅+=∅; every word in Wm is also regarded as a word in WN. Put A1=ι1(Pm) and A2=ι2(Pn), subsets of PN. For γ∈ΣN, an element c∈PN is called γ-centred if γ(c)=0.
Step 0: elementary facts. (U) Let k∈N. Two linear maps Pk→C that agree on every monomial xw, w∈Wk, are equal, by the uniqueness in claim (a) of Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §linear-extension. (M) For w∈Wm and v∈Wn we have ι1(xw)=xw and ι2(xv)=xv+: by Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §values these are the products along w and v of the substituted tuples, namely xw1⋯xwh and xv1+m⋯xvh′+m (h,h′ the lengths), and these equal xw and xv+ by xuxu′=xuu′ (Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §monomials) and induction on the length, the empty word giving 1 on both sides. In particular ι2(xj)=yj for j∈[n]. (A) A1 and A2 contain 1 and are closed under sums, complex multiples and products, since ι1 and ι2 are linear, map 1 to 1 and are multiplicative by Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §values and Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §homomorphism. Hence, for γ∈ΣN, e∈{1,2} and c∈Ae, the element c∘=c−γ(c)1 lies in Ae and is γ-centred, because γ(1)=1 by (a) of Noncommutative Laws of Finitely Many Self-Adjoint Variables with a Norm Bound §tracial-state; and c=c∘+γ(c)1.
Step 1: a product rule. Fix λ∈ΣN and r∈[N]. For P,Q∈PN let ℓP,Q:PN→C be the linear map with ℓP,Q(x∅)=0 and
ℓP,Q(xw)=l=1∑hδwlrλ(Pxw<l)λ(xw>lQ)
for every word w∈WN of length h∈N; it exists and is unique by claim (a) of Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §linear-extension. Since 1p=p1=p (Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §monomials), ℓ1,1 agrees on monomials with ∂rλ as defined in The Free Difference Quotient and the Conjugate Variables of a Noncommutative Law §difference-quotient, so ℓ1,1=∂rλ by (U).
(1.1) For P,P′,Q,Q′∈PN and c∈C, ℓP+cP′,Q=ℓP,Q+cℓP′,Q and ℓP,Q+cQ′=ℓP,Q+cℓP,Q′: both sides of each identity are linear maps that agree on monomials by the distributive laws of Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra and the linearity of λ, so they are equal by (U).
(1.2) For every integer s≥0 and all c0,…,cs∈PN, writing c<i=c0⋯ci−1 and c>i=ci+1⋯cs (empty products being 1; products are unambiguous by associativity, Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra),
∂rλ(c0c1⋯cs)=i=0∑sℓc<i,c>i(ci).
First let every ci be a monomial, ci=xw(i) with w(i)∈WN of length hi≥0, and let w=w(0)w(1)⋯w(s), of length h=h0+⋯+hs. By Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §monomials, c0⋯cs=xw, c<i=xw(0)⋯w(i−1) and c>i=xw(i+1)⋯w(s). If h=0 both sides vanish, since ∂rλ(1)=0 and ℓP,Q(x∅)=0. If h≥1, the assignment (i,l′)↦l=h0+⋯+hi−1+l′, for i∈{0,…,s} with hi≥1 and l′∈[hi], is a bijection onto [h], and for corresponding indices wl=wl′(i), w<l=w(0)⋯w(i−1)w<l′(i) and w>l=w>l′(i)w(i+1)⋯w(s); hence xw<l=c<ixw<l′(i) and xw>l=xw>l′(i)c>i by Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §monomials. Grouping the h terms of the sum defining ∂rλ(xw) according to i therefore gives ∑iℓc<i,c>i(xw(i)), the indices i with hi=0 contributing ℓc<i,c>i(x∅)=0. For general factors, let E(i0), for i0∈{0,…,s+1}, be the statement that (1.2) holds for all (c0,…,cs) such that ci is a monomial for every i≥i0. E(0) is the monomial case just proved. Assume E(i0) with i0≤s, and fix ci for i=i0, arbitrary for i<i0 and monomials for i>i0. As functions of ci0∈PN, the left side is linear by Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra and the linearity of ∂rλ, and the right side is linear: the term i=i0 because ℓc<i0,c>i0 is linear, and the terms i=i0 by (1.1), because ci0 enters c<i or c>i linearly by Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra. By E(i0) the two sides agree when ci0 is a monomial, so they agree for all ci0 by (U); this is E(i0+1). By induction on i0, E(s+1) holds, which is (1.2).
Step 2: reduction to alternating products. Fix γ∈ΣN. For an integer k≥0 let Tk be the set of products b0a1b1a2b2⋯akbk with a1,…,ak∈A1 and b0,…,bk∈A2 (so T0=A2), and for k∈N let Sk⊆Tk be the set of those products in which a1,…,ak and b1,…,bk−1 are γ-centred (b0 and bk arbitrary in A2). (2.1) If V⊆PN is closed under sums and complex multiples and contains A2 and Sk for every k∈N, then V contains every monomial of PN.
We show by strong induction on k≥0 that Tk⊆V. For k=0 this is the hypothesis A2⊆V. Let k≥1, assume Tk′⊆V for every k′<k, and let q=b0a1b1⋯akbk∈Tk. By Step 0 (A) write ai=ai∘+γ(ai)1 for i∈[k] and bi=bi∘+γ(bi)1 for i∈[k−1], with ai∘∈A1 and bi∘∈A2 γ-centred. Expanding q by the distributive laws of Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra writes it as a sum of 22k−1 terms, one for each choice, for each of these 2k−1 factors, of its centred part or of its scalar part. The term that chooses every centred part is b0a1∘b1∘⋯ak∘bk∈Sk⊆V. In every other term at least one factor is replaced by a scalar multiple of 1; pulling out the scalars and multiplying together adjacent factors that lie in the same Ae, which stays in Ae by Step 0 (A), writes the term as a complex multiple of an alternating product in Tk′, where k′ is the number of maximal groups of kept factors ai∘ not separated by a kept factor bi∘ (if no ai∘ is kept, the term lies in A2=T0). Here k′<k: if some ai was replaced, fewer than k factors ai∘ are kept, and otherwise some bi with i∈[k−1] was replaced, which joins ai∘ and ai+1∘ into one group. By the induction hypothesis each such term lies in V, and so does their sum q.
Now let u∈WN. If no letter of u lies in [m], then u=v+ for some v∈Wn and xu=ι2(xv)∈A2 by (M). Otherwise let u1,…,uk (k∈N) be the maximal nonempty segments of consecutive letters of u lying in [m], in order, so that u=v0+u1v1+u2⋯ukvk+ with v0,…,vk∈Wn. Then xu=xv0+xu1xv1+⋯xukxvk+ by Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §monomials, with xui=ι1(xui)∈A1 and xvi+=ι2(xvi)∈A2 by (M); so xu∈Tk⊆V.
Step 3: a vanishing lemma for free laws. Let γ∈ΣN be free. (3.1) For k∈N, γ-centred a1,…,ak∈A1, γ-centred b1,…,bk−1∈A2 and any e∈A2,
γ(ea1b1a2⋯bk−1ak)=0.
Indeed, e=e∘+γ(e)1 by Step 0 (A), so by linearity of γ the left side equals γ(e∘a1b1⋯bk−1ak)+γ(e)γ(a1b1⋯bk−1ak). Each element of A1 is ι1(p) with p∈Pm and each element of A2 is ι2(p) with p∈Pn. The first product has 2k γ-centred factors from A2,A1,A2,…,A1 alternately, and the second has 2k−1 γ-centred factors from A1,A2,…,A1 alternately; so both values are 0 by the definition of freeness, Freeness of Two Groups of Variables under a Noncommutative Law §free.
Step 4: the direction (⇒) of clause 1. Let γ=α⋆scn. By The Free Product of Two Noncommutative Laws: Existence, Uniqueness, Norm Bound, Substitutions and Weak-Star Continuity §product, γ∈ΣN is free, γ∘ι1=α and γ∘ι2=scn. By The Semicircular Law and Its Scalings §standard, scn satisfies the Schwinger-Dyson equation: scn(xjr)=∂jscn(r) for j∈[n] and r∈Pn. Fix j∈[n] and let V be the set of q∈PN with γ(yjq)=∂m+jγ(q). Both sides are linear in q (by the linearity of γ and of ∂m+jγ and by Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra), so V is closed under sums and complex multiples. We show below that A2⊆V (4a) and that Sk⊆V for every k∈N (4b), where Sk is formed with this γ. Then V contains every monomial by (2.1), so the linear maps q↦γ(yjq) and ∂m+jγ are equal by (U). As j∈[n] was arbitrary, γ satisfies the Schwinger-Dyson equation in the last n variables.
(4a) Let r∈Pn. By Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §homomorphism and (M), yjι2(r)=ι2(xjr), so γ(yjι2(r))=scn(xjr)=∂jscn(r). On the other hand, the linear maps r↦∂m+jγ(ι2(r)) and ∂jscn from Pn to C agree on monomials: at x∅=1 both are 0, as ι2(1)=1; and for v∈Wn of length h∈N we have ι2(xv)=xv+ by (M), (v+)l=vl+m, (v+)<l=(v<l)+ and (v+)>l=(v>l)+, and γ(xu+)=γ(ι2(xu))=scn(xu) for u∈Wn, so by The Free Difference Quotient and the Conjugate Variables of a Noncommutative Law §difference-quotient
∂m+jγ(xv+)=l=1∑hδvl+m,m+jγ(x(v<l)+)γ(x(v>l)+)=l=1∑hδvljscn(xv<l)scn(xv>l)=∂jscn(xv).
By (U) the two maps are equal, so ∂m+jγ(ι2(r))=∂jscn(r)=γ(yjι2(r)), i.e. ι2(r)∈V.
(4b) Let k∈N and q=b0a1b1⋯akbk∈Sk. Left side. By (c) of Noncommutative Laws of Finitely Many Self-Adjoint Variables with a Norm Bound §tracial-state, applied to yjb0a1b1⋯bk−1ak and bk, we get γ(yjq)=γ(ea1b1⋯bk−1ak) with e=bkyjb0, which lies in A2 by (M) and Step 0 (A); hence γ(yjq)=0 by (3.1). Right side. Apply (1.2) with λ=γ, r=m+j, s=2k and (c0,…,c2k)=(b0,a1,b1,…,ak,bk): ∂m+jγ(q) is the sum of the terms ℓPi,Qi(bi), i∈{0,…,k}, where Pi=b0a1b1⋯bi−1ai (with P0=1) and Qi=ai+1bi+1⋯akbk (with Qk=1), and of terms ℓP,Q(ai), i∈[k], for suitable P,Q∈PN. The terms of the second kind vanish: for all P,Q the linear map ℓP,Q∘ι1:Pm→C vanishes at x∅ (as ι1(1)=1) and at xw for every nonempty w∈Wm, because ι1(xw)=xw by (M) and no letter of w equals m+j, so every δwl,m+j is 0; hence ℓP,Q∘ι1=0 by (U). The terms of the first kind vanish as well: fix i∈{0,…,k}; by (U) it suffices to see that ℓPi,Qi∘ι2 vanishes on monomials. It vanishes at x∅, and for v∈Wn of length h∈N, by (M),
ℓPi,Qi(ι2(xv))=l=1∑hδvl+m,m+jγ(Pigl)γ(gl′Qi),gl=x(v<l)+,gl′=x(v>l)+,
where gl,gl′∈A2 by (M). If i≥1, then by (c) of Noncommutative Laws of Finitely Many Self-Adjoint Variables with a Norm Bound §tracial-state γ(Pigl)=γ(glPi)=γ((glb0)a1b1⋯bi−1ai), which is 0 by (3.1) applied with i in place of k and e=glb0∈A2. If i=0, then by (c) of Noncommutative Laws of Finitely Many Self-Adjoint Variables with a Norm Bound §tracial-state γ(gl′Q0)=γ(gl′a1b1⋯akbk)=γ((bkgl′)a1b1⋯bk−1ak), which is 0 by (3.1) with e=bkgl′∈A2. So every summand is 0, whence ∂m+jγ(q)=0=γ(yjq) and q∈V.
Step 5: the direction (⇐) of clause 1. Let γ∈ΣN with γ∘ι1=α satisfy the Schwinger-Dyson equation in the last n variables, and let γ′=α⋆scn. By The Free Product of Two Noncommutative Laws: Existence, Uniqueness, Norm Bound, Substitutions and Weak-Star Continuity §product γ′∘ι1=α, and by Step 4 γ′ also satisfies the Schwinger-Dyson equation in the last n variables. Let K be the set of integers h≥0 such that γ(xw)=γ′(xw) for every w∈WN of length h. We show by strong induction on h that every h≥0 lies in K. For h=0, γ(x∅)=γ(1)=1=γ′(1) by (a) of Noncommutative Laws of Finitely Many Self-Adjoint Variables with a Norm Bound §tracial-state. Let h≥1, assume h′∈K for every h′<h, and let w∈WN have length h. If every letter of w lies in [m], then xw=ι1(xw) by (M), so γ(xw)=α(xw)=γ′(xw). Otherwise there are l∈[h] and j∈[n] with wl=m+j; put u=w<l and v=w>l, so xw=xu(yjxv) by Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §monomials. By (c) of Noncommutative Laws of Finitely Many Self-Adjoint Variables with a Norm Bound §tracial-state and Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §monomials, and then The Schwinger-Dyson Equation for a Noncommutative Law §relative and The Free Difference Quotient and the Conjugate Variables of a Noncommutative Law §difference-quotient, for ρ∈{γ,γ′}
ρ(xw)=ρ(yjxvu)=∂m+jρ(xvu),
which is 0 if vu=∅, and otherwise equals ∑l′=1h−1δ(vu)l′,m+jρ(x(vu)<l′)ρ(x(vu)>l′), where vu has length h−1 and the words (vu)<l′ and (vu)>l′ have lengths l′−1<h and h−1−l′<h. By the induction hypothesis the two sums for ρ=γ and ρ=γ′ agree term by term, so γ(xw)=γ′(xw) and h∈K. Hence γ and γ′ agree on all monomials, and γ=γ′=α⋆scn by (U). Steps 4 and 5 prove clause 1.
Clause 2. Let γ=scm⋆scn∈ΣN. By Step 4 (with α=scm), γ(xm+jq)=∂m+jγ(q) for all j∈[n] and q∈PN. It remains to treat the first m variables. Let s=(xm+1,…,xN,x1,…,xm), an N-tuple in PN with si=xm+i for i∈[n] and sn+i=xi for i∈[m], and let β=γ∘σs. By The Free Product of Two Noncommutative Laws: Existence, Uniqueness, Norm Bound, Substitutions and Weak-Star Continuity §symmetry, β=scn⋆scm, the free product for the split of n+m variables into the first n and the last m. Clause 1, already proved and applied with the roles of m and n exchanged and with α=scn (the hypothesis β∘ι1=scn holding by The Free Product of Two Noncommutative Laws: Existence, Uniqueness, Norm Bound, Substitutions and Weak-Star Continuity §product), gives
β(xn+iq′)=∂n+iβ(q′)(i∈[m], q′∈PN).
Let A:[N]×[N]→R be given by Ail=1 if si=xl and Ail=0 otherwise, and let T=(A,0), an affine datum from N to N variables. Each row of A has exactly one entry 1, so the tuple of T is s and σT=σs by Affine Data and Affine Substitutions of Noncommutative Polynomials §substitution; thus β=γ∘σT. For i∈[m] the only i′∈[N] with Ai′i=0 is i′=n+i, so the chain rule gives ∂iγ(σs(q′))=∂n+iβ(q′) for q′∈PN. Now let s′=(xn+1,…,xN,x1,…,xn). For j∈[m], σs(sj′)=σs(xn+j)=sn+j=xj, and for j=m+i with i∈[n], σs(sj′)=σs(xi)=si=xm+i, by Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §values; so Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §composition and Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §identity give σs(σs′(q))=q for every q∈PN. Let i∈[m], q∈PN and q′=σs′(q). Since xi=sn+i=σs(xn+i), Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §homomorphism yields
γ(xiq)=γ(σs(xn+iq′))=β(xn+iq′)=∂n+iβ(q′)=∂iγ(σs(q′))=∂iγ(q).
Hence γ satisfies the Schwinger-Dyson equation in all N variables. So does scN by The Semicircular Law and Its Scalings §standard, and by The Vacuum Law of the Semicircular Operators is the Unique Noncommutative Law Satisfying the Schwinger-Dyson Equation §unique both equal the vacuum law λS of N semicircular operators; therefore scm⋆scn=scm+n.
Clause 3. Let T=(O,0), an affine datum from n to k variables, with tuple aiT=∑l=1nOilxl (i∈[k]) by Affine Data and Affine Substitutions of Noncommutative Polynomials §tuple, and let μ=scn∘σT, which lies in Σk by Affine Substitutions of Noncommutative Laws: Self-Adjointness, Composition, Moment Formulas and Positivity, and the Coordinate Data §self-adjoint. Let i∈[k] and p∈Pk. By Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §homomorphism and Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §values, σT(xip)=aiTσT(p). Using the linearity of scn and Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra, then the Schwinger-Dyson equation of scn (The Semicircular Law and Its Scalings §standard, The Schwinger-Dyson Equation for a Noncommutative Law §equation), then the chain rule for T and γ=scn, namely ∂lscn(σT(p))=∑i′=1kOi′l∂i′μ(p), and finally the hypothesis on O, we get
μ(xip)=l=1∑nOilscn(xlσT(p))=l=1∑nOil∂lscn(σT(p))=i′=1∑k(l=1∑nOilOi′l)∂i′μ(p)=∂iμ(p).
So μ satisfies the Schwinger-Dyson equation for k variables. So does sck (The Semicircular Law and Its Scalings §standard), and by The Vacuum Law of the Semicircular Operators is the Unique Noncommutative Law Satisfying the Schwinger-Dyson Equation §unique both equal the vacuum law λS of k semicircular operators; hence scn∘σ(O,0)=sck.