Weingarten function

In mathematics, Weingarten functions are rational functions indexed by partitions of integers that can be used to calculate integrals of products of matrix coefficients over classical groups. They were first studied by Weingarten (1978) who found their asymptotic behavior, and named by Collins (2003), who evaluated them explicitly for the unitary group.

Unitary groups

Weingarten functions are used for evaluating integrals over the unitary group U_d of products of matrix coefficients.

Consider in general an integral of the form $\int _{U_{d}}U_{i_{1}j_{1}}\cdots U_{i_{n}j_{n}}U_{i_{1}^{\prime }j_{1}^{\prime }}^{*}\cdots U_{i_{n'}^{\prime }j_{n'}^{\prime }}^{*}dU,$ It can be shown that the integral would be zero, unless $n=n'$ . Thus, consider only integrals of the form $\int _{U_{d}}U_{i_{1}j_{1}}\cdots U_{i_{n}j_{n}}U_{i_{1}^{\prime }j_{1}^{\prime }}^{*}\cdots U_{i_{n}^{\prime }j_{n}^{\prime }}^{*}dU,$ where $*$ denotes complex conjugation. Note that $U_{ji}^{*}=(U^{\dagger })_{ij}$ where $U^{\dagger }$ is the conjugate transpose of $U$ , so one can interpret the above expression as being for the $i_{1}j_{1}\ldots i_{n}j_{n}j'_{1}i'_{1}\ldots j'_{n}i'_{n}$ matrix element of $U\otimes \cdots \otimes U\otimes U^{\dagger }\otimes \cdots \otimes U^{\dagger }$ .

This integral is equal to $\sum _{\sigma ,\tau \in S_{n}}\delta _{i_{1}i_{\sigma (1)}^{\prime }}\cdots \delta _{i_{n}i_{\sigma (n)}^{\prime }}\delta _{j_{1}j_{\tau (1)}^{\prime }}\cdots \delta _{j_{n}j_{\tau (n)}^{\prime }}W_{\sigma ,\tau }(d)$ where $W_{\sigma ,\tau }(d)=\operatorname {Wg} (\sigma \tau ^{-1},d)$ , and $\operatorname {Wg}$ is the Weingarten function, given by $\operatorname {Wg} (\sigma ,d)={\frac {1}{n!^{2}}}\sum _{\lambda }{\frac {\chi ^{\lambda }(1)^{2}\chi ^{\lambda }(\sigma )}{s_{\lambda ,d}(1)}}$ where the sum is over all partitions λ of n (Collins 2003). Here χ^λ is the character of S_n corresponding to the partition λ and s is the Schur polynomial of λ, so that s_λ,d(1) is the dimension of the representation of U_d corresponding to λ.

The Weingarten functions are rational functions in d. They can have poles for small values of d, which cancel out in the formula above. There is an alternative inequivalent definition of Weingarten functions, where one only sums over partitions with at most d parts. This is no longer a rational function of d, but is finite for all positive integers d. The two sorts of Weingarten functions coincide for d larger than n, and either can be used in the formula for the integral.

The integrals are called the link integrals in $U(N)$ lattice gauge theory. See for a graphical method for evaluating these integrals, inspired by quantum string diagrams.

Examples of Weingarten functions

The first few Weingarten functions ${\begin{aligned}\operatorname {Wg} (,d)&=1\\\operatorname {Wg} (1,d)&={\frac {1}{d}}\\\operatorname {Wg} (2,d)&={\frac {-1}{d(d^{2}-1)}}\\\operatorname {Wg} (1^{2},d)&={\frac {1}{d^{2}-1}}\\\operatorname {Wg} (3,d)&={\frac {2}{d(d^{2}-1)(d^{2}-4)}}\\\operatorname {Wg} (21,d)&={\frac {-1}{(d^{2}-1)(d^{2}-4)}}\\\operatorname {Wg} (1^{3},d)&={\frac {d^{2}-2}{d(d^{2}-1)(d^{2}-4)}}\\\operatorname {Wg} (4,d)&={\frac {-5}{d(d^{2}-1)(d^{2}-4)(d^{2}-9)}}\\\operatorname {Wg} (31,d)&={\frac {2d^{2}-3}{d^{2}(d^{2}-1)(d^{2}-4)(d^{2}-9)}}\\\operatorname {Wg} (2^{2},d)&={\frac {d^{2}+6}{d^{2}(d^{2}-1)(d^{2}-4)(d^{2}-9)}}\\\operatorname {Wg} (21^{2},d)&={\frac {-1}{d(d^{2}-1)(d^{2}-9)}}\\\operatorname {Wg} (1^{4},d)&={\frac {d^{4}-8d^{2}+6}{d^{2}(d^{2}-1)(d^{2}-4)(d^{2}-9)}}\end{aligned}}$ where permutations σ are denoted by their cycle shapes. For example, in $\operatorname {Wg} (,d)=1$ , the permutation is the trivial permutation on 0 elements. In $\operatorname {Wg} (21^{2},d)={\frac {-1}{d(d^{2}-1)(d^{2}-9)}}$ , the permutation is the permutation on 4 elements that preserves 2 elements, and exchanges 2 elements.

