TheoremBase

Expands the squared cyclic gradients into a double sum over rotated words, reduces each product by maximal cancellation and stripping to a cyclically reduced word, and bounds the result by a Haagerup-type double Cauchy-Schwarz over the cancelled middle word, giving the trilinear constant K = 128.

Proof

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

We prove the estimate with the explicit trilinear constant K=128K=128.

Conventions. Fix μ,ν∈Ld\mu,\nu\in\mathcal{L}_{d} and n∈Nn\in\mathbb{N}, and write θ=θd=16144 d\theta=\theta_{d}=\frac{1}{6144\,d} as in The Word Gauge: Weights, the Space of Weighted Square-Summable Word Functions, Its Norm and Inner Product, and the Length-Weighted Gauge §weights. Since nothing beyond μ,ν∈Ld\mu,\nu\in\mathcal{L}_{d} and n∈Nn\in\mathbb{N} is used, proving the displayed inequality with K=128K=128 for these data proves the lemma. For z∈W2dz\in W_{2d} put Δ(z)=μ(z)−ν(z)∈C\Delta(z)=\mu(z)-\nu(z)\in\mathbb{C}; then Δ(∅)=1−1=0\Delta(\varnothing)=1-1=0 by Laws of d-Tuples of Unitaries §normalised. By The Word Gauge Space Is a Real Hilbert Space, and the Unitary Laws Form a Compact Metric Space in It §sobolev, x=ιd(μ)−ιd(ν)x=\iota_{d}(\mu)-\iota_{d}(\nu) is the map w↦Δ(w)w\mapsto\Delta(w) on Wd∘W^{\circ}_{d}, the map w↦cw∣w∣∣x(w)∣2w\mapsto c_{w}|w||x(w)|^{2} is summable, and ∥x∥d,1\lVert x\rVert_{d,1} is defined. For k∈Nk\in\mathbb{N} put Xk=∑w∈Wd,k∘cw∣x(w)∣2X_{k}=\sum_{w\in W^{\circ}_{d,k}}c_{w}|x(w)|^{2}, which is nonnegative by Real Sums over a Finite Index Set: Comparison, Nonnegativity, Monotonicity, Term Bounds, Absolute Values, Counting and Limits §nonnegative since cw>0c_{w}>0 (The Word Gauge: Weights, the Space of Weighted Square-Summable Word Functions, Its Norm and Inner Product, and the Length-Weighted Gauge §weights). The empty word is cyclically reduced (Reduced and Cyclically Reduced Words in Unitary Letters §reduced, Reduced and Cyclically Reduced Words in Unitary Letters §cyclically-reduced) and x(∅)=Δ(∅)=0x(\varnothing)=\Delta(\varnothing)=0; the kk-th block sum of w↦cw∣w∣∣x(w)∣2w\mapsto c_{w}|w||x(w)|^{2} is kXkkX_{k}, because ∣w∣=k|w|=k on Wd,k∘W^{\circ}_{d,k}. Hence The Word Gauge: Weights, the Space of Weighted Square-Summable Word Functions, Its Norm and Inner Product, and the Length-Weighted Gauge §sums, The Word Gauge: Weights, the Space of Weighted Square-Summable Word Functions, Its Norm and Inner Product, and the Length-Weighted Gauge §norm and The Word Gauge: Weights, the Space of Weighted Square-Summable Word Functions, Its Norm and Inner Product, and the Length-Weighted Gauge §sobolev give, the square of a nonnegative square root being the number itself, ∥x∥d2=∑k=1∞Xk\lVert x\rVert_{d}^{2}=\sum_{k=1}^{\infty}X_{k} and ∥x∥d,12=∑k=1∞kXk\lVert x\rVert_{d,1}^{2}=\sum_{k=1}^{\infty}kX_{k}, both series converging and having nonnegative terms; so by Series of Nonnegative Real Numbers, Comparison, and the Geometric Series §dominates, for every M∈NM\in\mathbb{N},

∑k=1MXk≤∥x∥d2,∑k=1Mk Xk≤∥x∥d,12.(0.1)\sum_{k=1}^{M}X_{k}\le\lVert x\rVert_{d}^{2},\qquad\sum_{k=1}^{M}k\,X_{k}\le\lVert x\rVert_{d,1}^{2}.\tag{0.1}

