Matrix Correlators as Discrete Volumes of Moduli Space I: Recursion Relations, the BMN-limit and DSSYK

This paper demonstrates that specific correlators in generic one-matrix models define discrete volumes of Riemann surface moduli spaces obeying a discrete Mirzakhani-like recursion, which continuously recovers Kontsevich volumes in a BMN-like limit and yields a discrete $q$-analog of Weil--Petersson volumes for DSSYK, thereby confirming a conjecture by K. Okuyama.

The Gist

Imagine you are trying to count the number of ways to arrange a complex set of LEGO bricks to build a specific shape. In the world of theoretical physics, these "shapes" are called Riemann surfaces (think of them as fancy, multi-holed donuts or rubber sheets), and the "arrangements" are mathematical ways of describing their geometry.

For decades, physicists and mathematicians have used two main tools to study these shapes:

1. The Smooth Approach: Treating the shapes like smooth, continuous clay. You measure their "volume" (how much space they take up) using calculus. This is like measuring the surface area of a perfect sphere.
2. The Matrix Approach: Using giant grids of numbers (matrices) to simulate these shapes. When you crunch the numbers, you get answers that match the smooth approach.

The Problem:
Usually, to make the Matrix Approach work perfectly, physicists have to use a "magic trick" called the double-scaling limit. This is like zooming in so far on a digital photo that the pixels blur together into a smooth image. While this gives the right answer, it hides the fact that the underlying reality is actually made of discrete, individual "pixels" (integers). It's like saying a digital image is just a smooth painting, ignoring the fact that it's actually made of tiny squares.

The Big Discovery:
This paper, written by Giacchetto, Maity, and Mazenc, says: "Wait a minute! We don't need to blur the pixels to get the right picture."

They show that if you look at the matrix numbers without zooming in too much (keeping them as distinct integers), you can still calculate the "volume" of these shapes. But instead of a smooth volume, you get a "Discrete Volume."

Here is the breakdown of their three main breakthroughs, explained with analogies:

1. The "Pruned" LEGO Count (The Discrete Recursion)

Imagine you are building a LEGO castle. Usually, you count every single brick, including the ones that are just sitting on top of each other in a flat, boring way (planar loops).
The authors introduce a new way of counting called "Pruned Traces."

• The Analogy: Imagine you are only allowed to count the LEGO structures that have no flat, redundant loops. You "prune" away the boring parts.
• The Result: When you count these "pruned" structures, you aren't just getting a number; you are counting the number of lattice points (integer coordinates) on the map of all possible shapes.
• The Magic: They proved these counts follow a specific rule (a recursion) that looks exactly like a famous rule discovered by Maryam Mirzakhani for smooth shapes, but this new rule works with integers (1, 2, 3...) instead of continuous numbers. It's like having a recipe that works whether you are measuring flour in cups (smooth) or counting individual grains of rice (discrete).

2. The "BMN" Zoom (The Universal Limit)

The authors asked: "What happens if we make our LEGO towers infinitely tall?"

• The Analogy: Imagine you have a LEGO tower with a specific number of bricks. If you keep adding more and more bricks to the top, the specific details of the bottom bricks start to matter less. The tower starts to look like a generic, smooth cylinder.
• The Result: In this "BMN limit" (named after physicists Berenstein, Maldacena, and Nastase), their discrete, integer-based counting rules magically turn into the smooth, continuous rules we already knew (the Kontsevich volumes).
• Why it matters: This proves that the "pixelated" world and the "smooth" world are actually the same thing, just viewed at different scales. The smooth world is just the limit of the discrete world when you have infinite resolution.

3. The DSSYK "Quantum" Volume (The q-Analog)

Finally, they looked at a very specific, popular model in physics called DSSYK (a version of the SYK model, which is a hot topic in quantum gravity).

• The Analogy: Imagine a special type of LEGO set where the bricks have a "quantum twist." The rules for how they connect depend on a parameter $q$ (like a dial that changes the physics of the universe).
• The Result: They showed that the DSSYK model calculates a "q-analog" of the volume.
  • When the dial is set to 0 ($q=0$), you get the standard integer counts (Norbury volumes).
  • When the dial is set to 1 ($q=1$), you get the smooth, continuous volumes (Weil-Petersson volumes).
  • In between, you get a "fuzzy" version that is neither fully discrete nor fully smooth.
