🔢 mathematics

Airy limit for the Jack process and topological expansion

This paper establishes multi-time soft-edge moment convergence for the Jack–Plancherel process to an Airy $_\beta$ -related limit described by a Brownian bridge expansion, which further yields a $\beta$ -topological expansion for the marginal $b$ -conjecture and an explicit nonnegative formula for Witten–Kontsevich intersection numbers at $\beta=2$ .

Original authors: Jiaming Xu

Published 2026-09-04

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Jiaming Xu

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the study of complex systems, from the energy levels of atomic nuclei to the behavior of financial markets, scientists often turn to a powerful mathematical tool known as random matrix theory. This field treats large collections of numbers not as fixed values, but as outcomes of a random process, much like rolling a vast number of dice. For decades, researchers have focused on specific, well-understood cases where these numbers follow strict rules, revealing deep connections to geometry and the shape of the universe. However, a vast middle ground has remained difficult to explore: systems where the rules are slightly different, governed by a flexible parameter that changes how the numbers interact. Understanding these intermediate systems is crucial because they appear in diverse areas of physics and mathematics, yet they lack the simple, closed formulas that make the classic cases so easy to analyze. Without a clear way to describe them, scientists have been unable to see the underlying patterns that connect these systems to the famous geometric shapes and counting problems that appear in the most extreme cases.

A recent study by Jiaming Xu bridges this gap by developing a new way to describe the behavior of these intermediate systems as they grow very large. The researcher focused on a specific mathematical process that evolves over time, tracking how a collection of numbers shifts and settles. By pushing this process to its limit, where the number of elements becomes enormous, the study reveals a surprising and elegant structure. Instead of the chaotic mess one might expect, the system organizes itself into a pattern that can be described using the language of Brownian motion—the random, jittery movement of particles suspended in a fluid. The study shows that the complex interactions of these numbers can be visualized as a series of non-negative paths, like bridges made of water, that are decorated with specific pairs of jumps. These jumps always come in equal and opposite pairs, rising and falling by the exact same amount, creating a balanced, rhythmic structure.

The significance of this discovery lies in how it unifies two previously separate worlds. On one side, there are the classic, highly structured systems that mathematicians have understood for a long time. On the other, there are the more complex, flexible systems that have resisted simple description. The new formula acts as a master key, showing that the classic systems are simply special, transparent versions of this broader, more general rule. When the flexible parameter is set to a specific value that corresponds to the classic case, the complex formula simplifies perfectly, reproducing the known results but with a new, positive clarity. Before this work, the formulas for these classic cases often involved a confusing mix of positive and negative terms that canceled each other out, making it hard to see the true nature of the numbers. The new approach removes this confusion, presenting the results as a sum of entirely positive, non-negative quantities. This shift from a mix of signs to a purely positive description is not just a cosmetic change; it reveals a hidden geometric organization that was previously obscured.

The study also connects these findings to a famous problem in geometry involving the counting of shapes called maps, which are networks of lines and surfaces used to model everything from quantum gravity to the structure of space-time. The researcher demonstrates that the new formula provides a direct, positive way to count these shapes, assigning a specific weight to each one based on its complexity. This is a major step forward because previous methods for counting these shapes often relied on complicated algebraic tricks that obscured the physical meaning of the results. By linking the random movement of particles to the counting of geometric shapes, the work suggests that the fundamental laws governing random systems and the laws governing the shape of space are more deeply intertwined than previously thought.

What makes this result particularly robust is that it holds true for a wide range of conditions, not just for the specific, easy-to-solve cases. The mathematical proof establishes that this new description is valid for any positive value of the interaction parameter, covering the entire spectrum of these systems. While the final identification of the limiting behavior with a specific, well-known process called the Airy process was confirmed for a subset of these conditions, the researchers are confident that the underlying formula describes the behavior for all cases. This confidence comes from the rigorous nature of the proof, which combines tools from probability theory, combinatorics, and the study of random walks to build a complete picture. The result is a new, concrete formula that allows scientists to calculate the statistics of these complex systems with a level of precision and clarity that was previously impossible, offering a fresh perspective on how randomness and order coexist in the mathematical fabric of the universe.

Technical Summary: Airy limit for the Jack process and topological expansion

Problem Statement
The paper addresses the asymptotic behavior of the Jack–Plancherel process, a discrete $\beta$ -analogue of Dyson Brownian motion, specifically at the soft edge. While the classical cases ( $\beta=1$ for GOE and $\beta=2$ for GUE) are well-understood through determinantal and Pfaffian structures, the general $\beta > 0$ regime lacks explicit combinatorial formulas for multi-time statistics. A central challenge is to establish the convergence of multi-time soft-edge moments for the Jack process and to identify the limiting object with the Airy $\beta$ point process. Furthermore, the paper seeks to connect these probabilistic limits to the topological expansion of map enumeration (the $b$ -conjecture) and to provide explicit, nonnegative formulas for intersection numbers on moduli spaces, particularly for the Witten–Kontsevich invariants.

