Papers
Topics
Authors
Recent
Search
2000 character limit reached

Irrationality of rapidly converging series: a problem of Erdős and Graham

Published 29 Jan 2026 in math.NT and math.CA | (2601.21442v1)

Abstract: Answering a question of Erdős and Graham, we show that the double exponential growth condition $\limsup_{n\to\infty}a_n{1/φn}=\infty$ for a monotonically increasing sequence of positive integers ${a_n}{n=1}\infty$, together with the bound $a_n a{n+1}\geq n{1+τ}$, is sufficient for the series $\sum_{n=1}\infty 1/(a_n a_{n+1})$ to have an irrational sum; here $φ$ denotes the golden ratio $(1+\sqrt{5})/2$ and $τ>0$. We also provide a positive generalization to $\sum_{n=1}\infty 1/(a_n{w_0}\cdots a_{n+d-1}{w_{d-1}})$, and a negative result showing that some of its instances are essentially optimal. The original problem was autonomously solved by the AI agent \emph{Aletheia}, powered by Gemini Deep Think, while the remaining material is largely a product of human-AI interactions.

Summary

  • The paper establishes a sharp growth criterion proving the irrationality of series based on double exponential growth conditions in the denominators.
  • It extends prior results by analyzing weighted series and providing both positive and negative results that delineate precise thresholds for irrationality.
  • The study highlights an innovative human-AI collaboration that adapts classical analytical techniques to resolve a longstanding open problem in number theory.

Irrationality Criteria for Rapidly Converging Series: Resolution of an Erdős-Graham Problem

Problem Background and Prior Work

The paper "Irrationality of rapidly converging series: a problem of Erdős and Graham" (2601.21442) addresses a long-standing question originally posed by Erdős and Graham regarding the irrationality of a class of series with rapidly growing denominators. Specifically, for a strictly increasing sequence of positive integers {an}n=1\{a_n\}_{n=1}^\infty satisfying a double exponential growth condition,

lim infnan1/2n>1,\liminf_{n \to \infty} a_n^{1/2^n} > 1,

is the sum

n=11anan+1\sum_{n=1}^\infty \frac{1}{a_n a_{n+1}}

necessarily irrational?

Erdős and Graham conjectured that the growth hypothesis should suffice to guarantee irrationality, though explicit criteria and sharp thresholds for the irrationality of such series remained unresolved. Prior results including those on Ahmes and Cantor series, and notably variants due to Hančl and Tijdeman, provided only partial answers often requiring supplementary divisibility or relative growth constraints.

Main Theorems and Generalizations

The paper establishes definitive conditions for irrationality of series of the form

n=11anan+1an+d1\sum_{n=1}^\infty \frac{1}{a_n a_{n+1} \cdots a_{n+d-1}}

for arbitrary d1d \geq 1, and more general weighted products in the denominators. The central result is as follows:

Theorem (Sharp Growth Criterion).

Let dNd \in \mathbb{N} and let ψ>1\psi>1 be the unique positive solution to ψd=ψd1+1\psi^d = \psi^{d-1} + 1. If {an}\{a_n\} is monotonic and satisfies

limnan1/ψn=,\lim_{n \to \infty} a_n^{1/\psi^n} = \infty,

then the series above is irrational. Conversely, for every C>1C>1, there exists a strictly increasing sequence {an}\{a_n\} with limnan1/ψn=C\lim_{n \to \infty} a_n^{1/\psi^n} = C such that the series is rational.

For d=2d=2, the critical exponent ψ\psi is the golden ratio ϕ=(1+5)/2\phi = (1+\sqrt{5})/2, thus the growth condition connects directly with the original Erdős-Graham problem.

The authors further generalize to sums indexed by tuples w=(w0,w1,...,wd1)\mathbf{w} = (w_0, w_1, ..., w_{d-1}) with weights in the denominators and numerators, showing:

  • A positive result: Under assumptions that anw0an+d1wd1n1+τa_n^{w_0} \cdots a_{n+d-1}^{w_{d-1}} \geq n^{1+\tau} for some τ>0\tau>0, and a limsup-type double exponential growth in ana_n, the corresponding series is irrational.
  • A negative result: If the growth parameter is below the derived threshold (largest root of an associated polynomial), sequences can be constructed such that the sum is rational.

These results are shown to be sharp.

Proof Techniques

