On the circle, GMC γ = lim ← − C β E n if γ = q 2
β ≤ 1
Reda Chha¨ıbi - joint work with Joseph Najnudel
Institut de Math´ematiques de Toulouse, France
Last update: 7th of November 2019
RedaChhaibi(Institut de Math´ematiques de Toulouse, France) GMC = CBE Last update: 7th of November 2019 1 / 1
Sommaire
A puzzling identity in law
Consider N
1C, N
2C, . . .
to be a sequence of i.i.d standard complex Gaussians i.e:
P N
iC∈ dxdy
= 1
π e
−x2−y2dxdy , so that:
E N
kC= 0, E |N
kC|
2= 1 .
Let (α
j)
j≥0be independent random variables with uniform phases and modulii as follows:
|α
j|
2=
LBeta(1, β
j:= β
2 (j + 1))
As a shadow of a more global correspondence between GMC and RMT:
Proposition (Verblunsky expansion of Gaussians)
The following equality in law holds, while the RHS converges almost surely (!):
s 2 β N
1C=
L∞
X
j=0
α
jα
j−1.
A puzzling identity in law (II)
“Numerical proof:” Histogram of <
σ P
∞j=0
α
jα
j−1, |σ| = 1.
A puzzling identity in law (III)
“Numerical proof:”
Introduction
The main player of this talk will be the random Gaussian distribution on S
1: G(e
iθ) := 2<
∞
X
k=1
N
kC√ k e
ikθ.
Remark
Given the decay of Fourier coefficients, this is a Schwartz distribution in negative Sobolev spaces ∩
ε>0H
−ε(S
1) where:
H
s(S
1) :=
( f | X
k∈Z
|k|
s| f b (k )|
2)
.
Harmonic extension of G
Consider the harmonic extension of G to the disc:
G (re
iθ) := 2<
∞
X
k=1
N
kC√ k r
ke
ikθ= P
r∗ G
|S1e
iθ,
where P
ris the Poisson kernel.
Sommaire
Modern motivations: “Liouville Conformal Field Theory”
in 2D
Brownian Map ( c Bettinelli)
Uniformization
, GMC
γ(dz)
!
for γ = q
8 3
.
(Theorem by Miller-Sheffield)
Message
The GMC
γis the natural Riemannian measure on random surfaces which model LCFT.
But please, ask someone else to tell you about this... E.g. Rhodes-Vargas,
Miller-Sheffield and/or their students.
Our construction: On the circle, in 1d
A natural object (for Kahane and the LCFT crowd) is:
GMC
rγ(d θ) := e
γG(reiθ)−12Var[
G(reiθ)] dθ
2π = e
γG(reiθ)(1 − r
2)
γ2dθ 2π . We have:
Theorem (Kahane, Rhodes-Vargas, Berestycki)
Define for every f : S
1= ∂ D → R
+, and γ < 1:
GMC
rγ(f ) :=
Z
2π 0f (e
iθ)GMC
rγ(d θ) . Then the following convergence holds in L
1(Ω):
GMC
rγ(f )
r→1−→ GMC
γ(f ) .
The limiting measure GMC
γis called Kahane’s Gaussian Multiplicative Chaos.
Sommaire
The model
Consider the distribution of n points on the circle:
(C βE
n) 1 Z
n,βY
1≤k<l≤n
e
iθk− e
iθlβ
dθ = 1 Z
n,β|∆(θ)|
βdθ
For β = 2, one recognizes the Weyl integration formula for central functions on the compact group U (n). Therefore, this nothing but the distribution of a Haar distributed matrix on the group U(n). The study of this case is very rich in the representation theory of U
n(Bump-Gamburd, Borodin-Okounkov, ...) For general β , not as nice but still an integrable system: Jack polynomials in n variables are orthogonal for the Cβ E
n, Eigenvectors for the trigonometric Calogero-Sutherland system (n variables), “Higher” representation theory (Rational Cherednik algebras).
The characteristic polynomial:
X
n(z ) := det (id −zU
n∗) = Y
1≤j≤n
1 − ze
−iθjCBE as regularization of Gaussian Fock space
The C βE
nis the regularization of a Gaussian space by n points at the level of symmetric functions. In fact:
tr U
nkn→∞→ s
2k β N
kC,
(Strong Szeg¨ o - β = 2, Diaconis-Shahshahani - β = 2, Matsumoto-Jiang)
Short proof: Open the bible of symmetric functions
CBE as regularization of Gaussian Fock space: Proof
Power sum polynomials: p
k:= p
k(U
n) = tr U
nkand p
λ:= Q
i
p
λi. Scalar product for functions in n variables: hf , g i
n:= E
CβEnf (z
i)g (z
i) . Fact 1: This scalar product approximates the Hall-Macdonald scalar product in infinitely many variables h·, ·i
n→ h·, ·i , where
hp
λ, p
µi = z
λ2 β
`(λ)δ
λ,µ= δ
λ,µCste(λ) .
Fact 2: The Macdonald scalar product has a Gaussian space lurking behind as
δ
λ,µCste(λ) = E
Y
k
s 2k β N
kC!
mk(λ)s 2k
β N
kC!
mk(µ)
,
where m
k(λ) multiplicity of k in partition λ.
the CβE is the regularization of a Gaussian Fock space by restricting the
symmetric functions to n variables.
Classical Gaussianity and log-correlation in RMT
Since:
log X
n(z ) = X
k≥1
tr U
nkk z
k, it is conceivable that:
Proposition (O’C-H-K for β = 2, C-N for β > 0)
We have the convergence in law to the log-correlated field:
(log |X
n(z )|)
z∈Dn→∞−→
s 2 β G (z)
!
uniformly in z ∈ K ⊂ D , K compact.
z∈Dfor z ∈ ∂ D , in the Sobolev space H
−ε(∂ D ).
GMC from RMT: A convergence in law (I)
A step further, it is natural to construct a measure from the characteristic polynomial
(log |X
n(z )|)
z∈Dn→∞−→
s 2 β G (z)
!
z∈D
and compare it to the GMC.
.
Here is a result whose content is very different from ours but easily confused with it.
Building on ideas of Berestycki, then Lambert-Ostrovsky-Simm (2016):
Proposition (Nikula, Saksman and Webb (2018))
For β = 2 and for every α ∈ [0, 2), consider X
n(z ) = det(I
n− zU
n∗) to be the characteristic polynomial of the CUE = C2E . Then, for all continuous f : ∂ D → R , we have the convergence in law as n → ∞:
Z
[0,2π]
dθ 2π f e
iθX
n(e
iθ))
α
E
X
n(e
iθ))
α
→
LGMC
α/2(f ) .
GMC from RMT: A convergence in law (I)
A step further, it is natural to construct a measure from the characteristic polynomial
(log |X
n(z )|)
z∈Dn→∞−→
s 2 β G (z)
!
z∈D
and compare it to the GMC.
.
Here is a result whose content is very different from ours but easily confused with it. Building on ideas of Berestycki, then Lambert-Ostrovsky-Simm (2016):
Proposition (Nikula, Saksman and Webb (2018))
For β = 2 and for every α ∈ [0, 2), consider X
n(z ) = det(I
n− zU
n∗) to be the characteristic polynomial of the CUE = C2E . Then, for all continuous f : ∂ D → R , we have the convergence in law as n → ∞:
Z
[0,2π]
dθ 2π f e
iθX
n(e
iθ))
α
E
X
n(e
iθ))
α
→
LGMC
α/2(f ) .
GMC from RMT: A convergence in law (II)
A few remarks are in order:
In fact, for β = 2, there is an extremely fast convergence of traces of Haar matrices to Gaussians. For f polynomial on the circle, we have:
(Johansson) d
TVTr f (U
n), X
k
c
k(f ) √ kN
kC!
n→∞
∼ C
fn
−cn/degf.
Nikula, Saksman and Webb (NSW) leverage the (notoriously technical) Riemann-Hilbert problem, which packages neatly this convergence for traces of high powers in order to compare to GMC.
Probably hopeless for general β, where convergence to Gaussians is known to be slower and finding a machinery that replaces the RH problem, while being just as precise, is an open question of its own.
Message (Take home message)
Our statement GMC
γ= lim ← − C βE
nis non-asymptotic and an almost sure equality for all β > 0 and n ∈ N , via a non-trivial coupling. We are saying for γ < 1:
”GMC
γis the object whose finite n approximations are given by C βE
n’s.”
Sommaire
OPUC and Szeg¨ o recurrence
OPUC : “Orthogonal Polynomials on the Unit Circle”
Consider a probability measure µ on the circle and apply the Gram-Schmidt procedure:
1, z , z
2, . . . {Φ
0(z ), Φ
1(z ), Φ
2(z), . . . } Szeg¨ o recurrence:
Φ
j+1(z ) = z Φ
j(z ) − α
jΦ
∗j(z) Φ
∗j+1(z ) = −α
jz Φ
j(z ) + Φ
∗j(z ) . Here:
Φ
∗j(z ) := z
jΦ
j(1/¯ z )
is the polynomial with reversed and conjugated coefficients. The α
j’s are
inside the unit disc, known as Verblunsky coefficients.
The work of Killip, Nenciu
Killip and Nenciu have discovered an explicit distribution for Verblunsky coefficients so that X
n, the characteristic polynomial of CβE
n, is a Φ
∗n!
Theorem (Killip, Nenciu)
Let (α
j)
j≥0, as before and η uniform on the circle.
Let (Φ
j, Φ
∗j)
j≥0be a sequence of OPUC obtained from the coefficients (α
j)
j≥0and the Szeg¨ o recurrence.
Then we have the equality in law between random polynomials:
X
n(z ) = Φ
∗n−1(z ) − z ηΦ
n−1(z ).
Proof.
Essentially computation of a Jacobian - with two important subtleties!
IMPORTANT: Projective family. Notice the consistency. A priori, a realization of
CBE
nhas no reason to share the first Verblunsky coefficients with CBE
n+1.
A puzzling question
If a measure defines Verblunsky coefficients, the converse is also true:
Theorem (Verblunsky 1930)
Let M
1(∂ D ) be the simplex of probability measures on the circle, endowed with the weak topology. The set D
Nis endowed with the topology of point-wise convergence. The Verblunsky map
V : M
1(∂ D ) → D
Nt (t
n∈ND
n× ∂ D ) µ 7→ (α
j(µ); j ∈ N )
is an homeomorphism. Atomic measures with n atoms have n Verblunsky coefficients, the last one being of modulus one.
This begs the question:
Question
The Verblunsky coefficients are consistent. Since the obvious coupling respects the Verblunksy map, we define a limiting measure lim
← − CBE
n, whose n-point
approximation/projection is the CBE
n. What is this measure?
Sommaire
Statement
Theorem (C-Najnudel, arXiv:1904.00578)
For γ = q
2
β
≤ 1, we have equality between
the measure µ
βwhose Verblunsky coefficients are the (α
n; n ∈ N ) from C βE . Kahane’s GMC
γ, renormalized into a probability measure.
µ
β(dθ) = 1
GMC
γ(∂ D ) GMC
γ(dθ) .
One can theoretically sample the GMC
γ. Then upon considering the best approximating measure on n points, the quadrature points are nothing but the RMT ensembles CBE
n.
One could write a projective limit:
GMC
γ= CβE
∞:= lim
← −
n
C βE
n.
Ideas of proof
µ
βn,r(dθ) ∝
|Φ∗ 1n(reiθ)|2
dθ µ
βr(dθ) =
eωrC(θ)0
GMC
rγ(dθ)
µ
βn(dθ) =
Qn−1 j=0(1−|αj|2)
|Φ∗n(eiθ)|2
dθ
Bernstein-Szeg¨ o approx. µ
β/
Kβ
C0
GMC
γ=q2
β
(dθ) n → ∞
r → 1
n → ∞
r → 1
Finitely many Verblunsky coeff - RMT regularization of Gaussians
Gaussian fields
Poisson kernel regularization
On the circle
Difficult points:
Filtrations by Gaussians and Verblunsky coefficients ( F ) have bad overlap.
Top n → ∞ limit is built to be a martingale limit, with parameter r.
Doob decomposition w.r.t F : ω
r= P
∞k=0
(1 − r
2)
k+1Ykr. Y
khas has a non-trivial limiting SDE as r → 1. SDE is ill-behaved at time 0.
SDE = Crossing mechanism, which quickly forgets initial Verblunsky
coefficients, thanks to non-trivial entrance law. Crucial for r → 1 limit.
Consequences
(CβE
n; β ≥ 2, n ∈ N
∗) can all be coupled upon constructing (GMC
γ; 0 ≤ γ < 1).
(Fyodoroff-Bouchaud) Another proof of G. R´ emy’s identity:
GMC
γ(∂ D ) = K
β∞
Y
j=0
1 − |α
j|
2−1e
−β(j+1)2=
LK
β0e
−β2.
(Beyond Fyodoroff-Bouchaud) One can also describe all moments c
k= 1
GMC
γ(∂ D ) Z
2π0
e
ikθGMC
γ(dθ) .
via universal expressions in terms of the Verblunsky coefficients. For example:
c
1= α
0,
c
2= α
20+ α
1(1 − |α
0|
2) , c
3= (α
0− α
1α
0)[α
20+ α
1(1 − |α
0|
2)]
+α
1α
0+ α
2(1 − |α
0|
2)(1 − |α
1|
2).
Consequences
(CβE
n; β ≥ 2, n ∈ N
∗) can all be coupled upon constructing (GMC
γ; 0 ≤ γ < 1).
(Fyodoroff-Bouchaud) Another proof of G. R´ emy’s identity:
GMC
γ(∂ D ) = K
β∞
Y
j=0
1 − |α
j|
2−1e
−β(j+1)2=
LK
β0e
−β2.
(Beyond Fyodoroff-Bouchaud) One can also describe all moments c
k= 1
GMC
γ(∂ D ) Z
2π0
e
ikθGMC
γ(dθ) .
via universal expressions in terms of the Verblunsky coefficients. For example:
c
1= α
0,
c
2= α
20+ α
1(1 − |α
0|
2) , c
3= (α
0− α
1α
0)[α
20+ α
1(1 − |α
0|
2)]
+α
1α
0+ α
2(1 − |α
0|
2)(1 − |α
1|
2).
Consequences
(CβE
n; β ≥ 2, n ∈ N
∗) can all be coupled upon constructing (GMC
γ; 0 ≤ γ < 1).
(Fyodoroff-Bouchaud) Another proof of G. R´ emy’s identity:
GMC
γ(∂ D ) = K
β∞
Y
j=0
1 − |α
j|
2−1e
−β(j+1)2=
LK
β0e
−β2.
(Beyond Fyodoroff-Bouchaud) One can also describe all moments c
k= 1
GMC
γ(∂ D ) Z
2π0