Updating the holomorphic modular bootstrap

This paper updates the holomorphic modular bootstrap by incorporating exact S-matrix results to classify admissible solutions for modular linear differential equations with up to six characters and effective central charge up to 24, subsequently identifying those with consistent fusion rules as tenable and mapping them to specific conformal field theories and modular tensor categories.

The Gist

Imagine the universe is built from a giant, cosmic Lego set. In the world of physics, specifically in Conformal Field Theories (CFTs), scientists are trying to figure out exactly which Lego bricks (particles) exist and how they can snap together to build stable structures.

This paper, written by Suresh Govindarajan and Akhila Sadanandan, is like a massive update to the instruction manual for finding these Lego sets. It's called the "Holomorphic Modular Bootstrap," which sounds intimidating, but let's break it down into a story about detectives, recipes, and magic mirrors.

The Big Picture: The Detective's Job

In the 1990s, physicists realized that if you look at the "fingerprint" of a particle system (called a character), it follows very strict mathematical rules. These rules are like a secret code that only certain types of Lego sets can crack.

The goal of the "Bootstrap" program is to find every possible Lego set that follows these rules.

• The Problem: There are too many possibilities. It's like trying to find a specific needle in a haystack the size of a galaxy.
• The Old Way: Scientists used to guess the shape of the needle and then check if it fit. This was slow and often missed things.
• The New Way (This Paper): The authors have updated the tools. They now have a "magic mirror" (a new mathematical result) that can instantly tell them if a needle is real or a fake, and they have a better map of the haystack.

The Tools of the Trade

1. The Recipe Book (MLDEs)

Think of the Modular Linear Differential Equations (MLDEs) as a set of recipes.

