Gessel-Type Expansion for the Circular $\beta$-Ensemble and Central Limit Theorem for the Sine-$\beta$ Process for $\beta\le 2$

This paper establishes a Gessel-type expansion in Jack polynomials for multiplicative functionals in the circular $\beta$-ensemble, which enables the proof of Szegő-type limit theorems for $\beta \le 2$ and a Soshnikov-type central limit theorem for the sine-$\beta$ process across the full $H^{1/2}$ regularity class.

The Gist

Imagine you are standing in a crowded room where people are trying to get as far away from each other as possible. This is the essence of the Circular $\beta$-ensemble.

In this mathematical model, we have $n$ particles (people) sitting on a circular track. They repel each other. The strength of this repulsion is controlled by a knob called $\beta$.

• If $\beta$ is low, they are a bit lazy about keeping their distance.
• If $\beta$ is high, they are extremely aggressive about staying apart.
• When $\beta = 2$, it's a very specific, perfectly balanced state (like a perfectly shuffled deck of cards).

The paper by Sergei Gorbunov is about predicting what happens when you ask a specific question about this crowd: "If we assign a value to every person based on where they are standing, what is the total value of the whole group?"

Here is the breakdown of the paper's discoveries, translated into everyday language:

1. The Magic Recipe (The Gessel-Type Expansion)

For the special case where $\beta = 2$, mathematicians have had a "magic recipe" (called Schur polynomials) for a long time to calculate these totals. It's like having a perfect calculator for a specific type of crowd.

But what if the crowd is messy ($\beta \neq 2$)? The old calculator breaks.
The Paper's Breakthrough: Gorbunov found a new, more flexible recipe. He replaced the old "Schur polynomials" with a new family of tools called Jack Polynomials.

• The Analogy: Think of Schur polynomials as a rigid, square Lego brick. It only fits one specific shape. Jack polynomials are like Mega Bloks that can stretch and shrink depending on the value of $\beta$.
• The Result: This new recipe works for any level of repulsion, as long as the crowd isn't too chaotic (specifically, when $\beta \le 2$). It allows mathematicians to calculate the "total value" of the crowd with incredible precision.

