Blobbed topological recursion and KP integrability

This paper generalizes the notion of blobbed topological recursion to settings with non-topological expansions and proves that its differentials satisfy KP integrability when the input blobs are KP-integrable, thereby unifying and providing a new proof for the previously conjectured integrability of non-perturbative differentials.

The Gist

Imagine you are trying to solve a massive, impossible puzzle. In the world of mathematics, this puzzle is about counting things (like shapes, knots, or ways to arrange particles) and finding hidden patterns in how they grow.

This paper is like a master key that unlocks a new, more powerful way to solve these puzzles. It connects three big ideas: a method called "Topological Recursion," a concept called "Blobs," and a powerful mathematical engine called "KP Integrability."

Here is the story of the paper, broken down into simple analogies.

1. The Original Puzzle Solver: Topological Recursion

Imagine you have a machine that builds complex structures out of simple Lego bricks. This machine is called Topological Recursion.

• How it works: It starts with a simple shape (a "spectral curve") and a set of rules. It then recursively builds bigger and bigger shapes, layer by layer.
• The Limit: For a long time, this machine only worked if the rules were very strict and "perfect." If the rules were slightly messy or "imperfect," the machine would break or give wrong answers.

2. The New Upgrade: "Blobs"

The authors realized that sometimes the rules are messy. To fix this, they invented a new version of the machine called Blobbed Topological Recursion.

• The Analogy: Imagine the original machine is a strict chef who only cooks with perfect, pre-cut vegetables. The new machine is a chef who can handle "blobs" of ingredients—messy, irregular chunks of data that don't fit the perfect mold.
• The "Blob": Think of a "blob" as a special, pre-made sauce or a secret ingredient you add to the recipe. It represents complex, messy data that the original machine couldn't handle. The new machine can take this messy blob, mix it with the standard rules, and still produce a perfect, structured dish.

3. The Secret Sauce: KP Integrability

Now, here is the magic trick. In mathematics, there is a property called KP Integrability.

• The Analogy: Think of KP Integrability as a "perfect rhythm" or a "hidden harmony." If a system of equations has this rhythm, it means the system is stable, predictable, and can be solved exactly. It's like a song that never goes out of tune, no matter how complex the melody gets.
• The Big Question: Mathematicians had a hunch (a conjecture) that even when you add these messy "blobs" to the machine, the final result would still keep this perfect rhythm. But nobody could prove it for the messy cases.

4. The Breakthrough: The "Convolution" Bridge

The authors of this paper built a bridge to prove the hunch. They used a technique called Convolution.

• The Analogy: Imagine you have two different types of music playing at once. One is a perfect, classical symphony (the standard rules), and the other is a jazz improvisation (the messy blobs).
• The Magic: The authors showed that if you "mix" (convolve) these two sounds together in a very specific way, the resulting music still keeps the perfect classical rhythm.
• The Result: They proved that no matter how messy your "blob" is, as long as the blob itself has a hidden rhythm (is KP integrable), the final result of the whole machine will also have that perfect rhythm.

5. Why This Matters

This paper does three huge things:

1. It Generalizes: It says, "You don't need perfect rules anymore. You can use messy, real-world data (blobs), and our machine will still work."
2. It Unifies: It shows that two different ways of looking at the problem (the "blobbed" way and the "non-perturbative" way) are actually the same thing. It's like realizing that a map drawn by a pilot and a map drawn by a sailor are describing the same island, just from different angles.
3. It Proves the Conjecture: It finally proves the long-standing guess that these messy systems still have that beautiful, hidden mathematical harmony (KP integrability).

The "Bus Stop" Moment

The authors even include a funny note in the acknowledgments. They thank a Korean bus company (KoBus) for the excellent working conditions on a bus ride between Pohang and the airport.

• The Metaphor: Sometimes, the best ideas don't come from a fancy lab, but from a quiet, bumpy bus ride where you have time to think. It's a reminder that deep math can happen anywhere, even while you are just traveling from point A to point B.

Summary

In short, this paper says: "We upgraded the mathematical machine to handle messy, real-world data. We proved that even with this mess, the system remains perfectly harmonious and solvable. And we did it all while riding a bus."

Technical Summary

1. Problem Statement

The paper addresses foundational questions regarding the interrelation between three major concepts in mathematical physics and enumerative geometry:

1. Topological Recursion (TR): Specifically the Chekhov–Eynard–Orantin (CEO) recursion and its generalizations.
2. Blobbed Topological Recursion (BTR): An extension of TR designed to solve "abstract loop equations" by incorporating "blobs" (additional data) that do not necessarily admit a topological expansion.
3. KP Integrability: The property that a system of differentials generates a tau-function satisfying the Kadomtsev–Petviashvili (KP) hierarchy.

The Core Conjecture: A long-standing conjecture by Borot and Eynard posits that non-perturbative differentials (differentials arising from topological recursion merged with Krichever differentials) are KP integrable. While recently proved by the authors in a separate work, the paper seeks to:

• Revise the definition of Blobbed Topological Recursion to be more general (allowing blobs without topological expansions).
• Unify the framework of BTR with non-perturbative differentials.
• Provide a new, conceptually distinct proof of the KP integrability of these differentials.
• Establish the preservation of KP integrability under the convolution of differential systems.

2. Methodology

The authors employ a combination of algebraic geometry, integrable systems theory, and combinatorial graph theory.