The proof synthesizes classical irrationality criteria, notably Mahler’s approach, adapted for these rapidly convergent series. The method involves the construction of integer denominators DND_N capturing partial sums, application of tail bounds, and a detailed analysis of local maxima in the growth sequence using an adaptation of Borel’s "local peak" method.

A key analytic device is the comparison between the growth rate of ana_n and the critical threshold arising from the characteristic polynomial associated to the weights in the denominator. The limiting behavior is leveraged to demonstrate irrationality (or construct rational examples) depending on precise asymptotics.

Nontrivial examples and counterexamples are furnished via careful construction of sequences exploiting the sharpness of the threshold.

Collaborative Methodology and AI Involvement

Of particular note is the methodology: the problem's solution originated from an autonomous AI agent ("Aletheia," built using Gemini Deep Think), which identified and articulated plausible generalizations and proofs. The human authors extended and verified these results, establishing both the mathematical foundation and the limits of prior techniques. This mixed-initiative research contributed substantial advances on an open problem and is among the first documented cases of an AI system autonomously solving a significant problem in transcendental number theory.

Implications

Theoretical Implications:

The paper provides a complete solution and precise boundaries for the irrationality of a broad class of rapidly-converging series. The results extend the taxonomy of series for which irrationality can be inferred purely from denominator growth, notably subsuming prior results for Ahmes and Cantor series as special cases.

Practical Implications:

The characterization of rational/irrational infinite sums with weighted rapidly growing denominators may impact computations and theoretical analyses in analytic number theory, ergodic theory, and related fields.

Implications for AI in Mathematics:

Demonstrating rigorous AI-led discovery augurs a new paradigm wherein autonomous agents contribute nontrivial advances to mathematical research. The human-AI collaboration in this work exemplifies the potential for AI, especially in the exploration of open problems, generalization of classical methods, and hypothesis generation. This could presage new workflows and division of labor in mathematical research, particularly for combinatorial and number-theoretic problems.

Future Directions

Further developments may investigate:

  • The extension of these criteria to broader families of series with less restrictive growth conditions;
  • Automatic theorem proving and refinement of irrationality criteria by AI agents in even more advanced settings, such as transcendence;
  • Systematic exploration of Cantor and Ahmes series via AI-driven classification and construction of sequences with prescribed analytic and arithmetic properties.

The interplay between combinatorial number theory and AI problem-solving is likely to intensify, with AI systems expanding the landscape of solvable mathematical problems and facilitating deeper understanding of foundational questions.

Conclusion

This paper delivers a definitive resolution to the Erdős-Graham problem on the irrationality of series with double exponential growth in denominators, establishing sharp criteria and constructing rational counterexamples at the boundaries. Its technical contributions clarify longstanding open questions in number theory, while the methodology underscores the growing capabilities of autonomous AI systems in mathematical research. The results and method together suggest meaningful advances in both analytic number theory and the future of AI-integrated mathematical discovery.

Paper to Video (Beta)

To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video.

Whiteboard

Explain it Like I'm 14

Irrationality of rapidly converging series: a problem of Erdős and Graham — explained simply

Overview: What is this paper about?

This paper studies when a special kind of infinite sum (a series) must be an irrational number. The series looks like this:

n=11anan+1,\sum_{n=1}^{\infty}\frac{1}{a_n\,a_{n+1}},

where each ana_n is a positive whole number and the ana_n grow very fast. “Irrational” means the sum cannot be written as a fraction of two whole numbers, like 37\frac{3}{7}.

The paper answers a question posed by famous mathematicians Paul Erdős and Ronald Graham in 1980: under what growth conditions on the ana_n does this sum have to be irrational? The authors not only solve this original problem but also prove stronger, more general results. Interestingly, an AI agent named Aletheia (built on Google’s Gemini) discovered a key solution, and the humans expanded, checked, and sharpened it.

The key questions in simple terms

The paper focuses on questions like:

  • If the numbers ana_n grow extremely fast, does the infinite sum 1anan+1\sum \frac{1}{a_n a_{n+1}} become irrational?
  • What is the exact “speed of growth” that guarantees irrationality?
  • Can we generalize this to sums that use longer products, like 1anan+1an+d1\frac{1}{a_n a_{n+1}\cdots a_{n+d-1}} (multiplying dd consecutive terms), or even add small integer weights and coefficients?
  • Are these results the strongest possible, or is there a sharp boundary beyond which the sum can still be rational?

