Bad Reduction of Genus Two Curves with complex multiplication

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Bad Reduction of Genus Two Curves with complex multiplication".

Emmy: Here's the gist of the paper. The paper studies genus two curves with complex multiplication by biquadratic fields to derive upper bounds for the primes of stable bad reduction and prove their existence.

Ada: The authors derive upper bounds for the primes of stable bad reduction of genus two curves with CM by a biquadratic field in terms of the discriminants of the CM orders.

Emmy: Theorem 1.1 states that if C has stable bad reduction at a rational prime p, then p is non-split in Q(√d1) and p ≤ lcm(d1,d2)4.

Ada: The second main result shows that there always exist primes of stable bad reduction.

Title and authors: Ada: We're moving into segment two, focusing on the title and authors of this paper, "Bad Reduction of Genus Two Curves with complex multiplication."

Emmy: I want to talk about how those authors approach the problem described in that title. It sounds like they are taking a very specific geometric object—genus two curves—and looking at its reduction properties.

Kolya: I’m interested in who these authors are, because their background will tell us what kind of tools they bring to this intersection problem.

Ada: They're Bruinier, Yang, and Peng Yu. They bring expertise spanning number theory and geometry, which is exactly what you need for this kind of work involving complex multiplication fields.

Emmy: Their focus seems to be on the biquadratic CM field setting, meaning the Jacobian decomposes into a product of two elliptic curves with CM by orders in the same imaginary quadratic field.

Kolya: That decomposition is key, right? It’s what allows them to use these specific lattice structures we talked about earlier.

Ada: Precisely. And their main goal is deriving upper bounds for the primes where stable bad reduction occurs, using those discriminants from the CM orders as the starting point.

Emmy: They achieve this by giving an explicit description of principally polarized abelian surfaces with CM by a biquadratic field via small CM cycles on an orthogonal Shimura variety of signature three by two <ref:2609.22544#pg1>.

Kolya: That sounds like they are building a geometric object to make the arithmetic intersection problem easier to tackle. It’s translating the abstract number theory into something visual and structural.

Ada: They use this structure to prove an arithmetic intersection formula between these CM cycles and Humbert surfaces in terms of coefficients of incoherent Eisenstein series and representation numbers of ternary positive definite quadratic forms <ref:2609.22544#pg3>.

Emmy: It’s a very sophisticated way to connect the geometry of the curve to deep structures in modular forms. It’s essentially using these tools to set up a precise mathematical framework for the intersection problem.

Kolya: So, what does this mean for us? Does it give us a new way to analyze reduction in genus two curves with CM by biquadratic fields?

Ada: It gives us concrete bounds, Theorem one point one states that if p is a prime of stable bad reduction, it must be non-split in Q(√d1) and its value must be at most lcm(d1, d2) times four <ref:2609.22544#pg2>.

Emmy: That bound depends on the least common multiple of the discriminants d1 and d2, which are defined by the structure of the underlying elliptic curves' CM orders. It’s a direct link between field theory and curve reduction behavior.

Kolya: I wonder if those bounds are tight? Do we know if there are any known counterexamples where a prime is larger than that bound?

Ada: The paper confirms that they have always found examples of bad reduction within these limits, and their second main result proves that such primes always exist <ref:2609.22544#pg3>.

Emmy: That existence proof is what makes this interesting; it’s not just a bound; it guarantees the phenomenon happens. It shows that the intersection framework is robust enough to capture all cases.

Kolya: So, we’re looking at a situation where theory guarantees an event happens within a certain range defined by field invariants. That's what I find compelling.

The paper's summary: Ada: Now that we’ve looked at the setup and the authors, let's go over the main summary of this paper, "Bad Reduction of Genus Two Curves with complex multiplication."

Emmy: Essentially, they are studying genus two curves whose Jacobians have complex multiplication by a biquadratic field. The core finding is that they derive upper bounds for the primes where these curves can have stable bad reduction.

Kolya: So the summary boils down to bounding the primes based on how the CM orders are defined, which is what we discussed before.

Ada: Exactly, and they do this by first giving an explicit description of principally polarized abelian surfaces with CM by a biquadratic field via small CM cycles on an orthogonal Shimura variety of signature three by two <ref:2609.22544#pg1>.

Emmy: Then, they use this geometric description to prove an arithmetic intersection formula between those CM cycles and Humbert surfaces using coefficients of incoherent Eisenstein series and representation numbers of ternary positive definite quadratic forms <ref:2609.22544#pg3>.

Kolya: That intersection formula is the engine that generates the bounds, right? It’s how they translate the geometry into arithmetic constraints.

Ada: Right, and this leads to the main result showing that for any genus two curve with CM by a biquadratic field, stable bad reduction at some prime p always exists <ref:2609.22544#pg3>.

