Sparse Polynomial-Weighted Expansions
Han Wang
math.NT
Jun 23, 2026 · v4
TL;DR
The main density conclusion, Corollary 1.2, and finite counterparts of all numbered estimates are formalized in Lean 4 with a trust audit, implemented with AI assistance.
Abstract
Let $b\ge2$ be an integer, let $p\in\mathbb{Q}[x]$ be nonzero, and let $S\subseteq\mathbb{N}$ be infinite. We prove that if $\sum_{n\in S}p(n)b^{-n}$ is rational, then, for every fixed $0<θ\le1$, there is a constant $c>0$ such that $|S\cap(N,N+W]|\ge cW$ for all sufficiently large $N$ and every $N^θ\le W\le N$. Thus rationality forces positive lower density; if $S=\{a_1<a_2<\cdots\}$ and $d=°p$, it also forces $a_{j+1}-a_j\le d\log_ba_j+O(1)$. In the binary linear case, the result implies the irrationality conjectured by Erdős whenever $a_j/j\to\infty$. The proof turns rationality into an integer carry orbit of polynomial height. Repeated gap words lock the orbit onto rational polynomial graphs, while the normalized highest Newton coefficient evolves by an expanding affine map. Denominator preservation, polynomial sampling, and an interior–exterior count then rule out sparse polynomial-scale windows.
Problem
For an integer base b≥2, a nonzero rational polynomial p, and an infinite set S of naturals, the question is how sparse S can be if the series of p(n)b^{-n} over n in S is rational. The motivating case is Erdős's question on the irrationality of the sum of a_j 2^{-a_j} when a_j/j→∞.
Approach
Rationality is converted into an integer carry orbit of polynomial height. Repeated gap words lock the orbit onto rational polynomial graphs, while the normalized highest Newton coefficient evolves by an expanding affine map. Denominator preservation, polynomial sampling, and an interior–exterior counting argument rule out sparse polynomial-scale windows. The main density conclusion and finite versions of the estimates were formalized in Lean 4, with AI assistance.
Results
Rationality forces S to occupy a positive proportion of every window (N, N+W] with N^θ ≤ W ≤ N, so S has positive lower density. Gaps satisfy a_{j+1}-a_j ≤ d log_b a_j + O(1), which yields Erdős's conjectured irrationality in the binary linear case whenever a_j/j→∞.