Torsion points on GL2\rm{GL}_2-type abelian varieties

Inspired by Katz's work, this paper investigates the converse of the known property regarding rational torsion injection into reductions for GL2\rm GL_2-type abelian varieties and proposes a conjectural list of possible torsion orders for modular abelian varieties over Q\mathbb Q with dimension up to 5.

Jessica Alessandrì, Nirvana Coppola

Published Tue, 10 Ma
📖 4 min read🧠 Deep dive

Imagine you are trying to figure out how many people are in a secret club (the torsion points) inside a massive, complex building (an abelian variety). This building is defined over a "number field," which is just a fancy way of saying it follows specific mathematical rules based on fractions and whole numbers.

The problem is: The club members are hidden deep inside the building. You can't just walk in and count them. However, you can look at the building's "shadows" or "reflections" projected onto the ground at different locations (these are the reductions modulo primes).

The Old Rule: The Shadow Tells the Truth

Mathematicians have long known a simple rule: If you look at the shadow of the building at a specific spot, the number of people you see in that shadow is always a multiple of the actual number of secret club members inside.

  • Analogy: If the real club has 6 members, the shadow might show 6, 12, 18, or 24 people, but it will never show 7 or 5.
  • The Logic: Therefore, if you look at shadows from many different spots and find the number of people that is common to all of them (the Greatest Common Divisor), that number must be divisible by the real club size.

The Big Question: Does the Shadow Reveal the Whole Truth?

The authors of this paper asked a deeper question, inspired by a famous mathematician named Nicholas Katz:
"If the shadows at almost every single spot all show a number divisible by XX, does that guarantee there is a version of the building where the secret club actually has XX members?"

For simple buildings (like elliptic curves, which are 1-dimensional), the answer is "Yes."
For very complex, multi-dimensional buildings, the answer used to be "No, sometimes the shadows trick you."

The Breakthrough: The "GL2-Type" Buildings

This paper focuses on a specific, important class of buildings called GL2-type abelian varieties. Think of these as buildings that have a special, symmetrical internal structure (like a specific type of crystal lattice) that makes them behave more predictably than random buildings.

The authors proved a powerful theorem:
For these special GL2-type buildings, the shadows do tell the whole truth.

If the shadows at almost every location suggest the club size is a multiple of a certain number, then there definitely exists a version of this building (one that is mathematically "isogenous," or structurally equivalent) where the secret club actually has that many members.

How They Did It (The Detective Work)

To prove this, the authors didn't just count people; they looked at the "blueprints" of the building's symmetry (called Galois representations).

  • The Metaphor: Imagine the building has a security system that changes its code based on who is looking at it. The authors showed that if the security code (the shadow) is "open" (divisible by a number) almost everywhere, then the actual security system must have a "master key" (a rational torsion point) that opens the door.

The Result: A "Wanted" List for Club Sizes

Using this new rule, the authors wrote a computer program (using a system called Magma) to scan thousands of these special buildings. They calculated what the "maximum possible club size" could be for buildings of dimensions 2, 3, 4, and 5.

They produced a "Conjectural List" of possible club sizes.

  • Example: For a 2-dimensional building, the club size could be 1, 2, 3, ... up to 56, but it cannot be 23 or 25 (based on their data).
  • Why it matters: This helps mathematicians fill in the gaps in databases like the LMFDB (a massive library of mathematical objects). They found, for instance, a specific building that should have a club of 28 members, a fact that was missing from previous records.

In Summary

  1. The Problem: We can see "shadows" of hidden mathematical points, but we weren't sure if the shadows always revealed the true size of the hidden group.
  2. The Discovery: For a special, important family of mathematical shapes (GL2-type), the shadows always reveal the truth.
  3. The Application: The authors used this to create a "menu" of all possible sizes for these hidden groups, helping to organize and expand our knowledge of these complex mathematical structures.

It's like finally realizing that if you check the footprints of a hidden animal in the mud at 99% of the locations, you can be 100% sure of exactly how heavy the animal is, provided the animal belongs to a specific, well-behaved species.