How they approached the problem (methods, with simple analogies)

Think of the series like adding up tiny pieces: each term is a fraction whose denominator is the product of big numbers, so the terms get small very quickly. The main idea is to show that if the ana_n grow fast enough, then the total sum cannot be a simple fraction.

Here are the core tools and strategies, explained in everyday language:

  • A classic “tail test” for irrationality:
    • Suppose you add the first NN terms and then look at the leftover “tail” (everything after NN). If you can multiply the partial sum by a certain large integer DND_N and always get a whole number, then—if the full sum were rational—the tail cannot shrink too quickly. The authors prove that in their setting the tail does shrink too quickly, forcing the full sum to be irrational.
    • This is based on a simple lemma sometimes attributed to Mahler: it connects “integer-multiple partial sums” with how fast the leftover part can get small.
  • Picking “peak moments” where the growth really spikes:
    • They use a trick (often credited to Borel) to find infinitely many points where ana_n jumps faster than before. These “peak moments” let them bound the tail very strongly.
  • Splitting the tail and bounding it in two different ways:
    • The tail is split into two parts: a “near” part and a “far” part. Each part is controlled with different estimates, depending on whether the ana_n are at least exponential (en\ge e^n) or just polynomially large (n1+τ\ge n^{1+\tau}).
  • A carefully chosen constant cc from a polynomial:
    • In the generalized theorems, a special constant cc is defined as the positive root of a certain polynomial that depends on the “weights” of the denominator. This cc acts like a precise growth threshold. Choosing cc this way makes key inequalities work out, letting the authors turn bounds on logan\log a_n into tail bounds.
  • Constructing counterexamples:
    • To show their results are sharp (best possible), they build explicit sequences ana_n right at the boundary growth rate where the sum can still be rational. This proves you really need growth faster than that boundary to guarantee irrationality.

The main findings and why they matter

Here are the central results, stated simply:

  • For the classic two-term product case:

    • If the ana_n grow “double-exponentially fast” in a sense tied to the golden ratio ϕ=1+521.618\phi=\frac{1+\sqrt{5}}{2}\approx 1.618, and if the product anan+1a_n a_{n+1} is at least about n1+τn^{1+\tau} (for some τ>0\tau>0), then the sum

    n=11anan+1\sum_{n=1}^\infty \frac{1}{a_n\,a_{n+1}}

    is irrational. “Double-exponential” here means the size of ana_n behaves like CϕnC^{\phi^n} for some large CC—a growth much faster than 2n2^n, more like stacking exponentials. - They also show this is essentially the exact threshold: if the ana_n only barely meet a weaker version of this growth (approaching a fixed constant at the threshold), it’s possible to make the sum rational. So the boundary between guaranteed irrationality and possible rationality is sharp.

  • A broad generalization:

    • They consider sums of the form

    n=1bnanw0an+1w1an+d1wd1,\sum_{n=1}^\infty \frac{b_n}{a_n^{w_0}a_{n+1}^{w_1}\cdots a_{n+d-1}^{w_{d-1}}},

    where the wjw_j are nonnegative integer “weights” telling you how many times each consecutive term appears in the denominator, bnb_n are small positive integers (like bnnηb_n\le n^\eta), and dd is how many consecutive terms you multiply. - They define a special threshold number cc based on the weights (it’s the positive root of a certain polynomial). If ana_n grow faster than cnc^n in a specific way and the product in the denominator is not too small (at least n1+τn^{1+\tau}), then this sum is irrational. - Again, they prove sharpness: at the matching “tilde-cc” threshold, you can construct sequences where the sum is rational.

Why this matters:

  • It solves an old problem of Erdős and Graham and pinpoints the exact growth boundary for irrationality in these series.
  • It unifies and extends several earlier results on so-called Ahmes and Cantor series (special types of infinite sums studied since the 1800s).
  • It demonstrates a successful collaboration between human mathematicians and AI, with the AI discovering key ideas and humans expanding and proving the most general statements.