Emmy: The existence proof relies on the arithmetic properties of higher Green functions, which ultimately shows that the normalized arithmetic intersection number is positive <ref:2609.22544#pg3>.

Kolya: So they’ve shown that this intersection number is always positive, which implies Theorem one point seven and confirms the existence of these primes in a rigorous way.

Ada: It's a very structured argument: setup the geometry, derive the intersection tool, prove positivity of that tool, and then conclude existence based on that positivity <ref:2609.22544#pg3>.

Emmy: The implication is that the geometric structure imposed by complex multiplication imposes strong arithmetic restrictions on where bad reduction can happen for these curves. It's a very structured way to look at it.

Kolya: So, the summary is essentially: we use advanced geometry to get an arithmetic formula, prove that formula gives positive results, and conclude that bad reduction primes exist and are bounded by the CM order discriminants.

The paper's improvements: Ada: Now let’s talk about the specific improvements they suggest for this paper. They’re not just stating a result; they are suggesting how to make the analysis even more precise.

Emmy: One improvement is focusing on improving the arithmetic intersection formula calculation itself, specifically using coefficients of incoherent Eisenstein series and representation numbers of ternary positive definite quadratic forms <ref:2609.22544#pg3>.

Kolya: So they can compute J(C) times the decomposable locus A1 x A1

K: Hd1: more accurately, as described in their Theorem five point three <ref:2609.22544#pg2>.

Ada: That means the system can calculate that intersection number using those specific ingredients, which is a computational refinement of their main result. It’s making the computation more precise than just relying on the general existence proof.

Emmy: And they have an automated way to verify the positivity of that normalized arithmetic intersection number <ref:2609.22544#pg3>.

Kolya: So, they can check that A · Z(m)

K: Hd1: is positive by checking the signs of terms in the sum derived from Theorem five point three and Theorem six point one, which is a great verification tool for the positivity claim.

Ada: That automated proof verification means we don't have to rely solely on proving the right-hand side is positive through those higher Green functions, though that confirms it too <ref:2609.22544#pg3>.

Emmy: And they’ve also introduced a specific result related to the Chowla-Selberg type formula when the discriminant d is fundamental, specifically for the case where d1 equals d2 <ref:2609.22544#pg1>.

Kolya: That formula gives a very concrete value: J(C) times (A1 x A1)

K: Hd: equals hd1 squared times p prime a(m)p log p, as stated in Corollary five point four <ref:2609.22544#pg2>. It’s a specific formula for that case.

Ada: That is super useful because it gives an explicit formula for that specific scenario, which helps in computation and understanding the dependence on the primes involved <ref:2609.22544#pg1>.

Emmy: Also, there's a result about identifying the field of definition for genus two curves with CM by a biquadratic field based on their automorphism group structure. If Aut(C) is C2, D4, or D12, they can identify when the curve is defined over a quadratic extension of its field of moduli Remark eight.

Kolya: So these improvements are moving the paper from just proving existence to providing a computational pipeline for verifying those bounds and identifying the curves themselves.

Conclusion: Ada: So to wrap up on this paper, "Bad Reduction of Genus Two Curves with complex multiplication." We’ve seen how they used an arithmetic intersection framework involving Shimura varieties and CM cycles to study stable bad reduction.

Emmy: The key achievement is proving that for genus two curves with CM by a biquadratic field, stable bad reduction primes always exist, which they establish via a positivity argument on the arithmetic intersection number <ref:2609.22544#pg3>.

Kolya: And they’ve provided explicit bounds derived from the CM order discriminants—p is non-split in Q(√d1) and p is less than or equal to lcm(d1, d2) times four <ref:2609.22544#pg3>.

Ada: It's a concrete result: the primes of stable bad reduction always exist within these calculated limits, which is really satisfying because it connects the abstract structure to actual prime numbers.

Emmy: The paper also offers several computational improvements, like an automated way to verify positivity of that intersection number using terms from Theorem five point three and Theorem six point one <ref:2609.22544#pg3>.

Kolya: And the Chowla-Selberg type formula for the fundamental discriminant case gives us a very specific numerical relationship involving hd1 squared times p prime a(m)p log p <ref:2609.22544#pg1>.

Ada: So, the implications are that this work solidifies the connection between complex multiplication, higher geometry, and arithmetic intersection theory as a way to understand reduction properties of these specific curves.

Emmy: It shows that the geometric structure is very restrictive, forcing bad reduction to occur in predictable arithmetic locations defined by those CM orders.

Kolya: I think this work provides a solid foundation for future research into these systems, allowing us to test conjectures about the distribution of these curves with greater confidence.

Ada: This paper on "Bad Reduction of Genus Two Curves with complex multiplication" is a significant contribution because it rigorously establishes the existence and bounds for stable bad reduction primes in this setting.