Signs, growth and admissibility of quasi-characters and the holomorphic modular bootstrap for RCFT

This paper utilizes Frobenius recursion relations to rigorously establish the growth and alternating sign behavior of rank-2 quasi-character coefficients in the intermediate energy regime, thereby providing a practical method to construct admissible partition functions for rational conformal field theories via the holomorphic modular bootstrap.

The Gist

The Big Picture: Building a Lego Castle

Imagine you are trying to build a perfect, magical castle (a Rational Conformal Field Theory, or RCFT) using a specific set of Lego bricks. In the world of theoretical physics, these "bricks" are mathematical objects called characters.

To build a valid castle, the bricks must follow two strict rules:

1. Modular Invariance: The castle must look the same no matter how you rotate or stretch the ground it sits on (mathematically, it must respect symmetries of a torus).
2. Physical Admissibility: The castle must be made of whole, positive bricks. You can't have negative bricks or half-bricks. In the math, this means the numbers (coefficients) in the expansion of these characters must be integers and positive.

For a long time, physicists knew how to build these castles for small, simple cases. But as the castles got bigger (higher "rank" or complexity), it became incredibly hard to find the right combination of bricks.

The Problem: The "Quasi-Bricks"

The authors introduce a new tool called quasi-characters. Think of these as "rough draft" Lego bricks.

• They are mathematically perfect and fit the rotation rules (Modular Invariance).
• However, they are flawed: some of their numbers are negative. If you tried to build a castle with just these, you'd end up with "negative space" or holes, which doesn't make physical sense.

The big breakthrough in previous work (referenced as [16]) was realizing that if you take several of these "rough draft" bricks and mix them together (add them up), the negative parts might cancel out, leaving you with a perfect set of "admissible" bricks (all positive numbers).

The Challenge: To mix them correctly, you need to know exactly where the negative numbers are and how big they are. If you guess wrong, the negatives won't cancel, and your castle collapses.

The Discovery: The "Alternating Dance"

The authors of this paper set out to map out exactly where these negative numbers hide in the rough draft bricks. They discovered a fascinating pattern, which they prove rigorously in this paper.

Imagine the numbers in a quasi-character as a line of dancers.

1. The Alternating Phase: At the beginning of the line, the dancers switch between wearing black shirts (negative numbers) and white shirts (positive numbers). They dance in a strict rhythm: Black, White, Black, White...
2. The Crossover Point: This alternating dance doesn't go on forever. It stops at a very specific moment. The paper proves that this "crossover" happens when the position in the line ($n$) is roughly equal to the size of the central charge ($c$) divided by 12.
   • Analogy: Imagine a pendulum swinging back and forth. It swings wildly for a while, but at a specific point in time, it suddenly stops swinging and just moves forward in one direction.
3. The Stabilization: After that crossover point, the dancers stop switching. They all put on the same color shirt (either all white or all black) and march forward.

The Two Main Contributions

The paper does two main things to prove this:

1. The "Big Picture" Estimate (The Approximation)
The authors used a method similar to looking at a crowd from a high hill. When the numbers get very large, they used mathematical shortcuts (Frobenius recursion and approximations) to estimate how fast the numbers grow.

• They found that the "rough draft" numbers grow exponentially (they get huge very fast).
• They proved that the "alternating dance" is real and that the switch to a single color happens exactly at the predicted spot ($n \approx c/12$).
• Why this matters: It gives physicists a "rule of thumb" to know how much "negative space" they need to cancel out when building their castles.

2. The "Microscope" Proof (The Induction)
Approximations are good, but in math, you need absolute certainty. The authors then performed a rigorous, step-by-step proof (mathematical induction).

• They showed that for every single step in the line, the "negative" influence is strong enough to flip the sign, but once you pass the crossover point, the "positive" influence takes over completely and never looks back.
• They proved that the numbers don't just grow; they grow super-geometrically (faster than a standard geometric progression) in the alternating region. This means the "rough draft" numbers get massive very quickly, which is crucial for understanding how to cancel them out.