Simple discussion of the impact

  • In number theory, understanding when an infinite sum is irrational is important because it tells us how complicated the sum is—whether it can be captured by a simple fraction or not.
  • These results give clear, easy-to-check growth conditions on the sequence ana_n that guarantee irrationality. That makes them practical tools for future problems.
  • The sharp boundary (and matching counterexamples) is especially valuable: it tells mathematicians precisely how fast ana_n must grow to force irrationality, and where rational sums can still occur.
  • The human-AI workflow shown here is a promising model for mathematical research—AI can help spot patterns or propose solutions, and humans ensure rigor, generalization, and clarity.

Extra notes to make terms friendlier

  • “Irrational”: a number that can’t be written as a simple fraction pq\frac{p}{q}.
  • “Series”: an infinite sum, like 1+12+13+1+\frac{1}{2}+\frac{1}{3}+\cdots.
  • “Rapidly converging”: the terms get tiny very fast, so the sum settles down to a limit quickly.
  • “Double exponential growth”: numbers explode faster than 2n2^n—think something like 22n2^{2^n}; in this paper, the growth is controlled by powers like CϕnC^{\phi^n}.
  • “Tail”: the part of the series after you’ve added the first NN terms; it should be small if the series converges quickly.
  • “Weights wjw_j”: how many times each an+ja_{n+j} shows up in the denominator.
  • “Golden ratio ϕ\phi”: about $1.618$, a famous constant that appears in nature, art, and mathematics. Here it marks a precise growth rate threshold.

Overall, the paper nails down a long-standing problem, makes a powerful generalization, proves the results are best possible, and shows how AI can contribute to deep math—wrapped in carefully designed, elementary tools and clever estimates.

Knowledge Gaps

Knowledge gaps, limitations, and open questions

