alphaFeedback

WorksMathematics

Bulk limits of the truncated circular beta ensembles

AI contributions
  • ChatGPT
View details

Abstract

We study the bulk limits of the rank-one truncation of the circular beta ensembles obtained by deleting the first row and column. We prove that the normalized Blaschke products of the truncated circular beta ensembles converge in law to a constant multiple (depending on ββ) of the i.i.d.~Gaussian analytic function (GAF) uniformly on compacts of the unit disk. As a consequence, we identify the bulk point process limit with the zero set of GAF, which was proved in the seminal work of Peres and Virág to form a determinantal point process with the Bergman kernel. Our method also applies to the rank-one multiplicative perturbations of the circular beta ensembles in the mesoscopic regime.

Introduction

The size nn circular beta ensemble with parameter β>0\beta> 0 is the distribution of nn points {eiθj,1≤j≤n}\{e^{i\theta_j}, 1 \le j \le n\} on the unit circle with joint probability density

1Zn,β∏j<k≤n∣eiθj−eiθk∣β,θj∈[−π,π),(1)\frac{1}{Z_{n,\beta}} \prod_{j<k\le n} \left|e^{i\theta_j}-e^{i\theta_k}\right|^\beta,\qquad\theta_j \in[-\pi,\pi), \tag*{(1)}

where Zn,βZ_{n,\beta} is an explicit normalizing constant (see e.g. Section 2.8 of [8]). When β=2\beta= 2, (1) recovers the joint eigenvalue density of a uniformly chosen n×nn \times n unitary matrix, known as the size nn Circular Unitary Ensemble (CUE). By utilizing the algebraic structure of the joint intensities, Dyson, Gaudin, and Mehta derived the local scaling limit of CUE in the 1960s. They showed that the determinantal structure is preserved in the limit, and the limit process, known as the Sine⁡2\operatorname{Sine}_2 point process, is a translation invariant determinantal point process on R\mathbb{R}. In [4] Chhaibi, Najnudel and Nikeghbali studied the local scaling limit of the (normalized) characteristic polynomials of CUE, and constructed a random analytic function ζ2\zeta_2 (called the stochastic zeta function) so that its zero set has the same distribution as the Sine⁡2\operatorname{Sine}_2 point process.

When β=1,4\beta= 1, 4, the joint density (1) corresponds to certain random unitary matrices invariant under symmetric/self-dual transformations. For general β>0\beta> 0, there is no similar invariant matrix model. In [16] Killip and Nenciu (motivated by the results of [6]) constructed a family of sparse random CMV (named after Cantero, Moral, and Velázquez [1]) matrix models {Circ⁡n,β,n≥1}\{\operatorname{Circ}_{n,\beta}, n \ge1\} in terms of the Verblunsky coefficients so that the resulting matrix has a joint eigenvalue density given by (1). See § 2 for an overview of the CMV construction. In [17] Killip and Stoiciu showed that under the same scaling as in the unitary case, the circular beta ensemble has a point process limit, called the Sineβ_\beta point process. They showed that the Sineβ_\beta process can be characterized via its counting function using a system of coupled stochastic differential equations. Using the random operator framework, in a series of works [26, 27, 28] Valkó and Virág showed the operator level convergence of the circular beta ensembles with an explicit rate of convergence, and proved that the normalized characteristic polynomials of the circular beta ensembles converge to the random analytic functions ζβ(⋅)\zeta_\beta(\cdot) with zero set given by the Sineβ_\beta process. See also [6, 7, 23, 25, 22] for a development of the matrix models and local scaling limits for beta ensembles on the real line.

In this paper, we focus on the rank-one truncation of the circular beta ensembles obtained by removing the first row and column of the matrix model Circ⁡n,β\operatorname{Circ}_{n,\beta}. Random unitary matrices can be viewed as evolution operators of closed quantum systems. From this perspective, truncations of unitary matrices obtained by removing a fixed number of rows and columns, naturally arise as models for open quantum systems in the regime of weak non-Hermiticity. We refer to the surveys [12, 9] and the references therein for a detailed discussion of rank-one perturbations of random matrix ensembles.

The main goal of this project is to understand the scaling limit of the Blaschke product of the (rank-one) truncated circular beta ensembles in the bulk regime, thereby answering a question posed in [20]. Before presenting the main result, we begin with a review of the known results in the β=2\beta=2 case. Throughout the paper, for a square unitary matrix M\mathbf{M} we denote by Trunc⁡(M)\operatorname{Trunc}(\mathbf{M}) the matrix obtained by removing the first row and column from M\mathbf{M}. Since the truncation map corresponds to a projection, the eigenvalues of the resulting matrix Trunc⁡(M)\operatorname{Trunc}(\mathbf{M}) have modulus less than or equal to one.

Consider the case when Mn+1\mathbf{M}_{n+1} is a uniformly chosen (n+1)×(n+1)(n+1)\times(n+1) unitary matrix with respect to the Haar measure on the unitary group U(n+1)U(n+1). In [29] Życzkowski and Sommers proved that the joint eigenvalue density of Trunc⁡(Mn+1)\operatorname{Trunc}(\mathbf{M}_{n+1}) is given by

1πn∏1≤j<k≤n∣zj−zk∣2,zj∈D={z∈C:∣z∣<1},(2)\frac{1}{\pi^n}\prod_{1\leq j<k\leq n}|z_j-z_k|^2,\qquad z_j\in\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}, \tag*{(2)}

with respect to the Lebesgue measure in the unit disk. Note that Życzkowski and Sommers [29] also computed the joint eigenvalue distribution for the general finite rank truncation of CUE.

From the Vandermonde structure in (2), one can show that the point process distributed according to (2) is a determinantal point process with kernel function given by

KTrunc⁡(Mn+1)(z,w)=1π∑k=0n−1(k+1)zkw‾k,z,w∈D(3)K_{\operatorname{Trunc}(\mathbf{M}_{n+1})}(z,w)=\frac{1}{\pi}\sum_{k=0}^{n-1}(k+1)z^k\overline{w}^k,\qquad z,w\in\mathbb{D} \tag*{(3)}

with respect to the Lebesgue measure on the unit disk. Taking the n→∞n\to\infty limit of the kernel function (3) leads to the classical Bergman kernel on the unit disk

KBergman⁡(z,w)=1π(1−zw‾)2,z,w∈D.(4)K_{\operatorname{Bergman}}(z,w)=\frac{1}{\pi(1-z\overline{w})^2},\qquad z,w\in\mathbb{D}. \tag*{(4)}

The Bergman kernel is related to the study of random analytic functions as follows. Let {ξn,n≥0}\{\xi_n, n \ge0\} be a sequence of i.i.d. standard complex Gaussian variables. Throughout the paper, a complex Gaussian variable ξ\xi is called standard if

E[ξ]=E[ξ2]=0,E[∣ξ∣2]=1.\mathbb{E}[\xi] = \mathbb{E}[\xi^2] = 0,\quad\mathbb{E}[|\xi|^2] = 1.

We define the random Gaussian analytic function (GAF) formally as the random series

fGAF(z)=∑n=0∞ξnzn,z∈D.(5)f_{\mathrm{GAF}}(z) = \sum_{n=0}^{\infty} \xi_n z^n,\quad z \in\mathbb{D}. \tag*{(5)}

In the seminal work [21], Peres and Virág showed that the zero set of fGAF(⋅)f_{\mathrm{GAF}}(\cdot) is a determinantal point process with kernel function given by KBergman(z,w)K_{\mathrm{Bergman}}(z,w).

Putting these results together implies that the eigenvalues of the truncated CUE converge in distribution without any additional scaling to the zeros of fGAF(⋅)f_{\mathrm{GAF}}(\cdot). We call this the bulk scaling limit of the truncated CUE. This convergence was later strengthened in Krishnapur [18] to the convergence of the Blaschke product of the truncated CUE.

Theorem A ([18]). Let Λn={z1,z2,…,zn}\Lambda_n = \{z_1, z_2, \ldots, z_n\} be the eigenvalues of the rank-one truncation of the (n+1)×(n+1)(n+1) \times(n+1) CUE, or equivalently the eigenvalues of Trunc⁡(Circ⁡n+1,2)\operatorname{Trunc}(\operatorname{Circ}_{n+1,2}), and let

Bn(z):=∏k=1nz−zk1−zz‾kB_n(z) := \prod_{k=1}^{n} \frac{z-z_k}{1-z\overline{z}_k}

be the Blaschke product of the eigenvalues. Then

nBn(z)⇒fGAF(z)in distribution as n→∞\sqrt{n}B_n(z) \Rightarrow f_{\mathrm{GAF}}(z) \quad\text{in distribution as } n \to\infty

with respect to the uniform-on-compact topology on D\mathbb{D}.

Note that [18] also provides a generalization of the work [21] by connecting the limit of the eigenvalues of the finite-rank truncation of CUE with the singular points of a matrix-valued Gaussian analytic function.

In [15] Killip and Kozhan studied the truncated circular beta ensemble obtained by removing the first row and column of the matrix models Circ⁡n+1,β\operatorname{Circ}_{n+1,\beta} of Killip-Nenciu [16]. They constructed a sparse matrix model with spectrum distributed as that of Trunc⁡(Circ⁡n+1,β)\operatorname{Trunc}(\operatorname{Circ}_{n+1,\beta}), and showed that the joint eigenvalue density of Trunc⁡(Circ⁡n+1,β)\operatorname{Trunc}(\operatorname{Circ}_{n+1,\beta}) with respect to the Lebesgue measure on the unit disk is given by

βn(2π)n∏1≤j,k≤n∣1−zjz‾k∣β2−1∏j<k≤n∣zj−zk∣2,zj∈D.(6)\frac{\beta^n}{(2\pi)^n} \prod_{1\le j,k\le n} \left|1-z_j\overline{z}_k\right|^{\frac{\beta}{2}-1} \prod_{j<k\le n} |z_j-z_k|^2,\quad z_j \in\mathbb{D}. \tag*{(6)}

We call the resulting distribution the size nn truncated circular beta ensemble. When β=2\beta= 2, equation (6) recovers the joint eigenvalue density (2). However, for general β>0\beta> 0 the truncated circular beta ensemble does not have a nice algebraic structure.

In [20] Li and Valkó derived the edge scaling limit of the normalized characteristic polynomials and the point process limit of the eigenvalues near the point 11 on the boundary of the spectrum. They characterized the limiting point process as the zero set of certain random analytic function, which is related to the stochastic zeta function ζβ(⋅)\zeta_\beta(\cdot) constructed in [28]. Their approach relies on the matrix model representation of the full and truncated circular beta ensembles [16, 15], and the random operator framework for circular ensembles developed by Valkó and Virág [26, 27, 28].

