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 𝑘 ≥2 [2]. Martin’s stronger theorem supplies the
affine independence[4]; the proportional arguments
𝑛 and 2𝑛 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.
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
𝑒 ≥1, write 𝐹𝑗,𝑟(𝑛) =𝜑(2𝑗𝑛 +𝑟), and let
𝐼𝑒 ={(𝑗,𝑟) :0 ≤𝑗 ≤𝑒, 0 ≤𝑟 <2𝑗}. Retain 𝐹0,0, 𝐹1,0, and the odd-residue sections at
levels 1,…,𝑒; call this
retained index set 𝐽𝑒. The totient
identities reduce every omitted section to 𝐹𝑖 =𝑎𝑖𝐹𝑗(𝑖) for a retained section
𝑗(𝑖) and an integer 𝑎𝑖 ≥0. Thus the retained family
generates the lattice 𝐿𝑒 =∑𝑖∈𝐼𝑒ℤ𝐹𝑖. Its rational independence gives integer
independence as well: every element of 𝐿𝑒 has unique integer coordinates in
these 2𝑒 +1 retained sections.
To describe all integral relations, let 𝐸𝑖 denote the formal coordinate vector
in ℤ𝐼𝑒 and use the
evaluation map
ev𝑒:ℤ𝐼𝑒⟶𝐿𝑒,(𝑐𝑖)⟼∑𝑖∈𝐼𝑒𝑐𝑖𝐹𝑖.
For each omitted index put 𝑅𝑖 =𝐸𝑖 −𝑎𝑖𝐸𝑗(𝑖). Then
ker(ev𝑒)=⨁𝑖∈𝐼𝑒\𝐽𝑒ℤ𝑅𝑖,rankℤker(ev𝑒)=2𝑒−2.
For a vector 𝑐,
subtract ∑𝑖∉𝐽𝑒𝑐𝑖𝑅𝑖.
All omitted coordinates disappear, and the retained coordinate at 𝑗 is 𝑐𝑗 +∑𝑖∉𝐽𝑒,𝑗(𝑖)=𝑗𝑎𝑖𝑐𝑖.
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 𝑐𝑖.
Uniqueness follows because 𝑅𝑖 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
ℚ back to ℤ, 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 𝑘-regular sequences that are not
eventually zero: their growth exponent is the base-𝑘 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 𝑘 ≥2, with relation rank ∑𝑒−1𝑗=1𝑘𝑗. 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 𝑆.
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 𝑛 from 2𝑛; 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 𝑆 ∈ℚ, choose an
integer 𝑣 >0 with 𝑣𝑆 ∈ℤ and put 𝑢𝑁 =𝑣𝑅𝑁, where 𝑅𝑁 =∑𝑗≥1𝜑(𝑁 +𝑗)2−𝑗. Then
𝑢𝑁 ∈ℤ,
𝑢𝑁+1=2𝑢𝑁−𝑣𝜑(𝑁+1),0≤𝑢𝑁≤𝑣(𝑁+2),𝑢𝑁/2𝑁⟶0.
For every
𝑒 ≥0,
dimℚspan{𝑛↦𝑢2𝑗𝑛+𝑟:1≤𝑗≤𝑒, 0≤𝑟<2𝑗} ≥ 2𝑒−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,…,𝑒, not just odd residues or an
unspecified retained subfamily. Indeed, for each odd 𝑟 with 0 <𝑟 <2𝑗, the recurrence gives
𝑣𝜑(2𝑗𝑛+𝑟)=2𝑢2𝑗𝑛+𝑟−1−𝑢2𝑗𝑛+𝑟.
These 2𝑒 −1 totient
sections are independent and belong to the span of the displayed carry
sections after multiplication by 𝑣 ≠0. The rank bound follows. The
boundary condition 𝑢𝑁/2𝑁 →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 𝑈𝑁(𝑖,𝑗) =𝜇((𝑖 +1)/(𝑗 +1)) when (𝑗 +1) ∣(𝑖 +1) and zero otherwise, for
0 ≤𝑖,𝑗 <𝑁. It is lower
triangular with diagonal entries one. Hence det𝑈𝑁 =1 and the map 𝑥 ↦𝑈𝑁𝑥 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 𝑓1,…,𝑓𝑠 with values in a field,
points 𝑛1,…,𝑛𝑠 for which
det(𝑓𝑗(𝑛𝑖)) ≠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.