Below is a concise list of specific gaps and directions that remain unresolved by the paper and could guide future work:

  • Optimal threshold for general weights: For integer weights w\mathbf{w} with some wj>1w_j>1, the paper proves sufficiency at cwc_{\mathbf{w}} and constructs counterexamples at c~w<cw\tilde c_{\mathbf{w}}<c_{\mathbf{w}}, but does not determine the exact critical constant. Close the gap by characterizing the optimal threshold (i.e., whether cwc_{\mathbf{w}} is necessary, or identify the true critical constant between c~w\tilde c_{\mathbf{w}} and cwc_{\mathbf{w}}).
  • Borderline growth at the claimed threshold: Determine whether the condition lim infan1/cwn>1\liminf a_n^{1/c_{\mathbf{w}}^n}>1 (at the exact threshold) suffices for irrationality, or whether lim supan1/cwn=\limsup a_n^{1/c_{\mathbf{w}}^n}=\infty is genuinely needed. Provide either a proof or counterexample at the borderline cwc_{\mathbf{w}}.
  • Necessity of monotonicity: All main results assume {an}\{a_n\} is strictly increasing. Investigate whether this can be weakened to eventual monotonicity, bounded multiplicative oscillations, or suitable averaged growth, or removed entirely.
  • Minimal decay/growth assumptions in the general weighted case: Theorem 1.2 assumes anw0an+d1wd1n1+τa_n^{w_0}\cdots a_{n+d-1}^{w_{d-1}}\ge n^{1+\tau} (and bnnηb_n\le n^\eta). Identify the weakest possible tail-decay/growth conditions on xn:=anw0an+d1wd1x_n:=a_n^{w_0}\cdots a_{n+d-1}^{w_{d-1}} (e.g., logarithmic or averaged conditions) under which irrationality still follows.
  • Numerator growth beyond polynomial: Extend the bnnηb_n\le n^\eta hypothesis to larger classes (e.g., bnexp(nα)b_n\le \exp(n^\alpha) for fixed α<1\alpha<1, or more general subexponential envelopes), and characterize sharp boundaries on admissible bnb_n growth.
  • Extension to non-integer weights/exponents: The analytic core (Proposition 3.1) does not use integrality of wjw_j, yet the theorems assume integer weights. Develop versions for real weights wj0w_j\ge 0 and specify the correct replacement for cwc_{\mathbf{w}} (e.g., the unique positive root of an appropriately generalized polynomial/functional equation).
  • Removal of the integrality constraint on ana_n: The Mahler-style integrality device requires integer ana_n. Explore criteria or alternative arguments (e.g., pp-adic or modular reductions) to treat rational or real sequences with comparable growth.
  • Quantitative irrationality: The method establishes irrationality but provides no irrationality measure. Derive explicit lower bounds on rational approximations Sp/q|S-p/q| in terms of qq and the growth data (or prove transcendence under stronger hypotheses).
  • Explicit constructions of rational counterexamples: The rationality counterexamples (Theorem 1.4) are obtained non-constructively via interval coverings. Produce explicit/algorithmic constructions of strictly increasing sequences with prescribed asymptotics anCcna_n\asymp C^{c^n} that yield rational sums.
  • Classification of rational values under growth envelopes: The existence proof shows the set of achievable sums is a finite union of non-degenerate closed intervals. Characterize these intervals explicitly (endpoints, lengths), their dependence on the envelope [βn,γn][\beta_n,\gamma_n], and the density of rational values achieved.
  • Beyond consecutive windows: Generalize from consecutive blocks anw0an+d1wd1a_n^{w_0}\cdots a_{n+d-1}^{w_{d-1}} to sparse or patterned windows jan+σ(j)wj\prod_{j} a_{n+\sigma(j)}^{w_j} with fixed gaps σ(j)\sigma(j). Identify the right “critical constant” (e.g., via roots of a modified polynomial depending on σ\sigma and ww) and the corresponding sufficiency/necessity results.
  • Tradeoffs with arithmetic/divisibility conditions: Prior Cantor-series results use divisibility and relative growth conditions. Systematically map tradeoffs: which arithmetic conditions allow weakening or removal of the polynomial lower bound on xnx_n, or allow weaker growth than lim supan1/cwn=\limsup a_n^{1/c_{\mathbf{w}}^n}=\infty?
  • Signed or conditionally convergent series: The proofs rely on non-negative terms. Extend irrationality criteria to signed numerators bnb_n (allowing cancellations) and to conditionally convergent variants.
  • Linear (in)dependence questions: Go beyond single-series irrationality to linear or algebraic independence over Q\mathbb{Q} of families of such series associated to different sequences or weight patterns, in the spirit of references like HS03.
  • Variable window length or weights: Analyze sums with window length dd or weights w\mathbf{w} varying with nn (e.g., d=d(n)d=d(n), wj=wj(n)w_j=w_j(n)). Formulate and prove analogues of the main theorems and identify the appropriate growth thresholds.
  • Optimization of analytic lemmas: The dyadic-block estimates (Lemma 3.5) and peak arguments are effective but possibly conservative. Refine these bounds to push the admissible parameter ranges (e.g., reduce τ\tau, relax η\eta, improve constants in the Case (A)/(B)/(C) analysis).
  • Clarify minimal hypotheses for the d=2d=2 case: The abstract states a condition including anan+1n1+τa_n a_{n+1}\ge n^{1+\tau}, while Theorem 1.1(i) for d=2d=2 appears to omit this. Precisely identify the weakest hypothesis for d=2d=2 and reconcile the statements (or state the strongest currently proved and the gap to the conjectured minimal one).
  • Empirical/numerical mapping of thresholds: Systematically compute cwc_{\mathbf{w}} and c~w\tilde c_{\mathbf{w}} across parameter regimes to identify when cw2c_{\mathbf{w}}\ge 2 (where older results already apply) and where the new results are genuinely stronger, guiding conjectures about the optimal threshold in the wj>1w_j>1 regime.

Practical Applications

Immediate Applications