In [20], Li and Valkó also raised the question (Problem 1 in Section 8.2) of whether the characteristic polynomial of the truncated circular beta ensemble has a nice scaling limit in the bulk regime of the spectrum. Our main result fully answers this question and can be viewed as a beta-generalization of Theorem 5 of Krishnapur [18] (see Theorem A for the statement) in the rank-one truncation regime.

Recall the Gaussian analytic function fGAF(⋅)f_{\mathrm{GAF}}(\cdot) defined in (5).

Theorem 1. Fix β>0\beta> 0. Let Λn={z1,z2,…,zn}\Lambda_n = \{z_1,z_2,\ldots,z_n\} be distributed as the size nn truncated circular beta ensemble, and let

Bn(z)≡Bn,β(z):=∏k=1nz−zk1−zzk‾.B_n(z) \equiv B_{n,\beta}(z) := \prod_{k=1}^{n} \frac{z-z_k}{1-z\overline{z_k}}.

be the corresponding Blaschke product. Then we have

nBn(z)⇒2βfGAF(z)in distribution as n→∞(7)\sqrt{n}B_n(z) \Rightarrow\sqrt{\frac{2}{\beta}}f_{\mathrm{GAF}}(z) \quad\text{in distribution as } n \to\infty \tag*{(7)}

with respect to the uniform-on-compact topology on D\mathbb{D}.

Since β\beta appears as a multiplicative constant in (7), we obtain the bulk scaling limit of the truncated circular beta ensemble as follows.

Corollary 2. Let Λn={z1,z2,…,zn}\Lambda_n = \{z_1,z_2,\ldots,z_n\} be distributed as a size nn truncated circular beta ensemble. Let Λ={z∈D:fGAF(z)=0}\Lambda= \{z \in\mathbb{D} : f_{\mathrm{GAF}}(z) = 0\}, then Λn⇒Λ\Lambda_n \Rightarrow\Lambda as n→∞n \to\infty, in the vague topology on locally finite point measures on D\mathbb{D}.

Corollary 2, together with the work of Peres and Virág [21], implies that the limiting point process is determinantal with KBergman(⋅,⋅)K_{\mathrm{Bergman}}(\cdot,\cdot) with respect to the Lebesgue measure on D\mathbb{D}, and is independent of β\beta. More precisely, the kk-th joint intensity of the limiting process is given by

ρk(z1,z2,…,zk)=π−kdet⁡[1(1−zizj‾)2]1≤i,j≤k,zj∈D.\rho_k(z_1,z_2,\ldots,z_k) = \pi^{-k} \det\left[\frac{1}{(1-z_i\overline{z_j})^2}\right]_{1\leq i,j\leq k}, \qquad z_j \in\mathbb{D}.

Using the determinantal structure, one can compute the asymptotics of the hole probability as follows. Let Λn\Lambda_n be distributed as the size nn truncated circular beta ensemble, and for 0<r<10 < r < 1 let Dr={z∈C:∣z∣<r}\mathbb{D}_r = \{z \in\mathbb{C} : |z| < r\}, then we have

lim⁡n→∞P(Λn∩Dr=∅)=P(Λ∩Dr=∅)=∏k=1∞(1−r2k).\lim_{n\to\infty} \mathbb{P}(\Lambda_n \cap\mathbb{D}_r = \varnothing) = \mathbb{P}(\Lambda\cap\mathbb{D}_r = \varnothing) = \prod_{k=1}^{\infty}(1-r^{2k}).

As r↑1r \uparrow1, the hole probability tends to exp⁡(−r2+o(1)12(1−r))\exp\left(-\frac{r^2+o(1)}{12(1-r)}\right), see Corollaries 5.1.7 and 5.1.8 in [13] for more details.

On the other hand, the finite size truncated circular beta ensemble distributed according to (6) has no known determinantal structure for general β≠2\beta\ne2. We prove that the linear statistics of compactly supported functions of the truncated circular beta ensemble are asymptotically independent from the so-called reversed characteristic polynomial, see Section 4 and Proposition 19 for more details.

Our approach also applies to the rank-one multiplicative perturbation of the circular beta ensemble. For a square matrix M\mathbf{M}, consider its multiplicative perturbation

M[r]:=M⋅diag⁡(r,1,1,…,1),r∈[−1,1].(8)\mathbf{M}^{[r]} := \mathbf{M} \cdot\operatorname{diag}(r,1,1,\ldots,1), \qquad r \in[-1,1]. \tag*{(8)}

Note that when r=0r=0 the eigenvalues of M[r]\mathbf{M}^{[r]} consist exactly of the eigenvalues of the truncated matrix Trunc⁡(M)\operatorname{Trunc}(\mathbf{M}) plus an additional eigenvalue at 00, whereas when r=1r=1 we simply have M[r]=M\mathbf{M}^{[r]}=\mathbf{M}. Hence, as rr changes from 00 to 11, the perturbed model M[r]\mathbf{M}^{[r]} can be viewed as an interpolation between the truncated and unperturbed model. The joint eigenvalue distribution of M[r]\mathbf{M}^{[r]} in the case when M\mathbf{M} is a random Haar unitary matrix was derived in [11]. In [10], Forrester and Ipsen studied the n→∞n \to\infty limit of the rank-one multiplicative perturbation of the CUE in the regime when r=rn=O(n−1/2)r=r_n=O(n^{-1/2}). They characterized the limiting point process as the zeros of a certain random Laurent series, and calculated the one- and two-point correlations of the limiting process.

For general β≠2\beta\ne2, one may define the rank-one multiplicative perturbation of the circular beta ensemble as the spectrum of Circ⁡n,β[r]\operatorname{Circ}_{n,\beta}^{[r]} via (8). The joint eigenvalue distribution of Circ⁡n,β[r]\operatorname{Circ}_{n,\beta}^{[r]} was derived in Killip-Kozhan [15]. Using the perturbed matrix model of Killip and Kozhan, and a similar argument as in the proof of Theorem 1, we obtain the scaling limit of the Blaschke product of the rank-one multiplicative perturbation of the circular beta ensemble in the mesoscopic regime rn=O(n−1/2)r_n=O(n^{-1/2}).

Theorem 3. Fix β>0\beta>0, r∈Rr\in\mathbb{R} and set rn=2βnrr_n=\sqrt{\frac{2}{\beta n}}r. For all sufficiently large nn let Bn,β[rn](z):=∏k=1nz−zk1−zzk‾B_{n,\beta}^{[r_n]}(z):=\prod_{k=1}^{n}\frac{z-z_k}{1-z\overline{z_k}} be the Blaschke product of the eigenvalues of the multiplicatively perturbed model Circ⁡n,β[rn]\operatorname{Circ}_{n,\beta}^{[r_n]}. Then we have

nBn,β[rn](z)⇒2β(rη+∑j=1∞ξjzj),in distribution as n→∞(9)\sqrt{n}B_{n,\beta}^{[r_n]}(z)\Rightarrow\sqrt{\frac{2}{\beta}}\left(r\eta+\sum_{j=1}^{\infty}\xi_jz^j\right), \qquad\text{in distribution as }n\to\infty \tag*{(9)}

with respect to the uniform-on-compact topology on D\mathbb{D}. Here ξj\xi_j, j≥1j\geq1 is a sequence of i.i.d. standard complex normal random variables, and η\eta is an independent, uniform random variable on the unit circle.

In particular, the eigenvalues of Circ⁡n,β[rn]\operatorname{Circ}_{n,\beta}^{[r_n]} converge weakly to the zeros of the random series r+zfGAF(z)r+z f_{\mathrm{GAF}}(z). This extends the result of [10] to general $\beta>0.

Outline of the paper: In § 2, we provide a brief introduction of the theory of orthogonal polynomials on the unit circle (OPUC) and the CMV construction for finitely supported probability measures on the unit circle. § 3 includes the proofs of Theorems 1 and 3 on the scaling limit of the Blaschke products of the rank-one truncated and multiplicatively perturbed circular beta ensembles in the bulk regime. § 4 discusses the asymptotic independence of the linear statistics of the truncated circular beta ensembles and the reversed characteristic polynomials.

Acknowledgment: YL is grateful to Benedek Valkó for valuable discussions. YL and JN thank the Institut Mittag-Leffler for its hospitality, where part of this work originated during the program Random Matrices and Scaling Limits in Fall 2024.

AI use statement: ChatGPT was used to proofread and assist with language editing of an earlier version of this paper.

Background

This section presents a brief introduction to the OPUC theory and the CMV matrix constructions for probability measures on the unit circle, as well as a review of the matrix models for the full and truncated circular beta ensembles.

OPUC theory and CMV matrix

We briefly review the necessary background for the OPUC theory and the CMV algorithm. We refer the reader to [24] for a detailed discussion of the subject.

Let μ\mu be a probability measure supported on nn distinct points eiθje^{\mathrm{i}\theta_j}, 1≤j≤n1 \le j \le n on ∂D\partial\mathbb{D}. For 0≤k≤n−10 \le k \le n-1, the kk-th orthogonal polynomial is defined as the unique monic polynomial of degree kk that is orthogonal to 1,z,…,zk−11,z,\ldots,z^{k-1} in L2(dμ)L^2(\mathrm{d}\mu). We extend this definition to Φn(z)=∏j=1n(z−eiθj)\Phi_n(z) = \prod_{j=1}^{n}(z-e^{\mathrm{i}\theta_j}), which can be viewed as the characteristic polynomial of the measure μ\mu. Let Φk∗(z):=zkΦk(1/zˉ)‾\Phi_k^*(z) := z^k\overline{\Phi_k(1/\bar{z})} be the reversed polynomial of Φk\Phi_k for 0≤k≤n0 \le k \le n, then the Szegő recursion states that (see e.g. Section 1.5, vol. 1 of [24]):

\begin{pmatrix}\Phi_{k+1}\\ \Phi_{k+1}^*\end{pmatrix} = \begin{pmatrix}1 & -\bar{\alpha}_k\\ -\alpha_k & 1\end{pmatrix} \begin{pmatrix}z & 0\\ 0 & 1\end{pmatrix} \begin{pmatrix}\Phi_k\\ \Phi_k^*\end{pmatrix}, \qquad \begin{pmatrix}\Phi_0\\ \Phi_0^*\end{pmatrix} = \begin{pmatrix}1\\1\end{pmatrix}, \qquad0 \le k \le n-1. \tag*{(10)}\end{pmatrix}

