A trick to ensure positive Mordell-Weil rank

This paper presents a method to guarantee that the Jacobian of a smooth curve has a strictly positive Mordell-Weil rank by proving that such a rank exists whenever the curve possesses a rational degree 1 divisor class but lacks rational non-trivial 2-torsion and rational theta characteristics.

Thibaut Misme

Published 2026-03-05
📖 5 min read🧠 Deep dive

Imagine you are a detective trying to solve a mystery about a hidden treasure map. In the world of advanced mathematics, this "map" is a geometric shape called a curve, and the "treasure" is a special kind of number point called a rational point.

The goal of this paper is to help mathematicians prove that a specific type of treasure map (a curve) definitely has at least one hidden treasure (a non-torsion point) without having to actually dig it up and find it. Digging for these points is notoriously difficult, like finding a needle in a haystack that keeps moving.

Here is the simple breakdown of the author's "trick."

The Setup: The Curve and the Jacobian

Think of the curve CC as a twisted, knotted piece of string floating in space.

  • The Jacobian (JJ): This is a mathematical "shadow" or a "summary" of the curve. If the curve is the string, the Jacobian is the knot-tying machine that tells you all the possible ways you can tie knots on that string.
  • The Rank: This is a number that tells you how many independent treasures (points) are hidden on this machine.
    • Rank 0: No new treasures exist; you can only find the ones you already know (or none at all).
    • Rank \ge 1: There is at least one brand new, unique treasure waiting to be found.

The Problem: Usually, to prove the Rank is at least 1, you have to physically find that new treasure. This is hard.

The Detective's Trick: The "Process of Elimination"

The author, Thibaut Misme, proposes a clever shortcut. Instead of looking for the treasure directly, you look for the absence of two specific types of "fake" clues.

Imagine you are checking a room for a hidden safe. You know that if the safe is empty, there must be either:

  1. A Red Key (a rational 2-torsion point).
  2. A Magic Mirror (a rational theta characteristic).

The author's Proposition 1 says:

If you have a map with a starting point (a degree 1 divisor), and you check the room and find NO Red Keys and NO Magic Mirrors, then the Safe MUST contain a real treasure.

In math terms:

  • If the curve has a rational starting point.
  • AND there are no rational "Red Keys" (2-torsion points).
  • AND there are no rational "Magic Mirrors" (theta characteristics).
  • THEN: The curve definitely has a positive rank (a real treasure exists).

The "Transitive" Shortcut (The Main Trick)

Checking for both Red Keys and Magic Mirrors is still a bit of work. The author refines this into an even easier rule (Corollary 3).

Imagine the "Red Keys" are a group of 20 friends standing in a circle.

  • Transitive Action: If a "Galois group" (a set of rules that shuffle these friends) can move any friend to any other friend's spot, the group is "transitive." They are all mixed up perfectly.
  • Non-Transitive: If the shuffling rules keep certain friends stuck in their own little cliques, the group is not transitive.

The Golden Rule:
If the "Red Keys" (the 2-torsion points) are shuffled so perfectly that they form one big, unbreakable circle (the mathematical term is "irreducible polynomial"), then:

  1. There are no individual Red Keys you can point to.
  2. There are no Magic Mirrors either (because the shuffling is too chaotic for a mirror to exist).
  3. Therefore, the Rank is at least 1.

Real-World Examples from the Paper

Example 1: The Perfect Shuffle (Curve C1C_1)
The author looked at a specific curve. They ran a computer program (Mascot) that generated a giant, complex polynomial equation (a list of numbers).

  • The Test: Is this equation "irreducible"? (Can it be broken down into smaller pieces, or is it one solid block?)
  • The Result: It was one solid block. The "Red Keys" were shuffled perfectly.
  • Conclusion: No fake clues exist. The curve definitely has a hidden treasure. Rank \ge 1.

Example 2: The Broken Shuffle (Curve C2C_2)
The author looked at a second curve.

  • The Test: The polynomial broke apart into smaller pieces. The "Red Keys" were not shuffled perfectly; they were stuck in cliques.
  • The Problem: The simple "Perfect Shuffle" trick didn't work here. We couldn't immediately say "Rank \ge 1" just by looking at the Red Keys.
  • The Fix: The author had to do the harder work: checking the "Magic Mirrors" (theta characteristics) separately.
  • The Result: Even though the Red Keys were messy, there were still no Magic Mirrors.
  • Conclusion: The original trick still worked! Rank \ge 1.

Why This Matters

In the world of math, proving a number exists is often harder than proving it doesn't. This paper gives mathematicians a "negative proof" tool.

Instead of saying, "I found a treasure!" (which is hard), they can now say, "I checked the room, and there are no fake clues, so a treasure must be there." This allows them to certify that complex curves have interesting properties without doing the impossible work of finding the specific points.

In a nutshell: If the "shuffling" of the curve's hidden points is chaotic enough (transitive), you can be 100% sure the curve is rich in hidden treasures, even if you haven't found a single one yet.