There exist computer algebra programs to produce these expressions.

Examples of link integrals

${\begin{aligned}\int _{U_{d}}dUU_{ij}{\bar {U}}_{k\ell }&=\delta _{ik}\delta _{j\ell }\operatorname {Wg} (1,d)={\frac {\delta _{ik}\delta _{j\ell }}{d}}\\\int _{U_{d}}dUU_{ij}U_{k\ell }{\bar {U}}_{mn}{\bar {U}}_{pq}&=(\delta _{im}\delta _{jn}\delta _{kp}\delta _{\ell q}+\delta _{ip}\delta _{jq}\delta _{km}\delta _{\ell n})\operatorname {Wg} (1^{2},d)+(\delta _{im}\delta _{jq}\delta _{kp}\delta _{\ell n}+\delta _{ip}\delta _{jn}\delta _{km}\delta _{\ell q})\operatorname {Wg} (2,d)\\\int _{U_{d}}dU\;{\overline {U_{11}U_{22}U_{33}}}U_{12}U_{23}U_{31}&=\operatorname {Wg} (3,d)={\frac {2}{d(d^{2}-1)(d^{2}-4)}}\end{aligned}}$

Asymptotics

Given a permutation $\sigma$ , there is a trivial part and a nontrivial part. The trivial part fixes elements, and the nontrivial part permutes the elements in cycles. This can be written out in the cycle notation for permutations. For example, the following permutation $(123)(45)(6)(7)(8)$ has the nontrivial part $(123)(45)$ .

Given a fixed permutation $\sigma$ on $n$ elements, as the size of the unitary group grows to $d\to \infty$ , we have the asymptotic formula $\operatorname {Wg} (\sigma ,d)=d^{-n-|\sigma |}\left[\prod _{C_{i}\in \sigma }(-1)^{|C_{i}|-1}c_{|C_{i}|-1}+O(d^{-2})\right]$ where $C_{1},C_{2},\dots$ are the cycles of $\sigma$ , $|C_{i}|$ is the length of cycle $C_{i}$ , $c_{n}:={\frac {(2n)!}{n!(n+1)!}}$ is a Catalan number, and $|\sigma |$ is the smallest number of transpositions (pairwise exchange) that $\sigma$ is composed of. This formula can be used to prove that the algebra of the gaussian unitary ensemble converges to the free probability algebra.

Higher order expansions exist, of the form $d^{-n-|\sigma |}(a_{0}+a_{2}d^{-2}+a_{4}d^{-4}+\cdots )$ where $a_{0}$ is given above, and $a_{2},a_{4},\dots$ are real numbers that depend on $\sigma$ but not $d$ . The full expansion is: $W_{\rho \sigma }(d)={\frac {(-1)^{\left|\rho ^{-1}\sigma \right|}}{d^{n+\left|\rho ^{-1}\sigma \right|}}}\sum _{k=0}^{\infty }{\frac {{\vec {W}}_{k}(\rho ,\sigma )}{d^{2k}}},$ where ${\vec {W}}_{k}(\rho ,\sigma )$ is the number of weakly monotone walks on $S_{n}$ from $\rho$ to $\sigma$ of length $\left|\rho ^{-1}\sigma \right|+2k$ . To define weakly monotone walk, we construct the Cayley graph of $S_{n}$ . Each directed edge is obtained by multiplying on the right by a transposition. Now, a weakly monotone walk on the Cayley graph is a path $(i_{1}j_{1}),(i_{2}j_{2}),\dots$ such that $j_{1}\leq j_{2}\leq \cdots$ .

There exists a diagrammatic method to systematically calculate the integrals over the unitary group as a power series in 1/d.

Example asymptotics

Let $\sigma =(123)(45)(6)(7)(8)$ . It acts on $n=8$ elements. It decomposes into cycles with lengths $|C_{1}|=3$ , $|C_{2}|=2$ , $|C_{3}|=|C_{4}|=|C_{5}|=1$ .

Applying $|\sigma |=n-k$ with $k=5$ cycles gives $|\sigma |=3$ .

The Catalan factors are $c_{2}=2$ for the 3-cycle, $c_{1}=1$ for the 2-cycle, and $c_{0}=1$ for each 1-cycle, so the product in the leading term equals $(-1)^{2}c_{2}\cdot (-1)^{1}c_{1}\cdot 1^{3}=-2$ .