Here the constants αk\alpha_k, 0≤k≤n−10 \le k \le n-1 are called the Verblunsky coefficients of μ\mu. They satisfy the property that αk∈D\alpha_k \in\mathbb{D} for 0≤k≤n−20 \le k \le n-2 and αn−1∈∂D\alpha_{n-1} \in\partial\mathbb{D}. In fact, the map between probability measures supported on nn points on ∂D\partial\mathbb{D} and the sequence of Verblunsky coefficients (α0,…,αn−1)∈Dn−1×∂D(\alpha_0,\ldots,\alpha_{n-1}) \in\mathbb{D}^{n-1} \times\partial\mathbb{D} is a homeomorphism, see e.g. Theorem 1.7.11 of [24]. Note that a probability measure on the unit circle that is not finitely supported has an infinite sequence of Verblunsky coefficients lying within the unit disk.

Using the Verblunsky coefficients, we are able to construct the so-called CMV matrix corresponding to μ\mu as follows. Definition 4. Let μn\mu_n be a probability measure supported on nn distinct points on the unit circle and let αk\alpha_k, 0≤k≤n−10 \le k \le n-1 be its Verblunsky coefficients obtained via the Szegő recursion (10). Define

Ξk=(αk‾ρkρk−αk),ρk=1−∣αk∣2,0≤k≤n−2\Xi_k=\begin{pmatrix}\overline{\alpha_k} & \rho_k \\ \rho_k & -\alpha_k\end{pmatrix}, \qquad\rho_k=\sqrt{1-\lvert\alpha_k\rvert^2}, \qquad0\le k\le n-2

and set Ξ−1=(1)\Xi_{-1}=(1) and Ξn−1=(αn−1‾)\Xi_{n-1}=(\overline{\alpha_{n-1}}) to be 1×11\times1 matrices. Then we define the CMV matrix corresponding to μn\mu_n or {αk,0≤k≤n−1}\{\alpha_k,0\le k\le n-1\} as

C(α0,…,αn−1):=LM(11)C(\alpha_0,\ldots,\alpha_{n-1}) := \mathcal{L}\mathcal{M} \tag*{(11)}

where L\mathcal{L} and M\mathcal{M} are n×nn\times n block-diagonal matrices

L=diag⁡(Ξ0,Ξ2,…,Ξ2⌊n−12⌋),M=diag⁡(Ξ−1,Ξ1,…,Ξ2⌊n2⌋−1).\mathcal{L}=\operatorname{diag}\left(\Xi_0,\Xi_2,\ldots,\Xi_{2\left\lfloor\frac{n-1}{2}\right\rfloor}\right), \qquad\mathcal{M}=\operatorname{diag}\left(\Xi_{-1},\Xi_1,\ldots,\Xi_{2\left\lfloor\frac{n}{2}\right\rfloor-1}\right).

Note that C(α0,…,αn−1)C(\alpha_0,\ldots,\alpha_{n-1}) is unitary if and only if ∣αn−1∣=1\lvert\alpha_{n-1}\rvert=1. To deal with the rank-one truncation and multiplicative perturbation of random unitary matrices, we also allow αn−1∈D\alpha_{n-1}\in\mathbb{D}, in which case the resulting matrix C(α0,α1,…,αn−1)C(\alpha_0,\alpha_1,\ldots,\alpha_{n-1}) becomes sub-unitary.

In the following proposition, we summarize the connection between CMV matrices, probability measures on ∂D\partial\mathbb{D}, and the orthogonal polynomials associated with these probability measures.

Proposition 5. ([15, 24]) Suppose that U\mathbf{U} is an n×nn\times n unitary matrix for which e1\mathbf{e}_1 is cyclic. Let μ\mu be its spectral measure with respect to e1\mathbf{e}_1, and denote its Verblunsky coefficients by αk\alpha_k, 0≤k≤n−10\le k\le n-1. Then there is a unitary matrix V\mathbf{V} with Ve1=e1\mathbf{V}\mathbf{e}_1=\mathbf{e}_1 so that U=VC(α0,…,αn−1)V−1\mathbf{U}=\mathbf{V}C(\alpha_0,\ldots,\alpha_{n-1})\mathbf{V}^{-1}. Moreover, let Φk\Phi_k, 0≤k≤n0\le k\le n be the monic orthogonal polynomials of μ\mu, then we have

det⁡(zIk−C(α0,…,αk−1))=Φk(z),1≤k≤n.(12)\det\left(zI_k-C(\alpha_0,\ldots,\alpha_{k-1})\right)=\Phi_k(z), \qquad1\le k\le n. \tag*{(12)}

To describe the matrix models for rank-one truncations and multiplicative perturbations of unitary ensembles, we introduce a simple transformation on the sequence of Verblunsky coefficients and the corresponding CMV matrix below.

Definition 6. Suppose μ\mu is a finitely supported probability measure on ∂D\partial\mathbb{D}. Let (α0,…,αn−1)∈Dn−1×∂D(\alpha_0,\ldots,\alpha_{n-1})\in\mathbb{D}^{n-1}\times\partial\mathbb{D} and CC be the corresponding Verblunsky coefficients and the CMV matrix with respect to μ\mu. We define the reversed version of the Verblunsky coefficients as

(α~0,α~1,…,α~n−1):=(−αn−1α‾n−2,−αn−1α‾n−3,…,−αn−1α‾0,αn−1).(13)(\widetilde{\alpha}_0,\widetilde{\alpha}_1,\ldots,\widetilde{\alpha}_{n-1}):=(-\alpha_{n-1}\overline{\alpha}_{n-2},-\alpha_{n-1}\overline{\alpha}_{n-3},\ldots,-\alpha_{n-1}\overline{\alpha}_0,\alpha_{n-1}). \tag*{(13)}

Then we denote by μ~\widetilde{\mu} and C~\widetilde{C} the probability measure and CMV matrix corresponding to the sequence α~k\widetilde{\alpha}_k, 0≤k≤n−10\le k\le n-1. We call μ~\widetilde{\mu} and C~\widetilde{C} the reversed version of μ\mu and CC, respectively.

In Killip-Nenciu [16], it was shown in Proposition B.2 that CC and C~\widetilde{C} have the same eigenvalues. In [15] Killip and Kozhan observed that the truncated and multiplicative perturbation of a CMV matrix is unitarily equivalent to a sub-unitary CMV matrix model.

Proposition 7 ([15]). Consider the same setup as in Proposition 5 so that the unitary matrices U\mathbf{U} and C(α0,…,αn−1)C(\alpha_{0},\ldots,\alpha_{n-1}) are unitarily equivalent, and n≥2n \ge2. Then there exists a unitary matrix V\mathbf{V} such that

