


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The asymptotic analysis of orthogonal polynomials using the riemann-hilbert problem and equilibrium measures. The definition and properties of the equilibrium measure, the first transformation of the riemann-hilbert problem, and the connection between orthogonal polynomials and the solution of riemann-hilbert problem 1. The text also introduces a new riemann-hilbert problem (riemann-hilbert problem 2) and verifies that the new unknown, b(z), satisfies this problem.
Typology: Study notes
1 / 4
This page cannot be seen from the preview
Don't miss anything!



Lecture 24: Continuing the asymptotic calculation.
Lecture plan. Starting again with the first transformation of the RHP, we will proceed with an outline of the asymptotic analysis.
Using Equilibrium Measures Recall that the equilibrium measure is defined as the unique minimizer in
(1) M 1 (R = {Probability measures on R}
of the functional
Iβ : M 1 → (−∞, ∞], μ 7 →
R^2
log |x − y|−^1 dμ(x)dμ(y) +
R
(2) κβ |x|β^ dμ(x).
In the previous lecture we discussed the various origins of this variational problem, and how it relates to orthogonal polynomials and random matrix theory. In this lecture we will require (later) the following properties of the equilibrium measure
f (x)dμ∗(x) =
− 1 f^ (x)ψβ^ (x)dx, and
ψβ (x) =
β π
|x|
uβ−^1 √ u^2 − x^2
(3) du, x ∈ (− 1 , 1).
− 1
(4) log |x − y|dμ∗(y) − V (x) = `
− 1
(5) log |x − y|dμ∗(y) − V (x) < `
First transformation of the Riemann–Hilbert problem Recall from the previous lecture that we have following Riemann-Hilbert problem which is known to
characterize the polynomials p( jN )orthogonal with respect to e−N V^ (x)^ [3]. The calculations of the present lecture were first carried out in [1] and [2], but for the particular case of orthogonality with respect to
e−N κβ^ |x|
β dx, the work was presented in [4]
Riemann-Hilbert Problem 1. Find a 2 × 2 matrix A(z) = A(z; n, N ) with the properties:
Analyticity. A(z) is analytic for z ∈ C \ R, and takes continuous boundary values A+(x), A−(x) as z tends to x with x ∈ R and z ∈ C+, z ∈ C−. Jump Condition. The boundary values are connected by the relation
(6) A+(x) = A−(x)
1 e−N V^ (x)
0 1
Normalization. The matrix A(z) is normalized at z = ∞ as follows:
(7) lim z→∞ A(z)
z−n^0
0 zn
The connection between these orthogonal polynomials and the solution of Riemann-Hilbert Problem 1 is the following:
(8) A(z) =
κ( n,nN^ )
pn(z)
2 πiκ( n,nN^ )
R
pn(s)e−N V^ (s) s − z
ds
− 2 πiκ( nN−^ ) 1 ,n− 1 pn− 1 (z) −κ( nN−^ ) 1 ,n− 1
R
pn− 1 (s)e−N V^ (s) s − z
ds
This relationship provides a useful avenue for asymptotic analysis of the orthogonal polynomials in the limit n → ∞; it is sufficient to carry out a rigorous asymptotic analysis of Riemann-Hilbert Problem 1. The first transformation is as follows. Define
g(z) =
− 1
log (z − x)dμ∗(x) =
− 1
(9) log (z − x)ψβ (x)dx
which is taken to be analytic in C \ (−∞, 1]. Using g(z), we define a new matrix valued function (the new unknown) B(z), as follows:
B(z) := e−^
N ` 2 σ 3 A(z)e−N^ (g(z)−^
` 2 )σ 3 (10)
We will verify that B satisfies a new Riemann–Hilbert problem:
Riemann-Hilbert Problem 2. Find a 2 × 2 matrix B(z) = B(z; n, N ) with the properties:
Analyticity. B(z) is analytic for z ∈ C \ R, and takes continuous boundary values B+(x), B−(x) as z tends to x with x ∈ R and z ∈ C+, z ∈ C−. Jump Condition. The boundary values are connected by the relation
(11) B+(x) = B−(x)
e−N^ (g+(x)−g−(x))^ eN^ (g+(x)+g−(x)−V^ (x)−`
0 eN^ (g+(x)−g−(x))
Normalization. The matrix B(z) is normalized at z = ∞ as follows:
(12) lim z→∞ B(z) = I.
Here is a very useful result concerning the function g defined, as used, above:
Now the amazing thing is that these matrices can be extended off the real axis, where the oscillations turn into decay. The two relevant statements are these:
∂ ∂y
Re (G(x + iy))
y=
∂x
Im (G(x + iy))
y=
(13) = 2πψ(x) > 0.
So we then define D(z) as follows:
And it is clear that the new unknown, D, is analytic of the more complicated union of contours shown above. Moreover, given the above considerations, the jump matrices satisfy the following important property: For any δ > 0 , the jump matrix VD (z) is exponentially close to I for all values of z whose distance from [− 1 , 1] is greater than δ. Homework Problem: Ignoring all contours except the interval [− 1 , 1], solve the following Riemann– Hilbert problem.
Riemann-Hilbert Problem 3. Find D˙(z) satisfying the following three conditions.
(1) (analyticity) The matrix D˙ is analytic in C \ [− 1 , 1]. (2) (Normalization) D˙(z) = I + O
z
as z → ∞. (3) (Boundary values and jump relation)
D^ ˙+(x) = D˙−(x)
References [1] P. Deift, T. Kriecherbauer, K. T.-R. McLaughlin, S. Venakides, and X. Zhou, “Uniform asymptotics for polynomials orthogonal with respect to varying exponential weights and applications to universality questions in random matrix theory”, Comm. Pure Appl. Math., 52 , 1335–1425, 1999. [2] P. Deift, T. Kriecherbauer, K. T.-R. McLaughlin, S. Venakides, and X. Zhou, “Strong asymptotics of orthogonal polyno- mials with respect to exponential weights”, Comm. Pure Appl. Math., 52 , 1491–1552, 1999. [3] A. Fokas, A. Its, and A. V. Kitaev, “Discrete Painlev´e equations and their appearance in quantum gravity”, Commun. Math. Phys., 142 , 313–344, 1991. [4] T. Kriecherbauer and K. T.-R. McLaughlin, Strong Asymptotics of Polynomials Orthogonal with Respect to Freud Weights, Int. Math. Res. Not., No. 6, pp. 299333, 1999.