• Global KP Integrability Framework: The paper adopts a "global" viewpoint where KP integrability is defined as a property of a system of meromorphic differentials $\{\omega_n\}$ on a Riemann surface $\Sigma$. This is characterized by the existence of a kernel $K$ such that $\omega_n$ can be expressed as determinants (or connected determinants) of $K$.
• Convolution of Differentials: A central technical tool introduced is the convolution of two systems of differentials, $\{\psi_n\}$ and $\{\phi_n\}$. This is defined via a sum over graphs where vertices are decorated by the differentials and edges represent a specific bilinear operator involving residues and integrals.
  • Formula: $\tilde{\omega}_n = \sum_{\Gamma \in \mathcal{G}_n} \frac{w(\Gamma)}{|\text{Aut}(\Gamma)|}$.
  • This operation is shown to correspond to a Moyal-type product of the generating potentials of the systems.
• Deformation and Trivialization: The proof strategy relies on deforming the input data (specifically the "blobs" or the kernel $B$) while preserving KP integrability. The authors demonstrate that any KP-integrable system can be continuously deformed into a "trivial" system (where only the diagonal pole remains) or a system where one component vanishes, thereby reducing the problem to known cases.
• Graphical Calculus: The paper extensively uses graph expansions to define convolved differentials and to prove invariance properties (e.g., independence of the choice of the Bergman kernel).

3. Key Contributions

A. Revision of Blobbed Topological Recursion

The authors propose a generalized definition of BTR that extends the original framework:

• Generalized Input: The input data includes a Riemann surface $\Sigma$, meromorphic forms $dx, dy$, a set of key points $P$, and a system of "blobs" $\{\phi_n\}$.
• Relaxed Constraints: Unlike previous definitions, the blobs $\{\phi_n\}$ are not required to admit a topological expansion (i.e., they need not be organized by genus $g$). They can be arbitrary formal series in $\hbar$.
• Construction: The BTR differentials $\omega_n$ are constructed by convolving the standard Generalized Topological Recursion (GenTR) differentials (associated with a chosen Bergman kernel $B$) with the "blob" differentials (shifted by $B$).

B. The Convolution Theorem (Conservation of KP Integrability)

Theorem 3.8 is a pivotal result: If two systems of differentials $\{\psi_n\}$ and $\{\phi_n\}$ are KP integrable, and they satisfy specific regularity conditions (one extends regularly outside a domain, the other is regular inside), then their convolution $\{\omega_n\}$ is also KP integrable.

• This result is proven by showing that infinitesimal deformations preserving KP integrability in the input systems induce deformations preserving KP integrability in the output system.
• It establishes that the convolution operation acts as a "KP-integrability preserving" map.

C. Unification with Non-Perturbative Differentials

The paper demonstrates that non-perturbative differentials (previously defined via Krichever constructions and Riemann theta functions) are a specific instance of the revised Blobbed Topological Recursion.

• In this context, the "blobs" are identified with the Krichever differentials.
• This identification allows the authors to treat non-perturbative effects as a deformation of standard topological recursion via the convolution mechanism.

D. New Proof of the Borot–Eynard Conjecture

Using the revised framework and the Convolution Theorem, the authors provide a new proof that non-perturbative differentials are KP integrable.

• Logic:
  1. Standard TR differentials on a rational curve (or with specific inputs) are known to be KP integrable.
  2. Krichever differentials (the blobs) are KP integrable by construction (algebro-geometric solutions).
  3. By the Convolution Theorem, the resulting blobbed differentials (which are the non-perturbative differentials) must be KP integrable.
• This proof is conceptually distinct from the original proof in [ABDBKS24b], relying on the structural properties of the convolution rather than direct analysis of the graph sums.

E. Multi-KP Hierarchy

The paper discusses Multi-KP integrability, where a system of differentials is expanded at multiple points on the curve.

• They show that expanding at $N$ distinct points leads to an $N$-component KP hierarchy (related to the Toda lattice hierarchy for $N=2$).
• This provides a conceptual explanation for the appearance of multi-component KP systems in the study of Hurwitz–Frobenius manifolds and Dubrovin–Zhang hierarchies.

4. Key Results

1. Generalized BTR Definition: A robust definition of BTR that accommodates non-topological blobs, unifying various recursive structures.
2. Independence of Bergman Kernel: The resulting blobbed differentials are independent of the specific choice of the Bergman kernel $B$ used in the construction (Lemma 4.16).
3. Convolution Preservation: The convolution of KP-integrable systems yields a KP-integrable system (Theorem 3.8).
4. Recursion Relations: The paper derives recursive relations (generalized loop equations and projection properties) for the blobbed differentials, allowing for their computation without explicit graph summation (Propositions 4.21 and 4.22).
5. Global Integrability: The KP integrability of the blobbed system is a global property, holding for the entire spectral curve even if the construction is local.

5. Significance

• Theoretical Unification: The paper bridges the gap between "perturbative" topological recursion (genus expansions) and "non-perturbative" effects (Krichever solutions) under a single umbrella of Blobbed Topological Recursion.
• Foundational Clarity: It clarifies the role of the Bergman kernel and the "blobs," showing that the choice of kernel is a gauge freedom that does not affect the physical (KP-integrable) output.
• New Proof Technique: The proof of the Borot–Eynard conjecture via convolution and deformation offers a powerful new tool for analyzing integrability in complex systems, potentially applicable to other areas like knot theory and matrix models.
• Multi-Component Systems: The detailed analysis of Multi-KP hierarchies provides a rigorous link between the geometry of Riemann surfaces with multiple marked points and multi-component integrable systems, explaining phenomena observed in the study of Frobenius manifolds.

In summary, this paper redefines the landscape of topological recursion by extending it to non-perturbative regimes, proving that the resulting structures retain the crucial property of KP integrability through a novel convolution mechanism, and providing a unified framework for understanding algebro-geometric solutions of integrable hierarchies.