Computing an order complete basis for $M^{\infty}(N)$ and Applications
Mark van Hoeij, Cristian-Silviu Radu

TL;DR
None
Contribution
None
Abstract
This paper gives a quick way to construct all modular functions for the group having only a pole at . We assume that we are given two modular functions for with poles only at and coprime pole orders. As an application we obtain two new identities from which one can derive that , here is the usual partition function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Computing an order complete basis for and Applications
Mark van Hoeij
and
Cristian-Silviu Radu
Abstract.
This paper gives a quick way to construct all modular functions for the group having only a pole at . We assume that we are given two modular functions for with poles only at and coprime pole orders. As an application we obtain two new identities from which one can derive that , here is the usual partition function.
Supported by NSF 1618657.
Supported by grant SFB F50-06 of the Austrian Science Fund (FWF)
1. Description of the Problem
For basic notions about modular functions used in this paper we refer to [14]. In this paper we show how to obtain an order complete basis for with an application to the case . We use this basis to obtain two new Ramanujan type identities for . Such bases have also been constructed by other authors [1, 2, 4, 7, 8, 9, 11, 12] by using various tricks to produce sufficiently many new modular functions until becomes equal to . The advantage of our approach is that we need only two functions in . Then will generally be a proper subset of , but instead of searching for more modular functions, we fill this gap with a normalized integral basis.
Let and be modular functions for the group with poles only at , in other words, let . Suppose that the pole orders are and respectively, and that , such functions always exist [13, Example 2.3]. Then there exists an irreducible polynomial with , , and by [21, Lemma 1]. One can compute from the -expansions of and by making an Ansatz for the unknown coefficients of and solving a system of equations where each equation is a coefficient in the -expansion of . We use to compute in the function field .
The function field contains see [13, Prop 4.3], here is the set of all modular functions for the group with a pole only at . Obtaining all modular functions for the group having a pole only at is equivalent to finding all modular functions that are integral over (which means there is a monic polynomial for which ). Thus, one starts by computing an integral basis, which is a basis of the -module of all that are integral over . There are several algorithms to compute an integral basis [5, 20] and implementations in several computer algebra systems. Then every that is integral over can be written as for some polynomials . Given the -expansions of and the algorithm described in [16, Alg. MW] can find provided that . We call such an integral basis order complete.
After computing an integral basis, we can find an order complete basis by using normalization at infinity from Trager’s PhD thesis [19, Chapter 2, Section 3], see Section 1.2 for details.
1.1. Notations
where is irreducible.
is ring of all elements of that are integral over .
is the ring of all that have no pole at .
is ring of all elements of that are integral over .
To compute a basis of as -module, first substitute , then compute a local integral basis at (most integral basis implementations allow the option of computing a local integral basis). After that, replace by .
1.2. Normalize an integral basis at infinity
The process of normalizing an integral basis at infinity was introduced in [19] in order to compute a Riemann-Roch space that was needed for integrating algebraic functions. For completeness we will describe this process:
Algorithm: Normalize an integral basis at infinity.
- (1)
Let be a basis of as -module. 2. (2)
Let be a basis of as -module. 3. (3)
Write with . 4. (4)
Let be a non-zero polynomial for which for all . Now . 5. (5)
For each , let be the maximum of the degrees of . Now let be the vector whose ’th entry is the -coefficient of . Let . 6. (6)
If are linearly independent, then return and and stop.
Otherwise, take , not all 0, for which . 7. (7)
Among those for which , choose one for which is maximal. For this , do the following
- (a)
Replace by . 2. (b)
Replace by for all . 8. (8)
Go back to step 5.
The remain a basis of throughout the algorithm because the new in step 7a can be written as a nonzero constant times the old plus a -linear combination of the , . When we go back to step 5 the non-negative integer decreases while the , stay the same. Hence the algorithm must terminate.
Let and be the output of the algorithm. By construction, the number in the algorithm is the smallest integer for which . If with then we can write for some . Denote as the maximum of taken over all for which . Then by construction. Since the vectors in the algorithm are linearly independent when the algorithm terminates, there can not be any cancellation, which means that is the smallest integer for which . Because of this, we get the following:
If is a positive integer, then the set is a basis of as -vector space.
Note that is a basis of the Riemann-Roch space of the pole-divisor of . So computing can be interpreted as (i): a direct application of a normalized integral basis, or (ii): a special case of algorithms [3, 6] for Riemann-Roch spaces. The two interpretations are equivalent because the first step in computing Riemann-Roch spaces is to compute a normalized integral basis.
We can take -expansions for each of the elements of , and then make a change of basis so that the new basis will have -expansions in Reduced Echelon Form. This means that if and with then and all other basis elements have a zero coefficient at . Then , for suitable , is an order complete basis. For an implementation and two examples see:
www.math.fsu.edu/$\sim$hoeij/files/OrderComplete
2. New Identities
We will give two identities of Ramanujan type found using our algorithm (the second one is only on our website). Let be the partition function. Define
[TABLE]
and
[TABLE]
and
[TABLE]
Both and are modular functions in , see [14, Lemma 3.1].
To prove that is in as well, first note that by [10, Prop. 3.1.1]
[TABLE]
satisfies
[TABLE]
for all \left(\begin{array}[]{cc}a&b\\ c&d\end{array}\right)\in\Gamma_{0}(11). Since , we have
[TABLE]
The derivative with respect to is:
[TABLE]
Multiplying (2) by and dividing by (1) gives
[TABLE]
Since , it follows that . Therefore
[TABLE]
for all \left(\begin{array}[]{cc}a&b\\ c&d\end{array}\right)\in\Gamma_{0}(11). Furthermore, since has no zeros in the upper half plane and is holomorphic in the upper half plane it follows that is holomorphic in the upper half plane. Hence the first condition of being a modular function for according to the definition in [14] is satisfied. The second condition is equivalent to showing that for \gamma=\left(\begin{array}[]{cc}a&b\\ c&d\end{array}\right)\in\mathrm{SL}_{2}(\mathbb{Z}) we have an expansion of the form
[TABLE]
As seen in [14], if this property hold for \left(\begin{array}[]{cc}a&b\\ c&d\end{array}\right), then it also holds for \left(\begin{array}[]{cc}a^{\prime}&b^{\prime}\\ c^{\prime}&d^{\prime}\end{array}\right), if there exists \left(\begin{array}[]{cc}A&B\\ C&D\end{array}\right)\in\Gamma_{0}(11) such that . So we need to find representatives of the orbits of the action of on , that is, the cusps of . From [17] we find that these representatives are [math] and . Then it suffices to show (3) for two cases: \left(\begin{array}[]{cc}1&0\\ 0&1\end{array}\right) and \left(\begin{array}[]{cc}0&-1\\ 1&0\end{array}\right). The first case holds because is a -series. For the second case we need to show that is a Laurent series in with finite principal part. By [15] we have
[TABLE]
This implies
[TABLE]
and
[TABLE]
The derivative of (4) is
[TABLE]
which is equivalent to
[TABLE]
This implies
[TABLE]
Hence
[TABLE]
So the last condition for being a modular function for is verified. In order for to be in we need the order of to be nonnegative at all cusps except . That only leaves the cusp [math] where the order is . This shows .
We want to express as an element of . The pole orders of and are and so is an Ansatz for the algebraic relation . Solving linear equations coming from -expansions gives
[TABLE]
We use to compute in . We compute from the previous section with and obtain where and for for some constants . Since has a pole of order 4, we can write it as a linear combination of . We have and
[TABLE]
Like in [16, Alg. MW], we use
[TABLE]
to find
[TABLE]
This expression in has no poles and a root at (at ) hence it is the zero function. Therefore
[TABLE]
Replacing with their corresponding expressions in terms of and gives
[TABLE]
This implies . Other expressions for that prove this congruence were already in [1, 9], however, our expression in terms of is novel.
For our second example, take and be as before and let
[TABLE]
be the usual Eisenstein series. Let
[TABLE]
Let and
[TABLE]
Next we show that . From the last chapter of [18] we find
[TABLE]
and
[TABLE]
for all \left(\begin{array}[]{cc}a&b\\ c&d\end{array}\right)\in\mathrm{SL}_{2}(\mathbb{Z}). These two identities imply
[TABLE]
for all \left(\begin{array}[]{cc}a&b\\ c&d\end{array}\right)\in\mathrm{SL}_{2}(\mathbb{Z}). Since has only one cusp, , and since is a -series it follows that is a modular function on and thus on .
Since is already a modular function on , it follows that is a modular function on . To show that is in it suffices to show that the order of at the cusp [math] is nonnegative. Since the order of at [math] is . The order of at [math] is , so the order of at the cusp [math] is . This shows .
The only pole of is at , it has order 16. We compute the algebraic relation with the Ansatz method, and use to compute . Then we express in terms of the and the new . This relation, and the Maple file that computes it, are given at www.math.fsu.edu/$\sim$hoeij/files/OrderComplete.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. O. L. Atkin. Proof of a Conjecture of Ramanujan. Glasgow Mathematical Journal , 8:14–32, 1967.
- 2[2] F. G. Garvan. Some Congruences for Partitions that are p 𝑝 p -Cores. Proceedings of the London Mathematical Society , 66:449–478, 1993.
- 3[3] F. Hess. Computing riemann–roch spaces in algebraic function fields and related topics. Journal of Symbolic Computation , 33:425–445, 2002.
- 4[4] K. Hughes. Ramanujan Congruences for p − k ( n ) subscript 𝑝 𝑘 𝑛 p_{-k}(n) Modulo Powers of 17 17 17 . Canadian Journal of Mathematics , 43:506–525, 1991.
- 5[5] E. Nart J. Guàrdia, J. Montes. Higher newton polygons in the computation of discriminants and prime ideal decomposition in number fields. J. Théor. Nombres Bordeaux , 23:667–696, 2011.
- 6[6] K. Khuri-Makdisi. Linear algebra algorithms for divisors on an algebraic curve. Mathematics of Computation , 73:333–357, 2004.
- 7[7] O. Kolberg. An Elementary discussion of Certain Modular Forms. UNIVERSITET I BERGEN ÅRBOK Naturvitenskapelig rekke , 16, 1959.
- 8[8] O. Kolberg. Congruences Involving the Partition Function for the Moduli 17 17 17 , 19 19 19 , and 23 23 23 . UNIVERSITET I BERGEN ÅRBOK Naturvitenskapelig rekke , 15, 1959.
