🔢 mathematics

Boundary CM points and class groups of small exponent

This paper investigates the equidistribution of CM points on the boundary of the fundamental domain for $\text{SL}_2(\mathbb{Z})$ , characterizes the discriminants for which all such points lie on the boundary, and provides a conditional classification of negative discriminants with small exponent class groups.

Original authors: David Aiken, Erick Ross, Dmitriy Shvydkoy, Hui Xue

Published 2026-05-26

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: David Aiken, Erick Ross, Dmitriy Shvydkoy, Hui Xue

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine the mathematical world as a vast, infinite ocean called the Upper Half Plane. Floating on this ocean is a special, repeating island called the Fundamental Domain. This island is shaped like a weird, curved room with a flat floor, two vertical walls, and a curved ceiling. Mathematicians use this room to study complex numbers and patterns.

Scattered throughout this ocean are special "beacons" called CM points. These aren't random; they are generated by specific mathematical rules involving negative numbers (discriminants). For a long time, a mathematician named William Duke proved that if you look at all these beacons for very large negative numbers, they spread out evenly across the entire island, like sprinkles on a donut.

This paper asks a different question: What happens to these beacons when they land specifically on the walls and the floor of the island?

Here is a simple breakdown of what the authors discovered:

1. The Beacons on the Walls are Evenly Spaced (The "Traffic" Analogy)

The authors looked at the beacons that land on the left wall and the curved floor of the island.

The Discovery: They found that as the numbers get bigger, these beacons don't just cluster in one spot. Instead, they spread out evenly along the walls and floor, but in a very specific way.
The Analogy: Imagine cars driving up a steep, curved hill. If you count how many cars are in the bottom half of the hill versus the top half, you might expect an even split. But because the hill is steep, the cars naturally bunch up at the bottom. The authors found that the beacons follow a similar "traffic pattern" dictated by the shape of the wall. They are distributed perfectly according to the "steepness" of the wall, not just randomly.
Why it matters: This is different from Duke's earlier work because Duke looked at one specific set of numbers at a time. These authors looked at all numbers up to a certain size at once, which is necessary because individual sets of numbers are too sparse to show a pattern on the walls.

2. The "Two-Step" Rule (The "Mirror" Analogy)

The paper then tries to answer a very specific question: When do all the beacons for a specific number land strictly on the walls or floor, and never in the middle of the room?

The Discovery: They found a strict rule. All the beacons for a number stay on the boundary if and only if the "group" of patterns associated with that number has a special property: if you take any pattern and do it twice (or a multiple of two times), you get back to the start.
The Analogy: Imagine a dance troupe. Most troupes have complex moves that take many steps to return to the starting pose. But this specific troupe only has "two-step" moves. If you do the move once, you're in a new spot. If you do it again, you're back home. The authors proved that if a number's "dance troupe" only has these two-step moves, then all the beacons for that number are forced to stand against the wall.
The Result: They created a "Hall of Fame" list (a table) of all the numbers that fit this rule. They listed numbers where the troupe has 1 step, 2 steps, 4 steps, etc., up to 8 steps.

3. The "Missing Puzzle Piece" Problem

The authors created a massive list of these special numbers. However, math is tricky.

The Caveat: They can prove their list is 100% complete if a certain famous mathematical guess (related to "Siegel zeros" or the "Riemann Hypothesis") is true.
The Reality Check: If that guess is false, there might be one giant, hidden number somewhere in the universe of math that they haven't found yet. But the authors believe it's extremely unlikely that this hidden number exists. So, for all practical purposes, their list is complete.

4. Why Did They Do This?

The authors mention three reasons for this work:

