ebook img

Asymptotics of unitary multimatrix models: The Schwinger-Dyson lattice and topological recursion PDF

0.44 MB·
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Asymptotics of unitary multimatrix models: The Schwinger-Dyson lattice and topological recursion

ASYMPTOTICS OF UNITARY MULTIMATRIX MODELS: THE SCHWINGER-DYSON LATTICE AND TOPOLOGICAL RECURSION 4 1 0 ALICEGUIONNETANDJONATHANNOVAK 2 b Abstract. We prove the existence of a 1/N expansion in unitary multima- e trix models which are Gibbs perturbations of the Haar measure, and express F theexpansioncoefficientsrecursivelyintermsoftheuniquesolutionofanon- 0 commutative initial value problem. The recursion obtained is closely related 1 to the “topological recursion” which underlies the asymptotics of many ran- dommatrixensemblesandappearsindiverseenumerativegeometryproblems. ] Our approach consists of two main ingredients: an asymptotic study of the h Schwinger-Dysonlatticeovernoncommutative Laurentpolynomials,anduni- p formcontrol onthecumulants ofGibbs measuresonproductunitarygroups. - The required cumulant bounds are obtained by concentration of measure ar- h guments andchange ofvariablestechniques. t a m [ Contents 2 v 1. Introduction 2 3 1.1. A noncommutative initial value problem 2 0 7 1.2. Initial value problem with potential 4 2 1.3. Main result: higher cumulants and topological recursion 5 1. 1.4. Asymptotic expansion of the free energy 8 0 1.5. Central Limit Theorem 9 4 1.6. Topological combinatorics 9 1 1.7. Organization 10 : v 2. Preliminaries 11 i 2.1. Algebras and characters 11 X 2.2. Constants, scalars, and correlators 11 r a 2.3. Degree filtration 11 2.4. Inner product 12 2.5. Parametric norm 12 2.6. Continuous functionals and operators 13 2.7. Tensor powers 13 2.8. Completion 14 3. The initial value problem revisited 14 3.1. The cyclic gradient trick 15 3.2. Operator norm estimates 19 3.3. Uniqueness 22 4. The Schwinger-Dyson lattice 23 4.1. Primary form of the SD equations 24 4.2. Secondary form of the SD equations 25 4.3. Uniform boundedness and renormalization 26 1 2 ALICEGUIONNETANDJONATHANNOVAK 5. Asymptotic analysis of the SD equations 30 5.1. External base step: g =0 31 5.2. The second column: g =1 33 5.3. External induction step: g 2 35 ≥ 6. Matrix model solutions of the SD lattice 37 6.1. Concentration of measure 38 6.2. Uniform boundedness via change of variables 39 6.3. Uniform boundedness 42 7. Consequences of the main result 43 7.1. Expansion of the free energy: Proof of Corollary 3 43 7.2. Central limit theorem: Proof of Corollary 4 43 7.3. Proof of Theorem 5 44 References 45 1. Introduction 1.1. A noncommutative initial value problem. 1.1.1. Given a unital -algebra B defined over C, let ∗ L=B u±1,...,u±1 h 1 m i denotethealgebraofLaurentpolynomialsinmnoncommutativevariablesu ,...,u , 1 m with noncommutative coefficients in B. That is, L=B C u±1,...,u±1 , ∗ h 1 m i the free product of B and the group algebra of a free group of rank m. Assuming that the dimension of B is countable, select a basis 1=b ,b ,b ,... 0 1 2 in B. The set of reduced words of finite length in the letters u±1,...,u±1,b ,b ,... 1 m 1 2 formsabasisinL. Wewillreservethetermmonomial forelementsofthisparticular basis. For a norm on L, we take the ℓ1-norm relative to the monomial basis. 1.1.2. InhisstudyofnoncommutativeanaloguesofentropyandFisherinformation [23], Voiculescu introduced linear maps, ∂ ,...,∂ , which act on monomials p L 1 m ∈ according to the formula ∂ p= p u p p u−1p . i 1 i⊗ 2− 1⊗ i 2 p=Xp1uip2 p=pX1u−i1p2 In words, ∂ p is the sum of all simple tensors obtained from p by tensoring on the i right of a u , less the sum of all simple tensors obtained by tensoring on the left of i a u−1. i Viewingthevariablesu ,...,u ascoordinatesona“noncommutativem-torus”, 1 m the maps ∂ play the role of classical partial derivatives on U(1)m, see [23]. In i particular, they annihilate constants, ASYMPTOTICS OF UNITARY MULTIMATRIX MODELS 3 B Ker∂ , i ⊆ are B-bilinear ∂ (bpb′)=b(∂ p)b′ i i whenL Lisgiventhe naturalB-bimodule structure,andsatisfythe productrule ⊗ ∂ (pq)=(∂ p)(1 q)+(p 1)(∂ q) i i i ⊗ ⊗ whenL Lisgiventhenaturalalgebrastructure. Linearmapsfromanalgebrainto ⊗ itstensorsquarewiththesepropertiesareknownasderivation-comultiplications in free probability [24], and as double derivations in noncommutative geometry [6]. 1.1.3. Consider the noncommutative initial value problem τ τ(∂ p)=0 i (1.1) ⊗ , τ B =σ) | where τ is an unknown unital trace on L and σ is a given unital trace on B. It is straightforward to establish existence and uniqueness for (1.1) — indeed, in view of the Liebniz rule, (1.1) amounts to a recurrence reducing the computation of τ on L to the computation of σ on B. As a simple example, the reader is invited to check that τ(b u b u−1)=σ(b )σ(b ). 1 1 2 1 1 2 Let τ denote the unique solution of (1.1). Then, the -subalgebras σ ∗ B,C u±1 ,...,C u±1 h 1 i h m i are -free in the noncommutative probability space (L,τ ), see [23, Proposition σ ∗ 5.17]. Since free independence has a very concrete combinatorial description [19], thisamountsto acombinatorialrule allowingthe efficientcomputationofτ (p)for σ any monomial p L. ∈ 1.1.4. It is a fundamental result of Voiculescu that, if σ is the limit of a sequence ofmatrixtraces,thenτ isthelimitofasequenceofrandom matrixtraces[22,23]. σ Let ρ :B Mat (C) N N → be a sequence of -representations of B whose normalized characters approximate ∗ σ, in the sense that 1 lim Trρ (b)=σ(b) N N→∞N for each b B. Note that, since any homomorphism from a normed -algebra into ∈ ∗ a C∗-algebra is contractive [8, 1.3.7], the image of any b B under ρ satisfies N § ∈ ρ (b) b , N 1 k k≤k k where is the operator norm on Mat (C). For each N 1, let N k·k ≥ U =(U ,...,U ) N 1 m 4 ALICEGUIONNETANDJONATHANNOVAK be an m-tuple of N N random unitary matrices drawnindependently from Haar × measure on the unitary group U(N). For each p L, denote by ρ (p)(U ) the N N ∈ N N random matrix obtained by replacing the constants in p according to the × representationρ ,andreplacingthevariablesu ,...,u withtherandommatrices N 1 m U ,...,U . Then, as shown in [23], one has 1 m 1 lim E Trρ (p)(U )=τ (p) N N σ N→∞ N for each p L. ∈ Aunitaltraceτ ona -algebraAiscalledacharacter ofAifitispositive,i.e. if ∗ τ(a∗a) 0 foralla A. The approximationofτ byrandommatrixtracesclearly σ ≥ ∈ implies its positivity. Thus, from an algebraic point of view, Voiculescu’s initial value problem (1.1) provides a means to induce characters of L from characters of the constant subalgebra B. From a probabilistic perspective, one has an algebraic formalism — asymptotic freeness — describing the large N asymptotic behaviour of the trace of polynomial functions of the m-tuple U and the deterministic con- N tractions ρ (b ). N i 1.2. Initial value problem with potential. 1.2.1. Collins, Guionnet and Maurel-Segala [5] considered a noncommutative ini- tial value problem which generalizes (1.1), namely τ τ(∂ p)+τ(( V)p)=0 i i (1.2) ⊗ D . τ B =σ) | Here V L is a fixed polynomial (the “potential”), and is the Laurent version i ∈ D of the cyclic derivative of Rota, Sagan and Stein [20], i.e. the endomorphism of L which acts on monomials according to p= p p u u−1p p . Di 2 1 i− i 2 1 p=Xp1uip2 p=pX1u−i1p2 In words, p is the sum of the cyclic shifts of p ending in u less the sum of the i i cyclic shiftDs of p beginning with u−1. More functorially, = mop ∂ , where i Di ◦ i mop Hom(L L,L) is the map which reverses multiplication in L. Note that i ∈ ⊗ D is not a derivation of L. However, it does annihilate B, so that (1.2) degenerates to (1.1) if V B. ∈ Although (1.2) is no longer recursive, the authors of [5] established existence anduniqueness ofcontinuoussolutionsprovidedthatthe potential V issufficiently “close” to the constant subalgebra B, in an appropriate sense. This was done by first proving that (1.2) admits at most one solution via a perturbative argument, and subsequently constructing a solution τV as a limit of traces on interacting σ random unitary matrices whose joint distribution is a Gibbs law on U(N)m. 1.2.2. Asabove,letρ beasequenceofmatrixrepresentationsofB whosecharac- N tersapproximateσ. Consider the unit-mass measureBorelmeasureµV onU(N)m N defined by 1 (1.3) µV(dU)= eNTrρN(V)(U)µ (dU), N ZV N N ASYMPTOTICS OF UNITARY MULTIMATRIX MODELS 5 where µ is Haar measure and ZV is a normalization constant (the “partition N N function”). Note that µV is invariantunder translationsofV by elements of B. In N particular,ifV B is a constantpotential, µV degeneratesto µ . We referto the ∈ N N sequence of measures µV as the Gibbs ensemble generated by ρ (V). Note that N N µV is,ingeneral,acomplex measure. However,it isa genuine probabilitymeasure N if the function U Trρ (V)(U) N 7→ is real-valued µ -almost everywhere on U(N)m. If this condition holds, we say N that ρ (V) generates a real Gibbs ensemble. In particular, ρ (V) generates a real N N Gibbs ensemble if V is selfadjoint up to cyclic symmetry, i.e. if each monomial in V∗ is a cyclic shift of a monomial in V. LetUV =(U ,...,U )beanm-tupleofN N randomunitarymatriceswhose N 1 m × joint distribution is the realGibbs law µV. We then have a family of scalarvalued N random variables given by Trρ (p)(UV), p L, N 1. N N ∈ ≥ Themeanandcovariancestatisticsofthisfamilyinducetwosequencesoffunctionals on L: V (p)=ETrρ (p)(UV) W1N N N V (p ,p )=ETrρ (p )(UV)Trρ (p )(UV) ETrρ (p )(UV)ETrρ (p )(UV). W2N 1 2 N 1 N N 2 N − N 1 N N 2 N Using a change of variables argument, it was shown in [5] that these functionals satisfy the Schwinger-Dyson equation, (1.4) V V (∂ p)+N V (( V)p)= V (∂ p). W1N ⊗W1N i W1N Di −W2N i 1.2.3. The existence of the functional equation (1.4), which holds at finite N, explains why solutions of (1.2) are limits of random matrix traces. Indeed, a straightforwardcompactness argument shows that the sequence of linear function- als (N−1 V )∞ admits a limit point. Furthermore, concentration of measure W1N N=1 techniques may be used to demonstrate that (1.5) sup V (p ,p ) < |W2N 1 2 | ∞ N foranyp ,p L,see[2][Corollary4.4.31]orCorollary32. Itfollowsthatanylimit 1 2 ∈ point τ of (N−1 V )∞ is a solution of (1.2). Given the existence of a unique W1N N=1 solution τV, one thus obtains the pointwise convergence of N−1 V to τV on L. σ W1N σ 1.3. Main result: higher cumulants and topological recursion. 1.3.1. In this article, we go beyond the framework of [5] and consider the higher cumulants of several interacting random unitary matrices distributed according to a Gibbs law. Let ρ (V) generate a real Gibbs ensemble µV, and let UV be an m-tuple of N N N N N randomunitary matrices whose distributionin U(N)m is µV. Considerthe × N mixed moment functionals on L defined by 6 ALICEGUIONNETANDJONATHANNOVAK k V (p ,...,p )=E Trρ (p )(UV), MkN 1 k N j N j=1 Y and the corresponding mixed cumulant functionals defined recursively by V (p ,...,p )= V (p :r R), MkN 1 k W|R|N r ∈ π∈XPar(k)RY∈π wherePar(k)isthelatticeofpartitionsof 1,...,k ,theinternalproductbeingover { } theblocksofagivenpartitionπ. Mixedmomentsandmixedcumulantscontainthe sameprobabilisticinformation,butcumulantsareeasiertoworkwith. Forexample, for k 2, the cumulant V vanishes whenever one of its arguments lies in B — ≥ WkN we will refer to this property as B-connectedness, or simply connectedness. We use this term because the relation between moments and cumulants can equivalently be expressedusing the exponential formula of enumerative combinatorics,which is frequentlyusedtopassbetweenpossiblydisconnectedandconnectedcombinatorial structures [21][Chapter 5]. Our goal in this paper is to show that, when V is sufficiently small, the 1 k k rescaled cumulants (1.6) ˜V =Nk−2 V WkN WkN admit an N asymptotic expansion on the asymptotic scale N−2. Further- → ∞ more, we will give a recurrence relation completely determining all the expansion coefficients in terms of the limit of ˜V . W1N 1.3.2. As in [5], our approach is based on the method of Schwinger-Dyson equa- tions in random matrix theory. Going beyond [5], we consider an entire hierarchy of noncommutative partial differential equations obtained recursively from (1.4) which encodes the asymptotics of the higher cumulants V . To solve this hierar- WkN chy,onehastoinvertacertainpartialdifferentialoperatoractingonB⊥,thespace ofnoncommutative Laurentpolynomials with no constantterm. We will provethe following quantitative result. Theorem 1. Let V L be selfadjoint up to cyclic symmetry, and suppose there ∈ exists K 1 ≥ 7 1 V < . k k1 66 · deg(V)2(K−1)degV12deg(V) Let ρ : B Mat (C) be a sequence of matrix representations whose normalized N N → characters admit an N asymptotic expansion to h terms: →∞ h σ (b) 1 (1.7) N−1Trρ (b)= g +o , b B. N N2g N2h ∈ g=0 (cid:18) (cid:19) X For each k [1,K] and all p ,...,p B⊥, the renormalized kth cumulant 1 k ∈ ∈ ˜V of the real Gibbs ensemble generated by ρ (V) admits an N asymptotic WkN N →∞ expansion to h K 1 terms: ≤ − ASYMPTOTICS OF UNITARY MULTIMATRIX MODELS 7 (1.8) ˜V (p ,...,p )= h τkVg(p1,...,pk) +o 1 . WkN 1 k N2g N2h g=0 (cid:18) (cid:19) X The expansion coefficients τV may be described as follows: kg (1) τV is the uniquesolution of the noncommutativeinitial value problem (1.2) 10 with σ =σ ; 0 (2) For k =1 and g >0, g−1 τV(p)= τ τ (∆(ΞV )−1p) τ (∆(ΞV )−1p); 1g − 1ℓ⊗ 1(g−ℓ) τ1V0 − 2(g−1) τ1V0 ℓ=1 X (3) For k >1 and g >0, we have g τV (p ,...,p )= τV (T (ΞV )−1p ,...,p ) kg 1 k − k(g−f) τ1Vf τ1V0 1 k f=1 X g τV τV (∆(ΞV )−1p #p p ) − (|I|+1)f ⊗ (k−|I|)(g−f) τ1V0 1 I ⊗ I I f=0 XX k τV (Ppj(ΞV )−1p ,...,pˆ ,...,p ) − (k−1)g τ1V0 1 j k j=2 X τV (∆(ΞV )−1p ,...,p ), − (k+1)(g−1) τ1V0 1 k where the second sum on the right is over all proper nonempty subsets I of 2,...,k . { } These recurrences are given in terms of certain linear transformations ∆ Hom(B⊥,L⊗2)andP•,T ,Ξ• EndB⊥ which will bedescribed inthenextsection∈. • • ∈ Remark 2. Note that Theorem 1 is stated only for polynomials p ,...,p which 1 k have no constant term. It is always possible to reduce to this case. Indeed, if p=q+r with q B⊥ and r B, we have ∈ ∈ ˜V (p)= ˜V (q+r)= ˜V (q)+ ˜V (r), W1N W1N W1N W1N by linearity. Since the asymptotics of ˜V (r) are given by (1.7), one need only W1N determine the asymptotics of ˜V (q). For k 2, if p =q +r with q B⊥ and W1N ≥ i i i i ∈ r B, we have i ∈ ˜V (p ,...,p )= ˜V (q +r ,...,q +r )= ˜V (q ,...,q ), WkN 1 k WkN 1 1 k k WkN 1 k by multilinearity and connectedness. The abovetheorem remains true if the expansion(1.7) is unknown, providedσ 0 is replaced in the inductive relations by N−1Trρ (b),b B. N ∈ 8 ALICEGUIONNETANDJONATHANNOVAK 1.3.3. This paper is part of a broad program in random matrix theory, with con- tributions from many authors, which seeks to determine the asymptotics of both microscopic and macroscopic statistics of various classes of random matrices by leveraging information from an appropriate manifestation of the Schwinger-Dyson equations. Foranoverviewofthemicroscopicsideofthestory,thereaderisreferred to [9], while the macroscopicside is surveyedin [7]. In particular,the recursionfor theexpansioncoefficientsτV giveninTheorem1iscloselyrelatedtothetopological kg recursion of mathematical physics [1, 3], and its modern re-imagining [10]. Theorem 1 is the unitary analogue of the theorems of Guionnet and Maurel- Segala [13, 14] and Maurel-Segala [18] on the asymptotics of the trace of polyno- mialfunctions inseveralinteractingrandomHermitianmatriceswhosejointdistri- bution is a perturbation of the m-fold product GUE measure. The present paper complements these results by adapting the SD equations technology to the setting of perturbations of the m-fold product CUE measure, hence generalizing [5] to all order expansions. An additional feature of the present work is the inclusion of the background algebra B, whose basis elements act as “external sources” from the random matrix viewpoint. 1.4. Asymptotic expansion of the free energy. LetV Lbeapotentialsuch ∈ thatρ (V)generatesarealGibbsensembleµV,andconsiderthepartitionfunction N N ZV = eNTrρN(V)(U)µ (dU) N N Z U(N)m of µV. It was proved in [5] that N ZNV ∼eN2F0V, with FV a quantity independent of N. To make this precise, we introduce the free 0 energy of µV, which is by definition the quantity N 1 (1.9) FV := logZV. N N2 N As acorollaryofTheorem1, weobtainthe followingrefinementof[5] toallorders: Corollary 3. Under the hypotheses of Theorem 1, the free energy FV admits an N N expansion to h K 1 terms: →∞ ≤ − 1 h FV 1 logZV = g +o . N2 N N2g N2h g=0 (cid:18) (cid:19) X ThecoefficientsFV inthisexpansiondependonlyonV andthefunctionalsσ ,...,σ . g 0 h In fact, it may be shownthat each FV is an analytic function of the coefficients g of V whose Taylor expansion serves as a generating function enumerating certain graphsdrawnonacompactorientablesurfaceofgenusg. Theseembeddedgraphs, ormaps astheyareknown,aresimilartothemapsenumeratedbytheexpansionof freeenergyofperturbationsofthe productGUEmeasure,exceptthatthey possess additional edge data. The g = 0 case of this expansion was developed in [5]. As this graphical description is rather involved, we shall not pursue the detailed development of its extension to higher genus in the present paper. We want to ASYMPTOTICS OF UNITARY MULTIMATRIX MODELS 9 stress however that the FV’s are absolutely summable series whose coefficients are g determinedby the restrictionofthe normalizedtrace to the -subalgebraρ (B) N Mat (C). ∗ ⊆ N 1.5. Central Limit Theorem. A corollaryofthe abovelargeN expansionis the following central limit theorem: Corollary 4. Under the hypotheses of Theorem 1 with K 1, for any selfadjoint polynomial p in L, for any λ R, ≥ ∈ lim eλ(Tr(ρN(p)(U)−Nτ1V0(p))µVN(dU)=eλ22γV(p) N→∞ Z U(N)m where γV(p)= τV(Pp(ΞV )−1p). − 10 τ1V0 Corollary 4 should be compared with the analogous central limit theorem for traces of polynomial functions in several random Hermitian matrices whose joint law is a deformation of the product GUE measure, see [14, Theorem 4.7]. 1.6. Topological combinatorics. In the present article, we content ourselves with the derivation of Theorem 1 and postpone the study of a general combinato- rial/topological interpretation of the functionals τV and the affiliated coefficients kg FVto a future work. We do mention, however, the relation of Theorem 1 to the g study of one particularly interesting unitary matrix model, namely the Harish- Chandra-Itzykson-Zubermodel [15, 16, 17, 25]. LetB =C x,y bethealgebraofpolynomialsintwoselfadjointnoncommutative variablesx,y,handisetV =xuyu−1,witht R arealparameter. Letρ satisfying t N (1.7). The partition function of the corresp∈onding real Gibbs ensemble µVt is the N HCIZ integral ZVt = etNTr(ρN(x)UρN(y)U−1)dU. N Z U(N) Theorem1,whencombinedwiththeresultsof[5]and[11],establishesthefollowing topological expansion of the HCIZ free energy 1 FVt = logZVt. N N2 N Theorem 5. For each t ( 7 , 7 ), the HCIZ free energy ad- ∈ −22(K−1)19008 22(K−1)19008 mits an N asymptotic expansion to h K 1 terms: →∞ ≤ − h F (t) 1 FVt = g +o , N N2g N2h g=0 (cid:18) (cid:19) X The coefficients F (t) in this expansion are analytic in a neighbourhood of t = 0, g with Maclaurin series given by ∞ td F (t)= ( 1)ℓ(α)+ℓ(β)σ (xα)σ (yβ)H~ (α,β), g g g g d! − d=1 α,β⊢d X X where the internal sum is over all pairs of partitions α,β d, ⊢ 10 ALICEGUIONNETANDJONATHANNOVAK ℓ(α) ℓ(β) σ (xα)= σ (xαi), σ (yβ)= σ (yβi), g g g g i=1 i=1 Y Y and the H~ (α,β)’s are the monotone double Hurwitz numbers. g The monotone double Hurwitz number H~ (α,β) with α,β d counts a combi- g ⊢ natoriallyrestrictedsubclassofthe setofdegreedbranchedcoversofthe Riemann sphereby a compact,connectedRiemann surfaceofgenus g suchthatthe covering map has profile α over , β over 0, and simple branching over the rth roots of ∞ unity, where r =2g 2+ℓ(α)+ℓ(β) by the Riemann-Hurwitz formula. For more − on monotone double Hurwitz numbers, see [11]. Theorem 5 is the perturbative versionofanasymptotic expansionofthe HCIZ free energyconjecturedto hold by Matytsin in [17]. 1.7. Organization. The paper is organizedas follows. In Section 2, we cover necessary preliminaries. Most importantly, we introduce a deformation of the ℓ1-norm on L which will play a crucial role in our analysis. Section 3 treats the noncommutative initial value problem (1.2). We prove uniquenessofcontinuoussolutionsinaperturbativeregimeviaanargumentwhich is more conceptual than that employed in [5]. In particular,we introduce a pair of partialdifferential operatorsacting on B⊥ and deduce uniqueness from the invert- ibility of these operators. Section 4 introduces the Schwinger-Dyson lattice over L. In particular, we give all equations of this hierarchy in explicit form. We then present a secondary form of the SD lattice equations which describes them completely in terms of the first row of the lattice and the fundamental operators introduced in Section 3. This is somewhat similar in spirit to the description of classical integrable systems by meansofLaxpairs. Finally,weintroducethenotionofuniformly boundedsolutions of the SD equations. Uniformly bounded solutions lead to a renormalized form of the SD lattice which is well-poised for asymptotic analysis. Section 5 carries out the asymptotic analysis of an abstractly given uniformly bounded solution of the SD lattice. Our treatment is perturbative: we work ex- clusively in the regime where the potential V is “close”to the constantsubalgebra B. In this regime, the fundamental operators which describe the SD lattice are automorphisms of the completion of B⊥ in an appropriate norm. We obtain an abstract version of Theorem 1, listed as Theorem 24 below, which shows how the recursion relations of Theorem 1 arise intrinsically from the structure of the SD lattice, without any reference to random matrices. Section 6 makes the connection with matrix models. Almost by definition, the cumulants of the Gibbs ensemble generated by ρ (V) form a solution of the SD N lattice equations — however,this solution may not be uniformly bounded, so that Theorem24 is not a prioriapplicable. When ρ (V) generatesa real Gibbs ensem- N ble,probabilistictoolssuchasconcentrationofmeasurecanbebroughtintoverify uniform boundedness. These probabilistic arguments are carried out in Section 6. The upshot of this analysis is that Theorem 1 ultimately emerges as a corollary of its more abstract version, Theorem 24. In Section 7, we derive a central limit theorem for the trace of polynomial func- tions of the m-tuple UV =(U ,...,U ) ofN N randomunitary matrices whose N 1 m ×

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.