Trunc⁡(U)={VC(α~0,…,α~n−2)V−1if n is even,VC(α~0,…,α~n−2)TV−1if n is odd.(14)\operatorname{Trunc}(\mathbf{U}) = \begin{cases} \mathbf{V}C(\widetilde{\alpha}_{0},\ldots,\widetilde{\alpha}_{n-2})\mathbf{V}^{-1} & \text{if } n \text{ is even},\\ \mathbf{V}C(\widetilde{\alpha}_{0},\ldots,\widetilde{\alpha}_{n-2})^{\mathsf{T}}\mathbf{V}^{-1} & \text{if } n \text{ is odd}. \end{cases} \tag*{(14)}

For r∈[−1,1]r \in[-1,1], there exists a unitary matrix V\mathbf{V} such that

U[r]={VC(α~0,…,α~n−2,rα~n−1)V−1if n is even,VC(α~0,…,α~n−2,rα~n−1)TV−1if n is odd.(15)\mathbf{U}^{[r]} = \begin{cases} \mathbf{V}C(\widetilde{\alpha}_{0},\ldots,\widetilde{\alpha}_{n-2},r\widetilde{\alpha}_{n-1})\mathbf{V}^{-1} & \text{if } n \text{ is even},\\ \mathbf{V}C(\widetilde{\alpha}_{0},\ldots,\widetilde{\alpha}_{n-2},r\widetilde{\alpha}_{n-1})^{\mathsf{T}}\mathbf{V}^{-1} & \text{if } n \text{ is odd}. \end{cases} \tag*{(15)}

Matrix models for the full and truncated circular beta ensembles

In this subsection, we explicitly describe the matrix models for the circular beta ensembles constructed by Killip and Nenciu [16], as well as their rank-one truncated and multiplicatively perturbed version introduced by Killip and Kozhan [15].

Recall the definition of the size nn circular beta ensemble with density function (1). We define the size nn Killip-Nenciu measure as a random probability measure on ∂D\partial\mathbb{D} as

μn,βKN=∑j=1nπjeiθj,(16)\mu_{n,\beta}^{\mathrm{KN}} = \sum_{j=1}^{n} \pi_{j} e^{\mathrm{i}\theta_{j}}, \tag*{(16)}

where the support is distributed as the size nn circular beta ensemble, and the weights πj\pi_j, 1≤j≤n1 \le j \le n are chosen according to Dirichlet⁡(β/2,…,β/2)\operatorname{Dirichlet}(\beta/2,\ldots,\beta/2) distribution, independently of the support. The joint distribution of the Verblunsky coefficients with respect to μn,βKN\mu_{n,\beta}^{\mathrm{KN}} was computed in [16].

Proposition 8 ([16]). For fixed nn and β>0\beta> 0, the sequence of Verblunsky coefficients αk\alpha_k, 0≤k≤n−10 \le k \le n-1 of μn,βKN\mu_{n,\beta}^{\mathrm{KN}} are independent, rotationally invariant such that ∣αk∣2∼Beta⁡(1,β2(n−k−1))|\alpha_k|^2 \sim\operatorname{Beta}\left(1,\frac{\beta}{2}(n-k-1)\right) for 0≤k≤n−20 \le k \le n-2 and αn−1∼Unif⁡(∂D)\alpha_{n-1} \sim\operatorname{Unif}(\partial\mathbb{D}).

Recall the reversed version of a sequence of Verblunsky coefficients (13). By the independence and rotational invariance of αk\alpha_k, 0≤k≤n−10 \le k \le n-1, we have α~k\widetilde{\alpha}_k, 0≤k≤n−10 \le k \le n-1 are independent, rotationally invariant such that ∣α~k∣2∼Beta⁡(1,β2(k+1))|\widetilde{\alpha}_k|^2 \sim\operatorname{Beta}\left(1,\frac{\beta}{2}(k+1)\right) for 0≤k≤n−20 \le k \le n-2 and α~n−1∼Unif⁡(∂D)\widetilde{\alpha}_{n-1} \sim\operatorname{Unif}(\partial\mathbb{D}). Note that the spectral weights of the α~k\widetilde{\alpha}_k, 0≤k≤n−10 \le k \le n-1 are no longer Dirichlet-distributed. The advantage of the reversed ordering is that now the Verblunsky coefficients can be coupled in the same probability space. See Assumption 11 below for more discussions. Together with Proposition 7, this yields the following result of Killip and Kozhan [15].

Proposition 9 ([15]). For fixed n≥1n \ge1 and β>0\beta> 0, let αk\alpha_k, 0≤k≤n−10 \le k \le n-1 be independent, rotationally invariant random variables such that ∣αk∣2∼Beta⁡(1,β2(k+1))|\alpha_k|^2 \sim\operatorname{Beta}\left(1,\frac{\beta}{2}(k+1)\right). Then the joint eigenvalue distribution of the sub-unitary CMV matrix C(α0,α1,…,αn−1)C(\alpha_0,\alpha_1,\ldots,\alpha_{n-1}) is the same as that of Trunc⁡(Circ⁡n+1,β)\operatorname{Trunc}(\operatorname{Circ}_{n+1,\beta}), which is given by the size nn truncated circular beta ensemble (6).

Let η∼Unif⁡(∂D)\eta\sim\operatorname{Unif}(\partial\mathbb{D}) be independent of αk\alpha_k, k≥0k \ge0. For fixed r∈[−1,1]r \in[-1,1], the sub-unitary CMV matrix C(α0,α1,…,αn−2,rη)C(\alpha_0,\alpha_1,\ldots,\alpha_{n-2},r\eta) has the same joint eigenvalue distribution as the multiplicatively perturbed model matrix Circ⁡n,β[r]\operatorname{Circ}^{[r]}_{n,\beta}.

Limits of the Blaschke products

This section establishes the scaling limit of the Blaschke product associated with the truncated and multiplicatively perturbed circular beta ensembles. We first show the weak convergence of the Taylor coefficients of the Blaschke products in § 3.1, and then upgrade this to uniform convergence on compacts in law by proving the necessary tightness result in § 3.2. These results yield proofs of Theorem 1 and Corollary 2. Using a similar argument, we complete the proof of Theorem 3 in § 3.3.

Weak convergence of the Taylor coefficients

Recall the Blaschke product defined in Theorem 1. By Propositions 5 and 7, we have

Bn(z)=Φn(z)Φn∗(z).B_n(z) = \frac{\Phi_n(z)}{\Phi_n^*(z)}.

Since the zeros of Φn∗(z)\Phi_n^*(z) lie outside of the unit disk, the Blaschke product Bn(z)B_n(z) is well defined for z∈Dz \in\mathbb{D} and {z∈D:Bn(z)=0}={z∈D:Φn(z)=0}\{z \in\mathbb{D}: B_n(z) = 0\} = \{z \in\mathbb{D}: \Phi_n(z) = 0\}. Expanding Bn(z)B_n(z) in a Taylor series around z=0z = 0, we write

Bn(z)=∑k≥0bk(n)zk,z∈D.B_n(z) = \sum_{k \ge0} b_k^{(n)} z^k,\qquad z \in\mathbb{D}.

The goal of this section is to prove the following statement.

Proposition 10. Under the setup as in Theorem 1, let bk(n)b_k^{(n)} be the kk-th Taylor coefficient of Bn(z)B_n(z). Then for any fixed ℓ≥0\ell\ge0, we have

n(b0(n),b1(n),…,bℓ(n))⇒2β(ξ0,ξ1,…,ξℓ)in law as n→∞,\sqrt{n}\left(b_0^{(n)},b_1^{(n)},\ldots,b_\ell^{(n)}\right) \Rightarrow\sqrt{\frac{2}{\beta}}\left(\xi_0,\xi_1,\ldots,\xi_\ell\right) \quad\text{in law as } n \to\infty,

where ξi\xi_i, 0≤i≤ℓ0 \le i \le\ell are i.i.d. standard complex Gaussian variables.

The proof of Proposition 10 relies on two main ingredients: a martingale structure of the logarithm of the reversed orthogonal polynomials Φn∗\Phi_n^*, and a Gaussian approximation for the Verblunsky coefficients. Throughout the paper, we work with the following probability space.

Assumption 11. Let {αj,j≥0}\{\alpha_j, j \ge0\} be a sequence of independent, rotationally invariant random variables such that

∣αj∣2∼Beta⁡(1,βj),βj=β2(j+1)for j≥0,|\alpha_j|^2 \sim\operatorname{Beta}(1,\beta_j),\qquad\beta_j = \frac{\beta}{2}(j+1)\qquad\text{for } j \ge0,

and set α−1≡−1\alpha_{-1} \equiv-1. Let η∼Unif⁡(∂D)\eta\sim\operatorname{Unif}(\partial\mathbb{D}) be independent of {αj,j≥0}\{\alpha_j, j \ge0\}. In this probability space, we introduce the filtration

Fn=σ(α0,⋯ ,αn−1),n≥0,\mathcal{F}_n = \sigma(\alpha_0,\cdots,\alpha_{n-1}), \qquad n \ge0,

and define the CMV matrices

Cn=C(α0,α1,⋯ ,αn−1),Cn[r]=C(α0,α1,⋯ ,αn−2,rη).C_n = C(\alpha_0,\alpha_1,\cdots,\alpha_{n-1}), \qquad C_n^{[r]} = C(\alpha_0,\alpha_1,\cdots,\alpha_{n-2},r\eta).

By Proposition 9, the eigenvalues of CnC_n and Cn[r]C_n^{[r]}, r∈[−1,1]r \in[-1,1] are distributed as the size nn truncated and multiplicatively perturbed circular beta ensemble, respectively. As already observed in [2, 3], the probability space defined in Assumption 11 provides a natural coupling of full and truncated circular beta ensembles of all dimensions.

Define log⁡Φk∗\log\Phi_k^* as the unique holomorphic logarithm on D\mathbb{D} such that log⁡Φk∗(0)=0\log\Phi_k^*(0)=0. By the Szegő recursion (10), for k≥0k \ge0, z∈Dz \in\mathbb{D} we have

log⁡Φk+1∗(z)=log⁡Φk∗(z)+log⁡(1−αkzΦk(z)Φk∗(z)).\log\Phi_{k+1}^*(z)=\log\Phi_k^*(z)+\log\left(1-\alpha_k z\frac{\Phi_k(z)}{\Phi_k^*(z)}\right).

where we take the principal branch of the logarithm in the second term of the equality. By definition, Φk\Phi_k and Φk∗\Phi_k^* are Fk\mathcal{F}_k-measurable, and αk\alpha_k is independent of Fk\mathcal{F}_k. Using the rotational invariance of αk\alpha_k, the integrability of log⁡(1−∣αk∣)\log(1-|\alpha_k|) and the fact that ∣zBk(z)∣<1|zB_k(z)|<1 for z∈Dz\in\mathbb{D}, one can check that {log⁡Φk∗(z),z∈D}\{\log\Phi_k^*(z),z\in\mathbb{D}\} is a Fk\mathcal{F}_k-martingale. In [14], Jiang and Matsumoto computed the moments of traces of circular beta ensembles and established Central Limit Theorems for linear statistics of polynomials. (See also [19] for a direct proof of the CLTs by the first author.) By controlling the error between log⁡Φn∗\log\Phi_n^* and the logarithm of the reversed characteristic polynomial of the full Cβ\betaE, and by establishing suitable integrability properties of log⁡Φk∗\log\Phi_k^*, Chhaibi and Najnudel [3] characterized the limit log⁡Φ∞∗\log\Phi_\infty^* as follows.

Proposition 12 (Propositions 3.1 and 3.6 of [3]). Let Φk∗\Phi_k^*, k≥0k \ge0 be defined as above. Then we have that log⁡Φk∗\log\Phi_k^* converges to log⁡Φ∞∗\log\Phi_\infty^* a.s. as k→∞k \to\infty, uniformly on compacts in D\mathbb{D}. Moreover, the limit has the same distribution as

log⁡Φ∞∗(z)=d2βGC(z):=2β∑k=1∞zkkξk,\log\Phi_\infty^*(z) \overset{d}{=} \sqrt{\frac{2}{\beta}}G^{\mathbb{C}}(z) := \sqrt{\frac{2}{\beta}}\sum_{k=1}^{\infty}\frac{z^k}{\sqrt{k}}\xi_k,

where ξk\xi_k are i.i.d. standard complex Gaussian variables.

Note that Proposition 3.1 of [3] is stated for β>2\beta>2 due to its connection with Gaussian Multiplicative Chaos on ∂D\partial\mathbb{D}. Applying the arguments used in the proof of Proposition 3.1 of [3] with Proposition 3.6 of [3] and the CLTs for circular beta ensembles established in [14] yields the general convergence result for β>0\beta>0.

We now turn to the Gaussian approximation of the Verblunsky coefficients. The next result follows directly from the rotational invariance and a CLT type approximation for a Beta distributed random variable.

Fact 13. Let α\alpha be a rotationally invariant random variable such that ∣α∣2∼Beta⁡(1,a)|\alpha|^2 \sim\operatorname{Beta}(1,a), then

aα⇒ξ\sqrt{a}\alpha\Rightarrow\xi

in law as a→∞a \to\infty, where ξ\xi is a standard complex Gaussian variable.

Indeed, using the fact that ∣ξ∣2|\xi|^2 has a standard exponential distribution, one can construct an explicit coupling between the Verblunsky coefficients defined in Assumption 11 and an i.i.d. sequence of standard complex Gaussian variables, see Remark 14 below. However, this coupling does not substantially improve the convergence of the Blaschke product. For our purpose, the weak convergence stated in Fact 13 is enough.

We are now ready to prove Proposition 10.

Proof of Proposition 10. By applying Szegő recursion (10) repeatedly, we have

Φn(z)=zΦn−1(z)−α‾n−1Φn−1∗(z)=z2Φn−2(z)−zα‾n−2Φn−2∗(z)−α‾n−1Φn−1∗(z)=⋯=zn−zn−1α‾0Φ0∗(z)−zn−2α‾1Φ1∗(z)−⋯−zα‾n−2Φn−2∗(z)−α‾n−1Φn−1∗(z)=zn−∑j=0n−1α‾n−1−jΦn−1−j∗(z)zj.\begin{aligned} \Phi_n(z) &= z\Phi_{n-1}(z)-\overline{\alpha}_{n-1}\Phi^*_{n-1}(z) \\ &= z^2\Phi_{n-2}(z)-z\overline{\alpha}_{n-2}\Phi^*_{n-2}(z)-\overline{\alpha}_{n-1}\Phi^*_{n-1}(z) \\ &= \cdots\\ &= z^n-z^{n-1}\overline{\alpha}_0\Phi^*_0(z)-z^{n-2}\overline{\alpha}_1\Phi^*_1(z)-\cdots-z\overline{\alpha}_{n-2}\Phi^*_{n-2}(z)-\overline{\alpha}_{n-1}\Phi^*_{n-1}(z) \\ &= z^n-\sum_{j=0}^{n-1}\overline{\alpha}_{n-1-j}\Phi^*_{n-1-j}(z)z^j. \end{aligned}

where we used α−1=−1\alpha_{-1}=-1 by convention and set Φ−1=Φ−1∗=1\Phi_{-1}=\Phi^*_{-1}=1 for the ease of notation. Therefore, we have

nBn(z)=−∑j=0nnα‾n−1−jΦn−1−j∗(z)Φn∗(z)zj.(17)\sqrt{n}B_n(z)=-\sum_{j=0}^{n}\sqrt{n}\overline{\alpha}_{n-1-j}\frac{\Phi^*_{n-1-j}(z)}{\Phi^*_n(z)}z^j. \tag*{(17)}

Recall that bk(n)b_k^{(n)} denotes the Taylor coefficient of BnB_n of degree kk at zero. Fix ℓ≥0\ell\ge0, for any 0<r<10<r<1 and k≤ℓ<nk\le\ell<n, by the residue theorem we have

nbk(n)=12πi∫∣z∣=rnBn(z)dzzk+1=−12πi∑j=0nnα‾n−1−j∫∣z∣=rΦn−1−j∗(z)Φn∗(z)dzzk+1−j.(18)\sqrt{n}b_k^{(n)}=\frac{1}{2\pi i}\int_{|z|=r}\sqrt{n}B_n(z)\frac{dz}{z^{k+1}}=-\frac{1}{2\pi i}\sum_{j=0}^{n}\sqrt{n}\overline{\alpha}_{n-1-j}\int_{|z|=r}\frac{\Phi^*_{n-1-j}(z)}{\Phi^*_n(z)}\frac{dz}{z^{k+1-j}}. \tag*{(18)}

Note that for j>kj>k the integrand on the right hand side of (18) is holomorphic, hence the corresponding integral is zero. Proposition 12 implies that Φn∗\Phi^*_n converges to Φ∞∗\Phi^*_\infty uniformly on compacts in D\mathbb{D}: moreover, Φ∞∗\Phi^*_\infty does not vanish in D\mathbb{D}. Using this convergence, the fact that the zeros of Φk∗\Phi^*_k, k≥0k\ge0 lie outside the unit disk, and Cauchy’s integral formula we obtain that

lim⁡n→∞12πi∫∣z∣=rΦn−1−j∗(z)Φn∗(z)dzzk+1−j=1{j=k}.(19)\lim_{n\to\infty}\frac{1}{2\pi i}\int_{|z|=r}\frac{\Phi^*_{n-1-j}(z)}{\Phi^*_n(z)}\frac{dz}{z^{k+1-j}}=\mathbf{1}_{\{j=k\}}. \tag*{(19)}

Recall the distribution of αk\alpha_k as in Assumption 11, by Fact 13 we have

(nα‾n−1,…,nα‾n−ℓ−1)⇒2β(ξ0,ξ1,…,ξℓ)(20)\left(\sqrt{n}\overline{\alpha}_{n-1},\ldots,\sqrt{n}\overline{\alpha}_{n-\ell-1}\right)\Rightarrow\sqrt{\frac{2}{\beta}}(\xi_0,\xi_1,\ldots,\xi_\ell) \tag*{(20)}

jointly in distribution as n→∞n\to\infty, where ξi\xi_i, 0≤i≤ℓ0\le i\le\ell are i.i.d. standard complex Gaussian variables. Applying Slutsky’s theorem with (19) and (20) completes the proof of the statement. □

We conclude this section with a brief discussion of an explicit coupling between the Verblunsky coefficients and the i.i.d. complex Gaussian variables.

Remark 14. Let ξk\xi_k, k≥0k \ge0 be a sequence of i.i.d. standard complex Gaussian variables. Define

αk:=ξk∣ξk∣1−exp⁡(−βk−1∣ξk∣2),βk:=β2(k+1),k≥0,\alpha_k := \frac{\xi_k}{\lvert\xi_k\rvert}\sqrt{1-\exp\left(-\beta_k^{-1}\lvert\xi_k\rvert^2\right)}, \qquad\beta_k := \frac{\beta}{2}(k+1), \qquad k \ge0,

then one can check that αk\alpha_k, k≥0k \ge0 is a sequence of independent, rotationally invariant random variables such that ∣αk∣2∼Beta⁡(1,βk)\lvert\alpha_k\rvert^2 \sim\operatorname{Beta}(1,\beta_k). For any n≥1n \ge1, let Bn(z)B_n(z) be the Blaschke product of the truncated Cβ\betaE defined via α0,…,αn−1\alpha_0,\ldots,\alpha_{n-1} under this coupling. Define

Gn(z)=−2β(∑j=0n−1ξ‾n−1−jzj+∑j=n∞ξ‾jzj),G_n(z)=-\sqrt{\frac{2}{\beta}}\left(\sum_{j=0}^{n-1}\overline{\xi}_{n-1-j}z^j+\sum_{j=n}^{\infty}\overline{\xi}_jz^j\right),

then Gn=d2βfGAF(z)G_n \mathrel{\overset{d}{=}} \sqrt{\frac{2}{\beta}}f_{\mathrm{GAF}}(z). By the triangle inequality, one can bound the error ∣nBn−Gn∣\lvert\sqrt{n}B_n-G_n\rvert by controlling the following terms

∣nBn+n∑j=0n−1α‾n−1−jzj∣,∣∑j=0n−1(nα‾n−1−j−2βξ‾n−1−j)zj∣,∣∑j≥nξ‾jzj∣.\left\lvert\sqrt{n}B_n+\sqrt{n}\sum_{j=0}^{n-1}\overline{\alpha}_{n-1-j}z^j\right\rvert,\qquad \left\lvert\sum_{j=0}^{n-1}\left(\sqrt{n}\overline{\alpha}_{n-1-j}-\sqrt{\frac{2}{\beta}}\overline{\xi}_{n-1-j}\right)z^j\right\rvert,\qquad \left\lvert\sum_{j\ge n}\overline{\xi}_jz^j\right\rvert.

These terms can be estimated using the bounds on ∣Φn−1−j∗Φn∗−1∣\left\lvert\frac{\Phi_{n-1-j}^*}{\Phi_n^*}-1\right\rvert and ∣nαn−j−1−2βξn−1−j∣\left\lvert\sqrt{n}\alpha_{n-j-1}-\sqrt{\frac{2}{\beta}}\xi_{n-1-j}\right\rvert, and the fact that M=sup⁡k≥0∣ξk∣log⁡(2+k)M=\sup_{k\ge0}\frac{\lvert\xi_k\rvert}{\sqrt{\log(2+k)}} is a.s. finite. Combining these estimates yields an upper bound on ∥nBn(z)−Gn(z)∥r\lVert\sqrt{n}B_n(z)-G_n(z)\rVert_r with an explicit convergence rate. This would lead to ∣nBn(z)−Gn(z)∣→0\lvert\sqrt{n}B_n(z)-G_n(z)\rvert\to0 a.s. uniformly on compacts in D\mathbb{D} as n→∞n\to\infty. However, since the sequence of GAFs Gn(z)G_n(z) varies with nn, this estimate alone would not establish convergence in probability of nBn\sqrt{n}B_n to a fixed GAF. Moreover, the argument relies on the explicit coupling between the Verblunsky coefficients and the i.i.d. standard complex Gaussian variables and could not easily be extended to a more general framework.

Tightness results

Proposition 10 establishes the weak convergence of the Taylor coefficients in the power series. In general, this result alone does not imply the convergence of zeros. For instance, the sequence fn(z)=2n2znf_n(z)=2^{n^2}z^n only converges at zero (see e.g. [18, 13] for more discussions). To complete the proof of Theorem 1, we need to show weak convergence of nBn(⋅)\sqrt{n}B_n(\cdot) with respect to the topology of uniform convergence on compacts in D\mathbb{D}.

We first introduce some notation. Denote by H=H(D)\mathcal{H}=\mathcal{H}(\mathbb{D}) the set of holomorphic functions on the unit disk. Define dHd_{\mathcal{H}} to be the following metric on H\mathcal{H}: for every f,g∈Hf,g\in\mathcal{H}, we define

dH(f,g)=∑m≥12−mmin⁡{1,∥f−g∥rm},∥f∥r:=sup⁡z:∣z∣≤r∣f(z)∣,rm=1−2−m.(21)d_{\mathcal{H}}(f,g)=\sum_{m\ge1}2^{-m}\min\left\{1,\lVert f-g\rVert_{r_m}\right\},\qquad\lVert f\rVert_r:=\sup_{z:\lvert z\rvert\le r}\lvert f(z)\rvert,\qquad r_m=1-2^{-m}. \tag*{(21)}

Note that (H,dH)(\mathcal{H},d_{\mathcal{H}}) is a complete and separable metric space. The following statement gives the required tightness.

Proposition 15. Consider the same setup as in Theorem 1, the Blaschke product nBn(⋅)\sqrt{n}B_n(\cdot), n≥1n \ge1 is tight as a sequence of random analytic functions with respect to the metric dHd_{\mathcal{H}}.

Proof. Recall the Szegő recursion (10), we have

Bn+1(z)=zBn(z)−α‾n1−αnzBn(z).B_{n+1}(z)=\frac{zB_n(z)-\overline{\alpha}_n}{1-\alpha_n zB_n(z)}.

Using the fact that

∣w−z‾1−zw∣≤∣w∣+∣z∣1+∣wz∣≤∣w∣+∣z∣,w,z∈D,\left|\frac{w-\overline{z}}{1-zw}\right|\leq\frac{|w|+|z|}{1+|wz|}\leq|w|+|z|,\qquad w,z\in\mathbb{D},

we get

∣Bn+1(z)∣≤∣zBn(z)∣+∣αn∣.(22)|B_{n+1}(z)|\leq|zB_n(z)|+|\alpha_n|. \tag*{(22)}

For 0<r<10<r<1 recall the norm ∥⋅∥r\|\cdot\|_r defined in (21). By iterating the bound (22) we have

∥Bn∥r≤r∥Bn−1∥r+∣αn−1∣≤⋯≤rn+∑j=0n−1rj∣αn−1−j∣.\|B_n\|_r\leq r\|B_{n-1}\|_r+|\alpha_{n-1}|\leq\cdots\leq r^n+\sum_{j=0}^{n-1}r^j|\alpha_{n-1-j}|.

Recall that ∣αk∣2∼Beta⁡(1,βk)|\alpha_k|^2\sim\operatorname{Beta}(1,\beta_k), we have E[∣αk∣2]=11+βk\mathbb{E}[|\alpha_k|^2]=\frac{1}{1+\beta_k} with βk=β2(k+1)\beta_k=\frac{\beta}{2}(k+1). By Minkowski’s inequality we have

E[∥nBn∥r2]1/2≤cβn∑j=0nrjn+1−j,\mathbb{E}[\|\sqrt{n}B_n\|_r^2]^{1/2}\leq c_\beta\sqrt{n}\sum_{j=0}^{n}\frac{r^j}{\sqrt{n+1-j}},

where cβc_\beta is a constant depending only on β\beta. By splitting the summation at j=⌊n/2⌋j=\lfloor n/2\rfloor, we can find a deterministic constant c>0c>0 such that

n∑j=0⌊n/2⌋rjn+1−j≤c1−r,n∑j=⌊n/2⌋+1nrjn+1−j≤cnrn/2.\sqrt{n}\sum_{j=0}^{\lfloor n/2\rfloor}\frac{r^j}{\sqrt{n+1-j}}\leq\frac{c}{1-r},\qquad \sqrt{n}\sum_{j=\lfloor n/2\rfloor+1}^{n}\frac{r^j}{\sqrt{n+1-j}}\leq cnr^{n/2}.

Since nrn/2≤11−rnr^{n/2}\leq\frac{1}{1-r}, we may enlarge cβc_\beta (if necessary) to conclude that

E[∥nBn∥r2]≤cβ(1−r)2,\mathbb{E}[\|\sqrt{n}B_n\|_r^2]\leq\frac{c_\beta}{(1-r)^2},

uniformly in nn. We claim that this uniform bound also implies the tightness of the sequence nBn,n≥1\sqrt{n}B_n,n\geq1. Indeed, for any ε>0\varepsilon>0, we set Mm,ε=cβ23mεM_{m,\varepsilon}=\sqrt{\frac{c_\beta2^{3m}}{\varepsilon}} and consider the compact set Hε:=⋂m≥1{f∈H:∥f∥rm≤Mm,ε}\mathcal{H}_\varepsilon:=\bigcap_{m\geq1}\{f\in\mathcal{H}:\|f\|_{r_m}\leq M_{m,\varepsilon}\}. By Markov’s inequality, we have

P(∥nBn∥rm≥Mm,ε)≤ε2−m.\mathbb{P}(\|\sqrt{n}B_n\|_{r_m}\geq M_{m,\varepsilon})\leq\varepsilon2^{-m}.

Taking the union bound in mm gives that P(nBn∉Hε)≤ε\mathbb{P}(\sqrt{n}B_n\notin\mathcal{H}_\varepsilon)\leq\varepsilon for all nn. This completes the proof of the statement.

We are now ready to prove Theorem 1.

Proof of Theorem 1. Proposition 10 proves the weak convergence of the Taylor coefficients in the power series, and identifies any subsequential limit. Proposition 15 gives the necessary tightness to conclude the convergence in distribution in H\mathcal{H}, with respect to the topology of uniform convergence on compact sets of D\mathbb{D}. Combining these two results completes the proof.

To prove Corollary 2, we invoke the following fact from complex analysis.

Fact 16. For f∈H∖{0}f \in\mathcal{H} \setminus\{0\}, let Z(f)=∑w∈D:f(w)=0mult⁡f(w)δw\mathcal{Z}(f) = \sum_{w\in\mathbb{D}:f(w)=0} \operatorname{mult}_{f}(w)\delta_{w}, where mult⁡f(w)\operatorname{mult}_{f}(w) counts the multiplicity of the zero ww. Then the map Z\mathcal{Z} is continuous from H∖{0}\mathcal{H}\setminus\{0\} with the topology of uniform convergence on compact sets of D\mathbb{D}, to the space of locally finite point measures on D\mathbb{D} with respect to the vague topology.

Consequently, if fnf_n, n≥1n \ge1 and ff are random holomorphic functions that are a.s. not identically equal to 00, and fn⇒ff_n \Rightarrow f in law as n→∞n \to\infty with respect to the topology of uniform convergence on compact sets of D\mathbb{D}, then Z(fn)⇒Z(f)\mathcal{Z}(f_n) \Rightarrow\mathcal{Z}(f) in the vague topology.

Proof. The deterministic statement follows from Hurwitz’s theorem (see e.g. Theorem VII.2.5 in [5]). The probabilistic statement then follows from the continuous mapping theorem.

Proof of Corollary 2. Since Bn(z)B_n(z), n≥1n \ge1 and fGAF(z)f_{\mathrm{GAF}}(z) are a.s. not identically zero, the statement follows from Theorem 1 and Fact 16.

Limits of the multiplicatively perturbed circular beta ensemble

Recall the rank-one multiplicative perturbation of a unitary matrix M\mathbf{M} defined in (8). In [10], Forrester and Ipsen studied the asymptotic behavior of the zeros of Mn[rn]\mathbf{M}_n^{[r_n]}, where Mn\mathbf{M}_n is a size nn CUE (corresponding to the β=2\beta= 2 case) and rn=O(n−1/2)r_n = O(n^{-1/2}). Their result can be summarized as follows.

Proposition 17 ([10]). Let Mn∈U(n)\mathbf{M}_n \in U(n) be uniformly chosen with Haar measure on U(n)U(n), and set rn=r/nr_n = r/\sqrt{n} with rr fixed. Then the eigenvalues of Mn[rn]\mathbf{M}_n^{[r_n]} converge weakly as n→∞n \to\infty to the zeros of the random series

fGAF,r(z):=r+∑j=1∞ξjzj,(23)f_{\mathrm{GAF},r}(z) := r + \sum_{j=1}^{\infty} \xi_j z^j, \tag*{(23)}

Here ξj\xi_j, j≥1j \ge1 is a sequence of i.i.d. standard complex Gaussian variables.

The function fGAF,r(⋅)f_{\mathrm{GAF},r}(\cdot) can be viewed as the Gaussian analytic function fGAF(⋅)f_{\mathrm{GAF}}(\cdot) conditioned on its value at 0. Following the result of Forrester and Ipsen, it is natural to study the asymptotic behavior of zeros of the rank-one multiplicative perturbation of the circular beta ensemble for general β>0\beta> 0. To this end, we derive the scaling limit of the normalized Blaschke product of the perturbed model using an argument similar to the proof of Theorem 1. This convergence is strong enough to extend Proposition 17 to general β>0\beta> 0.

Proof of Theorem 3. Fix r∈Rr \in\mathbb{R} and we assume nn is large enough such that ∣rn∣=∣2βnr∣<1|r_n| = \left|\sqrt{\frac{2}{\beta n}}r\right| < 1. Let αk\alpha_k, k≥0k \ge0 and η\eta be defined as in Assumption 11. By Propositions 7 and 9, the eigenvalues of Circ⁡n,β[rn]\operatorname{Circ}_{n,\beta}^{[r_n]} have the same joint distribution as the (sub-unitary) CMV matrix C(α0,…,αn−2,rnη)\mathcal{C}(\alpha_0,\ldots,\alpha_{n-2},r_n\eta).

Let Φk[rn]\Phi_k^{[r_n]}, 0≤k≤n0 \le k \le n be the monic orthogonal polynomials with respect to the sequence of Verblunsky coefficients (α0,α1,…,αn−2,rnη)(\alpha_0,\alpha_1,\ldots,\alpha_{n-2},r_n\eta), and let (Φk[rn])∗(\Phi_k^{[r_n]})^* be the associated reversed polynomials. By the Szegő recursion (10), these polynomials do not depend on rr for 0≤k≤n−10 \le k \le n-1, and we may therefore suppress the rr-dependence in the notation for these functions. Consequently, Theorem 1 and Proposition 12 remain valid for the sequences Bn−1B_{n-1} and (Φn−1[rn])∗=Φn−1∗(\Phi_{n-1}^{[r_n]})^*=\Phi_{n-1}^*.

Applying Szegő recursion (10) to Φn[rn]\Phi_n^{[r_n]} and (Φn[rn])∗(\Phi_n^{[r_n]})^*, we have

Φn[rn](z)=zΦn−1(z)−rnηˉΦn−1∗(z),(Φn[rn])∗(z)=Φn−1∗(z)−zrnηΦn−1(z).\Phi_n^{[r_n]}(z)=z\Phi_{n-1}(z)-r_n\bar{\eta}\Phi_{n-1}^*(z), \qquad(\Phi_n^{[r_n]})^*(z)=\Phi_{n-1}^*(z)-zr_n\eta\Phi_{n-1}(z).

hence

nBn[rn](z)=nΦn[rn](z)(Φn[rn])∗(z)=znBn−1(z)−2βrηˉ1−rnηzBn−1(z).\sqrt{n}B_n^{[r_n]}(z)=\sqrt{n}\frac{\Phi_n^{[r_n]}(z)}{(\Phi_n^{[r_n]})^*(z)}=\frac{z\sqrt{n}B_{n-1}(z)-\sqrt{\frac{2}{\beta}}r\bar{\eta}}{1-r_n\eta zB_{n-1}(z)}.

Since rn=O(n−1/2)r_n=O(n^{-1/2}) and ∣Bn−1(z)∣<1|B_{n-1}(z)|<1 for z∈Dz\in\mathbb{D}, the denominator converges to 1 uniformly on compact sets of D\mathbb{D} (see also Theorem 1.7.4 of [24]). By Theorem 1, Slutsky’s theorem and the independence of η\eta from Bn−1B_{n-1}, we conclude that

nBn[rn](z)⇒2β(zfGAF(z)−rηˉ)\sqrt{n}B_n^{[r_n]}(z)\Rightarrow\sqrt{\frac{2}{\beta}}\left(zf_{\mathrm{GAF}}(z)-r\bar{\eta}\right)

in distribution as n→∞n\to\infty uniformly on compact sets of D\mathbb{D}. Since zfGAF(z)−rηˉ=drη+∑j=1∞ξjzjzf_{\mathrm{GAF}}(z)-r\bar{\eta}\overset{d}{=}r\eta+\sum_{j=1}^{\infty}\xi_jz^j, we conclude the proof of Theorem 3.

Repeating the proof of Corollary 2 and applying Theorem 3, we conclude that the zeros of the multiplicatively perturbed Cβ\betaE converge to those of the random series zfGAF(z)−rηˉzf_{\mathrm{GAF}}(z)-r\bar{\eta}, independent of β\beta. Using the fact that the Gaussian variables are rotation invariant, the limiting zero set has the same distribution as the zero set of the conditional Gaussian series fGAF,r(⋅)f_{\mathrm{GAF},r}(\cdot) as claimed. □\square

Asymptotic independence of Φn∗\Phi_n^* and the bulk zeros

Let Λn={z1(n),z2(n),…,zn(n)}\Lambda_n=\{z_1^{(n)},z_2^{(n)},\ldots,z_n^{(n)}\} be distributed according to the size nn truncated Cβ\betaE and set Λ={z∈D:fGAF(z)=0}\Lambda=\{z\in\mathbb{D}:f_{\mathrm{GAF}}(z)=0\}. Recall the reversed characteristic polynomial Φn∗\Phi_n^* of Λn\Lambda_n. The goal of this section is to prove the asymptotic independence of Φn∗\Phi_n^* and the linear statistics of Λn\Lambda_n of compactly supported test functions. Heuristically speaking, the reversed polynomial Φk∗\Phi_k^* is determined by the first kk Verblunsky coefficients, and is close to its limit Φ∞∗\Phi_\infty^* when kk is sufficiently large (see Proposition 12). In contrast, the bulk zeros, namely those lying inside a compact subset of D\mathbb{D}, are mainly determined by the first few terms in the series expansion of nBn\sqrt{n}B_n. As shown in Proposition 10, these Taylor coefficients depend on the Verblunsky coefficients in reverse order.

Before we present the result, let us introduce a sequence of auxiliary functions

Bm(m)=0,Bn+1(m)(z)=zBn(m)(z)−αn‾1−αnzBn(m)(z),n≥m.(24)B_m^{(m)}=0,\qquad B_{n+1}^{(m)}(z)=\frac{zB_n^{(m)}(z)-\overline{\alpha_n}}{1-\alpha_n zB_n^{(m)}(z)},\qquad n\ge m. \tag*{(24)}

The function Bn(m)B_n^{(m)} depends on αm,αm+1,⋯ ,αn−1\alpha_m,\alpha_{m+1},\cdots,\alpha_{n-1}, and is independent of Fm\mathcal{F}_m. By the inequality ∣w−z‾∣≤∣1−wz∣|w-\overline{z}|\leq|1-wz|, it is direct to check that ∣Bn(m)∣≤1|B_n^{(m)}|\leq1 on D\mathbb{D}. Recall the metric dHd_{\mathcal{H}} defined in (21), we obtain the following bound on Bn−Bn(m)B_n-B_n^{(m)}.

Proposition 18. Consider the probability space defined in Assumption 11. For 0<r<10<r<1 and m<nm<n, we have

∥Bn−Bn(m)∥r≤2rn−m.\|B_n-B_n^{(m)}\|_r\leq2r^{n-m}.

Moreover, for any fixed mm, we have dH(nBn,nBn(m))→0d_{\mathcal{H}}(\sqrt{n}B_n,\sqrt{n}B_n^{(m)})\to0 a.s. as n→∞n\to\infty.

Proof. By definition, we have

Bn+1(z)−Bn+1(m)(z)=ρn2z(Bn(z)−Bn(m)(z))(1−αnzBn(z))(1−αnzBn(m)(z)).B_{n+1}(z)-B_{n+1}^{(m)}(z)=\frac{\rho_n^2z(B_n(z)-B_n^{(m)}(z))}{(1-\alpha_nzB_n(z))(1-\alpha_nzB_n^{(m)}(z))}.

Since ∣Bn(z)∣≤1,∣Bn(m)(z)∣≤1|B_n(z)|\leq1,|B_n^{(m)}(z)|\leq1 for z∈Dz\in\mathbb{D}, we get the difference Bn+1−Bn+1(m)B_{n+1}-B_{n+1}^{(m)} is a multiple of zz. By induction, one can check that Bn−Bn(m)B_n-B_n^{(m)} is a multiple of zn−mz^{n-m}, i.e., it has a zero of order at least n−mn-m at z=0z=0. This implies that the first n−mn-m Taylor coefficients of BnB_n and Bn(m)B_n^{(m)} agree with each other. Repeating the proof of the Schwarz lemma proves the first claim. More precisely, let g(z)=z−(n−m)(Bn(z)−Bn(m)(z))g(z)=z^{-(n-m)}(B_n(z)-B_n^{(m)}(z)). For ∣z∣=r<1|z|=r<1, by the maximum principle we have ∣g(z)∣≤2r−(n−m)|g(z)|\leq2r^{-(n-m)}. Letting r↑1r\uparrow1 yields that ∣Bn(z)−Bn(m)(z)∣≤2∣z∣n−m|B_n(z)-B_n^{(m)}(z)|\leq2|z|^{n-m} as claimed.

We now prove the second claim. For n>mn>m we have

dH(nBn,nBn(m))≤∑j≥12−jmin⁡{1,2nrjn−m}≤2∫01min⁡{1,2nrn−m} dr.d_{\mathcal{H}}(\sqrt{n}B_n,\sqrt{n}B_n^{(m)})\leq\sum_{j\geq1}2^{-j}\min\{1,2\sqrt{n}r_j^{n-m}\}\leq2\int_0^1\min\{1,2\sqrt{n}r^{n-m}\}\,dr.

By splitting the integral at r0=(2n)−1/(n−m)r_0=(2\sqrt{n})^{-1/(n-m)}, we get the upper bound

dH(nBn,nBn(m))≤2(r0n−m+1+1−r0)≤c(1+log⁡n)n−m+1,d_{\mathcal{H}}(\sqrt{n}B_n,\sqrt{n}B_n^{(m)})\leq2\left(\frac{r_0}{n-m+1}+1-r_0\right)\leq\frac{c(1+\log n)}{n-m+1},

where cc is an absolute constant independent of n,mn,m. Sending n→∞n\to\infty completes the proof. \quad \square

For a continuous function gg with compact support inside the unit disk, we denote by Lg(Λn):=∑z∈Λng(z)L_g(\Lambda_n):=\sum_{z\in\Lambda_n}g(z) the linear statistics of Λn\Lambda_n. The next result proves the asymptotic independence of (Φn∗,Lg(Λn))∈H×C(\Phi_n^*,L_g(\Lambda_n))\in\mathcal{H}\times\mathbb{C}.

Proposition 19. Consider the probability space in Assumption 11. For any continuous compactly supported test function gg, we have (Φn∗,Lg(Λn))⇒(Φ∞∗,Lg(Λ))(\Phi_n^*,L_g(\Lambda_n))\Rightarrow(\Phi_\infty^*,L_g(\Lambda)), where the limit Lg(Λ)=∑z∈Λg(z)L_g(\Lambda)=\sum_{z\in\Lambda}g(z) is independent of Φ∞∗\Phi_\infty^*.

Proof. By Corollary 2 and Proposition 12, we have the marginal convergence Lg(Λn)⇒Lg(Λ)L_g(\Lambda_n) \Rightarrow L_g(\Lambda) and Φn∗→Φ∞∗\Phi_n^* \to\Phi_\infty^* a.s. uniformly on compacts as n→∞n \to\infty. It remains to prove the joint convergence.

For any fixed mm, recall the auxiliary function Bn(m)B_n^{(m)} defined in (24). For n>mn > m we set Λn(m)={z∈D:Bn(m)(z)=0}\Lambda_n^{(m)} = \{z \in\mathbb{D}: B_n^{(m)}(z) = 0\}, and Lg(Λn(m))=∑z∈Λn(m)g(z)L_g(\Lambda_n^{(m)}) = \sum_{z \in\Lambda_n^{(m)}} g(z). By definition, we have Λn(m)\Lambda_n^{(m)} and Lg(Λn(m))L_g(\Lambda_n^{(m)}) are independent of Fm\mathcal{F}_m.

Let F:H(D)→CF:\mathcal{H}(\mathbb{D}) \to\mathbb{C} and G:C→CG:\mathbb{C} \to\mathbb{C} be bounded continuous functions. By the triangle inequality we have

∣E[F(Φn∗)G(Lg(Λn))]−E[F(Φ∞∗)]E[G(Lg(Λ))]∣≤E[∣(F(Φn∗)−F(Φm∗))G(Lg(Λn))∣]+E[∣F(Φm∗)(G(Lg(Λn))−G(Lg(Λn(m))))∣]+∣E[F(Φm∗)]−E[F(Φ∞∗)]∣E[∣G(Lg(Λn(m)))∣]+E[∣F(Φ∞∗)∣]∣E[G(Lg(Λn(m)))]−E[G(Lg(Λ))]∣.(25)\begin{aligned} &\left|\mathbb{E}[F(\Phi_n^*)G(L_g(\Lambda_n))]-\mathbb{E}[F(\Phi_\infty^*)]\mathbb{E}[G(L_g(\Lambda))]\right|\\ &\leq\mathbb{E}\left[\left|(F(\Phi_n^*)-F(\Phi_m^*))G(L_g(\Lambda_n))\right|\right]\\ &\quad+\mathbb{E}\left[\left|F(\Phi_m^*)(G(L_g(\Lambda_n))-G(L_g(\Lambda_n^{(m)})))\right|\right]\\ &\quad+\left|\mathbb{E}[F(\Phi_m^*)]-\mathbb{E}[F(\Phi_\infty^*)]\right|\mathbb{E}\left[|G(L_g(\Lambda_n^{(m)}))|\right]\\ &\quad+\mathbb{E}[|F(\Phi_\infty^*)|]\left|\mathbb{E}[G(L_g(\Lambda_n^{(m)}))]-\mathbb{E}[G(L_g(\Lambda))]\right|. \tag*{(25)} \end{aligned}

where in (26) we used the fact that Φm∗\Phi_m^* is independent of Λn(m)\Lambda_n^{(m)}. By Theorem 1 and Proposition 18, we have

(nBn,nBn(m))⇒(X,X)∈H×H,X=d2βfGAF,(\sqrt{n}B_n,\sqrt{n}B_n^{(m)})\Rightarrow(X,X)\in\mathcal{H}\times\mathcal{H},\qquad X\mathrel{\stackrel{d}{=}}\sqrt{\frac{2}{\beta}}f_{\mathrm{GAF}},

in law as n→∞n\to\infty, with respect to the topology of uniform convergence on compact sets of D\mathbb{D}. By Fact 16 again, we have (Lg(Λn),Lg(Λn(m)))⇒(Lg(Λ),Lg(Λ))(L_g(\Lambda_n),L_g(\Lambda_n^{(m)}))\Rightarrow(L_g(\Lambda),L_g(\Lambda)), and Λn(m)⇒Λ\Lambda_n^{(m)}\Rightarrow\Lambda as n→∞n\to\infty in the vague topology on locally finite point measures on D\mathbb{D}. Hence, for any fixed mm we have

E[∣G(Lg(Λn))−G(Lg(Λn(m)))∣]→0,E[G(Lg(Λn(m)))]→E[G(Lg(Λ))],\mathbb{E}\left[\left|G(L_g(\Lambda_n))-G(L_g(\Lambda_n^{(m)}))\right|\right]\to0,\qquad\mathbb{E}[G(L_g(\Lambda_n^{(m)}))]\to\mathbb{E}[G(L_g(\Lambda))],

as n→∞n\to\infty. Therefore, we have

lim sup⁡n→∞∣E[F(Φn∗)G(Lg(Λn))]−E[F(Φ∞∗)]E[G(Lg(Λ))]∣≤2∥G∥∞E[∣F(Φ∞∗)−F(Φm∗)∣].\limsup_{n\to\infty}\left|\mathbb{E}[F(\Phi_n^*)G(L_g(\Lambda_n))]-\mathbb{E}[F(\Phi_\infty^*)]\mathbb{E}[G(L_g(\Lambda))]\right| \leq2\|G\|_\infty\mathbb{E}[|F(\Phi_\infty^*)-F(\Phi_m^*)|].

Sending m→∞m\to\infty and using the a.s. uniformly on compacts convergence of Φm∗→Φ∞∗\Phi_m^*\to\Phi_\infty^* in Proposition 12 completes the proof. □

Note that by applying the argument used in the proof of Proposition 19 to functionals of (Φn∗,nBn)(\Phi_n^*,\sqrt{n}B_n), one obtains the joint convergence

(Φn∗,nBn)⇒(Φ∞∗,2βfGAF),in law as n→∞,(26)(\Phi_n^*,\sqrt{n}B_n)\Rightarrow\left(\Phi_\infty^*,\sqrt{\frac{2}{\beta}}f_{\mathrm{GAF}}\right),\qquad\text{in law as }n\to\infty, \tag*{(26)}

with respect to the compact-open topology, where the limiting functions Φ∞∗\Phi_\infty^* and fGAFf_{\mathrm{GAF}} are independent. Using the fact that multiplication is continuous with respect to the compact-open topology, one may further deduce that

nΦn⇒2βexp⁡(2β∑j≥1ζjjzj)⋅(∑j≥0ξjzj)\sqrt{n}\Phi_n\Rightarrow\sqrt{\frac{2}{\beta}}\exp\left(\sqrt{\frac{2}{\beta}}\sum_{j\geq1}\frac{\zeta_j}{\sqrt{j}}z^j\right)\cdot\left(\sum_{j\geq0}\xi_jz^j\right)

in law as n→∞n \to\infty, with respect to the topology of uniform convergence on compact sets of D\mathbb{D}. Here ζj\zeta_j, j≥1j \ge1 and ξj\xi_j, j≥0j \ge0 are two sequences of i.i.d. standard complex Gaussian variables and are independent of each other.

We conclude the paper with a discussion of the possible extensions of our results.

Remark 20. Our results can be generalized to a large class of sequences of Verblunsky coefficients. Following the approach used in Propositions 10 and 15, we require a scaling limit (in distribution) and suitable moment bounds for the Verblunsky coefficients, together with the uniform-on-compact convergence of log⁡Φn∗\log\Phi_n^* to a limit log⁡Φ∞∗\log\Phi_\infty^*. In particular, we believe that our methods can be adapted to study the bulk limit of the rank-one truncations of the circular Jacobi beta ensemble and real orthogonal beta ensemble.

In [20], Li and Valkó also raised the question of the scaling limit of multi-rank truncation of circular ensembles. We expect the bulk limit to be a beta-generalization of Krishnapur’s result on the matrix-valued Gaussian analytic functions [18]. We leave these extensions for future work.

Yun Li, School of Mathematical Sciences, Nankai University, China. Email: [email protected]

Mingchang Liu, Academy for Multidisciplinary Studies, Capital Normal University, China Email: [email protected]

Joseph Najnudel, School of Mathematics, University of Bristol, United Kingdom Email: [email protected]

References

  1. [1]Maria J. Cantero, Leandro Moral, and Luis Velázquez. Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle. Linear Algebra and its Applications, 362:29–56, 2003.DOI
  2. [2]Reda Chhaibi, Thomas Madaule, and Joseph Najnudel. On the maximum of the CβE field. Duke Mathematical Journal, 167(12):2243 – 2345, 2018.DOI
  3. [3]Reda Chhaibi and Joseph Najnudel. On the circle, Gaussian multiplicative chaos and Beta ensembles match exactly. Journal of the European Mathematical Society, 28(1):1–77, 2026.DOI
  4. [4]Reda Chhaibi, Joseph Najnudel, and Ashkan Nikeghbali. The Circular Unitary Ensemble and the Riemann zeta function: the microscopic landscape and a new approach to ratios. Inventiones mathematicae, 207(1):23–113, 2017.DOI
  5. [5]John B. Conway. Functions of One Complex Variable I, volume 11 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2 edition, 1978.
  6. [6]Ioana Dumitriu and Alan Edelman. Matrix models for beta ensembles. J. Math. Phys., 43(11):5830–5847, 2002.
  7. [7]Alan Edelman and Brian D. Sutton. From random matrices to stochastic operators. J. Stat. Phys., 127(6):1121–1165, 2007.DOI
  8. [8]Peter J. Forrester. Log-gases and random matrices (LMS-34). Princeton University Press, 2010.DOI
  9. [9]Peter J. Forrester. Rank 1 perturbations in random matrix theory — A review of exact results. Random Matrices: Theory and Applications, aug 2023.arxiv.org/abs/2201.00324
  10. [10]Peter J. Forrester and Jesper R Ipsen. A generalisation of the relation between zeros of the complex Kac polynomial and eigenvalues of truncated unitary matrices. Probability Theory and Related Fields, 175(3):833–847, 2019.arxiv.org/abs/1807.06743
  11. [11]Yan V. Fyodorov. Spectra of random matrices close to unitary and scattering theory for discrete-time systems. In AIP Conference Proceedings, volume 553, pages 191–196. American Institute of Physics, 2001.DOI
  12. [12]Yan V. Fyodorov and Hans-Jürgen Sommers. Random matrices close to Hermitian or unitary: overview of methods and results. Journal of Physics A: Mathematical and General, 36(12):3303, 2003.DOI
  13. [13]John Ben Hough, Manjunath Krishnapur, Yuval Peres, and Bálint Virág. Zeros of Gaussian analytic functions and determinantal point processes, volume 51. American Mathematical Soc., 2009.DOI
  14. [14]Tiefeng Jiang and Sho Matsumoto. Moments of traces of circular beta-ensembles. Ann. Probab., 43(6):3279–3336, 2015.DOI
  15. [15]Rowan Killip and Rostyslav Kozhan. Matrix models and eigenvalue statistics for truncations of classical ensembles of random unitary matrices. Communications in Mathematical Physics, 349(3):991–1027, 2017.DOI
  16. [16]Rowan Killip and Irina Nenciu. Matrix models for circular ensembles. International Mathematics Research Notices, 2004(50):2665–2701, 2004.
  17. [17]Rowan Killip and Mihai Stoiciu. Eigenvalue statistics for CMV matrices: from Poisson to clock via random matrix ensembles. Duke Math. J., 146(3):361–399, 2009.DOI
  18. [18]Manjunath Krishnapur. From random matrices to random analytic functions. Ann. Probab., 37:314–346, 2009.arxiv.org/abs/0711.1378
  19. [19]Yun Li. Gaussian limits for traces of circular beta-ensembles. arXiv preprint arXiv:2610.01803, 2026.arxiv.org/abs/2610.01803
  20. [20]Yun Li and Benedek Valkó. Edge limits of truncated circular beta ensembles. Electronic Journal of Probability, 30:1–46, 2025.arxiv.org/abs/2310.14995
  21. [21]Yuval Peres and Bálint Virág. Zeros of the iid Gaussian power series: a conformally invariant determinantal process. Acta Mathematica, 194(1):1–35, 2005.
  22. [22]José A. Ramírez and Brian Rider. Diffusion at the random matrix hard edge. Comm. Math. Phys., 288(3):887–906, 2009.DOI
  23. [23]José A. Ramírez, Brian Rider, and Bálint Virág. Beta ensembles, stochastic Airy spectrum, and a diffusion. J. Amer. Math. Soc., 24(4):919–944, 2011.DOI
  24. [24]Barry Simon. Orthogonal polynomials on the unit circle. Part 1, volume 54 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 2005. Classical theory.
  25. [25]Benedek Valkó and Bálint Virág. Continuum limits of random matrices and the Brownian carousel. Inventiones Math., 177:463–508, 2009.DOI
  26. [26]Benedek Valkó and Bálint Virág. The Sineβ operator. Inventiones mathematicae, 209(1):275–327, 2017.
  27. [27]Benedek Valkó and Bálint Virág. Operator limit of the circular beta ensemble. The Annals of Probability, 48(3):1286–1316, 2020.DOI
  28. [28]Benedek Valkó and Bálint Virág. The many faces of the stochastic zeta function. Geometric and Functional Analysis, 32(5):1160–1231, 2022.DOI
  29. [29]Karol Życzkowski and Hans-Jürgen Sommers. Truncations of random unitary matrices. Journal of Physics A: Mathematical and General, 33(10):2045, 2000.DOI

Paper details

vlnc:W_5afsf4fk
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 6

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

ChatGPT · View statement →

Looking for related papers…
Contents