🔢 mathematics

Irreducibility of the Cuboid Polynomial $P_{a,u}(t)$ via a Rank-Zero Elliptic Curve

This paper proves the irreducibility of the even monic degree-8 cuboid polynomial $P_{a,u}(t)$ over $\mathbb{Q}$ by demonstrating that any potential factorization would necessitate a rational point on a specific genus-one curve, which is shown to be impossible because the curve is isomorphic to an elliptic curve of rank zero with no suitable rational points.

Original authors: Valery Asiryan

Published 2026-03-17

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Valery Asiryan

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 are a master builder trying to construct a Perfect Cuboid. This is a special 3D box where every edge, every face diagonal (the line across the front, side, or top), and the main diagonal (the line cutting through the center from corner to corner) are all whole numbers. It's a puzzle that has stumped mathematicians for centuries.

In this paper, the author, Valery Asiryan, tackles a specific mathematical tool used to hunt for this box: a giant, complicated 8th-degree polynomial equation (a long string of numbers and variables).

Here is the story of the paper, broken down into simple concepts:

1. The Giant Lock (The Polynomial)

The mathematician Sharipov created a specific formula, let's call it The Lock, to help find the Perfect Cuboid. This Lock is a massive 8th-degree polynomial.

The Goal: To prove that this Lock cannot be broken down into smaller, simpler locks. In math terms, we want to prove it is irreducible.
Why it matters: If the Lock could be broken into smaller pieces, it might mean there are hidden, simpler solutions to the Perfect Cuboid problem. If it cannot be broken, it confirms that the path to finding the box is extremely difficult and follows a very specific, rigid path.

2. The Magic Key (The Quadratic Field)

The author tries to break the Lock by looking at it through a special "magic lens" called a quadratic field (specifically, the world of numbers involving $\sqrt{2}$ ).

