🔢 mathematics

On the Connection Between Irrationality Measures and Polynomial Continued Fractions

This paper generalizes Apéry's method by establishing conditions under which polynomial continued fractions generate effective Diophantine approximations to prove irrationality, applying these findings to fundamental constants like $\pi$ , $e$ , and $\zeta(3)$ while proposing new conjectures to aid in resolving open problems regarding the irrationality of constants such as the Catalan constant.

Original authors: Nadav Ben David, Guy Nimri, Uri Mendlovic, Yahel Manor, Carlos De la Cruz Mengual, Ido Kaminer

Published 2026-01-30

📖 5 min read🧠 Deep dive

CC0 1.0

Original authors: Nadav Ben David, Guy Nimri, Uri Mendlovic, Yahel Manor, Carlos De la Cruz Mengual, Ido Kaminer

Original paper dedicated to the public domain under CC0 1.0 (http://creativecommons.org/publicdomain/zero/1.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 trying to guess the exact value of a mysterious number, like $\pi$ or a special constant called Apéry's constant. You do this by creating a long list of simple fractions (like 22/7 or 355/113) that get closer and closer to the real number. In math, this is called a Diophantine approximation.

The paper you provided is about a specific, powerful way to generate these fractions using a machine-like rule called a Polynomial Continued Fraction (PCF). Think of a PCF as a recipe where the ingredients (the numbers in the fraction) change according to a simple algebraic formula (a polynomial) as you go deeper into the recipe.

Here is the breakdown of their discovery using simple analogies:

1. The Problem: The "Giant" Numbers

When you follow these recipes to get very accurate approximations, the numbers in your fractions (the denominators) tend to grow incredibly fast—so fast they become "super-exponential." It's like trying to count the grains of sand on all the beaches in the world, but the number of grains doubles every time you take a step. These numbers get so huge that computers struggle to handle them, and it becomes hard to tell if the final number is truly irrational (cannot be written as a simple fraction) or just a very complex rational number.

2. The Discovery: The "Magic Shrinker" (Factorial Reduction)

The authors found a secret trick. Sometimes, even though the raw numbers in the recipe are gigantic, they all share a massive common factor. It's like if you had a pile of 1,000,000 LEGO bricks, but you realized they were all made of 10,000 identical blocks stuck together. If you take those blocks apart, you are left with a much smaller, manageable pile.

They call this "Factorial Reduction" (FR).

Without FR: The numbers grow like a runaway train (super-exponentially).
With FR: After you divide out the common "blocks" (the Greatest Common Divisor), the numbers grow at a much slower, manageable speed (exponentially).

3. The Golden Rule: The "Root" Test

The most exciting part of the paper is their discovery of a simple rule to predict if a recipe will have this "Magic Shrinker" or not.

They found that it all depends on the shape of the "ingredient list" (specifically the polynomial $b_n$ ).

The Rule: If the ingredient list has rational roots (think of these as "nice, clean numbers" like 2, -3, or 1/2), the recipe will almost certainly have the Magic Shrinker.
The Fail: If the ingredient list has "messy" roots (like irrational numbers involving square roots, or imaginary numbers), the Magic Shrinker does not work. The numbers stay gigantic, and the approximation is inefficient.

Analogy: Imagine you are sorting a bag of marbles. If the bag contains only red and blue marbles (rational roots), you can easily sort them into neat piles. If the bag contains marbles that are half-red, half-blue, and half-transparent (irrational roots), you can't sort them, and the pile remains a chaotic mess.

4. Why This Matters: Proving Irrationality

Why do we care about shrinking these numbers?

Proving Irrationality: To prove a number is irrational, you need to show that your fractions get close to the number very quickly compared to how big the denominators are. The "Magic Shrinker" makes the denominators smaller, which makes the fractions look much more impressive. It's like showing you can hit a bullseye with a tiny target rather than a giant one.
The Formula: The authors created a formula that takes the "ingredient list" and tells you exactly how good the approximation is, without needing to know the final number beforehand. It's like a mechanic looking at a car engine and saying, "This car will go 200 mph," just by looking at the parts, without ever driving it.

5. The "Ramanujan Machine" Connection

The paper mentions that these formulas were often found by a computer project called the "Ramanujan Machine." This project uses algorithms to guess new formulas for constants like $\pi$ and $e$ .

The authors' work acts as a filter for this computer. Instead of the computer wasting time testing millions of recipes that result in messy, unmanageable numbers, it can now use the "Root Test" to instantly pick only the recipes that have the "Magic Shrinker." This makes the search for new mathematical truths much faster and more efficient.

Summary

In short, this paper provides a cheat sheet for mathematicians and computers. It tells them:

How to spot a mathematical recipe that will produce clean, manageable numbers (Factorial Reduction).
How to predict if that recipe is powerful enough to prove a number is irrational.
How to build infinite families of these powerful recipes based on simple rules about the numbers inside them.

They haven't just found one new formula; they've found the blueprint for how these formulas work, suggesting that if the "ingredients" are "nice" (rational roots), the math will behave beautifully.

Technical Summary: On the Connection Between Irrationality Measures and Polynomial Continued Fractions

Problem Statement
The paper addresses the challenge of identifying which Polynomial Continued Fractions (PCFs) generate efficient Diophantine approximations capable of proving the irrationality of fundamental mathematical constants (such as $\pi$ , $e$ , $\zeta(3)$ , and the Catalan constant). While specific PCFs, most notably those used by Apéry to prove the irrationality of $\zeta(3)$ , are known to work, there is no general theory determining which pairs of integer polynomials $(a_n, b_n)$ defining a PCF yield a nontrivial irrationality measure $\delta$ . Furthermore, existing algorithms (such as those in the Ramanujan Machine project) generate conjectured PCFs based on numerical matches but lack a systematic method to verify their efficiency or prove irrationality without explicit knowledge of the limit.

Methodology
The authors generalize Apéry's specific approach to arbitrary PCFs defined by linear recursions with integer polynomial coefficients. The core methodology involves:

Analyzing Convergence and GCD Growth: The study focuses on "balanced-degree" PCFs where $\deg(b_n) = 2 \deg(a_n)$ . The authors analyze the growth rate of the greatest common divisor, $GCD_n = \gcd(p_n, q_n)$ , of the numerator and denominator sequences generated by the PCF.
Defining Factorial Reduction (FR): They introduce the concept of Factorial Reduction, a phenomenon where the $GCD_n$ grows sufficiently fast (specifically, at a rate comparable to $n!^{\deg(a_n)}$ ) such that the reduced denominator $q_n / GCD_n$ grows only exponentially rather than super-exponentially.
Deriving Irrationality Bounds: Using the growth rates of the PCF terms and the $GCD_n$ , the authors derive a formula for the irrationality measure $\delta$ that depends on the leading coefficients of the polynomials and the exponential order of the $GCD_n$ .
Computational Verification: The theoretical framework is tested extensively using computer algorithms on PCFs found by the Ramanujan Machine and other known formulas. The authors numerically verify the existence of FR and the resulting $\delta$ values for various constants.

Key Contributions and Results

Theorem 1 (Necessity of FR): The authors prove that for a balanced-degree PCF to provide a nontrivial irrationality measure ( $\delta > -1$ ), it must exhibit Factorial Reduction. Specifically, the limit superior of $\frac{1}{n} \ln(GCD_n / n!^{\deg(a_n)})$ must be greater than $-\infty$ .
Theorem 2 (Formula for $\delta$ ): A closed-form expression is derived for the lower bound of the irrationality measure:
$\delta = \frac{\ln|\alpha| - \ln|B| + \ln \lambda}{\ln|\alpha| - \ln \lambda}$
Here, $\alpha$ is the larger root of the characteristic equation $x^2 - Ax - B = 0$ (where $A, B$ are leading coefficients of $a_n, b_n$ ), and $\lambda$ is the exponential order of the $GCD_n$ (where $GCD_n \doteq \lambda^n n!^{\deg(a_n)}$ ). This formula allows the calculation of $\delta$ without knowing the limit of the PCF.
Conjecture 1.1 (Rational Roots Condition): Numerical experiments suggest that a PCF possesses Factorial Reduction if and only if the polynomial $b_n$ has only rational roots. If $b_n$ has irrational or non-real roots, no corresponding $a_n$ yields FR.
Conjecture 1.2 & 1.4 (Infinite Families): For any $b_n$ with rational roots, there exist infinite families of polynomials $a_n$ that generate PCFs with FR. For the specific case of $\deg(b_n)=2$ and $\deg(a_n)=1$ , the authors propose that exactly two infinite families of $a_n$ exist for a given reducible $b_n$ .
Theorem 3 (Infinite Irrationality Proofs): The paper demonstrates that for a fixed $b_n$ with FR, one can construct an infinite family of $a_n$ (by scaling the leading coefficient) such that the resulting $\delta$ approaches 1. This implies that for many $b_n$ , there are infinitely many PCFs that prove the irrationality of their limits.
Computational Efficiency: The identification of FR allows for "simplified recursions." By dividing the standard recursion terms by the predicted $GCD_n$ , the computation of PCF limits can be performed using integers that grow exponentially rather than super-exponentially, significantly speeding up high-precision calculations.

Significance and Claims
The paper claims to provide a systematic framework for analyzing PCFs, moving beyond ad-hoc discoveries like Apéry's constant. By linking the irrationality measure directly to the growth of the $GCD_n$ and the properties of the defining polynomials, the authors offer a tool to:

Predict Irrationality: Determine analytically whether a given PCF candidate is likely to prove irrationality based solely on its polynomial coefficients.
Optimize Search Algorithms: Guide algorithms (like the Ramanujan Machine) to focus on PCFs with Factorial Reduction, filtering out candidates that yield trivial bounds or are computationally intractable.
Accelerate Computation: Enable faster high-precision calculations of fundamental constants by utilizing reduced recursion formulas derived from the $GCD_n$ structure.

The authors acknowledge that while their theorems provide necessary conditions and explicit formulas for $\delta$ , many of their characterizations of the $GCD_n$ structure (such as the specific forms of the exponential parts and the "Zebra" patterns) remain conjectures supported by extensive numerical evidence but awaiting formal proof. They position this work as a step toward a broader theory of linear recursions with integer coefficients and their Diophantine properties.