• The Conjecture: A physicist named Okuyama guessed that this DSSYK model was the key to connecting these worlds. The authors proved him right! They showed that the DSSYK matrix integral is the "Rosetta Stone" that translates between the discrete integer world and the smooth geometric world.

The Big Picture Takeaway

Think of the Moduli Space (the map of all possible shapes) as a landscape.

• Old View: We could only see the landscape as a smooth, continuous hill (calculus).
• New View: This paper shows the landscape is actually a giant grid of stepping stones (integers).
• The Breakthrough: They found a way to count the stepping stones directly. They showed that if you stand on the stones and count them, you get a "Discrete Volume." If you step back and blur your eyes (the limit), the stones merge into the smooth hill, and your count matches the smooth volume perfectly.

In simple terms: They found a way to count the "pixels" of the universe's geometry without blurring them out, proving that the smooth geometry we see is just the result of counting a massive number of tiny, discrete building blocks. This connects the abstract math of matrix models directly to the physical geometry of quantum gravity.

Technical Summary

1. Problem Statement

The paper addresses the relationship between random matrix models and the geometry of the moduli space of Riemann surfaces ($\mathcal{M}_{g,n}$). While it is well-established that the double-scaled limit of matrix models (specifically in the context of Jackiw-Teitelboim (JT) gravity) reproduces the continuous Weil–Petersson volumes of $\mathcal{M}_{g,n}$, the geometric interpretation of matrix correlators away from the double-scaling limit remains less understood.

Specifically, the authors aim to:

• Define a notion of "discrete volumes" for the moduli space directly from generic one-cut matrix models without invoking the double-scaling limit.
• Derive a discrete recursion relation for these volumes that parallels Mirzakhani's continuous recursion for Weil–Petersson volumes.
• Investigate the BMN-like limit (large matrix powers) to recover Kontsevich volumes.
• Apply these results to the Double-Scaled SYK (DSSYK) matrix integral to prove a conjecture by K. Okuyama regarding $q$-analogs of Weil–Petersson volumes.

2. Methodology

The authors employ a combination of random matrix theory, topological recursion, and combinatorial geometry:

• Pruned Traces: Instead of standard traces $\text{Tr}(M^b)$, the authors focus on pruned traces denoted as $:\text{Tr}(M^b):$. These are defined diagrammatically by removing "petals" (planar Wick contractions between adjacent edges at the same vertex), effectively normal-ordering the traces in a planar sense. This ensures the planar one-point function vanishes.
• Discrete Laplace Transform: The connected correlators of pruned traces, $N_{g,n}(b_1, \dots, b_n)$, are extracted from the genus-$g$, $n$-point differential $\omega_{g,n}$ of the matrix model via a discrete Laplace transform (or Z-transform) of the spectral curve variables.
• Eynard–Orantin Topological Recursion: The authors start with the standard Eynard–Orantin recursion for the spectral curve of a generic one-cut matrix model. By manipulating the residue calculus and utilizing the specific structure of pruned traces, they transform the continuous residue integrals into discrete sums over integer powers of matrices.
• Spectral Curve Analysis: They utilize the Joukowsky map $x(z) = \gamma(z + 1/z) + \delta$ to uniformize the spectral curve. The recursion kernels are derived from a building-block function $H(\ell)$, defined by a contour integral involving the spectral curve data ($y(z)$ and $Q(z)$).
• Limit Analysis:
  • BMN-like Limit: Taking the matrix powers $b_i \to \infty$ (scaling with a parameter $t \to 0$) to transition from discrete sums to continuous integrals.
  • DSSYK Limit: Analyzing the specific spectral curve of the DSSYK matrix model (involving Jacobi theta functions) and taking a combined limit where the double-scaling parameter $\lambda \to 0$ and powers $b_i \to \infty$.

3. Key Contributions

A. Discrete Mirzakhani Recursion (Theorem A)

The primary result is the derivation of a discrete recursion relation for the pruned correlators $N_{g,n}(b_1, \dots, b_n)$ in any generic one-cut matrix model.

• The relation mirrors Mirzakhani's formula for Weil–Petersson volumes but replaces integrals with sums over positive integers $\beta$.
• The recursion kernels $B$ and $C$ are constructed from a single function $H(\ell)$, which is determined by the matrix potential via a contour integral around the spectral cut.
• Significance: This establishes that pruned correlators define a discrete notion of volume on $\mathcal{M}_{g,n}$, counting weighted lattice points (integer Strebel graphs) rather than continuous volumes.