Therefore the leading asymptotic term is $\operatorname {Wg} (\sigma ,d)=-2d^{-11}+O(d^{-13})$ .

Notice that in the above calculation, the trivial part $|C_{3}|=|C_{4}|=|C_{5}|=1$ did not matter at all. This is because $(-1)^{|C_{i}|-1}c_{|C_{i}|-1}=1$ in that case. Thus in general, the asymptotic expression depends only on the nontrivial part of the permutation.

Orthogonal and symplectic groups

For orthogonal and symplectic groups the Weingarten functions were evaluated by Collins & Śniady (2006). Their theory is similar to the case of the unitary group. They are parameterized by partitions such that all parts have even size.

References

1 2 3 4 Collins, Benoit; Matsumoto, Sho; Novak, Jonathan (2022-05-01). "The Weingarten Calculus" (PDF). Notices of the American Mathematical Society. 69 (5): 1. doi:10.1090/noti2474. ISSN 0002-9920.
↑ Collins, Benoît; Nechita, Ion (2010-07-01). "Random Quantum Channels I: Graphical Calculus and the Bell State Phenomenon". Communications in Mathematical Physics. 297 (2): 345–370. arXiv:0905.2313. Bibcode:2010CMaPh.297..345C. doi:10.1007/s00220-010-1012-0. ISSN 1432-0916.
↑ Ion Nechita, "Weingarten calculus and applications to Quantum Information Theory" – Annual meeting of the SFB TRR 195 Tübingen – September 2018
↑ Z. Puchała and J.A. Miszczak, Symbolic integration with respect to the Haar measure on the unitary group in Mathematica., arXiv:1109.4244 (2011).
↑ M. Fukuda, R. König, and I. Nechita, RTNI - A symbolic integrator for Haar-random tensor networks., arXiv:1902.08539 (2019).
↑ Brouwer, P. W.; Beenakker, C. W. J. (1996). "Diagrammatic method of integration over the unitary group, with applications to quantum transport in mesoscopic systems". Journal of Mathematical Physics. 37 (10): 4904–4934. arXiv:cond-mat/9604059. Bibcode:1996JMP....37.4904B. doi:10.1063/1.531667.

[:0-1] 1 2 3 4 Collins, Benoit; Matsumoto, Sho; Novak, Jonathan (2022-05-01). "The Weingarten Calculus" (PDF). Notices of the American Mathematical Society. 69 (5): 1. doi:10.1090/noti2474. ISSN 0002-9920.

[2] Collins, Benoît; Nechita, Ion (2010-07-01). "Random Quantum Channels I: Graphical Calculus and the Bell State Phenomenon". Communications in Mathematical Physics. 297 (2): 345–370. arXiv:0905.2313. Bibcode:2010CMaPh.297..345C. doi:10.1007/s00220-010-1012-0. ISSN 1432-0916.

[3] Ion Nechita, "Weingarten calculus and applications to Quantum Information Theory" – Annual meeting of the SFB TRR 195 Tübingen – September 2018

[4] Z. Puchała and J.A. Miszczak, Symbolic integration with respect to the Haar measure on the unitary group in Mathematica., arXiv:1109.4244 (2011).

[5] M. Fukuda, R. König, and I. Nechita, RTNI - A symbolic integrator for Haar-random tensor networks., arXiv:1902.08539 (2019).

[6] Brouwer, P. W.; Beenakker, C. W. J. (1996). "Diagrammatic method of integration over the unitary group, with applications to quantum transport in mesoscopic systems". Journal of Mathematical Physics. 37 (10): 4904–4934. arXiv:cond-mat/9604059. Bibcode:1996JMP....37.4904B. doi:10.1063/1.531667.

v t e Random matrix theory
Concepts	Ensemble Spectrum Universality Resolvent Level repulsion Integrability Free probability Noncrossing partition Coulomb gas Dyson Brownian motion Riemann–Hilbert problem Determinantal point process
Ensembles	Gaussian ensemble Wishart ensemble Jacobi ensemble Ginibre ensemble Beta ensemble Circular ensemble Deformed ensemble Matrix t-distribution Random band ensemble Heavy-tailed
Laws	Wigner semicircle distribution Marchenko–Pastur law Circular law Tracy–Widom distribution BBP transition Wigner surmise
Techniques	Stieltjes transformation Isserlis's theorem Fredholm determinant Orthogonal polynomials Skew-orthogonal polynomials Christoffel–Darboux formula Cavity method Weingarten function Selberg integral Mean-field theory Airy process Bessel process sine process Painlevé transcendents KPZ equation Green's function
Category