2. The Smoothing Effect (Szegő's Limit Theorem)

Now, imagine you have a huge crowd (millions of people). You want to know the total value.

• The Old Way: You might think you need to count every single person individually.
• The New Way: The paper proves that for large crowds, you don't need to count everyone. The total value behaves like a Gaussian (Bell Curve).

The Analogy: Imagine trying to guess the average height of everyone in a stadium. You don't need to measure every single person. If the crowd is big enough, the average will naturally settle into a predictable bell curve.

• The paper proves that for these repelling crowds, this "Bell Curve" behavior kicks in even when the people are only "semi-smooth" (mathematically speaking, $1/2$-Sobolev regular).
• Why it matters: Previous methods required the crowd to be perfectly smooth. This paper says, "No, even if the crowd is a little bit rough or jagged, the Bell Curve still appears, provided the repulsion isn't too weak."

3. Zooming In: The Sine-$\beta$ Process

What happens if you zoom in so close that the circle looks like an infinite straight line? The crowd becomes the Sine-$\beta$ process. This is the "microscopic" view of the particles.

The Discovery: The paper shows that the rules we learned about the big crowd (the circle) apply perfectly to the zoomed-in crowd (the line).

• The Analogy: If you look at a forest from a satellite, it looks like a green blob. If you zoom in to a single tree, it looks like a complex structure. This paper proves that the "statistical laws" governing the whole forest are the same as the laws governing a single tree, even if the tree is a bit rough around the edges.
• The Result: They proved that for these microscopic crowds, the "total value" also settles into a Bell Curve, and they gave a precise formula for how fast it gets there.

4. The "Rigidity" of the Crowd

One of the coolest side notes in the paper is about Rigidity.

• The Concept: In these crowds, if you know where 99% of the people are, you can predict exactly where the 100th person is. They are "rigidly" locked in place by their neighbors.
• The Analogy: Imagine a line of people holding hands in a tug-of-war. If you pull one person, everyone else moves slightly to compensate. You can't just move one person without moving the whole line.
• Why it matters: This rigidity is why the math works so well. It means the crowd is highly organized, allowing the authors to make precise predictions even with "rough" data.

Summary: Why Should You Care?

This paper is a bridge.

1. It connects the known to the unknown: It takes a famous mathematical trick (Gessel's theorem) that only worked for one specific type of crowd and expands it to work for a whole family of crowds.
2. It handles "messy" data: It proves that even if the data isn't perfectly smooth (which is usually the case in the real world), the underlying patterns (like the Bell Curve) still emerge.
3. It unifies scales: It shows that the rules governing a circle of particles are the same as the rules governing an infinite line of particles.

In a nutshell: The author built a new, stretchy mathematical tool (Jack Polynomials) that allows us to predict the behavior of repelling particles, proving that even in a chaotic, repelling crowd, there is a beautiful, predictable order waiting to be found.

Technical Summary

1. Problem Statement

The paper addresses the asymptotic behavior of multiplicative and additive functionals in random matrix theory and point processes, specifically focusing on two related models:

1. The Circular $\beta$-Ensemble ($C\beta E_n$): A probability measure on $n$ points on the unit circle with a joint density proportional to $\prod_{l<m} |e^{i\theta_l} - e^{i\theta_m}|^\beta$.
2. The Sine-$\beta$ Process ($P_\beta$): The microscopic scaling limit of the $C\beta E_n$ as $n \to \infty$, representing a point process on the real line.

Key Challenges:

• Lack of Determinantal Structure: For $\beta = 2$ (Circular Unitary Ensemble), expectations of multiplicative functionals can be computed using Toeplitz determinants and Schur polynomials (Gessel's theorem). For general $\beta \neq 2$, this determinantal structure is absent, making exact calculations difficult.
• Regularity Conditions: Previous results (e.g., by Johansson, Lambert) often required strong regularity assumptions (e.g., $f \in C^{1+\epsilon}$ or $C^{3+\epsilon}$) to establish limit theorems. The paper aims to determine the optimal regularity condition (specifically $H^{1/2}$ Sobolev regularity) under which these theorems hold.
• Convergence Rates: Establishing explicit rates of convergence for the Central Limit Theorem (CLT) in the microscopic regime.

2. Methodology

The author employs a combinatorial and algebraic approach based on Jack polynomials, which generalize Schur polynomials.

• Jack Polynomials as a Basis: The paper utilizes the fact that Jack polynomials $J^{(\alpha)}_\lambda$ (with parameter $\alpha = 2/\beta$) are orthogonal with respect to the scalar product induced by the $C\beta E_n$ measure.
• Gessel-Type Expansion: The core technique involves expanding the multiplicative functional $\prod_{j=1}^n e^{f(\theta_j)}$ into a series of Jack polynomials. This is achieved by:
  1. Decomposing $f$ into analytic parts inside and outside the unit circle.
  2. Expressing the exponential of the sum of functionals using power sums $p_k$.
  3. Applying the Cauchy identity for Jack polynomials to expand the exponential terms.
  4. Using the orthogonality of Jack polynomials under the $C\beta E_n$ measure to compute expectations term-by-term.
• Scaling Limits: The results for the finite $n$ ensemble are extended to the infinite volume limit (Sine-$\beta$ process) using:
  • Tightness arguments for the sequence of point processes.
  • Continuity of the additive functionals with respect to the $H^{1/2}$ Sobolev seminorm.
  • Regularization techniques to handle functions that are not compactly supported.

3. Key Contributions and Results

A. Gessel-Type Expansion for $C\beta E_n$ (Theorem 1.2)

The paper establishes an exact expansion for the expectation of multiplicative functionals for any $\beta \le 2$ (i.e., $\alpha \ge 1$):
$$E_n^{\beta} \left[ \prod_{j=1}^n e^{f(\theta_j)} \right] = e^{n \hat{f}_0} \sum_{\lambda: l(\lambda) \le n} \frac{J^{(\alpha)}_\lambda(\rho_+) J^{(\alpha)}_\lambda(\rho_-)}{\langle J^{(\alpha)}_\lambda, J^{(\alpha)}_\lambda \rangle_\alpha} A^{(\alpha)}_\lambda(n)$$
where $\rho_\pm$ are algebra homomorphisms determined by the Fourier coefficients of $f$, and $A^{(\alpha)}_\lambda(n)$ is a specific factor depending on the partition $\lambda$ and $n$.

• Significance: This generalizes Gessel's classical result (valid only for $\beta=2$) to arbitrary $\beta \le 2$. The series converges absolutely if $f$ is $1/2$-Sobolev regular.

B. Szegő-Type Limit Theorem (Corollary 1.3)

As $n \to \infty$, the expectation converges to a Gaussian limit:
$$e^{-n \hat{f}_0} E_n^{\beta} \left[ \prod_{j=1}^n e^{f(\theta_j)} \right] \to \exp\left( \frac{2}{\beta} \sum_{k \ge 1} k \hat{f}_k \hat{f}_{-k} \right)$$

• Optimality: The paper proves this holds for all $1/2$-Sobolev regular functions ($f \in H^{1/2}(\mathbb{T})$) provided $\beta \le 2$. This confirms a conjecture by Lambert regarding the sufficiency of the $H^{1/2}$ condition for $\beta \le 2$.
• Subgaussian Bounds: Explicit subgaussian exponential moment bounds are derived for real-valued functions.

C. Quantitative Convergence Rates (Theorem 1.4)

The paper provides an explicit error bound for the convergence of the multiplicative functional to its limit for functions in $H^1(\mathbb{T})$:
$$\left| \dots - 1 \right| \le \frac{C}{n} \exp(\dots) \|f\|_{\dot{H}^1}^2$$
This estimate is stable under microscopic scaling, implying convergence at arbitrarily small mesoscopic scales.

D. Central Limit Theorem for the Sine-$\beta$ Process (Theorem 1.6 & 1.8)

By applying the scaling limit $\theta \to n\theta$, the results are transferred to the Sine-$\beta$ process $P_\beta$:

• CLT: For $f \in H^{1/2}(\mathbb{R})$ and $\beta \le 2$, the centered additive functional $S_f = \sum_{x \in X} f(x) - E[S_f]$ converges in distribution to a Gaussian random variable.
• Rate of Convergence: For $f \in H^1(\mathbb{R})$, the paper derives an explicit inequality bounding the difference between the Laplace transform of the functional and the Gaussian limit.
• Kolmogorov-Smirnov Distance: Corollary 1.7 provides a convergence rate of $O(1/\sqrt{\ln R})$ for the distribution of the rescaled functional $S_{f(\cdot/R)}$ to the standard normal distribution.

4. Significance and Impact

1. Optimal Regularity: The work resolves the question of the minimal regularity required for the CLT in the Sine-$\beta$ process. It confirms that $H^{1/2}$ is sufficient for $\beta \le 2$, a regime where previous methods (like loop equations) struggled or required stronger smoothness assumptions.
2. Algebraic Framework: By leveraging Jack polynomials, the author bypasses the need for determinantal structures (which only exist for $\beta=2$) or complex loop equation analyses. This provides a unified algebraic framework for $\beta$-ensembles.
3. Extension to Non-Compact Support: Unlike previous works (e.g., Leblé, Lambert) that relied on compactly supported test functions, this paper extends the results to functions with finite $H^{1/2}$ seminorm, which is crucial for applications involving non-decaying functions or specific spectral statistics.
4. Rigidity Connection: The results highlight the connection between the variance of additive functionals and the rigidity of the point process (a property where the number of points in a window is determined by the configuration outside it). The dependence on the seminorm rather than the full norm is a signature of this rigidity.
5. Foundation for Future Work: The paper opens questions regarding the Pfaffian nature of Jack measures for $\alpha=2, 1/2$ (corresponding to $\beta=1, 4$) and the behavior of Jack measures under microscopic scaling, suggesting a deep link between symmetric function theory and random matrix limits.

In summary, Gorbunov's paper provides a rigorous, algebraic derivation of limit theorems for $\beta$-ensembles, achieving optimal regularity conditions and explicit convergence rates for $\beta \le 2$, thereby bridging the gap between the well-understood $\beta=2$ case and general $\beta$ ensembles.