B. Universality and the BMN Limit (Theorem B)

The authors prove that in the limit where matrix powers become large (the BMN-like limit), the discrete recursion universally converges to the continuous recursion governing the Kontsevich volumes.

• Regardless of the specific matrix potential, the pruned correlators asymptote to the Kontsevich volumes $V^{\text{Kon}}_{g,n}$, scaled by constants $\sigma_\pm$ determined by the spectral curve endpoints.
• This confirms the "Airy universality" of the edge of the spectrum in matrix models, showing that the microscopic details of the potential wash out in this limit.

C. DSSYK and Okuyama's Conjecture (Theorem C)

The paper applies the framework to the DSSYK matrix integral (the ETH matrix model description of Double-Scaled SYK).

• They compute the specific building-block function $H_q(\ell)$ for the DSSYK spectral curve, which involves a $q$-series (where $q = e^{-\lambda}$).
• They demonstrate that $H_q(\ell)$ is a $q$-analog of the function $2\log(1+e^{\ell/2})$ appearing in the continuous Weil–Petersson recursion.
• Proof of Conjecture: By taking the limit $\lambda \to 0$ (with $b_i \sim L_i/\lambda$), they rigorously prove Okuyama's conjecture: the DSSYK pruned correlators converge to the Weil–Petersson volumes $V^{\text{WP}}_{g,n}$.
• This establishes the DSSYK matrix correlators as a discrete, $q$-deformation of the Weil–Petersson volumes.

4. Key Results

1. Definition of Discrete Volumes: The correlators $N_{g,n}(b_1, \dots, b_n) = \langle \prod \frac{1}{b_i} :\text{Tr}(M^{b_i}): \rangle_{g,c}$ are identified as discrete volumes counting integer Strebel graphs on $\mathcal{M}_{g,n}$.
2. Recursion Structure: The discrete recursion is given by:
   $$N_{g,n} = \sum_{\beta} \beta B(\dots) N_{g,n-1} + \frac{1}{2} \sum_{\beta, \beta'} \beta \beta' C(\dots) \left( N_{g-1, n+1} + \sum N_{h} N_{h'} \right)$$
   where kernels $B$ and $C$ depend on the matrix model potential via $H(\ell)$.
3. Convergence to Kontsevich: In the large power limit, $N_{g,n} \to (\sigma_+^{2g-2+n} + \sigma_-^{2g-2+n}) V^{\text{Kon}}_{g,n}$.
4. Convergence to Weil–Petersson: For the DSSYK model, the $q$-deformed volumes converge to the standard Weil–Petersson volumes in the combined limit, proving that DSSYK encodes the geometry of hyperbolic surfaces.
5. Geometric Interpretation: The paper provides a diagrammatic map where Feynman diagrams of pruned traces correspond to points on the moduli space. In the Gaussian case, this is a bijection to integer lattice points; in interacting cases, it is a perturbative discreteness.

5. Significance

• Unification of Volume Concepts: The work unifies three major concepts of moduli space volumes:
  1. Weil–Petersson volumes (hyperbolic geometry, continuous).
  2. Kontsevich volumes (flat Strebel metrics, continuous).
  3. Norbury discrete volumes (lattice points, discrete).
     The DSSYK matrix model serves as a master structure that interpolates between these via limits ($q \to 1$, $b_i \to \infty$, $q \to 0$).
• Beyond Double-Scaling: It provides a rigorous geometric interpretation for matrix models outside the double-scaling limit, suggesting that "discreteness" is an intrinsic feature of the matrix model expansion in the 't Hooft limit.
• DSSYK and Gravity: By proving Okuyama's conjecture, the paper strengthens the link between the DSSYK model and low-dimensional gravity (specifically sine-dilaton gravity), suggesting that the discreteness of boundary lengths in the matrix model corresponds to quantization conditions in the dual gravitational theory.
• Mathematical Physics: It bridges abstract topological recursion (Norbury/Scott) with concrete matrix model calculations, offering new tools for computing intersection numbers and volumes on moduli spaces using $q$-series and discrete sums.

In summary, this paper establishes that pruned matrix correlators are not just algebraic objects but represent a discrete geometry of the moduli space of Riemann surfaces, which smoothly transitions to known continuous geometries (Kontsevich and Weil–Petersson) under specific scaling limits.