[Paper Review] Genus Zero Modular Functions

Bong H. Lian, Joshua L. Wiczer|ArXiv.org|Nov 9, 2006

Algebraic structures and combinatorial models9 references3 citations

TL;DR

This paper develops a systematic method to construct third-order nonlinear Schwarzian differential equations for genus zero modular functions using power series and Borcherd recursion. By computing a Q-value—a rational function derived from the modular function’s Fourier expansion—the authors derive a differential equation whose solution recovers the modular function, enabling explicit construction and analysis of these functions via differential equations.

ABSTRACT

This project was sponsored through the Schiff Fellowship program of Brandeis University. This project involved using the power series method to construct a third order nonlinear ordinary differential equation, a Schwarzian equation, for each of the "genus zero" modular functions, described in the Conway-Norton paper. We first use the Borcherd recursion formuli to generate, in each case, a modular function up to whatever degree we desire, and then use the fact that there is a Schwarzian equation, determined by a single rational function we call a Q-value. By similar power series methods, we compute the coefficients of our rational function, and hence have all the necessary data to create a Schwarzian differential equation for each modular function. This equation can, in turn, be used to recover the modular function itself.

Motivation & Objective

• To develop a computational framework for constructing differential equations corresponding to genus zero modular functions.
• To address the challenge of explicitly determining the differential equations that govern these modular functions, which are central to Monstrous Moonshine.
• To provide a systematic method to compute the Q-value (a rational function) that defines the Schwarzian differential equation for each genus zero modular function.
• To enable the reconstruction of modular functions from their differential equations using power series and Frobenius methods.

Proposed method

• Utilizes the Borcherd recursion formula to generate the Fourier expansion of genus zero modular functions up to arbitrary degree.
• Applies the method of Frobenius to solve second-order linear differential equations derived from the normalized Picard-Fuchs equation.
• Computes the Q-value as a rational function from the differential equation’s coefficients, which fully determines the Schwarzian equation.
• Uses the Schwarzian derivative identity {w,z} = 2Q(z) to link solutions of the differential equation to modular functions via ratio of independent solutions.
• Transforms the differential equation into a form where the modular function t(q) can be recovered from the ratio of solutions.
• Adjusts the Q-value for modular functions with constant terms by shifting t[q] → t[q] + c and re-computing the differential equation.

Experimental results

Research questions

• RQ1 How can one systematically derive a Schwarzian differential equation for any genus zero modular function using power series methods?
• RQ2 What is the precise form of the Q-value (rational function) that defines the differential equation for a given genus zero modular function?
• RQ3 Can the modular function be reconstructed from its associated differential equation using analytic continuation and power series solutions?
• RQ4 How does the Q-value transform when the modular function is shifted by a constant?
• RQ5 What is the relationship between the Picard-Fuchs equation and the Schwarzian equation for genus zero modular functions?

Key findings

• The Q-value for each genus zero modular function is computed as a rational function in z, with explicit expressions provided for 14 different cases (e.g., 11A, 14A, 15A, ..., 50Z).
• For the j-invariant (11A), the Q-value is explicitly given as (1 - 12z + 66z² - 305z³ + 305z⁴ + ... ) / (4z²(-1 - 2z - 5z² + 4z³ + ... )²), with coefficients up to z²².
• The method successfully constructs the differential equation for the modular function t(q) by deriving the Q-value from the Fourier coefficients via Borcherd recursion and Frobenius series.
• The transformation rule for shifting the modular function by a constant c is implemented by replacing t[q] with t[q] + c and re-computing the Q-value, which is feasible only when c is a numerical constant.
• The Q-value for the 104A modular function is (1 + 4z⁴ + 982z⁸ + ... - 24816z²⁴) / (4z²(-1 - 2z⁴ + 23z⁸ + ... + 64z¹⁶)²), showing the method's applicability to higher-level modular functions.
• The method is general and can be applied to any genus zero modular function, with all necessary data (Q-value, differential equation, and solution) computable to arbitrary order using symbolic computation.