TheoremBase

The Free Unitary Heat Generator on Unitary Laws

Defines the free unitary heat generator on unitary laws: a diagonal term -|w|/2 lambda(w) plus signed products of lambda over pairs of letters with the same generator.

Statement

Let N\mathbb{N} be the set of natural numbers with its addition and order, carried into the real numbers R\mathbb{R} by the natural-number image, and for k∈Nk\in\mathbb{N} let [k][k] be the initial segment determined by kk. Let d∈Nd\in\mathbb{N}, let W2dW_{2d}, the generators g(l)g(l) and signs ε(l)\varepsilon(l) of letters be as in Words in Unitary Letters: Generators, Signs, Inverse Letters, Lengths and Adjoint Words, with concatenation written (u,v)↦uv(u,v)\mapsto uv, let Ld\mathcal{L}_{d} be the set of unitary laws of dd-tuples, and let C⊇R\mathbb{C}\supseteq\mathbb{R} be the field of complex numbers. Finite sums are those of Sum over a Finite Index Set.

For natural numbers a≤ba\le b, b−a+1b-a+1 denotes the natural number mm with a+m=b+1a+m=b+1; for a natural number qq with 1<q1<q, q−1q-1 denotes the natural number mm with m+1=qm+1=q. Both exist and are unique by claim 7 of Properties of the Order on the Natural Numbers and claim 4 of Arithmetic of Addition on the Natural Numbers, because a<b+1a<b+1 by claims 5 and 1 of Properties of the Order on the Natural Numbers and claim 1 of Arithmetic of Addition on the Natural Numbers.

Let w∈W2dw\in W_{2d} be a word of length k∈Nk\in\mathbb{N}. For a,b∈[k]a,b\in[k] with a≤ba\le b, w[a,b]w_{[a,b]} denotes the word of length b−a+1b-a+1 whose ii-th letter is wa+i−1w_{a+i-1}, for i∈[b−a+1]i\in[b-a+1]; for a,b∈[k]a,b\in[k] with b<ab<a we put w[a,b]=∅w_{[a,b]}=\varnothing.

1. (Pairs, start and end positions) P(w)P(w) is the set of pairs (p,q)∈[k]×[k](p,q)\in[k]\times[k] with p<qp<q and g(wp)=g(wq)g(w_{p})=g(w_{q}); it is finite by claim 3 of Basic Properties of Finite Sets, as a subset of the set [k]×[k][k]\times[k], which is finite by claim 1 of Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets, [k][k] being finite by claim 1 of Basic Properties of Finite Sets. For p∈[k]p\in[k] put σp=p+1\sigma_{p}=p+1 if ε(wp)=1\varepsilon(w_{p})=1 and σp=p\sigma_{p}=p if ε(wp)=−1\varepsilon(w_{p})=-1; for q∈[k]q\in[k] with 1<q1<q put τq=q\tau_{q}=q if ε(wq)=1\varepsilon(w_{q})=1 and τq=q−1\tau_{q}=q-1 if ε(wq)=−1\varepsilon(w_{q})=-1. For (p,q)∈P(w)(p,q)\in P(w) one has 1≤p<q1\le p<q, so 1<q1<q and τq\tau_{q} is defined, and

σp≤p+1≤q≤τq+1,τq≤q≤k,\sigma_{p}\le p+1\le q\le\tau_{q}+1,\qquad\tau_{q}\le q\le k,

so σp,τq∈[k]\sigma_{p},\tau_{q}\in[k].

2. (The two pieces of a pair) For (p,q)∈P(w)(p,q)\in P(w) the inner piece is ypq(w)=w[σp,τq]y_{pq}(w)=w_{[\sigma_{p},\tau_{q}]}, and the outer piece is the concatenation

xpq(w)=w[τq+1,k]  w[1,σp−1],x_{pq}(w)=w_{[\tau_{q}+1,k]}\;w_{[1,\sigma_{p}-1]},

where the first factor is read as ∅\varnothing if τq=k\tau_{q}=k and the second as ∅\varnothing if σp=1\sigma_{p}=1; otherwise τq<k\tau_{q}<k, so that τq+1∈[k]\tau_{q}+1\in[k], and 1<σp1<\sigma_{p}, so that σp−1∈[k]\sigma_{p}-1\in[k] is defined as above.

3. (The free unitary heat generator) For λ∈Ld\lambda\in\mathcal{L}_{d}, Θλ:W2d→C\Theta\lambda:W_{2d}\to\mathbb{C} is the map with Θλ(∅)=0\Theta\lambda(\varnothing)=0 and, for every word ww of length k∈Nk\in\mathbb{N},

Θλ(w)=−k2 λ(w)−∑(p,q)∈P(w)ε(wp) ε(wq)  λ(ypq(w)) λ(xpq(w)),\Theta\lambda(w)=-\frac{k}{2}\,\lambda(w)-\sum_{(p,q)\in P(w)}\varepsilon(w_{p})\,\varepsilon(w_{q})\;\lambda\bigl(y_{pq}(w)\bigr)\,\lambda\bigl(x_{pq}(w)\bigr),

where the sum is read as 00 if P(w)P(w) is empty. The map λ↦Θλ\lambda\mapsto\Theta\lambda is the free unitary heat generator.

4. (Restriction to cyclically reduced words) For λ∈Ld\lambda\in\mathcal{L}_{d}, Θ^λ:Wd∘→C\widehat{\Theta}\lambda:W^{\circ}_{d}\to\mathbb{C} is the restriction of Θλ\Theta\lambda to the set Wd∘W^{\circ}_{d} of cyclically reduced words.

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…