Reciprocal-summable supports
For every infinite set 𝐴 of
positive integers with ∑𝑎∈𝐴1/𝑎 <∞, the series
𝑋𝐴(𝑏)=∑𝑎∈𝐴1𝑏𝑎−1
is
irrational at every integer base 𝑏 ≥2. This is the reciprocal-summable
theorem also stated in the short paper’s Appendix A. Erdős’s 1968 paper,
p. 222 proves the pairwise-coprime case at every integer base and
states the removal of coprimality without printing the details. The
proof below gives the stated extension by averaging; no comparison with
the omitted proof is possible. The pairwise-coprime case, Theorem 6.15, retains that
extra hypothesis. The same paper says that ∑1/𝑛𝑖 <∞ could be replaced by
a weaker but more complicated condition (p. 222), and suggests that for
pairwise coprime supports Brun’s method could probably replace it by
∑𝑛𝑖<𝑥1/𝑛𝑖 =𝑜(loglog𝑥)
(p. 226). Theorem 1.1 below proves
irrationality under one explicit weaker condition without coprimality;
no identification with his suggestions is asserted.
We show that rationality would impose a positive lower bound and then
construct smaller values. For a positive integer 𝑁, write 𝑁 =𝑞𝑎𝑎 +𝑟𝑎, 0 ≤𝑟𝑎 <𝑎. The identity
𝑏𝑁−1𝑏𝑎−1=𝑏𝑟𝑎𝑞𝑎−1∑𝑗=0𝑏𝑗𝑎+𝑏𝑟𝑎−1𝑏𝑎−1
shows that
Δ𝑏,𝐴(𝑁):=∑𝑎∈𝐴𝑏𝑁mod𝑎−1𝑏𝑎−1=(𝑏𝑁−1)𝑋𝐴(𝑏)−𝐽𝑁,𝐽𝑁∈ℤ.
The integer sum is
finite, since 𝑞𝑎 =0 for 𝑎 >𝑁. Every summand of Δ𝑏,𝐴(𝑁) is nonnegative and an
exponent 𝑎 >𝑁 makes it positive.
Thus 𝑋𝐴(𝑏) =𝑝/𝑞 would imply Δ𝑏,𝐴(𝑁) ≥1/𝑞 for every 𝑁 >0.
Put 𝑤𝑏,𝑑(𝑁) =𝑏𝑁mod𝑑/(𝑏𝑑 −1). For a fixed positive modulus 𝑄 and 𝑔 =(𝑄,𝑑), the orbit of 𝑄𝑚mod𝑑 has length 𝑑/𝑔. Its geometric sum gives
lim𝑋→∞1𝑋𝑋∑𝑚=1𝑤𝑏,𝑑(𝑄𝑚)=𝑀𝑄,𝑏(𝑑):=𝑔𝑑(𝑏𝑔−1)≤1𝑑.
To interchange this
limit with the sum over the support, expand 𝑤𝑏,𝑑(𝑄𝑚) as ∑𝑟≥1𝑏−𝑟𝟏𝑑∣𝑄𝑚+𝑟.
Counting positive multiples of 𝑑
then gives
1𝑋𝑋∑𝑚=1𝑤𝑏,𝑑(𝑄𝑚)≤∑𝑟≥1𝑏−𝑟𝑄+𝑟𝑑≤𝑄+2𝑑.
With 𝑄
fixed, dominated convergence identifies the limiting mean of ∑𝑑∈𝐴𝑤𝑏,𝑑(𝑄𝑚) with ∑𝑑∈𝐴𝑀𝑄,𝑏(𝑑).
Now choose 𝑄𝑡 =lcm(1,…,𝑡). For
each fixed 𝑑, eventually 𝑑 ∣𝑄𝑡, so 𝑀𝑄𝑡,𝑏(𝑑) =(𝑏𝑑 −1)−1. The bound
𝑀𝑄𝑡,𝑏(𝑑) ≤1/𝑑 permits a second
dominated-convergence argument:
∑𝑑∈𝐴𝑀𝑄𝑡,𝑏(𝑑)⟶𝑋𝐴(𝑏).
Consequently the limiting
mean of Δ𝑏,𝐴(𝑄𝑡𝑚) tends to
zero. Given 𝜀 >0, first
choose 𝑡 and then a sufficiently
long finite average with mean below 𝜀; one term of that average is
below 𝜀. Under
rationality, choosing 𝜀 <1/𝑞 contradicts the lower
bound above. This proves the assertion. The exact all-base statement,
with hypotheses 𝑏 ≥2, infinitude
of 𝐴, and summability of 𝑎 ↦𝟏𝐴(𝑎)/𝑎, has a kernel-checked
Lean proof.
We increased the observation length with 𝑄𝑡 fixed, and only then increased 𝑡; no independence of divisibility events
was used. At base two and full support, the contribution of exponents
𝑎 >𝑁 alone gives Δ2,ℕ>0(𝑁) >1 −2−𝑁 ≥1/2. Full-support irrationality
therefore uses a different argument; see Theorem 5.4.