The paper delivers both new mathematical criteria for irrationality of certain fast-converging series and a concrete methodology for human–AI collaboration in mathematical research. The following items can be deployed now, with modest engineering or curricular effort.

  • Math research workflows: AI-assisted problem selection and solution prototyping
    • Sector: software (research tooling), academia (mathematics and theoretical CS)
    • Use case: Deploy agents like Aletheia/Gemini Deep Think to mine open-problem repositories, triage problems by solvability likelihood, propose candidate generalizations, and draft proof sketches that humans refine.
    • Tools/products:
    • A “math-research copilot” that ingests problem lists (e.g., OEIS notes, problem books, curated sites), ranks targets, and iteratively proposes lemmas/conjectures.
    • A protocol template for human–AI interactive theorem discovery (as used in the paper steps 2–6).
    • Dependencies/assumptions: Access to curated problem databases; human oversight for proof validation; compute resources for iterative search; institutional norms to accept AI-enabled contributions.
  • Irrationality checkers for Ahmes/Cantor series under growth constraints
    • Sector: software (CAS), academia (number theory), education (advanced courses)
    • Use case: Implement a module that verifies the irrationality of sums of the form S = ∑ b_n / (a_n{w_0} … a_{n+d-1}{w_{d-1}}) by checking the paper’s sufficient conditions (e.g., monotone integers a_n, product lower bound a_n…a_{n+d-1} ≥ n{1+τ}, and limsup growth thresholds based on the root c_𝐰).
    • Tools/products:
    • CAS plugin (Sage/Maple/Mathematica) that computes c_𝐰, tests the bnb_n/ana_n hypotheses, and certifies “irrational under Theorem X”.
    • Python library for researchers to auto-generate certificates in preprints.
    • Dependencies/assumptions: Users must provide or verify monotonicity and growth bounds; numerical approximations to cwc_{\mathbf{w}} are stable; edge cases (near-sharp thresholds) are flagged.
  • “Nothing-up-my-sleeve” constant generation with provable irrationality
    • Sector: standards, software engineering, cryptography (non-secret, public constants)
    • Use case: Define public constants as sums of the paper’s series meeting sufficient conditions for irrationality; this deters simplistic rational backdoors and aids auditability.
    • Tools/products:
    • A reference generator that takes seed parameters (w,d,τ,η)(\mathbf{w}, d, \tau, \eta) and outputs a documented, auditable irrational constant with growth proofs.
    • Dependencies/assumptions: While irrationality ≠ randomness, it provides transparent construction; must avoid implying cryptographic strength; needs reproducible generation and archival of conditions.
  • Pedagogy: Curriculum modules on irrationality and human–AI collaboration
    • Sector: education
    • Use case: Course materials and interactive notebooks demonstrating Mahler’s criterion, the Borel-style “peak” trick, and the new thresholds (ψ\psi, cwc_{\mathbf{w}}) in practice, paired with an AI-in-the-loop proof exploration.
    • Tools/products:
    • Jupyter notebooks with examples of sequences ana_n meeting/failing thresholds; auto-checkers for conditions.
    • Case-study unit on “AI in mathematical discovery” including authors’ explicit timeline and best practices.
    • Dependencies/assumptions: Instructor familiarity with number theory; access to LLMs in classroom settings and institutional guidelines for AI usage.
  • Policy and publishing practice: AI-usage declarations and attribution patterns
    • Sector: policy, academic publishing
    • Use case: Adopt a standardized AI-usage declaration section for research articles, modeled on this paper’s “Declaration of AI usage.”
    • Tools/products:
    • Journal policy templates and checklists for AI contribution disclosure, versioning of AI outputs, and human verification.
    • Dependencies/assumptions: Editorial board buy-in; community consensus on disclosure granularity.
  • Benchmark datasets for automated theorem discovery and verification
    • Sector: AI research, software
    • Use case: Create benchmarks composed of (i) solvable open problems similar to Erdős–Graham #1051 variants; (ii) positive/negative instances (sharpness) generated by Theorem 1.3 and Theorem 1.5; (iii) verifiable proofs via Mahler’s criterion/Borel-peak strategy.
    • Tools/products:
    • Public GitHub repos with problem statements, parameterized instances, ground-truth labels (irrational vs rational), and proof scripts.
    • Dependencies/assumptions: Clean licensing for problem sources; reliable numerical approximations or formalized proofs where feasible.

Long-Term Applications