Why This Matters for Physics

The paper doesn't claim to build a new universe or solve a clinical problem. Instead, it provides the blueprint for a new way to classify all possible Rational Conformal Field Theories.

• Before: Physicists were trying to find these theories by guessing and checking, which was like trying to find a specific Lego castle in a dark room by feeling around.
• Now: With this paper, they have a flashlight. They know exactly where the "negative bricks" are and how big they are. This allows them to systematically combine the "rough drafts" to create valid, physical theories.

Summary

Think of the paper as a guidebook for a master builder. The builder has a pile of "rough" materials (quasi-characters) that look promising but have some flaws (negative numbers). This paper proves exactly where the flaws are located and how big they are. With this knowledge, the builder can now mix the materials perfectly to construct valid, stable structures (admissible RCFTs) that were previously too difficult to find.

The key takeaway is the discovery of the "alternating sign pattern" that stabilizes at a specific point, a rule that holds true for a vast family of these mathematical objects, turning a chaotic guessing game into a solvable puzzle.

Technical Summary

1. Problem Statement and Motivation

The classification of 2D Rational Conformal Field Theories (RCFTs) is a central problem in theoretical physics. A key step in this classification is identifying admissible Vector-Valued Modular Forms (VVMFs). These are characters $\chi_i(\tau)$ that transform under $SL(2, \mathbb{Z})$ and possess a $q$-expansion ($q = e^{2\pi i \tau}$) with non-negative integer coefficients ($a_{i,n} \in \mathbb{Z}_{\geq 0}$).

• The Challenge: Directly solving for admissible characters is difficult, especially for higher ranks and Wronskian indices ($\ell$).
• The Approach: Previous work (specifically Ref. [16]) introduced quasi-characters. These are solutions to Modular Linear Differential Equations (MLDEs) that have integral coefficients but are not necessarily non-negative. They form a linear basis for all admissible characters.
• The Gap: To construct admissible characters from quasi-characters, one must understand the signs and growth of the quasi-character coefficients. Specifically, it was observed empirically that coefficients alternate in sign up to a certain order $n \sim c/12$ (where $c$ is the central charge) and then stabilize to a fixed sign. However, rigorous proofs for these patterns and estimates for the growth in this "crossover" region were missing.

2. Methodology

The authors focus on the $\ell=0$ family of quasi-characters (solutions to the MMS equation) and employ a multi-pronged approach:

A. Frobenius Recursion Relations

The quasi-characters are solutions to a second-order MLDE. The authors utilize the Frobenius method to derive recursion relations for the $q$-expansion coefficients $a_n$.
$$a_n = \sum_{i=1}^n f_M(n, i) a_{n-i}$$
where $f_M(n, i)$ depends on the central charge parametrization $c = 24M + j$ and divisor functions $\sigma_k(i)$.

B. Asymptotic Analysis

The authors analyze the behavior of coefficients in two distinct limits:

1. $n \gg c$: Using the Rademacher formula, they confirm that coefficients grow exponentially and stabilize to a fixed sign (Type I or Type II) determined by the sign of the central charge.
2. $c \gg n$: Using the large-$c$ limit of the recursion, they prove that coefficients alternate in sign for the first $M$ terms (for $M>0$) before stabilizing.

C. Intermediate Region Analysis ($n \sim |c|/12$)

This is the critical region where the sign alternation stops. The authors develop:

• A "Crude" Approximation: By assuming the recursion is dominated by the $i=1$ term, they derive an approximate product form for $a_n$. This successfully predicts the sign pattern and the exponential growth rate $a_{2M} \sim e^{\gamma M}$.
• A "Better" Approximation: They organize the full recursion solution as a sum over partitions, introducing correction terms $g_M(k, m)$. They show that these corrections can be summed to form an exponential factor, refining the growth estimate and confirming the sign stability.

D. Rigorous Inductive Proof

