Plectis

Long paper

The Binary Totient Series

Erdős #249 By July 2026; revised 1 October 2026 Authorship, AI use and citation

Summary. The dyadic totient sections through level e≥1 have an explicit rational basis of size 2e+1. Truncating a scaled tail difference produces an integer whose residue certifies nonintegrality when its distances from both endpoints of the residue interval exceed an explicit error bound. The record develops the resulting finite denominator exclusions, equivalent residue criteria, and sufficient exponential-sum estimates. Rational comparison sequences identify the limitations of particular size, parity, rank, and finite-prefix arguments. The short paper supplies the all-base basis theorem; here each conditional result carries the arithmetic hypothesis still needed to apply it. Those hypotheses are not established in the form required to prove irrationality of S=∑ φ(n)2−n.

This paper covers a claim-bounded problem-specific reasoning surface for Erdős #249: selected checked premises, finite certificates, closed routes, surviving obligations, and their exact evidence bands.

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

In this paper

Exact dyadic rank and the limits of a rank argument

At each level the scalar totient identities supply spanning, while affine independence excludes any further relations. This computes the rank, rather than merely proving its unboundedness. The latter already follows from Coons’s nonregularity theorem in every base k≥2 [2]. Martin’s stronger theorem supplies the affine independence[4]; the proportional arguments n and 2n require a separate two-evaluation argument. The all-base proof and integral relation calculation appear in the short paper. We give the dyadic form needed for carry rank here.

Construction.

Theorem 10.7 (Exact dyadic rank and infinite-dimensionality). For every e≥1, the family

{n↦φ(n), n↦φ(2n)} ∪ {n↦φ(2jn+r):1≤j≤e, 0<r<2j, r odd}

is linearly independent over Q. It contains 2e+1 sequences and spans the sections through level e by the zero- and even-residue reductions.

The two zero-residue sections need separate treatment because their arguments n and 2n are proportional. Restrict a proposed relation to n=2m+1, where φ(2n)=φ(n). The odd-residue sections, together with φ(n), now have pairwise nonproportional affine arguments. The evaluation-matrix construction chooses one input per row. At that input a selected primitive form is prime, while each competing form has a prime divisor whose predecessor is divisible by a fixed auxiliary prime. The matrix is diagonal and nonzero on the diagonal modulo that auxiliary prime. The check that the selected prime progression is reduced is part of the construction.

Independence removes the positive-residue coefficients and leaves A+B=0. The same remaining relation at n=2 gives A+2B=0, so both coefficients vanish. This is the dyadic specialisation of the short paper’s proof. The Lean proof is unconditional; it uses the Chinese remainder theorem and Dirichlet’s theorem on primes in arithmetic progressions from Mathlib. Consequently the full infinite family spans an infinite-dimensional Q-space (not_finiteDimensional_span_fullTotientKernel). A separate elementary observation concerns a proposed integer identity. There are no Q,v∈N>0 and A,b∈Z with QvA=b, A≠0, and |b|<Qv: the identity forces |b|=Qv|A|≥Qv (false_of_compressedAdjointCertificate).

The Lean independence theorem is also stated for e=0, but its auxiliary canonical index then still contains the two zero-residue sections φ(n) and φ(2n). It is therefore not the actual truncation through level zero, which consists only of φ(n) and has dimension one.

Integral relations.

Rational independence becomes an integral normal form because every omitted section is an integer multiple of a retained one. Keep the formal coefficient vectors separate from the sequences: a relation is nonzero in the former group and evaluates to zero in the latter. Fix e≥1, write Fj,r(n)=φ(2jn+r), and let Ie={(j,r):0≤j≤e, 0≤r<2j}. Retain F0,0, F1,0, and the odd-residue sections at levels 1,…,e; call this retained index set Je. The totient identities reduce every omitted section to Fi=aiFj(i) for a retained section j(i) and an integer ai≥0. Thus the retained family generates the lattice Le=∑i∈IeZFi. Its rational independence gives integer independence as well: every element of Le has unique integer coordinates in these 2e+1 retained sections.

To describe all integral relations, let Ei denote the formal coordinate vector in ZIe and use the evaluation map