Methodology
The author employs a synthesis of symmetric function theory, conditioned random walk estimates, and existing edge-universality results for discrete beta ensembles.

Nazarov–Sklyanin Operators: The core technical tool is the use of Nazarov–Sklyanin operators, which act diagonally on Jack symmetric functions. These operators allow the extraction of moments of the Perelomov–Popov measure associated with the Jack–Plancherel process. The author expands these operators into products of matrix entries, interpreting the resulting terms as weighted sums over decorated lattice paths (Lukasiewicz paths).
Decorated Path Expansion: The moment calculation is transformed into a combinatorial expansion over nonnegative walk bridges. These paths are decorated with "paired jumps" (a downward and an upward jump of equal height) and "area weights" (exponential functionals of the path area). The expansion is organized by the number of jump pairs ( $r$ ) and the total degree of area marks ( $\rho$ ).
Diffusive Scaling and Brownian Limit: The author applies a scaling where time displacements and moment degrees are of order $N^{2/3}$ . Using estimates for conditioned random walks (specifically, local limit theorems and functional limit theorems for bridges conditioned to stay nonnegative), they show that the discrete decorated paths converge to a continuous functional involving nonnegative Brownian bridges. The decorations converge to paired jumps and area integrals.
Identification with Airy $\beta$ : To identify the limiting process, the author utilizes the rigidity and edge-universality theorems established by Guionnet and Huang for discrete beta ensembles. By comparing the limiting moments derived from the Jack process with the known Laplace statistics of the Airy $\beta$ process (defined via the stochastic Airy operator), they establish the identification for $\beta \ge 1$ .
Topological Interpretation: The resulting Brownian functional is analyzed through the lens of the marginal $b$ -conjecture. The parameters $b = 2/\beta - 1$ and $1+b$ are shown to correspond to specific topological features of maps (non-orientability and handles).

Key Contributions and Results

Multi-time Soft-Edge Moment Convergence (Theorem 1.1): The paper establishes the first multi-time soft-edge moment convergence for the Jack–Plancherel process. The limit is given by an explicit, absolutely convergent series of Brownian functionals. This functional involves nonnegative Brownian bridges decorated by pairs of equal and opposite jumps, with weights depending on the area under the bridges and time separations.
Identification with Airy $\beta$ (Theorem 1.2): For $\beta \ge 1$ , the limiting process is identified as the Airy $\beta$ point process. This yields a new explicit formula for the joint Laplace statistics of the Airy $\beta$ process. The formula is organized as a sum over multigraphs, where the coefficients are nonnegative Brownian integrals.
Topological Expansion and the $b$ -conjecture: The Brownian expansion provides a probabilistic realization of the marginal $b$ -conjecture. The author shows that the coefficients of the expansion in powers of $b$ and $(1+b)$ correspond to the La Croix handle basis for map enumeration. Specifically, the cycle rank of the underlying multigraph corresponds to the handle index, and the area degree corresponds to the non-orientability measure.
Positive Formula for Intersection Numbers (Theorem 6.2): At the classical value $\beta = 2$ (where $b=0$ ), the area decorations vanish, and the formula simplifies to a sum over connected multigraphs involving only killed Brownian transition densities. This provides a finite, nonnegative formula for the Witten–Kontsevich intersection numbers (and their generating functions), reorganizing the alternating determinantal expressions found in previous literature into a sum of positive terms indexed by ordinary connected multigraphs.
Consistency Checks: The formula correctly recovers the deterministic Airy spectrum in the zero-temperature limit ( $\beta \to \infty$ , $b \to -1$ ) and matches the determinantal structure at $\beta = 2$ .

Significance and Claims
The paper claims that treating $\beta$ as a genuine parameter reveals a unified structure that is obscured when working directly within specific matrix models (like GUE or GOE). The primary significance lies in:

Unification: It provides a single, symmetric-function-based framework that interpolates between classical random matrix ensembles and general $\beta$ ensembles, connecting them to the Airy $\beta$ line ensemble.
Positivity: Unlike traditional expansions for $\beta=2$ which involve alternating signs (determinants/Pfaffians), the derived Brownian representation is termwise nonnegative for all $\beta \ge 1$ . This offers a new perspective on the combinatorial and geometric structures underlying these statistics.
Explicit Combinatorics: It offers explicit, finite formulas for asymptotic map coefficients and intersection numbers, resolving the $b$ -conjecture in the marginal case with a concrete probabilistic interpretation.
Methodological Advance: It demonstrates the utility of Nazarov–Sklyanin operators for edge-limit calculations, a technique previously applied mainly to global limits, and successfully bridges discrete stochastic processes with continuous topological recursion concepts.

The author notes that while the identification with the Airy $\beta$ process is rigorously proven for $\beta \ge 1$ (due to the availability of edge-universality theorems in that regime), the derived formula is expected to hold for all $\beta > 0$ as the second multi-time Laplace transform formula for the Airy $\beta$ line ensemble.

More like this