Two approaches to the holomorphic modular bootstrap

This paper proposes a new approach to the holomorphic modular bootstrap by utilizing the theory of vector-valued modular forms to generate and identify new admissible solutions for rational conformal field theories.

The Gist

Imagine you are a master chef trying to create the "Ultimate Recipe Book" for a universe. In physics, we call these recipes Rational Conformal Field Theories (RCFTs). These theories are like the fundamental blueprints that describe how particles and forces behave in a perfectly balanced, two-dimensional world.

The problem is that there are infinitely many ways to mix ingredients, and most of them result in "disgusting" recipes—mathematical models that don't make sense in the real world. The goal of the "Holomorphic Modular Bootstrap" is to find only the "delicious" recipes: those where every ingredient (every mathematical coefficient) is a positive, whole number.

Here is how this paper approaches that challenge.

1. The Old Way: The "Trial and Error" Kitchen (The MMS Approach)

Previously, physicists used a method called the MMS approach. Imagine you are trying to bake a cake by guessing the exact amount of flour, sugar, and eggs. You write down a complex mathematical equation (the MLDE) and try to solve it.

As long as you are making a simple cupcake (a theory with 2 or 3 "ingredients" or characters), this works fine. But if you try to bake a massive, 6-tier wedding cake (a theory with 6 characters), the math becomes so overwhelming that the kitchen explodes. The equations become too heavy to lift, and the "trial and error" becomes impossible.

2. The New Way: The "Master Sauce" Method (The VVMF Approach)

The authors, Govindarajan and Santara, suggest a smarter way. Instead of starting from scratch with every new cake, they use a "Master Sauce" (which they call a Vector Valued Modular Form).

Think of it like this: If you already have a perfect, delicious sauce (a known RCFT), you don't need to reinvent the concept of "flavor." You already know the fundamental ratios of salt, acid, and fat.

The authors use the mathematical properties of this "Master Sauce" to generate "Quasi-Recipes" (Quasi-characters). These are new recipes that use the same flavor profile (the same "multiplier") as your original sauce.

3. The "Secret Ingredient" Trick: Fixing the Bitter Notes

There is one catch: many of these new recipes are "bitter." In math terms, they have negative numbers. A recipe that calls for "negative two eggs" is useless in a real kitchen.

The authors developed a clever way to fix this. They take their "bitter" quasi-recipes and mix them with the original "delicious" sauce using a special mathematical seasoning called the J-function.

By carefully adjusting the amount of this seasoning (the variable $b$ in their equations), they can cancel out the bitterness. Suddenly, the negative numbers disappear, and you are left with a brand-new, perfectly "delicious" recipe that follows all the rules of physics.

4. Why does this matter?

The paper proves this works by successfully "baking" several new, complex theories:

• They successfully recreated known recipes to prove their method is accurate.
• They moved beyond the "cupcake" stage, successfully creating recipes for 4, 5, and even 6-ingredient theories.

In short: Instead of trying to solve impossible equations from scratch, the authors found a way to take a "perfect" mathematical recipe and "evolve" it into new, complex, and valid universes. They have essentially given physicists a high-speed food processor for creating the blueprints of reality.

Technical Summary

This paper, titled "Two approaches to the holomorphic modular bootstrap" by Suresh Govindarajan and Jagannath Santara, presents a novel mathematical framework for classifying Rational Conformal Field Theories (RCFTs) by leveraging the theory of Vector-Valued Modular Forms (VVMFs).

1. The Problem: Limitations of the MMS Approach

The traditional method for classifying RCFTs is the Mathur-Mukhi-Sen (MMS) approach. This method treats the characters of an RCFT as linearly independent solutions to a Modular Linear Differential Equation (MLDE). The goal is to find "admissible" solutions—those whose $q$-series expansions have non-negative integral coefficients.

However, the MMS approach faces a significant computational bottleneck: as the number of characters ($n$) increases, solving the MLDE becomes exponentially difficult. While successful for $n=2$ and $n=3$, the method becomes practically unfeasible for higher ranks, making a systematic classification of higher-rank RCFTs extremely challenging.

2. Methodology: The VVMF Approach

The authors propose a complementary method based on the work of Bantay and Gannon regarding Vector-Valued Modular Forms (VVMFs). Instead of solving an MLDE from scratch, they use a known RCFT as a "seed."

The core technical steps are:

• Character Vectorization: The $n$ characters of a known RCFT are organized into a rank-$n$ vector $\mathbf{X}(\tau)$, which transforms under the modular group $SL(2, \mathbb{Z})$ via a multiplier $\rho$ (defined by the $S$ and $T$ matrices).
• Generating New Solutions: Using the property that the space of weakly holomorphic VVMFs is a module over the ring of modular forms, the authors apply invariant differential operators ($\nabla_{1,w}, \nabla_{2,w}, \nabla_{3,w}$) to the seed vector $\mathbf{X}$. This generates a set of new solutions, $\mathbf{Y}_i$, which share the exact same $S$ and $T$ matrices (and thus the same modular properties) as the original RCFT.
• Quasi-characters to Admissible Solutions: The newly generated solutions $\mathbf{Y}_i$ often have negative coefficients (termed "quasi-characters"). To find physically viable RCFTs, the authors construct linear combinations of the original characters $\mathbf{X}$ and the new solutions $\mathbf{Y}_i$, often involving the Klein-$J$ invariant:
  $$\mathbf{W}_r = (J(\tau) + b)\mathbf{X} - \sum_{i=1}^r r_0^{(i)} \mathbf{Y}_i$$
  By varying the parameter $b$, they search for combinations where the $q$-series coefficients become non-negative integers.

3. Key Contributions and Results

The paper demonstrates the efficacy of this method through several increasingly complex examples:

• Two-Character Case: The authors successfully reproduce known admissible solutions for Wronskian indices $\ell=6$ and $\ell=8$, validating their method against existing literature.
• Three-Character Case: Using a $(3,3)$ RCFT as a seed, they generate new admissible solutions, including those previously identified via the MLDE method.
• Four-Character Case: They apply the method to the three-state Potts model (viewed as a four-character theory) and successfully find a family of admissible characters with central charge $c = 124/5$.
• Five and Six-Character Cases: The authors extend the method to higher ranks. For a $(5,0)$ theory (affine Lie algebra $F_4$ at level 2), they find numerous new admissible characters. For the rank-six tricritical Ising model, they demonstrate how to handle cases where the rank of the coefficient matrix is not maximal, allowing them to extract new solutions.

4. Significance

The significance of this work lies in its ability to bypass the direct solution of high-order MLDEs.

1. Computational Efficiency: By starting with a known solution, the problem shifts from solving complex differential equations to performing algebraic manipulations and $q$-series expansions.
2. New Classification Tools: The method provides a systematic way to generate "families" of potential RCFTs with higher Wronskian indices and higher central charges (e.g., $c \to c+24$).
3. Bridging Physics and Mathematics: The paper connects the physical requirements of RCFT (non-negativity of states) with the deep mathematical structure of VVMFs and the Riemann-Roch theorem.

In conclusion, the authors provide a powerful new tool for the holomorphic modular bootstrap that extends the reach of RCFT classification into higher-rank regimes that were previously inaccessible.