Curiosity: It's a natural next step to Duke's famous work on how beacons spread out.
Classification: They wanted to organize and list all the numbers with these "small exponent" groups (like the "two-step" dance troupe).
Solving a Bigger Mystery: This work was actually needed to solve a problem about modular forms (complex wave patterns). In some cases, these waves have "zero points" (where the wave hits the water level). The authors needed to know exactly which numbers have all their zero points on the boundary to prove that certain other points are "transcendental" (a special type of number that can't be written as a simple fraction).

Summary

Think of this paper as a cartographer mapping the coastline of a mathematical island.

They proved that the "beacons" on the coast are spread out in a predictable, beautiful pattern.
They identified exactly which "islands" (numbers) have only beacons on the coast and none in the interior.
They built a comprehensive catalog of these islands, with a small asterisk saying, "We are 99.9% sure this is the whole list, unless a very unlikely mathematical ghost is hiding in the fog."

Technical Summary: Boundary CM Points and Class Groups of Small Exponent

Problem Statement
This paper investigates two interconnected problems in the arithmetic of imaginary quadratic fields and the theory of modular forms. First, it addresses the distribution of Complex Multiplication (CM) points on the boundary of the standard fundamental domain $F$ for $SL_2(\mathbb{Z})$ acting on the upper half-plane $\mathbb{H}$ . While William Duke established the equidistribution of CM points within the interior of $F$ as the discriminant $D \to -\infty$ , the behavior of these points specifically on the boundary (the left vertical line and the lower circular arc) remained to be characterized, particularly for non-fundamental discriminants. Second, the paper seeks a complete classification of negative discriminants $D$ for which the associated class group $Cl(\mathcal{O}_D)$ has a small exponent (specifically $1 \le E \le 8$ ). This classification is motivated by the need to identify cases where all CM points of a given discriminant lie on the boundary of $F$ , a property relevant to the study of zeros of modular forms.

Methodology
The authors employ a combination of analytic number theory, algebraic number theory, and algorithmic computation.

Equidistribution Analysis: To prove the equidistribution of CM points on the boundary, the authors parametrize points on the left boundary by their imaginary parts $y$ and points on the lower arc by their arguments $\theta$ . They utilize a transformation mapping the lower arc to a vertical line segment, unifying the treatment of both boundary components. The proof relies on estimating the number of CM points in specific intervals by counting coprime pairs $(a, c)$ satisfying quadratic constraints derived from the discriminant bound $|D| \le \Delta$ . Standard analytic tools, including estimates for the Euler totient function $\phi(a)$ and the Möbius function $\mu(d)$ , are used to derive asymptotic counts.
Characterization of Boundary Points: The paper establishes a link between the geometric location of CM points and the algebraic structure of the class group. Using the fact that the inverse of a CM point $[a, b, c]$ is $[a, -b, c]$ , the authors show that a CM point lies on the boundary (or imaginary axis) if and only if it is of order dividing 2 in the class group. This reduces the geometric problem to an algebraic one: determining when the class group $Cl(\mathcal{O}_D)$ has an exponent dividing 2.
Classification Algorithm: To classify discriminants with small class group exponents, the authors adapt ideas from Fan and Pollack. They define a "principal part" of the class group and derive a divisibility property for the conductor $f$ of a discriminant $D = D_0 f^2$ (where $D_0$ is fundamental). Specifically, they prove that a function $L(f)$ , defined via the least common multiple of prime power factors of $f$ , must divide $12 \cdot |\mathcal{O}_{D_0}^\times| \cdot \text{Exp}(Cl(\mathcal{O}_D))$ . This property allows for the construction of an algorithm that:
- Identifies fundamental discriminants $D_0$ with the desired exponent.
- Generates candidate conductors $f$ by checking divisors of a value derived from $L(f)$ .
- Verifies the exponent of the resulting class group $Cl(\mathcal{O}_{D_0 f^2})$ .

Key Contributions and Results

Theorem 1.1 (Equidistribution on the Boundary): The authors prove that as the bound $\Delta \to \infty$ , the set of CM points with $|D| \le \Delta$ on the left boundary of $F$ is equidistributed with respect to the metric $d\mu = \frac{1}{y} dy$ , and those on the lower arc are equidistributed with respect to $d\nu = \frac{1}{\sin \theta} d\theta$ . This result differs from Duke's theorem by considering the aggregate of all discriminants up to a bound rather than individual discriminants, which is necessary because individual discriminants do not yield dense sets on the boundary.
Theorem 1.2 (Characterization of Boundary-Only CM Points): The paper provides a necessary and sufficient condition for every CM point of a discriminant $D$ to lie on the boundary of $F$ : the class group $Cl(\mathcal{O}_D)$ must have an exponent dividing 2, and $D$ must be odd or equal to $-4$. Under the assumption of the non-existence of Siegel zeros, the authors provide a complete list of such discriminants, categorized by their class group structures (trivial, $\mathbb{Z}/2\mathbb{Z}$ , $(\mathbb{Z}/2\mathbb{Z})^2$ , and $(\mathbb{Z}/2\mathbb{Z})^3$ ).
Theorem 1.3 and Tables A.1–A.8 (Classification of Small Exponents): The authors present a conditional classification of all negative discriminants with class group exponents $1 \le E \le 8$ . They provide tables listing these discriminants. The completeness of these tables is established unconditionally for exponent $E=1$ . For exponents $E=2, 4, 8$ , completeness is conditional on the non-existence of Siegel zeros (or potentially missing at most one additional fundamental discriminant unconditionally). Under the Extended Riemann Hypothesis (ERH), the tables for $E=2, 3, 4, 5, 8$ are proven complete, with specific bounds provided for $E=6$ and $E=7$ .

Significance and Motivation
The authors identify three primary motivations for this work:

Theoretical Extension: The results serve as a natural variation of Duke's celebrated equidistribution theorem, extending the analysis from the interior of the fundamental domain to its boundary.
Independent Arithmetic Interest: The classification of discriminants with small class group exponents is of independent interest in algebraic number theory, extending previous work on fundamental discriminants to all discriminants.
Application to Modular Forms: The classification is a prerequisite for results in a separate work [1] concerning the transcendence of zeros of modular forms. The authors note that for certain modular forms (such as Eisenstein series and products thereof), non-transcendental zeros can only occur on the boundary of $F$ . Consequently, identifying the specific discriminants where all CM points reside on the boundary is essential for analyzing the zeros of these forms.

The paper concludes by noting that the algorithmic framework developed for exponent $E$ is generalizable, though the specific tables provided cover $E \le 8$ . The completeness of the results relies on standard conjectures in analytic number theory (Siegel zeros, ERH) regarding the distribution of class numbers and discriminants.

1. The Beacons on the Walls are Evenly Spaced (The "Traffic" Analogy)

2. The "Two-Step" Rule (The "Mirror" Analogy)

3. The "Missing Puzzle Piece" Problem

4. Why Did They Do This?

Summary

More like this