• A recipe tells you how to bake a cake (a particle system).
• The ingredients are numbers like the "Central Charge" (how much energy the system has) and "Conformal Weights" (the size of the particles).
• Some recipes are rigid (you can't change a single ingredient). Others have Accessory Parameters—these are like "secret spices" you can add. If you add the wrong amount of spice, the cake collapses. If you add the right amount, it's delicious.

The authors focused on recipes that have one secret spice (one accessory parameter). They wanted to find every possible "delicious cake" (a valid physical theory) that could be made with up to 6 types of ingredients (characters).

2. The "Modulo One" Puzzle

Imagine you are trying to guess a combination lock. You know the numbers are between 0 and 1, but you don't know the exact decimals.

• The Old Method: You tried every single number.
• The New Method (KLP): A team of researchers (Kaidi, Lin, Parra-Martinez) figured out that the numbers on the lock can only be certain fractions (like 1/3, 2/7, 5/9). They gave the authors a shortlist of allowed fractions.
• The Result: Instead of searching the whole ocean, the authors only had to search a few specific ponds. This made the job much faster.

3. The Magic Mirror (The S-Matrix)

Once you bake a cake, you need to know if it's stable. In physics, this means checking if the particles can interact without breaking the laws of the universe.

• This is done using something called the S-matrix. Think of it as a magic mirror that reflects how characters transform under modular transformations.
• The Breakthrough: Previously, figuring out this mirror was incredibly hard, like trying to solve a Rubik's cube blindfolded.
• The Update: The authors used a recent discovery that lets them look at the recipe (the MLDE) and directly see the reflection in the mirror. The S-matrix encodes how the characters transform under the modular transformation $\tau \to -1/\tau$. By calculating this directly, they can instantly determine the fusion rules (how particles combine) via the Verlinde formula, checking if the particles interact nicely.

The Process: From "Admissible" to "Tenable"

The authors went through a three-step filtering process to find the "good" theories:

1. Admissible (The "Looks Good" List):
   They generated a list of solutions where the numbers (the "ingredients") are all positive whole numbers.

   • Analogy: Imagine a list of cake recipes where the number of eggs, cups of flour, and sugar are all positive integers. These are "admissible" recipes. They could work, but they might still taste terrible.

2. Tenable (The "Actually Works" List):
   They took the "admissible" list and checked the Fusion Rules. This is like checking if the cake actually holds together when you cut it.

   • If the particles interact in a way that creates negative probabilities or impossible physics, the recipe is rejected.
   • If the math works out perfectly, the solution is "Tenable." This means it's a strong candidate for a real physical universe.

3. Identifying the Cake:
   For the "Tenable" solutions, they asked: "Do we already know this cake?"

   • Sometimes, they found a recipe that matched a known Lego set (like the famous Ising Model or theories based on Lie Algebras).
   • Sometimes, they found a "Tenable" solution that doesn't match anything we know yet. These are the mystery cakes—potential new universes waiting to be discovered.

The Results: What Did They Find?

The authors crunched the numbers for systems with up to 6 particles and a specific energy limit.

• They found a complete list of all the "Admissible" recipes (the potential cakes).
• They filtered this down to the "Tenable" ones (the real cakes).
• They identified which ones correspond to known physics and which ones are new.
• They even found some "degenerate" cases where the vacuum (the empty space) is weird, which usually means the theory isn't a standard physical universe, but it's still mathematically interesting.

Why Should You Care?

You might think, "I don't bake cakes or solve differential equations." But this work is fundamental.

• For Physicists: It narrows down the search for a "Theory of Everything." It tells us exactly which mathematical structures are possible in our universe.
• For Mathematicians: It connects two different worlds: the world of Modular Forms (complex number patterns) and Vertex Operator Algebras (abstract algebra).
• For the Future: By finding these "Tenable" solutions, they might be uncovering the blueprints for new phases of matter or even new dimensions of space-time that we haven't discovered yet.

The Takeaway

This paper is a masterclass in efficiency. By combining a better map (the allowed exponents) with a better mirror (the direct S-matrix calculation), the authors didn't just find a few more needles in the haystack; they mapped out the entire haystack for systems with up to six characters and told us exactly which needles are real gold and which are just fool's gold.

They are essentially saying: "Here is the complete list of all possible Lego sets that follow the rules of the universe, but only for those with up to six types of bricks. We have solved the puzzle for this size, but the classification problem for Lego sets with more than six bricks remains an open question. Now, let's go build the ones we found."

Technical Summary

1. Problem Statement

The paper addresses the classification of Rational Conformal Field Theories (RCFTs) in two dimensions using the Holomorphic Modular Bootstrap program. The core challenge is to identify all possible RCFTs characterized by a finite number of characters ($n$) and a specific Wronskian index ($\ell$).

• The Framework: RCFT characters form a Vector Valued Modular Form (VVMF) that satisfies a Modular Linear Differential Equation (MLDE).
• The Difficulty: Finding "admissible" solutions (where $q$-series coefficients are non-negative integers) is a Diophantine problem. As $n$ and $\ell$ increase, the number of parameters (accessory parameters) in the MLDE grows, making the search space vast.
• The Gap: Previous methods struggled to efficiently determine the S-matrix (which encodes fusion rules) and resolve ambiguities in the normalization of characters for theories with accessory parameters. Furthermore, distinguishing between "admissible" solutions (mathematically valid $q$-series) and "tenable" solutions (those with consistent, non-negative fusion rules compatible with an RCFT) was computationally difficult.

2. Methodology

The authors propose an updated holomorphic modular bootstrap workflow that integrates recent theoretical advances to streamline the classification process. The methodology consists of three main steps:

Step 1: Fixing Exponents via Modular Representation Theory

Instead of guessing exponents, the authors utilize the Kaidi-Lin-Parra-Martinez (KLP) method.

• They determine the allowed exponents modulo 1 by analyzing the representation theory of $PSL(2, \mathbb{Z}_N)$.
• This restricts the search space to a finite set of exponent configurations for a given number of characters $n$ and central charge constraint.
• The authors extend the KLP lists (previously available for $n \le 5$) to $n=6$.

Step 2: Solving for Admissible Solutions with Accessory Parameters

The paper focuses on MLDEs with one accessory parameter (specifically the $(4,2)$, $(5,2)$, and $(6,0)$ classes, and a specific case of $(4,4)$).

• Diophantine Constraints: They solve for the accessory parameter $\rho$ by imposing that the Fourier coefficients of the characters are non-negative integers.
• Normalization Ambiguity: A key issue is that admissible solutions can be rescaled by integers ($y_i$). The authors fix this ambiguity by requiring multiplicities to be square-free positive integers and by checking consistency with fusion rules.

Step 3: Computing the S-Matrix and Verifying Tenability

This is the most significant methodological update.

• Direct S-Matrix Extraction: Instead of relying on group-theoretic monodromy analysis (which becomes intractable for $n > 3$), the authors implement a recent result (Ref. [21]) to compute the S-matrix directly from the MLDE.
• Coordinate Transformation: They transform the MLDE from the $\tau$-plane to the $w$-plane ($w = 1728/J(\tau)$). The monodromy around $w=1$ corresponds to the S-matrix.
• Connection Matrix: They numerically compute the connection matrix between Frobenius bases at $w=0$ and $w=1$ to extract the S-matrix.
• Exact Reconstruction: Using lattice basis reduction algorithms (Lenstra–Lenstra–Lovász), they convert numerical S-matrix entries into exact algebraic numbers within the appropriate cyclotomic field.
• Tenable Definition: A solution is deemed tenable if the resulting fusion rules (via the Verlinde formula) are non-negative integers and consistent with an RCFT structure.

3. Key Contributions

1. Extension to $n=6$: The authors successfully extend the classification of allowed exponents modulo 1 to six-character theories, a significant step up from previous $n \le 5$ limits.
2. Algorithmic S-Matrix Determination: They demonstrate a robust, automated method to derive exact S-matrices for MLDEs with accessory parameters, bypassing the need for complex monodromy group classification.
3. Resolution of Normalization Ambiguities: They provide a systematic procedure to fix the integer scaling factors ($y_i$) of characters, ensuring the resulting S-matrix and fusion rules are physically meaningful.
4. Comprehensive Classification: They provide a complete list of admissible solutions for $n=4, 5, 6$ with $\ell < 6$ and effective central charge $c_{eff} \le 24$.

4. Key Results

The paper presents extensive tables (Appendix D) cataloging the results:

• Scope: The study covers $(4,2)$, $(4,4)$, $(5,2)$, and $(6,0)$ MLDEs.
• Admissible vs. Tenable:
  • They identify numerous admissible solutions (solutions with non-negative integer $q$-series).
  • They filter these to find tenable solutions (those with valid fusion rules).
  • Many admissible solutions are found to be untenable (fusion rules contain negative integers or are inconsistent).
• Specific Discoveries:
  • $(4,2)$ Class: Identified tenable solutions corresponding to known tensor products (e.g., $D_{4,1} \otimes A_{1,1}$) and potential new non-unitary RCFTs.
  • $(6,0)$ Class: Found a solution (Entry 13.3) identified as the IVOA (Infinite-Order Vertex Operator Algebra) type $E_{7}^{1/2, 2}$, which satisfies conditions expected of such a theory.
  • Non-Unitary Theories: The authors explicitly identify non-unitary tenable solutions by determining which operator corresponds to the identity (often not the first character in the list).
  • IVOA Types: Several solutions are flagged as "IVOA type" (degenerate vacuum), which are candidates for theories that may not be standard RCFTs but are mathematically consistent.
• S-Matrices: The paper provides explicit exact S-matrices for all tenable solutions found, categorized by their MTC (Modular Tensor Category) class or known RCFT identification.

5. Significance

• Systematic Classification: This work moves the modular bootstrap from a case-by-case analysis to a systematic, algorithmic classification program for theories with accessory parameters, specifically achieving a complete classification up to six characters. The general classification problem remains open for theories with more than six characters.
• Bridge to Physics: By distinguishing "tenable" solutions, the paper filters out mathematical curiosities to highlight theories that could physically exist as RCFTs or Vertex Operator Algebras (VOAs).
• New Candidates: The identification of specific tenable solutions with $c_{eff} \le 24$ (within the $n \le 6$ scope) provides concrete candidates for new RCFTs, including potential non-unitary theories and IVOAs, which are of interest in the study of quantum Hall systems and string theory compactifications.
• Methodological Benchmark: The integration of numerical monodromy computation with lattice reduction for exact algebraic reconstruction sets a new standard for solving MLDEs in higher ranks, offering a pathway for future extensions beyond the current $n=6$ limit.

In summary, this paper updates the holomorphic modular bootstrap by integrating modern representation theory and numerical linear algebra techniques to successfully classify and validate RCFT candidates up to six characters, resolving long-standing ambiguities in the determination of S-matrices and fusion rules, while acknowledging that the classification problem remains open for higher numbers of characters.