The following opportunities require further research, infrastructure, or community standardization before full deployment.

  • Formal verification pipelines for AI-generated proofs in number theory
    • Sector: software (formal methods), academia
    • Use case: Integrate LLM-driven conjecture generation with Lean/Coq/Isabelle for end-to-end verified proofs of series irrationality and generalizations (beyond Ahmes/Cantor types).
    • Tools/products:
    • Tactics encoding Mahler-type criteria and the paper’s lemmas (e.g., Lemma 2.1, 2.2) as reusable libraries.
    • Automated checking of growth assumptions in formal environments.
    • Dependencies/assumptions: Formal libraries for analytic number theory; new tactics for handling limsup/liminf and asymptotics; significant engineering effort.
  • General-purpose open-problem mining and triage platforms across disciplines
    • Sector: cross-domain R&D, software
    • Use case: Expand the “autonomous narrowing” used by Aletheia to physics, CS theory, and operations research to match problem difficulty with model capability and propose pathways to solution.
    • Tools/products:
    • A cross-field “Problem Navigator” that scores problems by tractability, suggests generalizations, and tracks provenance of ideas.
    • Dependencies/assumptions: Domain-specific corpora; evaluation metrics for partial progress; mixed-initiative interfaces for expert feedback.
  • Advanced constant design and auditing in standards bodies
    • Sector: standards, cryptography, finance
    • Use case: Commission curated families of provably irrational constants with transparent construction for protocols (e.g., “beacon” constants, hash-round constants) that avoid simple rational structure.
    • Tools/products:
    • Standards-track documents outlining selection criteria, reproducibility, and audit procedures based on growth conditions and sharpness theorems.
    • Dependencies/assumptions: Community agreement that irrationality and construction transparency are desirable properties; clear communication that this is not a security property per se.
  • Heuristic and structural detectors for rationality/irrationality in symbolic systems
    • Sector: CAS, AI4Math
    • Use case: Extend the paper’s thresholds into learned or rule-based detectors that recognize when unfamiliar series are likely irrational, guiding simplification and preventing misleading rational approximations in numerical pipelines.
    • Tools/products:
    • Hybrid rule/ML models integrated into CAS that suggest applicable criteria (e.g., compute cwc_{\mathbf{w}}, estimate growth of ana_n) and warn users when the series is near sharp thresholds.
    • Dependencies/assumptions: Robustness of growth estimation from sampled terms; calibration to avoid false positives; user-interface design for explainability.
  • Cross-pollination to transcendence and Diophantine approximation
    • Sector: academia
    • Use case: Explore whether analogous growth-threshold methods and peak-leap arguments yield new criteria for transcendence or for irrationality of more general series/integrals (e.g., with dependent terms or stochastic perturbations).
    • Tools/products:
    • Research programs extending cwc_{\mathbf{w}}-based reasoning; workshops on AI-guided conjecture patterning for Diophantine problems.
    • Dependencies/assumptions: Nontrivial theoretical advances; interplay with existing results (e.g., Baker theory, Mahler’s method).
  • Stress-testing and red-teaming of math-reasoning AI via “sharpness” counterexamples
    • Sector: AI safety/reliability
    • Use case: Use the paper’s near-optimal negative examples (Theorem 1.5) to create adversarial test suites that probe LLMs’ susceptibility to over-generalization in proofs.
    • Tools/products:
    • Unit tests that systematically vary (w,d)(\mathbf{w}, d) and growth rates across cwc_{\mathbf{w}} vs c~w\tilde c_{\mathbf{w}} regimes; scorecards tracking failure modes.
    • Dependencies/assumptions: Robust pipelines for generating and verifying labeled instances; collaboration with benchmark maintainers.
  • Curriculum on responsible AI in pure mathematics
    • Sector: education, policy
    • Use case: Develop joint curricula that teach (i) classical techniques (Fourier/Mahler criteria), (ii) modern AI collaboration protocols, and (iii) ethics/attribution standards.
    • Tools/products:
    • Co-developed syllabi across math and CS departments; case-study repositories; assessment rubrics for AI usage disclosure and validation.
    • Dependencies/assumptions: Institutional policy alignment; faculty development; access to AI tools with audit logs.

Key mathematical assumptions and dependencies (affecting feasibility)

  • Monotone growth and lower bounds
    • ana_n must be a monotonically increasing sequence of positive integers; often with product constraints such as anan+1an+d1n1+τa_n a_{n+1} \cdots a_{n+d-1} \ge n^{1+\tau} and bnnηb_n \le n^\eta (with 0<η<τ0<\eta<\tau).
  • Double-exponential/threshold growth conditions
    • Sufficient conditions reference lim supan1/cwn=\limsup a_n^{1/c_{\mathbf{w}}^n}=\infty; for d=2d=2, thresholds involve the golden ratio ϕ\phi; for general w\mathbf{w}, the critical constant cwc_{\mathbf{w}} is the unique positive root of Pw(x)=(x1)j=0d1wjxjWxd1P_{\mathbf{w}}(x)=(x-1)\sum_{j=0}^{d-1} w_j x^j - W x^{d-1}.
    • Negative (sharpness) results hinge on c~w\tilde c_{\mathbf{w}}, the largest positive root of P~w(x)=(x1)j=0d1wjxjxd1\widetilde{P}_{\mathbf{w}}(x)=(x-1)\sum_{j=0}^{d-1} w_j x^j - x^{d-1}.
  • Edge-case sensitivity
    • Near-critical growth (approaching cwc_{\mathbf{w}} from below) can flip the outcome (rational vs irrational); tools must surface uncertainty when hypotheses are tight.
  • Human oversight for AI contributions
    • The methodology presumes rigorous human validation of AI-discovered statements and proofs; reproducibility and attribution practices are integral for adoption.

