Abstract
Let be the N-th classical modular polynomial and let be the plane model of the modular curve . We present an explicit procedure that, for a prime ℓ, enumerates all non-cuspidal singular points of over and outputs the corresponding pairs of distinct points on mapping to each node. The method relies on the arithmetic (CM) classification of self-intersections of the map and on effective computations of proper ideal classes in imaginary quadratic orders. We also provide a complete and self-contained exposition of Kara’s proof of the automorphism-group equality in the self-intersection setting, making explicit where Kolyvagin’s conductor lemma is used essentially. Finally, we discuss termination, correctness, and practical complexity issues, and we report computational evidence for larger primes using a parallel implementation; in particular, for , we obtained output pairs in seconds on a 56-core machine.
MSC:
11G05; 1F03; 11Y16
1. Introduction
Let denote the classical j-invariant of the elliptic curve with for . We will repeatedly use the standard equivalences (see [1]): for , one has if and only if for some , and for lattices , one has if and only if for some ; equivalently, . Moreover, for an integer , the N-th modular polynomial satisfies if and only if and are linked by a cyclic N-isogeny (see [1]).
The plane model given by has long been used as a computational model of , and its singularities have arithmetic significance (cf. Mazur’s discussion in [2]). Recent computational work on explicit models and Diophantine applications of modular curves includes smooth plane models for certain modular curves [3], the computation of low-degree points on and related curves [4,5], and structural results on modular curves that inform effective computations [6]. On the algorithmic side, efficient computation of modular polynomials and modular forms is an active topic, with modern implementations and complexity analyses appearing for example in [7,8,9]. For Jacobian-related computations and database-scale infrastructure for modular curves, see for instance [10].
A direct computational approach to the singularities of the plane model is to compute the singular locus of the affine curve by solving
for instance using elimination or Gröbner basis techniques. This is feasible for small N but becomes expensive as the size and degree of grow. In contrast, for prime level ℓ, our approach is driven by Kara–Klyachko’s theorem describing self-intersections of . It shows that a non-cuspidal node of is precisely a collision
and that such collisions occur only at CM points and can be parameterized via proper ideal classes of suitable imaginary quadratic orders. Accordingly, we first enumerate the CM orders and their proper ideal classes, and then recover the nodes by detecting collisions among .
The main contributions of this paper are the following: First, we present an explicit algorithm (for prime level ℓ) that enumerates all non-cuspidal singular points of over and outputs the corresponding pairs of distinct points of mapping to each node. Second, we provide a complete and self-contained exposition of Kara’s proof of the automorphism-group equality for elliptic curves arising from a self-intersection, filling in the omitted conductor analysis and making explicit the essential use of Kolyvagin’s conductor lemma. Finally, we establish termination and correctness of the enumeration algorithm, discuss practical complexity considerations, and report computational experiments (implemented in Wolfram Language) for primes up to ; in particular, for , we obtained output pairs in seconds using a parallel implementation on a 56-core machine.
2. Preliminaries
In this section, we review the necessary background on complex multiplication, imaginary quadratic orders, and the classification of singularities of . Let ℓ be an odd prime throughout this paper.
2.1. Quadratic Orders and Conductors
Let D be a negative and squarefree integer. Define
Let and . Then, every sublattice L of of finite index admits a representation in the form where and The index of L in is equal to The conductor of a lattice L is the conductor of its ring of multipliers, i.e., the minimal such that
Lemma 1
(Kolyvagin lemma [11]). Let L be a sublattice of of index Suppose The conductor of L is the minimal such that is divisible by is divisible by and is divisible by
2.2. Complex Multiplication and Ideal Classes
Let E be an elliptic curve isomorphic to . Let denote the ring of all endomorphisms of E and . Then,
Let c be a positive integer and be an order. A lattice is a proper -ideal if
Proposition 1
([12]). Let denote the group of all automorphisms of and Then,
Proposition 2
([12]). Let E be an elliptic curve defined over such that is isomorphic to and an order in K corresponding to Then, E is isomorphic to with a proper -ideal Conversely, for any proper -ideal L, is isomorphic to Moreover, the class of proper -ideals L is uniquely determined by the isomorphism class of . In other words, is isomorphic to if and only if for some
Theorem 1
([12]). Let be an order in . Let be representatives for the classes of proper -ideals, and Then, form a complete set of conjugates of over , and over
Lemma 2
([13]). (i) ℓ can be written as with some integers if and only if ;
- (ii) ℓ can be written as with some integers if and only if or
2.3. Singularities of
Two isogenies and are equivalent if there are two isomorphisms and such that the following diagram commutes:
Theorem 2
([14]). All noncuspidal singularities of over are simple nodes. They are parametrized by similarity classes of lattices with complex multiplication by α, where , and is not a root of unity.
Theorem 3
([15]). Let . Assume is a self intersection. Then, .
Theorem 4
([14,16]). Let and be two ℓ-isogenies with . Then, and have complex multiplication by an imaginary quadratic algebraic integer in the form for integers such that and is a fundamental discriminant.
3. Theories
Firstly, we show that the definition of the equivalence of isogenies is the same as that of [17].
Proposition 3.
Let and σ be as in (2). Then, .
Proof.
Let for
Let Then, By and we have Then, Thus, by Hence, By we have Then,
Let Then Thus by By we have Then, Thus,
Hence by (3) and (4). □
Proposition 4.
Let be an l-isogeny. Then, or with some
Proof.
By being an l-isogeny, we have Then
for some . Thus
Therefore
or
for some by
□
Theorem 5.
Let with Let and Let c denote the conductor of a lattice Then iff
Proof.
Necessity. Suppose that Then, and Thus, by Lemma 1. Hence, by .
Sufficiency. By Lemma 1, Then, for some integers Thus, by Then, Thus, By we have Then, □
Theorem 6.
Let and be two l-isogenies with Then, and
Proof.
There are two cases to be considered as follows by Proposition 4.
- Case 1. Take Then,is an l-isogeny. Sinceis an l-isogeny, then there exist such thatThenThusThenThereforeThenHencea contradiction with Therefore, this case does not exist.
- Case 2. for some Take Then is an l-isogeny.
Since
is an l- isogeny, then there exist such that
and
Then
Thus
Then
Thus
Hence
Then, there exist integers such that
Thus by Lemma 2 and Since , then and Thus, and Hence, Then,
Thus the conductor of the lattice is 1 by Kolyvagin’s lemma. Hence,
Therefore and □
Theorem 7.
Let, and . Let be two cyclic l-isogenies of an odd prime degree l. Assume that ρ and σ are nonequivalent, equivalently
Then or , and
Proof.
Put so that . By Proposition 4 (applied with ), for an l-isogeny , the target elliptic curve is isomorphic to one of
Case 1. .
Up to an isomorphism of the codomain, we may take (multiplication by l on ), so is a cyclic l-isogeny. Let be another cyclic l-isogeny. Write
with (this is possible since ). Using , we compute
Comparing with gives
The index condition implies
Substituting and , we get
Hence , so is one of the six pairs corresponding to the units in , and consequently, for some . This contradicts the nonequivalence hypothesis. Therefore, Case 1 cannot occur.
- Case 2. for some k.
Put
Up to an isomorphism of the codomain, we may take , i.e., the natural l-isogeny induced by .
Let be another cyclic l-isogeny. Since , we can write
with integers . As in Case 1, the degree condition yields
Now, express in the basis . Since , we have
A direct computation using gives
On the other hand, elements of have the form . Comparing coefficients of 1 and shows that forces
where .
Next, we compute the determinant in terms of . From , we have , and from , one obtains and . Substituting into yields the key identity
Since , we conclude
If l were inert in , then would force ; hence, and , and (5) would give , so is a unit and would be an isomorphism, contradicting . Therefore, l is not inert; since l is prime, it is either ramified () or split (). Hence, or .
Moreover, the same argument shows ; otherwise, and would be an isomorphism. Thus, , and from , we obtain
Finally, we apply Kolyvagin’s lemma (Lemma 1) to show that the conductor of is 1. Note that scaling a lattice does not change its ring of multipliers and, hence, does not change its conductor. Consider the sublattice
This sublattice has index l in and can be written in the form
By Lemma 1, the conductor of (hence also of ) is the minimal such that is divisible by l. Using (6), we may take , so the conductor of is 1. Therefore, is a proper -ideal of conductor 1; hence,
so , and by Proposition 1, we get
This completes the proof. □
Theorem 8.
(i) Let be the roots of the equation Then,
and
are two distinct points of such that
(ii) Let be the roots of the equation and Then,
and
are two distinct points ofsuch that
Proof.
(i) Let and for some positive integers by Lemma 2 Then,
by Thus,
by Hence,
Suppose that
and
Then a contradiction with and Then
or
Then we select or such that
Then
Thus
Hence
Therefore
Let
Then
and
Thus is an isomorphism. The following diagram shows that is equivalent to
Thus,
and
are two distinct points of . The proof of (ii) is similar to that of (i) and omitted. □
4. Algorithms
Assume that and are two distinct points of . By (2), two isogenies and are nonequivalent if and only if there does not exist and such that . Then,
by (1). This amounts to in Theorem 4. Theorems 2 and 4 show that Then, for some positive divisor c of f. Thus, E is isomorphic to with a proper -ideal L by Proposition 2. Then, we have the following algorithm to enumerate singularities of . Note that we need Theorem 8 to construct the singularities of when the fundamental discriminants are or and the conductor is 1.
The following algorithm is adapted from Algorithm 5.3.5 in [18]. It could be adapted to compute the minimal polynomial of the singular modulus by Theorem 1.
4.1. Correctness, Termination, and Complexity
We briefly justify that Algorithm 1 indeed enumerates all non-cuspidal singularities of and that it terminates.
| Algorithm 1 Enumeration of singularities of |
| Require: A prime number l. Ensure: A list Sing of pairs (with ) such that , i.e., the non-cuspidal singular points of together with their preimages in .
|
Proposition 5
(Termination). Algorithm 1 terminates for every prime ℓ.
Proof.
Step 2 searches for integer triples satisfying with , , , and a fundamental discriminant; there are only finitely many such triples because t is bounded and . For each pair , Step 3 loops over the finitely many divisors . For each discriminant , Algorithm 2 enumerates a complete set of reduced primitive binary quadratic forms (equivalently, proper -ideal classes), which is a finite set. Finally, Step 4 runs over the finite coset set of cardinality . Hence, the total number of iterations is finite, and the algorithm terminates. □
Proposition 6
(Correctness). Let ℓ be a prime. The list returned by Algorithm 1 consists exactly of the pairs of distinct points of mapping to the same point of ; i.e., it enumerates all non-cuspidal singular points of together with their two preimages in .
| Algorithm 2 |
Require: Let Given and Ensure: a complete set of representatives of proper -ideal classes.
|
Proof.
By Theorem 2 of Kara–Klyachko, every non-cuspidal singular point of the plane model arises from a self-intersection: there exist two non-equivalent cyclic ℓ-isogenies such that
for two distinct points of . The same classification shows that such a self-intersection forces E to have CM by an order in an imaginary quadratic field, and that the relevant CM data can be parameterized by triples and by proper -ideal classes (cf. Theorem 4 and Proposition 2). Algorithm 1 loops over all admissible (Step 2) and over all divisors (Step 3), constructs representatives of all proper -ideal classes (Algorithm 2), and then enumerates all -coset translates of the associated CM parameter (Step 4). Therefore, every self-intersection (hence every non-cuspidal singularity) appears in the search. Conversely, whenever Step 4 finds with , the two points of are distinct but have the same image in , so they contribute a singular point. This proves correctness. □
4.1.1. Complexity and Implementation Notes
We give a coarse complexity discussion in terms of ℓ and of the class numbers of the relevant orders. For prime ℓ, one has . The runtime is dominated by three components:
- (i)
- The number of admissible triples with and ;
- (ii)
- The enumeration of proper -ideal classes for discriminants (cost proportional to the corresponding class numbers );
- (iii)
- Numerical evaluation and comparison of for coset representatives (precision must be sufficient to certify equalities).
A practical upper bound for the total number of candidate comparisons in Step 4 is of the order
where is the order of discriminant . In implementations, one typically reduces the cost by hashing values of (after rounding to certified precision) and only testing collisions. We emphasize that, for larger ℓ, the bottlenecks are (a) the growth of class numbers for the encountered discriminants and (b) the required floating-point precision to reliably recognize equal singular moduli. For background on fast computation and evaluation of modular polynomials (which is complementary to the present work, where is treated as given), we refer to [7,8]; for large-scale computations of modular forms and related modular-curve data, see [9].
4.1.2. Computational Experiments
We implemented Algorithm 1 in Wolfram Language and also developed a parallel version by parallelizing the outer loop over the admissible CM discriminant data (in particular, the enumeration over CM parameters and the associated proper ideal classes in the relevant imaginary quadratic orders). For primes , Table 1 reports wall-clock times on a 16-core machine, using WorkingPrecision = 300 and numerical collision tolerance Tolerance = . Here, “output pairs” refers to the number of collision/preimage pairs returned by the implementation (i.e., distinct points of with identical images in ), together with the size of the corresponding output file.
Table 1.
Runtime and output statistics for Algorithm 1 (16-core machine).
For a larger stress test of scalability, we also ran the parallel implementation on a 56-core machine for ; the computation finished in seconds and produced output pairs, illustrating the rapid growth of the workload with ℓ (Table 2).
Table 2.
Large-prime stress test for the parallel implementation for (56-core machine).
Based on Theorem 5, we have also designed and implemented an algorithm to construct .
4.2. Remarks
We present several remarks that clarify the scope and limitations of the algorithms and address common questions.
Algorithm 1 is built on Theorem 2, which classifies non-cuspidal singularities of (for prime ℓ) as simple nodes arising from self-intersections of the map . This classification provides the finite CM parameter space over which Algorithm 1 searches; without it, one would need to compute the singular locus of directly, which is typically less scalable.
For an elliptic curve with CM, the endomorphism ring is a uniquely determined order in an imaginary quadratic field. However, the same singular point of may admit more than one parametrization in intermediate steps of the search (for instance, via different lattice presentations or different admissible triples in Step 2), so in practice, we deduplicate at the level of the output plane point (equivalently, by comparing the resulting pairs ).
Why do loops over all in Step 3 ? Different divisors correspond to different CM orders compatible with the same quadratic field, and omitting some divisors may miss self-intersections arising from curves with a larger endomorphism ring. Thus, the loop over all is essential for completeness.
A self-intersection corresponds to two non-equivalent cyclic ℓ-isogenies with the same endpoints. Composing with the dual isogeny of (or vice versa) produces a non-scalar endomorphism of E of norm , forcing ; over , this implies that E has complex multiplication.
For prime ℓ, Theorem 2 implies that all non-cuspidal singularities are nodes. For composite N, one expects additional bookkeeping for decompositions of cyclic N-isogenies and potentially more complicated local intersection behavior (including higher multiplicity singularities); we treat this as future work.
We are not aware of a counterexample showing that the statement in [15] is false; rather, the published argument omits a conductor step. Our proof supplies the missing justification (via Kolyvagin’s lemma) and makes the dependence explicit.
In our implementation, the main bottlenecks for larger primes are the growth of class numbers for the encountered discriminants and the numerical precision required to certify equalities of singular moduli. (One may further improve robustness by using certified recognition of algebraic numbers from high-precision approximations.)
5. Examples
In this section, we provide an explicit example for to illustrate how a self-intersection of the map
produces a non-cuspidal node on the plane model . The purpose of the example is conceptual: we exhibit two non-equivalent 3-isogenies defined by lattice inclusions, and we identify two distinct points of that have the same image in . This is exactly the situation detected in Step 4 of Algorithm 1.
Example 1.
Let , and Since
and
then Thus,
be two nonequivalent isogenies by and Let Then, is equivalent to by the following commutative diagram.
Here is given by
and is given by
Therefore, corresponds to the point of Clearly, corresponds to the point of .
A complete set Ω of representativepairs of preimages in producing the non-cuspidal singularities of is as follows (that is, for each one has and .
Consequently, the two distinct points and of correspond to two non-equivalent 3-isogenies with the same source and target; hence, they map to the same point of under π and determine a non-cuspidal node on the plane model.
Using Kainberger’s program [19], the affine curve together with its non-cuspidal singular points is shown in Figure 1.
Figure 1.
The plane model (the affine curve ) together with its non-cuspidal singular points (nodes). Each node corresponds to a collision of two distinct points of under the map , i.e., to a self-intersection coming from two non-equivalent 3-isogenies . The plot was generated using Kainberger’s program [19].
6. Discussion and Conclusions
As pointed out by Mazur in [2], the plane curve is highly singular, and its singular points determine points on the Jacobian of defined over algebraic number fields. Precisely, if is a singular point on , then and are algebraic numbers and there exists another point of such that with . In this paper, we designed an explicit enumeration algorithm for all non-cuspidal singular points of at the prime level and proved its termination and correctness.
The main practical limitations are the growth of class numbers for the encountered discriminants and the numerical precision required to certify equalities of singular moduli. There are several natural directions suggested by the present work. First, extending the enumeration from prime level ℓ to composite N is expected to require additional bookkeeping for decompositions of cyclic N-isogenies and potentially more complicated local intersection behavior of the plane model (compare the broader computational landscape around composite level and quotients in [5,6]). Second, it is natural to consider analogous questions for other modular curves (for instance or modular curves attached to other congruence subgroups), where plane models and their singularities may encode different moduli identifications. Third, motivated by Mazur’s viewpoint, one may seek to explicitly compute the divisor classes arising from pairs of points with and to study their images under a Weil parametrization , with the aim of producing algebraic points on E with special arithmetic properties; this fits naturally with recent database-scale work on modular curves and their Jacobians [10]. We hope to return to these questions in future work.
All the algorithms described in this paper have been implemented in Wolfram Language; for the programs, see [20].
Author Contributions
Investigation, S.W.; writing—original draft preparation, S.W.; writing—review and editing, S.W.; program implementation and visualization, H.X. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
The data presented in this study are openly available in https://github.com/SanMinWang2025/An-algorithm-for-computing-the-singularities-of-the-plane-model-of-X0-N-/tree/main (accessed on 28 January 2026).
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Washington, L.C. Elliptic Curves: Number Theory and Cryptography; Chapman and Hall/CRC: New York, NY, USA, 2008; p. 234. [Google Scholar]
- Mazur, B. Arithmetic of Weil curves. Invent. Math. 1974, 25, 1–61. [Google Scholar] [CrossRef] [Scilit]
- Anni, S.; Assaf, E.; Lorenzo García, E. On smooth plane models for modular curves of Shimura type. Res. Number Theory 2023, 9, 21. [Google Scholar] [CrossRef] [Scilit]
- Balakrishnan, J.S.; Dogra, N.; Müller, J.S.; Tuitman, J.; Vonk, J. Quadratic Chabauty for modular curves: Algorithms and examples. Compos. Math. 2023, 159, 1111–1152. [Google Scholar] [CrossRef] [Scilit]
- Adžaga, N.; Keller, T.; Michaud-Jacobs, P.; Najman, F.; Ozman, E.; Vukorepa, B. Computing quadratic points on modular curves X0(N). Math. Comput. 2024, 93, 1371–1397. [Google Scholar] [CrossRef] [Scilit]
- Bars, F.; González, J. Bielliptic modular curves. J. Algebra 2020, 559, 726–759. [Google Scholar] [CrossRef] [Scilit]
- Kunzweiler, S.; Robert, D. Computing modular polynomials by deformation. Res. Number Theory 2024, 11, 10. [Google Scholar] [CrossRef] [Scilit]
- Bröker, R.; Lauter, K.; Sutherland, A.V. Modular polynomials via isogeny volcanoes. Math. Comput. 2012, 81, 1201–1231. [Google Scholar] [CrossRef] [Scilit]
- Best, A.J.; Bober, J.; Booker, A.R.; Costa, E.; Cremona, J.E.; Derickx, M.; Lee, M.; Lowry-Duda, D.; Roe, D.; Sutherland, A.V.; et al. Computing classical modular forms. In Arithmetic Geometry, Number Theory, and Computation; Simons Symposia Series; Springer: Cham, Switzerland, 2021; pp. 131–213. [Google Scholar]
- Paulhus, J.; Sutherland, A.V. Completely Decomposable Modular Jacobians. Preprint 2025. Available online: https://lucant.org/papers/2025/250131-Sutherland.pdf (accessed on 28 January 2026).
- Kolyvagin, V.I. Finiteness of E(Q) and III(E/Q) for a subclass of Weil curves. Math. USSR-Izv. 1989, 32, 523–542. [Google Scholar] [CrossRef] [Scilit]
- Shimura, G. Introduction to the Arithmetic Theory of Automorphic Functions; Princeton University Press: Princeton, NJ, USA, 1971. [Google Scholar]
- Cox, D.A. Primes of the Form x2+ny2: Fermat, Class Field Theory and Complex Multiplication; John Wiley: Hoboken, NJ, USA, 1989. [Google Scholar]
- Klyachko, A.; Kara, O. Singularities of the Modular Curve. Finite Fields Their Appl. 2001, 7, 415–420. [Google Scholar] [CrossRef] [Scilit]
- Kara, O. Code Construction on Modular Curves. Ph.D. Thesis, Bilkent University, Ankara, Türkiye, 2003. [Google Scholar]
- Wang, S. On a theorem of Kara and Klyachko. Finite Fields Their Appl. 2025, 107, 102645. [Google Scholar] [CrossRef] [Scilit]
- Diamond, F.; Shurman, J. A First Course in Modular Forms; Springer: New York, NY, USA, 2005; pp. 38–40. [Google Scholar]
- Cohen, H. A Course in Computational Algebraic Number Theory; Springer: Berlin/Heidelberg, Germany, 1993; p. 234. [Google Scholar]
- Kainberger, P. Drawing Fundamental Domains, 2022. Available online: https://risc.jku.at/sw/drawfundoms/ (accessed on 12 December 2025).
- Wang, S. The Singularities of Z0(N). Available online: https://github.com/SanMinWang2025/An-algorithm-for-computing-the-singularities-of-the-plane-model-of-X0-N-/tree/main (accessed on 30 January 2026).
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.
