WorksMathematics
Bulk limits of the truncated circular beta ensembles
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 circular beta ensemble with parameter is the distribution of points on the unit circle with joint probability density
where is an explicit normalizing constant (see e.g. Section 2.8 of [8]). When , (1) recovers the joint eigenvalue density of a uniformly chosen unitary matrix, known as the size 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 point process, is a translation invariant determinantal point process on . In [4] Chhaibi, Najnudel and Nikeghbali studied the local scaling limit of the (normalized) characteristic polynomials of CUE, and constructed a random analytic function (called the stochastic zeta function) so that its zero set has the same distribution as the point process.
When , the joint density (1) corresponds to certain random unitary matrices invariant under symmetric/self-dual transformations. For general , 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 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 point process. They showed that the Sine 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 with zero set given by the Sine 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 . 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 case. Throughout the paper, for a square unitary matrix we denote by the matrix obtained by removing the first row and column from . Since the truncation map corresponds to a projection, the eigenvalues of the resulting matrix have modulus less than or equal to one.
Consider the case when is a uniformly chosen unitary matrix with respect to the Haar measure on the unitary group . In [29] Życzkowski and Sommers proved that the joint eigenvalue density of is given by
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
with respect to the Lebesgue measure on the unit disk. Taking the limit of the kernel function (3) leads to the classical Bergman kernel on the unit disk
The Bergman kernel is related to the study of random analytic functions as follows. Let be a sequence of i.i.d. standard complex Gaussian variables. Throughout the paper, a complex Gaussian variable is called standard if
We define the random Gaussian analytic function (GAF) formally as the random series
In the seminal work [21], Peres and Virág showed that the zero set of is a determinantal point process with kernel function given by .
Putting these results together implies that the eigenvalues of the truncated CUE converge in distribution without any additional scaling to the zeros of . 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 be the eigenvalues of the rank-one truncation of the CUE, or equivalently the eigenvalues of , and let
be the Blaschke product of the eigenvalues. Then
with respect to the uniform-on-compact topology on .
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 of Killip-Nenciu [16]. They constructed a sparse matrix model with spectrum distributed as that of , and showed that the joint eigenvalue density of with respect to the Lebesgue measure on the unit disk is given by
We call the resulting distribution the size truncated circular beta ensemble. When , equation (6) recovers the joint eigenvalue density (2). However, for general 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 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 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 defined in (5).
Theorem 1. Fix . Let be distributed as the size truncated circular beta ensemble, and let
be the corresponding Blaschke product. Then we have
with respect to the uniform-on-compact topology on .
Since appears as a multiplicative constant in (7), we obtain the bulk scaling limit of the truncated circular beta ensemble as follows.
Corollary 2. Let be distributed as a size truncated circular beta ensemble. Let , then as , in the vague topology on locally finite point measures on .
Corollary 2, together with the work of Peres and Virág [21], implies that the limiting point process is determinantal with with respect to the Lebesgue measure on , and is independent of . More precisely, the -th joint intensity of the limiting process is given by
Using the determinantal structure, one can compute the asymptotics of the hole probability as follows. Let be distributed as the size truncated circular beta ensemble, and for let , then we have
As , the hole probability tends to , 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 . 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 , consider its multiplicative perturbation
Note that when the eigenvalues of consist exactly of the eigenvalues of the truncated matrix plus an additional eigenvalue at , whereas when we simply have . Hence, as changes from to , the perturbed model can be viewed as an interpolation between the truncated and unperturbed model. The joint eigenvalue distribution of in the case when is a random Haar unitary matrix was derived in [11]. In [10], Forrester and Ipsen studied the limit of the rank-one multiplicative perturbation of the CUE in the regime when . 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 , one may define the rank-one multiplicative perturbation of the circular beta ensemble as the spectrum of via (8). The joint eigenvalue distribution of 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 .
Theorem 3. Fix , and set . For all sufficiently large let be the Blaschke product of the eigenvalues of the multiplicatively perturbed model . Then we have
with respect to the uniform-on-compact topology on . Here , is a sequence of i.i.d. standard complex normal random variables, and is an independent, uniform random variable on the unit circle.
In particular, the eigenvalues of converge weakly to the zeros of the random series . 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 be a probability measure supported on distinct points , on . For , the -th orthogonal polynomial is defined as the unique monic polynomial of degree that is orthogonal to in . We extend this definition to , which can be viewed as the characteristic polynomial of the measure . Let be the reversed polynomial of for , then the Szegő recursion states that (see e.g. Section 1.5, vol. 1 of [24]):
Here the constants , are called the Verblunsky coefficients of . They satisfy the property that for and . In fact, the map between probability measures supported on points on and the sequence of Verblunsky coefficients 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 as follows. Definition 4. Let be a probability measure supported on distinct points on the unit circle and let , be its Verblunsky coefficients obtained via the Szegő recursion (10). Define
and set and to be matrices. Then we define the CMV matrix corresponding to or as
where and are block-diagonal matrices
Note that is unitary if and only if . To deal with the rank-one truncation and multiplicative perturbation of random unitary matrices, we also allow , in which case the resulting matrix becomes sub-unitary.
In the following proposition, we summarize the connection between CMV matrices, probability measures on , and the orthogonal polynomials associated with these probability measures.
Proposition 5. ([15, 24]) Suppose that is an unitary matrix for which is cyclic. Let be its spectral measure with respect to , and denote its Verblunsky coefficients by , . Then there is a unitary matrix with so that . Moreover, let , be the monic orthogonal polynomials of , then we have
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 is a finitely supported probability measure on . Let and be the corresponding Verblunsky coefficients and the CMV matrix with respect to . We define the reversed version of the Verblunsky coefficients as
Then we denote by and the probability measure and CMV matrix corresponding to the sequence , . We call and the reversed version of and , respectively.
In Killip-Nenciu [16], it was shown in Proposition B.2 that and 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 and are unitarily equivalent, and . Then there exists a unitary matrix such that
For , there exists a unitary matrix such that
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 circular beta ensemble with density function (1). We define the size Killip-Nenciu measure as a random probability measure on as
where the support is distributed as the size circular beta ensemble, and the weights , are chosen according to distribution, independently of the support. The joint distribution of the Verblunsky coefficients with respect to was computed in [16].
Proposition 8 ([16]). For fixed and , the sequence of Verblunsky coefficients , of are independent, rotationally invariant such that for and .
Recall the reversed version of a sequence of Verblunsky coefficients (13). By the independence and rotational invariance of , , we have , are independent, rotationally invariant such that for and . Note that the spectral weights of the , 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 and , let , be independent, rotationally invariant random variables such that . Then the joint eigenvalue distribution of the sub-unitary CMV matrix is the same as that of , which is given by the size truncated circular beta ensemble (6).
Let be independent of , . For fixed , the sub-unitary CMV matrix has the same joint eigenvalue distribution as the multiplicatively perturbed model matrix .
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
Since the zeros of lie outside of the unit disk, the Blaschke product is well defined for and . Expanding in a Taylor series around , we write
The goal of this section is to prove the following statement.
Proposition 10. Under the setup as in Theorem 1, let be the -th Taylor coefficient of . Then for any fixed , we have
where , 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 , and a Gaussian approximation for the Verblunsky coefficients. Throughout the paper, we work with the following probability space.
Assumption 11. Let be a sequence of independent, rotationally invariant random variables such that
and set . Let be independent of . In this probability space, we introduce the filtration
and define the CMV matrices
By Proposition 9, the eigenvalues of and , are distributed as the size 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 as the unique holomorphic logarithm on such that . By the Szegő recursion (10), for , we have
where we take the principal branch of the logarithm in the second term of the equality. By definition, and are -measurable, and is independent of . Using the rotational invariance of , the integrability of and the fact that for , one can check that is a -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 and the logarithm of the reversed characteristic polynomial of the full CE, and by establishing suitable integrability properties of , Chhaibi and Najnudel [3] characterized the limit as follows.
Proposition 12 (Propositions 3.1 and 3.6 of [3]). Let , be defined as above. Then we have that converges to a.s. as , uniformly on compacts in . Moreover, the limit has the same distribution as
where are i.i.d. standard complex Gaussian variables.
Note that Proposition 3.1 of [3] is stated for due to its connection with Gaussian Multiplicative Chaos on . 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 .
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 be a rotationally invariant random variable such that , then
in law as , where is a standard complex Gaussian variable.
Indeed, using the fact that 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
where we used by convention and set for the ease of notation. Therefore, we have
Recall that denotes the Taylor coefficient of of degree at zero. Fix , for any and , by the residue theorem we have
Note that for the integrand on the right hand side of (18) is holomorphic, hence the corresponding integral is zero. Proposition 12 implies that converges to uniformly on compacts in : moreover, does not vanish in . Using this convergence, the fact that the zeros of , lie outside the unit disk, and Cauchy’s integral formula we obtain that
Recall the distribution of as in Assumption 11, by Fact 13 we have
jointly in distribution as , where , 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 , be a sequence of i.i.d. standard complex Gaussian variables. Define
then one can check that , is a sequence of independent, rotationally invariant random variables such that . For any , let be the Blaschke product of the truncated CE defined via under this coupling. Define
then . By the triangle inequality, one can bound the error by controlling the following terms
These terms can be estimated using the bounds on and , and the fact that is a.s. finite. Combining these estimates yields an upper bound on with an explicit convergence rate. This would lead to a.s. uniformly on compacts in as . However, since the sequence of GAFs varies with , this estimate alone would not establish convergence in probability of 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 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 with respect to the topology of uniform convergence on compacts in .
We first introduce some notation. Denote by the set of holomorphic functions on the unit disk. Define to be the following metric on : for every , we define
Note that 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 , is tight as a sequence of random analytic functions with respect to the metric .
Proof. Recall the Szegő recursion (10), we have
Using the fact that
we get
For recall the norm defined in (21). By iterating the bound (22) we have
Recall that , we have with . By Minkowski’s inequality we have
where is a constant depending only on . By splitting the summation at , we can find a deterministic constant such that
Since , we may enlarge (if necessary) to conclude that
uniformly in . We claim that this uniform bound also implies the tightness of the sequence . Indeed, for any , we set and consider the compact set . By Markov’s inequality, we have
Taking the union bound in gives that for all . 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 , with respect to the topology of uniform convergence on compact sets of . Combining these two results completes the proof.
To prove Corollary 2, we invoke the following fact from complex analysis.
Fact 16. For , let , where counts the multiplicity of the zero . Then the map is continuous from with the topology of uniform convergence on compact sets of , to the space of locally finite point measures on with respect to the vague topology.
Consequently, if , and are random holomorphic functions that are a.s. not identically equal to , and in law as with respect to the topology of uniform convergence on compact sets of , then 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 , and 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 defined in (8). In [10], Forrester and Ipsen studied the asymptotic behavior of the zeros of , where is a size CUE (corresponding to the case) and . Their result can be summarized as follows.
Proposition 17 ([10]). Let be uniformly chosen with Haar measure on , and set with fixed. Then the eigenvalues of converge weakly as to the zeros of the random series
Here , is a sequence of i.i.d. standard complex Gaussian variables.
The function can be viewed as the Gaussian analytic function 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 . 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 .
Proof of Theorem 3. Fix and we assume is large enough such that . Let , and be defined as in Assumption 11. By Propositions 7 and 9, the eigenvalues of have the same joint distribution as the (sub-unitary) CMV matrix .
Let , be the monic orthogonal polynomials with respect to the sequence of Verblunsky coefficients , and let be the associated reversed polynomials. By the Szegő recursion (10), these polynomials do not depend on for , and we may therefore suppress the -dependence in the notation for these functions. Consequently, Theorem 1 and Proposition 12 remain valid for the sequences and .
Applying Szegő recursion (10) to and , we have
hence
Since and for , the denominator converges to 1 uniformly on compact sets of (see also Theorem 1.7.4 of [24]). By Theorem 1, Slutsky’s theorem and the independence of from , we conclude that
in distribution as uniformly on compact sets of . Since , 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 CE converge to those of the random series , independent of . 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 as claimed.
Asymptotic independence of and the bulk zeros
Let be distributed according to the size truncated CE and set . Recall the reversed characteristic polynomial of . The goal of this section is to prove the asymptotic independence of and the linear statistics of of compactly supported test functions. Heuristically speaking, the reversed polynomial is determined by the first Verblunsky coefficients, and is close to its limit when is sufficiently large (see Proposition 12). In contrast, the bulk zeros, namely those lying inside a compact subset of , are mainly determined by the first few terms in the series expansion of . 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
The function depends on , and is independent of . By the inequality , it is direct to check that on . Recall the metric defined in (21), we obtain the following bound on .
Proposition 18. Consider the probability space defined in Assumption 11. For and , we have
Moreover, for any fixed , we have a.s. as .
Proof. By definition, we have
Since for , we get the difference is a multiple of . By induction, one can check that is a multiple of , i.e., it has a zero of order at least at . This implies that the first Taylor coefficients of and agree with each other. Repeating the proof of the Schwarz lemma proves the first claim. More precisely, let . For , by the maximum principle we have . Letting yields that as claimed.
We now prove the second claim. For we have
By splitting the integral at , we get the upper bound
where is an absolute constant independent of . Sending completes the proof. \quad \square
For a continuous function with compact support inside the unit disk, we denote by the linear statistics of . The next result proves the asymptotic independence of .
Proposition 19. Consider the probability space in Assumption 11. For any continuous compactly supported test function , we have , where the limit is independent of .
Proof. By Corollary 2 and Proposition 12, we have the marginal convergence and a.s. uniformly on compacts as . It remains to prove the joint convergence.
For any fixed , recall the auxiliary function defined in (24). For we set , and . By definition, we have and are independent of .
Let and be bounded continuous functions. By the triangle inequality we have
where in (26) we used the fact that is independent of . By Theorem 1 and Proposition 18, we have
in law as , with respect to the topology of uniform convergence on compact sets of . By Fact 16 again, we have , and as in the vague topology on locally finite point measures on . Hence, for any fixed we have
as . Therefore, we have
Sending and using the a.s. uniformly on compacts convergence of in Proposition 12 completes the proof. □
Note that by applying the argument used in the proof of Proposition 19 to functionals of , one obtains the joint convergence
with respect to the compact-open topology, where the limiting functions and are independent. Using the fact that multiplication is continuous with respect to the compact-open topology, one may further deduce that
in law as , with respect to the topology of uniform convergence on compact sets of . Here , and , 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 to a limit . 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]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]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]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]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]John B. Conway. Functions of One Complex Variable I, volume 11 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2 edition, 1978.
- [6]Ioana Dumitriu and Alan Edelman. Matrix models for beta ensembles. J. Math. Phys., 43(11):5830–5847, 2002.
- [7]Alan Edelman and Brian D. Sutton. From random matrices to stochastic operators. J. Stat. Phys., 127(6):1121–1165, 2007.DOI
- [8]Peter J. Forrester. Log-gases and random matrices (LMS-34). Princeton University Press, 2010.DOI
- [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]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]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]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]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]Tiefeng Jiang and Sho Matsumoto. Moments of traces of circular beta-ensembles. Ann. Probab., 43(6):3279–3336, 2015.DOI
- [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]Rowan Killip and Irina Nenciu. Matrix models for circular ensembles. International Mathematics Research Notices, 2004(50):2665–2701, 2004.
- [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]Manjunath Krishnapur. From random matrices to random analytic functions. Ann. Probab., 37:314–346, 2009.arxiv.org/abs/0711.1378
- [19]Yun Li. Gaussian limits for traces of circular beta-ensembles. arXiv preprint arXiv:2610.01803, 2026.arxiv.org/abs/2610.01803
- [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]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]José A. Ramírez and Brian Rider. Diffusion at the random matrix hard edge. Comm. Math. Phys., 288(3):887–906, 2009.DOI
- [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]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]Benedek Valkó and Bálint Virág. Continuum limits of random matrices and the Brownian carousel. Inventiones Math., 177:463–508, 2009.DOI
- [26]Benedek Valkó and Bálint Virág. The Sineβ operator. Inventiones mathematicae, 209(1):275–327, 2017.
- [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]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]Karol Życzkowski and Hans-Jürgen Sommers. Truncations of random unitary matrices. Journal of Physics A: Mathematical and General, 33(10):2045, 2000.DOI