Real arithmetic. Rearrangements of real equalities and inequalities (adding, multiplying by a nonnegative number, dividing by a positive number, taking reciprocals of positive numbers) are those of Elementary Arithmetic in an Ordered Field, Elementary Order Arithmetic in an Ordered Field and Order Reversal under Reciprocals, and Summability of the Reciprocals of the Squares §reciprocal. For a nonnegative real rr, r\sqrt{r} is its nonnegative square root (Existence and Uniqueness of the Nonnegative Square Root). For nonnegative reals r,r′r,r' one has r≤r′r\le r' if and only if r2≤r′2r^{2}\le r'^{2}, and r=r′r=r' if and only if r2=r′2r^{2}=r'^{2}, by the weak and equality forms of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field; in particular rr′=rr′\sqrt{rr'}=\sqrt{r}\sqrt{r'} and r2=r\sqrt{r^{2}}=r. Put ϑ=θ\vartheta=\sqrt{\theta}. For a real rr and N∈NN\in\mathbb{N}, rNr^{N} is the natural power, and r0=1r^{0}=1; then rN+N′=rNrN′r^{N+N'}=r^{N}r^{N'} for N,N′∈{0}∪NN,N'\in\{0\}\cup\mathbb{N}, by Addition of Exponents for Natural Number Powers in a Field when both are in N\mathbb{N} and trivially otherwise; (rr′)N=rNr′N(rr')^{N}=r^{N}r'^{N} and 1N=11^{N}=1, and 0≤r≤r′0\le r\le r' implies 0≤rN≤r′N0\le r^{N}\le r'^{N}, by claims 3, 2 and 5 of Properties of Natural Number Powers in a Field (trivially for N=0N=0). In particular (ϑN)2=(ϑϑ)N=θN(\vartheta^{N})^{2}=(\vartheta\vartheta)^{N}=\theta^{N}.

Finite sums. A sum over an empty index set is 00. For sums of real numbers over finite sets: termwise inequalities pass to sums by Real Sums over a Finite Index Set: Comparison, Nonnegativity, Monotonicity, Term Bounds, Absolute Values, Counting and Limits §comparison; sums of nonnegative terms are nonnegative and do not decrease when the index set is enlarged, by Real Sums over a Finite Index Set: Comparison, Nonnegativity, Monotonicity, Term Bounds, Absolute Values, Counting and Limits §nonnegative and Real Sums over a Finite Index Set: Comparison, Nonnegativity, Monotonicity, Term Bounds, Absolute Values, Counting and Limits §monotone; sums agree with numerical ranges, may be reindexed along bijections, and are additive and homogeneous, by claims 1, 2, 3 and 4 of Properties of a Sum over a Finite Index Set; they split over disjoint unions by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §disjoint-union; iterated sums are sums over dependent pairs by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §pairs; terms equal to 00 may be dropped by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing; and a product of two sums is the sum over the Cartesian product, by The Product of Two Sums over Finite Index Sets is a Sum over the Cartesian Product. Finite unions of finite sets are finite by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §finite-union, subsets and images of finite sets are finite by claims 3 and 4 of Basic Properties of Finite Sets, and finite products of finite sets are finite by claim 1 of Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets. For complex numbers we use the rules for conjugation, the modulus of a conjugate, multiplicativity of the modulus, the triangle inequality and the modulus of a nonnegative real, claims 1, 3, 4, 7 and 8 of Properties of Complex Conjugation and Modulus, and the modulus of a finite sum, Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §modulus. In particular ∣i∣=1|\mathrm{i}|=1 (as ∣i∣2=i i‾=1|\mathrm{i}|^{2}=\mathrm{i}\,\overline{\mathrm{i}}=1) and ∣ε(l)∣=1|\varepsilon(l)|=1 for every letter ll.

Words. For L∈NL\in\mathbb{N} let [2d]L[2d]^{L} be the set of words of length LL, nonempty and finite by Counting Cyclically Reduced Words: Finiteness and the Bound (2d)^k §finite, and put [2d]0={∅}[2d]^{0}=\{\varnothing\}. For M∈{0}∪NM\in\{0\}\cup\mathbb{N} let UMU_{M} be the union of the sets [2d]L[2d]^{L}, L∈{0,1,…,M}L\in\{0,1,\dots,M\}, a finite set containing every word of length at most MM. By Words over a Finite Alphabet: the Empty Word, Concatenation and Reversal §concatenation and Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §monoid, if uu has length LL and vv length L′L' then uvuv has length L+L′L+L', its first LL letters are those of uu and its last L′L' letters those of vv, and concatenation is associative. Consequently, for fixed L∈{0}∪NL\in\{0\}\cup\mathbb{N}, the maps (u,v)↦uv(u,v)\mapsto uv on [2d]L×W2d[2d]^{L}\times W_{2d} and on W2d×[2d]LW_{2d}\times[2d]^{L} are injective, and for L≤L′L\le L' the map (u,v)↦uv(u,v)\mapsto uv is a bijection from [2d]L×[2d]L′−L[2d]^{L}\times[2d]^{L'-L} onto [2d]L′[2d]^{L'} (split a word after its LL-th letter).

Step 0 (elementary inequalities).

(C1) Finite Cauchy--Schwarz. Let FF be a nonempty finite set and a,b:F→Ra,b:F\to\mathbb{R} with a,b≥0a,b\ge0. Then

∑y∈Fa(y)b(y)≤∑y∈Fa(y)2  ∑y∈Fb(y)2,\sum_{y\in F}a(y)b(y)\le\sqrt{\textstyle\sum_{y\in F}a(y)^{2}}\;\sqrt{\textstyle\sum_{y\in F}b(y)^{2}},

and, with bb constantly 11 and NF=∑y∈F1N_{F}=\sum_{y\in F}1, (∑y∈Fa(y))2≤NF∑y∈Fa(y)2\bigl(\sum_{y\in F}a(y)\bigr)^{2}\le N_{F}\sum_{y\in F}a(y)^{2}. (This is The Cauchy-Schwarz Inequality in a Real Inner Product Space for the standard pairing on RF\mathbb{R}^{F}; we give the direct proof.) Put A=∑a2A=\sqrt{\sum a^{2}} and B=∑b2B=\sqrt{\sum b^{2}}. If A=0A=0, then ∑a2=0\sum a^{2}=0, and since each nonnegative term a(y)2a(y)^{2} is at most the sum (monotonicity in the index set), a(y)2=0a(y)^{2}=0, so a(y)=0a(y)=0 for all yy and the left side is 00; likewise if B=0B=0. Otherwise, for each yy, 0≤(a(y)A−b(y)B)20\le\bigl(\frac{a(y)}{A}-\frac{b(y)}{B}\bigr)^{2} by Nonnegativity of Squares in an Ordered Field, that is 2a(y)b(y)AB≤a(y)2A2+b(y)2B22\frac{a(y)b(y)}{AB}\le\frac{a(y)^{2}}{A^{2}}+\frac{b(y)^{2}}{B^{2}}; summing gives 2AB∑ab≤1+1\frac{2}{AB}\sum ab\le1+1. The second form follows by squaring the nonnegative sides.

(C2) Numerical facts. 0<θ≤161440<\theta\le\frac{1}{6144}, because 6144≤6144 d6144\le6144\,d and reciprocals reverse the order; hence 0≤2θ≤10\le2\theta\le1 and θ≤14\theta\le\frac14, so ϑ2≤(12)2\vartheta^{2}\le(\frac12)^{2} and 0≤ϑ≤120\le\vartheta\le\frac12. Moreover 2d θ=130722d\,\theta=\frac{1}{3072}, as in The Embedding of Unitary Laws into the Word Gauge Space and the Gauge Distance §embedding.

(C3) For every N∈NN\in\mathbb{N}, N≤2NN\le2^{N} and hence NθN≤1N\theta^{N}\le1. Indeed 1≤2=211\le2=2^{1}, and if N≤2NN\le2^{N} then, as 1=1N≤2N1=1^{N}\le2^{N}, N+1≤2N+2N=2N+1N+1\le2^{N}+2^{N}=2^{N+1} by claim 1 of Properties of Natural Number Powers in a Field; so NθN≤2NθN=(2θ)N≤1N=1N\theta^{N}\le2^{N}\theta^{N}=(2\theta)^{N}\le1^{N}=1 by (C2).

(C4) For k∈{0}∪Nk\in\{0\}\cup\mathbb{N}, ∑j=0kϑj≤2\sum_{j=0}^{k}\vartheta^{j}\le2; and ∑t=0n(2d θ)t≤2\sum_{t=0}^{n}(2d\,\theta)^{t}\le2. For the first, the case k=0k=0 reads 1≤21\le2; for k≥1k\ge1, ϑj≤(12)j\vartheta^{j}\le(\frac12)^{j} by (C2), and ∑j=1k(12)j≤1\sum_{j=1}^{k}(\frac12)^{j}\le1 by Series of Nonnegative Real Numbers, Comparison, and the Geometric Series §geometric (the halving series has sum 11) and Series of Nonnegative Real Numbers, Comparison, and the Geometric Series §dominates. For the second, with r=13072r=\frac{1}{3072}, Series of Nonnegative Real Numbers, Comparison, and the Geometric Series §geometric gives ∑t=1nrt=r−rn+11−r≤r1−r=13071≤1\sum_{t=1}^{n}r^{t}=\frac{r-r^{n+1}}{1-r}\le\frac{r}{1-r}=\frac{1}{3071}\le1.

(C5) Let N∈{0}∪NN\in\{0\}\cup\mathbb{N} and k,k′,p∈Nk,k',p\in\mathbb{N} with k≤k′k\le k' and k+k′=p+2Nk+k'=p+2N. Then θNk′≤4p\theta^{N}k'\le4p. Indeed, if k′≤4pk'\le4p, then θN≤1N=1\theta^{N}\le1^{N}=1 by (C2), so θNk′≤k′≤4p\theta^{N}k'\le k'\le4p. Otherwise 4p+1≤k′4p+1\le k'; since 1≤k1\le k, 2N=k+k′−p≥k′−p2N=k+k'-p\ge k'-p, so 8N≥4k′−4p≥4k′−(k′−1)=3k′+18N\ge4k'-4p\ge4k'-(k'-1)=3k'+1. Hence N≥1N\ge1 and 3k′<8N≤9N3k'<8N\le9N, so k′≤3Nk'\le3N, and by (C3) θNk′≤3NθN≤3≤4p\theta^{N}k'\le3N\theta^{N}\le3\le4p.

Step 1 (facts about words).

(W1) For every letter l∈[2d]l\in[2d], (l−1)−1=l(l^{-1})^{-1}=l. This is read off Words in Unitary Letters: Generators, Signs, Inverse Letters, Lengths and Adjoint Words §letters: if l≤dl\le d then l−1=d+ll^{-1}=d+l, whose inverse letter is the unique jj with d+l=d+jd+l=d+j, namely ll; if d<ld<l then l=d+jl=d+j with j∈[d]j\in[d], l−1=jl^{-1}=j and j−1=d+j=lj^{-1}=d+j=l.

(W2) Let z∈W2dz\in W_{2d} have length L∈NL\in\mathbb{N}. Then z∗z^{*} has length LL and (z∗)i=(zi′)−1(z^{*})_{i}=(z_{i'})^{-1} where i+i′=L+1i+i'=L+1, by Words in Unitary Letters: Generators, Signs, Inverse Letters, Lengths and Adjoint Words §adjoint and Words over a Finite Alphabet: the Empty Word, Concatenation and Reversal §reversal; for a letter ll, l∗=l−1l^{*}=l^{-1} (the case L=1L=1); (z∗)∗=z(z^{*})^{*}=z for every z∈W2dz\in W_{2d}, as noted in Word Polynomials in Unitary Letters: the Normed *-Algebra of Finitely Supported Word Functions §adjoint, so z↦z∗z\mapsto z^{*} is injective; and (uv)∗=v∗u∗(uv)^{*}=v^{*}u^{*} for all u,v∈W2du,v\in W_{2d}. For the last, Word Polynomials under a Unitary Law: Linearity, Traciality, Positivity, the Cauchy-Schwarz Inequality and the l1 Bound §algebra gives e(uv)∗=(euv)∗=(euev)∗=(ev)∗(eu)∗=ev∗eu∗=ev∗u∗e_{(uv)^{*}}=(e_{uv})^{*}=(e_{u}e_{v})^{*}=(e_{v})^{*}(e_{u})^{*}=e_{v^{*}}e_{u^{*}}=e_{v^{*}u^{*}}, and evaluating at (uv)∗(uv)^{*}, where the left side takes the value 11, gives (uv)∗=v∗u∗(uv)^{*}=v^{*}u^{*}.

(W3) If zz is reduced, then so is every word formed by consecutive letters of zz (its consecutive letters are consecutive letters of zz), and so is z∗z^{*}. For the latter let zz have length LL, i∈[L]i\in[L] with i<Li<L, and i′i' with i+i′=L+1i+i'=L+1, so that (z∗)i=(zi′)−1(z^{*})_{i}=(z_{i'})^{-1} and (z∗)i+1=(zi′−1)−1(z^{*})_{i+1}=(z_{i'-1})^{-1} by (W2). Since ((z∗)i)−1=zi′((z^{*})_{i})^{-1}=z_{i'} by (W1), an equality (z∗)i+1=((z∗)i)−1(z^{*})_{i+1}=((z^{*})_{i})^{-1} would read zi′=(zi′−1)−1z_{i'}=(z_{i'-1})^{-1}, contradicting reducedness of zz at position i′−1<Li'-1<L (note 1<i′1<i' as i<Li<L).

(W4) Let k∈Nk\in\mathbb{N}, w∈Wd,k∘w\in W^{\circ}_{d,k} and m∈[k]m\in[k]. Put q=mq=m if ε(wm)=1\varepsilon(w_{m})=1; q=m+1q=m+1 if ε(wm)=−1\varepsilon(w_{m})=-1 and m<km<k; and q=1q=1 if ε(wm)=−1\varepsilon(w_{m})=-1 and m=km=k. By Rotations and Cyclic Derivatives of Words in Unitary Letters §rotations, rm(w)=wr_{m}(w)=w if q=1q=1, and otherwise rm(w)r_{m}(w) is the concatenation of the word wqwq+1⋯wkw_{q}w_{q+1}\cdots w_{k} and the word w1⋯wq−1w_{1}\cdots w_{q-1}. Hence rm(w)r_{m}(w) has length kk, its ii-th letter is wq−1+iw_{q-1+i} for i≤k−q+1i\le k-q+1 and its (k−q+1+i)(k-q+1+i)-th letter is wiw_{i} for i≤q−1i\le q-1; so ww is determined by rm(w)r_{m}(w) together with mm and ε(wm)\varepsilon(w_{m}). Moreover rm(w)r_{m}(w) is reduced: two consecutive letters of rm(w)r_{m}(w) are either consecutive letters wi,wi+1w_{i},w_{i+1} of ww, which satisfy wi+1≠(wi)−1w_{i+1}\ne(w_{i})^{-1}, or (when 1<q1<q, so 1<k1<k) the letters wk,w1w_{k},w_{1}, and w1=(wk)−1w_{1}=(w_{k})^{-1} would give (w1)−1=wk(w_{1})^{-1}=w_{k} by (W1), contradicting Reduced and Cyclically Reduced Words in Unitary Letters §cyclically-reduced.

(W5) For all a,c,b∈W2da,c,b\in W_{2d} and λ∈Ld\lambda\in\mathcal{L}_{d}, λ(a c c∗ b)=λ(ab)\lambda(a\,c\,c^{*}\,b)=\lambda(ab). By induction on the length of cc: for c=∅c=\varnothing there is nothing to prove, as ∅∗=∅\varnothing^{*}=\varnothing. If cc has length j+1j+1, then by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §last-letter c=c′lc=c'l with a letter ll and c′c' of length jj (or c′=∅c'=\varnothing if j=0j=0), so c∗=l−1c′∗c^{*}=l^{-1}c'^{*} by (W2), and a c c∗ b=(ac′) l l−1 (c′∗b)a\,c\,c^{*}\,b=(ac')\,l\,l^{-1}\,(c'^{*}b); by Laws of d-Tuples of Unitaries §cancellation and the induction hypothesis, λ(acc∗b)=λ(ac′c′∗b)=λ(ab)\lambda(acc^{*}b)=\lambda(ac'c'^{*}b)=\lambda(ab).

Step 2 (maximal cancellation and stripping). Let v,v′v,v' be reduced words of lengths k,k′∈Nk,k'\in\mathbb{N}. Let JJ be the set of j∈{0,1,…,min⁡(k,k′)}j\in\{0,1,\dots,\min(k,k')\} such that vi′=(vi′)−1v'_{i}=(v_{i'})^{-1} whenever i∈[j]i\in[j] and i+i′=k+1i+i'=k+1; it contains 00 and is finite, and we let j(v,v′)j(v,v') be its largest element. With j=j(v,v′)j=j(v,v'), let aa be the word of length k−jk-j with ai=via_{i}=v_{i}, cc the word of length jj with ci=vk−j+ic_{i}=v_{k-j+i}, and bb the word of length k′−jk'-j with bi=vj+i′b_{i}=v'_{j+i} (each read as ∅\varnothing when its length is 00). Then:

(2a) v=acv=ac and v′=c∗bv'=c^{*}b. The first is the letter description of concatenation. For the second, by (W2) the ii-th letter of c∗c^{*}, i∈[j]i\in[j], is (cj+1−i)−1=(vk+1−i)−1=vi′(c_{j+1-i})^{-1}=(v_{k+1-i})^{-1}=v'_{i} by the definition of JJ; the remaining letters of v′v' are those of bb.

(2b) abab is reduced, of length k+k′−2jk+k'-2j. The words aa and bb are reduced by (W3). If one of them is empty, abab is the other. If both are nonempty, then j<kj<k and j<k′j<k', so j+1≤min⁡(k,k′)j+1\le\min(k,k') and j+1∉Jj+1\notin J by maximality; since the defining condition of JJ holds for all i∈[j]i\in[j], it fails at i=j+1i=j+1, that is vj+1′≠(vk−j)−1v'_{j+1}\ne(v_{k-j})^{-1}. The consecutive letters of abab are consecutive letters of aa, consecutive letters of bb, or the pair ak−j=vk−ja_{k-j}=v_{k-j}, b1=vj+1′b_{1}=v'_{j+1}; so abab is reduced.

(2c) Δ(vv′)=Δ(ab)\Delta(vv')=\Delta(ab), by (2a), associativity and (W5) applied to μ\mu and to ν\nu.

We write ρ(v,v′)=ab\rho(v,v')=ab. Since ∣ab∣=k+k′−2j≤k+k′|ab|=k+k'-2j\le k+k', ρ(v,v′)∈U2n\rho(v,v')\in U_{2n} whenever k,k′≤nk,k'\le n.

For every reduced z∈U2nz\in U_{2n} fix, by Unitary Laws: Adjoints, the Bound One, and Reduction to Cyclically Reduced Words §strip-exists, words qz∈W2dq_{z}\in W_{2d} and uz∈Wd∘u_{z}\in W^{\circ}_{d} with z=qz uz qz∗z=q_{z}\,u_{z}\,q_{z}^{*} and ∣z∣=2∣qz∣+∣uz∣|z|=2|q_{z}|+|u_{z}|, and put tz=∣qz∣∈{0}∪Nt_{z}=|q_{z}|\in\{0\}\cup\mathbb{N}. By Unitary Laws: Adjoints, the Bound One, and Reduction to Cyclically Reduced Words §strip-invariance, applied to μ\mu and to ν\nu,

Δ(z)=Δ(uz),(2.1)\Delta(z)=\Delta(u_{z}),\tag{2.1}

which is 00 if uz=∅u_{z}=\varnothing and equals x(uz)x(u_{z}) otherwise (Conventions).

Weights. For k∈Nk\in\mathbb{N} and w∈Wd,k∘w\in W^{\circ}_{d,k} put c^w=ϑk(k+1)2≥0\hat c_{w}=\frac{\vartheta^{k}}{(k+1)^{2}}\ge0; then c^w2=θk(k+1)4=cw\hat c_{w}^{2}=\frac{\theta^{k}}{(k+1)^{4}}=c_{w} by The Word Gauge: Weights, the Space of Weighted Square-Summable Word Functions, Its Norm and Inner Product, and the Length-Weighted Gauge §weights. For p∈Np\in\mathbb{N} and u∈Wd,p∘u\in W^{\circ}_{d,p} put Y(u)=p c^u ∣x(u)∣≥0Y(u)=\sqrt{p}\,\hat c_{u}\,|x(u)|\ge0, so that Y(u)2=p cu∣x(u)∣2Y(u)^{2}=p\,c_{u}|x(u)|^{2}. Define h:W2d→Rh:W_{2d}\to\mathbb{R} by h(z)=ϑtz Y(uz)h(z)=\vartheta^{t_{z}}\,Y(u_{z}) if z∈U2nz\in U_{2n} is reduced and uz≠∅u_{z}\ne\varnothing, and h(z)=0h(z)=0 otherwise; h≥0h\ge0.

Step 3 (slots, and expansion of the left side). Let W≤n∘W^{\circ}_{\le n} be as in The Truncated Cyclic Gradient of a Gauge Vector §gradient; it is finite and nonempty, as it contains Wd,1∘W^{\circ}_{d,1} (Counting Cyclically Reduced Words: Finiteness and the Bound (2d)^k §finite). Let S\mathcal{S} be the set of slots α=(w,m,s)\alpha=(w,m,s) with w∈W≤n∘w\in W^{\circ}_{\le n}, m∈[∣w∣]m\in[|w|] and s∈{1,−1}s\in\{1,-1\}; as a set of dependent pairs (w,(m,s))(w,(m,s)) it is nonempty and finite. For such α\alpha write wα=ww_{\alpha}=w, kα=∣w∣k_{\alpha}=|w|, and put

vα=rm(w) if s=1,vα=rm(w)∗ if s=−1;σα=cw ∣x(w)∣;v_{\alpha}=r_{m}(w)\ \text{if }s=1,\qquad v_{\alpha}=r_{m}(w)^{*}\ \text{if }s=-1;\qquad\sigma_{\alpha}=c_{w}\,|x(w)|; κα=12 cw x(w)‾  i ε(wm) if s=1,κα=12 cw x(w)‾  i ε(wm)‾ if s=−1.\kappa_{\alpha}=\tfrac12\,c_{w}\,\overline{x(w)}\;\mathrm{i}\,\varepsilon(w_{m})\ \text{if }s=1,\qquad\kappa_{\alpha}=\overline{\tfrac12\,c_{w}\,\overline{x(w)}\;\mathrm{i}\,\varepsilon(w_{m})}\ \text{if }s=-1.

By (W4), (W3) and (W2), vαv_{\alpha} is a reduced word of length kα∈[n]k_{\alpha}\in[n], so vα∈Unv_{\alpha}\in U_{n}; and ∣κα∣=12σα|\kappa_{\alpha}|=\frac12\sigma_{\alpha}, since cw>0c_{w}>0, ∣x(w)‾∣=∣x(w)∣|\overline{x(w)}|=|x(w)| and ∣i∣=∣ε(wm)∣=1|\mathrm{i}|=|\varepsilon(w_{m})|=1. For α=(w,m,s)\alpha=(w,m,s) put αˉ=(w,m,−s)∈S\bar\alpha=(w,m,-s)\in\mathcal{S}; then vαˉ=vα∗v_{\bar\alpha}=v_{\alpha}^{*} (using (r∗)∗=r(r^{*})^{*}=r from (W2)), καˉ=κα‾\kappa_{\bar\alpha}=\overline{\kappa_{\alpha}}, σαˉ=σα\sigma_{\bar\alpha}=\sigma_{\alpha} and kαˉ=kαk_{\bar\alpha}=k_{\alpha}. For i∈[d]i\in[d] let Si\mathcal{S}_{i} be the set of (w,m,s)∈S(w,m,s)\in\mathcal{S} with g(wm)=ig(w_{m})=i; since g(wm)∈[d]g(w_{m})\in[d] is unique (Words in Unitary Letters: Generators, Signs, Inverse Letters, Lengths and Adjoint Words §letters), the sets Si\mathcal{S}_{i} are pairwise disjoint with union S\mathcal{S}, and α∈Si\alpha\in\mathcal{S}_{i} if and only if αˉ∈Si\bar\alpha\in\mathcal{S}_{i}.

(3a) Let i∈[d]i\in[d] and λ∈Ld\lambda\in\mathcal{L}_{d}, and write Ξi=Ξx,ni\Xi^{i}=\Xi^{i}_{x,n}, Zi=Zx,niZ^{i}=Z^{i}_{x,n}. If Si\mathcal{S}_{i} is empty then λ(ΞiΞi)=0\lambda(\Xi^{i}\Xi^{i})=0; otherwise

λ(ΞiΞi)=∑(α,β)∈Si×Siκακβ λ(vαvβ).\lambda\bigl(\Xi^{i}\Xi^{i}\bigr)=\sum_{(\alpha,\beta)\in\mathcal{S}_{i}\times\mathcal{S}_{i}}\kappa_{\alpha}\kappa_{\beta}\,\lambda\bigl(v_{\alpha}v_{\beta}\bigr).

Proof. Let Si+\mathcal{S}^{+}_{i} and Si−\mathcal{S}^{-}_{i} be the slots in Si\mathcal{S}_{i} with s=1s=1 and s=−1s=-1; α↦αˉ\alpha\mapsto\bar\alpha is a bijection from Si+\mathcal{S}^{+}_{i} onto Si−\mathcal{S}^{-}_{i}. By The Truncated Cyclic Gradient of a Gauge Vector §gradient and Rotations and Cyclic Derivatives of Words in Unitary Letters §derivative, and since sums and complex multiples of word polynomials are pointwise (Word Polynomials in Unitary Letters: the Normed *-Algebra of Finitely Supported Word Functions §polynomials), ZiZ^{i} is the sum over w∈W≤n∘w\in W^{\circ}_{\le n} of cwx(w)‾ Dwic_{w}\overline{x(w)}\,D^{i}_{w}, and DwiD^{i}_{w} is a sum over the m∈[∣w∣]m\in[|w|] with g(wm)=ig(w_{m})=i. A word ww with no such mm has Dwi=0D^{i}_{w}=0, and its term is dropped by Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing. If every word is dropped, then Si+\mathcal{S}^{+}_{i} is empty and Zi=0Z^{i}=0 by the same clause, which is the sum over the empty index set Si+\mathcal{S}^{+}_{i}. Otherwise the remaining words have nonempty sets of such mm, so iterated sums over dependent pairs (Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §pairs), reindexed along (w,m)↦(w,m,1)(w,m)\mapsto(w,m,1), and homogeneity give Zi=∑α∈Si+2κα evαZ^{i}=\sum_{\alpha\in\mathcal{S}^{+}_{i}}2\kappa_{\alpha}\,e_{v_{\alpha}}. By Word Polynomials under a Unitary Law: Linearity, Traciality, Positivity, the Cauchy-Schwarz Inequality and the l1 Bound §algebra (adjoints of sums and of complex multiples, (eu)∗=eu∗(e_{u})^{*}=e_{u^{*}}), applied finitely often, and reindexing along α↦αˉ\alpha\mapsto\bar\alpha, (Zi)∗=∑α∈Si+2κα‾ evα∗=∑α∈Si−2κα evα(Z^{i})^{*}=\sum_{\alpha\in\mathcal{S}^{+}_{i}}\overline{2\kappa_{\alpha}}\,e_{v_{\alpha}^{*}}=\sum_{\alpha\in\mathcal{S}^{-}_{i}}2\kappa_{\alpha}\,e_{v_{\alpha}}. Hence Ξi=12(Zi+(Zi)∗)=∑α∈Siκαevα\Xi^{i}=\frac12\bigl(Z^{i}+(Z^{i})^{*}\bigr)=\sum_{\alpha\in\mathcal{S}_{i}}\kappa_{\alpha}e_{v_{\alpha}} by the disjoint union Si=Si+∪Si−\mathcal{S}_{i}=\mathcal{S}^{+}_{i}\cup\mathcal{S}^{-}_{i}. If Si\mathcal{S}_{i} is empty, all these sums are the zero word polynomial, so Ξi=0\Xi^{i}=0, ΞiΞi=0\Xi^{i}\Xi^{i}=0 by Word Polynomials in Unitary Letters: the Normed *-Algebra of Finitely Supported Word Functions §product, and λ(0)=0\lambda(0)=0 by Evaluation of Word Polynomials by a Unitary Law §evaluation. Otherwise distributivity, compatibility with complex multiples and eueu′=euu′e_{u}e_{u'}=e_{uu'} from Word Polynomials under a Unitary Law: Linearity, Traciality, Positivity, the Cauchy-Schwarz Inequality and the l1 Bound §algebra, applied finitely often, give ΞiΞi=∑(α,β)∈Si×Siκακβ evαvβ\Xi^{i}\Xi^{i}=\sum_{(\alpha,\beta)\in\mathcal{S}_{i}\times\mathcal{S}_{i}}\kappa_{\alpha}\kappa_{\beta}\,e_{v_{\alpha}v_{\beta}}, and Word Polynomials under a Unitary Law: Linearity, Traciality, Positivity, the Cauchy-Schwarz Inequality and the l1 Bound §linear together with λ(ez)=λ(z)\lambda(e_{z})=\lambda(z) (Evaluation of Word Polynomials by a Unitary Law §evaluation) gives the formula.

(3b) Put

S=∑(α,β)∈S×Sσασβ ∣Δ(vαvβ)∣ ≥0.S=\sum_{(\alpha,\beta)\in\mathcal{S}\times\mathcal{S}}\sigma_{\alpha}\sigma_{\beta}\,\bigl|\Delta(v_{\alpha}v_{\beta})\bigr|\ \ge0.

Then

∣∑i∈[d](μ(ΞiΞi)−ν(ΞiΞi))∣≤14 S.(3.1)\Bigl|\sum_{i\in[d]}\Bigl(\mu\bigl(\Xi^{i}\Xi^{i}\bigr)-\nu\bigl(\Xi^{i}\Xi^{i}\bigr)\Bigr)\Bigr|\le\frac14\,S.\tag{3.1}

Indeed, by (3a) and additivity, the ii-th term is 00 if Si\mathcal{S}_{i} is empty and otherwise equals ∑Si×SiκακβΔ(vαvβ)\sum_{\mathcal{S}_{i}\times\mathcal{S}_{i}}\kappa_{\alpha}\kappa_{\beta}\Delta(v_{\alpha}v_{\beta}), whose modulus is at most ∑Si×Si14σασβ∣Δ(vαvβ)∣\sum_{\mathcal{S}_{i}\times\mathcal{S}_{i}}\frac14\sigma_{\alpha}\sigma_{\beta}|\Delta(v_{\alpha}v_{\beta})|. The modulus of the sum over i∈[d]i\in[d] is at most the sum of the moduli, and the sets Si×Si\mathcal{S}_{i}\times\mathcal{S}_{i} with Si\mathcal{S}_{i} nonempty are pairwise disjoint subsets of S×S\mathcal{S}\times\mathcal{S}; as all terms are nonnegative, splitting over the disjoint union and enlarging the index set give (3.1).

Step 4 (the short word may be placed on the left). Let P1\mathcal{P}_{1} be the set of (α,β)∈S×S(\alpha,\beta)\in\mathcal{S}\times\mathcal{S} with kα≤kβk_{\alpha}\le k_{\beta} (nonempty, as it contains the pairs (α,α)(\alpha,\alpha)), P2\mathcal{P}_{2} its complement in S×S\mathcal{S}\times\mathcal{S}, and S1S_{1}, S2S_{2} the sums defining SS restricted to P1\mathcal{P}_{1}, P2\mathcal{P}_{2} (S2=0S_{2}=0 if P2\mathcal{P}_{2} is empty), so S=S1+S2S=S_{1}+S_{2}. The map (α,β)↦(βˉ,αˉ)(\alpha,\beta)\mapsto(\bar\beta,\bar\alpha) is injective (it is its own inverse on S×S\mathcal{S}\times\mathcal{S}) and maps P2\mathcal{P}_{2} into P1\mathcal{P}_{1}, since kβˉ=kβ<kα=kαˉk_{\bar\beta}=k_{\beta}<k_{\alpha}=k_{\bar\alpha}. By Step 3 and (W2), vβˉvαˉ=vβ∗vα∗=(vαvβ)∗v_{\bar\beta}v_{\bar\alpha}=v_{\beta}^{*}v_{\alpha}^{*}=(v_{\alpha}v_{\beta})^{*}, so by Unitary Laws: Adjoints, the Bound One, and Reduction to Cyclically Reduced Words §adjoint for μ\mu and ν\nu and the rules for conjugation, Δ(vβˉvαˉ)=Δ(vαvβ)‾\Delta(v_{\bar\beta}v_{\bar\alpha})=\overline{\Delta(v_{\alpha}v_{\beta})}, which has the same modulus; also σβˉσαˉ=σασβ\sigma_{\bar\beta}\sigma_{\bar\alpha}=\sigma_{\alpha}\sigma_{\beta}. Reindexing S2S_{2} along this map and enlarging the index set to P1\mathcal{P}_{1} (nonnegative terms) gives S2≤S1S_{2}\le S_{1}, hence

S≤2S1.(4.1)S\le2S_{1}.\tag{4.1}

Step 5 (one term). For a slot α\alpha with w=wαw=w_{\alpha} and k=kαk=k_{\alpha} put

ϕα=c^w ∣x(w)∣(k+1)2,ψα=c^w ∣x(w)∣k,\phi_{\alpha}=\frac{\hat c_{w}\,|x(w)|}{(k+1)^{2}},\qquad\psi_{\alpha}=\frac{\hat c_{w}\,|x(w)|}{\sqrt{k}},

both nonnegative, with ϕα2=cw∣x(w)∣2(k+1)4\phi_{\alpha}^{2}=\frac{c_{w}|x(w)|^{2}}{(k+1)^{4}} and ψα2=cw∣x(w)∣2k\psi_{\alpha}^{2}=\frac{c_{w}|x(w)|^{2}}{k}. We show: for every (α,β)∈P1(\alpha,\beta)\in\mathcal{P}_{1},

σασβ ∣Δ(vαvβ)∣≤8 ϑ j(vα,vβ) ϕα ψβ h(ρ(vα,vβ)).(5.1)\sigma_{\alpha}\sigma_{\beta}\,\bigl|\Delta(v_{\alpha}v_{\beta})\bigr|\le8\,\vartheta^{\,j(v_{\alpha},v_{\beta})}\,\phi_{\alpha}\,\psi_{\beta}\,h\bigl(\rho(v_{\alpha},v_{\beta})\bigr).\tag{5.1}

Write w=wαw=w_{\alpha}, w′=wβw'=w_{\beta}, k=kα≤k′=kβk=k_{\alpha}\le k'=k_{\beta}, v=vαv=v_{\alpha}, v′=vβv'=v_{\beta}, j=j(v,v′)j=j(v,v') and z=ρ(v,v′)z=\rho(v,v'), a reduced word in U2nU_{2n} of length k+k′−2jk+k'-2j by (2b). By (2c) and (2.1), Δ(vv′)=Δ(uz)\Delta(vv')=\Delta(u_{z}). If uz=∅u_{z}=\varnothing, the left side of (5.1) is 00, and so is the right side. Otherwise put t=tzt=t_{z}, p=∣uz∣∈Np=|u_{z}|\in\mathbb{N}, u=uz∈Wd,p∘u=u_{z}\in W^{\circ}_{d,p} and N=j+tN=j+t; then ∣Δ(vv′)∣=∣x(u)∣|\Delta(vv')|=|x(u)|, h(z)=ϑtY(u)h(z)=\vartheta^{t}Y(u), and k+k′=∣z∣+2j=p+2Nk+k'=|z|+2j=p+2N. Since cw=c^wϑk(k+1)2c_{w}=\hat c_{w}\frac{\vartheta^{k}}{(k+1)^{2}}, cw′=c^w′ϑk′(k′+1)2c_{w'}=\hat c_{w'}\frac{\vartheta^{k'}}{(k'+1)^{2}} and ϑkϑk′=ϑk+k′=ϑ2Nϑp\vartheta^{k}\vartheta^{k'}=\vartheta^{k+k'}=\vartheta^{2N}\vartheta^{p}, and since ϑp∣x(u)∣=(p+1)2c^u∣x(u)∣=(p+1)2pY(u)\vartheta^{p}|x(u)|=(p+1)^{2}\hat c_{u}|x(u)|=\frac{(p+1)^{2}}{\sqrt{p}}Y(u),

σασβ∣x(u)∣=c^w∣x(w)∣  c^w′∣x(w′)∣  ϑ2N  (p+1)2(k+1)2(k′+1)2p  Y(u).\sigma_{\alpha}\sigma_{\beta}|x(u)|=\hat c_{w}|x(w)|\;\hat c_{w'}|x(w')|\;\vartheta^{2N}\;\frac{(p+1)^{2}}{(k+1)^{2}(k'+1)^{2}\sqrt{p}}\;Y(u).

Now p≤k+k′≤2k′p\le k+k'\le2k', so 0<p+1≤2(k′+1)0<p+1\le2(k'+1) and (p+1)2≤4(k′+1)2(p+1)^{2}\le4(k'+1)^{2}; hence the right side is at most 4 ϕα  c^w′∣x(w′)∣  ϑNY(u)⋅ϑNp4\,\phi_{\alpha}\;\hat c_{w'}|x(w')|\;\vartheta^{N}Y(u)\cdot\frac{\vartheta^{N}}{\sqrt{p}}. By (C5) (with N=j+tN=j+t), (ϑNk′)2=θNk′≤4p=(2p)2(\vartheta^{N}\sqrt{k'})^{2}=\theta^{N}k'\le4p=(2\sqrt{p})^{2}, so ϑNk′≤2p\vartheta^{N}\sqrt{k'}\le2\sqrt{p}, that is ϑNp≤2k′\frac{\vartheta^{N}}{\sqrt{p}}\le\frac{2}{\sqrt{k'}}. Therefore

σασβ∣Δ(vv′)∣≤8 ϕα c^w′∣x(w′)∣k′ ϑj ϑtY(u)=8 ϑjϕαψβ h(z),\sigma_{\alpha}\sigma_{\beta}|\Delta(vv')|\le8\,\phi_{\alpha}\,\frac{\hat c_{w'}|x(w')|}{\sqrt{k'}}\,\vartheta^{j}\,\vartheta^{t}Y(u)=8\,\vartheta^{j}\phi_{\alpha}\psi_{\beta}\,h(z),

which is (5.1).

Step 6 (grouping the slots by their words). For v∈W2dv\in W_{2d} let S(v)\mathcal{S}(v) be the set of slots α\alpha with vα=vv_{\alpha}=v, and put f(v)=∑α∈S(v)ϕαf(v)=\sum_{\alpha\in\mathcal{S}(v)}\phi_{\alpha} and ℓ(v)=∑α∈S(v)ψα\ell(v)=\sum_{\alpha\in\mathcal{S}(v)}\psi_{\alpha} (both 00 if S(v)\mathcal{S}(v) is empty); f,ℓ≥0f,\ell\ge0. Let V={vα:α∈S}⊆UnV=\{v_{\alpha}:\alpha\in\mathcal{S}\}\subseteq U_{n}, nonempty and finite; ff and ℓ\ell vanish outside VV, and the sets S(v)\mathcal{S}(v), v∈Vv\in V, are nonempty, pairwise disjoint, with union S\mathcal{S}. For k∈[n]k\in[n] let S(k)\mathcal{S}_{(k)} be the set of slots with kα=kk_{\alpha}=k; it is the set of dependent pairs (w,(m,s))(w,(m,s)) with w∈Wd,k∘w\in W^{\circ}_{d,k} and (m,s)∈[k]×{1,−1}(m,s)\in[k]\times\{1,-1\}, a set with 2k2k elements for each ww (by The Product of Two Sums over Finite Index Sets is a Sum over the Cartesian Product and claim 1 of Properties of a Sum over a Finite Index Set), so that for every map χ\chi on Wd,k∘W^{\circ}_{d,k}

∑α∈S(k)χ(wα)=∑w∈Wd,k∘2k χ(w).(6.1)\sum_{\alpha\in\mathcal{S}_{(k)}}\chi(w_{\alpha})=\sum_{w\in W^{\circ}_{d,k}}2k\,\chi(w).\tag{6.1}

(6a) If v∈Vv\in V has length kk, then ∑α∈S(v)1≤4k\sum_{\alpha\in\mathcal{S}(v)}1\le4k. Indeed, the map α=(w,m,s)↦(m,s,ε(wm))\alpha=(w,m,s)\mapsto(m,s,\varepsilon(w_{m})) from S(v)\mathcal{S}(v) to [k]×{1,−1}×{1,−1}[k]\times\{1,-1\}\times\{1,-1\} (note kα=∣v∣=kk_{\alpha}=|v|=k) is injective: given (m,s,e)(m,s,e), the word rm(w)r_{m}(w) equals vv if s=1s=1 and v∗v^{*} if s=−1s=-1 (by (W2)), and by (W4) ww is determined by rm(w)r_{m}(w), mm and e=ε(wm)e=\varepsilon(w_{m}). Reindexing onto the image and enlarging to the product set, which has 4k4k elements, gives the claim.

(6b) For k∈[n]k\in[n], Φk:=∑v∈[2d]kf(v)2≤8kXk\Phi_{k}:=\sqrt{\sum_{v\in[2d]^{k}}f(v)^{2}}\le\frac{\sqrt{8}}{k}\sqrt{X_{k}}. Indeed, for v∈Vv\in V of length kk, (C1) and (6a) give f(v)2≤4k∑α∈S(v)ϕα2=4k(k+1)4∑α∈S(v)cwα∣x(wα)∣2f(v)^{2}\le4k\sum_{\alpha\in\mathcal{S}(v)}\phi_{\alpha}^{2}=\frac{4k}{(k+1)^{4}}\sum_{\alpha\in\mathcal{S}(v)}c_{w_{\alpha}}|x(w_{\alpha})|^{2}, and f(v)=0f(v)=0 for v∈[2d]k∖Vv\in[2d]^{k}\setminus V. The sets S(v)\mathcal{S}(v), v∈V∩[2d]kv\in V\cap[2d]^{k}, are pairwise disjoint with union S(k)\mathcal{S}_{(k)} (as ∣vα∣=kα|v_{\alpha}|=k_{\alpha}). Summing and using (6.1),

∑v∈[2d]kf(v)2≤4k(k+1)4∑α∈S(k)cwα∣x(wα)∣2=8k2(k+1)4Xk≤8k2Xk,\sum_{v\in[2d]^{k}}f(v)^{2}\le\frac{4k}{(k+1)^{4}}\sum_{\alpha\in\mathcal{S}_{(k)}}c_{w_{\alpha}}|x(w_{\alpha})|^{2}=\frac{8k^{2}}{(k+1)^{4}}X_{k}\le\frac{8}{k^{2}}X_{k},

the last step because k4≤(k+1)4k^{4}\le(k+1)^{4}. Taking square roots gives (6b).

(6c) Λ:=∑z∈U2nℓ(z)2≤8 ∥x∥d,1\Lambda:=\sqrt{\sum_{z\in U_{2n}}\ell(z)^{2}}\le\sqrt{8}\,\lVert x\rVert_{d,1}. Indeed, for v∈Vv\in V of length kk, (C1) and (6a) give ℓ(v)2≤4k∑α∈S(v)ψα2=4∑α∈S(v)cwα∣x(wα)∣2\ell(v)^{2}\le4k\sum_{\alpha\in\mathcal{S}(v)}\psi_{\alpha}^{2}=4\sum_{\alpha\in\mathcal{S}(v)}c_{w_{\alpha}}|x(w_{\alpha})|^{2}, and ℓ\ell vanishes on U2n∖VU_{2n}\setminus V. Since the S(v)\mathcal{S}(v), v∈Vv\in V, partition S\mathcal{S}, and S\mathcal{S} is the disjoint union of the S(k)\mathcal{S}_{(k)}, k∈[n]k\in[n], (6.1) and (0.1) give

∑z∈U2nℓ(z)2≤4∑α∈Scwα∣x(wα)∣2=4∑k=1n2k Xk≤8 ∥x∥d,12.\sum_{z\in U_{2n}}\ell(z)^{2}\le4\sum_{\alpha\in\mathcal{S}}c_{w_{\alpha}}|x(w_{\alpha})|^{2}=4\sum_{k=1}^{n}2k\,X_{k}\le8\,\lVert x\rVert_{d,1}^{2}.

(6d) Regrouping. For every map Ψ:V×V→R\Psi:V\times V\to\mathbb{R},

∑(α,β)∈S×SΨ(vα,vβ) ϕαψβ=∑(v,v′)∈V×VΨ(v,v′) f(v) ℓ(v′),\sum_{(\alpha,\beta)\in\mathcal{S}\times\mathcal{S}}\Psi(v_{\alpha},v_{\beta})\,\phi_{\alpha}\psi_{\beta}=\sum_{(v,v')\in V\times V}\Psi(v,v')\,f(v)\,\ell(v'),

because S×S\mathcal{S}\times\mathcal{S} is the disjoint union of the sets S(v)×S(v′)\mathcal{S}(v)\times\mathcal{S}(v'), (v,v′)∈V×V(v,v')\in V\times V, on each of which Ψ(vα,vβ)=Ψ(v,v′)\Psi(v_{\alpha},v_{\beta})=\Psi(v,v'), and ∑S(v)×S(v′)ϕαψβ=f(v)ℓ(v′)\sum_{\mathcal{S}(v)\times\mathcal{S}(v')}\phi_{\alpha}\psi_{\beta}=f(v)\ell(v') by The Product of Two Sums over Finite Index Sets is a Sum over the Cartesian Product.

Step 7 (the Cauchy--Schwarz argument over cancellations). Put Ω=∑z∈U2nh(z)2\Omega=\sqrt{\sum_{z\in U_{2n}}h(z)^{2}}. For k∈[n]k\in[n] and j∈{0,1,…,k}j\in\{0,1,\dots,k\} let Qk,jQ_{k,j} be the set of (v,v′)∈V×V(v,v')\in V\times V with ∣v∣=k|v|=k and j(v,v′)=jj(v,v')=j. We show

∑(v,v′)∈Qk,jf(v) ℓ(v′) h(ρ(v,v′))≤Φk Λ Ω(7.1)\sum_{(v,v')\in Q_{k,j}}f(v)\,\ell(v')\,h\bigl(\rho(v,v')\bigr)\le\Phi_{k}\,\Lambda\,\Omega\tag{7.1}

(the left side being 00 if Qk,jQ_{k,j} is empty). Put A=[2d]k−j\mathcal{A}=[2d]^{k-j}, C=[2d]j\mathcal{C}=[2d]^{j} and B=Un\mathcal{B}=U_{n}. By Step 2, each (v,v′)∈Qk,j(v,v')\in Q_{k,j} determines words a∈Aa\in\mathcal{A}, c∈Cc\in\mathcal{C}, b∈Bb\in\mathcal{B} (indeed ∣b∣=∣v′∣−j≤n|b|=|v'|-j\le n) with v=acv=ac, v′=c∗bv'=c^{*}b and ρ(v,v′)=ab\rho(v,v')=ab, and (v,v′)↦(a,c,b)(v,v')\mapsto(a,c,b) is injective since (v,v′)=(ac,c∗b)(v,v')=(ac,c^{*}b). Reindexing onto the image and enlarging to C×(A×B)\mathcal{C}\times(\mathcal{A}\times\mathcal{B}) (nonnegative terms; iterated sums as sums over pairs), the left side of (7.1) is at most

∑c∈C ∑(a,b)∈A×Bf(ac) ℓ(c∗b) h(ab).\sum_{c\in\mathcal{C}}\ \sum_{(a,b)\in\mathcal{A}\times\mathcal{B}}f(ac)\,\ell(c^{*}b)\,h(ab).

Fix c∈Cc\in\mathcal{C} and put η(c)=∑a∈Af(ac)2\eta(c)=\sqrt{\sum_{a\in\mathcal{A}}f(ac)^{2}} and ζ(c)=∑b∈Bℓ(c∗b)2\zeta(c)=\sqrt{\sum_{b\in\mathcal{B}}\ell(c^{*}b)^{2}}. By (C1) on A×B\mathcal{A}\times\mathcal{B} and The Product of Two Sums over Finite Index Sets is a Sum over the Cartesian Product,

∑(a,b)f(ac)ℓ(c∗b)h(ab)≤∑(a,b)f(ac)2ℓ(c∗b)2  ∑(a,b)h(ab)2=η(c) ζ(c) ∑(a,b)h(ab)2.\sum_{(a,b)}f(ac)\ell(c^{*}b)h(ab)\le\sqrt{\textstyle\sum_{(a,b)}f(ac)^{2}\ell(c^{*}b)^{2}}\;\sqrt{\textstyle\sum_{(a,b)}h(ab)^{2}}=\eta(c)\,\zeta(c)\,\sqrt{\textstyle\sum_{(a,b)}h(ab)^{2}}.

The map (a,b)↦ab(a,b)\mapsto ab is injective on A×B\mathcal{A}\times\mathcal{B} (the length of aa being fixed), with values in U2nU_{2n} since ∣ab∣≤(k−j)+n≤2n|ab|\le(k-j)+n\le2n; so ∑(a,b)h(ab)2≤Ω2\sum_{(a,b)}h(ab)^{2}\le\Omega^{2} by reindexing and enlarging the index set, and the inner sum is at most η(c)ζ(c)Ω\eta(c)\zeta(c)\Omega. By (C1) on C\mathcal{C}, ∑cη(c)ζ(c)≤∑cη(c)2∑cζ(c)2\sum_{c}\eta(c)\zeta(c)\le\sqrt{\sum_{c}\eta(c)^{2}}\sqrt{\sum_{c}\zeta(c)^{2}}. Here ∑cη(c)2=∑(a,c)∈A×Cf(ac)2=∑v∈[2d]kf(v)2=Φk2\sum_{c}\eta(c)^{2}=\sum_{(a,c)\in\mathcal{A}\times\mathcal{C}}f(ac)^{2}=\sum_{v\in[2d]^{k}}f(v)^{2}=\Phi_{k}^{2}, because (a,c)↦ac(a,c)\mapsto ac is a bijection from A×C\mathcal{A}\times\mathcal{C} onto [2d]k[2d]^{k} (Conventions); and ∑cζ(c)2=∑(c,b)∈C×Bℓ(c∗b)2≤Λ2\sum_{c}\zeta(c)^{2}=\sum_{(c,b)\in\mathcal{C}\times\mathcal{B}}\ell(c^{*}b)^{2}\le\Lambda^{2}, because (c,b)↦c∗b(c,b)\mapsto c^{*}b is injective on C×B\mathcal{C}\times\mathcal{B} (the first jj letters of c∗bc^{*}b form c∗c^{*}, which determines c=(c∗)∗c=(c^{*})^{*} by (W2), and the rest is bb) with values in U2nU_{2n}, as ∣c∗b∣≤j+n≤2n|c^{*}b|\le j+n\le2n. Combining the three estimates gives (7.1).

Step 8 (the norm of hh). We show Ω2≤2 ∥x∥d,12\Omega^{2}\le2\,\lVert x\rVert_{d,1}^{2}. Let ZZ be the set of reduced z∈U2nz\in U_{2n} with uz≠∅u_{z}\ne\varnothing; hh vanishes on U2n∖ZU_{2n}\setminus Z, so Ω2=∑z∈Zh(z)2\Omega^{2}=\sum_{z\in Z}h(z)^{2}, which is 00 if ZZ is empty. For z∈Zz\in Z, h(z)2=θtzY(uz)2h(z)^{2}=\theta^{t_{z}}Y(u_{z})^{2}, uzu_{z} lies in the finite set U=⋃p∈[2n]Wd,p∘\mathcal{U}=\bigcup_{p\in[2n]}W^{\circ}_{d,p} (as 1≤∣uz∣≤∣z∣≤2n1\le|u_{z}|\le|z|\le2n), and tz∈{0,1,…,n}t_{z}\in\{0,1,\dots,n\} (as 2tz≤∣z∣≤2n2t_{z}\le|z|\le2n). For t∈{0,…,n}t\in\{0,\dots,n\} and u∈Uu\in\mathcal{U} let Zt,uZ_{t,u} be the set of z∈Zz\in Z with tz=tt_{z}=t and uz=uu_{z}=u; these sets are pairwise disjoint with union ZZ. On Zt,uZ_{t,u} the map z↦qz∈[2d]tz\mapsto q_{z}\in[2d]^{t} is injective, since z=qz u qz∗z=q_{z}\,u\,q_{z}^{*}; hence ∑z∈Zt,u1≤1\sum_{z\in Z_{t,u}}1\le1 if t=0t=0, and ∑z∈Zt,u1≤(2d)t\sum_{z\in Z_{t,u}}1\le(2d)^{t} if t≥1t\ge1 and Zt,uZ_{t,u} is nonempty, by Counting Cyclically Reduced Words: Finiteness and the Bound (2d)^k §count applied to the image with aa constantly 11 and M=1M=1. Since θt(2d)t=(2d θ)t\theta^{t}(2d)^{t}=(2d\,\theta)^{t}, we get ∑z∈Zt,uh(z)2≤(2d θ)t Y(u)2\sum_{z\in Z_{t,u}}h(z)^{2}\le(2d\,\theta)^{t}\,Y(u)^{2} in all cases, and summing over (t,u)(t,u) with (C4),

Ω2≤∑u∈UY(u)2∑t=0n(2d θ)t≤2∑u∈UY(u)2=2∑p=12n ∑u∈Wd,p∘p cu∣x(u)∣2=2∑p=12np Xp≤2 ∥x∥d,12,\Omega^{2}\le\sum_{u\in\mathcal{U}}Y(u)^{2}\sum_{t=0}^{n}(2d\,\theta)^{t}\le2\sum_{u\in\mathcal{U}}Y(u)^{2}=2\sum_{p=1}^{2n}\ \sum_{u\in W^{\circ}_{d,p}}p\,c_{u}|x(u)|^{2}=2\sum_{p=1}^{2n}p\,X_{p}\le2\,\lVert x\rVert_{d,1}^{2},

using that U\mathcal{U} is the disjoint union of the Wd,p∘W^{\circ}_{d,p}, p∈[2n]p\in[2n], and (0.1). Hence Ω≤2 ∥x∥d,1\Omega\le\sqrt{2}\,\lVert x\rVert_{d,1}.

Step 9 (conclusion). By (5.1), enlarging the index set from P1\mathcal{P}_{1} to S×S\mathcal{S}\times\mathcal{S} (the right sides of (5.1) being nonnegative), and (6d) with Ψ(v,v′)=8 ϑ j(v,v′)h(ρ(v,v′))\Psi(v,v')=8\,\vartheta^{\,j(v,v')}h(\rho(v,v')),

S1≤8∑(v,v′)∈V×Vϑ j(v,v′)f(v) ℓ(v′) h(ρ(v,v′)).S_{1}\le8\sum_{(v,v')\in V\times V}\vartheta^{\,j(v,v')}f(v)\,\ell(v')\,h\bigl(\rho(v,v')\bigr).

Every (v,v′)∈V×V(v,v')\in V\times V has ∣v∣=k∈[n]|v|=k\in[n] and j(v,v′)∈{0,…,min⁡(k,∣v′∣)}⊆{0,…,k}j(v,v')\in\{0,\dots,\min(k,|v'|)\}\subseteq\{0,\dots,k\}, so V×VV\times V is the disjoint union of the sets Qk,jQ_{k,j}, k∈[n]k\in[n], j∈{0,…,k}j\in\{0,\dots,k\}, and ϑ j(v,v′)=ϑj\vartheta^{\,j(v,v')}=\vartheta^{j} on Qk,jQ_{k,j}. Splitting over the nonempty Qk,jQ_{k,j}, applying (7.1), adding the nonnegative bounds for the empty ones, and using (C4),

S1≤8 Λ Ω∑k=1nΦk∑j=0kϑj≤16 Λ Ω∑k=1nΦk.S_{1}\le8\,\Lambda\,\Omega\sum_{k=1}^{n}\Phi_{k}\sum_{j=0}^{k}\vartheta^{j}\le16\,\Lambda\,\Omega\sum_{k=1}^{n}\Phi_{k}.

By (6b), (C1) on [n][n], Order Reversal under Reciprocals, and Summability of the Reciprocals of the Squares §partial (which gives ∑k=1n1k2≤2−1n≤2\sum_{k=1}^{n}\frac{1}{k^{2}}\le2-\frac1n\le2) and (0.1),

∑k=1nΦk≤8∑k=1n1kXk≤8 ∑k=1n1k2 ∑k=1nXk≤8 2 ∥x∥d=4 ∥x∥d.\sum_{k=1}^{n}\Phi_{k}\le\sqrt{8}\sum_{k=1}^{n}\frac1k\sqrt{X_{k}}\le\sqrt{8}\,\sqrt{\textstyle\sum_{k=1}^{n}\frac{1}{k^{2}}}\,\sqrt{\textstyle\sum_{k=1}^{n}X_{k}}\le\sqrt{8}\,\sqrt{2}\,\lVert x\rVert_{d}=4\,\lVert x\rVert_{d}.

With (6c) and Step 8, Λ Ω≤8 2 ∥x∥d,12=4 ∥x∥d,12\Lambda\,\Omega\le\sqrt{8}\,\sqrt{2}\,\lVert x\rVert_{d,1}^{2}=4\,\lVert x\rVert_{d,1}^{2}, so S1≤16⋅4⋅4 ∥x∥d∥x∥d,12=256 ∥x∥d∥x∥d,12S_{1}\le16\cdot4\cdot4\,\lVert x\rVert_{d}\lVert x\rVert_{d,1}^{2}=256\,\lVert x\rVert_{d}\lVert x\rVert_{d,1}^{2}. By (3.1) and (4.1),

∣∑i∈[d](μ(Ξx,niΞx,ni)−ν(Ξx,niΞx,ni))∣≤14 S≤12 S1≤128 ∥x∥d ∥x∥d,12.\Bigl|\sum_{i\in[d]}\Bigl(\mu\bigl(\Xi^{i}_{x,n}\Xi^{i}_{x,n}\bigr)-\nu\bigl(\Xi^{i}_{x,n}\Xi^{i}_{x,n}\bigr)\Bigr)\Bigr|\le\frac14\,S\le\frac12\,S_{1}\le128\,\lVert x\rVert_{d}\,\lVert x\rVert_{d,1}^{2}.

As μ,ν∈Ld\mu,\nu\in\mathcal{L}_{d} and n∈Nn\in\mathbb{N} were arbitrary, K=128K=128 is a trilinear constant.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…