To remove reliance on approximations, the authors provide a rigorous inductive proof for the sign patterns:

• They establish bounds on the divisor functions $\sigma_k(i)$ and the recursion kernel $f_M(n, i)$.
• They define a transformed sequence $b_n = (-1)^n a_n$ (for alternating regions) and prove that $b_n$ grows super-geometrically ($b_n \geq R b_{n-1}$ with $R > 1$).
• This super-geometric growth ensures that the leading term in the recursion dominates the sum of all sub-leading terms, thereby rigorously proving that the sign of $a_n$ is determined solely by the sign of the leading term (and thus follows the alternating pattern) until the crossover point.

3. Key Contributions and Results

1. Rigorous Proof of Sign Alternation

The paper proves that for $\ell=0$ quasi-characters:

• Identity Character ($M>0$): Coefficients $a_n$ alternate in sign for $1 \leq n \leq 2M$ (specifically $a_n < 0$ for odd $n$) and become strictly positive for $n > 2M$.
• Non-Identity Character ($M>0$): Coefficients are strictly positive for all $n$.
• Symmetry: For $M<0$, the roles of the identity and non-identity characters are reversed regarding sign patterns.
• Crossover Point: The transition from alternating signs to a fixed sign occurs precisely at $n \approx 2|M| \approx c/12$.

2. Growth Estimates in the Crossover Region

The authors provide precise estimates for the magnitude of the coefficients at the crossover point ($n \approx 2M$):

• For $M > 0$, the coefficient $a_{2M}$ grows as:
  $$a_{2M} \sim e^{12.14 M}$$
  This is derived by combining the crude approximation with exponential corrections from the $g_M$ terms. This result bridges the gap between the polynomial growth seen at small $n$ and the Rademacher growth at large $n$.

3. Super-Geometric Growth

A novel finding is that in the region $1 \leq n \leq 2M$, the coefficients exhibit super-geometric growth (ratio $a_n/a_{n-1} > 1$ and increasing), contrasting with the geometric growth ($a_n/a_{n-1} \approx \text{const}$) seen in the Rademacher regime ($n \gg c$). This implies a "sparseness" of states in the intermediate energy regime.

4. Construction of Admissible Characters

The paper clarifies the mechanism for building admissible characters. By combining quasi-characters with different $M$ values (linear combinations), the negative coefficients of one quasi-character can be cancelled by the positive coefficients of another. The rigorous understanding of the sign patterns and growth rates allows for the systematic identification of valid linear combinations that yield non-negative integer coefficients.

4. Significance

• Completeness of Classification: The results provide a practical path to classify all rank-2 RCFTs with arbitrary Wronskian index $\ell$. Since quasi-characters with $\ell=0, 2, 4$ form a basis for all higher $\ell$, understanding their properties is sufficient to map the entire space of admissible characters.
• Mathematical Rigor: The paper moves beyond empirical observations and conjectures (from Ref. [16]) to provide rigorous proofs using induction and bounds, solidifying the theoretical foundation of the modular bootstrap.
• Physical Insight: The crossover at $n \sim c/12$ is linked to the boundary between "light" and "medium" states in irrational CFTs. The transition from super-geometric to geometric growth offers new insights into the density of states in RCFTs.
• Future Directions: The authors note that while $\ell=0$ is now understood, the $\ell=2$ case presents a slightly different sign pattern (alternation until $n=|M|$, then reverse alternation until $n=2|M|$), which is the subject of upcoming work. The methods developed here are expected to generalize to higher-rank theories.

Conclusion

Das and Mukhi have successfully solved the problem of determining the sign patterns and growth rates of $\ell=0$ quasi-characters. By combining asymptotic analysis, refined approximations, and rigorous inductive proofs, they have established that these coefficients alternate in sign up to $n \sim c/12$ and then stabilize. This discovery provides the necessary tools to systematically construct admissible RCFT partition functions, significantly advancing the holomorphic modular bootstrap program.