← Latest papers
🔢 mathematics

Integers that are sums of two cubes in the cyclotomic Zp\mathbb{Z}_p-extension

This paper investigates the solvability of the equation n=x3+y3n=x^3+y^3 within the cyclotomic Zp\mathbb{Z}_p-extension of Q\mathbb{Q} for cubefree integers nn that are not sums of rational cubes, demonstrating that such integers cannot be expressed as sums of two cubes in certain large families of prime cyclic extensions of Q\mathbb{Q}.

Original authors: Anwesh Ray

Published 2026-07-08
📖 4 min read🧠 Deep dive

Original authors: Anwesh Ray

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 you have a number, let's call it nn. You want to know if you can build this number by adding together two perfect cubes (like 13+23=91^3 + 2^3 = 9).

Sometimes, you can do this using simple fractions (rational numbers). For example, the number 6 can be written as the sum of two cubes: (17/21)3+(37/21)3(17/21)^3 + (37/21)^3. But sometimes, no matter how hard you try with fractions, you just can't find two numbers that add up to nn.

This paper asks a very specific "what if" question: If you can't build the number nn using fractions, could you build it if you were allowed to use a much more exotic, infinite set of numbers?

The "Infinite Tower" of Numbers

To understand the author's answer, you need to imagine a special kind of number system called the cyclotomic Zp\mathbb{Z}_p-extension.

Think of the rational numbers (fractions) as the ground floor of a building. The author is looking at a specific, infinite tower built on top of that ground floor. This tower is constructed by stacking layer upon layer of "prime cyclic" extensions.

  • The Ground Floor: The standard numbers we use every day (Q\mathbb{Q}).
  • The Infinite Tower: A never-ending staircase of new number systems (Q(p)\mathbb{Q}^{(p)}_\infty) generated by a specific prime number pp (where p5p \ge 5).

The question is: If a number nn is impossible to make on the ground floor, is it possible to make it somewhere up in this infinite tower?

The Main Discovery

The author, Anwesh Ray, proves a very strong "No."

The Claim: If a number nn cannot be written as the sum of two cubes using standard fractions, then it cannot be written as the sum of two cubes using numbers from this specific infinite tower either—provided you pick the right "prime number" (pp) to build the tower with.

It's like saying: "If you can't fit a square peg in a round hole on the ground floor, you won't be able to fit it in the hole even if you keep building the room higher and higher, as long as you follow these specific construction rules."

How They Proved It (The Detective Work)

The author didn't just guess; they used a sophisticated mathematical toolkit called Iwasawa Theory. Here is the analogy for how it works:

  1. The Elliptic Curve Detective: The equation n=x3+y3n = x^3 + y^3 is linked to a shape called an "elliptic curve." Think of this curve as a map. If the map has a certain property (a "rank" greater than zero), it means the number nn can be built. If the rank is zero, it cannot.
  2. The Growth Monitor: The author studies how this "rank" changes as you go up the infinite tower. In many cases, ranks can grow as you add more layers to the tower.
  3. The "Stop" Sign: Using deep theorems from mathematicians like Kato and Rubin, the author shows that for a specific set of prime numbers (about half of all primes), the "rank" of the curve stays stuck at zero all the way up the infinite tower.
  4. The Result: Since the rank stays zero, the number nn remains impossible to build, no matter how high you go in the tower.

The "Big Family" of Primes

The paper also shows that this isn't just a fluke for one specific prime. There is a "large family" of prime numbers (specifically, 50% of all primes) for which this rule holds true. If you pick a prime from this family, the "impossibility" of building the number nn is permanent, even in these infinite extensions.

A Real-World Example

The paper gives a concrete example with the number 3.

  • We know 3 cannot be written as the sum of two rational cubes.
  • The author picks the prime number 7.
  • They prove that even if you go up the infinite tower built on the prime 7, you still cannot write 3 as the sum of two cubes.
  • They even extend this to a specific "neighborhood" (a Galois extension) built on top of that tower, showing the number 3 remains impossible to construct there as well.

Summary

In simple terms: Some numbers are stubborn. If they refuse to be the sum of two cubes in our normal world of fractions, they will continue to refuse that job even if we expand our mathematical universe into these specific, infinite, prime-based towers. The author has identified exactly which "keys" (prime numbers) lock the door on these solutions forever.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →