Plectis

Short paper

Irrationality criteria for Lambert subseries

Summary. The series ∑a∈A(ba−1)−1 is irrational for every integer b≥2 and infinite A contained in E∪V when E satisfies a finite-prime weighted summability condition and V has a summable positive divisor cover. The two classes are incomparable, and their union reaches supports in neither class. A common average over dyadic lengths produces one index with both displacements small. Arbitrary infinite supports at base two remain unresolved.

This paper covers the weighted, divisor-cover and mixed support criteria with complete proofs and method limits; the long paper treats finite denominators, the achievement set and rational membership.

It does not establish the validity of claims tagged Lean, which belongs to the cited kernel-checked source, or a solution to Erdős #257, which remains open.

In this paper

Elementary details used in the proofs

Cyclotomic prime-power fact.

Let b≥2, n≥2, ℓ∣Φn(b) be prime and e=vℓ(bn−1). Then ordℓe⁡(b)=n. We include the 2-adic case. For odd ℓ, put d=ordℓ⁡(b) and s=vℓ(bd−1). The elementary lifting identity vℓ(bdt−1)=s+vℓ(t) follows by factoring a geometric sum when ℓ∤t and by a binomial expansion for a factor ℓ. In the factorisation bn−1=∏r∣nΦr(b), subtracting these valuations over proper divisors gives

vℓ(Φn(b))={sn=d,1n=dℓj, j≥1,0otherwise.

If n=d, no smaller positive exponent gives bm≡1(modℓ). If n=dℓj, the full valuation is e=s+j; the same lifting identity shows that the least exponent giving valuation e is dℓj=n. For ℓ=2, b is odd. Factoring b2t−1 gives

v2(b2j−1)=v2(b−1)+v2(b+1)+j−1(j≥1).

The only possible indices n≥2 are n=2j: v2(Φ2(b))=v2(b+1) and v2(Φ2j(b))=1 for j≥2; all other indices have valuation zero. The displayed identity again makes 2j the least exponent with the full valuation. This proves the fact. Finally Φn(b)>1: each primitive nth root ζ satisfies |b−ζ|>1, and their product is Φn(b).

Exact scalar cover cost.

For t≥1, put z=log2⁡t. The substitution y=2α reduces the infimum defining Ψ(t) to yz/(y−1) on 1<y≤2. Its derivative has the sign of (z−1)y−z. Hence

Ψ(t)={t,1≤t≤4,zz/(z−1)z−1,t>4.

The minimum is at α=1 for t≤4 and in the interior for t>4; the quotient diverges as α↓0. This scalar identity does not supply a converse to the positive-cover criterion.

The cost for a finite set of divisors

For the following finite divisor sets, the lower bound is asymptotically attained. Here K∗(F) is the infimum of the cost K from Section 5 over finite or countable covers of F, their majorants and exponents, and positive weights of total one. A one-set cover therefore has weight 1, without the dyadic index factor in (V). For F(q,P)={qd:d∣∏p∈Pp}, where q≥2 and no p∈P divides q, put S=∑p∈P1/p. If S≥1, then

(13)e(S−1)q≤K∗(F(q,P))≤eSq.

For the lower bound, we condition on q∣n and write fF(n)=2Z. The Chinese remainder theorem gives EZ=S. For z≥0 and v=αlog⁡2>0,

2αz2α−1≥e(z−1)vv≥e(z−1)(z>1);

for 0≤z≤1 the claimed lower bound is nonpositive. Thus Ψ(2z)≥e(z−1); averaging and multiplying by the density 1/q gives the lower bound. For the upper bound, use the one-set cover with z=1/S and α=log2⁡(1+z); its exact positive expansion has cost

1qz∏p∈P(1+z/p)≤eSq.

In particular, 1−1/S≤qK∗(F(q,P))/(eS)≤1. Thus K∗(F(q,P))∼eS/q as S→∞, uniformly over the permitted choices of q and P.

About this paper

Authorship and AI use. Will Cook built and directed the research infrastructure and maintains the public release. He reviewed claims when he could. AI agents did most of the research and drafting. Cook did not independently verify every claim.

Cite and contact. Cite this paper by its title, author and date above, with its PDF; cite the earlier sources it uses for a mathematical result. For software, use the release citation and give the commit used. Contact Will with questions or corrections.

Prefer the manuscript?

Equations typeset from the exact TeX. Rendered from the LaTeX manuscript source with file fingerprint sha256:2676b3e9f6a5ba6f. Its file fingerprint matched the published source record, so the PDF above, the LaTeX, and this page are one manuscript. Redeploying the site regenerates this page from whatever the public repository holds at that moment.