eve:ZIe⟶Le,(ci)⟼∑i∈IeciFi.

For each omitted index put Ri=Ei−aiEj(i). Then

ker⁡(eve)=⨁i∈Ie\JeZRi,rankZ⁡ker⁡(eve)=2e−2.

For a vector c, subtract ∑i∉JeciRi. All omitted coordinates disappear, and the retained coordinate at j is cj+∑i∉Je,j(i)=jaici. The vector is a relation exactly when every retained coordinate is zero. In that case its relation coefficients are already known: they are the original omitted coordinates ci. Uniqueness follows because Ri has coefficient 1 at its own omitted index and 0 at every other one. These unit coefficients explain why no division, and no passage from Q back to Z, is required. The depth-two base-six example in the short paper illustrates these two-term rows. The distinction between the retained basis and the redundant spanning family of all sections already matters for k-regular sequences that are not eventually zero: their growth exponent is the base-k logarithm of the joint spectral radius of their section matrices in a basis, whereas a redundant spanning family gives only an upper bound (Coons [3]). The totient is not regular, so that theorem does not apply; the short paper records how the section maps act on the retained bases from one level to the next.

The integral normal form and the full dyadic rational basis are formally checked in Lean. The formal statement gives the same construction for every integer base k≥2, with relation rank ∑j=1e−1kj. The full dyadic assembly separately gives a basis for the infinite rational span and for its finitely supported rational relations. These finite and infinite statements should not be confused with a claim about infinite sums of relations.

Relation to the series value. Infinite section rank does not imply irrationality of S. The result quantifies the nonregularity already cited above: it gives the rank, the retained sections and their integral relations. Martin’s simultaneous inequalities supply another proof for pairwise nonproportional affine forms with positive slopes [4]. His theorem does not separate n from 2n; the two evaluations above do that. The linked Lean proof is independent of Martin’s theorem.

The same independence argument also bounds the rank of an integral carry. If S∈Q, choose an integer v>0 with vS∈Z and put uN=vRN, where RN=∑j≥1φ(N+j)2−j. Then uN∈Z,

uN+1=2uN−vφ(N+1),0≤uN≤v(N+2),uN/2N⟶0.

For every e≥0,

dimQ⁡span⁡{n↦u2jn+r:1≤j≤e, 0≤r<2j} ≥ 2e−1.

This is the finite family in the linked statement (not_irrational_totientSeries_implies_unbounded_carryRank_unconditional); it contains all carry residues at levels 1,…,e, not just odd residues or an unspecified retained subfamily. Indeed, for each odd r with 0<r<2j, the recurrence gives

vφ(2jn+r)=2u2jn+r−1−u2jn+r.

These 2e−1 totient sections are independent and belong to the span of the displayed carry sections after multiplication by v≠0. The rank bound follows. The boundary condition uN/2N→0 identifies the canonical carry, but is not used in this rank-transfer argument.

A contradiction would require an upper bound on the same carry rank. Rationality and the recurrence supply no such bound: Section 12.6 constructs a rational 5/4 series whose unchanged odd totients force exactly this rank transfer. The changed even coefficients break other totient identities. Hence the comparison rules out a rank argument based only on rationality, linear growth and the recurrence, while leaving arguments using those additional identities untouched.

A separate finite-dimensional calculation concerns the matrix UN(i,j)=μ((i+1)/(j+1)) when (j+1)∣(i+1) and zero otherwise, for 0≤i,j<N. It is lower triangular with diagonal entries one. Hence detUN=1 and the map x↦UNx is injective (incidenceMobius_det_eq_one). This proves injectivity of that particular map, not the impossibility of every finite-dimensional argument for irrationality.

The evaluation-matrix argument. For functions f1,…,fs with values in a field, points n1,…,ns for which det(fj(ni))≠0 prove linear independence: evaluating a relation gives an invertible linear system for its coefficients. This elementary criterion is Proposition 6.24. It does not, by itself, construct the points. Here the totient formula, CRT and Dirichlet’s theorem provide them for nonproportional affine forms, followed by the separate zero-residue argument. Another arithmetic function would require its own argument for nonvanishing of the evaluation determinant.

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:2be13b340f9dafc4. 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.