Les Houches lecture notes on topological recursion

summary

The gist

As a meticulous researcher, I will synthesize these two summaries into a comprehensive, detailed description of Topological Recursion (TR) based on Eynard and Orantin's framework…

In short

Topological Recursion (TR) is a method to compute correlators from Hermitian matrix models using an underlying spectral curve. It starts with defining symmetric $n$-differentials based on this curve and uses a recursive formula to generate all higher-order correlators. This framework connects matrix models to enumerative geometry and quantum curves, providing a powerful tool for calculating complex physical quantities.

Key concepts

Spectral Curve
This is the starting geometric object, defined by a Riemann surface $\Sigma$ and a holomorphic map $x: \Sigma \to P^1$. It dictates the structure of all subsequent correlators in TR. The curve defines where singularities (ramification points) occur, which are crucial for generating the recursion.
Airy Structures
These are differential constraints that generalize Virasoro constraints found in Witten's conjecture. TR is fundamentally viewed as a specific realization of these Airy structures, providing the necessary mathematical framework to define and compute the recursive sequence of correlators.
Loop Equations
TR is uniquely identified as the solution to a specific set of loop equations that must satisfy a projection property. This property ensures that the resulting correlators are symmetric and correctly represent physical observables derived from matrix models.

Terminology used across episodes

This episode discusses

The paper

Les Houches lecture notes on topological recursion · Read on arXiv

VINCENT BOUCHARD

Les Houches School of Physics · National Science and Engineering Research Council of Canada

You may have seen the words "topological recursion" mentioned in papers on matrix models, Hurwitz theory, Gromov-Witten theory, topological string theory, knot theory, topological field theory, JT gravity, cohomological field theory, free probability theory, gauge theories, to name a few. The goal of these lecture notes is certainly not to explain all these applications of the topological recursion framework. Rather, the intention is to provide a down-to-earth (and hopefully accessible) introduction to topological recursion itself, so that when you see these words mentioned, you can understand what it is all about. These lecture notes accompanied a series of lectures at the Les Houches school "Quantum Geometry (Mathematical Methods for Gravity, Gauge Theories and Non-Perturbative Physics)" in Summer 2024.

DOI: 10.21468/SciPostPhysLectNotes.115

Transcript

Introduction to the show: ident: Mathematical Physics. The day in mathematical physics: rigorous models of physical systems.

Kai: I'm Kai.

Mira: And I'm Mira, here with Lev.

Kai: We're looking at the paper: "Les Houches lecture notes on topological recursion".

Mira: Here's the gist of the paper. As a meticulous researcher, I will synthesize these two summaries into a comprehensive, detailed description of Topological Recursion (TR) based on Eynard and Orantin's framework, ensuring precision while maintaining sufficient depth.

Kai: Detailed Synthesis: Topological Recursion Topological Recursion (TR) is a powerful mathematical framework introduced by Eynard and Orantin in

EO07a; EO08: as a recursive method for computing correlators arising from Hermitian matrix models.

Mira: Crucially, the authors proposed that this method can construct a sequence of correlators based solely on an underlying spectral curve, independent of whether a specific matrix model is explicitly present.

Kai: The foundation of TR lies in starting with Airy structures, which are differential constraints that naturally generalize the Virasoro constraints found in Witten's conjecture; thus, TR itself is viewed as a specific manifestation of these Airy structures.

Paper summary: Kai: So we’ve talked about what topological recursion is and how it sets up these connections to other areas like geometry and field theory.

Mira: We covered how it starts with a spectral curve and uses recursion to build correlators, focusing on the idea that this can work independently of the specific matrix model you start with.

Lev: It’s interesting that they focus on simple ramification points for now, because they want to avoid the really complicated combinatorics that come up in the general case.

Kai: And then there's this connection to loop equations, which are essentially Schwinger-Dyson equations in matrix models.

Mira: The paper shows topological recursion is a solution to those loop equations that satisfies a specific projection property, and this property is what makes it work mathematically.

Lev: That sounds like the real test—can we actually run this on real hardware?

Kai: And finally, the correspondence with Quantum Curves suggests we can use these topological recursion correlators to build a wave function that lives on some quantum curve.

Mira: If you construct that wave function in that way, there’s a corresponding quantum curve where the operator applied to it equals zero.

Lev: That would mean we could potentially quantize the spectral curve itself using this recursive method.

Kai: Overall, these notes are about making topological recursion accessible by focusing on the framework itself before jumping into all the different applications.

Mira: The paper emphasizes that understanding what topological recursion *is* is the necessary first step before diving into why it matters so much in things like knot theory or JT gravity.

Lev: It’s a solid foundation, but I wonder how much complexity we'd have to handle if we tried to take these ideas and apply them to something more complicated than simple curves.

Conclusion: Kai: So we're wrapping up this talk on topological recursion from Les Houches, looking at what Eynard and Orantin actually put down there on page two of these notes.

Mira: They’re basically showing how you can build a whole system of mathematical formulas just by having a shape—this spectral curve—and that lets you calculate complicated things without needing the specific matrix model first.

Lev: From an error correction standpoint, if this recursion works, it means we could potentially write down the structure of the quantum states we're trying to protect.

Kai: So what does this mean for us right now in terms of building something? Does it suggest a concrete way to go from a physical system, like a qubit lattice, to these topological equations?

Mira: It suggests that if you can find an admissible spectral curve for your problem—like one with simple ramification points—then the whole physics of the system is encoded in those recursion formulas.

Lev: The caveat is that finding an admissible curve itself might be just as hard as calculating the final numbers, especially when you start needing to add any sort of noise or physical boundary conditions.

Kai: So, it’s a powerful way to write down the structure, but the real challenge remains figuring out how to find that right curve for our specific hardware setup.

More episodes

← Home