These applications leverage both the paper’s mathematical advances (general irrationality criteria and sharpness) and its demonstrated human–AI research process, enabling immediate tooling and curricular upgrades and charting a path to more ambitious, formally verified and cross-domain AI research platforms.

Glossary

  • Ahmes series: A class of series consisting of reciprocals of a strictly increasing sequence of positive integers, studied in relation to irrationality questions. "Series of the form n=11an\sum_{n=1}^{\infty} \frac{1}{a_n} for a strictly increasing sequence of positive integers {an}n=1\{a_n\}_{n=1}^\infty are sometimes called Ahmes series."
  • Cantor series: Series of the form n=1bna1a2an\sum_{n=1}^{\infty} \frac{b_n}{a_1 a_2 \cdots a_n} with an2a_n\ge 2, used to represent real numbers; their irrationality properties have been widely studied. "for some positive integer sequences {an}n=1\{a_n\}_{n=1}^\infty and {bn}n=1\{b_n\}_{n=1}^\infty with an2a_n\geq2 for every nn are known as Cantor series."
  • Descartes' rule of signs: A polynomial root-counting rule that bounds the number of positive real roots by the number of sign changes in its coefficients. "and applying Descartes' rule of signs to QQ, we easily conclude that $P_{\mathbf{w}$ has precisely one root in (1,)(1,\infty)."
  • double exponential growth condition: A growth regime where ana_n grows roughly like exp(Θ(ϕn))\exp(\Theta(\phi^n)), here expressed via an unbounded lim sup\limsup of an1/ϕna_n^{1/\phi^n}. "double exponential growth condition lim supnan1/ϕn=\limsup_{n\to\infty}a_n^{1/\phi^n}=\infty"
  • dyadic blocks: A technique partitioning indices or ranges into blocks whose sizes are powers of two, often used to control sums. "We prove it by splitting positive integers into dyadic blocks."
  • golden ratio: The constant ϕ=(1+5)/21.618\phi=(1+\sqrt{5})/2\approx 1.618, which appears as a threshold in growth conditions for the sequences considered. "here ϕ\phi denotes the golden ratio (1+5)/2(1+\sqrt{5})/2"
  • irrationality criterion: A general method or lemma that provides conditions under which a sum cannot be rational, often using denominator clearing and tail estimates. "We utilize a classical irrationality criterion that dates back to at least Fourier's proof of the irrationality of the number ee"
  • liminf: The limit inferior of a sequence, i.e., the greatest lower bound of its subsequential limits. "lim infnan1/2n>1,\liminf_{n\to\infty} a_n^{1/2^n}>1,"
  • limsup: The limit superior of a sequence, i.e., the least upper bound of its subsequential limits. "lim supnan1/2n=.\limsup_{n\to\infty} a_n^{1/2^n}=\infty."
  • Mahler's criterion: A lemma giving a positive lower bound on scaled tails of rational series when the total sum is rational, used to deduce irrationality by contradiction. "Mahler's criterion (Lemma~\ref{lem:mahler}) can be applied to the series"
  • peak-index set: A set of indices where a derived sequence exceeds all previous values by a controlled multiplicative margin; used in the proof strategy. "the peak-index set P\mathcal{P} in Lemma~\ref{lem:borel} is infinite"
  • Sylvester sequence: The rapidly growing integer sequence defined by s1=2s_1=2 and sn+1=s1s2sn+1s_{n+1}=s_1s_2\cdots s_n+1, classical in Egyptian fraction theory. "the well-known Sylvester sequence provides an explicit example of a sequence as in Part \eqref{it:T2}"
  • Vinogradov notation: The analytic number theory notation fgf\ll g meaning f=O(g)f=O(g), i.e., fCg|f|\le C|g| for some constant CC. "This is the Vinogradov notation for f=O(g)f=O(g)."

Open Problems

We found no open problems mentioned in this paper.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 12 tweets with 862 likes about this paper.