The Split: When viewed through this lens, the giant Lock does split into two smaller, 4th-degree locks (let's call them Lefty and Righty).
The Problem: The author needs to prove that even these smaller locks (Lefty and Righty) cannot be broken down any further. If they could be split again, the whole structure would fall apart.

3. The Trap (The Genus-One Curve)

The author asks: "What would happen if we could split Lefty and Righty further?"

The Consequence: He discovers that splitting them further would require a very specific condition to be met: a certain number (let's call it $\tau$ ) would have to be a "perfect square" in a specific way.
The Map: This condition creates a map to a strange, curved landscape called a Genus-One Quartic Curve. Think of this curve as a rollercoaster track. The author proves that if the Lock could be split, there would have to be a "rational point" (a spot with whole-number coordinates) sitting somewhere on this rollercoaster.

4. The Detective Work (The Elliptic Curve)

Now, the author turns this rollercoaster track into a standard Elliptic Curve (a famous type of curve used in cryptography and number theory).

The Rank-Zero Discovery: He calculates the "Rank" of this curve. In simple terms, the Rank tells you how many independent directions you can travel on the curve to find new points.
- A high rank means an infinite highway of points.
- A Rank of Zero means the highway is closed. The only points that exist are a tiny, finite list of "parking spots" (called torsion points).
The Result: The author finds that this specific curve has a Rank of 0. He lists every single possible point on it. There are only 8 points in total.

5. The Dead End

The author checks these 8 points to see if any of them could represent the number $\tau$ needed to split the Lock.

The Mismatch: The only valid points on the curve correspond to values of $\tau$ that are either 0 or 1/4.
The Contradiction: However, the original problem (the Perfect Cuboid setup) requires $\tau$ to be something else entirely (specifically, a ratio of non-zero integers that cannot be 0 or 1/4).
The Conclusion: Since the only possible "parking spots" on the curve don't match the requirements of the problem, the condition to split the Lock is impossible.

6. The Final Verdict

Because the Lock cannot be split even in the "magic lens" world, and because of a mathematical rule called Galois Descent (which says if you can't break it in the expanded world, you definitely can't break it in the normal world), the author concludes:

The giant 8th-degree polynomial is completely irreducible. It cannot be factored. It is a solid, unbreakable block.

Summary Analogy

Imagine you have a giant, unbreakable safe (the Perfect Cuboid problem).

You try to pick the lock using a special tool (the quadratic field).
The tool seems to crack the safe open into two smaller safes.
You try to crack those smaller safes open. To do so, you would need to find a specific key hidden on a tiny, isolated island (the elliptic curve).
You sail to the island and find that the island is so small it only has 8 rocks on it.
You check the rocks, and none of them are the key you need.
Therefore, the smaller safes cannot be opened.
Therefore, the giant safe remains unbreakable.

Why this matters: This confirms a conjecture by R. A. Sharipov. It tells us that the mathematical path to finding a Perfect Cuboid is not hiding any "easy" shortcuts or hidden factors. The problem remains as hard and mysterious as ever.

1. Problem Statement

The paper addresses the Perfect Cuboid Problem, which seeks a rectangular box with integer edge lengths such that all face diagonals and the space diagonal are also integers.

Context: R. A. Sharipov introduced a method associating potential cuboids with even monic polynomials with integer parameters. In the "first-cuboid" specialization ( $a=b$ ), this reduces to the two-parameter degree-8 polynomial:
$P_{a,u}(t) = t^8 + 6(u^2 - a^2)t^6 + ((u^2 - a^2)^2 - 2a^2u^2)t^4 - 6(u^2 - a^2)a^2u^2 t^2 + a^4u^4$
where $a, u \in \mathbb{Z} \setminus \{0\}$ and $u^2 \neq a^2$ .
Conjecture: Sharipov conjectured that for coprime $a \neq u$ , $P_{a,u}(t)$ is irreducible over $\mathbb{Z}[t]$ (and equivalently $\mathbb{Q}[t]$ ).
Goal: The paper aims to prove this conjecture, establishing the full irreducibility of $P_{a,u}(t)$ for all non-zero integers $a, u$ with $u^2 \neq a^2$ .

2. Methodology

The proof employs a multi-stage approach combining algebraic number theory, the geometry of curves, and the arithmetic of elliptic curves.

A. Splitting over a Quadratic Extension

The authors first analyze the polynomial over the quadratic field $K = \mathbb{Q}(\sqrt{2})$ .

Factorization: They demonstrate that $P_{a,u}(t)$ splits into two conjugate quartics, $H_-(t)$ and $H_+(t)$ , in $K[t]$ .
Coprimeness: They prove that $\gcd(H_-, H_+) = 1$ in $K[t]$ .
Reduction: Any further factorization of $H_{\pm}(t)$ in $K[t]$ must be even in $t$ (due to the structure of the polynomial and the field being totally real). This reduces the problem to determining if a specific quadratic polynomial in $S = t^2$ splits in $K[S]$ .

B. Reduction to a Genus-One Quartic

The condition for the quadratic in $S$ to split requires its discriminant to be a square in $K$ .

Parametrization: By setting $\tau = (au/\Delta)^2$ (where $\Delta = u^2 - a^2$ ), the condition translates to the existence of a rational point $(y, v)$ on the curve:
$C: v^2 = 16y^4 + 136y^2 + 1$
where $y^2 = \tau$ .
Geometric Nature: The curve $C$ is identified as a smooth projective curve of genus 1.

C. Isomorphism to an Elliptic Curve

To analyze the rational points on $C$ , the authors construct an explicit isomorphism to a Weierstrass model of an elliptic curve $E$ .

Target Curve: The curve is mapped to:
$E: Y^2 = X(X-8)(X-9) = X^3 - 17X^2 + 72X$
Properties: This curve has conductor 48 and is labeled 48a3 in the Cremona database.
Isomorphism: An explicit rational map $\phi: C \to E$ is provided, allowing the transfer of rational points between the two curves.

D. Arithmetic Analysis (Rank and Torsion)

The core of the proof relies on the arithmetic properties of $E(\mathbb{Q})$ .

Mordell-Weil Group: Using computational tools (Magma) and standard databases, the authors establish that:
- The rank of $E(\mathbb{Q})$ is 0.
- The torsion subgroup is isomorphic to $\mathbb{Z}/2\mathbb{Z} \oplus \mathbb{Z}/4\mathbb{Z}$ .
Enumeration: Since the rank is 0, the set of rational points $E(\mathbb{Q})$ is finite and consists entirely of torsion points. The authors enumerate these 8 points and map them back to $C(\mathbb{Q})$ .

E. Descent Argument

Exclusion of Parameters: The rational points on $C$ yield only two possible values for the parameter $\tau = y^2$ : $\tau \in \{0, 1/4\}$ .
Contradiction: The authors prove that for valid integer parameters $a, u$ $a, u$ (where $au \neq 0$ $a u \neq = 0$ and $u^2 \neq a^2$ $u^{2} \neq = a^{2}$ ), $\tau$ $τ$ cannot be 0 or $1/4$ $1/4$ .
- $\tau = 0$ implies $au=0$ (forbidden).
- $\tau = 1/4$ implies $u/a = 1 \pm \sqrt{2}$ , which is irrational, contradicting $a, u \in \mathbb{Q}$ .
Conclusion: Since no valid $\tau$ exists, the discriminant is never a square in $K$ . Thus, $H_{\pm}(t)$ are irreducible in $K[t]$ .
Galois Descent: A quadratic Galois descent lemma is applied to show that if $P_{a,u}(t)$ factors over $\mathbb{Q}$ , it must factor over $K$ in a specific way that contradicts the irreducibility of $H_{\pm}$ . Therefore, $P_{a,u}(t)$ is irreducible over $\mathbb{Q}$ and, by Gauss's Lemma, over $\mathbb{Z}$ .

3. Key Contributions

Proof of Sharipov's Conjecture: The paper provides a rigorous proof that the degree-8 cuboid polynomial $P_{a,u}(t)$ is irreducible over $\mathbb{Z}[t]$ for all non-zero integers $a, u$ with $u^2 \neq a^2$ .
Explicit Isomorphism: It constructs an explicit isomorphism between a specific genus-one quartic curve arising from the factorization problem and the elliptic curve $Y^2 = X(X-8)(X-9)$ .
Application of Rank-Zero Curves: The proof elegantly utilizes the fact that the associated elliptic curve has rank 0, reducing an infinite search for rational points to a finite enumeration of torsion points.
Algebraic Descent: It demonstrates a clear application of quadratic Galois descent to lift irreducibility from a quadratic extension back to the base field $\mathbb{Q}$ .

4. Results

Main Theorem: For any integers $a, u$ with $au \neq 0$ and $u^2 \neq a^2$ , the polynomial $P_{a,u}(t)$ is irreducible in $\mathbb{Z}[t]$ .
Factorization over $\mathbb{Q}(\sqrt{2})$ : The polynomial splits into two irreducible quartics $H_-(t)$ and $H_+(t)$ over $\mathbb{Q}(\sqrt{2})$ , but these quartics do not split further.
Rational Points: The set of rational points on the curve $C: v^2 = 16y^4 + 136y^2 + 1$ is exactly 8 points: two at infinity and six affine points corresponding to $\tau \in \{0, 1/4\}$ .

5. Significance

Progress on the Perfect Cuboid: While the perfect cuboid problem remains unsolved, this result eliminates a specific class of potential algebraic solutions. If a perfect cuboid existed, it would have to satisfy conditions that do not lead to a factorization of this specific polynomial, narrowing the search space for potential counterexamples or solutions.
Methodological Bridge: The paper serves as a strong example of how modern arithmetic geometry (elliptic curves, Mordell-Weil groups) can solve classical problems in polynomial irreducibility and Diophantine equations.
Computational Verification: The proof integrates theoretical derivation with computational verification (using Magma) to confirm the rank and torsion of the elliptic curve, ensuring the result is robust and verifiable.

In summary, Asiryan confirms that the algebraic structure underlying the "first cuboid" specialization is fundamentally irreducible, relying on the scarcity of rational points on a specific rank-zero elliptic curve to rule out any further factorization.